%------------------------------------------------------------------------------ % File : Princess---230619 % Problem : SYN079+1 : TPTP v8.1.2. Released v2.0.0. % Transfm : none % Format : tptp % Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s % Computer : n015.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 03:26:31 EDT 2023 % Result : Theorem 3.19s 1.19s % Output : Proof 4.31s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.12 % Problem : SYN079+1 : TPTP v8.1.2. Released v2.0.0. % 0.00/0.13 % Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s % 0.13/0.34 % Computer : n015.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.35 % CPULimit : 300 % 0.13/0.35 % WCLimit : 300 % 0.13/0.35 % DateTime : Sat Aug 26 17:36:23 EDT 2023 % 0.13/0.35 % CPUTime : % 0.20/0.61 ________ _____ % 0.20/0.61 ___ __ \_________(_)________________________________ % 0.20/0.61 __ /_/ /_ ___/_ /__ __ \ ___/ _ \_ ___/_ ___/ % 0.20/0.61 _ ____/_ / _ / _ / / / /__ / __/(__ )_(__ ) % 0.20/0.61 /_/ /_/ /_/ /_/ /_/\___/ \___//____/ /____/ % 0.20/0.61 % 0.20/0.61 A Theorem Prover for First-Order Logic modulo Linear Integer Arithmetic % 0.20/0.61 (2023-06-19) % 0.20/0.61 % 0.20/0.61 (c) Philipp Rümmer, 2009-2023 % 0.20/0.61 Contributors: Peter Backeman, Peter Baumgartner, Angelo Brillout, Zafer Esen, % 0.20/0.61 Amanda Stjerna. % 0.20/0.61 Free software under BSD-3-Clause. % 0.20/0.61 % 0.20/0.61 For more information, visit http://www.philipp.ruemmer.org/princess.shtml % 0.20/0.61 % 0.20/0.62 Loading /export/starexec/sandbox/benchmark/theBenchmark.p ... % 0.20/0.63 Running up to 7 provers in parallel. % 0.20/0.64 Prover 0: Options: +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1042961893 % 0.20/0.64 Prover 1: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1571432423 % 0.20/0.64 Prover 2: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMinimalAndEmpty -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1065072994 % 0.20/0.64 Prover 3: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1922548996 % 0.20/0.64 Prover 4: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=1868514696 % 0.20/0.64 Prover 5: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=complete -randomSeed=1259561288 % 0.20/0.64 Prover 6: Options: -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximalOutermost -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1399714365 % 1.77/0.96 Prover 1: Preprocessing ... % 1.77/0.96 Prover 4: Preprocessing ... % 2.22/1.00 Prover 2: Preprocessing ... % 2.22/1.00 Prover 5: Preprocessing ... % 2.22/1.00 Prover 3: Preprocessing ... % 2.22/1.00 Prover 0: Preprocessing ... % 2.22/1.00 Prover 6: Preprocessing ... % 2.81/1.08 Prover 6: Constructing countermodel ... % 2.81/1.08 Prover 3: Constructing countermodel ... % 2.91/1.08 Prover 5: Constructing countermodel ... % 2.91/1.09 Prover 2: Proving ... % 2.91/1.09 Prover 4: Constructing countermodel ... % 2.91/1.09 Prover 1: Constructing countermodel ... % 2.91/1.10 Prover 0: Proving ... % 3.19/1.18 Prover 3: proved (545ms) % 3.19/1.18 % 3.19/1.19 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 3.19/1.19 % 3.19/1.19 Prover 7: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470 % 3.19/1.19 Prover 2: stopped % 3.19/1.19 Prover 6: stopped % 3.19/1.19 Prover 0: proved (555ms) % 3.19/1.19 % 3.19/1.19 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 3.19/1.19 % 3.19/1.20 Prover 5: stopped % 3.19/1.21 Prover 10: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=919308125 % 3.19/1.21 Prover 8: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089 % 3.19/1.21 Prover 11: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1509710984 % 3.19/1.21 Prover 8: Preprocessing ... % 3.19/1.21 Prover 13: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=complete -randomSeed=1138197443 % 3.19/1.21 Prover 11: Preprocessing ... % 3.19/1.21 Prover 7: Preprocessing ... % 3.19/1.21 Prover 10: Preprocessing ... % 3.83/1.22 Prover 13: Preprocessing ... % 3.83/1.24 Prover 7: Constructing countermodel ... % 3.83/1.24 Prover 10: Constructing countermodel ... % 3.83/1.24 Prover 8: Warning: ignoring some quantifiers % 3.83/1.24 Prover 8: Constructing countermodel ... % 3.83/1.26 Prover 13: Constructing countermodel ... % 3.83/1.27 Prover 4: Found proof (size 24) % 3.83/1.27 Prover 4: proved (633ms) % 3.83/1.27 Prover 1: Found proof (size 27) % 3.83/1.27 Prover 1: proved (637ms) % 3.83/1.27 Prover 8: stopped % 3.83/1.27 Prover 7: stopped % 3.83/1.27 Prover 10: stopped % 3.83/1.27 Prover 13: stopped % 3.83/1.28 Prover 11: Constructing countermodel ... % 4.31/1.29 Prover 11: stopped % 4.31/1.29 % 4.31/1.29 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 4.31/1.29 % 4.31/1.29 % SZS output start Proof for theBenchmark % 4.31/1.30 Assumptions after simplification: % 4.31/1.30 --------------------------------- % 4.31/1.30 % 4.31/1.30 (pel57) % 4.31/1.33 $i(c) & $i(b) & $i(a) & ? [v0: $i] : ? [v1: $i] : ? [v2: int] : ( ~ (v2 = % 4.31/1.33 0) & f(a, c) = v1 & f(a, b) = v0 & big_f(v0, v1) = v2 & $i(v1) & $i(v0)) % 4.31/1.33 % 4.31/1.33 (pel57_1) % 4.31/1.33 $i(c) & $i(b) & $i(a) & ? [v0: $i] : ? [v1: $i] : (f(b, c) = v1 & f(a, b) = % 4.31/1.33 v0 & big_f(v0, v1) = 0 & $i(v1) & $i(v0)) % 4.31/1.33 % 4.31/1.33 (pel57_2) % 4.31/1.33 $i(c) & $i(b) & $i(a) & ? [v0: $i] : ? [v1: $i] : (f(b, c) = v0 & f(a, c) = % 4.31/1.33 v1 & big_f(v0, v1) = 0 & $i(v1) & $i(v0)) % 4.31/1.33 % 4.31/1.33 (pel57_3) % 4.31/1.34 ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: int] : (v3 = 0 | ~ % 4.31/1.34 (big_f(v1, v2) = 0) | ~ (big_f(v0, v2) = v3) | ~ $i(v2) | ~ $i(v1) | ~ % 4.31/1.34 $i(v0) | ? [v4: int] : ( ~ (v4 = 0) & big_f(v0, v1) = v4)) & ! [v0: $i] : % 4.31/1.34 ! [v1: $i] : ! [v2: $i] : ! [v3: int] : (v3 = 0 | ~ (big_f(v0, v2) = v3) | % 4.31/1.34 ~ (big_f(v0, v1) = 0) | ~ $i(v2) | ~ $i(v1) | ~ $i(v0) | ? [v4: int] : ( % 4.31/1.34 ~ (v4 = 0) & big_f(v1, v2) = v4)) & ! [v0: $i] : ! [v1: $i] : ! [v2: % 4.31/1.34 $i] : ( ~ (big_f(v1, v2) = 0) | ~ (big_f(v0, v1) = 0) | ~ $i(v2) | ~ % 4.31/1.34 $i(v1) | ~ $i(v0) | big_f(v0, v2) = 0) % 4.31/1.34 % 4.31/1.34 (function-axioms) % 4.31/1.34 ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: $i] : (v1 = v0 | ~ (f(v3, % 4.31/1.34 v2) = v1) | ~ (f(v3, v2) = v0)) & ! [v0: MultipleValueBool] : ! [v1: % 4.31/1.34 MultipleValueBool] : ! [v2: $i] : ! [v3: $i] : (v1 = v0 | ~ (big_f(v3, % 4.31/1.34 v2) = v1) | ~ (big_f(v3, v2) = v0)) % 4.31/1.34 % 4.31/1.34 Those formulas are unsatisfiable: % 4.31/1.34 --------------------------------- % 4.31/1.34 % 4.31/1.34 Begin of proof % 4.31/1.34 | % 4.31/1.34 | ALPHA: (pel57_1) implies: % 4.31/1.34 | (1) ? [v0: $i] : ? [v1: $i] : (f(b, c) = v1 & f(a, b) = v0 & big_f(v0, % 4.31/1.34 | v1) = 0 & $i(v1) & $i(v0)) % 4.31/1.34 | % 4.31/1.34 | ALPHA: (pel57_2) implies: % 4.31/1.34 | (2) ? [v0: $i] : ? [v1: $i] : (f(b, c) = v0 & f(a, c) = v1 & big_f(v0, % 4.31/1.34 | v1) = 0 & $i(v1) & $i(v0)) % 4.31/1.34 | % 4.31/1.34 | ALPHA: (pel57_3) implies: % 4.31/1.35 | (3) ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ( ~ (big_f(v1, v2) = 0) | ~ % 4.31/1.35 | (big_f(v0, v1) = 0) | ~ $i(v2) | ~ $i(v1) | ~ $i(v0) | big_f(v0, % 4.31/1.35 | v2) = 0) % 4.31/1.35 | % 4.31/1.35 | ALPHA: (pel57) implies: % 4.31/1.35 | (4) ? [v0: $i] : ? [v1: $i] : ? [v2: int] : ( ~ (v2 = 0) & f(a, c) = v1 % 4.31/1.35 | & f(a, b) = v0 & big_f(v0, v1) = v2 & $i(v1) & $i(v0)) % 4.31/1.35 | % 4.31/1.35 | ALPHA: (function-axioms) implies: % 4.31/1.35 | (5) ! [v0: MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] : % 4.31/1.35 | ! [v3: $i] : (v1 = v0 | ~ (big_f(v3, v2) = v1) | ~ (big_f(v3, v2) = % 4.31/1.35 | v0)) % 4.31/1.35 | (6) ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: $i] : (v1 = v0 | ~ % 4.31/1.35 | (f(v3, v2) = v1) | ~ (f(v3, v2) = v0)) % 4.31/1.35 | % 4.31/1.35 | DELTA: instantiating (1) with fresh symbols all_5_0, all_5_1 gives: % 4.31/1.35 | (7) f(b, c) = all_5_0 & f(a, b) = all_5_1 & big_f(all_5_1, all_5_0) = 0 & % 4.31/1.35 | $i(all_5_0) & $i(all_5_1) % 4.31/1.35 | % 4.31/1.35 | ALPHA: (7) implies: % 4.31/1.35 | (8) big_f(all_5_1, all_5_0) = 0 % 4.31/1.35 | (9) f(a, b) = all_5_1 % 4.31/1.35 | (10) f(b, c) = all_5_0 % 4.31/1.35 | % 4.31/1.35 | DELTA: instantiating (2) with fresh symbols all_7_0, all_7_1 gives: % 4.31/1.35 | (11) f(b, c) = all_7_1 & f(a, c) = all_7_0 & big_f(all_7_1, all_7_0) = 0 & % 4.31/1.35 | $i(all_7_0) & $i(all_7_1) % 4.31/1.35 | % 4.31/1.35 | ALPHA: (11) implies: % 4.31/1.35 | (12) $i(all_7_1) % 4.31/1.35 | (13) big_f(all_7_1, all_7_0) = 0 % 4.31/1.36 | (14) f(a, c) = all_7_0 % 4.31/1.36 | (15) f(b, c) = all_7_1 % 4.31/1.36 | % 4.31/1.36 | DELTA: instantiating (4) with fresh symbols all_9_0, all_9_1, all_9_2 gives: % 4.31/1.36 | (16) ~ (all_9_0 = 0) & f(a, c) = all_9_1 & f(a, b) = all_9_2 & % 4.31/1.36 | big_f(all_9_2, all_9_1) = all_9_0 & $i(all_9_1) & $i(all_9_2) % 4.31/1.36 | % 4.31/1.36 | ALPHA: (16) implies: % 4.31/1.36 | (17) ~ (all_9_0 = 0) % 4.31/1.36 | (18) $i(all_9_2) % 4.31/1.36 | (19) $i(all_9_1) % 4.31/1.36 | (20) big_f(all_9_2, all_9_1) = all_9_0 % 4.31/1.36 | (21) f(a, b) = all_9_2 % 4.31/1.36 | (22) f(a, c) = all_9_1 % 4.31/1.36 | % 4.31/1.36 | GROUND_INST: instantiating (6) with all_5_1, all_9_2, b, a, simplifying with % 4.31/1.36 | (9), (21) gives: % 4.31/1.36 | (23) all_9_2 = all_5_1 % 4.31/1.36 | % 4.31/1.36 | GROUND_INST: instantiating (6) with all_7_0, all_9_1, c, a, simplifying with % 4.31/1.36 | (14), (22) gives: % 4.31/1.36 | (24) all_9_1 = all_7_0 % 4.31/1.36 | % 4.31/1.36 | GROUND_INST: instantiating (6) with all_5_0, all_7_1, c, b, simplifying with % 4.31/1.36 | (10), (15) gives: % 4.31/1.36 | (25) all_7_1 = all_5_0 % 4.31/1.36 | % 4.31/1.36 | REDUCE: (20), (23), (24) imply: % 4.31/1.36 | (26) big_f(all_5_1, all_7_0) = all_9_0 % 4.31/1.36 | % 4.31/1.36 | REDUCE: (13), (25) imply: % 4.31/1.36 | (27) big_f(all_5_0, all_7_0) = 0 % 4.31/1.36 | % 4.31/1.36 | REDUCE: (19), (24) imply: % 4.31/1.36 | (28) $i(all_7_0) % 4.31/1.36 | % 4.31/1.36 | REDUCE: (18), (23) imply: % 4.31/1.36 | (29) $i(all_5_1) % 4.31/1.36 | % 4.31/1.36 | REDUCE: (12), (25) imply: % 4.31/1.36 | (30) $i(all_5_0) % 4.31/1.36 | % 4.31/1.36 | GROUND_INST: instantiating (3) with all_5_1, all_5_0, all_7_0, simplifying % 4.31/1.36 | with (8), (27), (28), (29), (30) gives: % 4.31/1.36 | (31) big_f(all_5_1, all_7_0) = 0 % 4.31/1.36 | % 4.31/1.36 | GROUND_INST: instantiating (5) with all_9_0, 0, all_7_0, all_5_1, simplifying % 4.31/1.36 | with (26), (31) gives: % 4.31/1.36 | (32) all_9_0 = 0 % 4.31/1.36 | % 4.31/1.36 | REDUCE: (17), (32) imply: % 4.31/1.36 | (33) $false % 4.31/1.37 | % 4.31/1.37 | CLOSE: (33) is inconsistent. % 4.31/1.37 | % 4.31/1.37 End of proof % 4.31/1.37 % SZS output end Proof for theBenchmark % 4.31/1.37 % 4.31/1.37 750ms %------------------------------------------------------------------------------