TSTP Solution File: KRS084+1 by Princess---230619
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Princess---230619
% Problem : KRS084+1 : TPTP v8.1.2. Released v3.1.0.
% Transfm : none
% Format : tptp
% Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s
% Computer : n026.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 : Thu Aug 31 05:51:11 EDT 2023
% Result : Unsatisfiable 7.80s 1.93s
% Output : Proof 9.63s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : KRS084+1 : TPTP v8.1.2. Released v3.1.0.
% 0.00/0.14 % Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s
% 0.13/0.35 % Computer : n026.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Mon Aug 28 01:32:34 EDT 2023
% 0.13/0.36 % CPUTime :
% 0.20/0.64 ________ _____
% 0.20/0.64 ___ __ \_________(_)________________________________
% 0.20/0.64 __ /_/ /_ ___/_ /__ __ \ ___/ _ \_ ___/_ ___/
% 0.20/0.64 _ ____/_ / _ / _ / / / /__ / __/(__ )_(__ )
% 0.20/0.64 /_/ /_/ /_/ /_/ /_/\___/ \___//____/ /____/
% 0.20/0.64
% 0.20/0.64 A Theorem Prover for First-Order Logic modulo Linear Integer Arithmetic
% 0.20/0.64 (2023-06-19)
% 0.20/0.64
% 0.20/0.64 (c) Philipp Rümmer, 2009-2023
% 0.20/0.64 Contributors: Peter Backeman, Peter Baumgartner, Angelo Brillout, Zafer Esen,
% 0.20/0.64 Amanda Stjerna.
% 0.20/0.64 Free software under BSD-3-Clause.
% 0.20/0.64
% 0.20/0.64 For more information, visit http://www.philipp.ruemmer.org/princess.shtml
% 0.20/0.64
% 0.20/0.64 Loading /export/starexec/sandbox2/benchmark/theBenchmark.p ...
% 0.20/0.65 Running up to 7 provers in parallel.
% 0.20/0.67 Prover 0: Options: +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1042961893
% 0.20/0.67 Prover 2: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMinimalAndEmpty -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1065072994
% 0.20/0.67 Prover 1: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1571432423
% 0.20/0.67 Prover 3: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1922548996
% 0.20/0.67 Prover 4: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=1868514696
% 0.20/0.67 Prover 5: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=complete -randomSeed=1259561288
% 0.20/0.67 Prover 6: Options: -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximalOutermost -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1399714365
% 2.78/1.18 Prover 4: Preprocessing ...
% 2.78/1.18 Prover 1: Preprocessing ...
% 2.78/1.21 Prover 3: Preprocessing ...
% 2.78/1.21 Prover 0: Preprocessing ...
% 2.78/1.21 Prover 6: Preprocessing ...
% 2.78/1.21 Prover 5: Preprocessing ...
% 2.78/1.21 Prover 2: Preprocessing ...
% 5.35/1.61 Prover 2: Proving ...
% 5.35/1.62 Prover 5: Proving ...
% 5.90/1.69 Prover 1: Constructing countermodel ...
% 6.33/1.73 Prover 6: Proving ...
% 6.33/1.73 Prover 3: Constructing countermodel ...
% 7.17/1.85 Prover 4: Constructing countermodel ...
% 7.17/1.87 Prover 1: gave up
% 7.17/1.87 Prover 7: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470
% 7.17/1.87 Prover 3: gave up
% 7.39/1.88 Prover 8: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089
% 7.39/1.91 Prover 7: Preprocessing ...
% 7.80/1.93 Prover 8: Preprocessing ...
% 7.80/1.93 Prover 2: proved (1270ms)
% 7.80/1.93 Prover 5: proved (1267ms)
% 7.80/1.93
% 7.80/1.93 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 7.80/1.93
% 7.80/1.93
% 7.80/1.93 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 7.80/1.93
% 7.80/1.94 Prover 6: stopped
% 7.80/1.94 Prover 10: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=919308125
% 7.80/1.94 Prover 11: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1509710984
% 7.80/1.94 Prover 13: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=complete -randomSeed=1138197443
% 7.80/1.95 Prover 0: Proving ...
% 7.94/1.95 Prover 0: stopped
% 7.94/1.96 Prover 16: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=completeFrugal -randomSeed=-2043353683
% 7.94/2.00 Prover 11: Preprocessing ...
% 7.94/2.01 Prover 7: Warning: ignoring some quantifiers
% 7.94/2.01 Prover 13: Preprocessing ...
% 7.94/2.02 Prover 7: Constructing countermodel ...
% 7.94/2.02 Prover 10: Preprocessing ...
% 7.94/2.03 Prover 16: Preprocessing ...
% 7.94/2.07 Prover 8: Warning: ignoring some quantifiers
% 7.94/2.08 Prover 8: Constructing countermodel ...
% 7.94/2.09 Prover 13: Warning: ignoring some quantifiers
% 7.94/2.10 Prover 13: Constructing countermodel ...
% 7.94/2.10 Prover 10: Warning: ignoring some quantifiers
% 7.94/2.10 Prover 10: Constructing countermodel ...
% 7.94/2.11 Prover 16: Warning: ignoring some quantifiers
% 7.94/2.11 Prover 16: Constructing countermodel ...
% 8.67/2.18 Prover 7: Found proof (size 29)
% 8.67/2.18 Prover 7: proved (317ms)
% 8.67/2.18 Prover 8: stopped
% 8.67/2.18 Prover 4: stopped
% 8.67/2.19 Prover 16: stopped
% 8.67/2.19 Prover 10: stopped
% 8.67/2.19 Prover 13: stopped
% 9.63/2.22 Prover 11: Constructing countermodel ...
% 9.63/2.23 Prover 11: stopped
% 9.63/2.23
% 9.63/2.23 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 9.63/2.23
% 9.63/2.24 % SZS output start Proof for theBenchmark
% 9.63/2.24 Assumptions after simplification:
% 9.63/2.24 ---------------------------------
% 9.63/2.24
% 9.63/2.24 (axiom_2)
% 9.63/2.25 ! [v0: $i] : ! [v1: $i] : ( ~ $i(v1) | ~ $i(v0) | ~ rinvR(v0, v1) | ~
% 9.63/2.25 cUnsatisfiable(v0) | ? [v2: $i] : ($i(v2) & rinvF(v1, v2) & cd(v2))) & !
% 9.63/2.25 [v0: $i] : ! [v1: $i] : ( ~ $i(v1) | ~ $i(v0) | ~ rinvF(v0, v1) | ~ cd(v1)
% 9.63/2.25 | cc(v0) | cUnsatisfiable(v0) | ? [v2: $i] : ($i(v2) & rinvR(v0, v2) & !
% 9.63/2.25 [v3: $i] : ( ~ $i(v3) | ~ rinvF(v2, v3) | ~ cd(v3)))) & ! [v0: $i] : (
% 9.63/2.25 ~ $i(v0) | ~ cc(v0) | ~ cUnsatisfiable(v0)) & ! [v0: $i] : ( ~ $i(v0) |
% 9.63/2.25 ~ cUnsatisfiable(v0) | ? [v1: $i] : ($i(v1) & rinvF(v0, v1) & cd(v1)))
% 9.63/2.25
% 9.63/2.25 (axiom_3)
% 9.63/2.25 ! [v0: $i] : ! [v1: $i] : ( ~ $i(v1) | ~ $i(v0) | ~ rf(v0, v1) | ~ cc(v0)
% 9.63/2.25 | cd(v0) | cc(v1)) & ! [v0: $i] : ( ~ $i(v0) | ~ cd(v0) | cc(v0)) & !
% 9.63/2.25 [v0: $i] : ( ~ $i(v0) | ~ cd(v0) | ? [v1: $i] : ($i(v1) & rf(v0, v1) & ~
% 9.63/2.25 cc(v1)))
% 9.63/2.25
% 9.63/2.25 (axiom_4)
% 9.63/2.25 ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : (v2 = v1 | ~ $i(v2) | ~ $i(v1) |
% 9.63/2.25 ~ $i(v0) | ~ rf(v0, v2) | ~ rf(v0, v1))
% 9.63/2.25
% 9.63/2.25 (axiom_5)
% 9.63/2.25 ! [v0: $i] : ! [v1: $i] : ( ~ $i(v1) | ~ $i(v0) | ~ rinvF(v0, v1) | rf(v1,
% 9.63/2.25 v0)) & ! [v0: $i] : ! [v1: $i] : ( ~ $i(v1) | ~ $i(v0) | ~ rf(v1, v0)
% 9.63/2.25 | rinvF(v0, v1))
% 9.63/2.25
% 9.63/2.25 (axiom_6)
% 9.63/2.25 ! [v0: $i] : ! [v1: $i] : ( ~ $i(v1) | ~ $i(v0) | ~ rr(v1, v0) | rinvR(v0,
% 9.63/2.25 v1)) & ! [v0: $i] : ! [v1: $i] : ( ~ $i(v1) | ~ $i(v0) | ~ rinvR(v0,
% 9.63/2.25 v1) | rr(v1, v0))
% 9.63/2.25
% 9.63/2.25 (axiom_8)
% 9.63/2.25 $i(i2003_11_14_17_19_35232) & cUnsatisfiable(i2003_11_14_17_19_35232)
% 9.63/2.25
% 9.63/2.25 (axiom_9)
% 9.63/2.25 ! [v0: $i] : ! [v1: $i] : ( ~ $i(v1) | ~ $i(v0) | ~ rf(v0, v1) | rr(v0,
% 9.63/2.25 v1))
% 9.63/2.25
% 9.63/2.26 Further assumptions not needed in the proof:
% 9.63/2.26 --------------------------------------------
% 9.63/2.26 axiom_0, axiom_1, axiom_7, cUnsatisfiable_substitution_1, cc_substitution_1,
% 9.63/2.26 cd_substitution_1, cowlNothing_substitution_1, cowlThing_substitution_1,
% 9.63/2.26 rf_substitution_1, rf_substitution_2, rinvF_substitution_1,
% 9.63/2.26 rinvF_substitution_2, rinvR_substitution_1, rinvR_substitution_2,
% 9.63/2.26 rr_substitution_1, rr_substitution_2, xsd_integer_substitution_1,
% 9.63/2.26 xsd_string_substitution_1
% 9.63/2.26
% 9.63/2.26 Those formulas are unsatisfiable:
% 9.63/2.26 ---------------------------------
% 9.63/2.26
% 9.63/2.26 Begin of proof
% 9.63/2.26 |
% 9.63/2.26 | ALPHA: (axiom_8) implies:
% 9.63/2.26 | (1) cUnsatisfiable(i2003_11_14_17_19_35232)
% 9.63/2.26 | (2) $i(i2003_11_14_17_19_35232)
% 9.63/2.26 |
% 9.63/2.26 | ALPHA: (axiom_6) implies:
% 9.63/2.26 | (3) ! [v0: $i] : ! [v1: $i] : ( ~ $i(v1) | ~ $i(v0) | ~ rr(v1, v0) |
% 9.63/2.26 | rinvR(v0, v1))
% 9.63/2.26 |
% 9.63/2.26 | ALPHA: (axiom_5) implies:
% 9.63/2.26 | (4) ! [v0: $i] : ! [v1: $i] : ( ~ $i(v1) | ~ $i(v0) | ~ rinvF(v0, v1) |
% 9.63/2.26 | rf(v1, v0))
% 9.63/2.26 |
% 9.63/2.26 | ALPHA: (axiom_3) implies:
% 9.63/2.26 | (5) ! [v0: $i] : ( ~ $i(v0) | ~ cd(v0) | ? [v1: $i] : ($i(v1) & rf(v0,
% 9.63/2.26 | v1) & ~ cc(v1)))
% 9.63/2.26 | (6) ! [v0: $i] : ( ~ $i(v0) | ~ cd(v0) | cc(v0))
% 9.63/2.26 |
% 9.63/2.26 | ALPHA: (axiom_2) implies:
% 9.63/2.26 | (7) ! [v0: $i] : ( ~ $i(v0) | ~ cUnsatisfiable(v0) | ? [v1: $i] :
% 9.63/2.26 | ($i(v1) & rinvF(v0, v1) & cd(v1)))
% 9.63/2.26 | (8) ! [v0: $i] : ! [v1: $i] : ( ~ $i(v1) | ~ $i(v0) | ~ rinvR(v0, v1) |
% 9.63/2.26 | ~ cUnsatisfiable(v0) | ? [v2: $i] : ($i(v2) & rinvF(v1, v2) &
% 9.63/2.26 | cd(v2)))
% 9.63/2.26 |
% 9.63/2.26 | GROUND_INST: instantiating (7) with i2003_11_14_17_19_35232, simplifying with
% 9.63/2.26 | (1), (2) gives:
% 9.63/2.27 | (9) ? [v0: $i] : ($i(v0) & rinvF(i2003_11_14_17_19_35232, v0) & cd(v0))
% 9.63/2.27 |
% 9.63/2.27 | DELTA: instantiating (9) with fresh symbol all_19_0 gives:
% 9.63/2.27 | (10) $i(all_19_0) & rinvF(i2003_11_14_17_19_35232, all_19_0) & cd(all_19_0)
% 9.63/2.27 |
% 9.63/2.27 | ALPHA: (10) implies:
% 9.63/2.27 | (11) cd(all_19_0)
% 9.63/2.27 | (12) rinvF(i2003_11_14_17_19_35232, all_19_0)
% 9.63/2.27 | (13) $i(all_19_0)
% 9.63/2.27 |
% 9.63/2.27 | GROUND_INST: instantiating (6) with all_19_0, simplifying with (11), (13)
% 9.63/2.27 | gives:
% 9.63/2.27 | (14) cc(all_19_0)
% 9.63/2.27 |
% 9.63/2.27 | GROUND_INST: instantiating (5) with all_19_0, simplifying with (11), (13)
% 9.63/2.27 | gives:
% 9.63/2.27 | (15) ? [v0: $i] : ($i(v0) & rf(all_19_0, v0) & ~ cc(v0))
% 9.63/2.27 |
% 9.63/2.27 | GROUND_INST: instantiating (4) with i2003_11_14_17_19_35232, all_19_0,
% 9.63/2.27 | simplifying with (2), (12), (13) gives:
% 9.63/2.27 | (16) rf(all_19_0, i2003_11_14_17_19_35232)
% 9.63/2.27 |
% 9.63/2.27 | DELTA: instantiating (15) with fresh symbol all_27_0 gives:
% 9.63/2.27 | (17) $i(all_27_0) & rf(all_19_0, all_27_0) & ~ cc(all_27_0)
% 9.63/2.27 |
% 9.63/2.27 | ALPHA: (17) implies:
% 9.63/2.27 | (18) rf(all_19_0, all_27_0)
% 9.63/2.27 | (19) $i(all_27_0)
% 9.63/2.27 |
% 9.63/2.27 | GROUND_INST: instantiating (axiom_4) with all_19_0, i2003_11_14_17_19_35232,
% 9.63/2.27 | all_27_0, simplifying with (2), (13), (16), (18), (19) gives:
% 9.63/2.27 | (20) all_27_0 = i2003_11_14_17_19_35232
% 9.63/2.27 |
% 9.63/2.27 | GROUND_INST: instantiating (axiom_9) with all_19_0, all_27_0, simplifying with
% 9.63/2.27 | (13), (18), (19) gives:
% 9.63/2.27 | (21) rr(all_19_0, all_27_0)
% 9.63/2.27 |
% 9.63/2.27 | REDUCE: (20), (21) imply:
% 9.63/2.27 | (22) rr(all_19_0, i2003_11_14_17_19_35232)
% 9.63/2.27 |
% 9.63/2.27 | GROUND_INST: instantiating (3) with i2003_11_14_17_19_35232, all_19_0,
% 9.63/2.27 | simplifying with (2), (13), (22) gives:
% 9.63/2.27 | (23) rinvR(i2003_11_14_17_19_35232, all_19_0)
% 9.63/2.27 |
% 9.63/2.27 | GROUND_INST: instantiating (8) with i2003_11_14_17_19_35232, all_19_0,
% 9.63/2.27 | simplifying with (1), (2), (13), (23) gives:
% 9.63/2.27 | (24) ? [v0: $i] : ($i(v0) & rinvF(all_19_0, v0) & cd(v0))
% 9.63/2.27 |
% 9.63/2.27 | DELTA: instantiating (24) with fresh symbol all_50_0 gives:
% 9.63/2.27 | (25) $i(all_50_0) & rinvF(all_19_0, all_50_0) & cd(all_50_0)
% 9.63/2.27 |
% 9.63/2.27 | ALPHA: (25) implies:
% 9.63/2.27 | (26) cd(all_50_0)
% 9.63/2.27 | (27) rinvF(all_19_0, all_50_0)
% 9.63/2.27 | (28) $i(all_50_0)
% 9.63/2.27 |
% 9.63/2.27 | GROUND_INST: instantiating (5) with all_50_0, simplifying with (26), (28)
% 9.63/2.27 | gives:
% 9.63/2.27 | (29) ? [v0: $i] : ($i(v0) & rf(all_50_0, v0) & ~ cc(v0))
% 9.63/2.27 |
% 9.63/2.27 | GROUND_INST: instantiating (4) with all_19_0, all_50_0, simplifying with (13),
% 9.63/2.27 | (27), (28) gives:
% 9.63/2.27 | (30) rf(all_50_0, all_19_0)
% 9.63/2.27 |
% 9.63/2.27 | DELTA: instantiating (29) with fresh symbol all_58_0 gives:
% 9.63/2.27 | (31) $i(all_58_0) & rf(all_50_0, all_58_0) & ~ cc(all_58_0)
% 9.63/2.27 |
% 9.63/2.27 | ALPHA: (31) implies:
% 9.63/2.27 | (32) ~ cc(all_58_0)
% 9.63/2.27 | (33) rf(all_50_0, all_58_0)
% 9.63/2.27 | (34) $i(all_58_0)
% 9.63/2.28 |
% 9.63/2.28 | PRED_UNIFY: (14), (32) imply:
% 9.63/2.28 | (35) ~ (all_58_0 = all_19_0)
% 9.63/2.28 |
% 9.63/2.28 | GROUND_INST: instantiating (axiom_4) with all_50_0, all_19_0, all_58_0,
% 9.63/2.28 | simplifying with (13), (28), (30), (33), (34) gives:
% 9.63/2.28 | (36) all_58_0 = all_19_0
% 9.63/2.28 |
% 9.63/2.28 | REDUCE: (35), (36) imply:
% 9.63/2.28 | (37) $false
% 9.63/2.28 |
% 9.63/2.28 | CLOSE: (37) is inconsistent.
% 9.63/2.28 |
% 9.63/2.28 End of proof
% 9.63/2.28 % SZS output end Proof for theBenchmark
% 9.63/2.28
% 9.63/2.28 1639ms
%------------------------------------------------------------------------------