%------------------------------------------------------------------------------ % File : Princess---230619 % Problem : SET910+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 : n001.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:26:59 EDT 2023 % Result : Theorem 3.68s 1.26s % Output : Proof 4.60s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.12 % Problem : SET910+1 : TPTP v8.1.2. Released v3.2.0. % 0.00/0.13 % Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s % 0.13/0.34 % Computer : n001.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 : Sat Aug 26 15:27:15 EDT 2023 % 0.13/0.34 % CPUTime : % 0.20/0.60 ________ _____ % 0.20/0.60 ___ __ \_________(_)________________________________ % 0.20/0.60 __ /_/ /_ ___/_ /__ __ \ ___/ _ \_ ___/_ ___/ % 0.20/0.60 _ ____/_ / _ / _ / / / /__ / __/(__ )_(__ ) % 0.20/0.60 /_/ /_/ /_/ /_/ /_/\___/ \___//____/ /____/ % 0.20/0.60 % 0.20/0.60 A Theorem Prover for First-Order Logic modulo Linear Integer Arithmetic % 0.20/0.60 (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/sandbox/benchmark/theBenchmark.p ... % 0.20/0.62 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 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 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 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.61/1.00 Prover 1: Preprocessing ... % 1.61/1.00 Prover 4: Preprocessing ... % 2.11/1.04 Prover 6: Preprocessing ... % 2.11/1.04 Prover 0: Preprocessing ... % 2.11/1.04 Prover 3: Preprocessing ... % 2.11/1.04 Prover 5: Preprocessing ... % 2.11/1.04 Prover 2: Preprocessing ... % 2.51/1.14 Prover 1: Warning: ignoring some quantifiers % 2.51/1.15 Prover 3: Warning: ignoring some quantifiers % 2.51/1.16 Prover 4: Constructing countermodel ... % 2.51/1.16 Prover 5: Proving ... % 2.51/1.16 Prover 6: Proving ... % 2.51/1.16 Prover 3: Constructing countermodel ... % 2.51/1.16 Prover 2: Proving ... % 3.22/1.16 Prover 1: Constructing countermodel ... % 3.22/1.17 Prover 0: Proving ... % 3.68/1.26 Prover 3: proved (627ms) % 3.68/1.26 % 3.68/1.26 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 3.68/1.26 % 3.68/1.26 Prover 5: stopped % 3.68/1.26 Prover 0: stopped % 3.68/1.26 Prover 7: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470 % 3.68/1.26 Prover 8: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089 % 3.68/1.27 Prover 10: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=919308125 % 3.68/1.27 Prover 2: proved (636ms) % 3.68/1.27 Prover 6: proved (628ms) % 3.68/1.27 % 3.68/1.27 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 3.68/1.27 % 3.68/1.27 % 3.68/1.27 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 3.68/1.27 % 3.68/1.27 Prover 11: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1509710984 % 3.68/1.27 Prover 13: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=complete -randomSeed=1138197443 % 3.68/1.29 Prover 10: Preprocessing ... % 3.68/1.29 Prover 7: Preprocessing ... % 3.68/1.29 Prover 8: Preprocessing ... % 3.68/1.29 Prover 11: Preprocessing ... % 3.68/1.30 Prover 13: Preprocessing ... % 4.18/1.33 Prover 10: Constructing countermodel ... % 4.18/1.33 Prover 1: Found proof (size 7) % 4.18/1.33 Prover 1: proved (703ms) % 4.18/1.33 Prover 4: Found proof (size 9) % 4.18/1.33 Prover 4: proved (702ms) % 4.18/1.33 Prover 10: stopped % 4.18/1.34 Prover 8: Warning: ignoring some quantifiers % 4.18/1.34 Prover 7: Constructing countermodel ... % 4.18/1.34 Prover 8: Constructing countermodel ... % 4.18/1.35 Prover 7: stopped % 4.18/1.35 Prover 8: stopped % 4.18/1.35 Prover 13: Warning: ignoring some quantifiers % 4.18/1.35 Prover 11: Constructing countermodel ... % 4.18/1.36 Prover 13: Constructing countermodel ... % 4.18/1.36 Prover 13: stopped % 4.18/1.36 Prover 11: stopped % 4.18/1.36 % 4.18/1.36 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 4.18/1.36 % 4.18/1.36 % SZS output start Proof for theBenchmark % 4.18/1.37 Assumptions after simplification: % 4.18/1.37 --------------------------------- % 4.18/1.37 % 4.18/1.37 (l30_zfmisc_1) % 4.60/1.39 ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ( ~ (singleton(v1) = v2) | ~ % 4.60/1.39 (set_intersection2(v0, v2) = v2) | ~ $i(v1) | ~ $i(v0) | in(v1, v0) = 0) % 4.60/1.39 % 4.60/1.39 (t51_zfmisc_1) % 4.60/1.40 ? [v0: $i] : ? [v1: $i] : ? [v2: $i] : ? [v3: int] : ( ~ (v3 = 0) & % 4.60/1.40 singleton(v1) = v2 & in(v1, v0) = v3 & set_intersection2(v0, v2) = v2 & % 4.60/1.40 $i(v2) & $i(v1) & $i(v0)) % 4.60/1.40 % 4.60/1.40 (function-axioms) % 4.60/1.40 ! [v0: MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] : ! % 4.60/1.40 [v3: $i] : (v1 = v0 | ~ (in(v3, v2) = v1) | ~ (in(v3, v2) = v0)) & ! [v0: % 4.60/1.40 $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: $i] : (v1 = v0 | ~ % 4.60/1.40 (set_intersection2(v3, v2) = v1) | ~ (set_intersection2(v3, v2) = v0)) & ! % 4.60/1.40 [v0: $i] : ! [v1: $i] : ! [v2: $i] : (v1 = v0 | ~ (singleton(v2) = v1) | ~ % 4.60/1.40 (singleton(v2) = v0)) & ! [v0: MultipleValueBool] : ! [v1: % 4.60/1.40 MultipleValueBool] : ! [v2: $i] : (v1 = v0 | ~ (empty(v2) = v1) | ~ % 4.60/1.40 (empty(v2) = v0)) % 4.60/1.40 % 4.60/1.40 Further assumptions not needed in the proof: % 4.60/1.40 -------------------------------------------- % 4.60/1.40 antisymmetry_r2_hidden, commutativity_k3_xboole_0, idempotence_k3_xboole_0, % 4.60/1.40 rc1_xboole_0, rc2_xboole_0 % 4.60/1.40 % 4.60/1.40 Those formulas are unsatisfiable: % 4.60/1.40 --------------------------------- % 4.60/1.40 % 4.60/1.40 Begin of proof % 4.60/1.40 | % 4.60/1.40 | ALPHA: (function-axioms) implies: % 4.60/1.41 | (1) ! [v0: MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] : % 4.60/1.41 | ! [v3: $i] : (v1 = v0 | ~ (in(v3, v2) = v1) | ~ (in(v3, v2) = v0)) % 4.60/1.41 | % 4.60/1.41 | DELTA: instantiating (t51_zfmisc_1) with fresh symbols all_12_0, all_12_1, % 4.60/1.41 | all_12_2, all_12_3 gives: % 4.60/1.41 | (2) ~ (all_12_0 = 0) & singleton(all_12_2) = all_12_1 & in(all_12_2, % 4.60/1.41 | all_12_3) = all_12_0 & set_intersection2(all_12_3, all_12_1) = % 4.60/1.41 | all_12_1 & $i(all_12_1) & $i(all_12_2) & $i(all_12_3) % 4.60/1.41 | % 4.60/1.41 | ALPHA: (2) implies: % 4.60/1.41 | (3) ~ (all_12_0 = 0) % 4.60/1.41 | (4) $i(all_12_3) % 4.60/1.41 | (5) $i(all_12_2) % 4.60/1.41 | (6) set_intersection2(all_12_3, all_12_1) = all_12_1 % 4.60/1.41 | (7) in(all_12_2, all_12_3) = all_12_0 % 4.60/1.41 | (8) singleton(all_12_2) = all_12_1 % 4.60/1.41 | % 4.60/1.41 | GROUND_INST: instantiating (l30_zfmisc_1) with all_12_3, all_12_2, all_12_1, % 4.60/1.41 | simplifying with (4), (5), (6), (8) gives: % 4.60/1.41 | (9) in(all_12_2, all_12_3) = 0 % 4.60/1.41 | % 4.60/1.41 | GROUND_INST: instantiating (1) with all_12_0, 0, all_12_3, all_12_2, % 4.60/1.41 | simplifying with (7), (9) gives: % 4.60/1.41 | (10) all_12_0 = 0 % 4.60/1.41 | % 4.60/1.41 | REDUCE: (3), (10) imply: % 4.60/1.41 | (11) $false % 4.60/1.42 | % 4.60/1.42 | CLOSE: (11) is inconsistent. % 4.60/1.42 | % 4.60/1.42 End of proof % 4.60/1.42 % SZS output end Proof for theBenchmark % 4.60/1.42 % 4.60/1.42 809ms %------------------------------------------------------------------------------