%------------------------------------------------------------------------------ % File : Princess---230619 % Problem : TIM032_1 : TPTP v9.3.0. Released v9.3.0. % Transfm : none % Format : tptp % Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s % Computer : n021.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 : Tue May 5 07:17:18 PM UTC 2026 % Result : Theorem 3.92s 1.22s % Output : Proof 5.42s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.12 % Problem : TIM032_1 : TPTP v9.3.0. Released v9.3.0. % 0.00/0.12 % Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s % 0.15/0.33 % Computer : n021.cluster.edu % 0.15/0.33 % Model : x86_64 x86_64 % 0.15/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.15/0.33 % Memory : 8042.1875MB % 0.15/0.33 % OS : Linux 3.10.0-693.el7.x86_64 % 0.15/0.33 % CPULimit : 300 % 0.15/0.33 % WCLimit : 300 % 0.15/0.33 % DateTime : Mon May 4 18:31:40 EDT 2026 % 0.15/0.33 % CPUTime : % 0.50/0.61 ________ _____ % 0.50/0.61 ___ __ \_________(_)________________________________ % 0.50/0.61 __ /_/ /_ ___/_ /__ __ \ ___/ _ \_ ___/_ ___/ % 0.50/0.61 _ ____/_ / _ / _ / / / /__ / __/(__ )_(__ ) % 0.50/0.61 /_/ /_/ /_/ /_/ /_/\___/ \___//____/ /____/ % 0.50/0.61 % 0.50/0.61 A Theorem Prover for First-Order Logic modulo Linear Integer Arithmetic % 0.50/0.61 (2023-06-19) % 0.50/0.61 % 0.50/0.61 (c) Philipp Rümmer, 2009-2023 % 0.50/0.61 Contributors: Peter Backeman, Peter Baumgartner, Angelo Brillout, Zafer Esen, % 0.50/0.61 Amanda Stjerna. % 0.50/0.61 Free software under BSD-3-Clause. % 0.50/0.61 % 0.50/0.61 For more information, visit http://www.philipp.ruemmer.org/princess.shtml % 0.50/0.61 % 0.50/0.61 Loading /export/starexec/sandbox2/benchmark/theBenchmark.p ... % 0.50/0.62 Running up to 7 provers in parallel. % 0.73/0.63 Prover 0: Options: +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1042961893 % 0.73/0.63 Prover 1: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1571432423 % 0.73/0.63 Prover 2: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMinimalAndEmpty -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1065072994 % 0.73/0.63 Prover 3: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1922548996 % 0.73/0.63 Prover 4: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=1868514696 % 0.73/0.63 Prover 5: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=complete -randomSeed=1259561288 % 0.73/0.63 Prover 6: Options: -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximalOutermost -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1399714365 % 2.65/1.03 Prover 1: Preprocessing ... % 2.65/1.03 Prover 4: Preprocessing ... % 2.65/1.08 Prover 6: Preprocessing ... % 2.65/1.08 Prover 5: Preprocessing ... % 2.65/1.08 Prover 2: Preprocessing ... % 2.65/1.08 Prover 0: Preprocessing ... % 2.65/1.08 Prover 3: Preprocessing ... % 3.35/1.18 Prover 5: Constructing countermodel ... % 3.35/1.18 Prover 2: Constructing countermodel ... % 3.92/1.21 Prover 5: proved (581ms) % 3.92/1.22 % 3.92/1.22 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 3.92/1.22 % 3.92/1.22 Prover 2: proved (590ms) % 3.92/1.22 % 3.92/1.22 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 3.92/1.22 % 3.92/1.22 Prover 7: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470 % 3.92/1.22 Prover 8: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089 % 3.92/1.25 Prover 7: Preprocessing ... % 3.92/1.26 Prover 8: Preprocessing ... % 3.92/1.27 Prover 3: Constructing countermodel ... % 3.92/1.27 Prover 3: stopped % 3.92/1.27 Prover 10: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=919308125 % 3.92/1.28 Prover 6: Constructing countermodel ... % 3.92/1.28 Prover 6: stopped % 3.92/1.30 Prover 10: Preprocessing ... % 4.66/1.30 Prover 11: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1509710984 % 4.66/1.32 Prover 11: Preprocessing ... % 4.66/1.33 Prover 1: Constructing countermodel ... % 4.66/1.33 Prover 7: Constructing countermodel ... % 4.66/1.35 Prover 10: Constructing countermodel ... % 4.66/1.36 Prover 0: Constructing countermodel ... % 4.66/1.36 Prover 0: stopped % 4.66/1.36 Prover 13: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=complete -randomSeed=1138197443 % 4.66/1.38 Prover 7: Found proof (size 4) % 4.66/1.38 Prover 7: proved (158ms) % 4.66/1.38 Prover 10: Found proof (size 4) % 4.66/1.38 Prover 10: proved (103ms) % 4.66/1.38 Prover 4: Constructing countermodel ... % 4.66/1.38 Prover 13: Preprocessing ... % 4.66/1.38 Prover 1: stopped % 4.66/1.40 Prover 4: stopped % 5.42/1.40 Prover 8: Warning: ignoring some quantifiers % 5.42/1.41 Prover 8: Constructing countermodel ... % 5.42/1.41 Prover 13: Constructing countermodel ... % 5.42/1.42 Prover 8: stopped % 5.42/1.42 Prover 13: stopped % 5.42/1.45 Prover 11: Constructing countermodel ... % 5.42/1.46 Prover 11: stopped % 5.42/1.46 % 5.42/1.46 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 5.42/1.46 % 5.42/1.47 % SZS output start Proof for theBenchmark % 5.42/1.47 Assumptions after simplification: % 5.42/1.47 --------------------------------- % 5.42/1.47 % 5.42/1.47 (goal) % 5.42/1.47 interval(b) & interval(a) & ~ meets(a, b) % 5.42/1.47 % 5.42/1.47 (p1) % 5.42/1.47 interval(b) & interval(a) & meets(a, b) % 5.42/1.47 % 5.42/1.47 Further assumptions not needed in the proof: % 5.42/1.47 -------------------------------------------- % 5.42/1.48 before_after, before_irreflexive, before_transitive, during_inverse, % 5.42/1.48 finishes_inverse, meets_metby, overlaps_inverse, p2, p3, p4, starts_inverse % 5.42/1.48 % 5.42/1.48 Those formulas are unsatisfiable: % 5.42/1.48 --------------------------------- % 5.42/1.48 % 5.42/1.48 Begin of proof % 5.42/1.48 | % 5.42/1.48 | ALPHA: (goal) implies: % 5.42/1.48 | (1) ~ meets(a, b) % 5.42/1.48 | % 5.42/1.48 | ALPHA: (p1) implies: % 5.42/1.48 | (2) meets(a, b) % 5.42/1.48 | % 5.42/1.48 | PRED_UNIFY: (1), (2) imply: % 5.42/1.48 | (3) $false % 5.42/1.48 | % 5.42/1.48 | CLOSE: (3) is inconsistent. % 5.42/1.48 | % 5.42/1.48 End of proof % 5.42/1.48 % SZS output end Proof for theBenchmark % 5.42/1.48 % 5.42/1.48 873ms %------------------------------------------------------------------------------