%------------------------------------------------------------------------------ % File : Princess---230619 % Problem : TIM031_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 : n023.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 5.60s 1.47s % Output : Proof 7.56s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.08 % Problem : TIM031_1 : TPTP v9.3.0. Released v9.3.0. % 0.00/0.08 % Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s % 0.10/0.27 % Computer : n023.cluster.edu % 0.10/0.27 % Model : x86_64 x86_64 % 0.10/0.27 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.10/0.27 % Memory : 8042.1875MB % 0.10/0.27 % OS : Linux 3.10.0-693.el7.x86_64 % 0.10/0.27 % CPULimit : 300 % 0.10/0.27 % WCLimit : 300 % 0.10/0.27 % DateTime : Mon May 4 18:30:23 EDT 2026 % 0.10/0.27 % CPUTime : % 0.55/0.54 ________ _____ % 0.55/0.54 ___ __ \_________(_)________________________________ % 0.55/0.54 __ /_/ /_ ___/_ /__ __ \ ___/ _ \_ ___/_ ___/ % 0.55/0.54 _ ____/_ / _ / _ / / / /__ / __/(__ )_(__ ) % 0.55/0.54 /_/ /_/ /_/ /_/ /_/\___/ \___//____/ /____/ % 0.55/0.54 % 0.55/0.54 A Theorem Prover for First-Order Logic modulo Linear Integer Arithmetic % 0.55/0.54 (2023-06-19) % 0.55/0.54 % 0.55/0.54 (c) Philipp Rümmer, 2009-2023 % 0.55/0.54 Contributors: Peter Backeman, Peter Baumgartner, Angelo Brillout, Zafer Esen, % 0.55/0.54 Amanda Stjerna. % 0.55/0.54 Free software under BSD-3-Clause. % 0.55/0.54 % 0.55/0.54 For more information, visit http://www.philipp.ruemmer.org/princess.shtml % 0.55/0.54 % 0.55/0.55 Loading /export/starexec/sandbox/benchmark/theBenchmark.p ... % 0.55/0.56 Running up to 7 provers in parallel. % 0.55/0.57 Prover 0: Options: +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1042961893 % 0.55/0.57 Prover 1: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1571432423 % 0.55/0.57 Prover 2: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMinimalAndEmpty -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1065072994 % 0.55/0.57 Prover 3: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1922548996 % 0.55/0.58 Prover 4: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=1868514696 % 0.55/0.58 Prover 5: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=complete -randomSeed=1259561288 % 0.55/0.58 Prover 6: Options: -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximalOutermost -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1399714365 % 2.71/1.02 Prover 1: Preprocessing ... % 2.71/1.02 Prover 4: Preprocessing ... % 2.71/1.06 Prover 0: Preprocessing ... % 2.71/1.06 Prover 6: Preprocessing ... % 2.71/1.06 Prover 3: Preprocessing ... % 2.71/1.07 Prover 2: Preprocessing ... % 2.71/1.07 Prover 5: Preprocessing ... % 4.05/1.22 Prover 5: Constructing countermodel ... % 4.05/1.22 Prover 2: Constructing countermodel ... % 4.05/1.28 Prover 1: Constructing countermodel ... % 4.05/1.29 Prover 6: Constructing countermodel ... % 4.81/1.32 Prover 3: Constructing countermodel ... % 4.81/1.34 Prover 4: Constructing countermodel ... % 5.60/1.43 Prover 0: Proving ... % 5.60/1.47 Prover 3: proved (903ms) % 5.60/1.47 % 5.60/1.47 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 5.60/1.47 % 5.60/1.47 Prover 2: stopped % 5.60/1.48 Prover 5: stopped % 5.60/1.48 Prover 6: stopped % 5.60/1.48 Prover 7: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470 % 5.60/1.48 Prover 0: stopped % 5.60/1.48 Prover 8: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089 % 5.60/1.48 Prover 10: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=919308125 % 5.60/1.48 Prover 11: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1509710984 % 5.60/1.48 Prover 13: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=complete -randomSeed=1138197443 % 6.34/1.51 Prover 8: Preprocessing ... % 6.34/1.52 Prover 11: Preprocessing ... % 6.34/1.52 Prover 10: Preprocessing ... % 6.34/1.52 Prover 13: Preprocessing ... % 6.34/1.52 Prover 7: Preprocessing ... % 6.34/1.56 Prover 10: Constructing countermodel ... % 6.34/1.56 Prover 1: Found proof (size 50) % 6.34/1.56 Prover 13: Constructing countermodel ... % 6.34/1.56 Prover 1: proved (999ms) % 6.34/1.56 Prover 4: stopped % 6.34/1.56 Prover 10: stopped % 6.34/1.57 Prover 7: Constructing countermodel ... % 6.34/1.57 Prover 13: stopped % 6.34/1.57 Prover 7: stopped % 6.34/1.60 Prover 8: Warning: ignoring some quantifiers % 7.05/1.60 Prover 8: Constructing countermodel ... % 7.05/1.61 Prover 8: stopped % 7.05/1.62 Prover 11: Constructing countermodel ... % 7.05/1.63 Prover 11: stopped % 7.05/1.63 % 7.05/1.63 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 7.05/1.63 % 7.05/1.64 % SZS output start Proof for theBenchmark % 7.05/1.64 Assumptions after simplification: % 7.05/1.64 --------------------------------- % 7.05/1.64 % 7.05/1.64 (before_transitive) % 7.05/1.67 ! [v0: interval] : ! [v1: interval] : ! [v2: interval] : ! [v3: int] : (v3 % 7.05/1.67 = 0 | ~ (before(v0, v2) = v3) | ~ (before(v0, v1) = 0) | ~ interval(v2) | % 7.05/1.67 ~ interval(v1) | ~ interval(v0) | ? [v4: int] : ( ~ (v4 = 0) & before(v1, % 7.05/1.67 v2) = v4)) % 7.05/1.67 % 7.05/1.67 (goal) % 7.05/1.67 interval(h) & interval(a) & ? [v0: int] : ( ~ (v0 = 0) & before(a, h) = v0) % 7.05/1.67 % 7.05/1.67 (p1) % 7.05/1.67 before(a, b) = 0 & interval(b) & interval(a) % 7.05/1.67 % 7.05/1.67 (p2) % 7.05/1.67 before(b, c) = 0 & interval(c) & interval(b) % 7.05/1.67 % 7.05/1.67 (p3) % 7.05/1.67 before(c, d) = 0 & interval(d) & interval(c) % 7.05/1.67 % 7.05/1.67 (p4) % 7.05/1.67 before(d, e) = 0 & interval(e) & interval(d) % 7.05/1.67 % 7.05/1.67 (p5) % 7.05/1.67 before(e, f) = 0 & interval(f) & interval(e) % 7.05/1.67 % 7.05/1.67 (p6) % 7.05/1.67 before(f, g) = 0 & interval(g) & interval(f) % 7.05/1.67 % 7.05/1.67 (p7) % 7.05/1.67 before(g, h) = 0 & interval(h) & interval(g) % 7.05/1.67 % 7.05/1.67 (function-axioms) % 7.05/1.68 ! [v0: MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: interval] : % 7.05/1.68 ! [v3: interval] : (v1 = v0 | ~ (finishes(v3, v2) = v1) | ~ (finishes(v3, % 7.05/1.68 v2) = v0)) & ! [v0: MultipleValueBool] : ! [v1: MultipleValueBool] : % 7.05/1.68 ! [v2: interval] : ! [v3: interval] : (v1 = v0 | ~ (finished_by(v3, v2) = % 7.05/1.68 v1) | ~ (finished_by(v3, v2) = v0)) & ! [v0: MultipleValueBool] : ! % 7.05/1.68 [v1: MultipleValueBool] : ! [v2: interval] : ! [v3: interval] : (v1 = v0 | % 7.05/1.68 ~ (during(v3, v2) = v1) | ~ (during(v3, v2) = v0)) & ! [v0: % 7.05/1.68 MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: interval] : ! % 7.05/1.68 [v3: interval] : (v1 = v0 | ~ (contains(v3, v2) = v1) | ~ (contains(v3, v2) % 7.05/1.68 = v0)) & ! [v0: MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: % 7.05/1.68 interval] : ! [v3: interval] : (v1 = v0 | ~ (starts(v3, v2) = v1) | ~ % 7.05/1.68 (starts(v3, v2) = v0)) & ! [v0: MultipleValueBool] : ! [v1: % 7.05/1.68 MultipleValueBool] : ! [v2: interval] : ! [v3: interval] : (v1 = v0 | ~ % 7.05/1.68 (started_by(v3, v2) = v1) | ~ (started_by(v3, v2) = v0)) & ! [v0: % 7.05/1.68 MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: interval] : ! % 7.05/1.68 [v3: interval] : (v1 = v0 | ~ (overlaps(v3, v2) = v1) | ~ (overlaps(v3, v2) % 7.05/1.68 = v0)) & ! [v0: MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: % 7.05/1.68 interval] : ! [v3: interval] : (v1 = v0 | ~ (overlapped_by(v3, v2) = v1) | % 7.05/1.68 ~ (overlapped_by(v3, v2) = v0)) & ! [v0: MultipleValueBool] : ! [v1: % 7.05/1.68 MultipleValueBool] : ! [v2: interval] : ! [v3: interval] : (v1 = v0 | ~ % 7.05/1.68 (met_by(v3, v2) = v1) | ~ (met_by(v3, v2) = v0)) & ! [v0: % 7.05/1.68 MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: interval] : ! % 7.05/1.68 [v3: interval] : (v1 = v0 | ~ (meets(v3, v2) = v1) | ~ (meets(v3, v2) = v0)) % 7.05/1.68 & ! [v0: MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: interval] % 7.05/1.68 : ! [v3: interval] : (v1 = v0 | ~ (after(v3, v2) = v1) | ~ (after(v3, v2) = % 7.05/1.68 v0)) & ! [v0: MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: % 7.05/1.68 interval] : ! [v3: interval] : (v1 = v0 | ~ (before(v3, v2) = v1) | ~ % 7.05/1.68 (before(v3, v2) = v0)) % 7.05/1.68 % 7.05/1.68 Further assumptions not needed in the proof: % 7.05/1.68 -------------------------------------------- % 7.05/1.68 before_after, before_irreflexive, during_inverse, finishes_inverse, meets_metby, % 7.05/1.68 overlaps_inverse, starts_inverse % 7.05/1.68 % 7.05/1.68 Those formulas are unsatisfiable: % 7.05/1.68 --------------------------------- % 7.05/1.68 % 7.05/1.68 Begin of proof % 7.05/1.68 | % 7.05/1.68 | ALPHA: (p1) implies: % 7.05/1.69 | (1) before(a, b) = 0 % 7.05/1.69 | % 7.05/1.69 | ALPHA: (p2) implies: % 7.05/1.69 | (2) interval(b) % 7.05/1.69 | (3) before(b, c) = 0 % 7.05/1.69 | % 7.05/1.69 | ALPHA: (p3) implies: % 7.05/1.69 | (4) interval(c) % 7.05/1.69 | (5) before(c, d) = 0 % 7.05/1.69 | % 7.05/1.69 | ALPHA: (p4) implies: % 7.05/1.69 | (6) interval(d) % 7.05/1.69 | (7) before(d, e) = 0 % 7.05/1.69 | % 7.05/1.69 | ALPHA: (p5) implies: % 7.05/1.69 | (8) interval(e) % 7.05/1.69 | (9) before(e, f) = 0 % 7.05/1.69 | % 7.05/1.69 | ALPHA: (p6) implies: % 7.05/1.69 | (10) interval(f) % 7.05/1.69 | (11) before(f, g) = 0 % 7.05/1.69 | % 7.05/1.69 | ALPHA: (p7) implies: % 7.05/1.69 | (12) interval(g) % 7.05/1.69 | (13) before(g, h) = 0 % 7.05/1.69 | % 7.05/1.69 | ALPHA: (goal) implies: % 7.05/1.69 | (14) interval(a) % 7.05/1.69 | (15) interval(h) % 7.05/1.69 | (16) ? [v0: int] : ( ~ (v0 = 0) & before(a, h) = v0) % 7.05/1.69 | % 7.05/1.69 | ALPHA: (function-axioms) implies: % 7.05/1.69 | (17) ! [v0: MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: % 7.05/1.69 | interval] : ! [v3: interval] : (v1 = v0 | ~ (before(v3, v2) = v1) % 7.05/1.69 | | ~ (before(v3, v2) = v0)) % 7.05/1.69 | % 7.05/1.69 | DELTA: instantiating (16) with fresh symbol all_14_0 gives: % 7.05/1.69 | (18) ~ (all_14_0 = 0) & before(a, h) = all_14_0 % 7.05/1.69 | % 7.05/1.69 | ALPHA: (18) implies: % 7.05/1.69 | (19) ~ (all_14_0 = 0) % 7.05/1.69 | (20) before(a, h) = all_14_0 % 7.05/1.69 | % 7.05/1.70 | GROUND_INST: instantiating (before_transitive) with a, b, h, all_14_0, % 7.05/1.70 | simplifying with (1), (2), (14), (15), (20) gives: % 7.05/1.70 | (21) all_14_0 = 0 | ? [v0: int] : ( ~ (v0 = 0) & before(b, h) = v0) % 7.05/1.70 | % 7.05/1.70 | BETA: splitting (21) gives: % 7.05/1.70 | % 7.05/1.70 | Case 1: % 7.05/1.70 | | % 7.05/1.70 | | (22) all_14_0 = 0 % 7.05/1.70 | | % 7.05/1.70 | | REDUCE: (19), (22) imply: % 7.05/1.70 | | (23) $false % 7.56/1.70 | | % 7.56/1.70 | | CLOSE: (23) is inconsistent. % 7.56/1.70 | | % 7.56/1.70 | Case 2: % 7.56/1.70 | | % 7.56/1.70 | | (24) ? [v0: int] : ( ~ (v0 = 0) & before(b, h) = v0) % 7.56/1.70 | | % 7.56/1.70 | | DELTA: instantiating (24) with fresh symbol all_23_0 gives: % 7.56/1.70 | | (25) ~ (all_23_0 = 0) & before(b, h) = all_23_0 % 7.56/1.70 | | % 7.56/1.70 | | ALPHA: (25) implies: % 7.56/1.70 | | (26) ~ (all_23_0 = 0) % 7.56/1.70 | | (27) before(b, h) = all_23_0 % 7.56/1.70 | | % 7.56/1.70 | | GROUND_INST: instantiating (before_transitive) with b, c, h, all_23_0, % 7.56/1.70 | | simplifying with (2), (3), (4), (15), (27) gives: % 7.56/1.70 | | (28) all_23_0 = 0 | ? [v0: int] : ( ~ (v0 = 0) & before(c, h) = v0) % 7.56/1.70 | | % 7.56/1.70 | | BETA: splitting (28) gives: % 7.56/1.70 | | % 7.56/1.70 | | Case 1: % 7.56/1.70 | | | % 7.56/1.70 | | | (29) all_23_0 = 0 % 7.56/1.70 | | | % 7.56/1.70 | | | REDUCE: (26), (29) imply: % 7.56/1.70 | | | (30) $false % 7.56/1.70 | | | % 7.56/1.70 | | | CLOSE: (30) is inconsistent. % 7.56/1.70 | | | % 7.56/1.70 | | Case 2: % 7.56/1.70 | | | % 7.56/1.70 | | | (31) ? [v0: int] : ( ~ (v0 = 0) & before(c, h) = v0) % 7.56/1.70 | | | % 7.56/1.70 | | | DELTA: instantiating (31) with fresh symbol all_32_0 gives: % 7.56/1.70 | | | (32) ~ (all_32_0 = 0) & before(c, h) = all_32_0 % 7.56/1.70 | | | % 7.56/1.70 | | | ALPHA: (32) implies: % 7.56/1.70 | | | (33) ~ (all_32_0 = 0) % 7.56/1.70 | | | (34) before(c, h) = all_32_0 % 7.56/1.70 | | | % 7.56/1.70 | | | GROUND_INST: instantiating (before_transitive) with c, d, h, all_32_0, % 7.56/1.70 | | | simplifying with (4), (5), (6), (15), (34) gives: % 7.56/1.70 | | | (35) all_32_0 = 0 | ? [v0: int] : ( ~ (v0 = 0) & before(d, h) = v0) % 7.56/1.70 | | | % 7.56/1.70 | | | BETA: splitting (35) gives: % 7.56/1.70 | | | % 7.56/1.70 | | | Case 1: % 7.56/1.70 | | | | % 7.56/1.70 | | | | (36) all_32_0 = 0 % 7.56/1.70 | | | | % 7.56/1.70 | | | | REDUCE: (33), (36) imply: % 7.56/1.70 | | | | (37) $false % 7.56/1.70 | | | | % 7.56/1.70 | | | | CLOSE: (37) is inconsistent. % 7.56/1.70 | | | | % 7.56/1.70 | | | Case 2: % 7.56/1.70 | | | | % 7.56/1.70 | | | | (38) ? [v0: int] : ( ~ (v0 = 0) & before(d, h) = v0) % 7.56/1.70 | | | | % 7.56/1.70 | | | | DELTA: instantiating (38) with fresh symbol all_41_0 gives: % 7.56/1.70 | | | | (39) ~ (all_41_0 = 0) & before(d, h) = all_41_0 % 7.56/1.70 | | | | % 7.56/1.70 | | | | ALPHA: (39) implies: % 7.56/1.71 | | | | (40) ~ (all_41_0 = 0) % 7.56/1.71 | | | | (41) before(d, h) = all_41_0 % 7.56/1.71 | | | | % 7.56/1.71 | | | | GROUND_INST: instantiating (before_transitive) with d, e, h, all_41_0, % 7.56/1.71 | | | | simplifying with (6), (7), (8), (15), (41) gives: % 7.56/1.71 | | | | (42) all_41_0 = 0 | ? [v0: int] : ( ~ (v0 = 0) & before(e, h) = v0) % 7.56/1.71 | | | | % 7.56/1.71 | | | | BETA: splitting (42) gives: % 7.56/1.71 | | | | % 7.56/1.71 | | | | Case 1: % 7.56/1.71 | | | | | % 7.56/1.71 | | | | | (43) all_41_0 = 0 % 7.56/1.71 | | | | | % 7.56/1.71 | | | | | REDUCE: (40), (43) imply: % 7.56/1.71 | | | | | (44) $false % 7.56/1.71 | | | | | % 7.56/1.71 | | | | | CLOSE: (44) is inconsistent. % 7.56/1.71 | | | | | % 7.56/1.71 | | | | Case 2: % 7.56/1.71 | | | | | % 7.56/1.71 | | | | | (45) ? [v0: int] : ( ~ (v0 = 0) & before(e, h) = v0) % 7.56/1.71 | | | | | % 7.56/1.71 | | | | | DELTA: instantiating (45) with fresh symbol all_50_0 gives: % 7.56/1.71 | | | | | (46) ~ (all_50_0 = 0) & before(e, h) = all_50_0 % 7.56/1.71 | | | | | % 7.56/1.71 | | | | | ALPHA: (46) implies: % 7.56/1.71 | | | | | (47) ~ (all_50_0 = 0) % 7.56/1.71 | | | | | (48) before(e, h) = all_50_0 % 7.56/1.71 | | | | | % 7.56/1.71 | | | | | GROUND_INST: instantiating (before_transitive) with e, f, h, all_50_0, % 7.56/1.71 | | | | | simplifying with (8), (9), (10), (15), (48) gives: % 7.56/1.71 | | | | | (49) all_50_0 = 0 | ? [v0: int] : ( ~ (v0 = 0) & before(f, h) = % 7.56/1.71 | | | | | v0) % 7.56/1.71 | | | | | % 7.56/1.71 | | | | | BETA: splitting (49) gives: % 7.56/1.71 | | | | | % 7.56/1.71 | | | | | Case 1: % 7.56/1.71 | | | | | | % 7.56/1.71 | | | | | | (50) all_50_0 = 0 % 7.56/1.71 | | | | | | % 7.56/1.71 | | | | | | REDUCE: (47), (50) imply: % 7.56/1.71 | | | | | | (51) $false % 7.56/1.71 | | | | | | % 7.56/1.71 | | | | | | CLOSE: (51) is inconsistent. % 7.56/1.71 | | | | | | % 7.56/1.71 | | | | | Case 2: % 7.56/1.71 | | | | | | % 7.56/1.71 | | | | | | (52) ? [v0: int] : ( ~ (v0 = 0) & before(f, h) = v0) % 7.56/1.71 | | | | | | % 7.56/1.71 | | | | | | DELTA: instantiating (52) with fresh symbol all_59_0 gives: % 7.56/1.71 | | | | | | (53) ~ (all_59_0 = 0) & before(f, h) = all_59_0 % 7.56/1.71 | | | | | | % 7.56/1.71 | | | | | | ALPHA: (53) implies: % 7.56/1.71 | | | | | | (54) ~ (all_59_0 = 0) % 7.56/1.71 | | | | | | (55) before(f, h) = all_59_0 % 7.56/1.71 | | | | | | % 7.56/1.71 | | | | | | GROUND_INST: instantiating (before_transitive) with f, g, h, % 7.56/1.71 | | | | | | all_59_0, simplifying with (10), (11), (12), (15), (55) % 7.56/1.71 | | | | | | gives: % 7.56/1.71 | | | | | | (56) all_59_0 = 0 | ? [v0: int] : ( ~ (v0 = 0) & before(g, h) = % 7.56/1.71 | | | | | | v0) % 7.56/1.71 | | | | | | % 7.56/1.71 | | | | | | BETA: splitting (56) gives: % 7.56/1.71 | | | | | | % 7.56/1.71 | | | | | | Case 1: % 7.56/1.71 | | | | | | | % 7.56/1.71 | | | | | | | (57) all_59_0 = 0 % 7.56/1.71 | | | | | | | % 7.56/1.71 | | | | | | | REDUCE: (54), (57) imply: % 7.56/1.71 | | | | | | | (58) $false % 7.56/1.71 | | | | | | | % 7.56/1.71 | | | | | | | CLOSE: (58) is inconsistent. % 7.56/1.71 | | | | | | | % 7.56/1.71 | | | | | | Case 2: % 7.56/1.71 | | | | | | | % 7.56/1.71 | | | | | | | (59) ? [v0: int] : ( ~ (v0 = 0) & before(g, h) = v0) % 7.56/1.71 | | | | | | | % 7.56/1.71 | | | | | | | DELTA: instantiating (59) with fresh symbol all_68_0 gives: % 7.56/1.71 | | | | | | | (60) ~ (all_68_0 = 0) & before(g, h) = all_68_0 % 7.56/1.71 | | | | | | | % 7.56/1.71 | | | | | | | ALPHA: (60) implies: % 7.56/1.71 | | | | | | | (61) ~ (all_68_0 = 0) % 7.56/1.71 | | | | | | | (62) before(g, h) = all_68_0 % 7.56/1.71 | | | | | | | % 7.56/1.71 | | | | | | | GROUND_INST: instantiating (17) with 0, all_68_0, h, g, % 7.56/1.71 | | | | | | | simplifying with (13), (62) gives: % 7.56/1.71 | | | | | | | (63) all_68_0 = 0 % 7.56/1.71 | | | | | | | % 7.56/1.71 | | | | | | | REDUCE: (61), (63) imply: % 7.56/1.71 | | | | | | | (64) $false % 7.56/1.71 | | | | | | | % 7.56/1.71 | | | | | | | CLOSE: (64) is inconsistent. % 7.56/1.71 | | | | | | | % 7.56/1.71 | | | | | | End of split % 7.56/1.71 | | | | | | % 7.56/1.71 | | | | | End of split % 7.56/1.71 | | | | | % 7.56/1.71 | | | | End of split % 7.56/1.71 | | | | % 7.56/1.71 | | | End of split % 7.56/1.71 | | | % 7.56/1.71 | | End of split % 7.56/1.71 | | % 7.56/1.71 | End of split % 7.56/1.71 | % 7.56/1.71 End of proof % 7.56/1.72 % SZS output end Proof for theBenchmark % 7.56/1.72 % 7.56/1.72 1169ms %------------------------------------------------------------------------------