%------------------------------------------------------------------------------ % File : Princess---230619 % Problem : KRS108+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 : n015.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 8.66s 1.96s % Output : Proof 12.49s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.12 % Problem : KRS108+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.14/0.35 % Computer : n015.cluster.edu % 0.14/0.35 % Model : x86_64 x86_64 % 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.14/0.35 % Memory : 8042.1875MB % 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64 % 0.14/0.35 % CPULimit : 300 % 0.14/0.35 % WCLimit : 300 % 0.14/0.35 % DateTime : Mon Aug 28 01:58:24 EDT 2023 % 0.14/0.35 % CPUTime : % 0.21/0.61 ________ _____ % 0.21/0.61 ___ __ \_________(_)________________________________ % 0.21/0.61 __ /_/ /_ ___/_ /__ __ \ ___/ _ \_ ___/_ ___/ % 0.21/0.61 _ ____/_ / _ / _ / / / /__ / __/(__ )_(__ ) % 0.21/0.61 /_/ /_/ /_/ /_/ /_/\___/ \___//____/ /____/ % 0.21/0.61 % 0.21/0.61 A Theorem Prover for First-Order Logic modulo Linear Integer Arithmetic % 0.21/0.61 (2023-06-19) % 0.21/0.61 % 0.21/0.61 (c) Philipp Rümmer, 2009-2023 % 0.21/0.61 Contributors: Peter Backeman, Peter Baumgartner, Angelo Brillout, Zafer Esen, % 0.21/0.61 Amanda Stjerna. % 0.21/0.61 Free software under BSD-3-Clause. % 0.21/0.61 % 0.21/0.61 For more information, visit http://www.philipp.ruemmer.org/princess.shtml % 0.21/0.61 % 0.21/0.61 Loading /export/starexec/sandbox2/benchmark/theBenchmark.p ... % 0.21/0.63 Running up to 7 provers in parallel. % 0.21/0.64 Prover 1: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1571432423 % 0.21/0.64 Prover 0: Options: +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1042961893 % 0.21/0.64 Prover 3: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1922548996 % 0.21/0.64 Prover 2: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMinimalAndEmpty -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1065072994 % 0.21/0.64 Prover 4: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=1868514696 % 0.21/0.64 Prover 5: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=complete -randomSeed=1259561288 % 0.21/0.64 Prover 6: Options: -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximalOutermost -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1399714365 % 3.31/1.19 Prover 4: Preprocessing ... % 3.31/1.19 Prover 1: Preprocessing ... % 3.31/1.22 Prover 2: Preprocessing ... % 3.31/1.22 Prover 6: Preprocessing ... % 3.31/1.22 Prover 5: Preprocessing ... % 3.31/1.23 Prover 0: Preprocessing ... % 3.31/1.23 Prover 3: Preprocessing ... % 7.14/1.73 Prover 5: Proving ... % 7.14/1.73 Prover 2: Proving ... % 8.00/1.86 Prover 6: Proving ... % 8.00/1.87 Prover 3: Constructing countermodel ... % 8.24/1.89 Prover 1: Constructing countermodel ... % 8.24/1.92 Prover 4: Constructing countermodel ... % 8.66/1.96 Prover 2: proved (1319ms) % 8.66/1.96 % 8.66/1.96 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p % 8.66/1.96 % 8.66/1.96 Prover 6: stopped % 8.66/1.96 Prover 5: stopped % 8.66/1.97 Prover 8: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089 % 8.66/1.97 Prover 3: stopped % 8.66/1.99 Prover 7: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470 % 8.66/1.99 Prover 10: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=919308125 % 8.66/1.99 Prover 11: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1509710984 % 8.66/2.06 Prover 8: Preprocessing ... % 8.66/2.08 Prover 7: Preprocessing ... % 8.66/2.09 Prover 0: Proving ... % 9.01/2.10 Prover 10: Preprocessing ... % 9.01/2.10 Prover 0: stopped % 9.01/2.12 Prover 11: Preprocessing ... % 9.01/2.12 Prover 1: gave up % 9.01/2.12 Prover 16: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=completeFrugal -randomSeed=-2043353683 % 9.01/2.12 Prover 13: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=complete -randomSeed=1138197443 % 10.39/2.18 Prover 7: Warning: ignoring some quantifiers % 10.39/2.20 Prover 7: Constructing countermodel ... % 10.74/2.22 Prover 16: Preprocessing ... % 10.74/2.23 Prover 13: Preprocessing ... % 10.94/2.28 Prover 10: Warning: ignoring some quantifiers % 10.94/2.30 Prover 10: Constructing countermodel ... % 10.94/2.31 Prover 7: Found proof (size 25) % 10.94/2.31 Prover 7: proved (346ms) % 10.94/2.31 Prover 4: stopped % 10.94/2.32 Prover 10: stopped % 11.60/2.35 Prover 16: Warning: ignoring some quantifiers % 11.60/2.36 Prover 13: Warning: ignoring some quantifiers % 11.60/2.36 Prover 16: Constructing countermodel ... % 11.60/2.37 Prover 13: Constructing countermodel ... % 11.60/2.37 Prover 16: stopped % 11.60/2.38 Prover 13: stopped % 12.03/2.39 Prover 8: Warning: ignoring some quantifiers % 12.03/2.40 Prover 8: Constructing countermodel ... % 12.03/2.41 Prover 8: stopped % 12.03/2.43 Prover 11: Constructing countermodel ... % 12.03/2.45 Prover 11: stopped % 12.03/2.45 % 12.03/2.45 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p % 12.03/2.45 % 12.42/2.45 % SZS output start Proof for theBenchmark % 12.42/2.46 Assumptions after simplification: % 12.42/2.46 --------------------------------- % 12.42/2.46 % 12.42/2.46 (axiom_15) % 12.42/2.47 ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : (v2 = v1 | ~ $i(v2) | ~ $i(v1) | % 12.42/2.47 ~ $i(v0) | ~ rr(v0, v2) | ~ rr(v0, v1) | ~ ca_Ax14(v0)) & ! [v0: $i] : % 12.42/2.47 ! [v1: $i] : ( ~ $i(v1) | ~ $i(v0) | ~ rr(v0, v1) | ~ cp1(v1) | ca_Ax14(v0) % 12.42/2.47 | ? [v2: $i] : ? [v3: $i] : ( ~ (v3 = v2) & $i(v3) & $i(v2) & rr(v0, v3) & % 12.42/2.47 rr(v0, v2))) & ! [v0: $i] : ( ~ $i(v0) | ~ ca_Ax14(v0) | ? [v1: $i] : % 12.42/2.47 ($i(v1) & rr(v0, v1) & cp1(v1))) % 12.42/2.47 % 12.42/2.47 (axiom_16) % 12.49/2.47 ! [v0: $i] : ( ~ $i(v0) | ~ cp5xcomp(v0) | ~ cp4xcomp(v0) | ~ cp3xcomp(v0) % 12.49/2.47 | ~ cp2xcomp(v0) | ca_Cx1(v0)) & ! [v0: $i] : ( ~ $i(v0) | ~ ca_Cx1(v0) | % 12.49/2.47 cp5xcomp(v0)) & ! [v0: $i] : ( ~ $i(v0) | ~ ca_Cx1(v0) | cp4xcomp(v0)) & % 12.49/2.47 ! [v0: $i] : ( ~ $i(v0) | ~ ca_Cx1(v0) | cp3xcomp(v0)) & ! [v0: $i] : ( ~ % 12.49/2.47 $i(v0) | ~ ca_Cx1(v0) | cp2xcomp(v0)) % 12.49/2.47 % 12.49/2.47 (axiom_2) % 12.49/2.47 ! [v0: $i] : ! [v1: $i] : ( ~ $i(v1) | ~ $i(v0) | ~ rinvR(v0, v1) | ~ % 12.49/2.47 cp2(v0) | ~ ca_Ax14(v1) | cUnsatisfiable(v0)) & ! [v0: $i] : ( ~ $i(v0) | % 12.49/2.47 ~ cUnsatisfiable(v0) | cp2(v0)) & ! [v0: $i] : ( ~ $i(v0) | ~ % 12.49/2.47 cUnsatisfiable(v0) | ? [v1: $i] : ($i(v1) & rinvR(v0, v1) & ca_Ax14(v1))) % 12.49/2.47 % 12.49/2.47 (axiom_25) % 12.49/2.47 ! [v0: $i] : ! [v1: $i] : ( ~ $i(v1) | ~ $i(v0) | ~ rr(v1, v0) | rinvR(v0, % 12.49/2.47 v1)) & ! [v0: $i] : ! [v1: $i] : ( ~ $i(v1) | ~ $i(v0) | ~ rinvR(v0, % 12.49/2.47 v1) | rr(v1, v0)) % 12.49/2.47 % 12.49/2.47 (axiom_26) % 12.49/2.47 $i(i2003_11_14_17_21_04740) & cUnsatisfiable(i2003_11_14_17_21_04740) % 12.49/2.47 % 12.49/2.47 (axiom_3) % 12.49/2.48 ! [v0: $i] : ( ~ $i(v0) | ~ cp1(v0) | ca_Cx1(v0)) % 12.49/2.48 % 12.49/2.48 (axiom_4) % 12.49/2.48 ! [v0: $i] : ! [v1: $i] : ( ~ $i(v1) | ~ $i(v0) | ~ ra_Px5(v0, v1) | % 12.49/2.48 cp2(v0)) & ! [v0: $i] : ( ~ $i(v0) | ~ cp2(v0) | ? [v1: $i] : ($i(v1) & % 12.49/2.48 ra_Px5(v0, v1))) % 12.49/2.48 % 12.49/2.48 (axiom_6) % 12.49/2.48 ! [v0: $i] : ! [v1: $i] : ( ~ $i(v1) | ~ $i(v0) | ~ ra_Px5(v0, v1) | ~ % 12.49/2.48 cp2xcomp(v0)) & ? [v0: $i] : ( ~ $i(v0) | cp2xcomp(v0) | ? [v1: $i] : % 12.49/2.48 ($i(v1) & ra_Px5(v0, v1))) % 12.49/2.48 % 12.49/2.48 Further assumptions not needed in the proof: % 12.49/2.48 -------------------------------------------- % 12.49/2.48 axiom_0, axiom_1, axiom_10, axiom_11, axiom_12, axiom_13, axiom_14, axiom_17, % 12.49/2.48 axiom_18, axiom_19, axiom_20, axiom_21, axiom_22, axiom_23, axiom_24, axiom_5, % 12.49/2.48 axiom_7, axiom_8, axiom_9, cUnsatisfiable_substitution_1, % 12.49/2.48 ca_Ax14_substitution_1, ca_Cx1_substitution_1, ca_Cx1xcomp_substitution_1, % 12.49/2.48 ca_Cx2_substitution_1, ca_Cx2xcomp_substitution_1, ca_Cx3_substitution_1, % 12.49/2.48 ca_Cx3xcomp_substitution_1, cowlNothing_substitution_1, % 12.49/2.48 cowlThing_substitution_1, cp1_substitution_1, cp2_substitution_1, % 12.49/2.48 cp2xcomp_substitution_1, cp3_substitution_1, cp3xcomp_substitution_1, % 12.49/2.48 cp4_substitution_1, cp4xcomp_substitution_1, cp5_substitution_1, % 12.49/2.48 cp5xcomp_substitution_1, ra_Px1_substitution_1, ra_Px1_substitution_2, % 12.49/2.48 ra_Px2_substitution_1, ra_Px2_substitution_2, ra_Px3_substitution_1, % 12.49/2.48 ra_Px3_substitution_2, ra_Px4_substitution_1, ra_Px4_substitution_2, % 12.49/2.48 ra_Px5_substitution_1, ra_Px5_substitution_2, ra_Px6_substitution_1, % 12.49/2.48 ra_Px6_substitution_2, ra_Px7_substitution_1, ra_Px7_substitution_2, % 12.49/2.48 rinvR_substitution_1, rinvR_substitution_2, rr_substitution_1, % 12.49/2.48 rr_substitution_2, xsd_integer_substitution_1, xsd_string_substitution_1 % 12.49/2.48 % 12.49/2.48 Those formulas are unsatisfiable: % 12.49/2.48 --------------------------------- % 12.49/2.48 % 12.49/2.48 Begin of proof % 12.49/2.48 | % 12.49/2.48 | ALPHA: (axiom_26) implies: % 12.49/2.48 | (1) cUnsatisfiable(i2003_11_14_17_21_04740) % 12.49/2.48 | (2) $i(i2003_11_14_17_21_04740) % 12.49/2.48 | % 12.49/2.48 | ALPHA: (axiom_25) implies: % 12.49/2.48 | (3) ! [v0: $i] : ! [v1: $i] : ( ~ $i(v1) | ~ $i(v0) | ~ rinvR(v0, v1) | % 12.49/2.48 | rr(v1, v0)) % 12.49/2.48 | % 12.49/2.48 | ALPHA: (axiom_16) implies: % 12.49/2.48 | (4) ! [v0: $i] : ( ~ $i(v0) | ~ ca_Cx1(v0) | cp2xcomp(v0)) % 12.49/2.48 | % 12.49/2.48 | ALPHA: (axiom_15) implies: % 12.49/2.48 | (5) ! [v0: $i] : ( ~ $i(v0) | ~ ca_Ax14(v0) | ? [v1: $i] : ($i(v1) & % 12.49/2.48 | rr(v0, v1) & cp1(v1))) % 12.49/2.49 | (6) ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : (v2 = v1 | ~ $i(v2) | ~ % 12.49/2.49 | $i(v1) | ~ $i(v0) | ~ rr(v0, v2) | ~ rr(v0, v1) | ~ ca_Ax14(v0)) % 12.49/2.49 | % 12.49/2.49 | ALPHA: (axiom_6) implies: % 12.49/2.49 | (7) ! [v0: $i] : ! [v1: $i] : ( ~ $i(v1) | ~ $i(v0) | ~ ra_Px5(v0, v1) % 12.49/2.49 | | ~ cp2xcomp(v0)) % 12.49/2.49 | % 12.49/2.49 | ALPHA: (axiom_4) implies: % 12.49/2.49 | (8) ! [v0: $i] : ( ~ $i(v0) | ~ cp2(v0) | ? [v1: $i] : ($i(v1) & % 12.49/2.49 | ra_Px5(v0, v1))) % 12.49/2.49 | % 12.49/2.49 | ALPHA: (axiom_2) implies: % 12.49/2.49 | (9) ! [v0: $i] : ( ~ $i(v0) | ~ cUnsatisfiable(v0) | ? [v1: $i] : % 12.49/2.49 | ($i(v1) & rinvR(v0, v1) & ca_Ax14(v1))) % 12.49/2.49 | (10) ! [v0: $i] : ( ~ $i(v0) | ~ cUnsatisfiable(v0) | cp2(v0)) % 12.49/2.49 | % 12.49/2.49 | GROUND_INST: instantiating (10) with i2003_11_14_17_21_04740, simplifying with % 12.49/2.49 | (1), (2) gives: % 12.49/2.49 | (11) cp2(i2003_11_14_17_21_04740) % 12.49/2.49 | % 12.49/2.49 | GROUND_INST: instantiating (9) with i2003_11_14_17_21_04740, simplifying with % 12.49/2.49 | (1), (2) gives: % 12.49/2.49 | (12) ? [v0: $i] : ($i(v0) & rinvR(i2003_11_14_17_21_04740, v0) & % 12.49/2.49 | ca_Ax14(v0)) % 12.49/2.49 | % 12.49/2.49 | DELTA: instantiating (12) with fresh symbol all_44_0 gives: % 12.49/2.49 | (13) $i(all_44_0) & rinvR(i2003_11_14_17_21_04740, all_44_0) & % 12.49/2.49 | ca_Ax14(all_44_0) % 12.49/2.49 | % 12.49/2.49 | ALPHA: (13) implies: % 12.49/2.49 | (14) ca_Ax14(all_44_0) % 12.49/2.49 | (15) rinvR(i2003_11_14_17_21_04740, all_44_0) % 12.49/2.49 | (16) $i(all_44_0) % 12.49/2.49 | % 12.49/2.49 | GROUND_INST: instantiating (5) with all_44_0, simplifying with (14), (16) % 12.49/2.49 | gives: % 12.49/2.49 | (17) ? [v0: $i] : ($i(v0) & rr(all_44_0, v0) & cp1(v0)) % 12.49/2.49 | % 12.49/2.49 | GROUND_INST: instantiating (8) with i2003_11_14_17_21_04740, simplifying with % 12.49/2.49 | (2), (11) gives: % 12.49/2.49 | (18) ? [v0: $i] : ($i(v0) & ra_Px5(i2003_11_14_17_21_04740, v0)) % 12.49/2.49 | % 12.49/2.49 | GROUND_INST: instantiating (3) with i2003_11_14_17_21_04740, all_44_0, % 12.49/2.49 | simplifying with (2), (15), (16) gives: % 12.49/2.49 | (19) rr(all_44_0, i2003_11_14_17_21_04740) % 12.49/2.49 | % 12.49/2.49 | DELTA: instantiating (18) with fresh symbol all_52_0 gives: % 12.49/2.49 | (20) $i(all_52_0) & ra_Px5(i2003_11_14_17_21_04740, all_52_0) % 12.49/2.49 | % 12.49/2.49 | ALPHA: (20) implies: % 12.49/2.49 | (21) ra_Px5(i2003_11_14_17_21_04740, all_52_0) % 12.49/2.49 | (22) $i(all_52_0) % 12.49/2.49 | % 12.49/2.49 | DELTA: instantiating (17) with fresh symbol all_54_0 gives: % 12.49/2.49 | (23) $i(all_54_0) & rr(all_44_0, all_54_0) & cp1(all_54_0) % 12.49/2.49 | % 12.49/2.49 | ALPHA: (23) implies: % 12.49/2.49 | (24) cp1(all_54_0) % 12.49/2.49 | (25) rr(all_44_0, all_54_0) % 12.49/2.49 | (26) $i(all_54_0) % 12.49/2.49 | % 12.49/2.49 | GROUND_INST: instantiating (axiom_3) with all_54_0, simplifying with (24), % 12.49/2.49 | (26) gives: % 12.49/2.49 | (27) ca_Cx1(all_54_0) % 12.49/2.49 | % 12.49/2.49 | GROUND_INST: instantiating (6) with all_44_0, i2003_11_14_17_21_04740, % 12.49/2.50 | all_54_0, simplifying with (2), (14), (16), (19), (25), (26) % 12.49/2.50 | gives: % 12.49/2.50 | (28) all_54_0 = i2003_11_14_17_21_04740 % 12.49/2.50 | % 12.49/2.50 | REDUCE: (27), (28) imply: % 12.49/2.50 | (29) ca_Cx1(i2003_11_14_17_21_04740) % 12.49/2.50 | % 12.49/2.50 | GROUND_INST: instantiating (4) with i2003_11_14_17_21_04740, simplifying with % 12.49/2.50 | (2), (29) gives: % 12.49/2.50 | (30) cp2xcomp(i2003_11_14_17_21_04740) % 12.49/2.50 | % 12.49/2.50 | GROUND_INST: instantiating (7) with i2003_11_14_17_21_04740, all_52_0, % 12.49/2.50 | simplifying with (2), (21), (22), (30) gives: % 12.49/2.50 | (31) $false % 12.49/2.50 | % 12.49/2.50 | CLOSE: (31) is inconsistent. % 12.49/2.50 | % 12.49/2.50 End of proof % 12.49/2.50 % SZS output end Proof for theBenchmark % 12.49/2.50 % 12.49/2.50 1883ms %------------------------------------------------------------------------------