TSTP Solution File: GEO085+1 by Princess---230619
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Princess---230619
% Problem : GEO085+1 : TPTP v8.1.2. Released v2.4.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 : Wed Aug 30 23:21:20 EDT 2023
% Result : Theorem 6.97s 1.70s
% Output : Proof 9.88s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : GEO085+1 : TPTP v8.1.2. Released v2.4.0.
% 0.03/0.13 % Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s
% 0.13/0.34 % Computer : n023.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Tue Aug 29 22:46:10 EDT 2023
% 0.13/0.34 % CPUTime :
% 0.68/0.64 ________ _____
% 0.68/0.64 ___ __ \_________(_)________________________________
% 0.68/0.64 __ /_/ /_ ___/_ /__ __ \ ___/ _ \_ ___/_ ___/
% 0.68/0.64 _ ____/_ / _ / _ / / / /__ / __/(__ )_(__ )
% 0.68/0.64 /_/ /_/ /_/ /_/ /_/\___/ \___//____/ /____/
% 0.68/0.64
% 0.68/0.64 A Theorem Prover for First-Order Logic modulo Linear Integer Arithmetic
% 0.68/0.64 (2023-06-19)
% 0.68/0.64
% 0.68/0.64 (c) Philipp Rümmer, 2009-2023
% 0.68/0.64 Contributors: Peter Backeman, Peter Baumgartner, Angelo Brillout, Zafer Esen,
% 0.68/0.64 Amanda Stjerna.
% 0.68/0.64 Free software under BSD-3-Clause.
% 0.68/0.64
% 0.68/0.64 For more information, visit http://www.philipp.ruemmer.org/princess.shtml
% 0.68/0.64
% 0.68/0.64 Loading /export/starexec/sandbox2/benchmark/theBenchmark.p ...
% 0.68/0.65 Running up to 7 provers in parallel.
% 0.68/0.66 Prover 0: Options: +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1042961893
% 0.68/0.66 Prover 1: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1571432423
% 0.68/0.66 Prover 2: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMinimalAndEmpty -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1065072994
% 0.68/0.66 Prover 3: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1922548996
% 0.68/0.66 Prover 4: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=1868514696
% 0.68/0.66 Prover 5: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=complete -randomSeed=1259561288
% 0.68/0.66 Prover 6: Options: -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximalOutermost -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1399714365
% 3.04/1.16 Prover 4: Preprocessing ...
% 3.04/1.16 Prover 1: Preprocessing ...
% 3.23/1.19 Prover 5: Preprocessing ...
% 3.23/1.19 Prover 2: Preprocessing ...
% 3.23/1.19 Prover 0: Preprocessing ...
% 3.23/1.19 Prover 6: Preprocessing ...
% 3.23/1.19 Prover 3: Preprocessing ...
% 5.40/1.53 Prover 5: Proving ...
% 5.40/1.53 Prover 2: Proving ...
% 6.16/1.59 Prover 1: Warning: ignoring some quantifiers
% 6.16/1.60 Prover 6: Proving ...
% 6.16/1.60 Prover 3: Warning: ignoring some quantifiers
% 6.16/1.62 Prover 3: Constructing countermodel ...
% 6.16/1.62 Prover 1: Constructing countermodel ...
% 6.97/1.70 Prover 5: proved (1033ms)
% 6.97/1.70
% 6.97/1.70 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 6.97/1.70
% 6.97/1.70 Prover 3: proved (1039ms)
% 6.97/1.70
% 6.97/1.70 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 6.97/1.70
% 6.97/1.70 Prover 2: proved (1040ms)
% 6.97/1.70
% 6.97/1.70 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 6.97/1.70
% 6.97/1.70 Prover 7: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470
% 6.97/1.70 Prover 6: stopped
% 6.97/1.73 Prover 11: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1509710984
% 6.97/1.73 Prover 10: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=919308125
% 6.97/1.73 Prover 8: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089
% 7.48/1.75 Prover 7: Preprocessing ...
% 7.48/1.75 Prover 1: Found proof (size 12)
% 7.48/1.75 Prover 1: proved (1093ms)
% 7.65/1.77 Prover 10: Preprocessing ...
% 7.65/1.77 Prover 11: Preprocessing ...
% 7.65/1.78 Prover 7: stopped
% 7.65/1.80 Prover 10: stopped
% 7.65/1.80 Prover 8: Preprocessing ...
% 8.06/1.84 Prover 11: stopped
% 8.30/1.89 Prover 8: Warning: ignoring some quantifiers
% 8.30/1.90 Prover 8: Constructing countermodel ...
% 8.30/1.91 Prover 8: stopped
% 8.79/1.93 Prover 4: Warning: ignoring some quantifiers
% 9.00/2.00 Prover 4: Constructing countermodel ...
% 9.00/2.01 Prover 4: stopped
% 9.48/2.07 Prover 0: Proving ...
% 9.48/2.08 Prover 0: stopped
% 9.48/2.08
% 9.48/2.08 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 9.48/2.08
% 9.48/2.09 % SZS output start Proof for theBenchmark
% 9.48/2.09 Assumptions after simplification:
% 9.48/2.09 ---------------------------------
% 9.48/2.09
% 9.48/2.09 (c6)
% 9.70/2.14 ! [v0: $i] : ! [v1: $i] : ( ~ (end_point(v1, v0) = 0) | ~ $i(v1) | ~
% 9.70/2.14 $i(v0) | ? [v2: $i] : ( ~ (v2 = v1) & end_point(v2, v0) = 0 & $i(v2)))
% 9.70/2.14
% 9.70/2.14 (open_defn)
% 9.70/2.15 ! [v0: $i] : ! [v1: int] : (v1 = 0 | ~ (open(v0) = v1) | ~ $i(v0) | !
% 9.70/2.15 [v2: $i] : ( ~ (end_point(v2, v0) = 0) | ~ $i(v2))) & ! [v0: $i] : ( ~
% 9.70/2.15 (open(v0) = 0) | ~ $i(v0) | ? [v1: $i] : (end_point(v1, v0) = 0 & $i(v1)))
% 9.70/2.15
% 9.70/2.15 (theorem_2_7_1)
% 9.70/2.15 ? [v0: $i] : (open(v0) = 0 & $i(v0) & ! [v1: $i] : ! [v2: $i] : (v2 = v1 |
% 9.70/2.15 ~ (end_point(v2, v0) = 0) | ~ (end_point(v1, v0) = 0) | ~ $i(v2) | ~
% 9.70/2.15 $i(v1)))
% 9.70/2.15
% 9.70/2.15 Further assumptions not needed in the proof:
% 9.70/2.15 --------------------------------------------
% 9.70/2.15 c1, c2, c3, c4, c5, c7, c8, c9, closed_defn, end_point_defn, inner_point_defn,
% 9.70/2.15 meet_defn, part_of_defn, sum_defn
% 9.70/2.15
% 9.70/2.15 Those formulas are unsatisfiable:
% 9.70/2.15 ---------------------------------
% 9.70/2.15
% 9.70/2.15 Begin of proof
% 9.70/2.15 |
% 9.70/2.15 | ALPHA: (open_defn) implies:
% 9.70/2.16 | (1) ! [v0: $i] : ( ~ (open(v0) = 0) | ~ $i(v0) | ? [v1: $i] :
% 9.70/2.16 | (end_point(v1, v0) = 0 & $i(v1)))
% 9.70/2.16 |
% 9.70/2.16 | DELTA: instantiating (theorem_2_7_1) with fresh symbol all_18_0 gives:
% 9.70/2.16 | (2) open(all_18_0) = 0 & $i(all_18_0) & ! [v0: $i] : ! [v1: $i] : (v1 =
% 9.70/2.16 | v0 | ~ (end_point(v1, all_18_0) = 0) | ~ (end_point(v0, all_18_0) =
% 9.70/2.16 | 0) | ~ $i(v1) | ~ $i(v0))
% 9.70/2.16 |
% 9.70/2.16 | ALPHA: (2) implies:
% 9.70/2.16 | (3) $i(all_18_0)
% 9.70/2.16 | (4) open(all_18_0) = 0
% 9.70/2.16 | (5) ! [v0: $i] : ! [v1: $i] : (v1 = v0 | ~ (end_point(v1, all_18_0) = 0)
% 9.70/2.16 | | ~ (end_point(v0, all_18_0) = 0) | ~ $i(v1) | ~ $i(v0))
% 9.70/2.16 |
% 9.88/2.16 | GROUND_INST: instantiating (1) with all_18_0, simplifying with (3), (4) gives:
% 9.88/2.16 | (6) ? [v0: $i] : (end_point(v0, all_18_0) = 0 & $i(v0))
% 9.88/2.16 |
% 9.88/2.16 | DELTA: instantiating (6) with fresh symbol all_29_0 gives:
% 9.88/2.16 | (7) end_point(all_29_0, all_18_0) = 0 & $i(all_29_0)
% 9.88/2.16 |
% 9.88/2.16 | ALPHA: (7) implies:
% 9.88/2.16 | (8) $i(all_29_0)
% 9.88/2.17 | (9) end_point(all_29_0, all_18_0) = 0
% 9.88/2.17 |
% 9.88/2.17 | GROUND_INST: instantiating (c6) with all_18_0, all_29_0, simplifying with (3),
% 9.88/2.17 | (8), (9) gives:
% 9.88/2.17 | (10) ? [v0: any] : ( ~ (v0 = all_29_0) & end_point(v0, all_18_0) = 0 &
% 9.88/2.17 | $i(v0))
% 9.88/2.17 |
% 9.88/2.17 | DELTA: instantiating (10) with fresh symbol all_38_0 gives:
% 9.88/2.17 | (11) ~ (all_38_0 = all_29_0) & end_point(all_38_0, all_18_0) = 0 &
% 9.88/2.17 | $i(all_38_0)
% 9.88/2.17 |
% 9.88/2.17 | ALPHA: (11) implies:
% 9.88/2.17 | (12) ~ (all_38_0 = all_29_0)
% 9.88/2.17 | (13) $i(all_38_0)
% 9.88/2.17 | (14) end_point(all_38_0, all_18_0) = 0
% 9.88/2.17 |
% 9.88/2.17 | GROUND_INST: instantiating (5) with all_29_0, all_38_0, simplifying with (8),
% 9.88/2.17 | (9), (13), (14) gives:
% 9.88/2.17 | (15) all_38_0 = all_29_0
% 9.88/2.17 |
% 9.88/2.17 | REDUCE: (12), (15) imply:
% 9.88/2.17 | (16) $false
% 9.88/2.17 |
% 9.88/2.17 | CLOSE: (16) is inconsistent.
% 9.88/2.17 |
% 9.88/2.17 End of proof
% 9.88/2.17 % SZS output end Proof for theBenchmark
% 9.88/2.17
% 9.88/2.17 1530ms
%------------------------------------------------------------------------------