%------------------------------------------------------------------------------ % File : Princess---230619 % Problem : KRS073+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:08 EDT 2023 % Result : Unsatisfiable 7.98s 2.07s % Output : Proof 11.05s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.10/0.11 % Problem : KRS073+1 : TPTP v8.1.2. Released v3.1.0. % 0.10/0.12 % Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s % 0.11/0.32 % Computer : n007.cluster.edu % 0.11/0.32 % Model : x86_64 x86_64 % 0.11/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.11/0.32 % Memory : 8042.1875MB % 0.11/0.32 % OS : Linux 3.10.0-693.el7.x86_64 % 0.11/0.32 % CPULimit : 300 % 0.11/0.32 % WCLimit : 300 % 0.11/0.32 % DateTime : Mon Aug 28 01:29:27 EDT 2023 % 0.11/0.32 % CPUTime : % 0.47/0.64 ________ _____ % 0.47/0.64 ___ __ \_________(_)________________________________ % 0.47/0.64 __ /_/ /_ ___/_ /__ __ \ ___/ _ \_ ___/_ ___/ % 0.47/0.64 _ ____/_ / _ / _ / / / /__ / __/(__ )_(__ ) % 0.47/0.64 /_/ /_/ /_/ /_/ /_/\___/ \___//____/ /____/ % 0.47/0.64 % 0.47/0.64 A Theorem Prover for First-Order Logic modulo Linear Integer Arithmetic % 0.47/0.64 (2023-06-19) % 0.47/0.64 % 0.47/0.64 (c) Philipp Rümmer, 2009-2023 % 0.47/0.64 Contributors: Peter Backeman, Peter Baumgartner, Angelo Brillout, Zafer Esen, % 0.47/0.64 Amanda Stjerna. % 0.47/0.64 Free software under BSD-3-Clause. % 0.47/0.64 % 0.47/0.64 For more information, visit http://www.philipp.ruemmer.org/princess.shtml % 0.47/0.64 % 0.47/0.64 Loading /export/starexec/sandbox/benchmark/theBenchmark.p ... % 0.47/0.66 Running up to 7 provers in parallel. % 0.47/0.67 Prover 0: Options: +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1042961893 % 0.47/0.67 Prover 1: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1571432423 % 0.47/0.67 Prover 2: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMinimalAndEmpty -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1065072994 % 0.47/0.67 Prover 3: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1922548996 % 0.47/0.67 Prover 4: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=1868514696 % 0.47/0.67 Prover 5: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=complete -randomSeed=1259561288 % 0.47/0.68 Prover 6: Options: -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximalOutermost -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1399714365 % 2.56/1.24 Prover 4: Preprocessing ... % 2.56/1.24 Prover 1: Preprocessing ... % 3.34/1.31 Prover 5: Preprocessing ... % 3.34/1.31 Prover 0: Preprocessing ... % 3.34/1.31 Prover 6: Preprocessing ... % 3.34/1.31 Prover 2: Preprocessing ... % 3.34/1.31 Prover 3: Preprocessing ... % 6.20/1.75 Prover 2: Proving ... % 6.20/1.75 Prover 5: Proving ... % 6.20/1.77 Prover 6: Proving ... % 6.20/1.78 Prover 1: Constructing countermodel ... % 6.83/1.87 Prover 3: Constructing countermodel ... % 7.62/1.92 Prover 0: Proving ... % 7.62/1.92 Prover 4: Constructing countermodel ... % 7.98/2.00 Prover 3: gave up % 7.98/2.01 Prover 1: gave up % 7.98/2.02 Prover 8: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089 % 7.98/2.02 Prover 7: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470 % 7.98/2.07 Prover 5: proved (1392ms) % 7.98/2.07 % 7.98/2.07 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p % 7.98/2.07 % 7.98/2.07 Prover 10: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=919308125 % 7.98/2.07 Prover 2: stopped % 7.98/2.07 Prover 0: stopped % 7.98/2.08 Prover 6: stopped % 7.98/2.09 Prover 11: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1509710984 % 7.98/2.09 Prover 16: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=completeFrugal -randomSeed=-2043353683 % 7.98/2.09 Prover 13: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=complete -randomSeed=1138197443 % 8.99/2.11 Prover 8: Preprocessing ... % 8.99/2.12 Prover 7: Preprocessing ... % 8.99/2.15 Prover 11: Preprocessing ... % 8.99/2.15 Prover 10: Preprocessing ... % 8.99/2.17 Prover 13: Preprocessing ... % 9.60/2.25 Prover 7: Warning: ignoring some quantifiers % 9.60/2.25 Prover 7: Constructing countermodel ... % 9.60/2.25 Prover 16: Preprocessing ... % 9.60/2.26 Prover 10: Warning: ignoring some quantifiers % 9.60/2.26 Prover 10: Constructing countermodel ... % 9.60/2.27 Prover 13: Warning: ignoring some quantifiers % 9.60/2.27 Prover 13: Constructing countermodel ... % 10.45/2.32 Prover 7: Found proof (size 19) % 10.45/2.32 Prover 7: proved (293ms) % 10.45/2.32 Prover 10: stopped % 10.45/2.32 Prover 4: stopped % 10.45/2.32 Prover 13: stopped % 10.45/2.34 Prover 16: Warning: ignoring some quantifiers % 10.45/2.34 Prover 16: Constructing countermodel ... % 10.45/2.34 Prover 8: Warning: ignoring some quantifiers % 10.45/2.35 Prover 16: stopped % 10.45/2.36 Prover 8: Constructing countermodel ... % 10.45/2.37 Prover 8: stopped % 10.45/2.40 Prover 11: Constructing countermodel ... % 11.05/2.41 Prover 11: stopped % 11.05/2.41 % 11.05/2.41 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p % 11.05/2.41 % 11.05/2.42 % SZS output start Proof for theBenchmark % 11.05/2.42 Assumptions after simplification: % 11.05/2.42 --------------------------------- % 11.05/2.42 % 11.05/2.42 (axiom_11) % 11.05/2.43 ! [v0: $i] : ! [v1: $i] : ( ~ $i(v1) | ~ $i(v0) | ~ rs(v0, v1) | rf(v0, % 11.05/2.43 v1)) % 11.05/2.43 % 11.05/2.43 (axiom_2) % 11.05/2.44 ! [v0: $i] : ! [v1: $i] : ( ~ $i(v1) | ~ $i(v0) | ~ rf(v0, v1) | cp(v0) | % 11.05/2.44 cUnsatisfiable(v0) | ? [v2: $i] : ($i(v2) & ((rinvS(v1, v2) & ~ cp(v2)) | % 11.05/2.44 (rinvF(v1, v2) & ! [v3: $i] : ( ~ $i(v3) | ~ rs(v2, v3) | ~ % 11.05/2.44 cp(v3)))))) & ! [v0: $i] : ( ~ $i(v0) | ~ cp(v0) | ~ % 11.05/2.44 cUnsatisfiable(v0)) & ! [v0: $i] : ( ~ $i(v0) | ~ cUnsatisfiable(v0) | ? % 11.05/2.44 [v1: $i] : ($i(v1) & rf(v0, v1) & ! [v2: $i] : ( ~ $i(v2) | ~ rinvS(v1, % 11.05/2.44 v2) | cp(v2)) & ! [v2: $i] : ( ~ $i(v2) | ~ rinvF(v1, v2) | ? [v3: % 11.05/2.44 $i] : ($i(v3) & rs(v2, v3) & cp(v3))))) % 11.05/2.44 % 11.05/2.44 (axiom_3) % 11.05/2.44 ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : (v2 = v1 | ~ $i(v2) | ~ $i(v1) | % 11.05/2.44 ~ $i(v0) | ~ rf(v0, v2) | ~ rf(v0, v1)) % 11.05/2.44 % 11.05/2.44 (axiom_5) % 11.05/2.44 ! [v0: $i] : ! [v1: $i] : ( ~ $i(v1) | ~ $i(v0) | ~ rinvF(v0, v1) | rf(v1, % 11.05/2.44 v0)) & ! [v0: $i] : ! [v1: $i] : ( ~ $i(v1) | ~ $i(v0) | ~ rf(v1, v0) % 11.05/2.44 | rinvF(v0, v1)) % 11.05/2.44 % 11.05/2.44 (axiom_7) % 11.05/2.45 ! [v0: $i] : ! [v1: $i] : ( ~ $i(v1) | ~ $i(v0) | ~ rs(v1, v0) | rinvS(v0, % 11.05/2.45 v1)) & ! [v0: $i] : ! [v1: $i] : ( ~ $i(v1) | ~ $i(v0) | ~ rinvS(v0, % 11.05/2.45 v1) | rs(v1, v0)) % 11.05/2.45 % 11.05/2.45 (axiom_9) % 11.05/2.45 $i(i2003_11_14_17_18_54369) & cUnsatisfiable(i2003_11_14_17_18_54369) % 11.05/2.45 % 11.05/2.45 Further assumptions not needed in the proof: % 11.05/2.45 -------------------------------------------- % 11.05/2.45 axiom_0, axiom_1, axiom_10, axiom_4, axiom_6, axiom_8, % 11.05/2.45 cUnsatisfiable_substitution_1, cowlNothing_substitution_1, % 11.05/2.45 cowlThing_substitution_1, cp_substitution_1, rf1_substitution_1, % 11.05/2.45 rf1_substitution_2, rf_substitution_1, rf_substitution_2, rinvF1_substitution_1, % 11.05/2.45 rinvF1_substitution_2, rinvF_substitution_1, rinvF_substitution_2, % 11.05/2.45 rinvS_substitution_1, rinvS_substitution_2, rs_substitution_1, % 11.05/2.45 rs_substitution_2, xsd_integer_substitution_1, xsd_string_substitution_1 % 11.05/2.45 % 11.05/2.45 Those formulas are unsatisfiable: % 11.05/2.45 --------------------------------- % 11.05/2.45 % 11.05/2.45 Begin of proof % 11.05/2.45 | % 11.05/2.45 | ALPHA: (axiom_9) implies: % 11.05/2.45 | (1) cUnsatisfiable(i2003_11_14_17_18_54369) % 11.05/2.45 | (2) $i(i2003_11_14_17_18_54369) % 11.05/2.45 | % 11.05/2.45 | ALPHA: (axiom_7) implies: % 11.05/2.45 | (3) ! [v0: $i] : ! [v1: $i] : ( ~ $i(v1) | ~ $i(v0) | ~ rs(v1, v0) | % 11.05/2.45 | rinvS(v0, v1)) % 11.05/2.45 | % 11.05/2.45 | ALPHA: (axiom_5) implies: % 11.05/2.45 | (4) ! [v0: $i] : ! [v1: $i] : ( ~ $i(v1) | ~ $i(v0) | ~ rf(v1, v0) | % 11.05/2.45 | rinvF(v0, v1)) % 11.05/2.45 | % 11.05/2.45 | ALPHA: (axiom_2) implies: % 11.05/2.46 | (5) ! [v0: $i] : ( ~ $i(v0) | ~ cUnsatisfiable(v0) | ? [v1: $i] : % 11.05/2.46 | ($i(v1) & rf(v0, v1) & ! [v2: $i] : ( ~ $i(v2) | ~ rinvS(v1, v2) | % 11.05/2.46 | cp(v2)) & ! [v2: $i] : ( ~ $i(v2) | ~ rinvF(v1, v2) | ? [v3: % 11.05/2.46 | $i] : ($i(v3) & rs(v2, v3) & cp(v3))))) % 11.05/2.46 | (6) ! [v0: $i] : ( ~ $i(v0) | ~ cp(v0) | ~ cUnsatisfiable(v0)) % 11.05/2.46 | % 11.05/2.46 | GROUND_INST: instantiating (5) with i2003_11_14_17_18_54369, simplifying with % 11.05/2.46 | (1), (2) gives: % 11.05/2.46 | (7) ? [v0: $i] : ($i(v0) & rf(i2003_11_14_17_18_54369, v0) & ! [v1: $i] : % 11.05/2.46 | ( ~ $i(v1) | ~ rinvS(v0, v1) | cp(v1)) & ! [v1: $i] : ( ~ $i(v1) | % 11.05/2.46 | ~ rinvF(v0, v1) | ? [v2: $i] : ($i(v2) & rs(v1, v2) & cp(v2)))) % 11.05/2.46 | % 11.05/2.46 | DELTA: instantiating (7) with fresh symbol all_21_0 gives: % 11.05/2.46 | (8) $i(all_21_0) & rf(i2003_11_14_17_18_54369, all_21_0) & ! [v0: $i] : ( % 11.05/2.46 | ~ $i(v0) | ~ rinvS(all_21_0, v0) | cp(v0)) & ! [v0: $i] : ( ~ % 11.05/2.46 | $i(v0) | ~ rinvF(all_21_0, v0) | ? [v1: $i] : ($i(v1) & rs(v0, v1) % 11.05/2.46 | & cp(v1))) % 11.05/2.46 | % 11.05/2.46 | ALPHA: (8) implies: % 11.05/2.46 | (9) rf(i2003_11_14_17_18_54369, all_21_0) % 11.05/2.46 | (10) $i(all_21_0) % 11.05/2.47 | (11) ! [v0: $i] : ( ~ $i(v0) | ~ rinvF(all_21_0, v0) | ? [v1: $i] : % 11.05/2.47 | ($i(v1) & rs(v0, v1) & cp(v1))) % 11.05/2.47 | (12) ! [v0: $i] : ( ~ $i(v0) | ~ rinvS(all_21_0, v0) | cp(v0)) % 11.05/2.47 | % 11.05/2.47 | GROUND_INST: instantiating (4) with all_21_0, i2003_11_14_17_18_54369, % 11.05/2.47 | simplifying with (2), (9), (10) gives: % 11.05/2.47 | (13) rinvF(all_21_0, i2003_11_14_17_18_54369) % 11.05/2.47 | % 11.05/2.47 | GROUND_INST: instantiating (11) with i2003_11_14_17_18_54369, simplifying with % 11.05/2.47 | (2), (13) gives: % 11.05/2.47 | (14) ? [v0: $i] : ($i(v0) & rs(i2003_11_14_17_18_54369, v0) & cp(v0)) % 11.05/2.47 | % 11.05/2.47 | DELTA: instantiating (14) with fresh symbol all_35_0 gives: % 11.05/2.47 | (15) $i(all_35_0) & rs(i2003_11_14_17_18_54369, all_35_0) & cp(all_35_0) % 11.05/2.47 | % 11.05/2.47 | ALPHA: (15) implies: % 11.05/2.47 | (16) rs(i2003_11_14_17_18_54369, all_35_0) % 11.05/2.47 | (17) $i(all_35_0) % 11.05/2.47 | % 11.05/2.47 | GROUND_INST: instantiating (6) with i2003_11_14_17_18_54369, simplifying with % 11.05/2.47 | (1), (2) gives: % 11.05/2.47 | (18) ~ cp(i2003_11_14_17_18_54369) % 11.05/2.47 | % 11.05/2.47 | GROUND_INST: instantiating (3) with all_35_0, i2003_11_14_17_18_54369, % 11.05/2.47 | simplifying with (2), (16), (17) gives: % 11.05/2.47 | (19) rinvS(all_35_0, i2003_11_14_17_18_54369) % 11.05/2.47 | % 11.05/2.47 | GROUND_INST: instantiating (axiom_11) with i2003_11_14_17_18_54369, all_35_0, % 11.05/2.47 | simplifying with (2), (16), (17) gives: % 11.05/2.47 | (20) rf(i2003_11_14_17_18_54369, all_35_0) % 11.05/2.47 | % 11.05/2.47 | GROUND_INST: instantiating (axiom_3) with i2003_11_14_17_18_54369, all_21_0, % 11.05/2.47 | all_35_0, simplifying with (2), (9), (10), (17), (20) gives: % 11.05/2.47 | (21) all_35_0 = all_21_0 % 11.05/2.47 | % 11.05/2.47 | GROUND_INST: instantiating (12) with i2003_11_14_17_18_54369, simplifying with % 11.05/2.47 | (2), (18) gives: % 11.05/2.47 | (22) ~ rinvS(all_21_0, i2003_11_14_17_18_54369) % 11.05/2.47 | % 11.05/2.47 | REDUCE: (19), (21) imply: % 11.05/2.47 | (23) rinvS(all_21_0, i2003_11_14_17_18_54369) % 11.05/2.47 | % 11.05/2.47 | PRED_UNIFY: (22), (23) imply: % 11.05/2.47 | (24) $false % 11.05/2.48 | % 11.05/2.48 | CLOSE: (24) is inconsistent. % 11.05/2.48 | % 11.05/2.48 End of proof % 11.05/2.48 % SZS output end Proof for theBenchmark % 11.05/2.48 % 11.05/2.48 1832ms %------------------------------------------------------------------------------