%------------------------------------------------------------------------------ % File : Princess---230619 % Problem : SYO524_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 : n009.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 : Fri Sep 1 04:53:09 EDT 2023 % Result : Theorem 3.07s 1.20s % Output : Proof 3.78s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.12/0.12 % Problem : SYO524_1 : TPTP v8.1.2. Released v5.0.0. % 0.13/0.13 % Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s % 0.13/0.34 % Computer : n009.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 : Fri Aug 25 23:44:20 EDT 2023 % 0.13/0.34 % 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.62 Running up to 7 provers in parallel. % 0.19/0.63 Prover 0: Options: +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1042961893 % 0.19/0.63 Prover 2: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMinimalAndEmpty -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1065072994 % 0.19/0.63 Prover 1: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1571432423 % 0.19/0.63 Prover 3: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1922548996 % 0.19/0.63 Prover 4: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=1868514696 % 0.19/0.63 Prover 6: Options: -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximalOutermost -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1399714365 % 0.19/0.63 Prover 5: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=complete -randomSeed=1259561288 % 2.09/0.97 Prover 1: Preprocessing ... % 2.09/0.97 Prover 4: Preprocessing ... % 2.09/1.01 Prover 0: Preprocessing ... % 2.09/1.01 Prover 5: Preprocessing ... % 2.09/1.01 Prover 2: Preprocessing ... % 2.09/1.01 Prover 3: Preprocessing ... % 2.09/1.01 Prover 6: Preprocessing ... % 2.09/1.06 Prover 3: Constructing countermodel ... % 2.09/1.06 Prover 4: Constructing countermodel ... % 2.09/1.06 Prover 1: Constructing countermodel ... % 2.09/1.06 Prover 2: Proving ... % 2.09/1.06 Prover 5: Proving ... % 2.09/1.06 Prover 0: Proving ... % 2.09/1.06 Prover 6: Proving ... % 3.07/1.19 Prover 3: proved (566ms) % 3.07/1.19 % 3.07/1.20 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 3.07/1.20 % 3.07/1.20 Prover 0: stopped % 3.07/1.20 Prover 5: stopped % 3.07/1.20 Prover 6: stopped % 3.07/1.20 Prover 7: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470 % 3.07/1.20 Prover 2: stopped % 3.07/1.20 Prover 8: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089 % 3.07/1.20 Prover 10: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=919308125 % 3.07/1.20 Prover 11: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1509710984 % 3.07/1.20 Prover 13: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=complete -randomSeed=1138197443 % 3.07/1.21 Prover 7: Preprocessing ... % 3.07/1.21 Prover 11: Preprocessing ... % 3.07/1.21 Prover 8: Preprocessing ... % 3.07/1.21 Prover 13: Preprocessing ... % 3.07/1.23 Prover 7: Constructing countermodel ... % 3.07/1.23 Prover 8: Warning: ignoring some quantifiers % 3.07/1.23 Prover 8: Constructing countermodel ... % 3.07/1.24 Prover 10: Preprocessing ... % 3.07/1.24 Prover 11: Constructing countermodel ... % 3.07/1.25 Prover 10: Constructing countermodel ... % 3.07/1.25 Prover 13: Warning: ignoring some quantifiers % 3.07/1.26 Prover 13: Constructing countermodel ... % 3.07/1.26 Prover 1: Found proof (size 18) % 3.07/1.26 Prover 4: Found proof (size 18) % 3.07/1.27 Prover 1: proved (648ms) % 3.07/1.27 Prover 13: stopped % 3.07/1.27 Prover 7: stopped % 3.07/1.27 Prover 10: stopped % 3.07/1.28 Prover 4: proved (649ms) % 3.07/1.28 Prover 8: stopped % 3.07/1.28 Prover 11: stopped % 3.07/1.28 % 3.07/1.28 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 3.07/1.28 % 3.07/1.28 % SZS output start Proof for theBenchmark % 3.07/1.29 Assumptions after simplification: % 3.07/1.29 --------------------------------- % 3.07/1.29 % 3.07/1.29 (co1) % 3.78/1.31 ? [v0: int] : ? [v1: int] : ($lesseq(4, v1) & $lesseq(v0, 3) & f(7) = v0 & % 3.78/1.31 f(4) = v1 & ! [v2: int] : ! [v3: int] : ( ~ (f($sum(v2, 2)) = v3) | ? % 3.78/1.31 [v4: int] : ($lesseq(v4, v3) & f($sum(v2, 1)) = v4))) % 3.78/1.31 % 3.78/1.31 (function-axioms) % 3.78/1.32 ! [v0: int] : ! [v1: int] : ! [v2: int] : (v1 = v0 | ~ (f(v2) = v1) | ~ % 3.78/1.32 (f(v2) = v0)) % 3.78/1.32 % 3.78/1.32 Those formulas are unsatisfiable: % 3.78/1.32 --------------------------------- % 3.78/1.32 % 3.78/1.32 Begin of proof % 3.78/1.32 | % 3.78/1.32 | DELTA: instantiating (co1) with fresh symbols all_3_0, all_3_1 gives: % 3.78/1.32 | (1) $lesseq(4, all_3_0) & $lesseq(all_3_1, 3) & f(7) = all_3_1 & f(4) = % 3.78/1.32 | all_3_0 & ! [v0: int] : ! [v1: int] : ( ~ (f($sum(v0, 2)) = v1) | ? % 3.78/1.32 | [v2: int] : ($lesseq(v2, v1) & f($sum(v0, 1)) = v2)) % 3.78/1.32 | % 3.78/1.32 | ALPHA: (1) implies: % 3.78/1.32 | (2) $lesseq(all_3_1, 3) % 3.78/1.32 | (3) $lesseq(4, all_3_0) % 3.78/1.32 | (4) f(4) = all_3_0 % 3.78/1.32 | (5) f(7) = all_3_1 % 3.78/1.33 | (6) ! [v0: int] : ! [v1: int] : ( ~ (f($sum(v0, 2)) = v1) | ? [v2: int] % 3.78/1.33 | : ($lesseq(v2, v1) & f($sum(v0, 1)) = v2)) % 3.78/1.33 | % 3.78/1.33 | GROUND_INST: instantiating (6) with 5, all_3_1, simplifying with (5) gives: % 3.78/1.33 | (7) ? [v0: int] : ($lesseq(v0, all_3_1) & f(6) = v0) % 3.78/1.33 | % 3.78/1.33 | DELTA: instantiating (7) with fresh symbol all_12_0 gives: % 3.78/1.33 | (8) $lesseq(all_12_0, all_3_1) & f(6) = all_12_0 % 3.78/1.33 | % 3.78/1.33 | ALPHA: (8) implies: % 3.78/1.33 | (9) $lesseq(all_12_0, all_3_1) % 3.78/1.33 | (10) f(6) = all_12_0 % 3.78/1.33 | % 3.78/1.33 | GROUND_INST: instantiating (6) with 4, all_12_0, simplifying with (10) gives: % 3.78/1.33 | (11) ? [v0: int] : ($lesseq(v0, all_12_0) & f(5) = v0) % 3.78/1.33 | % 3.78/1.33 | DELTA: instantiating (11) with fresh symbol all_26_0 gives: % 3.78/1.33 | (12) $lesseq(all_26_0, all_12_0) & f(5) = all_26_0 % 3.78/1.33 | % 3.78/1.33 | ALPHA: (12) implies: % 3.78/1.33 | (13) $lesseq(all_26_0, all_12_0) % 3.78/1.33 | (14) f(5) = all_26_0 % 3.78/1.33 | % 3.78/1.33 | GROUND_INST: instantiating (6) with 3, all_26_0, simplifying with (14) gives: % 3.78/1.33 | (15) ? [v0: int] : ($lesseq(v0, all_26_0) & f(4) = v0) % 3.78/1.33 | % 3.78/1.33 | DELTA: instantiating (15) with fresh symbol all_40_0 gives: % 3.78/1.33 | (16) $lesseq(all_40_0, all_26_0) & f(4) = all_40_0 % 3.78/1.33 | % 3.78/1.33 | ALPHA: (16) implies: % 3.78/1.33 | (17) $lesseq(all_40_0, all_26_0) % 3.78/1.33 | (18) f(4) = all_40_0 % 3.78/1.33 | % 3.78/1.33 | GROUND_INST: instantiating (function-axioms) with all_3_0, all_40_0, 4, % 3.78/1.33 | simplifying with (4), (18) gives: % 3.78/1.33 | (19) all_40_0 = all_3_0 % 3.78/1.33 | % 3.78/1.33 | REDUCE: (17), (19) imply: % 3.78/1.33 | (20) $lesseq(all_3_0, all_26_0) % 3.78/1.33 | % 3.78/1.33 | COMBINE_INEQS: (13), (20) imply: % 3.78/1.33 | (21) $lesseq(all_3_0, all_12_0) % 3.78/1.33 | % 3.78/1.33 | COMBINE_INEQS: (9), (21) imply: % 3.78/1.34 | (22) $lesseq(all_3_0, all_3_1) % 3.78/1.34 | % 3.78/1.34 | COMBINE_INEQS: (3), (22) imply: % 3.78/1.34 | (23) $lesseq(4, all_3_1) % 3.78/1.34 | % 3.78/1.34 | COMBINE_INEQS: (2), (23) imply: % 3.78/1.34 | (24) $false % 3.78/1.34 | % 3.78/1.34 | CLOSE: (24) is inconsistent. % 3.78/1.34 | % 3.78/1.34 End of proof % 3.78/1.34 % SZS output end Proof for theBenchmark % 3.78/1.34 % 3.78/1.34 732ms %------------------------------------------------------------------------------