%------------------------------------------------------------------------------ % File : Princess---230619 % Problem : TIM035_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 : n003.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:19 PM UTC 2026 % Result : Theorem 4.61s 1.33s % Output : Proof 6.52s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.12 % Problem : TIM035_1 : TPTP v9.3.0. Released v9.3.0. % 0.12/0.12 % Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s % 0.15/0.33 % Computer : n003.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:37:26 EDT 2026 % 0.15/0.34 % CPUTime : % 0.53/0.60 ________ _____ % 0.53/0.60 ___ __ \_________(_)________________________________ % 0.53/0.60 __ /_/ /_ ___/_ /__ __ \ ___/ _ \_ ___/_ ___/ % 0.53/0.60 _ ____/_ / _ / _ / / / /__ / __/(__ )_(__ ) % 0.53/0.60 /_/ /_/ /_/ /_/ /_/\___/ \___//____/ /____/ % 0.53/0.60 % 0.53/0.60 A Theorem Prover for First-Order Logic modulo Linear Integer Arithmetic % 0.53/0.60 (2023-06-19) % 0.53/0.60 % 0.53/0.60 (c) Philipp Rümmer, 2009-2023 % 0.53/0.60 Contributors: Peter Backeman, Peter Baumgartner, Angelo Brillout, Zafer Esen, % 0.53/0.60 Amanda Stjerna. % 0.53/0.60 Free software under BSD-3-Clause. % 0.53/0.60 % 0.53/0.60 For more information, visit http://www.philipp.ruemmer.org/princess.shtml % 0.53/0.60 % 0.53/0.60 Loading /export/starexec/sandbox2/benchmark/theBenchmark.p ... % 0.53/0.62 Running up to 7 provers in parallel. % 0.74/0.63 Prover 1: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1571432423 % 0.74/0.63 Prover 0: Options: +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1042961893 % 0.74/0.63 Prover 2: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMinimalAndEmpty -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1065072994 % 0.74/0.63 Prover 3: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1922548996 % 0.74/0.63 Prover 4: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=1868514696 % 0.74/0.63 Prover 5: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=complete -randomSeed=1259561288 % 0.74/0.63 Prover 6: Options: -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximalOutermost -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1399714365 % 2.67/1.03 Prover 4: Preprocessing ... % 2.67/1.04 Prover 1: Preprocessing ... % 2.67/1.08 Prover 0: Preprocessing ... % 2.67/1.08 Prover 6: Preprocessing ... % 2.67/1.08 Prover 2: Preprocessing ... % 2.67/1.08 Prover 3: Preprocessing ... % 2.67/1.08 Prover 5: Preprocessing ... % 3.86/1.24 Prover 2: Constructing countermodel ... % 3.86/1.24 Prover 5: Constructing countermodel ... % 4.61/1.32 Prover 2: proved (699ms) % 4.61/1.32 % 4.61/1.33 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 4.61/1.33 % 4.61/1.33 Prover 7: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470 % 4.61/1.33 Prover 6: Constructing countermodel ... % 4.61/1.33 Prover 1: Constructing countermodel ... % 4.61/1.33 Prover 3: Constructing countermodel ... % 4.61/1.34 Prover 6: stopped % 4.61/1.34 Prover 5: stopped % 4.61/1.35 Prover 3: stopped % 4.61/1.35 Prover 8: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089 % 4.61/1.35 Prover 7: Preprocessing ... % 4.61/1.36 Prover 11: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1509710984 % 4.61/1.36 Prover 10: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=919308125 % 4.61/1.37 Prover 4: Constructing countermodel ... % 4.61/1.38 Prover 8: Preprocessing ... % 4.61/1.39 Prover 11: Preprocessing ... % 4.61/1.40 Prover 10: Preprocessing ... % 5.31/1.42 Prover 7: Constructing countermodel ... % 5.31/1.44 Prover 10: Constructing countermodel ... % 5.31/1.45 Prover 0: Proving ... % 5.31/1.45 Prover 0: stopped % 5.31/1.46 Prover 7: Found proof (size 5) % 5.31/1.46 Prover 7: proved (129ms) % 5.31/1.46 Prover 4: stopped % 5.31/1.46 Prover 13: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=complete -randomSeed=1138197443 % 5.31/1.46 Prover 1: stopped % 5.31/1.46 Prover 10: stopped % 5.31/1.47 Prover 13: Preprocessing ... % 5.31/1.48 Prover 8: Warning: ignoring some quantifiers % 5.31/1.49 Prover 8: Constructing countermodel ... % 6.01/1.50 Prover 8: stopped % 6.01/1.50 Prover 13: Constructing countermodel ... % 6.01/1.51 Prover 13: stopped % 6.01/1.56 Prover 11: Constructing countermodel ... % 6.01/1.57 Prover 11: stopped % 6.01/1.57 % 6.01/1.57 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 6.01/1.57 % 6.01/1.58 % SZS output start Proof for theBenchmark % 6.01/1.58 Assumptions after simplification: % 6.01/1.58 --------------------------------- % 6.01/1.58 % 6.01/1.58 (goal) % 6.01/1.58 interval(b) & interval(a) & ~ overlapped_by(b, a) % 6.01/1.58 % 6.01/1.58 (overlaps_inverse) % 6.01/1.59 ! [v0: interval] : ! [v1: interval] : ( ~ interval(v1) | ~ interval(v0) | % 6.01/1.59 ~ overlapped_by(v1, v0) | overlaps(v0, v1)) & ! [v0: interval] : ! [v1: % 6.01/1.59 interval] : ( ~ interval(v1) | ~ interval(v0) | ~ overlaps(v0, v1) | % 6.01/1.59 overlapped_by(v1, v0)) % 6.01/1.59 % 6.01/1.59 (p1) % 6.01/1.59 interval(b) & interval(a) & overlaps(a, b) % 6.01/1.59 % 6.01/1.59 Further assumptions not needed in the proof: % 6.01/1.59 -------------------------------------------- % 6.01/1.59 before_after, before_irreflexive, before_transitive, during_inverse, % 6.01/1.59 finishes_inverse, meets_metby, p2, p3, starts_inverse % 6.01/1.59 % 6.01/1.59 Those formulas are unsatisfiable: % 6.01/1.59 --------------------------------- % 6.01/1.59 % 6.01/1.59 Begin of proof % 6.01/1.59 | % 6.01/1.59 | ALPHA: (goal) implies: % 6.01/1.59 | (1) ~ overlapped_by(b, a) % 6.01/1.59 | % 6.01/1.59 | ALPHA: (p1) implies: % 6.01/1.59 | (2) overlaps(a, b) % 6.01/1.59 | (3) interval(a) % 6.01/1.59 | (4) interval(b) % 6.01/1.59 | % 6.01/1.59 | ALPHA: (overlaps_inverse) implies: % 6.01/1.59 | (5) ! [v0: interval] : ! [v1: interval] : ( ~ interval(v1) | ~ % 6.01/1.59 | interval(v0) | ~ overlaps(v0, v1) | overlapped_by(v1, v0)) % 6.01/1.59 | % 6.01/1.60 | GROUND_INST: instantiating (5) with a, b, simplifying with (1), (2), (3), (4) % 6.52/1.60 | gives: % 6.52/1.60 | (6) $false % 6.52/1.60 | % 6.52/1.60 | CLOSE: (6) is inconsistent. % 6.52/1.60 | % 6.52/1.60 End of proof % 6.52/1.60 % SZS output end Proof for theBenchmark % 6.52/1.60 % 6.52/1.60 995ms %------------------------------------------------------------------------------