%------------------------------------------------------------------------------ % File : Princess---230619 % Problem : SEU163+1 : TPTP v8.1.2. Released v3.3.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 : Thu Aug 31 17:42:56 EDT 2023 % Result : Theorem 3.10s 1.16s % Output : Proof 4.19s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.10/0.12 % Problem : SEU163+1 : TPTP v8.1.2. Released v3.3.0. % 0.10/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 : Wed Aug 23 13:27:21 EDT 2023 % 0.13/0.34 % 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.61 Loading /export/starexec/sandbox2/benchmark/theBenchmark.p ... % 0.20/0.62 Running up to 7 provers in parallel. % 0.20/0.63 Prover 1: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1571432423 % 0.20/0.63 Prover 0: Options: +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1042961893 % 0.20/0.63 Prover 2: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMinimalAndEmpty -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1065072994 % 0.20/0.63 Prover 3: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1922548996 % 0.20/0.63 Prover 4: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=1868514696 % 0.20/0.63 Prover 5: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=complete -randomSeed=1259561288 % 0.20/0.63 Prover 6: Options: -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximalOutermost -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1399714365 % 1.53/0.95 Prover 4: Preprocessing ... % 1.53/0.95 Prover 1: Preprocessing ... % 2.27/0.99 Prover 6: Preprocessing ... % 2.27/0.99 Prover 0: Preprocessing ... % 2.27/0.99 Prover 5: Preprocessing ... % 2.27/1.00 Prover 2: Preprocessing ... % 2.27/1.00 Prover 3: Preprocessing ... % 2.60/1.06 Prover 1: Warning: ignoring some quantifiers % 2.60/1.07 Prover 3: Warning: ignoring some quantifiers % 2.60/1.08 Prover 3: Constructing countermodel ... % 2.60/1.08 Prover 2: Proving ... % 2.60/1.08 Prover 6: Proving ... % 2.60/1.08 Prover 4: Constructing countermodel ... % 2.60/1.08 Prover 1: Constructing countermodel ... % 2.60/1.08 Prover 5: Proving ... % 3.10/1.11 Prover 0: Proving ... % 3.10/1.16 Prover 6: proved (524ms) % 3.10/1.16 Prover 2: proved (529ms) % 3.10/1.16 Prover 5: proved (525ms) % 3.10/1.16 % 3.10/1.16 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 3.10/1.16 % 3.10/1.16 % 3.10/1.16 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 3.10/1.16 % 3.10/1.16 % 3.10/1.16 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 3.10/1.16 % 3.10/1.16 Prover 0: proved (531ms) % 3.10/1.16 % 3.10/1.16 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 3.10/1.16 % 3.10/1.16 Prover 3: proved (530ms) % 3.10/1.16 % 3.10/1.16 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 3.10/1.16 % 3.10/1.16 Prover 7: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470 % 3.10/1.16 Prover 8: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089 % 3.10/1.16 Prover 10: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=919308125 % 3.10/1.16 Prover 11: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1509710984 % 3.10/1.16 Prover 13: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=complete -randomSeed=1138197443 % 3.53/1.18 Prover 10: Preprocessing ... % 3.53/1.18 Prover 13: Preprocessing ... % 3.53/1.18 Prover 7: Preprocessing ... % 3.53/1.20 Prover 11: Preprocessing ... % 3.53/1.20 Prover 8: Preprocessing ... % 3.53/1.20 Prover 10: Warning: ignoring some quantifiers % 3.53/1.21 Prover 7: Warning: ignoring some quantifiers % 3.53/1.21 Prover 7: Constructing countermodel ... % 3.53/1.21 Prover 1: Found proof (size 12) % 3.53/1.21 Prover 1: proved (583ms) % 3.53/1.21 Prover 7: stopped % 3.53/1.21 Prover 10: Constructing countermodel ... % 3.53/1.21 Prover 4: stopped % 3.53/1.22 Prover 10: stopped % 3.53/1.23 Prover 13: Warning: ignoring some quantifiers % 3.53/1.23 Prover 13: Constructing countermodel ... % 3.53/1.23 Prover 13: stopped % 3.53/1.24 Prover 8: Warning: ignoring some quantifiers % 3.53/1.24 Prover 8: Constructing countermodel ... % 3.53/1.24 Prover 11: Constructing countermodel ... % 3.53/1.24 Prover 8: stopped % 3.53/1.25 Prover 11: stopped % 3.53/1.25 % 3.53/1.25 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 3.53/1.25 % 3.53/1.25 % SZS output start Proof for theBenchmark % 3.53/1.25 Assumptions after simplification: % 3.53/1.25 --------------------------------- % 3.53/1.25 % 3.53/1.25 (l50_zfmisc_1) % 4.08/1.28 ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: int] : (v3 = 0 | ~ % 4.08/1.28 (union(v1) = v2) | ~ (subset(v0, v2) = v3) | ~ $i(v1) | ~ $i(v0) | ? % 4.08/1.28 [v4: int] : ( ~ (v4 = 0) & in(v0, v1) = v4)) % 4.08/1.28 % 4.08/1.28 (t92_zfmisc_1) % 4.08/1.28 ? [v0: $i] : ? [v1: $i] : ? [v2: $i] : ? [v3: int] : ( ~ (v3 = 0) & % 4.08/1.28 union(v1) = v2 & in(v0, v1) = 0 & subset(v0, v2) = v3 & $i(v2) & $i(v1) & % 4.08/1.28 $i(v0)) % 4.08/1.28 % 4.08/1.28 (function-axioms) % 4.08/1.29 ! [v0: MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] : ! % 4.19/1.29 [v3: $i] : (v1 = v0 | ~ (in(v3, v2) = v1) | ~ (in(v3, v2) = v0)) & ! [v0: % 4.19/1.29 MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] : ! [v3: $i] % 4.19/1.29 : (v1 = v0 | ~ (subset(v3, v2) = v1) | ~ (subset(v3, v2) = v0)) & ! [v0: % 4.19/1.29 $i] : ! [v1: $i] : ! [v2: $i] : (v1 = v0 | ~ (union(v2) = v1) | ~ % 4.19/1.29 (union(v2) = v0)) % 4.19/1.29 % 4.19/1.29 Further assumptions not needed in the proof: % 4.19/1.29 -------------------------------------------- % 4.19/1.29 antisymmetry_r2_hidden, dt_k3_tarski, reflexivity_r1_tarski % 4.19/1.29 % 4.19/1.29 Those formulas are unsatisfiable: % 4.19/1.29 --------------------------------- % 4.19/1.29 % 4.19/1.29 Begin of proof % 4.19/1.29 | % 4.19/1.29 | ALPHA: (function-axioms) implies: % 4.19/1.29 | (1) ! [v0: MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] : % 4.19/1.29 | ! [v3: $i] : (v1 = v0 | ~ (in(v3, v2) = v1) | ~ (in(v3, v2) = v0)) % 4.19/1.29 | % 4.19/1.29 | DELTA: instantiating (t92_zfmisc_1) with fresh symbols all_7_0, all_7_1, % 4.19/1.29 | all_7_2, all_7_3 gives: % 4.19/1.29 | (2) ~ (all_7_0 = 0) & union(all_7_2) = all_7_1 & in(all_7_3, all_7_2) = 0 % 4.19/1.29 | & subset(all_7_3, all_7_1) = all_7_0 & $i(all_7_1) & $i(all_7_2) & % 4.19/1.29 | $i(all_7_3) % 4.19/1.29 | % 4.19/1.29 | ALPHA: (2) implies: % 4.19/1.29 | (3) ~ (all_7_0 = 0) % 4.19/1.29 | (4) $i(all_7_3) % 4.19/1.29 | (5) $i(all_7_2) % 4.19/1.29 | (6) subset(all_7_3, all_7_1) = all_7_0 % 4.19/1.29 | (7) in(all_7_3, all_7_2) = 0 % 4.19/1.29 | (8) union(all_7_2) = all_7_1 % 4.19/1.30 | % 4.19/1.30 | GROUND_INST: instantiating (l50_zfmisc_1) with all_7_3, all_7_2, all_7_1, % 4.19/1.30 | all_7_0, simplifying with (4), (5), (6), (8) gives: % 4.19/1.30 | (9) all_7_0 = 0 | ? [v0: int] : ( ~ (v0 = 0) & in(all_7_3, all_7_2) = v0) % 4.19/1.30 | % 4.19/1.30 | BETA: splitting (9) gives: % 4.19/1.30 | % 4.19/1.30 | Case 1: % 4.19/1.30 | | % 4.19/1.30 | | (10) all_7_0 = 0 % 4.19/1.30 | | % 4.19/1.30 | | REDUCE: (3), (10) imply: % 4.19/1.30 | | (11) $false % 4.19/1.30 | | % 4.19/1.30 | | CLOSE: (11) is inconsistent. % 4.19/1.30 | | % 4.19/1.30 | Case 2: % 4.19/1.30 | | % 4.19/1.30 | | (12) ? [v0: int] : ( ~ (v0 = 0) & in(all_7_3, all_7_2) = v0) % 4.19/1.30 | | % 4.19/1.30 | | DELTA: instantiating (12) with fresh symbol all_20_0 gives: % 4.19/1.30 | | (13) ~ (all_20_0 = 0) & in(all_7_3, all_7_2) = all_20_0 % 4.19/1.30 | | % 4.19/1.30 | | ALPHA: (13) implies: % 4.19/1.30 | | (14) ~ (all_20_0 = 0) % 4.19/1.30 | | (15) in(all_7_3, all_7_2) = all_20_0 % 4.19/1.30 | | % 4.19/1.30 | | GROUND_INST: instantiating (1) with 0, all_20_0, all_7_2, all_7_3, % 4.19/1.30 | | simplifying with (7), (15) gives: % 4.19/1.30 | | (16) all_20_0 = 0 % 4.19/1.30 | | % 4.19/1.30 | | REDUCE: (14), (16) imply: % 4.19/1.30 | | (17) $false % 4.19/1.30 | | % 4.19/1.30 | | CLOSE: (17) is inconsistent. % 4.19/1.30 | | % 4.19/1.30 | End of split % 4.19/1.30 | % 4.19/1.30 End of proof % 4.19/1.30 % SZS output end Proof for theBenchmark % 4.19/1.30 % 4.19/1.30 692ms %------------------------------------------------------------------------------