%------------------------------------------------------------------------------ % File : Princess---230619 % Problem : TIM033_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 : n019.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.48s 1.39s % Output : Proof 5.93s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.12 % Problem : TIM033_1 : TPTP v9.3.0. Released v9.3.0. % 0.12/0.13 % Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s % 0.15/0.34 % Computer : n019.cluster.edu % 0.15/0.34 % Model : x86_64 x86_64 % 0.15/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.15/0.34 % Memory : 8042.1875MB % 0.15/0.34 % OS : Linux 3.10.0-693.el7.x86_64 % 0.15/0.34 % CPULimit : 300 % 0.15/0.34 % WCLimit : 300 % 0.15/0.34 % DateTime : Mon May 4 18:31:29 EDT 2026 % 0.15/0.34 % CPUTime : % 0.52/0.61 ________ _____ % 0.52/0.61 ___ __ \_________(_)________________________________ % 0.52/0.61 __ /_/ /_ ___/_ /__ __ \ ___/ _ \_ ___/_ ___/ % 0.52/0.61 _ ____/_ / _ / _ / / / /__ / __/(__ )_(__ ) % 0.52/0.61 /_/ /_/ /_/ /_/ /_/\___/ \___//____/ /____/ % 0.52/0.61 % 0.52/0.61 A Theorem Prover for First-Order Logic modulo Linear Integer Arithmetic % 0.52/0.61 (2023-06-19) % 0.52/0.61 % 0.52/0.61 (c) Philipp Rümmer, 2009-2023 % 0.52/0.61 Contributors: Peter Backeman, Peter Baumgartner, Angelo Brillout, Zafer Esen, % 0.52/0.61 Amanda Stjerna. % 0.52/0.61 Free software under BSD-3-Clause. % 0.52/0.61 % 0.52/0.61 For more information, visit http://www.philipp.ruemmer.org/princess.shtml % 0.52/0.61 % 0.52/0.61 Loading /export/starexec/sandbox/benchmark/theBenchmark.p ... % 0.52/0.62 Running up to 7 provers in parallel. % 0.69/0.64 Prover 1: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1571432423 % 0.69/0.64 Prover 0: Options: +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1042961893 % 0.69/0.64 Prover 2: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMinimalAndEmpty -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1065072994 % 0.69/0.64 Prover 3: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1922548996 % 0.69/0.64 Prover 4: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=1868514696 % 0.69/0.64 Prover 5: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=complete -randomSeed=1259561288 % 0.69/0.64 Prover 6: Options: -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximalOutermost -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1399714365 % 2.39/1.07 Prover 4: Preprocessing ... % 2.39/1.07 Prover 1: Preprocessing ... % 2.39/1.11 Prover 2: Preprocessing ... % 2.39/1.11 Prover 0: Preprocessing ... % 2.39/1.11 Prover 5: Preprocessing ... % 2.39/1.11 Prover 6: Preprocessing ... % 2.39/1.11 Prover 3: Preprocessing ... % 3.71/1.27 Prover 5: Constructing countermodel ... % 3.71/1.28 Prover 2: Constructing countermodel ... % 4.48/1.33 Prover 6: Constructing countermodel ... % 4.48/1.34 Prover 1: Constructing countermodel ... % 4.48/1.34 Prover 3: Constructing countermodel ... % 4.48/1.38 Prover 4: Constructing countermodel ... % 4.48/1.38 Prover 2: proved (743ms) % 4.48/1.38 Prover 5: proved (740ms) % 4.48/1.39 % 4.48/1.39 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 4.48/1.39 % 4.48/1.39 Prover 6: proved (740ms) % 4.48/1.39 % 4.48/1.39 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 4.48/1.39 % 4.48/1.39 % 4.48/1.39 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 4.48/1.39 % 4.48/1.39 Prover 3: stopped % 4.48/1.39 Prover 8: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089 % 4.48/1.39 Prover 10: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=919308125 % 4.48/1.39 Prover 11: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1509710984 % 4.48/1.39 Prover 7: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470 % 5.24/1.42 Prover 8: Preprocessing ... % 5.24/1.42 Prover 11: Preprocessing ... % 5.24/1.42 Prover 1: Found proof (size 10) % 5.24/1.42 Prover 1: proved (789ms) % 5.24/1.42 Prover 4: stopped % 5.24/1.43 Prover 10: Preprocessing ... % 5.24/1.43 Prover 7: Preprocessing ... % 5.24/1.45 Prover 0: Proving ... % 5.24/1.45 Prover 0: stopped % 5.24/1.46 Prover 11: stopped % 5.24/1.46 Prover 7: Constructing countermodel ... % 5.24/1.47 Prover 10: Constructing countermodel ... % 5.24/1.47 Prover 7: stopped % 5.24/1.47 Prover 10: stopped % 5.93/1.50 Prover 8: Warning: ignoring some quantifiers % 5.93/1.51 Prover 8: Constructing countermodel ... % 5.93/1.52 Prover 8: stopped % 5.93/1.52 % 5.93/1.52 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 5.93/1.52 % 5.93/1.52 % SZS output start Proof for theBenchmark % 5.93/1.52 Assumptions after simplification: % 5.93/1.52 --------------------------------- % 5.93/1.52 % 5.93/1.52 (finishes_inverse) % 5.93/1.55 ! [v0: interval] : ! [v1: interval] : ! [v2: int] : (v2 = 0 | ~ % 5.93/1.55 (finishes(v0, v1) = v2) | ~ interval(v1) | ~ interval(v0) | ? [v3: int] : % 5.93/1.55 ( ~ (v3 = 0) & finished_by(v1, v0) = v3)) & ! [v0: interval] : ! [v1: % 5.93/1.55 interval] : ( ~ (finishes(v0, v1) = 0) | ~ interval(v1) | ~ interval(v0) | % 5.93/1.55 finished_by(v1, v0) = 0) % 5.93/1.55 % 5.93/1.55 (goal) % 5.93/1.55 interval(d) & interval(c) & ? [v0: int] : ( ~ (v0 = 0) & finished_by(c, d) = % 5.93/1.55 v0) % 5.93/1.55 % 5.93/1.55 (p3) % 5.93/1.55 finishes(d, c) = 0 & interval(d) & interval(c) % 5.93/1.55 % 5.93/1.55 (function-axioms) % 5.93/1.56 ! [v0: MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: interval] : % 5.93/1.56 ! [v3: interval] : (v1 = v0 | ~ (finishes(v3, v2) = v1) | ~ (finishes(v3, % 5.93/1.56 v2) = v0)) & ! [v0: MultipleValueBool] : ! [v1: MultipleValueBool] : % 5.93/1.56 ! [v2: interval] : ! [v3: interval] : (v1 = v0 | ~ (finished_by(v3, v2) = % 5.93/1.56 v1) | ~ (finished_by(v3, v2) = v0)) & ! [v0: MultipleValueBool] : ! % 5.93/1.56 [v1: MultipleValueBool] : ! [v2: interval] : ! [v3: interval] : (v1 = v0 | % 5.93/1.56 ~ (during(v3, v2) = v1) | ~ (during(v3, v2) = v0)) & ! [v0: % 5.93/1.56 MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: interval] : ! % 5.93/1.56 [v3: interval] : (v1 = v0 | ~ (contains(v3, v2) = v1) | ~ (contains(v3, v2) % 5.93/1.56 = v0)) & ! [v0: MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: % 5.93/1.56 interval] : ! [v3: interval] : (v1 = v0 | ~ (starts(v3, v2) = v1) | ~ % 5.93/1.56 (starts(v3, v2) = v0)) & ! [v0: MultipleValueBool] : ! [v1: % 5.93/1.56 MultipleValueBool] : ! [v2: interval] : ! [v3: interval] : (v1 = v0 | ~ % 5.93/1.56 (started_by(v3, v2) = v1) | ~ (started_by(v3, v2) = v0)) & ! [v0: % 5.93/1.56 MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: interval] : ! % 5.93/1.56 [v3: interval] : (v1 = v0 | ~ (overlaps(v3, v2) = v1) | ~ (overlaps(v3, v2) % 5.93/1.56 = v0)) & ! [v0: MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: % 5.93/1.56 interval] : ! [v3: interval] : (v1 = v0 | ~ (overlapped_by(v3, v2) = v1) | % 5.93/1.56 ~ (overlapped_by(v3, v2) = v0)) & ! [v0: MultipleValueBool] : ! [v1: % 5.93/1.56 MultipleValueBool] : ! [v2: interval] : ! [v3: interval] : (v1 = v0 | ~ % 5.93/1.56 (met_by(v3, v2) = v1) | ~ (met_by(v3, v2) = v0)) & ! [v0: % 5.93/1.56 MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: interval] : ! % 5.93/1.56 [v3: interval] : (v1 = v0 | ~ (meets(v3, v2) = v1) | ~ (meets(v3, v2) = v0)) % 5.93/1.56 & ! [v0: MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: interval] % 5.93/1.56 : ! [v3: interval] : (v1 = v0 | ~ (after(v3, v2) = v1) | ~ (after(v3, v2) = % 5.93/1.56 v0)) & ! [v0: MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: % 5.93/1.56 interval] : ! [v3: interval] : (v1 = v0 | ~ (before(v3, v2) = v1) | ~ % 5.93/1.56 (before(v3, v2) = v0)) % 5.93/1.56 % 5.93/1.56 Further assumptions not needed in the proof: % 5.93/1.56 -------------------------------------------- % 5.93/1.56 before_after, before_irreflexive, before_transitive, during_inverse, % 5.93/1.56 meets_metby, overlaps_inverse, p1, p2, starts_inverse % 5.93/1.56 % 5.93/1.56 Those formulas are unsatisfiable: % 5.93/1.56 --------------------------------- % 5.93/1.56 % 5.93/1.56 Begin of proof % 5.93/1.57 | % 5.93/1.57 | ALPHA: (finishes_inverse) implies: % 5.93/1.57 | (1) ! [v0: interval] : ! [v1: interval] : ( ~ (finishes(v0, v1) = 0) | ~ % 5.93/1.57 | interval(v1) | ~ interval(v0) | finished_by(v1, v0) = 0) % 5.93/1.57 | % 5.93/1.57 | ALPHA: (p3) implies: % 5.93/1.57 | (2) finishes(d, c) = 0 % 5.93/1.57 | % 5.93/1.57 | ALPHA: (goal) implies: % 5.93/1.57 | (3) interval(c) % 5.93/1.57 | (4) interval(d) % 5.93/1.57 | (5) ? [v0: int] : ( ~ (v0 = 0) & finished_by(c, d) = v0) % 5.93/1.57 | % 5.93/1.57 | ALPHA: (function-axioms) implies: % 5.93/1.57 | (6) ! [v0: MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: % 5.93/1.57 | interval] : ! [v3: interval] : (v1 = v0 | ~ (finished_by(v3, v2) = % 5.93/1.57 | v1) | ~ (finished_by(v3, v2) = v0)) % 5.93/1.57 | % 5.93/1.57 | DELTA: instantiating (5) with fresh symbol all_14_0 gives: % 5.93/1.57 | (7) ~ (all_14_0 = 0) & finished_by(c, d) = all_14_0 % 5.93/1.57 | % 5.93/1.57 | ALPHA: (7) implies: % 5.93/1.57 | (8) ~ (all_14_0 = 0) % 5.93/1.57 | (9) finished_by(c, d) = all_14_0 % 5.93/1.57 | % 5.93/1.58 | GROUND_INST: instantiating (1) with d, c, simplifying with (2), (3), (4) % 5.93/1.58 | gives: % 5.93/1.58 | (10) finished_by(c, d) = 0 % 5.93/1.58 | % 5.93/1.58 | GROUND_INST: instantiating (6) with all_14_0, 0, d, c, simplifying with (9), % 5.93/1.58 | (10) gives: % 5.93/1.58 | (11) all_14_0 = 0 % 5.93/1.58 | % 5.93/1.58 | REDUCE: (8), (11) imply: % 5.93/1.58 | (12) $false % 5.93/1.58 | % 5.93/1.58 | CLOSE: (12) is inconsistent. % 5.93/1.58 | % 5.93/1.58 End of proof % 5.93/1.58 % SZS output end Proof for theBenchmark % 5.93/1.58 % 5.93/1.58 965ms %------------------------------------------------------------------------------