%------------------------------------------------------------------------------ % File : Princess---230619 % Problem : DAT012_1 : TPTP v8.1.2. Released v5.0.0. % Transfm : none % Format : tptp % Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s % Computer : n019.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 : Wed Aug 30 22:18:52 EDT 2023 % Result : Theorem 4.51s 1.36s % Output : Proof 5.50s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.13 % Problem : DAT012_1 : TPTP v8.1.2. Released v5.0.0. % 0.00/0.14 % Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s % 0.14/0.36 % Computer : n019.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 : Thu Aug 24 14:46:58 EDT 2023 % 0.14/0.36 % CPUTime : % 0.21/0.63 ________ _____ % 0.21/0.63 ___ __ \_________(_)________________________________ % 0.21/0.63 __ /_/ /_ ___/_ /__ __ \ ___/ _ \_ ___/_ ___/ % 0.21/0.63 _ ____/_ / _ / _ / / / /__ / __/(__ )_(__ ) % 0.21/0.63 /_/ /_/ /_/ /_/ /_/\___/ \___//____/ /____/ % 0.21/0.63 % 0.21/0.63 A Theorem Prover for First-Order Logic modulo Linear Integer Arithmetic % 0.21/0.63 (2023-06-19) % 0.21/0.63 % 0.21/0.63 (c) Philipp Rümmer, 2009-2023 % 0.21/0.63 Contributors: Peter Backeman, Peter Baumgartner, Angelo Brillout, Zafer Esen, % 0.21/0.63 Amanda Stjerna. % 0.21/0.63 Free software under BSD-3-Clause. % 0.21/0.63 % 0.21/0.63 For more information, visit http://www.philipp.ruemmer.org/princess.shtml % 0.21/0.63 % 0.21/0.63 Loading /export/starexec/sandbox/benchmark/theBenchmark.p ... % 0.21/0.64 Running up to 7 provers in parallel. % 0.21/0.66 Prover 0: Options: +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1042961893 % 0.21/0.66 Prover 2: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMinimalAndEmpty -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1065072994 % 0.21/0.66 Prover 1: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1571432423 % 0.21/0.66 Prover 3: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1922548996 % 0.21/0.66 Prover 4: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=1868514696 % 0.21/0.66 Prover 5: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=complete -randomSeed=1259561288 % 0.21/0.66 Prover 6: Options: -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximalOutermost -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1399714365 % 2.40/1.04 Prover 4: Preprocessing ... % 2.40/1.04 Prover 1: Preprocessing ... % 2.69/1.09 Prover 0: Preprocessing ... % 2.69/1.09 Prover 6: Preprocessing ... % 2.69/1.09 Prover 5: Preprocessing ... % 2.69/1.09 Prover 3: Preprocessing ... % 2.69/1.09 Prover 2: Preprocessing ... % 3.56/1.20 Prover 4: Constructing countermodel ... % 3.56/1.20 Prover 3: Constructing countermodel ... % 3.56/1.20 Prover 1: Constructing countermodel ... % 3.56/1.20 Prover 0: Proving ... % 3.56/1.21 Prover 6: Proving ... % 3.56/1.22 Prover 5: Proving ... % 3.56/1.23 Prover 2: Proving ... % 4.51/1.36 Prover 3: proved (702ms) % 4.51/1.36 % 4.51/1.36 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 4.51/1.36 % 4.51/1.36 Prover 2: stopped % 4.51/1.38 Prover 5: stopped % 4.51/1.38 Prover 0: stopped % 4.51/1.39 Prover 6: stopped % 4.51/1.40 Prover 7: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470 % 4.51/1.40 Prover 8: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089 % 4.51/1.40 Prover 7: Preprocessing ... % 4.51/1.40 Prover 10: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=919308125 % 4.51/1.40 Prover 8: Preprocessing ... % 4.51/1.40 Prover 10: Preprocessing ... % 4.51/1.40 Prover 11: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1509710984 % 4.51/1.41 Prover 13: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=complete -randomSeed=1138197443 % 4.51/1.42 Prover 11: Preprocessing ... % 4.51/1.42 Prover 4: Found proof (size 29) % 4.51/1.42 Prover 4: proved (764ms) % 4.51/1.42 Prover 1: stopped % 4.51/1.44 Prover 13: Preprocessing ... % 4.51/1.45 Prover 8: Warning: ignoring some quantifiers % 4.51/1.45 Prover 8: Constructing countermodel ... % 4.51/1.45 Prover 8: stopped % 4.51/1.46 Prover 10: Constructing countermodel ... % 4.51/1.46 Prover 7: Constructing countermodel ... % 4.51/1.46 Prover 10: stopped % 4.51/1.46 Prover 7: stopped % 4.51/1.47 Prover 13: stopped % 4.51/1.47 Prover 11: Constructing countermodel ... % 4.51/1.47 Prover 11: stopped % 4.51/1.47 % 4.51/1.47 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 4.51/1.47 % 4.51/1.48 % SZS output start Proof for theBenchmark % 4.51/1.48 Assumptions after simplification: % 4.51/1.48 --------------------------------- % 4.51/1.48 % 4.51/1.48 (ax1) % 5.50/1.51 ! [v0: array] : ! [v1: int] : ! [v2: int] : ! [v3: array] : ( ~ (write(v0, % 5.50/1.51 v1, v2) = v3) | ~ array(v0) | read(v3, v1) = v2) % 5.50/1.51 % 5.50/1.51 (ax2) % 5.50/1.51 ! [v0: array] : ! [v1: int] : ! [v2: int] : ! [v3: int] : ! [v4: array] : % 5.50/1.51 ! [v5: int] : (v2 = v1 | ~ (write(v0, v1, v3) = v4) | ~ (read(v4, v2) = v5) % 5.50/1.51 | ~ array(v0) | read(v0, v2) = v5) % 5.50/1.51 % 5.50/1.51 (co1) % 5.50/1.51 ? [v0: array] : ? [v1: array] : ? [v2: int] : ? [v3: int] : ? [v4: int] : % 5.50/1.51 ? [v5: int] : ? [v6: int] : ($lesseq(v6, 0)$lesseq(v5, v3) & $lesseq(v2, v5) % 5.50/1.51 & write(v0, $sum(v2, 2), $sum(v4, 1)) = v1 & read(v1, v5) = v6 & read(v0, % 5.50/1.51 $sum(v2, 1)) = v4 & array(v1) & array(v0) & ! [v7: int] : ! [v8: int] : % 5.50/1.51 ( ~ ($lesseq(v8, 0) | ~ ($lesseq(v7, v3)) | ~ ($lesseq(v2, v7)) | ~ % 5.50/1.51 (read(v0, v7) = v8))) % 5.50/1.51 % 5.50/1.51 (function-axioms) % 5.50/1.51 ! [v0: array] : ! [v1: array] : ! [v2: int] : ! [v3: int] : ! [v4: array] % 5.50/1.51 : (v1 = v0 | ~ (write(v4, v3, v2) = v1) | ~ (write(v4, v3, v2) = v0)) & ! % 5.50/1.51 [v0: int] : ! [v1: int] : ! [v2: int] : ! [v3: array] : (v1 = v0 | ~ % 5.50/1.51 (read(v3, v2) = v1) | ~ (read(v3, v2) = v0)) % 5.50/1.51 % 5.50/1.51 Those formulas are unsatisfiable: % 5.50/1.51 --------------------------------- % 5.50/1.51 % 5.50/1.51 Begin of proof % 5.50/1.52 | % 5.50/1.52 | ALPHA: (function-axioms) implies: % 5.50/1.52 | (1) ! [v0: int] : ! [v1: int] : ! [v2: int] : ! [v3: array] : (v1 = v0 % 5.50/1.52 | | ~ (read(v3, v2) = v1) | ~ (read(v3, v2) = v0)) % 5.50/1.52 | % 5.50/1.52 | DELTA: instantiating (co1) with fresh symbols all_7_0, all_7_1, all_7_2, % 5.50/1.52 | all_7_3, all_7_4, all_7_5, all_7_6 gives: % 5.50/1.52 | (2) $lesseq(all_7_0, 0)$lesseq(all_7_1, all_7_3) & $lesseq(all_7_4, % 5.50/1.52 | all_7_1) & write(all_7_6, $sum(all_7_4, 2), $sum(all_7_2, 1)) = % 5.50/1.52 | all_7_5 & read(all_7_5, all_7_1) = all_7_0 & read(all_7_6, % 5.50/1.52 | $sum(all_7_4, 1)) = all_7_2 & array(all_7_5) & array(all_7_6) & ! % 5.50/1.52 | [v0: int] : ! [v1: int] : ( ~ ($lesseq(v1, 0) | ~ ($lesseq(v0, % 5.50/1.52 | all_7_3)) | ~ ($lesseq(all_7_4, v0)) | ~ (read(all_7_6, v0) = % 5.50/1.52 | v1)) % 5.50/1.52 | % 5.50/1.52 | ALPHA: (2) implies: % 5.50/1.52 | (3) $lesseq(all_7_4, all_7_1) % 5.50/1.52 | (4) $lesseq(all_7_1, all_7_3) % 5.50/1.52 | (5) $lesseq(all_7_0, 0) % 5.50/1.52 | (6) array(all_7_6) % 5.50/1.52 | (7) read(all_7_6, $sum(all_7_4, 1)) = all_7_2 % 5.50/1.52 | (8) read(all_7_5, all_7_1) = all_7_0 % 5.50/1.52 | (9) write(all_7_6, $sum(all_7_4, 2), $sum(all_7_2, 1)) = all_7_5 % 5.50/1.52 | (10) ! [v0: int] : ! [v1: int] : ( ~ ($lesseq(v1, 0) | ~ ($lesseq(v0, % 5.50/1.53 | all_7_3)) | ~ ($lesseq(all_7_4, v0)) | ~ (read(all_7_6, v0) % 5.50/1.53 | = v1)) % 5.50/1.53 | % 5.50/1.53 | GROUND_INST: instantiating (10) with $sum(all_7_4, 1), all_7_2, simplifying % 5.50/1.53 | with (7) gives: % 5.50/1.53 | (11) ~ ($lesseq(all_7_2, 0) | ~ ($lesseq(1, $difference(all_7_3, % 5.50/1.53 | all_7_4))) % 5.50/1.53 | % 5.50/1.53 | GROUND_INST: instantiating (ax2) with all_7_6, $sum(all_7_4, 2), all_7_1, % 5.50/1.53 | $sum(all_7_2, 1), all_7_5, all_7_0, simplifying with (6), (8), % 5.50/1.53 | (9) gives: % 5.50/1.53 | (12) $difference(all_7_1, all_7_4) = 2 | read(all_7_6, all_7_1) = all_7_0 % 5.50/1.53 | % 5.50/1.53 | GROUND_INST: instantiating (ax1) with all_7_6, $sum(all_7_4, 2), $sum(all_7_2, % 5.50/1.53 | 1), all_7_5, simplifying with (6), (9) gives: % 5.50/1.53 | (13) read(all_7_5, $sum(all_7_4, 2)) = $sum(all_7_2, 1) % 5.50/1.53 | % 5.50/1.53 | GROUND_INST: instantiating (1) with all_7_0, $sum(all_7_2, 1), $sum(all_7_4, % 5.50/1.53 | 2), all_7_5, simplifying with (13) gives: % 5.50/1.53 | (14) $difference(all_7_0, all_7_2) = 1 | ~ (read(all_7_5, $sum(all_7_4, % 5.50/1.53 | 2)) = all_7_0) % 5.50/1.53 | % 5.50/1.53 | BETA: splitting (12) gives: % 5.50/1.53 | % 5.50/1.53 | Case 1: % 5.50/1.53 | | % 5.50/1.53 | | (15) read(all_7_6, all_7_1) = all_7_0 % 5.50/1.53 | | % 5.50/1.53 | | GROUND_INST: instantiating (10) with all_7_1, all_7_0, simplifying with (15) % 5.50/1.53 | | gives: % 5.50/1.53 | | (16) ~ ($lesseq(all_7_0, 0) | ~ ($lesseq(all_7_1, all_7_3)) | ~ % 5.50/1.53 | | ($lesseq(all_7_4, all_7_1)) % 5.50/1.53 | | % 5.50/1.53 | | BETA: splitting (16) gives: % 5.50/1.53 | | % 5.50/1.53 | | Case 1: % 5.50/1.53 | | | % 5.50/1.53 | | | (17) $lesseq(1, all_7_0) % 5.50/1.53 | | | % 5.50/1.53 | | | COMBINE_INEQS: (5), (17) imply: % 5.50/1.53 | | | (18) $false % 5.50/1.53 | | | % 5.50/1.53 | | | CLOSE: (18) is inconsistent. % 5.50/1.53 | | | % 5.50/1.53 | | Case 2: % 5.50/1.53 | | | % 5.50/1.53 | | | (19) ~ ($lesseq(all_7_1, all_7_3)) | ~ ($lesseq(all_7_4, all_7_1)) % 5.50/1.53 | | | % 5.50/1.53 | | | BETA: splitting (19) gives: % 5.50/1.53 | | | % 5.50/1.53 | | | Case 1: % 5.50/1.53 | | | | % 5.50/1.53 | | | | (20) $lesseq(1, $difference(all_7_1, all_7_3)) % 5.50/1.53 | | | | % 5.50/1.53 | | | | COMBINE_INEQS: (4), (20) imply: % 5.50/1.53 | | | | (21) $false % 5.50/1.53 | | | | % 5.50/1.53 | | | | CLOSE: (21) is inconsistent. % 5.50/1.53 | | | | % 5.50/1.54 | | | Case 2: % 5.50/1.54 | | | | % 5.50/1.54 | | | | (22) $lesseq(1, $difference(all_7_4, all_7_1)) % 5.50/1.54 | | | | % 5.50/1.54 | | | | COMBINE_INEQS: (3), (22) imply: % 5.50/1.54 | | | | (23) $false % 5.50/1.54 | | | | % 5.50/1.54 | | | | CLOSE: (23) is inconsistent. % 5.50/1.54 | | | | % 5.50/1.54 | | | End of split % 5.50/1.54 | | | % 5.50/1.54 | | End of split % 5.50/1.54 | | % 5.50/1.54 | Case 2: % 5.50/1.54 | | % 5.50/1.54 | | (24) $difference(all_7_1, all_7_4) = 2 % 5.50/1.54 | | % 5.50/1.54 | | REDUCE: (4), (24) imply: % 5.50/1.54 | | (25) $lesseq(2, $difference(all_7_3, all_7_4)) % 5.50/1.54 | | % 5.50/1.54 | | REDUCE: (8), (24) imply: % 5.50/1.54 | | (26) read(all_7_5, $sum(all_7_4, 2)) = all_7_0 % 5.50/1.54 | | % 5.50/1.54 | | BETA: splitting (14) gives: % 5.50/1.54 | | % 5.50/1.54 | | Case 1: % 5.50/1.54 | | | % 5.50/1.54 | | | (27) ~ (read(all_7_5, $sum(all_7_4, 2)) = all_7_0) % 5.50/1.54 | | | % 5.50/1.54 | | | PRED_UNIFY: (26), (27) imply: % 5.50/1.54 | | | (28) $false % 5.50/1.54 | | | % 5.50/1.54 | | | CLOSE: (28) is inconsistent. % 5.50/1.54 | | | % 5.50/1.54 | | Case 2: % 5.50/1.54 | | | % 5.50/1.54 | | | (29) $difference(all_7_0, all_7_2) = 1 % 5.50/1.54 | | | % 5.50/1.54 | | | REDUCE: (5), (29) imply: % 5.50/1.54 | | | (30) $lesseq(all_7_2, -1) % 5.50/1.54 | | | % 5.50/1.54 | | | BETA: splitting (11) gives: % 5.50/1.54 | | | % 5.50/1.54 | | | Case 1: % 5.50/1.54 | | | | % 5.50/1.54 | | | | (31) $lesseq(1, all_7_2) % 5.50/1.54 | | | | % 5.50/1.54 | | | | COMBINE_INEQS: (30), (31) imply: % 5.50/1.54 | | | | (32) $false % 5.50/1.54 | | | | % 5.50/1.54 | | | | CLOSE: (32) is inconsistent. % 5.50/1.54 | | | | % 5.50/1.54 | | | Case 2: % 5.50/1.54 | | | | % 5.50/1.54 | | | | (33) $lesseq(all_7_3, all_7_4) % 5.50/1.54 | | | | % 5.50/1.54 | | | | COMBINE_INEQS: (25), (33) imply: % 5.50/1.54 | | | | (34) $false % 5.50/1.54 | | | | % 5.50/1.54 | | | | CLOSE: (34) is inconsistent. % 5.50/1.54 | | | | % 5.50/1.54 | | | End of split % 5.50/1.54 | | | % 5.50/1.54 | | End of split % 5.50/1.54 | | % 5.50/1.54 | End of split % 5.50/1.54 | % 5.50/1.54 End of proof % 5.50/1.54 % SZS output end Proof for theBenchmark % 5.50/1.54 % 5.50/1.54 909ms %------------------------------------------------------------------------------