%------------------------------------------------------------------------------ % File : Princess---230619 % Problem : SYO561_1 : TPTP v8.1.2. Released v5.3.0. % Transfm : none % Format : tptp % Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s % Computer : n007.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:15 EDT 2023 % Result : Theorem 2.25s 1.02s % Output : Proof 2.25s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.08/0.13 % Problem : SYO561_1 : TPTP v8.1.2. Released v5.3.0. % 0.08/0.13 % Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s % 0.13/0.35 % Computer : n007.cluster.edu % 0.13/0.35 % Model : x86_64 x86_64 % 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.13/0.35 % Memory : 8042.1875MB % 0.13/0.35 % 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 07:22:41 EDT 2023 % 0.13/0.35 % CPUTime : % 0.20/0.62 ________ _____ % 0.20/0.62 ___ __ \_________(_)________________________________ % 0.20/0.62 __ /_/ /_ ___/_ /__ __ \ ___/ _ \_ ___/_ ___/ % 0.20/0.62 _ ____/_ / _ / _ / / / /__ / __/(__ )_(__ ) % 0.20/0.62 /_/ /_/ /_/ /_/ /_/\___/ \___//____/ /____/ % 0.20/0.62 % 0.20/0.62 A Theorem Prover for First-Order Logic modulo Linear Integer Arithmetic % 0.20/0.62 (2023-06-19) % 0.20/0.62 % 0.20/0.62 (c) Philipp Rümmer, 2009-2023 % 0.20/0.62 Contributors: Peter Backeman, Peter Baumgartner, Angelo Brillout, Zafer Esen, % 0.20/0.62 Amanda Stjerna. % 0.20/0.62 Free software under BSD-3-Clause. % 0.20/0.62 % 0.20/0.62 For more information, visit http://www.philipp.ruemmer.org/princess.shtml % 0.20/0.62 % 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.76/0.95 Prover 1: Preprocessing ... % 1.76/0.95 Prover 4: Preprocessing ... % 1.76/0.99 Prover 4: Constructing countermodel ... % 1.76/0.99 Prover 1: Constructing countermodel ... % 2.25/0.99 Prover 6: Preprocessing ... % 2.25/0.99 Prover 3: Preprocessing ... % 2.25/0.99 Prover 5: Preprocessing ... % 2.25/0.99 Prover 2: Preprocessing ... % 2.25/0.99 Prover 0: Preprocessing ... % 2.25/1.00 Prover 0: Constructing countermodel ... % 2.25/1.00 Prover 3: Constructing countermodel ... % 2.25/1.00 Prover 6: Constructing countermodel ... % 2.25/1.00 Prover 5: Constructing countermodel ... % 2.25/1.01 Prover 2: Constructing countermodel ... % 2.25/1.02 Prover 6: proved (381ms) % 2.25/1.02 Prover 0: proved (386ms) % 2.25/1.02 Prover 2: proved (385ms) % 2.25/1.02 % 2.25/1.02 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 2.25/1.02 % 2.25/1.02 Prover 3: proved (383ms) % 2.25/1.02 % 2.25/1.02 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 2.25/1.02 % 2.25/1.02 % 2.25/1.02 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 2.25/1.02 % 2.25/1.03 Prover 5: proved (380ms) % 2.25/1.03 % 2.25/1.03 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 2.25/1.03 % 2.25/1.03 % 2.25/1.03 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 2.25/1.03 % 2.25/1.04 Prover 7: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470 % 2.25/1.04 Prover 8: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089 % 2.25/1.04 Prover 10: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=919308125 % 2.25/1.04 Prover 11: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1509710984 % 2.25/1.04 Prover 7: Preprocessing ... % 2.25/1.04 Prover 8: Preprocessing ... % 2.25/1.04 Prover 13: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=complete -randomSeed=1138197443 % 2.25/1.04 Prover 10: Preprocessing ... % 2.25/1.04 Prover 11: Preprocessing ... % 2.25/1.04 Prover 7: Constructing countermodel ... % 2.25/1.05 Prover 8: Constructing countermodel ... % 2.25/1.05 Prover 10: Constructing countermodel ... % 2.25/1.05 Prover 13: Preprocessing ... % 2.25/1.05 Prover 7: Found proof (size 4) % 2.25/1.05 Prover 1: Found proof (size 4) % 2.25/1.05 Prover 7: proved (30ms) % 2.25/1.05 Prover 1: proved (419ms) % 2.25/1.05 Prover 8: Found proof (size 4) % 2.25/1.05 Prover 8: proved (29ms) % 2.25/1.06 Prover 10: stopped % 2.25/1.06 Prover 4: Found proof (size 4) % 2.25/1.06 Prover 4: proved (418ms) % 2.25/1.06 Prover 13: Constructing countermodel ... % 2.25/1.06 Prover 11: Constructing countermodel ... % 2.25/1.06 Prover 13: stopped % 2.25/1.06 Prover 11: stopped % 2.25/1.06 % 2.25/1.06 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 2.25/1.06 % 2.25/1.06 % SZS output start Proof for theBenchmark % 2.25/1.07 Assumptions after simplification: % 2.25/1.07 --------------------------------- % 2.25/1.07 % 2.25/1.07 (apple_not_microsoft) % 2.25/1.07 microsoft = apple & company(apple) % 2.25/1.07 % 2.25/1.07 (distinct_companies) % 2.25/1.07 ~ (microsoft = apple) & company(microsoft) & company(apple) % 2.25/1.07 % 2.25/1.07 Those formulas are unsatisfiable: % 2.25/1.07 --------------------------------- % 2.25/1.07 % 2.25/1.07 Begin of proof % 2.25/1.08 | % 2.25/1.08 | ALPHA: (apple_not_microsoft) implies: % 2.25/1.08 | (1) microsoft = apple % 2.25/1.08 | % 2.25/1.08 | ALPHA: (distinct_companies) implies: % 2.25/1.08 | (2) ~ (microsoft = apple) % 2.25/1.08 | % 2.25/1.08 | REDUCE: (1), (2) imply: % 2.25/1.08 | (3) $false % 2.25/1.08 | % 2.25/1.08 | CLOSE: (3) is inconsistent. % 2.25/1.08 | % 2.25/1.08 End of proof % 2.25/1.08 % SZS output end Proof for theBenchmark % 2.25/1.08 % 2.25/1.08 463ms %------------------------------------------------------------------------------