%------------------------------------------------------------------------------ % File : Princess---230619 % Problem : DAT017_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 : n028.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:53 EDT 2023 % Result : Theorem 4.55s 1.43s % Output : Proof 6.06s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.12 % Problem : DAT017_1 : TPTP v8.1.2. Released v5.0.0. % 0.00/0.12 % Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s % 0.13/0.33 % Computer : n028.cluster.edu % 0.13/0.33 % Model : x86_64 x86_64 % 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.13/0.33 % Memory : 8042.1875MB % 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64 % 0.13/0.33 % CPULimit : 300 % 0.13/0.33 % WCLimit : 300 % 0.13/0.33 % DateTime : Thu Aug 24 14:33:04 EDT 2023 % 0.13/0.33 % CPUTime : % 0.19/0.60 ________ _____ % 0.19/0.60 ___ __ \_________(_)________________________________ % 0.19/0.60 __ /_/ /_ ___/_ /__ __ \ ___/ _ \_ ___/_ ___/ % 0.19/0.60 _ ____/_ / _ / _ / / / /__ / __/(__ )_(__ ) % 0.19/0.60 /_/ /_/ /_/ /_/ /_/\___/ \___//____/ /____/ % 0.19/0.60 % 0.19/0.60 A Theorem Prover for First-Order Logic modulo Linear Integer Arithmetic % 0.19/0.60 (2023-06-19) % 0.19/0.60 % 0.19/0.60 (c) Philipp Rümmer, 2009-2023 % 0.19/0.60 Contributors: Peter Backeman, Peter Baumgartner, Angelo Brillout, Zafer Esen, % 0.19/0.60 Amanda Stjerna. % 0.19/0.60 Free software under BSD-3-Clause. % 0.19/0.60 % 0.19/0.60 For more information, visit http://www.philipp.ruemmer.org/princess.shtml % 0.19/0.60 % 0.19/0.60 Loading /export/starexec/sandbox/benchmark/theBenchmark.p ... % 0.19/0.61 Running up to 7 provers in parallel. % 0.19/0.62 Prover 2: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMinimalAndEmpty -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1065072994 % 0.19/0.62 Prover 0: Options: +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1042961893 % 0.19/0.62 Prover 1: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1571432423 % 0.19/0.62 Prover 3: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1922548996 % 0.19/0.62 Prover 4: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=1868514696 % 0.19/0.62 Prover 6: Options: -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximalOutermost -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1399714365 % 0.19/0.62 Prover 5: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=complete -randomSeed=1259561288 % 2.24/1.05 Prover 1: Preprocessing ... % 2.24/1.05 Prover 4: Preprocessing ... % 2.73/1.10 Prover 2: Preprocessing ... % 2.73/1.10 Prover 0: Preprocessing ... % 2.73/1.10 Prover 3: Preprocessing ... % 2.73/1.10 Prover 6: Preprocessing ... % 2.73/1.10 Prover 5: Preprocessing ... % 3.47/1.21 Prover 3: Constructing countermodel ... % 3.47/1.21 Prover 4: Constructing countermodel ... % 3.53/1.21 Prover 1: Constructing countermodel ... % 3.53/1.21 Prover 0: Proving ... % 3.53/1.22 Prover 6: Proving ... % 3.53/1.24 Prover 2: Proving ... % 3.53/1.24 Prover 5: Proving ... % 3.53/1.31 Prover 3: gave up % 3.53/1.32 Prover 1: gave up % 3.53/1.32 Prover 7: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470 % 3.53/1.32 Prover 8: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089 % 3.53/1.35 Prover 8: Preprocessing ... % 3.53/1.36 Prover 7: Preprocessing ... % 3.53/1.41 Prover 8: Warning: ignoring some quantifiers % 3.53/1.41 Prover 7: Constructing countermodel ... % 3.53/1.42 Prover 8: Constructing countermodel ... % 3.53/1.42 Prover 0: proved (806ms) % 4.55/1.43 % 4.55/1.43 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 4.55/1.43 % 4.55/1.43 Prover 5: stopped % 4.55/1.43 Prover 2: stopped % 4.55/1.43 Prover 10: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=919308125 % 4.55/1.43 Prover 6: stopped % 4.55/1.43 Prover 11: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1509710984 % 4.55/1.44 Prover 16: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=completeFrugal -randomSeed=-2043353683 % 4.55/1.44 Prover 13: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=complete -randomSeed=1138197443 % 4.55/1.46 Prover 10: Preprocessing ... % 4.55/1.46 Prover 8: gave up % 4.55/1.46 Prover 19: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=complete -randomSeed=-1780594085 % 4.55/1.46 Prover 11: Preprocessing ... % 4.55/1.46 Prover 16: Preprocessing ... % 4.55/1.47 Prover 13: Preprocessing ... % 4.55/1.47 Prover 19: Preprocessing ... % 4.55/1.49 Prover 10: Constructing countermodel ... % 4.55/1.49 Prover 16: Warning: ignoring some quantifiers % 4.55/1.50 Prover 16: Constructing countermodel ... % 4.55/1.50 Prover 4: Found proof (size 37) % 4.55/1.50 Prover 4: proved (884ms) % 4.55/1.50 Prover 10: stopped % 4.55/1.50 Prover 7: stopped % 4.55/1.50 Prover 11: Constructing countermodel ... % 4.55/1.50 Prover 16: stopped % 4.55/1.51 Prover 11: stopped % 5.61/1.52 Prover 13: Warning: ignoring some quantifiers % 5.61/1.52 Prover 13: Constructing countermodel ... % 5.61/1.52 Prover 19: Warning: ignoring some quantifiers % 5.61/1.53 Prover 19: Constructing countermodel ... % 5.61/1.53 Prover 13: stopped % 5.61/1.53 Prover 19: stopped % 5.61/1.53 % 5.61/1.53 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 5.61/1.53 % 5.61/1.54 % SZS output start Proof for theBenchmark % 5.61/1.54 Assumptions after simplification: % 5.61/1.54 --------------------------------- % 5.61/1.54 % 5.61/1.54 (ax1) % 5.61/1.57 ! [v0: array] : ! [v1: int] : ! [v2: int] : ! [v3: array] : ( ~ (write(v0, % 5.61/1.57 v1, v2) = v3) | ~ array(v0) | read(v3, v1) = v2) % 5.61/1.57 % 5.61/1.57 (ax2) % 5.61/1.57 ! [v0: array] : ! [v1: int] : ! [v2: int] : ! [v3: int] : ! [v4: array] : % 5.61/1.57 ! [v5: int] : (v2 = v1 | ~ (write(v0, v1, v3) = v4) | ~ (read(v4, v2) = v5) % 5.61/1.57 | ~ array(v0) | read(v0, v2) = v5) % 5.61/1.57 % 5.61/1.57 (co1) % 5.61/1.58 ? [v0: array] : ? [v1: array] : ? [v2: int] : ? [v3: int] : ? [v4: int] : % 5.61/1.58 ? [v5: int] : ? [v6: int] : ? [v7: array] : ? [v8: int] : ? [v9: array] : % 5.61/1.58 ( ~ (v6 = v5) & write(v9, v2, 0) = v0 & write(v7, v4, $sum(v8, 1)) = v9 & % 5.61/1.58 write(v1, v3, 0) = v7 & read(v1, v4) = v8 & read(v1, v3) = v6 & read(v1, v2) % 5.61/1.58 = v5 & array(v9) & array(v7) & array(v1) & array(v0) & ! [v10: int] : ! % 5.61/1.58 [v11: int] : ( ~ (read(v1, v10) = v11) | read(v0, v10) = v11) & ! [v10: % 5.61/1.58 int] : ! [v11: int] : ( ~ (read(v0, v10) = v11) | read(v1, v10) = v11)) % 5.61/1.58 % 5.61/1.58 (function-axioms) % 5.61/1.58 ! [v0: array] : ! [v1: array] : ! [v2: int] : ! [v3: int] : ! [v4: array] % 5.61/1.58 : (v1 = v0 | ~ (write(v4, v3, v2) = v1) | ~ (write(v4, v3, v2) = v0)) & ! % 5.61/1.58 [v0: int] : ! [v1: int] : ! [v2: int] : ! [v3: array] : (v1 = v0 | ~ % 5.61/1.58 (read(v3, v2) = v1) | ~ (read(v3, v2) = v0)) % 5.61/1.58 % 5.61/1.58 Those formulas are unsatisfiable: % 5.61/1.58 --------------------------------- % 5.61/1.58 % 5.61/1.58 Begin of proof % 5.61/1.58 | % 5.61/1.58 | ALPHA: (function-axioms) implies: % 5.61/1.58 | (1) ! [v0: int] : ! [v1: int] : ! [v2: int] : ! [v3: array] : (v1 = v0 % 5.61/1.58 | | ~ (read(v3, v2) = v1) | ~ (read(v3, v2) = v0)) % 5.61/1.58 | % 5.61/1.58 | DELTA: instantiating (co1) with fresh symbols all_7_0, all_7_1, all_7_2, % 5.61/1.58 | all_7_3, all_7_4, all_7_5, all_7_6, all_7_7, all_7_8, all_7_9 gives: % 5.61/1.58 | (2) ~ (all_7_3 = all_7_4) & write(all_7_0, all_7_7, 0) = all_7_9 & % 5.61/1.58 | write(all_7_2, all_7_5, $sum(all_7_1, 1)) = all_7_0 & write(all_7_8, % 5.61/1.59 | all_7_6, 0) = all_7_2 & read(all_7_8, all_7_5) = all_7_1 & % 5.61/1.59 | read(all_7_8, all_7_6) = all_7_3 & read(all_7_8, all_7_7) = all_7_4 & % 5.61/1.59 | array(all_7_0) & array(all_7_2) & array(all_7_8) & array(all_7_9) & ! % 5.61/1.59 | [v0: int] : ! [v1: int] : ( ~ (read(all_7_8, v0) = v1) | read(all_7_9, % 5.61/1.59 | v0) = v1) & ! [v0: int] : ! [v1: int] : ( ~ (read(all_7_9, v0) = % 5.61/1.59 | v1) | read(all_7_8, v0) = v1) % 5.61/1.59 | % 5.61/1.59 | ALPHA: (2) implies: % 5.61/1.59 | (3) ~ (all_7_3 = all_7_4) % 5.61/1.59 | (4) array(all_7_8) % 5.61/1.59 | (5) array(all_7_2) % 5.61/1.59 | (6) array(all_7_0) % 5.61/1.59 | (7) read(all_7_8, all_7_7) = all_7_4 % 5.61/1.59 | (8) read(all_7_8, all_7_6) = all_7_3 % 5.61/1.59 | (9) read(all_7_8, all_7_5) = all_7_1 % 5.61/1.59 | (10) write(all_7_8, all_7_6, 0) = all_7_2 % 5.61/1.59 | (11) write(all_7_2, all_7_5, $sum(all_7_1, 1)) = all_7_0 % 5.61/1.59 | (12) write(all_7_0, all_7_7, 0) = all_7_9 % 5.61/1.59 | (13) ! [v0: int] : ! [v1: int] : ( ~ (read(all_7_8, v0) = v1) | % 5.61/1.59 | read(all_7_9, v0) = v1) % 5.61/1.59 | % 5.61/1.59 | GROUND_INST: instantiating (13) with all_7_7, all_7_4, simplifying with (7) % 5.61/1.59 | gives: % 5.61/1.59 | (14) read(all_7_9, all_7_7) = all_7_4 % 5.61/1.59 | % 5.61/1.59 | GROUND_INST: instantiating (13) with all_7_6, all_7_3, simplifying with (8) % 5.61/1.59 | gives: % 5.61/1.59 | (15) read(all_7_9, all_7_6) = all_7_3 % 5.61/1.59 | % 5.61/1.59 | GROUND_INST: instantiating (13) with all_7_5, all_7_1, simplifying with (9) % 5.61/1.59 | gives: % 5.61/1.59 | (16) read(all_7_9, all_7_5) = all_7_1 % 5.61/1.59 | % 5.61/1.59 | GROUND_INST: instantiating (ax1) with all_7_8, all_7_6, 0, all_7_2, % 5.61/1.59 | simplifying with (4), (10) gives: % 5.61/1.59 | (17) read(all_7_2, all_7_6) = 0 % 5.61/1.59 | % 5.61/1.59 | GROUND_INST: instantiating (ax1) with all_7_2, all_7_5, $sum(all_7_1, 1), % 5.61/1.59 | all_7_0, simplifying with (5), (11) gives: % 5.61/1.59 | (18) read(all_7_0, all_7_5) = $sum(all_7_1, 1) % 5.61/1.59 | % 5.61/1.59 | GROUND_INST: instantiating (ax1) with all_7_0, all_7_7, 0, all_7_9, % 5.61/1.59 | simplifying with (6), (12) gives: % 5.61/1.59 | (19) read(all_7_9, all_7_7) = 0 % 5.61/1.59 | % 5.61/1.59 | GROUND_INST: instantiating (1) with 0, all_7_4, all_7_7, all_7_9, simplifying % 5.61/1.59 | with (14), (19) gives: % 5.61/1.60 | (20) all_7_4 = 0 % 5.61/1.60 | % 5.61/1.60 | REDUCE: (3), (20) imply: % 5.61/1.60 | (21) ~ (all_7_3 = 0) % 5.61/1.60 | % 5.61/1.60 | REDUCE: (7), (20) imply: % 5.61/1.60 | (22) read(all_7_8, all_7_7) = 0 % 5.61/1.60 | % 5.61/1.60 | GROUND_INST: instantiating (ax2) with all_7_0, all_7_7, all_7_6, 0, all_7_9, % 5.61/1.60 | all_7_3, simplifying with (6), (12), (15) gives: % 5.61/1.60 | (23) all_7_6 = all_7_7 | read(all_7_0, all_7_6) = all_7_3 % 5.61/1.60 | % 5.61/1.60 | GROUND_INST: instantiating (ax2) with all_7_0, all_7_7, all_7_5, 0, all_7_9, % 5.61/1.60 | all_7_1, simplifying with (6), (12), (16) gives: % 5.61/1.60 | (24) all_7_5 = all_7_7 | read(all_7_0, all_7_5) = all_7_1 % 5.61/1.60 | % 5.61/1.60 | BETA: splitting (24) gives: % 5.61/1.60 | % 5.61/1.60 | Case 1: % 5.61/1.60 | | % 5.61/1.60 | | (25) read(all_7_0, all_7_5) = all_7_1 % 5.61/1.60 | | % 5.61/1.60 | | GROUND_INST: instantiating (1) with $sum(all_7_1, 1), all_7_1, all_7_5, % 5.61/1.60 | | all_7_0, simplifying with (18), (25) gives: % 5.61/1.60 | | (26) $false % 5.61/1.60 | | % 5.61/1.60 | | CLOSE: (26) is inconsistent. % 5.61/1.60 | | % 5.61/1.60 | Case 2: % 5.61/1.60 | | % 5.61/1.60 | | (27) all_7_5 = all_7_7 % 5.61/1.60 | | % 5.61/1.60 | | REDUCE: (11), (27) imply: % 6.06/1.60 | | (28) write(all_7_2, all_7_7, $sum(all_7_1, 1)) = all_7_0 % 6.06/1.60 | | % 6.06/1.60 | | REDUCE: (9), (27) imply: % 6.06/1.60 | | (29) read(all_7_8, all_7_7) = all_7_1 % 6.06/1.60 | | % 6.06/1.60 | | GROUND_INST: instantiating (1) with 0, all_7_1, all_7_7, all_7_8, % 6.06/1.60 | | simplifying with (22), (29) gives: % 6.06/1.60 | | (30) all_7_1 = 0 % 6.06/1.60 | | % 6.06/1.60 | | REDUCE: (28), (30) imply: % 6.06/1.60 | | (31) write(all_7_2, all_7_7, 1) = all_7_0 % 6.06/1.60 | | % 6.06/1.60 | | BETA: splitting (23) gives: % 6.06/1.60 | | % 6.06/1.60 | | Case 1: % 6.06/1.60 | | | % 6.06/1.60 | | | (32) read(all_7_0, all_7_6) = all_7_3 % 6.06/1.60 | | | % 6.06/1.60 | | | GROUND_INST: instantiating (ax2) with all_7_2, all_7_7, all_7_6, 1, % 6.06/1.60 | | | all_7_0, all_7_3, simplifying with (5), (31), (32) gives: % 6.06/1.60 | | | (33) all_7_6 = all_7_7 | read(all_7_2, all_7_6) = all_7_3 % 6.06/1.60 | | | % 6.06/1.61 | | | BETA: splitting (33) gives: % 6.06/1.61 | | | % 6.06/1.61 | | | Case 1: % 6.06/1.61 | | | | % 6.06/1.61 | | | | (34) read(all_7_2, all_7_6) = all_7_3 % 6.06/1.61 | | | | % 6.06/1.61 | | | | GROUND_INST: instantiating (1) with 0, all_7_3, all_7_6, all_7_2, % 6.06/1.61 | | | | simplifying with (17), (34) gives: % 6.06/1.61 | | | | (35) all_7_3 = 0 % 6.06/1.61 | | | | % 6.06/1.61 | | | | REDUCE: (21), (35) imply: % 6.06/1.61 | | | | (36) $false % 6.06/1.61 | | | | % 6.06/1.61 | | | | CLOSE: (36) is inconsistent. % 6.06/1.61 | | | | % 6.06/1.61 | | | Case 2: % 6.06/1.61 | | | | % 6.06/1.61 | | | | (37) all_7_6 = all_7_7 % 6.06/1.61 | | | | % 6.06/1.61 | | | | REDUCE: (8), (37) imply: % 6.06/1.61 | | | | (38) read(all_7_8, all_7_7) = all_7_3 % 6.06/1.61 | | | | % 6.06/1.61 | | | | GROUND_INST: instantiating (1) with 0, all_7_3, all_7_7, all_7_8, % 6.06/1.61 | | | | simplifying with (22), (38) gives: % 6.06/1.61 | | | | (39) all_7_3 = 0 % 6.06/1.61 | | | | % 6.06/1.61 | | | | REDUCE: (21), (39) imply: % 6.06/1.61 | | | | (40) $false % 6.06/1.61 | | | | % 6.06/1.61 | | | | CLOSE: (40) is inconsistent. % 6.06/1.61 | | | | % 6.06/1.61 | | | End of split % 6.06/1.61 | | | % 6.06/1.61 | | Case 2: % 6.06/1.61 | | | % 6.06/1.61 | | | (41) all_7_6 = all_7_7 % 6.06/1.61 | | | % 6.06/1.61 | | | REDUCE: (8), (41) imply: % 6.06/1.61 | | | (42) read(all_7_8, all_7_7) = all_7_3 % 6.06/1.61 | | | % 6.06/1.61 | | | GROUND_INST: instantiating (1) with 0, all_7_3, all_7_7, all_7_8, % 6.06/1.61 | | | simplifying with (22), (42) gives: % 6.06/1.61 | | | (43) all_7_3 = 0 % 6.06/1.61 | | | % 6.06/1.61 | | | REDUCE: (21), (43) imply: % 6.06/1.61 | | | (44) $false % 6.06/1.61 | | | % 6.06/1.61 | | | CLOSE: (44) is inconsistent. % 6.06/1.61 | | | % 6.06/1.61 | | End of split % 6.06/1.61 | | % 6.06/1.61 | End of split % 6.06/1.61 | % 6.06/1.61 End of proof % 6.06/1.61 % SZS output end Proof for theBenchmark % 6.06/1.61 % 6.06/1.61 1013ms %------------------------------------------------------------------------------