TSTP Solution File: KRS125+1 by Princess---230619
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Princess---230619
% Problem : KRS125+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 : n012.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:20 EDT 2023
% Result : Unsatisfiable 4.29s 1.43s
% Output : Proof 6.70s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12 % Problem : KRS125+1 : TPTP v8.1.2. Released v3.1.0.
% 0.12/0.13 % Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s
% 0.13/0.34 % Computer : n012.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 : Mon Aug 28 02:06:25 EDT 2023
% 0.13/0.34 % CPUTime :
% 0.20/0.61 ________ _____
% 0.20/0.61 ___ __ \_________(_)________________________________
% 0.20/0.61 __ /_/ /_ ___/_ /__ __ \ ___/ _ \_ ___/_ ___/
% 0.20/0.61 _ ____/_ / _ / _ / / / /__ / __/(__ )_(__ )
% 0.20/0.61 /_/ /_/ /_/ /_/ /_/\___/ \___//____/ /____/
% 0.20/0.61
% 0.20/0.61 A Theorem Prover for First-Order Logic modulo Linear Integer Arithmetic
% 0.20/0.61 (2023-06-19)
% 0.20/0.61
% 0.20/0.61 (c) Philipp Rümmer, 2009-2023
% 0.20/0.61 Contributors: Peter Backeman, Peter Baumgartner, Angelo Brillout, Zafer Esen,
% 0.20/0.61 Amanda Stjerna.
% 0.20/0.61 Free software under BSD-3-Clause.
% 0.20/0.61
% 0.20/0.61 For more information, visit http://www.philipp.ruemmer.org/princess.shtml
% 0.20/0.61
% 0.20/0.61 Loading /export/starexec/sandbox2/benchmark/theBenchmark.p ...
% 0.20/0.62 Running up to 7 provers in parallel.
% 0.20/0.63 Prover 0: Options: +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1042961893
% 0.20/0.63 Prover 1: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1571432423
% 0.20/0.63 Prover 2: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMinimalAndEmpty -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1065072994
% 0.20/0.63 Prover 4: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=1868514696
% 0.20/0.63 Prover 5: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=complete -randomSeed=1259561288
% 0.20/0.63 Prover 6: Options: -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximalOutermost -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1399714365
% 0.20/0.63 Prover 3: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1922548996
% 1.90/0.97 Prover 4: Preprocessing ...
% 1.90/0.97 Prover 1: Preprocessing ...
% 2.55/1.02 Prover 0: Preprocessing ...
% 2.55/1.02 Prover 6: Preprocessing ...
% 2.55/1.02 Prover 3: Preprocessing ...
% 2.55/1.02 Prover 2: Preprocessing ...
% 2.55/1.02 Prover 5: Preprocessing ...
% 3.91/1.29 Prover 2: Proving ...
% 3.91/1.29 Prover 5: Proving ...
% 3.91/1.30 Prover 6: Proving ...
% 3.91/1.32 Prover 3: Constructing countermodel ...
% 3.91/1.33 Prover 1: Constructing countermodel ...
% 3.91/1.33 Prover 0: Proving ...
% 3.91/1.34 Prover 4: Constructing countermodel ...
% 4.29/1.40 Prover 6: gave up
% 4.29/1.40 Prover 3: gave up
% 4.29/1.42 Prover 1: gave up
% 4.29/1.42 Prover 7: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470
% 4.29/1.42 Prover 8: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089
% 4.29/1.42 Prover 2: proved (797ms)
% 4.29/1.43
% 4.29/1.43 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 4.29/1.43
% 4.29/1.43 Prover 5: proved (792ms)
% 4.29/1.43
% 4.29/1.43 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 4.29/1.43
% 4.29/1.44 Prover 9: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allMinimal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1423531889
% 4.29/1.44 Prover 7: Preprocessing ...
% 4.29/1.44 Prover 10: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=919308125
% 4.29/1.44 Prover 0: stopped
% 5.41/1.45 Prover 11: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1509710984
% 5.41/1.46 Prover 13: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=complete -randomSeed=1138197443
% 5.41/1.46 Prover 9: Preprocessing ...
% 5.41/1.46 Prover 8: Preprocessing ...
% 5.41/1.47 Prover 10: Preprocessing ...
% 5.41/1.47 Prover 11: Preprocessing ...
% 5.41/1.47 Prover 13: Preprocessing ...
% 5.41/1.48 Prover 7: Warning: ignoring some quantifiers
% 5.41/1.49 Prover 7: Constructing countermodel ...
% 5.41/1.50 Prover 10: Warning: ignoring some quantifiers
% 5.41/1.51 Prover 10: Constructing countermodel ...
% 5.41/1.51 Prover 13: Warning: ignoring some quantifiers
% 5.96/1.52 Prover 13: Constructing countermodel ...
% 5.96/1.52 Prover 4: Found proof (size 17)
% 5.96/1.52 Prover 4: proved (891ms)
% 5.96/1.52 Prover 7: stopped
% 5.96/1.53 Prover 10: stopped
% 5.96/1.53 Prover 11: stopped
% 5.96/1.53 Prover 13: stopped
% 6.30/1.58 Prover 8: Warning: ignoring some quantifiers
% 6.30/1.59 Prover 8: Constructing countermodel ...
% 6.30/1.60 Prover 9: Constructing countermodel ...
% 6.30/1.60 Prover 9: stopped
% 6.30/1.60 Prover 8: stopped
% 6.30/1.60
% 6.30/1.60 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 6.30/1.60
% 6.30/1.61 % SZS output start Proof for theBenchmark
% 6.30/1.61 Assumptions after simplification:
% 6.30/1.61 ---------------------------------
% 6.30/1.61
% 6.30/1.61 (axiom_10)
% 6.30/1.64 ! [v0: $i] : ! [v1: int] : (v1 = 0 | ~ (cc(v0) = v1) | ~ $i(v0) | ? [v2:
% 6.30/1.64 int] : ( ~ (v2 = 0) & ce3(v0) = v2)) & ! [v0: $i] : ( ~ (ce3(v0) = 0) |
% 6.30/1.64 ~ $i(v0) | cc(v0) = 0)
% 6.30/1.64
% 6.30/1.64 (axiom_11)
% 6.30/1.64 ! [v0: $i] : ! [v1: int] : (v1 = 0 | ~ (cd(v0) = v1) | ~ $i(v0) | ? [v2:
% 6.30/1.64 int] : ( ~ (v2 = 0) & cf(v0) = v2)) & ! [v0: $i] : ( ~ (cf(v0) = 0) | ~
% 6.30/1.64 $i(v0) | cd(v0) = 0)
% 6.30/1.64
% 6.30/1.64 (axiom_12)
% 6.30/1.64 cUnsatisfiable(i2003_11_14_17_22_17947) = 0 & $i(i2003_11_14_17_22_17947)
% 6.30/1.64
% 6.30/1.64 (axiom_2)
% 6.30/1.65 ! [v0: $i] : ! [v1: int] : (v1 = 0 | ~ (cUnsatisfiable(v0) = v1) | ~
% 6.30/1.65 $i(v0) | ? [v2: any] : ? [v3: any] : (ce3(v0) = v2 & cf(v0) = v3 & ( ~ (v3
% 6.30/1.65 = 0) | ~ (v2 = 0)))) & ! [v0: $i] : ! [v1: any] : ( ~ (ce3(v0) =
% 6.30/1.65 v1) | ~ $i(v0) | ? [v2: any] : ? [v3: any] : (cUnsatisfiable(v0) = v2 &
% 6.30/1.65 cf(v0) = v3 & ( ~ (v2 = 0) | (v3 = 0 & v1 = 0)))) & ! [v0: $i] : ! [v1:
% 6.30/1.65 any] : ( ~ (cf(v0) = v1) | ~ $i(v0) | ? [v2: any] : ? [v3: any] :
% 6.30/1.65 (ce3(v0) = v3 & cUnsatisfiable(v0) = v2 & ( ~ (v2 = 0) | (v3 = 0 & v1 =
% 6.30/1.65 0)))) & ! [v0: $i] : ( ~ (ce3(v0) = 0) | ~ $i(v0) | ? [v1: any] :
% 6.30/1.65 ? [v2: any] : (cUnsatisfiable(v0) = v2 & cf(v0) = v1 & ( ~ (v1 = 0) | v2 =
% 6.30/1.65 0))) & ! [v0: $i] : ( ~ (cUnsatisfiable(v0) = 0) | ~ $i(v0) | (ce3(v0)
% 6.30/1.65 = 0 & cf(v0) = 0)) & ! [v0: $i] : ( ~ (cf(v0) = 0) | ~ $i(v0) | ? [v1:
% 6.30/1.65 any] : ? [v2: any] : (ce3(v0) = v1 & cUnsatisfiable(v0) = v2 & ( ~ (v1 =
% 6.30/1.65 0) | v2 = 0)))
% 6.30/1.65
% 6.30/1.65 (axiom_3)
% 6.30/1.65 ! [v0: $i] : ! [v1: int] : (v1 = 0 | ~ (cdxcomp(v0) = v1) | ~ $i(v0) | ?
% 6.30/1.65 [v2: int] : ( ~ (v2 = 0) & cc(v0) = v2)) & ! [v0: $i] : ( ~ (cc(v0) = 0) |
% 6.30/1.65 ~ $i(v0) | cdxcomp(v0) = 0)
% 6.30/1.65
% 6.30/1.65 (axiom_6)
% 6.70/1.65 ! [v0: $i] : ! [v1: int] : (v1 = 0 | ~ (cd(v0) = v1) | ~ $i(v0) | ? [v2:
% 6.70/1.65 $i] : (ra_Px1(v0, v2) = 0 & $i(v2))) & ! [v0: $i] : ! [v1: $i] : ( ~
% 6.70/1.65 (cd(v0) = 0) | ~ (ra_Px1(v0, v1) = 0) | ~ $i(v1) | ~ $i(v0))
% 6.70/1.65
% 6.70/1.65 (axiom_7)
% 6.70/1.66 ! [v0: $i] : ! [v1: int] : ! [v2: $i] : (v1 = 0 | ~ (ra_Px1(v0, v2) = 0) |
% 6.70/1.66 ~ (cdxcomp(v0) = v1) | ~ $i(v2) | ~ $i(v0)) & ! [v0: $i] : ( ~
% 6.70/1.66 (cdxcomp(v0) = 0) | ~ $i(v0) | ? [v1: $i] : (ra_Px1(v0, v1) = 0 & $i(v1)))
% 6.70/1.66
% 6.70/1.66 Further assumptions not needed in the proof:
% 6.70/1.66 --------------------------------------------
% 6.70/1.66 axiom_0, axiom_1, axiom_4, axiom_5, axiom_8, axiom_9
% 6.70/1.66
% 6.70/1.66 Those formulas are unsatisfiable:
% 6.70/1.66 ---------------------------------
% 6.70/1.66
% 6.70/1.66 Begin of proof
% 6.70/1.66 |
% 6.70/1.66 | ALPHA: (axiom_2) implies:
% 6.70/1.66 | (1) ! [v0: $i] : ( ~ (cUnsatisfiable(v0) = 0) | ~ $i(v0) | (ce3(v0) = 0 &
% 6.70/1.66 | cf(v0) = 0))
% 6.70/1.66 |
% 6.70/1.66 | ALPHA: (axiom_3) implies:
% 6.70/1.66 | (2) ! [v0: $i] : ( ~ (cc(v0) = 0) | ~ $i(v0) | cdxcomp(v0) = 0)
% 6.70/1.66 |
% 6.70/1.66 | ALPHA: (axiom_6) implies:
% 6.70/1.66 | (3) ! [v0: $i] : ! [v1: $i] : ( ~ (cd(v0) = 0) | ~ (ra_Px1(v0, v1) = 0)
% 6.70/1.66 | | ~ $i(v1) | ~ $i(v0))
% 6.70/1.66 |
% 6.70/1.66 | ALPHA: (axiom_7) implies:
% 6.70/1.66 | (4) ! [v0: $i] : ( ~ (cdxcomp(v0) = 0) | ~ $i(v0) | ? [v1: $i] :
% 6.70/1.66 | (ra_Px1(v0, v1) = 0 & $i(v1)))
% 6.70/1.66 |
% 6.70/1.66 | ALPHA: (axiom_10) implies:
% 6.70/1.66 | (5) ! [v0: $i] : ( ~ (ce3(v0) = 0) | ~ $i(v0) | cc(v0) = 0)
% 6.70/1.66 |
% 6.70/1.66 | ALPHA: (axiom_11) implies:
% 6.70/1.66 | (6) ! [v0: $i] : ( ~ (cf(v0) = 0) | ~ $i(v0) | cd(v0) = 0)
% 6.70/1.66 |
% 6.70/1.66 | ALPHA: (axiom_12) implies:
% 6.70/1.66 | (7) $i(i2003_11_14_17_22_17947)
% 6.70/1.66 | (8) cUnsatisfiable(i2003_11_14_17_22_17947) = 0
% 6.70/1.66 |
% 6.70/1.67 | GROUND_INST: instantiating (1) with i2003_11_14_17_22_17947, simplifying with
% 6.70/1.67 | (7), (8) gives:
% 6.70/1.67 | (9) ce3(i2003_11_14_17_22_17947) = 0 & cf(i2003_11_14_17_22_17947) = 0
% 6.70/1.67 |
% 6.70/1.67 | ALPHA: (9) implies:
% 6.70/1.67 | (10) cf(i2003_11_14_17_22_17947) = 0
% 6.70/1.67 | (11) ce3(i2003_11_14_17_22_17947) = 0
% 6.70/1.67 |
% 6.70/1.67 | GROUND_INST: instantiating (6) with i2003_11_14_17_22_17947, simplifying with
% 6.70/1.67 | (7), (10) gives:
% 6.70/1.67 | (12) cd(i2003_11_14_17_22_17947) = 0
% 6.70/1.67 |
% 6.70/1.67 | GROUND_INST: instantiating (5) with i2003_11_14_17_22_17947, simplifying with
% 6.70/1.67 | (7), (11) gives:
% 6.70/1.67 | (13) cc(i2003_11_14_17_22_17947) = 0
% 6.70/1.67 |
% 6.70/1.67 | GROUND_INST: instantiating (2) with i2003_11_14_17_22_17947, simplifying with
% 6.70/1.67 | (7), (13) gives:
% 6.70/1.67 | (14) cdxcomp(i2003_11_14_17_22_17947) = 0
% 6.70/1.67 |
% 6.70/1.67 | GROUND_INST: instantiating (4) with i2003_11_14_17_22_17947, simplifying with
% 6.70/1.67 | (7), (14) gives:
% 6.70/1.67 | (15) ? [v0: $i] : (ra_Px1(i2003_11_14_17_22_17947, v0) = 0 & $i(v0))
% 6.70/1.67 |
% 6.70/1.67 | DELTA: instantiating (15) with fresh symbol all_39_0 gives:
% 6.70/1.67 | (16) ra_Px1(i2003_11_14_17_22_17947, all_39_0) = 0 & $i(all_39_0)
% 6.70/1.67 |
% 6.70/1.67 | ALPHA: (16) implies:
% 6.70/1.67 | (17) $i(all_39_0)
% 6.70/1.67 | (18) ra_Px1(i2003_11_14_17_22_17947, all_39_0) = 0
% 6.70/1.67 |
% 6.70/1.67 | GROUND_INST: instantiating (3) with i2003_11_14_17_22_17947, all_39_0,
% 6.70/1.67 | simplifying with (7), (12), (17), (18) gives:
% 6.70/1.67 | (19) $false
% 6.70/1.67 |
% 6.70/1.67 | CLOSE: (19) is inconsistent.
% 6.70/1.67 |
% 6.70/1.67 End of proof
% 6.70/1.67 % SZS output end Proof for theBenchmark
% 6.70/1.67
% 6.70/1.67 1067ms
%------------------------------------------------------------------------------