%------------------------------------------------------------------------------ % File : Princess---230619 % Problem : KRS077+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:09 EDT 2023 % Result : Unsatisfiable 4.90s 1.51s % Output : Proof 7.76s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.12 % Problem : KRS077+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.13/0.34 % Computer : n016.cluster.edu % 0.13/0.34 % Model : x86_64 x86_64 % 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.13/0.34 % Memory : 8042.1875MB % 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64 % 0.13/0.34 % CPULimit : 300 % 0.13/0.34 % WCLimit : 300 % 0.13/0.34 % DateTime : Mon Aug 28 02:17:59 EDT 2023 % 0.13/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.61 A Theorem Prover for First-Order Logic modulo Linear Integer Arithmetic % 0.20/0.61 (2023-06-19) % 0.20/0.61 % 0.20/0.61 (c) Philipp Rümmer, 2009-2023 % 0.20/0.61 Contributors: Peter Backeman, Peter Baumgartner, Angelo Brillout, Zafer Esen, % 0.20/0.61 Amanda Stjerna. % 0.20/0.61 Free software under BSD-3-Clause. % 0.20/0.61 % 0.20/0.61 For more information, visit http://www.philipp.ruemmer.org/princess.shtml % 0.20/0.61 % 0.20/0.61 Loading /export/starexec/sandbox/benchmark/theBenchmark.p ... % 0.20/0.62 Running up to 7 provers in parallel. % 0.20/0.64 Prover 1: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1571432423 % 0.20/0.64 Prover 0: Options: +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1042961893 % 0.20/0.64 Prover 2: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMinimalAndEmpty -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1065072994 % 0.20/0.64 Prover 3: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1922548996 % 0.20/0.64 Prover 4: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=1868514696 % 0.20/0.64 Prover 5: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=complete -randomSeed=1259561288 % 0.20/0.64 Prover 6: Options: -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximalOutermost -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1399714365 % 2.57/1.03 Prover 1: Preprocessing ... % 2.57/1.03 Prover 4: Preprocessing ... % 2.89/1.08 Prover 0: Preprocessing ... % 2.89/1.08 Prover 2: Preprocessing ... % 2.89/1.08 Prover 6: Preprocessing ... % 2.89/1.08 Prover 3: Preprocessing ... % 2.89/1.08 Prover 5: Preprocessing ... % 4.57/1.32 Prover 5: Proving ... % 4.57/1.33 Prover 2: Proving ... % 4.90/1.37 Prover 1: Constructing countermodel ... % 4.90/1.39 Prover 3: Constructing countermodel ... % 4.90/1.41 Prover 6: Proving ... % 4.90/1.51 Prover 5: proved (867ms) % 4.90/1.51 % 4.90/1.51 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p % 4.90/1.51 % 4.90/1.51 Prover 2: proved (870ms) % 4.90/1.51 % 4.90/1.51 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p % 4.90/1.51 % 4.90/1.52 Prover 6: stopped % 4.90/1.53 Prover 3: stopped % 4.90/1.53 Prover 4: Constructing countermodel ... % 4.90/1.53 Prover 7: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470 % 4.90/1.53 Prover 10: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=919308125 % 4.90/1.53 Prover 8: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089 % 4.90/1.53 Prover 0: Proving ... % 4.90/1.53 Prover 0: stopped % 4.90/1.53 Prover 11: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1509710984 % 4.90/1.53 Prover 13: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=complete -randomSeed=1138197443 % 4.90/1.57 Prover 1: gave up % 5.83/1.58 Prover 10: Preprocessing ... % 5.83/1.58 Prover 7: Preprocessing ... % 5.83/1.58 Prover 16: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=completeFrugal -randomSeed=-2043353683 % 5.83/1.58 Prover 8: Preprocessing ... % 5.83/1.59 Prover 11: Preprocessing ... % 5.83/1.60 Prover 13: Preprocessing ... % 6.56/1.62 Prover 16: Preprocessing ... % 6.56/1.63 Prover 10: Warning: ignoring some quantifiers % 6.56/1.64 Prover 7: Warning: ignoring some quantifiers % 6.56/1.64 Prover 7: Constructing countermodel ... % 6.56/1.64 Prover 10: Constructing countermodel ... % 6.96/1.67 Prover 13: Warning: ignoring some quantifiers % 6.96/1.67 Prover 16: Warning: ignoring some quantifiers % 6.96/1.67 Prover 13: Constructing countermodel ... % 6.96/1.68 Prover 16: Constructing countermodel ... % 6.96/1.71 Prover 7: Found proof (size 17) % 6.96/1.71 Prover 7: proved (191ms) % 6.96/1.71 Prover 13: stopped % 6.96/1.71 Prover 4: stopped % 6.96/1.71 Prover 16: stopped % 6.96/1.71 Prover 10: stopped % 6.96/1.72 Prover 8: Warning: ignoring some quantifiers % 6.96/1.72 Prover 8: Constructing countermodel ... % 6.96/1.73 Prover 8: stopped % 7.57/1.76 Prover 11: Constructing countermodel ... % 7.57/1.77 Prover 11: stopped % 7.57/1.77 % 7.57/1.77 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p % 7.57/1.77 % 7.57/1.77 % SZS output start Proof for theBenchmark % 7.57/1.78 Assumptions after simplification: % 7.57/1.78 --------------------------------- % 7.57/1.78 % 7.57/1.78 (axiom_2) % 7.57/1.78 ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : (v2 = v1 | ~ $i(v2) | ~ $i(v1) | % 7.57/1.78 ~ $i(v0) | ~ rr(v0, v2) | ~ rr(v0, v1) | ~ cUnsatisfiable(v0)) & ! [v0: % 7.57/1.78 $i] : ! [v1: $i] : ! [v2: $i] : ( ~ $i(v2) | ~ $i(v1) | ~ $i(v0) | ~ % 7.57/1.78 rs(v0, v1) | ~ rr(v0, v2) | ~ cp(v1) | cp(v0) | cUnsatisfiable(v0) | ? % 7.57/1.78 [v3: $i] : ? [v4: $i] : ($i(v4) & $i(v3) & (( ~ (v4 = v3) & rr(v0, v4) & % 7.57/1.78 rr(v0, v3)) | (rinvS(v2, v3) & ~ cp(v3))))) & ! [v0: $i] : ( ~ % 7.57/1.78 $i(v0) | ~ cp(v0) | ~ cUnsatisfiable(v0)) & ! [v0: $i] : ( ~ $i(v0) | ~ % 7.57/1.79 cUnsatisfiable(v0) | ? [v1: $i] : ($i(v1) & rs(v0, v1) & cp(v1))) & ! [v0: % 7.57/1.79 $i] : ( ~ $i(v0) | ~ cUnsatisfiable(v0) | ? [v1: $i] : ($i(v1) & rr(v0, % 7.57/1.79 v1) & ! [v2: $i] : ( ~ $i(v2) | ~ rinvS(v1, v2) | cp(v2)))) % 7.57/1.79 % 7.57/1.79 (axiom_3) % 7.76/1.79 ! [v0: $i] : ! [v1: $i] : ( ~ $i(v1) | ~ $i(v0) | ~ rs(v1, v0) | rinvS(v0, % 7.76/1.79 v1)) & ! [v0: $i] : ! [v1: $i] : ( ~ $i(v1) | ~ $i(v0) | ~ rinvS(v0, % 7.76/1.79 v1) | rs(v1, v0)) % 7.76/1.79 % 7.76/1.79 (axiom_4) % 7.76/1.79 $i(i2003_11_14_17_19_09372) & cUnsatisfiable(i2003_11_14_17_19_09372) % 7.76/1.79 % 7.76/1.79 (axiom_5) % 7.76/1.79 ! [v0: $i] : ! [v1: $i] : ( ~ $i(v1) | ~ $i(v0) | ~ rs(v0, v1) | rr(v0, % 7.76/1.79 v1)) % 7.76/1.79 % 7.76/1.79 Further assumptions not needed in the proof: % 7.76/1.79 -------------------------------------------- % 7.76/1.79 axiom_0, axiom_1, cUnsatisfiable_substitution_1, cowlNothing_substitution_1, % 7.76/1.79 cowlThing_substitution_1, cp_substitution_1, rinvS_substitution_1, % 7.76/1.79 rinvS_substitution_2, rr_substitution_1, rr_substitution_2, rs_substitution_1, % 7.76/1.79 rs_substitution_2, xsd_integer_substitution_1, xsd_string_substitution_1 % 7.76/1.79 % 7.76/1.79 Those formulas are unsatisfiable: % 7.76/1.79 --------------------------------- % 7.76/1.79 % 7.76/1.79 Begin of proof % 7.76/1.79 | % 7.76/1.79 | ALPHA: (axiom_4) implies: % 7.76/1.79 | (1) cUnsatisfiable(i2003_11_14_17_19_09372) % 7.76/1.79 | (2) $i(i2003_11_14_17_19_09372) % 7.76/1.79 | % 7.76/1.79 | ALPHA: (axiom_3) implies: % 7.76/1.79 | (3) ! [v0: $i] : ! [v1: $i] : ( ~ $i(v1) | ~ $i(v0) | ~ rs(v1, v0) | % 7.76/1.79 | rinvS(v0, v1)) % 7.76/1.79 | % 7.76/1.79 | ALPHA: (axiom_2) implies: % 7.76/1.79 | (4) ! [v0: $i] : ( ~ $i(v0) | ~ cUnsatisfiable(v0) | ? [v1: $i] : % 7.76/1.79 | ($i(v1) & rr(v0, v1) & ! [v2: $i] : ( ~ $i(v2) | ~ rinvS(v1, v2) | % 7.76/1.79 | cp(v2)))) % 7.76/1.80 | (5) ! [v0: $i] : ( ~ $i(v0) | ~ cUnsatisfiable(v0) | ? [v1: $i] : % 7.76/1.80 | ($i(v1) & rs(v0, v1) & cp(v1))) % 7.76/1.80 | (6) ! [v0: $i] : ( ~ $i(v0) | ~ cp(v0) | ~ cUnsatisfiable(v0)) % 7.76/1.80 | (7) ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : (v2 = v1 | ~ $i(v2) | ~ % 7.76/1.80 | $i(v1) | ~ $i(v0) | ~ rr(v0, v2) | ~ rr(v0, v1) | ~ % 7.76/1.80 | cUnsatisfiable(v0)) % 7.76/1.80 | % 7.76/1.80 | GROUND_INST: instantiating (5) with i2003_11_14_17_19_09372, simplifying with % 7.76/1.80 | (1), (2) gives: % 7.76/1.80 | (8) ? [v0: $i] : ($i(v0) & rs(i2003_11_14_17_19_09372, v0) & cp(v0)) % 7.76/1.80 | % 7.76/1.80 | GROUND_INST: instantiating (4) with i2003_11_14_17_19_09372, simplifying with % 7.76/1.80 | (1), (2) gives: % 7.76/1.80 | (9) ? [v0: $i] : ($i(v0) & rr(i2003_11_14_17_19_09372, v0) & ! [v1: $i] : % 7.76/1.80 | ( ~ $i(v1) | ~ rinvS(v0, v1) | cp(v1))) % 7.76/1.80 | % 7.76/1.80 | DELTA: instantiating (8) with fresh symbol all_15_0 gives: % 7.76/1.80 | (10) $i(all_15_0) & rs(i2003_11_14_17_19_09372, all_15_0) & cp(all_15_0) % 7.76/1.80 | % 7.76/1.80 | ALPHA: (10) implies: % 7.76/1.80 | (11) rs(i2003_11_14_17_19_09372, all_15_0) % 7.76/1.80 | (12) $i(all_15_0) % 7.76/1.80 | % 7.76/1.80 | DELTA: instantiating (9) with fresh symbol all_17_0 gives: % 7.76/1.80 | (13) $i(all_17_0) & rr(i2003_11_14_17_19_09372, all_17_0) & ! [v0: $i] : ( % 7.76/1.80 | ~ $i(v0) | ~ rinvS(all_17_0, v0) | cp(v0)) % 7.76/1.80 | % 7.76/1.80 | ALPHA: (13) implies: % 7.76/1.80 | (14) rr(i2003_11_14_17_19_09372, all_17_0) % 7.76/1.80 | (15) $i(all_17_0) % 7.76/1.80 | (16) ! [v0: $i] : ( ~ $i(v0) | ~ rinvS(all_17_0, v0) | cp(v0)) % 7.76/1.80 | % 7.76/1.80 | GROUND_INST: instantiating (6) with i2003_11_14_17_19_09372, simplifying with % 7.76/1.80 | (1), (2) gives: % 7.76/1.80 | (17) ~ cp(i2003_11_14_17_19_09372) % 7.76/1.80 | % 7.76/1.80 | GROUND_INST: instantiating (3) with all_15_0, i2003_11_14_17_19_09372, % 7.76/1.80 | simplifying with (2), (11), (12) gives: % 7.76/1.80 | (18) rinvS(all_15_0, i2003_11_14_17_19_09372) % 7.76/1.80 | % 7.76/1.80 | GROUND_INST: instantiating (axiom_5) with i2003_11_14_17_19_09372, all_15_0, % 7.76/1.80 | simplifying with (2), (11), (12) gives: % 7.76/1.80 | (19) rr(i2003_11_14_17_19_09372, all_15_0) % 7.76/1.80 | % 7.76/1.80 | GROUND_INST: instantiating (16) with i2003_11_14_17_19_09372, simplifying with % 7.76/1.80 | (2), (17) gives: % 7.76/1.80 | (20) ~ rinvS(all_17_0, i2003_11_14_17_19_09372) % 7.76/1.80 | % 7.76/1.81 | GROUND_INST: instantiating (7) with i2003_11_14_17_19_09372, all_17_0, % 7.76/1.81 | all_15_0, simplifying with (1), (2), (12), (14), (15), (19) % 7.76/1.81 | gives: % 7.76/1.81 | (21) all_17_0 = all_15_0 % 7.76/1.81 | % 7.76/1.81 | REDUCE: (20), (21) imply: % 7.76/1.81 | (22) ~ rinvS(all_15_0, i2003_11_14_17_19_09372) % 7.76/1.81 | % 7.76/1.81 | PRED_UNIFY: (18), (22) imply: % 7.76/1.81 | (23) $false % 7.76/1.81 | % 7.76/1.81 | CLOSE: (23) is inconsistent. % 7.76/1.81 | % 7.76/1.81 End of proof % 7.76/1.81 % SZS output end Proof for theBenchmark % 7.76/1.81 % 7.76/1.81 1196ms %------------------------------------------------------------------------------