%------------------------------------------------------------------------------ % File : Princess---230619 % Problem : KRS126+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 : n018.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:20 EDT 2023 % Result : Unsatisfiable 4.88s 1.39s % Output : Proof 6.22s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.13 % Problem : KRS126+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.13/0.33 % Computer : n018.cluster.edu % 0.13/0.33 % Model : x86_64 x86_64 % 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.13/0.33 % Memory : 8042.1875MB % 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64 % 0.13/0.33 % CPULimit : 300 % 0.13/0.33 % WCLimit : 300 % 0.13/0.33 % DateTime : Mon Aug 28 02:32:47 EDT 2023 % 0.13/0.34 % CPUTime : % 0.19/0.60 ________ _____ % 0.19/0.60 ___ __ \_________(_)________________________________ % 0.19/0.60 __ /_/ /_ ___/_ /__ __ \ ___/ _ \_ ___/_ ___/ % 0.19/0.60 _ ____/_ / _ / _ / / / /__ / __/(__ )_(__ ) % 0.19/0.60 /_/ /_/ /_/ /_/ /_/\___/ \___//____/ /____/ % 0.19/0.60 % 0.19/0.60 A Theorem Prover for First-Order Logic modulo Linear Integer Arithmetic % 0.19/0.60 (2023-06-19) % 0.19/0.60 % 0.19/0.60 (c) Philipp Rümmer, 2009-2023 % 0.19/0.60 Contributors: Peter Backeman, Peter Baumgartner, Angelo Brillout, Zafer Esen, % 0.19/0.60 Amanda Stjerna. % 0.19/0.60 Free software under BSD-3-Clause. % 0.19/0.60 % 0.19/0.60 For more information, visit http://www.philipp.ruemmer.org/princess.shtml % 0.19/0.60 % 0.19/0.60 Loading /export/starexec/sandbox2/benchmark/theBenchmark.p ... % 0.19/0.61 Running up to 7 provers in parallel. % 0.19/0.63 Prover 0: Options: +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1042961893 % 0.19/0.63 Prover 1: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1571432423 % 0.19/0.63 Prover 2: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMinimalAndEmpty -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1065072994 % 0.19/0.63 Prover 3: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1922548996 % 0.19/0.63 Prover 4: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=1868514696 % 0.19/0.63 Prover 5: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=complete -randomSeed=1259561288 % 0.19/0.63 Prover 6: Options: -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximalOutermost -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1399714365 % 2.16/1.01 Prover 1: Preprocessing ... % 2.16/1.01 Prover 4: Preprocessing ... % 2.16/1.06 Prover 6: Preprocessing ... % 2.16/1.06 Prover 3: Preprocessing ... % 2.16/1.06 Prover 5: Preprocessing ... % 2.16/1.06 Prover 2: Preprocessing ... % 2.16/1.06 Prover 0: Preprocessing ... % 3.66/1.23 Prover 5: Proving ... % 3.66/1.24 Prover 2: Proving ... % 4.22/1.30 Prover 4: Constructing countermodel ... % 4.22/1.30 Prover 6: Proving ... % 4.22/1.30 Prover 3: Constructing countermodel ... % 4.22/1.30 Prover 1: Constructing countermodel ... % 4.22/1.34 Prover 0: Proving ... % 4.22/1.37 Prover 1: gave up % 4.22/1.37 Prover 7: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470 % 4.22/1.37 Prover 6: gave up % 4.88/1.38 Prover 3: gave up % 4.88/1.38 Prover 9: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allMinimal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1423531889 % 4.88/1.38 Prover 5: proved (755ms) % 4.88/1.39 % 4.88/1.39 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p % 4.88/1.39 % 4.88/1.39 Prover 2: proved (761ms) % 4.88/1.39 % 4.88/1.39 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p % 4.88/1.39 % 4.88/1.39 Prover 8: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089 % 4.88/1.39 Prover 0: stopped % 4.88/1.40 Prover 10: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=919308125 % 4.88/1.40 Prover 7: Preprocessing ... % 4.88/1.40 Prover 11: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1509710984 % 4.88/1.40 Prover 4: Found proof (size 12) % 4.88/1.40 Prover 4: proved (771ms) % 4.88/1.40 Prover 8: Preprocessing ... % 4.88/1.40 Prover 13: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=complete -randomSeed=1138197443 % 4.88/1.41 Prover 9: Preprocessing ... % 4.88/1.42 Prover 11: Preprocessing ... % 4.88/1.42 Prover 13: Preprocessing ... % 4.88/1.43 Prover 10: Preprocessing ... % 4.88/1.46 Prover 11: stopped % 4.88/1.46 Prover 7: Warning: ignoring some quantifiers % 4.88/1.47 Prover 10: Warning: ignoring some quantifiers % 4.88/1.47 Prover 13: Warning: ignoring some quantifiers % 4.88/1.47 Prover 7: Constructing countermodel ... % 4.88/1.48 Prover 13: Constructing countermodel ... % 4.88/1.48 Prover 10: Constructing countermodel ... % 4.88/1.48 Prover 7: stopped % 4.88/1.48 Prover 13: stopped % 4.88/1.48 Prover 10: stopped % 5.80/1.52 Prover 8: Warning: ignoring some quantifiers % 5.83/1.53 Prover 8: Constructing countermodel ... % 5.83/1.54 Prover 8: stopped % 5.83/1.54 Prover 9: Constructing countermodel ... % 5.83/1.54 Prover 9: stopped % 5.83/1.54 % 5.83/1.54 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p % 5.83/1.54 % 5.83/1.55 % SZS output start Proof for theBenchmark % 5.83/1.55 Assumptions after simplification: % 5.83/1.55 --------------------------------- % 5.83/1.55 % 5.83/1.55 (axiom_11) % 5.83/1.58 cUnsatisfiable(i2003_11_14_17_22_23554) = 0 & $i(i2003_11_14_17_22_23554) % 5.83/1.58 % 5.83/1.58 (axiom_2) % 5.83/1.58 ! [v0: $i] : ! [v1: int] : (v1 = 0 | ~ (cd1xcomp(v0) = v1) | ~ $i(v0) | ? % 5.83/1.58 [v2: int] : ( ~ (v2 = 0) & cUnsatisfiable(v0) = v2)) & ! [v0: $i] : ( ~ % 5.83/1.58 (cUnsatisfiable(v0) = 0) | ~ $i(v0) | cd1xcomp(v0) = 0) % 5.83/1.58 % 5.83/1.58 (axiom_3) % 5.83/1.58 ! [v0: $i] : ! [v1: int] : (v1 = 0 | ~ (cd1(v0) = v1) | ~ $i(v0) | ? [v2: % 5.83/1.58 int] : ( ~ (v2 = 0) & cUnsatisfiable(v0) = v2)) & ! [v0: $i] : ( ~ % 5.83/1.58 (cUnsatisfiable(v0) = 0) | ~ $i(v0) | cd1(v0) = 0) % 5.83/1.58 % 5.83/1.58 (axiom_7) % 5.83/1.59 ! [v0: $i] : ! [v1: int] : ! [v2: $i] : (v1 = 0 | ~ (ra_Px2(v0, v2) = 0) | % 5.83/1.59 ~ (cd1(v0) = v1) | ~ $i(v2) | ~ $i(v0)) & ! [v0: $i] : ( ~ (cd1(v0) = 0) % 5.83/1.59 | ~ $i(v0) | ? [v1: $i] : (ra_Px2(v0, v1) = 0 & $i(v1))) % 5.83/1.59 % 5.83/1.59 (axiom_8) % 5.83/1.59 ! [v0: $i] : ! [v1: int] : (v1 = 0 | ~ (cd1xcomp(v0) = v1) | ~ $i(v0) | ? % 5.83/1.59 [v2: $i] : (ra_Px2(v0, v2) = 0 & $i(v2))) & ! [v0: $i] : ! [v1: $i] : ( ~ % 5.83/1.59 (ra_Px2(v0, v1) = 0) | ~ (cd1xcomp(v0) = 0) | ~ $i(v1) | ~ $i(v0)) % 5.83/1.59 % 5.83/1.59 Further assumptions not needed in the proof: % 5.83/1.59 -------------------------------------------- % 5.83/1.59 axiom_0, axiom_1, axiom_10, axiom_4, axiom_5, axiom_6, axiom_9 % 5.83/1.59 % 5.83/1.59 Those formulas are unsatisfiable: % 5.83/1.59 --------------------------------- % 5.83/1.59 % 5.83/1.59 Begin of proof % 5.83/1.59 | % 5.83/1.59 | ALPHA: (axiom_2) implies: % 5.83/1.59 | (1) ! [v0: $i] : ( ~ (cUnsatisfiable(v0) = 0) | ~ $i(v0) | cd1xcomp(v0) = % 5.83/1.59 | 0) % 5.83/1.59 | % 5.83/1.59 | ALPHA: (axiom_3) implies: % 5.83/1.59 | (2) ! [v0: $i] : ( ~ (cUnsatisfiable(v0) = 0) | ~ $i(v0) | cd1(v0) = 0) % 5.83/1.59 | % 5.83/1.59 | ALPHA: (axiom_7) implies: % 5.83/1.59 | (3) ! [v0: $i] : ( ~ (cd1(v0) = 0) | ~ $i(v0) | ? [v1: $i] : (ra_Px2(v0, % 5.83/1.59 | v1) = 0 & $i(v1))) % 5.83/1.59 | % 5.83/1.59 | ALPHA: (axiom_8) implies: % 5.83/1.60 | (4) ! [v0: $i] : ! [v1: $i] : ( ~ (ra_Px2(v0, v1) = 0) | ~ (cd1xcomp(v0) % 5.83/1.60 | = 0) | ~ $i(v1) | ~ $i(v0)) % 5.83/1.60 | % 5.83/1.60 | ALPHA: (axiom_11) implies: % 5.83/1.60 | (5) $i(i2003_11_14_17_22_23554) % 5.83/1.60 | (6) cUnsatisfiable(i2003_11_14_17_22_23554) = 0 % 5.83/1.60 | % 6.22/1.60 | GROUND_INST: instantiating (2) with i2003_11_14_17_22_23554, simplifying with % 6.22/1.60 | (5), (6) gives: % 6.22/1.60 | (7) cd1(i2003_11_14_17_22_23554) = 0 % 6.22/1.60 | % 6.22/1.60 | GROUND_INST: instantiating (1) with i2003_11_14_17_22_23554, simplifying with % 6.22/1.60 | (5), (6) gives: % 6.22/1.60 | (8) cd1xcomp(i2003_11_14_17_22_23554) = 0 % 6.22/1.60 | % 6.22/1.60 | GROUND_INST: instantiating (3) with i2003_11_14_17_22_23554, simplifying with % 6.22/1.60 | (5), (7) gives: % 6.22/1.60 | (9) ? [v0: $i] : (ra_Px2(i2003_11_14_17_22_23554, v0) = 0 & $i(v0)) % 6.22/1.60 | % 6.22/1.60 | DELTA: instantiating (9) with fresh symbol all_26_0 gives: % 6.22/1.60 | (10) ra_Px2(i2003_11_14_17_22_23554, all_26_0) = 0 & $i(all_26_0) % 6.22/1.60 | % 6.22/1.60 | ALPHA: (10) implies: % 6.22/1.60 | (11) $i(all_26_0) % 6.22/1.60 | (12) ra_Px2(i2003_11_14_17_22_23554, all_26_0) = 0 % 6.22/1.60 | % 6.22/1.60 | GROUND_INST: instantiating (4) with i2003_11_14_17_22_23554, all_26_0, % 6.22/1.60 | simplifying with (5), (8), (11), (12) gives: % 6.22/1.60 | (13) $false % 6.22/1.60 | % 6.22/1.61 | CLOSE: (13) is inconsistent. % 6.22/1.61 | % 6.22/1.61 End of proof % 6.22/1.61 % SZS output end Proof for theBenchmark % 6.22/1.61 % 6.22/1.61 1004ms %------------------------------------------------------------------------------