%------------------------------------------------------------------------------ % File : Princess---230619 % Problem : KRS068+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 : n008.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:07 EDT 2023 % Result : Unsatisfiable 4.33s 1.21s % Output : Proof 5.07s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.13 % Problem : KRS068+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 : n008.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 01:51:17 EDT 2023 % 0.14/0.35 % CPUTime : % 0.20/0.53 ________ _____ % 0.20/0.53 ___ __ \_________(_)________________________________ % 0.20/0.53 __ /_/ /_ ___/_ /__ __ \ ___/ _ \_ ___/_ ___/ % 0.20/0.53 _ ____/_ / _ / _ / / / /__ / __/(__ )_(__ ) % 0.20/0.53 /_/ /_/ /_/ /_/ /_/\___/ \___//____/ /____/ % 0.20/0.53 % 0.20/0.53 A Theorem Prover for First-Order Logic modulo Linear Integer Arithmetic % 0.20/0.53 (2023-06-19) % 0.20/0.53 % 0.20/0.53 (c) Philipp Rümmer, 2009-2023 % 0.20/0.53 Contributors: Peter Backeman, Peter Baumgartner, Angelo Brillout, Zafer Esen, % 0.20/0.53 Amanda Stjerna. % 0.20/0.53 Free software under BSD-3-Clause. % 0.20/0.53 % 0.20/0.53 For more information, visit http://www.philipp.ruemmer.org/princess.shtml % 0.20/0.53 % 0.20/0.53 Loading /export/starexec/sandbox2/benchmark/theBenchmark.p ... % 0.20/0.54 Running up to 7 provers in parallel. % 0.20/0.56 Prover 0: Options: +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1042961893 % 0.20/0.56 Prover 1: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1571432423 % 0.20/0.56 Prover 2: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMinimalAndEmpty -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1065072994 % 0.20/0.56 Prover 3: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1922548996 % 0.20/0.56 Prover 4: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=1868514696 % 0.20/0.56 Prover 5: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=complete -randomSeed=1259561288 % 0.20/0.56 Prover 6: Options: -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximalOutermost -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1399714365 % 1.90/0.87 Prover 1: Preprocessing ... % 1.90/0.87 Prover 4: Preprocessing ... % 2.24/0.92 Prover 6: Preprocessing ... % 2.24/0.92 Prover 3: Preprocessing ... % 2.24/0.92 Prover 5: Preprocessing ... % 2.24/0.92 Prover 0: Preprocessing ... % 2.24/0.92 Prover 2: Preprocessing ... % 2.46/1.03 Prover 2: Proving ... % 2.46/1.03 Prover 5: Proving ... % 3.11/1.07 Prover 1: Constructing countermodel ... % 3.11/1.07 Prover 3: Constructing countermodel ... % 3.11/1.08 Prover 6: Proving ... % 3.11/1.08 Prover 4: Constructing countermodel ... % 3.48/1.11 Prover 0: Proving ... % 3.48/1.15 Prover 3: gave up % 3.94/1.16 Prover 1: gave up % 3.94/1.16 Prover 7: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470 % 3.94/1.16 Prover 8: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089 % 4.03/1.19 Prover 8: Preprocessing ... % 4.03/1.20 Prover 7: Preprocessing ... % 4.03/1.21 Prover 0: proved (662ms) % 4.33/1.21 % 4.33/1.21 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p % 4.33/1.21 % 4.33/1.21 Prover 2: stopped % 4.33/1.21 Prover 10: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=919308125 % 4.33/1.21 Prover 5: stopped % 4.33/1.23 Prover 6: stopped % 4.33/1.24 Prover 11: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1509710984 % 4.33/1.24 Prover 7: Warning: ignoring some quantifiers % 4.33/1.24 Prover 7: Constructing countermodel ... % 4.33/1.24 Prover 10: Preprocessing ... % 4.33/1.24 Prover 13: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=complete -randomSeed=1138197443 % 4.33/1.24 Prover 16: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=completeFrugal -randomSeed=-2043353683 % 4.33/1.24 Prover 13: Preprocessing ... % 4.33/1.24 Prover 11: Preprocessing ... % 4.58/1.25 Prover 10: Warning: ignoring some quantifiers % 4.58/1.25 Prover 10: Constructing countermodel ... % 4.58/1.25 Prover 16: Preprocessing ... % 4.58/1.27 Prover 4: Found proof (size 20) % 4.58/1.27 Prover 4: proved (717ms) % 4.58/1.27 Prover 10: stopped % 4.58/1.27 Prover 8: Warning: ignoring some quantifiers % 4.58/1.27 Prover 7: stopped % 4.58/1.27 Prover 13: Warning: ignoring some quantifiers % 4.58/1.27 Prover 13: Constructing countermodel ... % 4.58/1.28 Prover 8: Constructing countermodel ... % 4.58/1.28 Prover 11: stopped % 4.58/1.28 Prover 16: Warning: ignoring some quantifiers % 4.58/1.28 Prover 13: stopped % 4.58/1.28 Prover 16: Constructing countermodel ... % 4.58/1.28 Prover 8: stopped % 4.58/1.28 Prover 16: stopped % 4.58/1.28 % 4.58/1.28 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p % 4.58/1.28 % 4.58/1.29 % SZS output start Proof for theBenchmark % 4.58/1.29 Assumptions after simplification: % 4.58/1.29 --------------------------------- % 4.58/1.29 % 4.58/1.29 (axiom_2) % 4.58/1.32 ! [v0: $i] : ! [v1: int] : (v1 = 0 | ~ (cc(v0) = v1) | ~ $i(v0) | ? [v2: % 4.58/1.32 int] : ( ~ (v2 = 0) & cUnsatisfiable(v0) = v2)) & ! [v0: $i] : ( ~ % 4.58/1.32 (cUnsatisfiable(v0) = 0) | ~ $i(v0) | cc(v0) = 0) % 4.58/1.32 % 4.58/1.32 (axiom_3) % 4.58/1.32 ! [v0: $i] : ( ~ (cd(v0) = 0) | ~ $i(v0) | ? [v1: int] : ( ~ (v1 = 0) & % 4.58/1.32 cUnsatisfiable(v0) = v1)) & ! [v0: $i] : ( ~ (cUnsatisfiable(v0) = 0) | % 4.58/1.32 ~ $i(v0) | ? [v1: int] : ( ~ (v1 = 0) & cd(v0) = v1)) % 4.58/1.32 % 4.58/1.32 (axiom_4) % 4.58/1.33 ! [v0: $i] : ! [v1: $i] : ! [v2: int] : (v2 = 0 | ~ (cc(v1) = v2) | ~ % 4.58/1.33 (cc(v0) = 0) | ~ $i(v1) | ~ $i(v0) | ? [v3: int] : ( ~ (v3 = 0) & rr(v0, % 4.58/1.33 v1) = v3)) & ! [v0: $i] : ! [v1: $i] : ( ~ (rr(v0, v1) = 0) | ~ % 4.58/1.33 (cc(v0) = 0) | ~ $i(v1) | ~ $i(v0) | cc(v1) = 0) % 4.58/1.33 % 4.58/1.33 (axiom_5) % 4.58/1.33 cUnsatisfiable(i2003_11_14_17_18_23845) = 0 & $i(i2003_11_14_17_18_23845) % 4.58/1.33 % 4.58/1.33 (axiom_6) % 4.58/1.33 ! [v0: $i] : ! [v1: int] : (v1 = 0 | ~ (cd(v0) = v1) | ~ $i(v0) | ? [v2: % 4.58/1.33 $i] : ? [v3: int] : ( ~ (v3 = 0) & rr(v0, v2) = 0 & cc(v2) = v3 & % 4.58/1.33 $i(v2))) % 4.58/1.33 % 4.58/1.33 (function-axioms) % 5.07/1.33 ! [v0: MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] : ! % 5.07/1.33 [v3: $i] : (v1 = v0 | ~ (rr(v3, v2) = v1) | ~ (rr(v3, v2) = v0)) & ! [v0: % 5.07/1.33 MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] : (v1 = v0 | % 5.07/1.33 ~ (cd(v2) = v1) | ~ (cd(v2) = v0)) & ! [v0: MultipleValueBool] : ! [v1: % 5.07/1.34 MultipleValueBool] : ! [v2: $i] : (v1 = v0 | ~ (cc(v2) = v1) | ~ (cc(v2) % 5.07/1.34 = v0)) & ! [v0: MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: % 5.07/1.34 $i] : (v1 = v0 | ~ (cUnsatisfiable(v2) = v1) | ~ (cUnsatisfiable(v2) = % 5.07/1.34 v0)) & ! [v0: MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: % 5.07/1.34 $i] : (v1 = v0 | ~ (xsd_integer(v2) = v1) | ~ (xsd_integer(v2) = v0)) & ! % 5.07/1.34 [v0: MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] : (v1 = v0 % 5.07/1.34 | ~ (xsd_string(v2) = v1) | ~ (xsd_string(v2) = v0)) & ! [v0: % 5.07/1.34 MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] : (v1 = v0 | % 5.07/1.34 ~ (cowlNothing(v2) = v1) | ~ (cowlNothing(v2) = v0)) & ! [v0: % 5.07/1.34 MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] : (v1 = v0 | % 5.07/1.34 ~ (cowlThing(v2) = v1) | ~ (cowlThing(v2) = v0)) % 5.07/1.34 % 5.07/1.34 Further assumptions not needed in the proof: % 5.07/1.34 -------------------------------------------- % 5.07/1.34 axiom_0, axiom_1 % 5.07/1.34 % 5.07/1.34 Those formulas are unsatisfiable: % 5.07/1.34 --------------------------------- % 5.07/1.34 % 5.07/1.34 Begin of proof % 5.07/1.34 | % 5.07/1.34 | ALPHA: (axiom_2) implies: % 5.07/1.34 | (1) ! [v0: $i] : ( ~ (cUnsatisfiable(v0) = 0) | ~ $i(v0) | cc(v0) = 0) % 5.07/1.34 | % 5.07/1.34 | ALPHA: (axiom_3) implies: % 5.07/1.34 | (2) ! [v0: $i] : ( ~ (cUnsatisfiable(v0) = 0) | ~ $i(v0) | ? [v1: int] : % 5.07/1.34 | ( ~ (v1 = 0) & cd(v0) = v1)) % 5.07/1.34 | % 5.07/1.34 | ALPHA: (axiom_4) implies: % 5.07/1.34 | (3) ! [v0: $i] : ! [v1: $i] : ( ~ (rr(v0, v1) = 0) | ~ (cc(v0) = 0) | ~ % 5.07/1.34 | $i(v1) | ~ $i(v0) | cc(v1) = 0) % 5.07/1.34 | % 5.07/1.34 | ALPHA: (axiom_5) implies: % 5.07/1.34 | (4) $i(i2003_11_14_17_18_23845) % 5.07/1.34 | (5) cUnsatisfiable(i2003_11_14_17_18_23845) = 0 % 5.07/1.34 | % 5.07/1.34 | ALPHA: (function-axioms) implies: % 5.07/1.34 | (6) ! [v0: MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] : % 5.07/1.34 | (v1 = v0 | ~ (cc(v2) = v1) | ~ (cc(v2) = v0)) % 5.07/1.34 | % 5.07/1.35 | GROUND_INST: instantiating (1) with i2003_11_14_17_18_23845, simplifying with % 5.07/1.35 | (4), (5) gives: % 5.07/1.35 | (7) cc(i2003_11_14_17_18_23845) = 0 % 5.07/1.35 | % 5.07/1.35 | GROUND_INST: instantiating (2) with i2003_11_14_17_18_23845, simplifying with % 5.07/1.35 | (4), (5) gives: % 5.07/1.35 | (8) ? [v0: int] : ( ~ (v0 = 0) & cd(i2003_11_14_17_18_23845) = v0) % 5.07/1.35 | % 5.07/1.35 | DELTA: instantiating (8) with fresh symbol all_16_0 gives: % 5.07/1.35 | (9) ~ (all_16_0 = 0) & cd(i2003_11_14_17_18_23845) = all_16_0 % 5.07/1.35 | % 5.07/1.35 | ALPHA: (9) implies: % 5.07/1.35 | (10) ~ (all_16_0 = 0) % 5.07/1.35 | (11) cd(i2003_11_14_17_18_23845) = all_16_0 % 5.07/1.35 | % 5.07/1.35 | GROUND_INST: instantiating (axiom_6) with i2003_11_14_17_18_23845, all_16_0, % 5.07/1.35 | simplifying with (4), (11) gives: % 5.07/1.35 | (12) all_16_0 = 0 | ? [v0: $i] : ? [v1: int] : ( ~ (v1 = 0) & % 5.07/1.35 | rr(i2003_11_14_17_18_23845, v0) = 0 & cc(v0) = v1 & $i(v0)) % 5.07/1.35 | % 5.07/1.35 | BETA: splitting (12) gives: % 5.07/1.35 | % 5.07/1.35 | Case 1: % 5.07/1.35 | | % 5.07/1.35 | | (13) all_16_0 = 0 % 5.07/1.35 | | % 5.07/1.35 | | REDUCE: (10), (13) imply: % 5.07/1.35 | | (14) $false % 5.07/1.35 | | % 5.07/1.35 | | CLOSE: (14) is inconsistent. % 5.07/1.35 | | % 5.07/1.35 | Case 2: % 5.07/1.35 | | % 5.07/1.35 | | (15) ? [v0: $i] : ? [v1: int] : ( ~ (v1 = 0) & % 5.07/1.35 | | rr(i2003_11_14_17_18_23845, v0) = 0 & cc(v0) = v1 & $i(v0)) % 5.07/1.35 | | % 5.07/1.35 | | DELTA: instantiating (15) with fresh symbols all_25_0, all_25_1 gives: % 5.07/1.36 | | (16) ~ (all_25_0 = 0) & rr(i2003_11_14_17_18_23845, all_25_1) = 0 & % 5.07/1.36 | | cc(all_25_1) = all_25_0 & $i(all_25_1) % 5.07/1.36 | | % 5.07/1.36 | | ALPHA: (16) implies: % 5.07/1.36 | | (17) ~ (all_25_0 = 0) % 5.07/1.36 | | (18) $i(all_25_1) % 5.07/1.36 | | (19) cc(all_25_1) = all_25_0 % 5.07/1.36 | | (20) rr(i2003_11_14_17_18_23845, all_25_1) = 0 % 5.07/1.36 | | % 5.07/1.36 | | GROUND_INST: instantiating (3) with i2003_11_14_17_18_23845, all_25_1, % 5.07/1.36 | | simplifying with (4), (7), (18), (20) gives: % 5.07/1.36 | | (21) cc(all_25_1) = 0 % 5.07/1.36 | | % 5.07/1.36 | | GROUND_INST: instantiating (6) with all_25_0, 0, all_25_1, simplifying with % 5.07/1.36 | | (19), (21) gives: % 5.07/1.36 | | (22) all_25_0 = 0 % 5.07/1.36 | | % 5.07/1.36 | | REDUCE: (17), (22) imply: % 5.07/1.36 | | (23) $false % 5.07/1.36 | | % 5.07/1.36 | | CLOSE: (23) is inconsistent. % 5.07/1.36 | | % 5.07/1.36 | End of split % 5.07/1.36 | % 5.07/1.36 End of proof % 5.07/1.36 % SZS output end Proof for theBenchmark % 5.07/1.36 % 5.07/1.36 829ms %------------------------------------------------------------------------------