%------------------------------------------------------------------------------ % File : Princess---230619 % Problem : KRS119+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 : n007.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:19 EDT 2023 % Result : Unsatisfiable 7.63s 1.86s % Output : Proof 10.08s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.08/0.14 % Problem : KRS119+1 : TPTP v8.1.2. Released v3.1.0. % 0.08/0.15 % Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s % 0.14/0.36 % Computer : n007.cluster.edu % 0.14/0.36 % Model : x86_64 x86_64 % 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.14/0.36 % Memory : 8042.1875MB % 0.14/0.36 % OS : Linux 3.10.0-693.el7.x86_64 % 0.14/0.36 % CPULimit : 300 % 0.14/0.36 % WCLimit : 300 % 0.14/0.36 % DateTime : Mon Aug 28 01:09:42 EDT 2023 % 0.14/0.36 % CPUTime : % 0.21/0.65 ________ _____ % 0.21/0.65 ___ __ \_________(_)________________________________ % 0.21/0.65 __ /_/ /_ ___/_ /__ __ \ ___/ _ \_ ___/_ ___/ % 0.21/0.65 _ ____/_ / _ / _ / / / /__ / __/(__ )_(__ ) % 0.21/0.65 /_/ /_/ /_/ /_/ /_/\___/ \___//____/ /____/ % 0.21/0.65 % 0.21/0.65 A Theorem Prover for First-Order Logic modulo Linear Integer Arithmetic % 0.21/0.65 (2023-06-19) % 0.21/0.65 % 0.21/0.65 (c) Philipp Rümmer, 2009-2023 % 0.21/0.65 Contributors: Peter Backeman, Peter Baumgartner, Angelo Brillout, Zafer Esen, % 0.21/0.65 Amanda Stjerna. % 0.21/0.65 Free software under BSD-3-Clause. % 0.21/0.65 % 0.21/0.65 For more information, visit http://www.philipp.ruemmer.org/princess.shtml % 0.21/0.65 % 0.21/0.65 Loading /export/starexec/sandbox2/benchmark/theBenchmark.p ... % 0.21/0.66 Running up to 7 provers in parallel. % 0.21/0.69 Prover 0: Options: +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1042961893 % 0.21/0.69 Prover 1: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1571432423 % 0.21/0.69 Prover 2: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMinimalAndEmpty -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1065072994 % 0.21/0.69 Prover 3: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1922548996 % 0.21/0.69 Prover 5: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=complete -randomSeed=1259561288 % 0.21/0.69 Prover 4: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=1868514696 % 0.21/0.69 Prover 6: Options: -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximalOutermost -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1399714365 % 3.08/1.15 Prover 4: Preprocessing ... % 3.08/1.15 Prover 1: Preprocessing ... % 3.08/1.19 Prover 6: Preprocessing ... % 3.08/1.19 Prover 5: Preprocessing ... % 3.08/1.19 Prover 2: Preprocessing ... % 3.08/1.19 Prover 0: Preprocessing ... % 3.08/1.19 Prover 3: Preprocessing ... % 5.15/1.51 Prover 2: Proving ... % 5.15/1.52 Prover 5: Proving ... % 5.95/1.59 Prover 6: Proving ... % 5.95/1.62 Prover 3: Constructing countermodel ... % 6.44/1.65 Prover 1: Constructing countermodel ... % 6.44/1.69 Prover 4: Constructing countermodel ... % 6.44/1.71 Prover 0: Proving ... % 7.11/1.78 Prover 3: gave up % 7.11/1.81 Prover 7: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470 % 7.63/1.86 Prover 5: proved (1169ms) % 7.63/1.86 % 7.63/1.86 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p % 7.63/1.86 % 7.63/1.86 Prover 1: gave up % 7.63/1.86 Prover 8: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089 % 7.63/1.86 Prover 2: stopped % 7.63/1.87 Prover 0: stopped % 7.63/1.87 Prover 6: stopped % 7.63/1.87 Prover 10: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=919308125 % 7.63/1.87 Prover 13: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=complete -randomSeed=1138197443 % 7.63/1.87 Prover 11: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1509710984 % 7.63/1.88 Prover 16: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=completeFrugal -randomSeed=-2043353683 % 7.63/1.91 Prover 7: Preprocessing ... % 7.63/1.93 Prover 13: Preprocessing ... % 7.63/1.93 Prover 10: Preprocessing ... % 7.63/1.93 Prover 16: Preprocessing ... % 7.63/1.93 Prover 11: Preprocessing ... % 7.63/1.94 Prover 8: Preprocessing ... % 8.76/2.02 Prover 13: Warning: ignoring some quantifiers % 8.76/2.02 Prover 16: Warning: ignoring some quantifiers % 8.76/2.02 Prover 7: Warning: ignoring some quantifiers % 8.76/2.03 Prover 13: Constructing countermodel ... % 8.94/2.03 Prover 7: Constructing countermodel ... % 8.94/2.03 Prover 10: Warning: ignoring some quantifiers % 8.94/2.04 Prover 10: Constructing countermodel ... % 8.94/2.04 Prover 16: Constructing countermodel ... % 9.66/2.13 Prover 13: Found proof (size 22) % 9.66/2.13 Prover 13: proved (260ms) % 9.66/2.13 Prover 10: stopped % 9.66/2.13 Prover 16: stopped % 9.66/2.13 Prover 7: stopped % 9.66/2.13 Prover 4: stopped % 9.66/2.17 Prover 11: Constructing countermodel ... % 9.66/2.17 Prover 8: Warning: ignoring some quantifiers % 9.66/2.18 Prover 8: Constructing countermodel ... % 9.66/2.18 Prover 11: stopped % 9.66/2.19 Prover 8: stopped % 9.66/2.19 % 9.66/2.19 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p % 9.66/2.19 % 10.08/2.19 % SZS output start Proof for theBenchmark % 10.08/2.20 Assumptions after simplification: % 10.08/2.20 --------------------------------- % 10.08/2.20 % 10.08/2.20 (axiom_10) % 10.08/2.20 ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ( ~ $i(v2) | ~ $i(v1) | ~ $i(v0) | % 10.08/2.20 ~ rr(v1, v2) | ~ rr(v0, v1) | rr(v0, v2)) % 10.08/2.20 % 10.08/2.20 (axiom_11) % 10.08/2.20 $i(i2003_11_14_17_21_44786) & cUnsatisfiable(i2003_11_14_17_21_44786) % 10.08/2.20 % 10.08/2.20 (axiom_2) % 10.08/2.21 ! [v0: $i] : ! [v1: $i] : ( ~ $i(v1) | ~ $i(v0) | ~ rr(v0, v1) | ~ % 10.08/2.21 cp1(v0) | ~ ca_Vx3(v1) | cUnsatisfiable(v0)) & ! [v0: $i] : ( ~ $i(v0) | % 10.08/2.21 ~ cUnsatisfiable(v0) | cp1(v0)) & ! [v0: $i] : ( ~ $i(v0) | ~ % 10.08/2.21 cUnsatisfiable(v0) | ? [v1: $i] : ($i(v1) & rr(v0, v1) & ca_Vx3(v1))) % 10.08/2.21 % 10.08/2.21 (axiom_3) % 10.08/2.21 ! [v0: $i] : ! [v1: $i] : ( ~ $i(v1) | ~ $i(v0) | ~ ra_Px1(v0, v1) | ~ % 10.08/2.21 cp1(v0)) & ? [v0: $i] : ( ~ $i(v0) | cp1(v0) | ? [v1: $i] : ($i(v1) & % 10.08/2.21 ra_Px1(v0, v1))) % 10.08/2.21 % 10.08/2.21 (axiom_4) % 10.08/2.21 ! [v0: $i] : ! [v1: $i] : ( ~ $i(v1) | ~ $i(v0) | ~ ra_Px1(v0, v1) | % 10.08/2.21 cp1xcomp(v0)) & ! [v0: $i] : ( ~ $i(v0) | ~ cp1xcomp(v0) | ? [v1: $i] : % 10.08/2.21 ($i(v1) & ra_Px1(v0, v1))) % 10.08/2.21 % 10.08/2.21 (axiom_5) % 10.08/2.21 ! [v0: $i] : ! [v1: $i] : ( ~ $i(v1) | ~ $i(v0) | ~ rinvR(v0, v1) | ~ % 10.08/2.21 ca_Ax2(v0) | cp1xcomp(v1)) & ! [v0: $i] : ( ~ $i(v0) | ~ cp1(v0) | % 10.08/2.21 ca_Ax2(v0) | ? [v1: $i] : ($i(v1) & rinvR(v0, v1) & ~ cp1xcomp(v1))) & ! % 10.08/2.21 [v0: $i] : ( ~ $i(v0) | ~ ca_Ax2(v0) | cp1(v0)) % 10.08/2.21 % 10.08/2.21 (axiom_6) % 10.08/2.21 ! [v0: $i] : ! [v1: $i] : ( ~ $i(v1) | ~ $i(v0) | ~ rr(v0, v1) | ~ % 10.08/2.21 ca_Ax2(v1) | ca_Vx3(v0)) & ! [v0: $i] : ( ~ $i(v0) | ~ ca_Vx3(v0) | ? % 10.08/2.21 [v1: $i] : ($i(v1) & rr(v0, v1) & ca_Ax2(v1))) % 10.08/2.21 % 10.08/2.21 (axiom_9) % 10.08/2.22 ! [v0: $i] : ! [v1: $i] : ( ~ $i(v1) | ~ $i(v0) | ~ rr(v1, v0) | rinvR(v0, % 10.08/2.22 v1)) & ! [v0: $i] : ! [v1: $i] : ( ~ $i(v1) | ~ $i(v0) | ~ rinvR(v0, % 10.08/2.22 v1) | rr(v1, v0)) % 10.08/2.22 % 10.08/2.22 Further assumptions not needed in the proof: % 10.08/2.22 -------------------------------------------- % 10.08/2.22 axiom_0, axiom_1, axiom_7, axiom_8, cUnsatisfiable_substitution_1, % 10.08/2.22 ca_Ax2_substitution_1, ca_Vx3_substitution_1, cowlNothing_substitution_1, % 10.08/2.22 cowlThing_substitution_1, cp1_substitution_1, cp1xcomp_substitution_1, % 10.08/2.22 ra_Px1_substitution_1, ra_Px1_substitution_2, rf_substitution_1, % 10.08/2.22 rf_substitution_2, rinvF_substitution_1, rinvF_substitution_2, % 10.08/2.22 rinvR_substitution_1, rinvR_substitution_2, rr_substitution_1, % 10.08/2.22 rr_substitution_2, xsd_integer_substitution_1, xsd_string_substitution_1 % 10.08/2.22 % 10.08/2.22 Those formulas are unsatisfiable: % 10.08/2.22 --------------------------------- % 10.08/2.22 % 10.08/2.22 Begin of proof % 10.08/2.22 | % 10.08/2.22 | ALPHA: (axiom_11) implies: % 10.08/2.22 | (1) cUnsatisfiable(i2003_11_14_17_21_44786) % 10.08/2.22 | (2) $i(i2003_11_14_17_21_44786) % 10.08/2.22 | % 10.08/2.22 | ALPHA: (axiom_9) implies: % 10.08/2.22 | (3) ! [v0: $i] : ! [v1: $i] : ( ~ $i(v1) | ~ $i(v0) | ~ rr(v1, v0) | % 10.08/2.22 | rinvR(v0, v1)) % 10.08/2.22 | % 10.08/2.22 | ALPHA: (axiom_6) implies: % 10.08/2.22 | (4) ! [v0: $i] : ( ~ $i(v0) | ~ ca_Vx3(v0) | ? [v1: $i] : ($i(v1) & % 10.08/2.22 | rr(v0, v1) & ca_Ax2(v1))) % 10.08/2.22 | % 10.08/2.22 | ALPHA: (axiom_5) implies: % 10.08/2.22 | (5) ! [v0: $i] : ! [v1: $i] : ( ~ $i(v1) | ~ $i(v0) | ~ rinvR(v0, v1) | % 10.08/2.22 | ~ ca_Ax2(v0) | cp1xcomp(v1)) % 10.08/2.22 | % 10.08/2.22 | ALPHA: (axiom_4) implies: % 10.08/2.22 | (6) ! [v0: $i] : ( ~ $i(v0) | ~ cp1xcomp(v0) | ? [v1: $i] : ($i(v1) & % 10.08/2.22 | ra_Px1(v0, v1))) % 10.08/2.22 | % 10.08/2.22 | ALPHA: (axiom_3) implies: % 10.08/2.22 | (7) ! [v0: $i] : ! [v1: $i] : ( ~ $i(v1) | ~ $i(v0) | ~ ra_Px1(v0, v1) % 10.08/2.22 | | ~ cp1(v0)) % 10.08/2.22 | % 10.08/2.22 | ALPHA: (axiom_2) implies: % 10.08/2.22 | (8) ! [v0: $i] : ( ~ $i(v0) | ~ cUnsatisfiable(v0) | ? [v1: $i] : % 10.08/2.22 | ($i(v1) & rr(v0, v1) & ca_Vx3(v1))) % 10.08/2.23 | (9) ! [v0: $i] : ( ~ $i(v0) | ~ cUnsatisfiable(v0) | cp1(v0)) % 10.08/2.23 | % 10.08/2.23 | GROUND_INST: instantiating (9) with i2003_11_14_17_21_44786, simplifying with % 10.08/2.23 | (1), (2) gives: % 10.08/2.23 | (10) cp1(i2003_11_14_17_21_44786) % 10.08/2.23 | % 10.08/2.23 | GROUND_INST: instantiating (8) with i2003_11_14_17_21_44786, simplifying with % 10.08/2.23 | (1), (2) gives: % 10.08/2.23 | (11) ? [v0: $i] : ($i(v0) & rr(i2003_11_14_17_21_44786, v0) & ca_Vx3(v0)) % 10.08/2.23 | % 10.08/2.23 | DELTA: instantiating (11) with fresh symbol all_23_0 gives: % 10.08/2.23 | (12) $i(all_23_0) & rr(i2003_11_14_17_21_44786, all_23_0) & % 10.08/2.23 | ca_Vx3(all_23_0) % 10.08/2.23 | % 10.08/2.23 | ALPHA: (12) implies: % 10.08/2.23 | (13) ca_Vx3(all_23_0) % 10.08/2.23 | (14) rr(i2003_11_14_17_21_44786, all_23_0) % 10.08/2.23 | (15) $i(all_23_0) % 10.08/2.23 | % 10.08/2.23 | GROUND_INST: instantiating (4) with all_23_0, simplifying with (13), (15) % 10.08/2.23 | gives: % 10.08/2.23 | (16) ? [v0: $i] : ($i(v0) & rr(all_23_0, v0) & ca_Ax2(v0)) % 10.08/2.23 | % 10.08/2.23 | DELTA: instantiating (16) with fresh symbol all_31_0 gives: % 10.08/2.23 | (17) $i(all_31_0) & rr(all_23_0, all_31_0) & ca_Ax2(all_31_0) % 10.08/2.23 | % 10.08/2.23 | ALPHA: (17) implies: % 10.08/2.23 | (18) ca_Ax2(all_31_0) % 10.08/2.23 | (19) rr(all_23_0, all_31_0) % 10.08/2.23 | (20) $i(all_31_0) % 10.08/2.23 | % 10.08/2.23 | GROUND_INST: instantiating (axiom_10) with i2003_11_14_17_21_44786, all_23_0, % 10.08/2.23 | all_31_0, simplifying with (2), (14), (15), (19), (20) gives: % 10.08/2.23 | (21) rr(i2003_11_14_17_21_44786, all_31_0) % 10.08/2.23 | % 10.08/2.23 | GROUND_INST: instantiating (3) with all_31_0, i2003_11_14_17_21_44786, % 10.08/2.23 | simplifying with (2), (20), (21) gives: % 10.08/2.23 | (22) rinvR(all_31_0, i2003_11_14_17_21_44786) % 10.08/2.23 | % 10.08/2.23 | GROUND_INST: instantiating (5) with all_31_0, i2003_11_14_17_21_44786, % 10.08/2.23 | simplifying with (2), (18), (20), (22) gives: % 10.08/2.23 | (23) cp1xcomp(i2003_11_14_17_21_44786) % 10.08/2.23 | % 10.08/2.23 | GROUND_INST: instantiating (6) with i2003_11_14_17_21_44786, simplifying with % 10.08/2.23 | (2), (23) gives: % 10.08/2.23 | (24) ? [v0: $i] : ($i(v0) & ra_Px1(i2003_11_14_17_21_44786, v0)) % 10.08/2.23 | % 10.08/2.23 | DELTA: instantiating (24) with fresh symbol all_61_0 gives: % 10.08/2.23 | (25) $i(all_61_0) & ra_Px1(i2003_11_14_17_21_44786, all_61_0) % 10.08/2.23 | % 10.08/2.23 | ALPHA: (25) implies: % 10.08/2.23 | (26) ra_Px1(i2003_11_14_17_21_44786, all_61_0) % 10.08/2.23 | (27) $i(all_61_0) % 10.08/2.23 | % 10.08/2.23 | GROUND_INST: instantiating (7) with i2003_11_14_17_21_44786, all_61_0, % 10.08/2.23 | simplifying with (2), (10), (26), (27) gives: % 10.08/2.23 | (28) $false % 10.08/2.24 | % 10.08/2.24 | CLOSE: (28) is inconsistent. % 10.08/2.24 | % 10.08/2.24 End of proof % 10.08/2.24 % SZS output end Proof for theBenchmark % 10.08/2.24 % 10.08/2.24 1585ms %------------------------------------------------------------------------------