%------------------------------------------------------------------------------ % File : Princess---230619 % Problem : KRS123+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 : n016.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.78s 1.43s % Output : Proof 6.17s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.13 % Problem : KRS123+1 : TPTP v8.1.2. Released v3.1.0. % 0.00/0.14 % Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s % 0.15/0.35 % Computer : n016.cluster.edu % 0.15/0.35 % Model : x86_64 x86_64 % 0.15/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.15/0.35 % Memory : 8042.1875MB % 0.15/0.35 % OS : Linux 3.10.0-693.el7.x86_64 % 0.15/0.35 % CPULimit : 300 % 0.15/0.35 % WCLimit : 300 % 0.15/0.35 % DateTime : Mon Aug 28 01:34:44 EDT 2023 % 0.15/0.35 % CPUTime : % 0.22/0.62 ________ _____ % 0.22/0.62 ___ __ \_________(_)________________________________ % 0.22/0.62 __ /_/ /_ ___/_ /__ __ \ ___/ _ \_ ___/_ ___/ % 0.22/0.62 _ ____/_ / _ / _ / / / /__ / __/(__ )_(__ ) % 0.22/0.62 /_/ /_/ /_/ /_/ /_/\___/ \___//____/ /____/ % 0.22/0.62 % 0.22/0.62 A Theorem Prover for First-Order Logic modulo Linear Integer Arithmetic % 0.22/0.62 (2023-06-19) % 0.22/0.62 % 0.22/0.62 (c) Philipp Rümmer, 2009-2023 % 0.22/0.62 Contributors: Peter Backeman, Peter Baumgartner, Angelo Brillout, Zafer Esen, % 0.22/0.62 Amanda Stjerna. % 0.22/0.62 Free software under BSD-3-Clause. % 0.22/0.62 % 0.22/0.62 For more information, visit http://www.philipp.ruemmer.org/princess.shtml % 0.22/0.62 % 0.22/0.63 Loading /export/starexec/sandbox/benchmark/theBenchmark.p ... % 0.22/0.64 Running up to 7 provers in parallel. % 0.22/0.66 Prover 1: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1571432423 % 0.22/0.66 Prover 0: Options: +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1042961893 % 0.22/0.66 Prover 2: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMinimalAndEmpty -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1065072994 % 0.22/0.66 Prover 3: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1922548996 % 0.22/0.66 Prover 4: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=1868514696 % 0.22/0.66 Prover 5: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=complete -randomSeed=1259561288 % 0.22/0.66 Prover 6: Options: -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximalOutermost -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1399714365 % 0.22/1.02 Prover 1: Preprocessing ... % 0.22/1.02 Prover 4: Preprocessing ... % 0.22/1.07 Prover 0: Preprocessing ... % 0.22/1.07 Prover 6: Preprocessing ... % 0.22/1.07 Prover 2: Preprocessing ... % 0.22/1.07 Prover 3: Preprocessing ... % 0.22/1.07 Prover 5: Preprocessing ... % 3.52/1.28 Prover 5: Proving ... % 3.52/1.28 Prover 2: Proving ... % 4.18/1.36 Prover 1: Constructing countermodel ... % 4.18/1.38 Prover 4: Constructing countermodel ... % 4.78/1.39 Prover 6: Proving ... % 4.78/1.40 Prover 3: Constructing countermodel ... % 4.78/1.43 Prover 2: proved (781ms) % 4.78/1.43 % 4.78/1.43 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p % 4.78/1.43 % 4.78/1.43 Prover 5: proved (776ms) % 4.78/1.43 % 4.78/1.43 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p % 4.78/1.43 % 4.78/1.43 Prover 3: stopped % 4.78/1.44 Prover 6: stopped % 4.78/1.44 Prover 7: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470 % 4.78/1.44 Prover 8: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089 % 4.78/1.44 Prover 1: gave up % 4.78/1.46 Prover 0: Proving ... % 4.78/1.46 Prover 10: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=919308125 % 4.78/1.46 Prover 0: stopped % 4.78/1.46 Prover 11: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1509710984 % 4.78/1.46 Prover 13: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=complete -randomSeed=1138197443 % 4.78/1.46 Prover 7: Preprocessing ... % 4.78/1.46 Prover 8: Preprocessing ... % 4.78/1.46 Prover 10: Preprocessing ... % 4.78/1.46 Prover 16: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=completeFrugal -randomSeed=-2043353683 % 4.78/1.48 Prover 13: Preprocessing ... % 5.42/1.48 Prover 11: Preprocessing ... % 5.46/1.49 Prover 16: Preprocessing ... % 5.57/1.50 Prover 10: Warning: ignoring some quantifiers % 5.57/1.51 Prover 4: Found proof (size 13) % 5.57/1.51 Prover 4: proved (855ms) % 5.65/1.51 Prover 10: Constructing countermodel ... % 5.65/1.52 Prover 10: stopped % 5.65/1.52 Prover 11: stopped % 5.65/1.52 Prover 7: Warning: ignoring some quantifiers % 5.65/1.52 Prover 13: Warning: ignoring some quantifiers % 5.65/1.52 Prover 7: Constructing countermodel ... % 5.65/1.53 Prover 13: Constructing countermodel ... % 5.65/1.53 Prover 16: Warning: ignoring some quantifiers % 5.65/1.53 Prover 7: stopped % 5.65/1.53 Prover 13: stopped % 5.65/1.53 Prover 16: Constructing countermodel ... % 5.65/1.54 Prover 16: stopped % 5.65/1.56 Prover 8: Warning: ignoring some quantifiers % 5.65/1.57 Prover 8: Constructing countermodel ... % 5.65/1.58 Prover 8: stopped % 5.65/1.58 % 5.65/1.58 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p % 5.65/1.58 % 5.65/1.58 % SZS output start Proof for theBenchmark % 5.65/1.58 Assumptions after simplification: % 5.65/1.58 --------------------------------- % 5.65/1.58 % 5.65/1.58 (axiom_12) % 6.17/1.61 cUnsatisfiable(i2003_11_14_17_22_02803) = 0 & $i(i2003_11_14_17_22_02803) % 6.17/1.61 % 6.17/1.61 (axiom_2) % 6.17/1.62 ! [v0: $i] : ! [v1: int] : (v1 = 0 | ~ (cUnsatisfiable(v0) = v1) | ~ % 6.17/1.62 $i(v0) | ? [v2: any] : ? [v3: any] : (cc(v0) = v2 & cd(v0) = v3 & ( ~ (v3 % 6.17/1.62 = 0) | ~ (v2 = 0)))) & ! [v0: $i] : ! [v1: any] : ( ~ (cc(v0) = v1) % 6.17/1.62 | ~ $i(v0) | ? [v2: any] : ? [v3: any] : (cUnsatisfiable(v0) = v2 & % 6.17/1.62 cd(v0) = v3 & ( ~ (v2 = 0) | (v3 = 0 & v1 = 0)))) & ! [v0: $i] : ! [v1: % 6.17/1.62 any] : ( ~ (cd(v0) = v1) | ~ $i(v0) | ? [v2: any] : ? [v3: any] : (cc(v0) % 6.17/1.62 = v3 & cUnsatisfiable(v0) = v2 & ( ~ (v2 = 0) | (v3 = 0 & v1 = 0)))) & ! % 6.17/1.62 [v0: $i] : ( ~ (cc(v0) = 0) | ~ $i(v0) | ? [v1: any] : ? [v2: any] : % 6.17/1.62 (cUnsatisfiable(v0) = v2 & cd(v0) = v1 & ( ~ (v1 = 0) | v2 = 0))) & ! [v0: % 6.17/1.62 $i] : ( ~ (cUnsatisfiable(v0) = 0) | ~ $i(v0) | (cc(v0) = 0 & cd(v0) = 0)) % 6.17/1.62 & ! [v0: $i] : ( ~ (cd(v0) = 0) | ~ $i(v0) | ? [v1: any] : ? [v2: any] : % 6.17/1.62 (cc(v0) = v1 & cUnsatisfiable(v0) = v2 & ( ~ (v1 = 0) | v2 = 0))) % 6.17/1.62 % 6.17/1.62 (axiom_3) % 6.17/1.62 ! [v0: $i] : ! [v1: int] : (v1 = 0 | ~ (cdxcomp(v0) = v1) | ~ $i(v0) | ? % 6.17/1.62 [v2: int] : ( ~ (v2 = 0) & cc(v0) = v2)) & ! [v0: $i] : ( ~ (cc(v0) = 0) | % 6.17/1.62 ~ $i(v0) | cdxcomp(v0) = 0) % 6.17/1.62 % 6.17/1.62 (axiom_6) % 6.17/1.63 ! [v0: $i] : ! [v1: int] : (v1 = 0 | ~ (cd(v0) = v1) | ~ $i(v0) | ? [v2: % 6.17/1.63 $i] : (ra_Px1(v0, v2) = 0 & $i(v2))) & ! [v0: $i] : ! [v1: $i] : ( ~ % 6.17/1.63 (ra_Px1(v0, v1) = 0) | ~ (cd(v0) = 0) | ~ $i(v1) | ~ $i(v0)) % 6.17/1.63 % 6.17/1.63 (axiom_7) % 6.17/1.63 ! [v0: $i] : ! [v1: int] : ! [v2: $i] : (v1 = 0 | ~ (ra_Px1(v0, v2) = 0) | % 6.17/1.63 ~ (cdxcomp(v0) = v1) | ~ $i(v2) | ~ $i(v0)) & ! [v0: $i] : ( ~ % 6.17/1.63 (cdxcomp(v0) = 0) | ~ $i(v0) | ? [v1: $i] : (ra_Px1(v0, v1) = 0 & $i(v1))) % 6.17/1.63 % 6.17/1.63 Further assumptions not needed in the proof: % 6.17/1.63 -------------------------------------------- % 6.17/1.63 axiom_0, axiom_1, axiom_10, axiom_11, axiom_4, axiom_5, axiom_8, axiom_9 % 6.17/1.63 % 6.17/1.63 Those formulas are unsatisfiable: % 6.17/1.63 --------------------------------- % 6.17/1.63 % 6.17/1.63 Begin of proof % 6.17/1.63 | % 6.17/1.63 | ALPHA: (axiom_2) implies: % 6.17/1.63 | (1) ! [v0: $i] : ( ~ (cUnsatisfiable(v0) = 0) | ~ $i(v0) | (cc(v0) = 0 & % 6.17/1.63 | cd(v0) = 0)) % 6.17/1.63 | % 6.17/1.63 | ALPHA: (axiom_3) implies: % 6.17/1.63 | (2) ! [v0: $i] : ( ~ (cc(v0) = 0) | ~ $i(v0) | cdxcomp(v0) = 0) % 6.17/1.63 | % 6.17/1.63 | ALPHA: (axiom_6) implies: % 6.17/1.64 | (3) ! [v0: $i] : ! [v1: $i] : ( ~ (ra_Px1(v0, v1) = 0) | ~ (cd(v0) = 0) % 6.17/1.64 | | ~ $i(v1) | ~ $i(v0)) % 6.17/1.64 | % 6.17/1.64 | ALPHA: (axiom_7) implies: % 6.17/1.64 | (4) ! [v0: $i] : ( ~ (cdxcomp(v0) = 0) | ~ $i(v0) | ? [v1: $i] : % 6.17/1.64 | (ra_Px1(v0, v1) = 0 & $i(v1))) % 6.17/1.64 | % 6.17/1.64 | ALPHA: (axiom_12) implies: % 6.17/1.64 | (5) $i(i2003_11_14_17_22_02803) % 6.17/1.64 | (6) cUnsatisfiable(i2003_11_14_17_22_02803) = 0 % 6.17/1.64 | % 6.17/1.64 | GROUND_INST: instantiating (1) with i2003_11_14_17_22_02803, simplifying with % 6.17/1.64 | (5), (6) gives: % 6.17/1.64 | (7) cc(i2003_11_14_17_22_02803) = 0 & cd(i2003_11_14_17_22_02803) = 0 % 6.17/1.64 | % 6.17/1.64 | ALPHA: (7) implies: % 6.17/1.64 | (8) cd(i2003_11_14_17_22_02803) = 0 % 6.17/1.64 | (9) cc(i2003_11_14_17_22_02803) = 0 % 6.17/1.64 | % 6.17/1.64 | GROUND_INST: instantiating (2) with i2003_11_14_17_22_02803, simplifying with % 6.17/1.64 | (5), (9) gives: % 6.17/1.64 | (10) cdxcomp(i2003_11_14_17_22_02803) = 0 % 6.17/1.64 | % 6.17/1.64 | GROUND_INST: instantiating (4) with i2003_11_14_17_22_02803, simplifying with % 6.17/1.64 | (5), (10) gives: % 6.17/1.64 | (11) ? [v0: $i] : (ra_Px1(i2003_11_14_17_22_02803, v0) = 0 & $i(v0)) % 6.17/1.64 | % 6.17/1.64 | DELTA: instantiating (11) with fresh symbol all_33_0 gives: % 6.17/1.65 | (12) ra_Px1(i2003_11_14_17_22_02803, all_33_0) = 0 & $i(all_33_0) % 6.17/1.65 | % 6.17/1.65 | ALPHA: (12) implies: % 6.17/1.65 | (13) $i(all_33_0) % 6.17/1.65 | (14) ra_Px1(i2003_11_14_17_22_02803, all_33_0) = 0 % 6.17/1.65 | % 6.17/1.65 | GROUND_INST: instantiating (3) with i2003_11_14_17_22_02803, all_33_0, % 6.17/1.65 | simplifying with (5), (8), (13), (14) gives: % 6.17/1.65 | (15) $false % 6.17/1.65 | % 6.17/1.65 | CLOSE: (15) is inconsistent. % 6.17/1.65 | % 6.17/1.65 End of proof % 6.17/1.65 % SZS output end Proof for theBenchmark % 6.17/1.65 % 6.17/1.65 1024ms %------------------------------------------------------------------------------