%------------------------------------------------------------------------------ % File : Princess---230619 % Problem : KRS106+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 : n004.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 6.74s 1.81s % Output : Proof 10.20s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.12 % Problem : KRS106+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 : n004.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:46:53 EDT 2023 % 0.12/0.34 % CPUTime : % 0.19/0.65 ________ _____ % 0.19/0.65 ___ __ \_________(_)________________________________ % 0.19/0.65 __ /_/ /_ ___/_ /__ __ \ ___/ _ \_ ___/_ ___/ % 0.19/0.65 _ ____/_ / _ / _ / / / /__ / __/(__ )_(__ ) % 0.19/0.65 /_/ /_/ /_/ /_/ /_/\___/ \___//____/ /____/ % 0.19/0.65 % 0.19/0.65 A Theorem Prover for First-Order Logic modulo Linear Integer Arithmetic % 0.19/0.65 (2023-06-19) % 0.19/0.65 % 0.19/0.65 (c) Philipp Rümmer, 2009-2023 % 0.19/0.65 Contributors: Peter Backeman, Peter Baumgartner, Angelo Brillout, Zafer Esen, % 0.19/0.65 Amanda Stjerna. % 0.19/0.65 Free software under BSD-3-Clause. % 0.19/0.65 % 0.19/0.65 For more information, visit http://www.philipp.ruemmer.org/princess.shtml % 0.19/0.65 % 0.19/0.65 Loading /export/starexec/sandbox2/benchmark/theBenchmark.p ... % 0.19/0.67 Running up to 7 provers in parallel. % 0.19/0.69 Prover 0: Options: +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1042961893 % 0.19/0.69 Prover 1: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1571432423 % 0.19/0.69 Prover 2: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMinimalAndEmpty -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1065072994 % 0.19/0.69 Prover 3: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1922548996 % 0.19/0.69 Prover 4: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=1868514696 % 0.19/0.69 Prover 5: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=complete -randomSeed=1259561288 % 0.19/0.69 Prover 6: Options: -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximalOutermost -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1399714365 % 2.69/1.21 Prover 1: Preprocessing ... % 2.69/1.21 Prover 4: Preprocessing ... % 3.22/1.26 Prover 0: Preprocessing ... % 3.22/1.26 Prover 2: Preprocessing ... % 3.22/1.26 Prover 3: Preprocessing ... % 3.22/1.26 Prover 6: Preprocessing ... % 3.22/1.26 Prover 5: Preprocessing ... % 5.17/1.61 Prover 5: Proving ... % 5.17/1.61 Prover 2: Proving ... % 5.94/1.69 Prover 1: Constructing countermodel ... % 5.94/1.71 Prover 3: Constructing countermodel ... % 5.94/1.72 Prover 6: Proving ... % 6.74/1.80 Prover 4: Constructing countermodel ... % 6.74/1.81 Prover 5: proved (1122ms) % 6.74/1.81 % 6.74/1.81 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p % 6.74/1.81 % 6.74/1.82 Prover 6: stopped % 6.74/1.82 Prover 2: proved (1139ms) % 6.74/1.82 % 6.74/1.82 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p % 6.74/1.82 % 6.74/1.82 Prover 3: stopped % 6.74/1.82 Prover 7: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470 % 6.74/1.82 Prover 10: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=919308125 % 6.74/1.83 Prover 11: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1509710984 % 6.74/1.83 Prover 8: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089 % 7.20/1.86 Prover 1: gave up % 7.20/1.86 Prover 13: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=complete -randomSeed=1138197443 % 7.20/1.88 Prover 0: Proving ... % 7.20/1.88 Prover 0: stopped % 7.20/1.88 Prover 16: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=completeFrugal -randomSeed=-2043353683 % 7.20/1.88 Prover 10: Preprocessing ... % 7.70/1.91 Prover 8: Preprocessing ... % 7.70/1.93 Prover 13: Preprocessing ... % 7.70/1.94 Prover 7: Preprocessing ... % 7.70/1.95 Prover 11: Preprocessing ... % 8.01/1.97 Prover 16: Preprocessing ... % 8.01/1.98 Prover 10: Warning: ignoring some quantifiers % 8.01/1.99 Prover 10: Constructing countermodel ... % 8.01/2.00 Prover 7: Warning: ignoring some quantifiers % 8.01/2.01 Prover 13: Warning: ignoring some quantifiers % 8.01/2.01 Prover 7: Constructing countermodel ... % 8.01/2.02 Prover 13: Constructing countermodel ... % 8.67/2.08 Prover 16: Warning: ignoring some quantifiers % 8.67/2.09 Prover 16: Constructing countermodel ... % 8.67/2.12 Prover 7: Found proof (size 25) % 8.67/2.12 Prover 7: proved (293ms) % 8.67/2.12 Prover 13: stopped % 8.67/2.12 Prover 10: stopped % 8.67/2.12 Prover 16: stopped % 8.67/2.12 Prover 4: Found proof (size 27) % 8.67/2.12 Prover 4: proved (1435ms) % 8.67/2.16 Prover 8: Warning: ignoring some quantifiers % 8.67/2.16 Prover 8: Constructing countermodel ... % 8.67/2.17 Prover 8: stopped % 9.02/2.22 Prover 11: Constructing countermodel ... % 9.02/2.23 Prover 11: stopped % 9.02/2.23 % 9.02/2.23 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p % 9.02/2.23 % 9.02/2.24 % SZS output start Proof for theBenchmark % 9.02/2.25 Assumptions after simplification: % 9.02/2.25 --------------------------------- % 9.02/2.25 % 9.02/2.25 (axiom_10) % 9.02/2.26 ! [v0: $i] : ! [v1: $i] : ( ~ $i(v1) | ~ $i(v0) | ~ rf3(v0, v1) | rf2(v0, % 9.02/2.26 v1)) % 9.02/2.26 % 9.02/2.26 (axiom_2) % 9.02/2.26 ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: $i] : ( ~ $i(v3) | ~ $i(v2) % 9.02/2.26 | ~ $i(v1) | ~ $i(v0) | ~ rf3(v0, v3) | ~ rf2(v0, v1) | ~ rf1(v0, v2) | % 9.02/2.26 ~ cp2(v3) | ~ cp1xcomp(v1) | ~ cp1(v2) | cUnsatisfiable(v0)) & ! [v0: % 9.02/2.26 $i] : ( ~ $i(v0) | ~ cUnsatisfiable(v0) | ? [v1: $i] : ($i(v1) & rf3(v0, % 9.02/2.26 v1) & cp2(v1))) & ! [v0: $i] : ( ~ $i(v0) | ~ cUnsatisfiable(v0) | ? % 9.02/2.26 [v1: $i] : ($i(v1) & rf2(v0, v1) & cp1xcomp(v1))) & ! [v0: $i] : ( ~ $i(v0) % 9.02/2.26 | ~ cUnsatisfiable(v0) | ? [v1: $i] : ($i(v1) & rf1(v0, v1) & cp1(v1))) % 9.02/2.26 % 9.02/2.26 (axiom_3) % 9.02/2.27 ! [v0: $i] : ! [v1: $i] : ( ~ $i(v1) | ~ $i(v0) | ~ ra_Px1(v0, v1) | ~ % 9.02/2.27 cp1(v0)) & ? [v0: $i] : ( ~ $i(v0) | cp1(v0) | ? [v1: $i] : ($i(v1) & % 9.02/2.27 ra_Px1(v0, v1))) % 9.02/2.27 % 9.02/2.27 (axiom_4) % 9.98/2.27 ! [v0: $i] : ! [v1: $i] : ( ~ $i(v1) | ~ $i(v0) | ~ ra_Px1(v0, v1) | % 9.98/2.27 cp1xcomp(v0)) & ! [v0: $i] : ( ~ $i(v0) | ~ cp1xcomp(v0) | ? [v1: $i] : % 9.98/2.27 ($i(v1) & ra_Px1(v0, v1))) % 9.98/2.27 % 9.98/2.27 (axiom_5) % 9.98/2.27 ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : (v2 = v1 | ~ $i(v2) | ~ $i(v1) | % 9.98/2.27 ~ $i(v0) | ~ rf1(v0, v2) | ~ rf1(v0, v1)) % 9.98/2.27 % 9.98/2.27 (axiom_6) % 9.98/2.27 ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : (v2 = v1 | ~ $i(v2) | ~ $i(v1) | % 9.98/2.27 ~ $i(v0) | ~ rf2(v0, v2) | ~ rf2(v0, v1)) % 9.98/2.27 % 9.98/2.28 (axiom_8) % 9.98/2.28 $i(i2003_11_14_17_20_57644) & cUnsatisfiable(i2003_11_14_17_20_57644) % 9.98/2.28 % 9.98/2.28 (axiom_9) % 9.98/2.28 ! [v0: $i] : ! [v1: $i] : ( ~ $i(v1) | ~ $i(v0) | ~ rf3(v0, v1) | rf1(v0, % 9.98/2.28 v1)) % 9.98/2.28 % 9.98/2.28 Further assumptions not needed in the proof: % 9.98/2.28 -------------------------------------------- % 9.98/2.28 axiom_0, axiom_1, axiom_7, cUnsatisfiable_substitution_1, % 9.98/2.28 cowlNothing_substitution_1, cowlThing_substitution_1, cp1_substitution_1, % 9.98/2.28 cp1xcomp_substitution_1, cp2_substitution_1, ra_Px1_substitution_1, % 9.98/2.28 ra_Px1_substitution_2, rf1_substitution_1, rf1_substitution_2, % 9.98/2.28 rf2_substitution_1, rf2_substitution_2, rf3_substitution_1, rf3_substitution_2, % 9.98/2.28 xsd_integer_substitution_1, xsd_string_substitution_1 % 9.98/2.28 % 9.98/2.28 Those formulas are unsatisfiable: % 9.98/2.28 --------------------------------- % 9.98/2.28 % 9.98/2.28 Begin of proof % 9.98/2.28 | % 9.98/2.28 | ALPHA: (axiom_8) implies: % 9.98/2.28 | (1) cUnsatisfiable(i2003_11_14_17_20_57644) % 9.98/2.28 | (2) $i(i2003_11_14_17_20_57644) % 9.98/2.28 | % 9.98/2.28 | ALPHA: (axiom_4) implies: % 10.06/2.29 | (3) ! [v0: $i] : ( ~ $i(v0) | ~ cp1xcomp(v0) | ? [v1: $i] : ($i(v1) & % 10.06/2.29 | ra_Px1(v0, v1))) % 10.06/2.29 | % 10.06/2.29 | ALPHA: (axiom_3) implies: % 10.06/2.29 | (4) ! [v0: $i] : ! [v1: $i] : ( ~ $i(v1) | ~ $i(v0) | ~ ra_Px1(v0, v1) % 10.06/2.29 | | ~ cp1(v0)) % 10.06/2.29 | % 10.06/2.29 | ALPHA: (axiom_2) implies: % 10.06/2.29 | (5) ! [v0: $i] : ( ~ $i(v0) | ~ cUnsatisfiable(v0) | ? [v1: $i] : % 10.06/2.29 | ($i(v1) & rf1(v0, v1) & cp1(v1))) % 10.06/2.29 | (6) ! [v0: $i] : ( ~ $i(v0) | ~ cUnsatisfiable(v0) | ? [v1: $i] : % 10.06/2.29 | ($i(v1) & rf2(v0, v1) & cp1xcomp(v1))) % 10.06/2.29 | (7) ! [v0: $i] : ( ~ $i(v0) | ~ cUnsatisfiable(v0) | ? [v1: $i] : % 10.06/2.29 | ($i(v1) & rf3(v0, v1) & cp2(v1))) % 10.06/2.29 | % 10.06/2.30 | GROUND_INST: instantiating (7) with i2003_11_14_17_20_57644, simplifying with % 10.06/2.30 | (1), (2) gives: % 10.06/2.30 | (8) ? [v0: $i] : ($i(v0) & rf3(i2003_11_14_17_20_57644, v0) & cp2(v0)) % 10.06/2.30 | % 10.06/2.30 | GROUND_INST: instantiating (6) with i2003_11_14_17_20_57644, simplifying with % 10.06/2.30 | (1), (2) gives: % 10.06/2.30 | (9) ? [v0: $i] : ($i(v0) & rf2(i2003_11_14_17_20_57644, v0) & % 10.06/2.30 | cp1xcomp(v0)) % 10.06/2.30 | % 10.06/2.30 | GROUND_INST: instantiating (5) with i2003_11_14_17_20_57644, simplifying with % 10.06/2.30 | (1), (2) gives: % 10.06/2.30 | (10) ? [v0: $i] : ($i(v0) & rf1(i2003_11_14_17_20_57644, v0) & cp1(v0)) % 10.06/2.30 | % 10.06/2.30 | DELTA: instantiating (10) with fresh symbol all_21_0 gives: % 10.06/2.30 | (11) $i(all_21_0) & rf1(i2003_11_14_17_20_57644, all_21_0) & cp1(all_21_0) % 10.06/2.30 | % 10.06/2.30 | ALPHA: (11) implies: % 10.06/2.30 | (12) cp1(all_21_0) % 10.06/2.30 | (13) rf1(i2003_11_14_17_20_57644, all_21_0) % 10.06/2.30 | (14) $i(all_21_0) % 10.06/2.30 | % 10.06/2.30 | DELTA: instantiating (9) with fresh symbol all_23_0 gives: % 10.06/2.30 | (15) $i(all_23_0) & rf2(i2003_11_14_17_20_57644, all_23_0) & % 10.06/2.30 | cp1xcomp(all_23_0) % 10.06/2.30 | % 10.06/2.30 | ALPHA: (15) implies: % 10.06/2.30 | (16) cp1xcomp(all_23_0) % 10.06/2.30 | (17) rf2(i2003_11_14_17_20_57644, all_23_0) % 10.06/2.30 | (18) $i(all_23_0) % 10.06/2.30 | % 10.06/2.30 | DELTA: instantiating (8) with fresh symbol all_25_0 gives: % 10.06/2.30 | (19) $i(all_25_0) & rf3(i2003_11_14_17_20_57644, all_25_0) & cp2(all_25_0) % 10.06/2.30 | % 10.06/2.30 | ALPHA: (19) implies: % 10.06/2.31 | (20) rf3(i2003_11_14_17_20_57644, all_25_0) % 10.06/2.31 | (21) $i(all_25_0) % 10.06/2.31 | % 10.06/2.31 | GROUND_INST: instantiating (3) with all_23_0, simplifying with (16), (18) % 10.06/2.31 | gives: % 10.06/2.31 | (22) ? [v0: $i] : ($i(v0) & ra_Px1(all_23_0, v0)) % 10.06/2.31 | % 10.06/2.31 | GROUND_INST: instantiating (axiom_10) with i2003_11_14_17_20_57644, all_25_0, % 10.06/2.31 | simplifying with (2), (20), (21) gives: % 10.06/2.31 | (23) rf2(i2003_11_14_17_20_57644, all_25_0) % 10.06/2.31 | % 10.06/2.31 | GROUND_INST: instantiating (axiom_9) with i2003_11_14_17_20_57644, all_25_0, % 10.06/2.31 | simplifying with (2), (20), (21) gives: % 10.06/2.31 | (24) rf1(i2003_11_14_17_20_57644, all_25_0) % 10.06/2.31 | % 10.06/2.31 | DELTA: instantiating (22) with fresh symbol all_33_0 gives: % 10.06/2.31 | (25) $i(all_33_0) & ra_Px1(all_23_0, all_33_0) % 10.06/2.31 | % 10.06/2.31 | ALPHA: (25) implies: % 10.06/2.31 | (26) ra_Px1(all_23_0, all_33_0) % 10.06/2.31 | (27) $i(all_33_0) % 10.06/2.31 | % 10.06/2.31 | GROUND_INST: instantiating (4) with all_21_0, all_33_0, simplifying with (12), % 10.06/2.31 | (14), (27) gives: % 10.06/2.31 | (28) ~ ra_Px1(all_21_0, all_33_0) % 10.06/2.31 | % 10.06/2.31 | GROUND_INST: instantiating (axiom_5) with i2003_11_14_17_20_57644, all_21_0, % 10.06/2.31 | all_25_0, simplifying with (2), (13), (14), (21), (24) gives: % 10.06/2.31 | (29) all_25_0 = all_21_0 % 10.06/2.31 | % 10.06/2.31 | GROUND_INST: instantiating (axiom_6) with i2003_11_14_17_20_57644, all_23_0, % 10.20/2.31 | all_25_0, simplifying with (2), (17), (18), (21), (23) gives: % 10.20/2.31 | (30) all_25_0 = all_23_0 % 10.20/2.31 | % 10.20/2.31 | COMBINE_EQS: (29), (30) imply: % 10.20/2.31 | (31) all_23_0 = all_21_0 % 10.20/2.32 | % 10.20/2.32 | REDUCE: (26), (31) imply: % 10.20/2.32 | (32) ra_Px1(all_21_0, all_33_0) % 10.20/2.32 | % 10.20/2.32 | PRED_UNIFY: (28), (32) imply: % 10.20/2.32 | (33) $false % 10.20/2.32 | % 10.20/2.32 | CLOSE: (33) is inconsistent. % 10.20/2.32 | % 10.20/2.32 End of proof % 10.20/2.32 % SZS output end Proof for theBenchmark % 10.20/2.32 % 10.20/2.32 1667ms %------------------------------------------------------------------------------