TSTP Solution File: KRS095+1 by Princess---230619
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Princess---230619
% Problem : KRS095+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 : n011.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:13 EDT 2023
% Result : Unsatisfiable 4.24s 1.34s
% Output : Proof 5.86s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.12 % Problem : KRS095+1 : TPTP v8.1.2. Released v3.1.0.
% 0.08/0.12 % Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s
% 0.12/0.33 % Computer : n011.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 300
% 0.12/0.33 % DateTime : Mon Aug 28 01:08:40 EDT 2023
% 0.12/0.33 % CPUTime :
% 0.19/0.60 ________ _____
% 0.19/0.60 ___ __ \_________(_)________________________________
% 0.19/0.60 __ /_/ /_ ___/_ /__ __ \ ___/ _ \_ ___/_ ___/
% 0.19/0.60 _ ____/_ / _ / _ / / / /__ / __/(__ )_(__ )
% 0.19/0.60 /_/ /_/ /_/ /_/ /_/\___/ \___//____/ /____/
% 0.19/0.60
% 0.19/0.60 A Theorem Prover for First-Order Logic modulo Linear Integer Arithmetic
% 0.19/0.60 (2023-06-19)
% 0.19/0.60
% 0.19/0.60 (c) Philipp Rümmer, 2009-2023
% 0.19/0.60 Contributors: Peter Backeman, Peter Baumgartner, Angelo Brillout, Zafer Esen,
% 0.19/0.60 Amanda Stjerna.
% 0.19/0.60 Free software under BSD-3-Clause.
% 0.19/0.60
% 0.19/0.60 For more information, visit http://www.philipp.ruemmer.org/princess.shtml
% 0.19/0.60
% 0.19/0.60 Loading /export/starexec/sandbox2/benchmark/theBenchmark.p ...
% 0.19/0.61 Running up to 7 provers in parallel.
% 0.19/0.63 Prover 0: Options: +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1042961893
% 0.19/0.63 Prover 1: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1571432423
% 0.19/0.63 Prover 2: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMinimalAndEmpty -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1065072994
% 0.19/0.63 Prover 3: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1922548996
% 0.19/0.63 Prover 4: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=1868514696
% 0.19/0.63 Prover 5: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=complete -randomSeed=1259561288
% 0.19/0.63 Prover 6: Options: -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximalOutermost -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1399714365
% 2.41/0.99 Prover 4: Preprocessing ...
% 2.41/0.99 Prover 1: Preprocessing ...
% 2.41/1.03 Prover 3: Preprocessing ...
% 2.41/1.03 Prover 0: Preprocessing ...
% 2.41/1.03 Prover 6: Preprocessing ...
% 2.41/1.03 Prover 2: Preprocessing ...
% 2.41/1.03 Prover 5: Preprocessing ...
% 3.56/1.22 Prover 2: Proving ...
% 3.56/1.22 Prover 5: Proving ...
% 4.24/1.26 Prover 3: Constructing countermodel ...
% 4.24/1.26 Prover 6: Proving ...
% 4.24/1.27 Prover 4: Constructing countermodel ...
% 4.24/1.27 Prover 0: Proving ...
% 4.24/1.27 Prover 1: Constructing countermodel ...
% 4.24/1.34 Prover 3: proved (719ms)
% 4.24/1.34
% 4.24/1.34 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 4.24/1.34
% 4.24/1.35 Prover 7: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470
% 4.24/1.35 Prover 5: proved (726ms)
% 4.24/1.35
% 4.24/1.35 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 4.24/1.35
% 4.24/1.36 Prover 0: proved (734ms)
% 4.24/1.36
% 4.24/1.36 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 4.24/1.36
% 4.24/1.36 Prover 2: proved (734ms)
% 4.24/1.36
% 4.24/1.36 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 4.24/1.36
% 4.93/1.36 Prover 6: stopped
% 4.93/1.36 Prover 8: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089
% 4.93/1.36 Prover 1: Found proof (size 9)
% 4.93/1.36 Prover 1: proved (741ms)
% 4.93/1.36 Prover 4: Found proof (size 8)
% 4.93/1.36 Prover 4: proved (737ms)
% 4.93/1.36 Prover 10: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=919308125
% 4.93/1.36 Prover 11: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1509710984
% 4.93/1.37 Prover 13: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=complete -randomSeed=1138197443
% 4.93/1.38 Prover 7: Preprocessing ...
% 4.93/1.39 Prover 11: Preprocessing ...
% 4.93/1.39 Prover 8: Preprocessing ...
% 4.93/1.39 Prover 10: Preprocessing ...
% 4.93/1.40 Prover 13: Preprocessing ...
% 4.93/1.40 Prover 7: stopped
% 4.93/1.41 Prover 10: stopped
% 4.93/1.41 Prover 13: stopped
% 5.40/1.42 Prover 11: stopped
% 5.45/1.46 Prover 8: Warning: ignoring some quantifiers
% 5.45/1.46 Prover 8: Constructing countermodel ...
% 5.45/1.47 Prover 8: stopped
% 5.45/1.47
% 5.45/1.47 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 5.45/1.47
% 5.45/1.47 % SZS output start Proof for theBenchmark
% 5.45/1.48 Assumptions after simplification:
% 5.45/1.48 ---------------------------------
% 5.45/1.48
% 5.45/1.48 (axiom_2)
% 5.86/1.51 ! [v0: $i] : ! [v1: int] : (v1 = 0 | ~ (cUnsatisfiable(v0) = v1) | ~
% 5.86/1.51 $i(v0) | ? [v2: $i] : ? [v3: $i] : ( ~ (v3 = v2) & rr(v0, v3) = 0 & rr(v0,
% 5.86/1.51 v2) = 0 & $i(v3) & $i(v2)) | ! [v2: $i] : ! [v3: $i] : (v3 = v2 | ~
% 5.86/1.51 (rr(v0, v3) = 0) | ~ (rr(v0, v2) = 0) | ~ $i(v3) | ~ $i(v2))) & ! [v0:
% 5.86/1.51 $i] : ( ~ (cUnsatisfiable(v0) = 0) | ~ $i(v0) | ( ! [v1: $i] : ! [v2: $i]
% 5.86/1.51 : (v2 = v1 | ~ (rr(v0, v2) = 0) | ~ (rr(v0, v1) = 0) | ~ $i(v2) | ~
% 5.86/1.51 $i(v1)) & ? [v1: $i] : ? [v2: $i] : ( ~ (v2 = v1) & rr(v0, v2) = 0 &
% 5.86/1.51 rr(v0, v1) = 0 & $i(v2) & $i(v1))))
% 5.86/1.51
% 5.86/1.51 (axiom_4)
% 5.86/1.51 cUnsatisfiable(i2003_11_14_17_20_14253) = 0 & $i(i2003_11_14_17_20_14253)
% 5.86/1.51
% 5.86/1.51 Further assumptions not needed in the proof:
% 5.86/1.51 --------------------------------------------
% 5.86/1.51 axiom_0, axiom_1, axiom_3, cUnsatisfiable_substitution_1, cc_substitution_1,
% 5.86/1.51 cd_substitution_1, cowlNothing_substitution_1, cowlThing_substitution_1,
% 5.86/1.51 rr_substitution_1, rr_substitution_2, xsd_integer_substitution_1,
% 5.86/1.51 xsd_string_substitution_1
% 5.86/1.51
% 5.86/1.51 Those formulas are unsatisfiable:
% 5.86/1.51 ---------------------------------
% 5.86/1.51
% 5.86/1.51 Begin of proof
% 5.86/1.51 |
% 5.86/1.51 | ALPHA: (axiom_2) implies:
% 5.86/1.51 | (1) ! [v0: $i] : ( ~ (cUnsatisfiable(v0) = 0) | ~ $i(v0) | ( ! [v1: $i] :
% 5.86/1.51 | ! [v2: $i] : (v2 = v1 | ~ (rr(v0, v2) = 0) | ~ (rr(v0, v1) = 0)
% 5.86/1.51 | | ~ $i(v2) | ~ $i(v1)) & ? [v1: $i] : ? [v2: $i] : ( ~ (v2 =
% 5.86/1.51 | v1) & rr(v0, v2) = 0 & rr(v0, v1) = 0 & $i(v2) & $i(v1))))
% 5.86/1.51 |
% 5.86/1.51 | ALPHA: (axiom_4) implies:
% 5.86/1.52 | (2) $i(i2003_11_14_17_20_14253)
% 5.86/1.52 | (3) cUnsatisfiable(i2003_11_14_17_20_14253) = 0
% 5.86/1.52 |
% 5.86/1.52 | GROUND_INST: instantiating (1) with i2003_11_14_17_20_14253, simplifying with
% 5.86/1.52 | (2), (3) gives:
% 5.86/1.52 | (4) ! [v0: $i] : ! [v1: $i] : (v1 = v0 | ~ (rr(i2003_11_14_17_20_14253,
% 5.86/1.52 | v1) = 0) | ~ (rr(i2003_11_14_17_20_14253, v0) = 0) | ~ $i(v1) |
% 5.86/1.52 | ~ $i(v0)) & ? [v0: $i] : ? [v1: $i] : ( ~ (v1 = v0) &
% 5.86/1.52 | rr(i2003_11_14_17_20_14253, v1) = 0 & rr(i2003_11_14_17_20_14253, v0)
% 5.86/1.52 | = 0 & $i(v1) & $i(v0))
% 5.86/1.52 |
% 5.86/1.52 | ALPHA: (4) implies:
% 5.86/1.52 | (5) ! [v0: $i] : ! [v1: $i] : (v1 = v0 | ~ (rr(i2003_11_14_17_20_14253,
% 5.86/1.52 | v1) = 0) | ~ (rr(i2003_11_14_17_20_14253, v0) = 0) | ~ $i(v1) |
% 5.86/1.52 | ~ $i(v0))
% 5.86/1.52 | (6) ? [v0: $i] : ? [v1: $i] : ( ~ (v1 = v0) & rr(i2003_11_14_17_20_14253,
% 5.86/1.52 | v1) = 0 & rr(i2003_11_14_17_20_14253, v0) = 0 & $i(v1) & $i(v0))
% 5.86/1.52 |
% 5.86/1.52 | DELTA: instantiating (6) with fresh symbols all_14_0, all_14_1 gives:
% 5.86/1.52 | (7) ~ (all_14_0 = all_14_1) & rr(i2003_11_14_17_20_14253, all_14_0) = 0 &
% 5.86/1.52 | rr(i2003_11_14_17_20_14253, all_14_1) = 0 & $i(all_14_0) & $i(all_14_1)
% 5.86/1.52 |
% 5.86/1.52 | ALPHA: (7) implies:
% 5.86/1.52 | (8) ~ (all_14_0 = all_14_1)
% 5.86/1.53 | (9) $i(all_14_1)
% 5.86/1.53 | (10) $i(all_14_0)
% 5.86/1.53 | (11) rr(i2003_11_14_17_20_14253, all_14_1) = 0
% 5.86/1.53 | (12) rr(i2003_11_14_17_20_14253, all_14_0) = 0
% 5.86/1.53 |
% 5.86/1.53 | GROUND_INST: instantiating (5) with all_14_1, all_14_0, simplifying with (9),
% 5.86/1.53 | (10), (11), (12) gives:
% 5.86/1.53 | (13) all_14_0 = all_14_1
% 5.86/1.53 |
% 5.86/1.53 | REDUCE: (8), (13) imply:
% 5.86/1.53 | (14) $false
% 5.86/1.53 |
% 5.86/1.53 | CLOSE: (14) is inconsistent.
% 5.86/1.53 |
% 5.86/1.53 End of proof
% 5.86/1.53 % SZS output end Proof for theBenchmark
% 5.86/1.53
% 5.86/1.53 928ms
%------------------------------------------------------------------------------