%------------------------------------------------------------------------------ % File : Princess---230619 % Problem : SET915+1 : TPTP v8.1.2. Released v3.2.0. % Transfm : none % Format : tptp % Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s % Computer : n026.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 15:27:01 EDT 2023 % Result : Theorem 3.64s 1.17s % Output : Proof 4.00s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.11/0.12 % Problem : SET915+1 : TPTP v8.1.2. Released v3.2.0. % 0.11/0.13 % Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s % 0.13/0.33 % Computer : n026.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 : Sat Aug 26 09:57:48 EDT 2023 % 0.13/0.33 % CPUTime : % 0.19/0.62 ________ _____ % 0.19/0.62 ___ __ \_________(_)________________________________ % 0.19/0.62 __ /_/ /_ ___/_ /__ __ \ ___/ _ \_ ___/_ ___/ % 0.19/0.62 _ ____/_ / _ / _ / / / /__ / __/(__ )_(__ ) % 0.19/0.62 /_/ /_/ /_/ /_/ /_/\___/ \___//____/ /____/ % 0.19/0.62 % 0.19/0.62 A Theorem Prover for First-Order Logic modulo Linear Integer Arithmetic % 0.19/0.62 (2023-06-19) % 0.19/0.62 % 0.19/0.62 (c) Philipp Rümmer, 2009-2023 % 0.19/0.62 Contributors: Peter Backeman, Peter Baumgartner, Angelo Brillout, Zafer Esen, % 0.19/0.62 Amanda Stjerna. % 0.19/0.62 Free software under BSD-3-Clause. % 0.19/0.62 % 0.19/0.62 For more information, visit http://www.philipp.ruemmer.org/princess.shtml % 0.19/0.62 % 0.19/0.62 Loading /export/starexec/sandbox2/benchmark/theBenchmark.p ... % 0.19/0.63 Running up to 7 provers in parallel. % 0.19/0.64 Prover 0: Options: +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1042961893 % 0.19/0.64 Prover 1: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1571432423 % 0.19/0.64 Prover 2: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMinimalAndEmpty -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1065072994 % 0.19/0.64 Prover 3: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1922548996 % 0.19/0.64 Prover 4: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=1868514696 % 0.19/0.64 Prover 5: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=complete -randomSeed=1259561288 % 0.19/0.64 Prover 6: Options: -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximalOutermost -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1399714365 % 2.04/0.93 Prover 1: Preprocessing ... % 2.04/0.93 Prover 4: Preprocessing ... % 2.04/0.97 Prover 0: Preprocessing ... % 2.04/0.97 Prover 5: Preprocessing ... % 2.04/0.97 Prover 3: Preprocessing ... % 2.04/0.97 Prover 6: Preprocessing ... % 2.04/0.97 Prover 2: Preprocessing ... % 2.48/1.06 Prover 2: Proving ... % 2.48/1.07 Prover 5: Proving ... % 2.48/1.07 Prover 3: Constructing countermodel ... % 2.48/1.07 Prover 6: Constructing countermodel ... % 2.99/1.08 Prover 1: Constructing countermodel ... % 2.99/1.09 Prover 4: Constructing countermodel ... % 2.99/1.09 Prover 0: Proving ... % 2.99/1.16 Prover 3: proved (525ms) % 2.99/1.16 % 3.64/1.17 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 3.64/1.17 % 3.64/1.17 Prover 5: stopped % 3.64/1.17 Prover 2: stopped % 3.64/1.17 Prover 6: stopped % 3.64/1.18 Prover 0: proved (539ms) % 3.64/1.18 % 3.64/1.18 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 3.64/1.18 % 3.64/1.18 Prover 8: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089 % 3.64/1.18 Prover 10: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=919308125 % 3.64/1.18 Prover 7: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470 % 3.64/1.18 Prover 11: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1509710984 % 3.64/1.18 Prover 13: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=complete -randomSeed=1138197443 % 3.79/1.20 Prover 8: Preprocessing ... % 3.79/1.20 Prover 11: Preprocessing ... % 3.79/1.20 Prover 7: Preprocessing ... % 3.79/1.21 Prover 10: Preprocessing ... % 3.79/1.21 Prover 13: Preprocessing ... % 3.79/1.21 Prover 1: Found proof (size 10) % 3.79/1.21 Prover 1: proved (578ms) % 4.00/1.22 Prover 11: stopped % 4.00/1.22 Prover 7: Warning: ignoring some quantifiers % 4.00/1.22 Prover 10: Warning: ignoring some quantifiers % 4.00/1.22 Prover 4: stopped % 4.00/1.22 Prover 7: Constructing countermodel ... % 4.00/1.23 Prover 10: Constructing countermodel ... % 4.00/1.23 Prover 7: stopped % 4.00/1.23 Prover 10: stopped % 4.00/1.24 Prover 13: Warning: ignoring some quantifiers % 4.00/1.24 Prover 13: Constructing countermodel ... % 4.00/1.24 Prover 13: stopped % 4.00/1.24 Prover 8: Warning: ignoring some quantifiers % 4.00/1.25 Prover 8: Constructing countermodel ... % 4.00/1.25 Prover 8: stopped % 4.00/1.25 % 4.00/1.25 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 4.00/1.25 % 4.00/1.26 % SZS output start Proof for theBenchmark % 4.00/1.26 Assumptions after simplification: % 4.00/1.26 --------------------------------- % 4.00/1.26 % 4.00/1.26 (l28_zfmisc_1) % 4.00/1.30 ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: int] : (v3 = 0 | ~ % 4.00/1.30 (singleton(v0) = v2) | ~ (disjoint(v2, v1) = v3) | ~ $i(v1) | ~ $i(v0) | % 4.00/1.30 in(v0, v1) = 0) % 4.00/1.30 % 4.00/1.30 (t56_zfmisc_1) % 4.00/1.30 ? [v0: $i] : ? [v1: $i] : ? [v2: int] : ? [v3: $i] : ? [v4: int] : ( ~ % 4.00/1.30 (v4 = 0) & ~ (v2 = 0) & singleton(v0) = v3 & in(v0, v1) = v2 & disjoint(v3, % 4.00/1.30 v1) = v4 & $i(v3) & $i(v1) & $i(v0)) % 4.00/1.30 % 4.00/1.30 (function-axioms) % 4.00/1.30 ! [v0: MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] : ! % 4.00/1.30 [v3: $i] : (v1 = v0 | ~ (in(v3, v2) = v1) | ~ (in(v3, v2) = v0)) & ! [v0: % 4.00/1.30 MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] : ! [v3: $i] % 4.00/1.30 : (v1 = v0 | ~ (disjoint(v3, v2) = v1) | ~ (disjoint(v3, v2) = v0)) & ! % 4.00/1.30 [v0: $i] : ! [v1: $i] : ! [v2: $i] : (v1 = v0 | ~ (singleton(v2) = v1) | ~ % 4.00/1.30 (singleton(v2) = v0)) & ! [v0: MultipleValueBool] : ! [v1: % 4.00/1.30 MultipleValueBool] : ! [v2: $i] : (v1 = v0 | ~ (empty(v2) = v1) | ~ % 4.00/1.30 (empty(v2) = v0)) % 4.00/1.30 % 4.00/1.30 Further assumptions not needed in the proof: % 4.00/1.30 -------------------------------------------- % 4.00/1.30 antisymmetry_r2_hidden, rc1_xboole_0, rc2_xboole_0, symmetry_r1_xboole_0 % 4.00/1.30 % 4.00/1.30 Those formulas are unsatisfiable: % 4.00/1.30 --------------------------------- % 4.00/1.30 % 4.00/1.30 Begin of proof % 4.00/1.30 | % 4.00/1.31 | ALPHA: (function-axioms) implies: % 4.00/1.31 | (1) ! [v0: MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] : % 4.00/1.31 | ! [v3: $i] : (v1 = v0 | ~ (in(v3, v2) = v1) | ~ (in(v3, v2) = v0)) % 4.00/1.31 | % 4.00/1.31 | DELTA: instantiating (t56_zfmisc_1) with fresh symbols all_10_0, all_10_1, % 4.00/1.31 | all_10_2, all_10_3, all_10_4 gives: % 4.00/1.31 | (2) ~ (all_10_0 = 0) & ~ (all_10_2 = 0) & singleton(all_10_4) = all_10_1 % 4.00/1.31 | & in(all_10_4, all_10_3) = all_10_2 & disjoint(all_10_1, all_10_3) = % 4.00/1.31 | all_10_0 & $i(all_10_1) & $i(all_10_3) & $i(all_10_4) % 4.00/1.31 | % 4.00/1.31 | ALPHA: (2) implies: % 4.00/1.31 | (3) ~ (all_10_2 = 0) % 4.00/1.31 | (4) ~ (all_10_0 = 0) % 4.00/1.31 | (5) $i(all_10_4) % 4.00/1.31 | (6) $i(all_10_3) % 4.00/1.31 | (7) disjoint(all_10_1, all_10_3) = all_10_0 % 4.00/1.31 | (8) in(all_10_4, all_10_3) = all_10_2 % 4.00/1.31 | (9) singleton(all_10_4) = all_10_1 % 4.00/1.31 | % 4.00/1.31 | GROUND_INST: instantiating (l28_zfmisc_1) with all_10_4, all_10_3, all_10_1, % 4.00/1.31 | all_10_0, simplifying with (5), (6), (7), (9) gives: % 4.00/1.32 | (10) all_10_0 = 0 | in(all_10_4, all_10_3) = 0 % 4.00/1.32 | % 4.00/1.32 | BETA: splitting (10) gives: % 4.00/1.32 | % 4.00/1.32 | Case 1: % 4.00/1.32 | | % 4.00/1.32 | | (11) in(all_10_4, all_10_3) = 0 % 4.00/1.32 | | % 4.00/1.32 | | GROUND_INST: instantiating (1) with all_10_2, 0, all_10_3, all_10_4, % 4.00/1.32 | | simplifying with (8), (11) gives: % 4.00/1.32 | | (12) all_10_2 = 0 % 4.00/1.32 | | % 4.00/1.32 | | REDUCE: (3), (12) imply: % 4.00/1.32 | | (13) $false % 4.00/1.32 | | % 4.00/1.32 | | CLOSE: (13) is inconsistent. % 4.00/1.32 | | % 4.00/1.32 | Case 2: % 4.00/1.32 | | % 4.00/1.32 | | (14) all_10_0 = 0 % 4.00/1.32 | | % 4.00/1.32 | | REDUCE: (4), (14) imply: % 4.00/1.32 | | (15) $false % 4.00/1.32 | | % 4.00/1.32 | | CLOSE: (15) is inconsistent. % 4.00/1.32 | | % 4.00/1.32 | End of split % 4.00/1.32 | % 4.00/1.32 End of proof % 4.00/1.32 % SZS output end Proof for theBenchmark % 4.00/1.32 % 4.00/1.32 702ms %------------------------------------------------------------------------------