%------------------------------------------------------------------------------ % File : Princess---230619 % Problem : KRS128+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 : n003.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:21 EDT 2023 % Result : Unsatisfiable 5.65s 1.55s % Output : Proof 7.31s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.12 % Problem : KRS128+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.12/0.34 % Computer : n003.cluster.edu % 0.12/0.34 % Model : x86_64 x86_64 % 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.12/0.34 % Memory : 8042.1875MB % 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64 % 0.12/0.34 % CPULimit : 300 % 0.12/0.34 % WCLimit : 300 % 0.12/0.34 % DateTime : Mon Aug 28 01:52:55 EDT 2023 % 0.12/0.34 % CPUTime : % 0.19/0.61 ________ _____ % 0.19/0.61 ___ __ \_________(_)________________________________ % 0.19/0.61 __ /_/ /_ ___/_ /__ __ \ ___/ _ \_ ___/_ ___/ % 0.19/0.61 _ ____/_ / _ / _ / / / /__ / __/(__ )_(__ ) % 0.19/0.61 /_/ /_/ /_/ /_/ /_/\___/ \___//____/ /____/ % 0.19/0.61 % 0.19/0.61 A Theorem Prover for First-Order Logic modulo Linear Integer Arithmetic % 0.19/0.61 (2023-06-19) % 0.19/0.61 % 0.19/0.61 (c) Philipp Rümmer, 2009-2023 % 0.19/0.61 Contributors: Peter Backeman, Peter Baumgartner, Angelo Brillout, Zafer Esen, % 0.19/0.61 Amanda Stjerna. % 0.19/0.61 Free software under BSD-3-Clause. % 0.19/0.61 % 0.19/0.61 For more information, visit http://www.philipp.ruemmer.org/princess.shtml % 0.19/0.61 % 0.19/0.61 Loading /export/starexec/sandbox2/benchmark/theBenchmark.p ... % 0.19/0.62 Running up to 7 provers in parallel. % 0.19/0.64 Prover 0: Options: +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1042961893 % 0.19/0.64 Prover 1: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1571432423 % 0.19/0.64 Prover 2: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMinimalAndEmpty -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1065072994 % 0.19/0.64 Prover 4: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=1868514696 % 0.19/0.64 Prover 3: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1922548996 % 0.19/0.64 Prover 5: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=complete -randomSeed=1259561288 % 0.19/0.64 Prover 6: Options: -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximalOutermost -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1399714365 % 2.14/0.98 Prover 1: Preprocessing ... % 2.14/0.98 Prover 4: Preprocessing ... % 2.14/1.02 Prover 5: Preprocessing ... % 2.14/1.02 Prover 3: Preprocessing ... % 2.14/1.02 Prover 2: Preprocessing ... % 2.14/1.03 Prover 0: Preprocessing ... % 2.14/1.03 Prover 6: Preprocessing ... % 4.19/1.26 Prover 5: Proving ... % 4.19/1.28 Prover 2: Proving ... % 4.19/1.37 Prover 6: Proving ... % 4.19/1.39 Prover 1: Constructing countermodel ... % 4.19/1.39 Prover 4: Constructing countermodel ... % 4.19/1.40 Prover 0: Proving ... % 4.19/1.40 Prover 3: Constructing countermodel ... % 5.65/1.55 Prover 2: proved (910ms) % 5.65/1.55 Prover 5: proved (906ms) % 5.65/1.55 % 5.65/1.55 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p % 5.65/1.55 % 5.65/1.55 % 5.65/1.55 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p % 5.65/1.55 % 5.65/1.55 Prover 0: stopped % 5.65/1.55 Prover 6: stopped % 5.65/1.56 Prover 1: gave up % 6.07/1.56 Prover 3: gave up % 6.07/1.57 Prover 7: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470 % 6.07/1.57 Prover 8: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089 % 6.07/1.57 Prover 10: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=919308125 % 6.07/1.57 Prover 13: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=complete -randomSeed=1138197443 % 6.07/1.57 Prover 11: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1509710984 % 6.07/1.57 Prover 10: Preprocessing ... % 6.07/1.58 Prover 16: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=completeFrugal -randomSeed=-2043353683 % 6.07/1.58 Prover 8: Preprocessing ... % 6.07/1.58 Prover 7: Preprocessing ... % 6.07/1.59 Prover 11: Preprocessing ... % 6.07/1.60 Prover 13: Preprocessing ... % 6.07/1.60 Prover 16: Preprocessing ... % 6.07/1.63 Prover 7: Warning: ignoring some quantifiers % 6.07/1.64 Prover 7: Constructing countermodel ... % 6.07/1.65 Prover 10: Warning: ignoring some quantifiers % 6.07/1.65 Prover 13: Warning: ignoring some quantifiers % 6.76/1.66 Prover 10: Constructing countermodel ... % 6.76/1.66 Prover 13: Constructing countermodel ... % 6.76/1.67 Prover 16: Warning: ignoring some quantifiers % 6.76/1.68 Prover 16: Constructing countermodel ... % 7.03/1.70 Prover 7: Found proof (size 16) % 7.03/1.70 Prover 7: proved (145ms) % 7.03/1.70 Prover 10: stopped % 7.03/1.70 Prover 13: stopped % 7.03/1.70 Prover 16: stopped % 7.03/1.70 Prover 4: Found proof (size 32) % 7.03/1.70 Prover 4: proved (1064ms) % 7.03/1.72 Prover 8: Warning: ignoring some quantifiers % 7.03/1.72 Prover 11: Constructing countermodel ... % 7.03/1.73 Prover 8: Constructing countermodel ... % 7.03/1.73 Prover 11: stopped % 7.29/1.74 Prover 8: stopped % 7.29/1.74 % 7.29/1.74 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p % 7.29/1.74 % 7.31/1.74 % SZS output start Proof for theBenchmark % 7.31/1.74 Assumptions after simplification: % 7.31/1.74 --------------------------------- % 7.31/1.74 % 7.31/1.74 (axiom_10) % 7.31/1.75 ! [v0: $i] : ( ~ $i(v0) | ~ ca_Cx4xcomp(v0) | cd(v0)) & ! [v0: $i] : ( ~ % 7.31/1.75 $i(v0) | ~ ca_Cx4xcomp(v0) | cexcomp(v0)) & ! [v0: $i] : ( ~ $i(v0) | ~ % 7.31/1.75 cd(v0) | ~ cexcomp(v0) | ca_Cx4xcomp(v0)) % 7.31/1.75 % 7.31/1.75 (axiom_11) % 7.31/1.75 $i(i2003_11_14_17_22_31584) & cUnsatisfiable(i2003_11_14_17_22_31584) % 7.31/1.75 % 7.31/1.75 (axiom_2) % 7.31/1.75 ! [v0: $i] : ! [v1: $i] : ( ~ $i(v1) | ~ $i(v0) | ~ cexcomp(v1) | ~ % 7.31/1.75 rr(v0, v1) | cUnsatisfiable(v0) | ? [v2: $i] : ($i(v2) & ((rr(v0, v2) & ~ % 7.31/1.75 ca_Cx4(v2)) | (rr(v0, v2) & ~ cd(v2))))) & ! [v0: $i] : ! [v1: $i] % 7.31/1.75 : ( ~ $i(v1) | ~ $i(v0) | ~ rr(v0, v1) | ~ cUnsatisfiable(v0) | ca_Cx4(v1)) % 7.31/1.75 & ! [v0: $i] : ! [v1: $i] : ( ~ $i(v1) | ~ $i(v0) | ~ rr(v0, v1) | ~ % 7.31/1.75 cUnsatisfiable(v0) | cd(v1)) & ! [v0: $i] : ( ~ $i(v0) | ~ % 7.31/1.75 cUnsatisfiable(v0) | ? [v1: $i] : ($i(v1) & cexcomp(v1) & rr(v0, v1))) % 7.31/1.75 % 7.31/1.75 (axiom_8) % 7.31/1.75 ! [v0: $i] : ! [v1: $i] : ( ~ $i(v1) | ~ $i(v0) | ~ ra_Px4(v0, v1) | % 7.31/1.75 ca_Cx4(v0)) & ! [v0: $i] : ( ~ $i(v0) | ~ ca_Cx4(v0) | ? [v1: $i] : % 7.31/1.75 ($i(v1) & ra_Px4(v0, v1))) % 7.31/1.75 % 7.31/1.75 (axiom_9) % 7.31/1.76 ! [v0: $i] : ! [v1: $i] : ( ~ $i(v1) | ~ $i(v0) | ~ ca_Cx4xcomp(v0) | ~ % 7.31/1.76 ra_Px4(v0, v1)) & ? [v0: $i] : ( ~ $i(v0) | ca_Cx4xcomp(v0) | ? [v1: $i] : % 7.31/1.76 ($i(v1) & ra_Px4(v0, v1))) % 7.31/1.76 % 7.31/1.76 Further assumptions not needed in the proof: % 7.31/1.76 -------------------------------------------- % 7.31/1.76 axiom_0, axiom_1, axiom_3, axiom_4, axiom_5, axiom_6, axiom_7 % 7.31/1.76 % 7.31/1.76 Those formulas are unsatisfiable: % 7.31/1.76 --------------------------------- % 7.31/1.76 % 7.31/1.76 Begin of proof % 7.31/1.76 | % 7.31/1.76 | ALPHA: (axiom_11) implies: % 7.31/1.76 | (1) cUnsatisfiable(i2003_11_14_17_22_31584) % 7.31/1.76 | (2) $i(i2003_11_14_17_22_31584) % 7.31/1.76 | % 7.31/1.76 | ALPHA: (axiom_10) implies: % 7.31/1.76 | (3) ! [v0: $i] : ( ~ $i(v0) | ~ cd(v0) | ~ cexcomp(v0) | % 7.31/1.76 | ca_Cx4xcomp(v0)) % 7.31/1.76 | % 7.31/1.76 | ALPHA: (axiom_9) implies: % 7.31/1.76 | (4) ! [v0: $i] : ! [v1: $i] : ( ~ $i(v1) | ~ $i(v0) | ~ ca_Cx4xcomp(v0) % 7.31/1.76 | | ~ ra_Px4(v0, v1)) % 7.31/1.76 | % 7.31/1.76 | ALPHA: (axiom_8) implies: % 7.31/1.76 | (5) ! [v0: $i] : ( ~ $i(v0) | ~ ca_Cx4(v0) | ? [v1: $i] : ($i(v1) & % 7.31/1.76 | ra_Px4(v0, v1))) % 7.31/1.76 | % 7.31/1.76 | ALPHA: (axiom_2) implies: % 7.31/1.76 | (6) ! [v0: $i] : ( ~ $i(v0) | ~ cUnsatisfiable(v0) | ? [v1: $i] : % 7.31/1.76 | ($i(v1) & cexcomp(v1) & rr(v0, v1))) % 7.31/1.76 | (7) ! [v0: $i] : ! [v1: $i] : ( ~ $i(v1) | ~ $i(v0) | ~ rr(v0, v1) | ~ % 7.31/1.76 | cUnsatisfiable(v0) | cd(v1)) % 7.31/1.76 | (8) ! [v0: $i] : ! [v1: $i] : ( ~ $i(v1) | ~ $i(v0) | ~ rr(v0, v1) | ~ % 7.31/1.76 | cUnsatisfiable(v0) | ca_Cx4(v1)) % 7.31/1.76 | % 7.31/1.77 | GROUND_INST: instantiating (6) with i2003_11_14_17_22_31584, simplifying with % 7.31/1.77 | (1), (2) gives: % 7.31/1.77 | (9) ? [v0: $i] : ($i(v0) & cexcomp(v0) & rr(i2003_11_14_17_22_31584, v0)) % 7.31/1.77 | % 7.31/1.77 | DELTA: instantiating (9) with fresh symbol all_24_0 gives: % 7.31/1.77 | (10) $i(all_24_0) & cexcomp(all_24_0) & rr(i2003_11_14_17_22_31584, % 7.31/1.77 | all_24_0) % 7.31/1.77 | % 7.31/1.77 | ALPHA: (10) implies: % 7.31/1.77 | (11) rr(i2003_11_14_17_22_31584, all_24_0) % 7.31/1.77 | (12) cexcomp(all_24_0) % 7.31/1.77 | (13) $i(all_24_0) % 7.31/1.77 | % 7.31/1.77 | GROUND_INST: instantiating (8) with i2003_11_14_17_22_31584, all_24_0, % 7.31/1.77 | simplifying with (1), (2), (11), (13) gives: % 7.31/1.77 | (14) ca_Cx4(all_24_0) % 7.31/1.77 | % 7.31/1.77 | GROUND_INST: instantiating (7) with i2003_11_14_17_22_31584, all_24_0, % 7.31/1.77 | simplifying with (1), (2), (11), (13) gives: % 7.31/1.77 | (15) cd(all_24_0) % 7.31/1.77 | % 7.31/1.77 | GROUND_INST: instantiating (3) with all_24_0, simplifying with (12), (13), % 7.31/1.77 | (15) gives: % 7.31/1.77 | (16) ca_Cx4xcomp(all_24_0) % 7.31/1.77 | % 7.31/1.77 | GROUND_INST: instantiating (5) with all_24_0, simplifying with (13), (14) % 7.31/1.77 | gives: % 7.31/1.77 | (17) ? [v0: $i] : ($i(v0) & ra_Px4(all_24_0, v0)) % 7.31/1.77 | % 7.31/1.77 | DELTA: instantiating (17) with fresh symbol all_42_0 gives: % 7.31/1.77 | (18) $i(all_42_0) & ra_Px4(all_24_0, all_42_0) % 7.31/1.77 | % 7.31/1.77 | ALPHA: (18) implies: % 7.31/1.77 | (19) ra_Px4(all_24_0, all_42_0) % 7.31/1.77 | (20) $i(all_42_0) % 7.31/1.77 | % 7.31/1.77 | GROUND_INST: instantiating (4) with all_24_0, all_42_0, simplifying with (13), % 7.31/1.77 | (16), (19), (20) gives: % 7.31/1.77 | (21) $false % 7.31/1.77 | % 7.31/1.77 | CLOSE: (21) is inconsistent. % 7.31/1.77 | % 7.31/1.77 End of proof % 7.31/1.77 % SZS output end Proof for theBenchmark % 7.31/1.77 % 7.31/1.77 1164ms %------------------------------------------------------------------------------