%------------------------------------------------------------------------------ % File : Princess---230619 % Problem : KRS107+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:16 EDT 2023 % Result : Unsatisfiable 7.53s 1.84s % Output : Proof 10.79s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.12 % Problem : KRS107+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 : n016.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:59:59 EDT 2023 % 0.12/0.34 % CPUTime : % 0.20/0.61 ________ _____ % 0.20/0.61 ___ __ \_________(_)________________________________ % 0.20/0.61 __ /_/ /_ ___/_ /__ __ \ ___/ _ \_ ___/_ ___/ % 0.20/0.61 _ ____/_ / _ / _ / / / /__ / __/(__ )_(__ ) % 0.20/0.61 /_/ /_/ /_/ /_/ /_/\___/ \___//____/ /____/ % 0.20/0.61 % 0.20/0.62 A Theorem Prover for First-Order Logic modulo Linear Integer Arithmetic % 0.20/0.62 (2023-06-19) % 0.20/0.62 % 0.20/0.62 (c) Philipp Rümmer, 2009-2023 % 0.20/0.62 Contributors: Peter Backeman, Peter Baumgartner, Angelo Brillout, Zafer Esen, % 0.20/0.62 Amanda Stjerna. % 0.20/0.62 Free software under BSD-3-Clause. % 0.20/0.62 % 0.20/0.62 For more information, visit http://www.philipp.ruemmer.org/princess.shtml % 0.20/0.62 % 0.20/0.62 Loading /export/starexec/sandbox/benchmark/theBenchmark.p ... % 0.20/0.63 Running up to 7 provers in parallel. % 0.20/0.65 Prover 1: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1571432423 % 0.20/0.65 Prover 0: Options: +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1042961893 % 0.20/0.65 Prover 2: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMinimalAndEmpty -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1065072994 % 0.20/0.65 Prover 3: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1922548996 % 0.20/0.65 Prover 4: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=1868514696 % 0.20/0.65 Prover 5: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=complete -randomSeed=1259561288 % 0.20/0.65 Prover 6: Options: -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximalOutermost -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1399714365 % 2.94/1.16 Prover 1: Preprocessing ... % 2.94/1.16 Prover 4: Preprocessing ... % 2.94/1.20 Prover 0: Preprocessing ... % 2.94/1.20 Prover 6: Preprocessing ... % 2.94/1.20 Prover 5: Preprocessing ... % 2.94/1.20 Prover 3: Preprocessing ... % 2.94/1.20 Prover 2: Preprocessing ... % 6.19/1.62 Prover 2: Proving ... % 6.19/1.62 Prover 5: Proving ... % 7.08/1.75 Prover 1: Constructing countermodel ... % 7.08/1.76 Prover 6: Proving ... % 7.08/1.77 Prover 3: Constructing countermodel ... % 7.53/1.84 Prover 2: proved (1199ms) % 7.53/1.84 % 7.53/1.84 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p % 7.53/1.84 % 7.53/1.84 Prover 5: stopped % 7.53/1.84 Prover 6: stopped % 7.53/1.85 Prover 3: stopped % 7.53/1.85 Prover 7: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470 % 8.04/1.86 Prover 11: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1509710984 % 8.04/1.86 Prover 10: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=919308125 % 8.04/1.86 Prover 4: Constructing countermodel ... % 8.04/1.86 Prover 0: Proving ... % 8.04/1.86 Prover 0: stopped % 8.09/1.88 Prover 8: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089 % 8.09/1.88 Prover 13: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=complete -randomSeed=1138197443 % 8.53/1.97 Prover 1: gave up % 8.53/1.98 Prover 11: Preprocessing ... % 8.53/1.98 Prover 16: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=completeFrugal -randomSeed=-2043353683 % 8.53/1.99 Prover 10: Preprocessing ... % 8.53/2.01 Prover 7: Preprocessing ... % 8.53/2.03 Prover 8: Preprocessing ... % 8.53/2.07 Prover 13: Preprocessing ... % 8.53/2.09 Prover 7: Warning: ignoring some quantifiers % 8.53/2.10 Prover 7: Constructing countermodel ... % 8.53/2.11 Prover 10: Warning: ignoring some quantifiers % 8.53/2.11 Prover 16: Preprocessing ... % 8.53/2.11 Prover 10: Constructing countermodel ... % 8.53/2.16 Prover 13: Warning: ignoring some quantifiers % 8.53/2.18 Prover 13: Constructing countermodel ... % 10.00/2.19 Prover 16: Warning: ignoring some quantifiers % 10.00/2.20 Prover 11: Constructing countermodel ... % 10.00/2.21 Prover 16: Constructing countermodel ... % 10.00/2.21 Prover 10: Found proof (size 26) % 10.00/2.21 Prover 10: proved (360ms) % 10.00/2.21 Prover 4: stopped % 10.00/2.21 Prover 13: stopped % 10.00/2.21 Prover 11: stopped % 10.00/2.22 Prover 16: stopped % 10.00/2.22 Prover 8: Warning: ignoring some quantifiers % 10.00/2.22 Prover 7: Found proof (size 29) % 10.00/2.22 Prover 7: proved (377ms) % 10.00/2.23 Prover 8: Constructing countermodel ... % 10.00/2.24 Prover 8: stopped % 10.00/2.24 % 10.00/2.24 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p % 10.00/2.24 % 10.00/2.25 % SZS output start Proof for theBenchmark % 10.00/2.25 Assumptions after simplification: % 10.00/2.25 --------------------------------- % 10.00/2.25 % 10.00/2.25 (axiom_12) % 10.79/2.25 $i(i2003_11_14_17_21_01226) & cUnsatisfiable(i2003_11_14_17_21_01226) % 10.79/2.25 % 10.79/2.25 (axiom_17) % 10.79/2.26 ! [v0: $i] : ! [v1: $i] : ( ~ $i(v1) | ~ $i(v0) | ~ rrx4(v0, v1) | rrx(v0, % 10.79/2.26 v1)) % 10.79/2.26 % 10.79/2.26 (axiom_2) % 10.79/2.26 ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ( ~ $i(v2) | ~ $i(v1) | ~ $i(v0) | % 10.79/2.26 ~ rrx4(v0, v1) | ~ rrx3(v0, v2) | ~ cc2(v1) | ~ cc1(v2) | ~ ca_Cx1(v0) % 10.79/2.26 | cUnsatisfiable(v0)) & ! [v0: $i] : ( ~ $i(v0) | ~ cUnsatisfiable(v0) | % 10.79/2.26 ca_Cx1(v0)) & ! [v0: $i] : ( ~ $i(v0) | ~ cUnsatisfiable(v0) | ? [v1: $i] % 10.79/2.26 : ($i(v1) & rrx4(v0, v1) & cc2(v1))) & ! [v0: $i] : ( ~ $i(v0) | ~ % 10.79/2.26 cUnsatisfiable(v0) | ? [v1: $i] : ($i(v1) & rrx3(v0, v1) & cc1(v1))) % 10.79/2.26 % 10.79/2.26 (axiom_20) % 10.79/2.26 ! [v0: $i] : ! [v1: $i] : ( ~ $i(v1) | ~ $i(v0) | ~ rrx3(v0, v1) | rrx(v0, % 10.79/2.26 v1)) % 10.79/2.26 % 10.79/2.26 (axiom_3) % 10.79/2.26 ! [v0: $i] : ( ~ $i(v0) | ~ cc2(v0) | ~ cc1(v0) | ca_Ax2(v0)) & ! [v0: $i] % 10.79/2.26 : ( ~ $i(v0) | ~ ca_Ax2(v0) | cc2(v0)) & ! [v0: $i] : ( ~ $i(v0) | ~ % 10.79/2.26 ca_Ax2(v0) | cc1(v0)) % 10.79/2.26 % 10.79/2.26 (axiom_4) % 10.79/2.27 ! [v0: $i] : ! [v1: $i] : ( ~ $i(v1) | ~ $i(v0) | ~ ra_Px1(v0, v1) | % 10.79/2.27 ca_Cx1(v0)) & ! [v0: $i] : ( ~ $i(v0) | ~ ca_Cx1(v0) | ? [v1: $i] : % 10.79/2.27 ($i(v1) & ra_Px1(v0, v1))) % 10.79/2.27 % 10.79/2.27 (axiom_5) % 10.79/2.27 ! [v0: $i] : ! [v1: $i] : ( ~ $i(v1) | ~ $i(v0) | ~ rrx3(v0, v1) | ~ % 10.79/2.27 ca_Ax2(v1) | ca_Cx1xcomp(v0)) & ! [v0: $i] : ( ~ $i(v0) | ~ % 10.79/2.27 ca_Cx1xcomp(v0) | ? [v1: $i] : ($i(v1) & rrx3(v0, v1) & ca_Ax2(v1))) % 10.79/2.27 % 10.79/2.27 (axiom_6) % 10.79/2.27 ! [v0: $i] : ! [v1: $i] : ( ~ $i(v1) | ~ $i(v0) | ~ ra_Px1(v0, v1) | ~ % 10.79/2.27 ca_Cx1xcomp(v0)) & ? [v0: $i] : ( ~ $i(v0) | ca_Cx1xcomp(v0) | ? [v1: $i] % 10.79/2.27 : ($i(v1) & ra_Px1(v0, v1))) % 10.79/2.27 % 10.79/2.27 (axiom_7) % 10.79/2.27 ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : (v2 = v1 | ~ $i(v2) | ~ $i(v1) | % 10.79/2.27 ~ $i(v0) | ~ rrx(v0, v2) | ~ rrx(v0, v1)) % 10.79/2.27 % 10.79/2.27 Further assumptions not needed in the proof: % 10.79/2.27 -------------------------------------------- % 10.79/2.27 axiom_0, axiom_1, axiom_10, axiom_11, axiom_13, axiom_14, axiom_15, axiom_16, % 10.79/2.27 axiom_18, axiom_19, axiom_8, axiom_9, cUnsatisfiable_substitution_1, % 10.79/2.27 ca_Ax2_substitution_1, ca_Cx1_substitution_1, ca_Cx1xcomp_substitution_1, % 10.79/2.27 cc1_substitution_1, cc2_substitution_1, cowlNothing_substitution_1, % 10.79/2.27 cowlThing_substitution_1, ra_Px1_substitution_1, ra_Px1_substitution_2, % 10.79/2.27 rrx1_substitution_1, rrx1_substitution_2, rrx1a_substitution_1, % 10.79/2.27 rrx1a_substitution_2, rrx2_substitution_1, rrx2_substitution_2, % 10.79/2.27 rrx2a_substitution_1, rrx2a_substitution_2, rrx3_substitution_1, % 10.79/2.27 rrx3_substitution_2, rrx3a_substitution_1, rrx3a_substitution_2, % 10.79/2.27 rrx4_substitution_1, rrx4_substitution_2, rrx4a_substitution_1, % 10.79/2.27 rrx4a_substitution_2, rrx_substitution_1, rrx_substitution_2, % 10.79/2.27 rrxa_substitution_1, rrxa_substitution_2, xsd_integer_substitution_1, % 10.79/2.27 xsd_string_substitution_1 % 10.79/2.27 % 10.79/2.27 Those formulas are unsatisfiable: % 10.79/2.27 --------------------------------- % 10.79/2.27 % 10.79/2.27 Begin of proof % 10.79/2.27 | % 10.79/2.27 | ALPHA: (axiom_12) implies: % 10.79/2.27 | (1) cUnsatisfiable(i2003_11_14_17_21_01226) % 10.79/2.27 | (2) $i(i2003_11_14_17_21_01226) % 10.79/2.27 | % 10.79/2.27 | ALPHA: (axiom_6) implies: % 10.79/2.27 | (3) ! [v0: $i] : ! [v1: $i] : ( ~ $i(v1) | ~ $i(v0) | ~ ra_Px1(v0, v1) % 10.79/2.27 | | ~ ca_Cx1xcomp(v0)) % 10.79/2.27 | % 10.79/2.27 | ALPHA: (axiom_5) implies: % 10.79/2.27 | (4) ! [v0: $i] : ! [v1: $i] : ( ~ $i(v1) | ~ $i(v0) | ~ rrx3(v0, v1) | % 10.79/2.27 | ~ ca_Ax2(v1) | ca_Cx1xcomp(v0)) % 10.79/2.27 | % 10.79/2.27 | ALPHA: (axiom_4) implies: % 10.79/2.28 | (5) ! [v0: $i] : ( ~ $i(v0) | ~ ca_Cx1(v0) | ? [v1: $i] : ($i(v1) & % 10.79/2.28 | ra_Px1(v0, v1))) % 10.79/2.28 | % 10.79/2.28 | ALPHA: (axiom_3) implies: % 10.79/2.28 | (6) ! [v0: $i] : ( ~ $i(v0) | ~ cc2(v0) | ~ cc1(v0) | ca_Ax2(v0)) % 10.79/2.28 | % 10.79/2.28 | ALPHA: (axiom_2) implies: % 10.79/2.28 | (7) ! [v0: $i] : ( ~ $i(v0) | ~ cUnsatisfiable(v0) | ? [v1: $i] : % 10.79/2.28 | ($i(v1) & rrx3(v0, v1) & cc1(v1))) % 10.79/2.28 | (8) ! [v0: $i] : ( ~ $i(v0) | ~ cUnsatisfiable(v0) | ? [v1: $i] : % 10.79/2.28 | ($i(v1) & rrx4(v0, v1) & cc2(v1))) % 10.79/2.28 | (9) ! [v0: $i] : ( ~ $i(v0) | ~ cUnsatisfiable(v0) | ca_Cx1(v0)) % 10.79/2.28 | % 10.79/2.28 | GROUND_INST: instantiating (9) with i2003_11_14_17_21_01226, simplifying with % 10.79/2.28 | (1), (2) gives: % 10.79/2.28 | (10) ca_Cx1(i2003_11_14_17_21_01226) % 10.79/2.28 | % 10.79/2.28 | GROUND_INST: instantiating (8) with i2003_11_14_17_21_01226, simplifying with % 10.79/2.28 | (1), (2) gives: % 10.79/2.28 | (11) ? [v0: $i] : ($i(v0) & rrx4(i2003_11_14_17_21_01226, v0) & cc2(v0)) % 10.79/2.28 | % 10.79/2.28 | GROUND_INST: instantiating (7) with i2003_11_14_17_21_01226, simplifying with % 10.79/2.28 | (1), (2) gives: % 10.79/2.28 | (12) ? [v0: $i] : ($i(v0) & rrx3(i2003_11_14_17_21_01226, v0) & cc1(v0)) % 10.79/2.28 | % 10.79/2.28 | DELTA: instantiating (11) with fresh symbol all_32_0 gives: % 10.79/2.28 | (13) $i(all_32_0) & rrx4(i2003_11_14_17_21_01226, all_32_0) & cc2(all_32_0) % 10.79/2.28 | % 10.79/2.28 | ALPHA: (13) implies: % 10.79/2.28 | (14) cc2(all_32_0) % 10.79/2.28 | (15) rrx4(i2003_11_14_17_21_01226, all_32_0) % 10.79/2.28 | (16) $i(all_32_0) % 10.79/2.28 | % 10.79/2.28 | DELTA: instantiating (12) with fresh symbol all_34_0 gives: % 10.79/2.28 | (17) $i(all_34_0) & rrx3(i2003_11_14_17_21_01226, all_34_0) & cc1(all_34_0) % 10.79/2.28 | % 10.79/2.28 | ALPHA: (17) implies: % 10.79/2.28 | (18) cc1(all_34_0) % 10.79/2.28 | (19) rrx3(i2003_11_14_17_21_01226, all_34_0) % 10.79/2.28 | (20) $i(all_34_0) % 10.79/2.28 | % 10.79/2.28 | GROUND_INST: instantiating (5) with i2003_11_14_17_21_01226, simplifying with % 10.79/2.28 | (2), (10) gives: % 10.79/2.28 | (21) ? [v0: $i] : ($i(v0) & ra_Px1(i2003_11_14_17_21_01226, v0)) % 10.79/2.28 | % 10.79/2.28 | GROUND_INST: instantiating (axiom_20) with i2003_11_14_17_21_01226, all_34_0, % 10.79/2.28 | simplifying with (2), (19), (20) gives: % 10.79/2.28 | (22) rrx(i2003_11_14_17_21_01226, all_34_0) % 10.79/2.28 | % 10.79/2.28 | GROUND_INST: instantiating (axiom_17) with i2003_11_14_17_21_01226, all_32_0, % 10.79/2.28 | simplifying with (2), (15), (16) gives: % 10.79/2.28 | (23) rrx(i2003_11_14_17_21_01226, all_32_0) % 10.79/2.28 | % 10.79/2.28 | DELTA: instantiating (21) with fresh symbol all_42_0 gives: % 10.79/2.29 | (24) $i(all_42_0) & ra_Px1(i2003_11_14_17_21_01226, all_42_0) % 10.79/2.29 | % 10.79/2.29 | ALPHA: (24) implies: % 10.79/2.29 | (25) ra_Px1(i2003_11_14_17_21_01226, all_42_0) % 10.79/2.29 | (26) $i(all_42_0) % 10.79/2.29 | % 10.79/2.29 | GROUND_INST: instantiating (axiom_7) with i2003_11_14_17_21_01226, all_32_0, % 10.79/2.29 | all_34_0, simplifying with (2), (16), (20), (22), (23) gives: % 10.79/2.29 | (27) all_34_0 = all_32_0 % 10.79/2.29 | % 10.79/2.29 | REDUCE: (19), (27) imply: % 10.79/2.29 | (28) rrx3(i2003_11_14_17_21_01226, all_32_0) % 10.79/2.29 | % 10.79/2.29 | REDUCE: (18), (27) imply: % 10.79/2.29 | (29) cc1(all_32_0) % 10.79/2.29 | % 10.79/2.29 | GROUND_INST: instantiating (6) with all_32_0, simplifying with (14), (16), % 10.79/2.29 | (29) gives: % 10.79/2.29 | (30) ca_Ax2(all_32_0) % 10.79/2.29 | % 10.79/2.29 | GROUND_INST: instantiating (4) with i2003_11_14_17_21_01226, all_32_0, % 10.79/2.29 | simplifying with (2), (16), (28), (30) gives: % 10.79/2.29 | (31) ca_Cx1xcomp(i2003_11_14_17_21_01226) % 10.79/2.29 | % 10.79/2.29 | GROUND_INST: instantiating (3) with i2003_11_14_17_21_01226, all_42_0, % 10.79/2.29 | simplifying with (2), (25), (26), (31) gives: % 10.79/2.29 | (32) $false % 10.79/2.29 | % 10.79/2.29 | CLOSE: (32) is inconsistent. % 10.79/2.29 | % 10.79/2.29 End of proof % 10.79/2.29 % SZS output end Proof for theBenchmark % 10.79/2.29 % 10.79/2.29 1674ms %------------------------------------------------------------------------------