TSTP Solution File: KRS111+1 by Princess---230619
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Princess---230619
% Problem : KRS111+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 : n032.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:17 EDT 2023
% Result : Unsatisfiable 6.51s 1.53s
% Output : Proof 9.32s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.09 % Problem : KRS111+1 : TPTP v8.1.2. Released v3.1.0.
% 0.00/0.09 % Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s
% 0.09/0.28 % Computer : n032.cluster.edu
% 0.09/0.28 % Model : x86_64 x86_64
% 0.09/0.28 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.28 % Memory : 8042.1875MB
% 0.09/0.28 % OS : Linux 3.10.0-693.el7.x86_64
% 0.09/0.29 % CPULimit : 300
% 0.09/0.29 % WCLimit : 300
% 0.09/0.29 % DateTime : Mon Aug 28 01:52:30 EDT 2023
% 0.09/0.29 % CPUTime :
% 0.13/0.51 ________ _____
% 0.13/0.51 ___ __ \_________(_)________________________________
% 0.13/0.51 __ /_/ /_ ___/_ /__ __ \ ___/ _ \_ ___/_ ___/
% 0.13/0.51 _ ____/_ / _ / _ / / / /__ / __/(__ )_(__ )
% 0.13/0.51 /_/ /_/ /_/ /_/ /_/\___/ \___//____/ /____/
% 0.13/0.51
% 0.13/0.51 A Theorem Prover for First-Order Logic modulo Linear Integer Arithmetic
% 0.13/0.51 (2023-06-19)
% 0.13/0.51
% 0.13/0.51 (c) Philipp Rümmer, 2009-2023
% 0.13/0.51 Contributors: Peter Backeman, Peter Baumgartner, Angelo Brillout, Zafer Esen,
% 0.13/0.51 Amanda Stjerna.
% 0.13/0.51 Free software under BSD-3-Clause.
% 0.13/0.51
% 0.13/0.51 For more information, visit http://www.philipp.ruemmer.org/princess.shtml
% 0.13/0.51
% 0.13/0.51 Loading /export/starexec/sandbox2/benchmark/theBenchmark.p ...
% 0.13/0.53 Running up to 7 provers in parallel.
% 0.13/0.54 Prover 0: Options: +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1042961893
% 0.13/0.54 Prover 1: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1571432423
% 0.13/0.54 Prover 3: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1922548996
% 0.13/0.54 Prover 2: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMinimalAndEmpty -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1065072994
% 0.13/0.54 Prover 4: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=1868514696
% 0.13/0.54 Prover 5: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=complete -randomSeed=1259561288
% 0.13/0.54 Prover 6: Options: -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximalOutermost -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1399714365
% 2.41/0.94 Prover 1: Preprocessing ...
% 2.41/0.94 Prover 4: Preprocessing ...
% 2.41/0.98 Prover 6: Preprocessing ...
% 2.41/0.98 Prover 5: Preprocessing ...
% 2.41/0.98 Prover 2: Preprocessing ...
% 2.41/0.98 Prover 3: Preprocessing ...
% 2.41/0.98 Prover 0: Preprocessing ...
% 4.41/1.34 Prover 5: Proving ...
% 4.41/1.34 Prover 2: Proving ...
% 4.97/1.40 Prover 6: Proving ...
% 4.97/1.41 Prover 3: Constructing countermodel ...
% 4.97/1.41 Prover 1: Constructing countermodel ...
% 6.01/1.48 Prover 4: Constructing countermodel ...
% 6.51/1.52 Prover 0: Proving ...
% 6.51/1.52 Prover 3: gave up
% 6.51/1.52 Prover 7: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470
% 6.51/1.53 Prover 5: proved (996ms)
% 6.51/1.53
% 6.51/1.53 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 6.51/1.53
% 6.51/1.54 Prover 6: stopped
% 6.51/1.54 Prover 0: stopped
% 6.51/1.54 Prover 2: stopped
% 6.51/1.54 Prover 1: gave up
% 6.51/1.54 Prover 10: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=919308125
% 6.51/1.54 Prover 11: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1509710984
% 6.51/1.54 Prover 8: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089
% 6.51/1.54 Prover 13: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=complete -randomSeed=1138197443
% 6.51/1.54 Prover 16: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=completeFrugal -randomSeed=-2043353683
% 6.91/1.63 Prover 16: Preprocessing ...
% 6.91/1.64 Prover 13: Preprocessing ...
% 6.91/1.64 Prover 7: Preprocessing ...
% 7.68/1.69 Prover 10: Preprocessing ...
% 7.68/1.70 Prover 11: Preprocessing ...
% 7.68/1.70 Prover 8: Preprocessing ...
% 8.02/1.74 Prover 16: Warning: ignoring some quantifiers
% 8.02/1.74 Prover 7: Warning: ignoring some quantifiers
% 8.15/1.75 Prover 7: Constructing countermodel ...
% 8.15/1.77 Prover 16: Constructing countermodel ...
% 8.15/1.77 Prover 10: Warning: ignoring some quantifiers
% 8.15/1.77 Prover 13: Warning: ignoring some quantifiers
% 8.15/1.77 Prover 13: Constructing countermodel ...
% 8.15/1.77 Prover 10: Constructing countermodel ...
% 8.66/1.81 Prover 4: Found proof (size 27)
% 8.66/1.81 Prover 4: proved (1280ms)
% 8.66/1.81 Prover 16: stopped
% 8.66/1.81 Prover 13: stopped
% 8.66/1.81 Prover 10: stopped
% 8.66/1.82 Prover 7: stopped
% 8.66/1.85 Prover 8: Warning: ignoring some quantifiers
% 8.66/1.86 Prover 8: Constructing countermodel ...
% 8.98/1.86 Prover 8: stopped
% 8.98/1.87 Prover 11: Constructing countermodel ...
% 8.98/1.88 Prover 11: stopped
% 8.98/1.88
% 8.98/1.88 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 8.98/1.88
% 8.98/1.90 % SZS output start Proof for theBenchmark
% 8.98/1.90 Assumptions after simplification:
% 8.98/1.90 ---------------------------------
% 8.98/1.90
% 8.98/1.90 (axiom_11)
% 8.98/1.94 cUnsatisfiable(i2003_11_14_17_21_15425) = 0 & $i(i2003_11_14_17_21_15425)
% 8.98/1.94
% 8.98/1.94 (axiom_12)
% 8.98/1.94 ! [v0: $i] : ! [v1: $i] : ! [v2: int] : (v2 = 0 | ~ (rf(v0, v1) = v2) | ~
% 8.98/1.94 $i(v1) | ~ $i(v0) | ? [v3: int] : ( ~ (v3 = 0) & rs(v0, v1) = v3)) & !
% 8.98/1.94 [v0: $i] : ! [v1: $i] : ( ~ (rs(v0, v1) = 0) | ~ $i(v1) | ~ $i(v0) | rf(v0,
% 8.98/1.94 v1) = 0)
% 8.98/1.94
% 8.98/1.94 (axiom_13)
% 8.98/1.95 ! [v0: $i] : ! [v1: $i] : ! [v2: int] : (v2 = 0 | ~ (rf1(v0, v1) = v2) |
% 8.98/1.95 ~ $i(v1) | ~ $i(v0) | ? [v3: int] : ( ~ (v3 = 0) & rs(v0, v1) = v3)) & !
% 8.98/1.95 [v0: $i] : ! [v1: $i] : ( ~ (rs(v0, v1) = 0) | ~ $i(v1) | ~ $i(v0) |
% 8.98/1.95 rf1(v0, v1) = 0)
% 8.98/1.95
% 8.98/1.95 (axiom_2)
% 9.32/1.97 ! [v0: $i] : ! [v1: int] : ! [v2: $i] : ! [v3: $i] : ! [v4: $i] : (v1 = 0
% 9.32/1.97 | ~ (rs(v0, v3) = 0) | ~ (rf1(v0, v4) = 0) | ~ (rf(v0, v2) = 0) | ~
% 9.32/1.97 (cUnsatisfiable(v0) = v1) | ~ $i(v4) | ~ $i(v3) | ~ $i(v2) | ~ $i(v0) |
% 9.32/1.97 ? [v5: int] : (( ~ (v5 = 0) & cpxcomp(v4) = v5) | ( ~ (v5 = 0) & cp(v2) =
% 9.32/1.97 v5) | ( ~ (v5 = 0) & cowlThing(v3) = v5))) & ! [v0: $i] : ! [v1: int]
% 9.32/1.97 : ! [v2: $i] : ! [v3: $i] : ! [v4: $i] : (v1 = 0 | ~ (rs(v0, v3) = 0) | ~
% 9.32/1.97 (rf1(v0, v4) = 0) | ~ (cp(v2) = 0) | ~ (cUnsatisfiable(v0) = v1) | ~
% 9.32/1.97 $i(v4) | ~ $i(v3) | ~ $i(v2) | ~ $i(v0) | ? [v5: int] : (( ~ (v5 = 0) &
% 9.32/1.97 rf(v0, v2) = v5) | ( ~ (v5 = 0) & cpxcomp(v4) = v5) | ( ~ (v5 = 0) &
% 9.32/1.97 cowlThing(v3) = v5))) & ! [v0: $i] : ! [v1: int] : ! [v2: $i] : !
% 9.32/1.97 [v3: $i] : ! [v4: $i] : (v1 = 0 | ~ (rs(v0, v3) = 0) | ~ (rf(v0, v2) = 0) |
% 9.32/1.97 ~ (cpxcomp(v4) = 0) | ~ (cUnsatisfiable(v0) = v1) | ~ $i(v4) | ~ $i(v3)
% 9.32/1.97 | ~ $i(v2) | ~ $i(v0) | ? [v5: int] : (( ~ (v5 = 0) & rf1(v0, v4) = v5) |
% 9.32/1.97 ( ~ (v5 = 0) & cp(v2) = v5) | ( ~ (v5 = 0) & cowlThing(v3) = v5))) & !
% 9.32/1.97 [v0: $i] : ! [v1: int] : ! [v2: $i] : ! [v3: $i] : ! [v4: $i] : (v1 = 0 |
% 9.32/1.97 ~ (rs(v0, v3) = 0) | ~ (cpxcomp(v4) = 0) | ~ (cp(v2) = 0) | ~
% 9.32/1.97 (cUnsatisfiable(v0) = v1) | ~ $i(v4) | ~ $i(v3) | ~ $i(v2) | ~ $i(v0) |
% 9.32/1.97 ? [v5: int] : (( ~ (v5 = 0) & rf1(v0, v4) = v5) | ( ~ (v5 = 0) & rf(v0, v2)
% 9.32/1.97 = v5) | ( ~ (v5 = 0) & cowlThing(v3) = v5))) & ! [v0: $i] : ! [v1:
% 9.32/1.97 int] : ! [v2: $i] : ! [v3: $i] : ! [v4: $i] : (v1 = 0 | ~ (rf1(v0, v4) =
% 9.32/1.97 0) | ~ (rf(v0, v2) = 0) | ~ (cowlThing(v3) = 0) | ~ (cUnsatisfiable(v0)
% 9.32/1.97 = v1) | ~ $i(v4) | ~ $i(v3) | ~ $i(v2) | ~ $i(v0) | ? [v5: int] : ((
% 9.32/1.97 ~ (v5 = 0) & rs(v0, v3) = v5) | ( ~ (v5 = 0) & cpxcomp(v4) = v5) | ( ~
% 9.32/1.97 (v5 = 0) & cp(v2) = v5))) & ! [v0: $i] : ! [v1: int] : ! [v2: $i] :
% 9.32/1.97 ! [v3: $i] : ! [v4: $i] : (v1 = 0 | ~ (rf1(v0, v4) = 0) | ~ (cp(v2) = 0) |
% 9.32/1.97 ~ (cowlThing(v3) = 0) | ~ (cUnsatisfiable(v0) = v1) | ~ $i(v4) | ~ $i(v3)
% 9.32/1.97 | ~ $i(v2) | ~ $i(v0) | ? [v5: int] : (( ~ (v5 = 0) & rs(v0, v3) = v5) |
% 9.32/1.97 ( ~ (v5 = 0) & rf(v0, v2) = v5) | ( ~ (v5 = 0) & cpxcomp(v4) = v5))) & !
% 9.32/1.97 [v0: $i] : ! [v1: int] : ! [v2: $i] : ! [v3: $i] : ! [v4: $i] : (v1 = 0 |
% 9.32/1.97 ~ (rf(v0, v2) = 0) | ~ (cpxcomp(v4) = 0) | ~ (cowlThing(v3) = 0) | ~
% 9.32/1.97 (cUnsatisfiable(v0) = v1) | ~ $i(v4) | ~ $i(v3) | ~ $i(v2) | ~ $i(v0) |
% 9.32/1.97 ? [v5: int] : (( ~ (v5 = 0) & rs(v0, v3) = v5) | ( ~ (v5 = 0) & rf1(v0, v4)
% 9.32/1.97 = v5) | ( ~ (v5 = 0) & cp(v2) = v5))) & ! [v0: $i] : ! [v1: int] : !
% 9.32/1.97 [v2: $i] : ! [v3: $i] : ! [v4: $i] : (v1 = 0 | ~ (cpxcomp(v4) = 0) | ~
% 9.32/1.97 (cp(v2) = 0) | ~ (cowlThing(v3) = 0) | ~ (cUnsatisfiable(v0) = v1) | ~
% 9.32/1.97 $i(v4) | ~ $i(v3) | ~ $i(v2) | ~ $i(v0) | ? [v5: int] : (( ~ (v5 = 0) &
% 9.32/1.97 rs(v0, v3) = v5) | ( ~ (v5 = 0) & rf1(v0, v4) = v5) | ( ~ (v5 = 0) &
% 9.32/1.97 rf(v0, v2) = v5))) & ! [v0: $i] : ( ~ (cUnsatisfiable(v0) = 0) | ~
% 9.32/1.97 $i(v0) | ? [v1: $i] : (rs(v0, v1) = 0 & cowlThing(v1) = 0 & $i(v1))) & !
% 9.32/1.97 [v0: $i] : ( ~ (cUnsatisfiable(v0) = 0) | ~ $i(v0) | ? [v1: $i] : (rf1(v0,
% 9.32/1.97 v1) = 0 & cpxcomp(v1) = 0 & $i(v1))) & ! [v0: $i] : ( ~
% 9.32/1.97 (cUnsatisfiable(v0) = 0) | ~ $i(v0) | ? [v1: $i] : (rf(v0, v1) = 0 &
% 9.32/1.97 cp(v1) = 0 & $i(v1)))
% 9.32/1.97
% 9.32/1.97 (axiom_3)
% 9.32/1.97 ! [v0: $i] : ! [v1: int] : (v1 = 0 | ~ (cp(v0) = v1) | ~ $i(v0) | ? [v2:
% 9.32/1.97 $i] : (ra_Px1(v0, v2) = 0 & $i(v2))) & ! [v0: $i] : ! [v1: $i] : ( ~
% 9.32/1.97 (ra_Px1(v0, v1) = 0) | ~ (cp(v0) = 0) | ~ $i(v1) | ~ $i(v0))
% 9.32/1.97
% 9.32/1.97 (axiom_4)
% 9.32/1.97 ! [v0: $i] : ! [v1: int] : ! [v2: $i] : (v1 = 0 | ~ (ra_Px1(v0, v2) = 0) |
% 9.32/1.97 ~ (cpxcomp(v0) = v1) | ~ $i(v2) | ~ $i(v0)) & ! [v0: $i] : ( ~
% 9.32/1.97 (cpxcomp(v0) = 0) | ~ $i(v0) | ? [v1: $i] : (ra_Px1(v0, v1) = 0 & $i(v1)))
% 9.32/1.97
% 9.32/1.97 (axiom_5)
% 9.32/1.98 ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : (v2 = v1 | ~ (rf(v0, v2) = 0) | ~
% 9.32/1.98 (rf(v0, v1) = 0) | ~ $i(v2) | ~ $i(v1) | ~ $i(v0))
% 9.32/1.98
% 9.32/1.98 (axiom_6)
% 9.32/1.98 ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : (v2 = v1 | ~ (rf1(v0, v2) = 0) | ~
% 9.32/1.98 (rf1(v0, v1) = 0) | ~ $i(v2) | ~ $i(v1) | ~ $i(v0))
% 9.32/1.98
% 9.32/1.98 Further assumptions not needed in the proof:
% 9.32/1.98 --------------------------------------------
% 9.32/1.98 axiom_0, axiom_1, axiom_10, axiom_7, axiom_8, axiom_9,
% 9.32/1.98 cUnsatisfiable_substitution_1, cowlNothing_substitution_1,
% 9.32/1.98 cowlThing_substitution_1, cp_substitution_1, cpxcomp_substitution_1,
% 9.32/1.98 ra_Px1_substitution_1, ra_Px1_substitution_2, rf1_substitution_1,
% 9.32/1.98 rf1_substitution_2, rf_substitution_1, rf_substitution_2, rinvF1_substitution_1,
% 9.32/1.98 rinvF1_substitution_2, rinvF_substitution_1, rinvF_substitution_2,
% 9.32/1.98 rinvS_substitution_1, rinvS_substitution_2, rs_substitution_1,
% 9.32/1.98 rs_substitution_2, xsd_integer_substitution_1, xsd_string_substitution_1
% 9.32/1.98
% 9.32/1.98 Those formulas are unsatisfiable:
% 9.32/1.98 ---------------------------------
% 9.32/1.98
% 9.32/1.98 Begin of proof
% 9.32/1.98 |
% 9.32/1.98 | ALPHA: (axiom_2) implies:
% 9.32/1.98 | (1) ! [v0: $i] : ( ~ (cUnsatisfiable(v0) = 0) | ~ $i(v0) | ? [v1: $i] :
% 9.32/1.98 | (rf(v0, v1) = 0 & cp(v1) = 0 & $i(v1)))
% 9.32/1.98 | (2) ! [v0: $i] : ( ~ (cUnsatisfiable(v0) = 0) | ~ $i(v0) | ? [v1: $i] :
% 9.32/1.98 | (rf1(v0, v1) = 0 & cpxcomp(v1) = 0 & $i(v1)))
% 9.32/1.98 | (3) ! [v0: $i] : ( ~ (cUnsatisfiable(v0) = 0) | ~ $i(v0) | ? [v1: $i] :
% 9.32/1.99 | (rs(v0, v1) = 0 & cowlThing(v1) = 0 & $i(v1)))
% 9.32/1.99 |
% 9.32/1.99 | ALPHA: (axiom_3) implies:
% 9.32/1.99 | (4) ! [v0: $i] : ! [v1: $i] : ( ~ (ra_Px1(v0, v1) = 0) | ~ (cp(v0) = 0)
% 9.32/1.99 | | ~ $i(v1) | ~ $i(v0))
% 9.32/1.99 |
% 9.32/1.99 | ALPHA: (axiom_4) implies:
% 9.32/1.99 | (5) ! [v0: $i] : ( ~ (cpxcomp(v0) = 0) | ~ $i(v0) | ? [v1: $i] :
% 9.32/1.99 | (ra_Px1(v0, v1) = 0 & $i(v1)))
% 9.32/1.99 |
% 9.32/1.99 | ALPHA: (axiom_11) implies:
% 9.32/1.99 | (6) $i(i2003_11_14_17_21_15425)
% 9.32/1.99 | (7) cUnsatisfiable(i2003_11_14_17_21_15425) = 0
% 9.32/1.99 |
% 9.32/1.99 | ALPHA: (axiom_12) implies:
% 9.32/1.99 | (8) ! [v0: $i] : ! [v1: $i] : ( ~ (rs(v0, v1) = 0) | ~ $i(v1) | ~
% 9.32/1.99 | $i(v0) | rf(v0, v1) = 0)
% 9.32/1.99 |
% 9.32/1.99 | ALPHA: (axiom_13) implies:
% 9.32/1.99 | (9) ! [v0: $i] : ! [v1: $i] : ( ~ (rs(v0, v1) = 0) | ~ $i(v1) | ~
% 9.32/1.99 | $i(v0) | rf1(v0, v1) = 0)
% 9.32/1.99 |
% 9.32/1.99 | GROUND_INST: instantiating (3) with i2003_11_14_17_21_15425, simplifying with
% 9.32/1.99 | (6), (7) gives:
% 9.32/1.99 | (10) ? [v0: $i] : (rs(i2003_11_14_17_21_15425, v0) = 0 & cowlThing(v0) = 0
% 9.32/1.99 | & $i(v0))
% 9.32/1.99 |
% 9.32/1.99 | GROUND_INST: instantiating (2) with i2003_11_14_17_21_15425, simplifying with
% 9.32/1.99 | (6), (7) gives:
% 9.32/1.99 | (11) ? [v0: $i] : (rf1(i2003_11_14_17_21_15425, v0) = 0 & cpxcomp(v0) = 0
% 9.32/1.99 | & $i(v0))
% 9.32/1.99 |
% 9.32/1.99 | GROUND_INST: instantiating (1) with i2003_11_14_17_21_15425, simplifying with
% 9.32/1.99 | (6), (7) gives:
% 9.32/1.99 | (12) ? [v0: $i] : (rf(i2003_11_14_17_21_15425, v0) = 0 & cp(v0) = 0 &
% 9.32/2.00 | $i(v0))
% 9.32/2.00 |
% 9.32/2.00 | DELTA: instantiating (12) with fresh symbol all_22_0 gives:
% 9.32/2.00 | (13) rf(i2003_11_14_17_21_15425, all_22_0) = 0 & cp(all_22_0) = 0 &
% 9.32/2.00 | $i(all_22_0)
% 9.32/2.00 |
% 9.32/2.00 | ALPHA: (13) implies:
% 9.32/2.00 | (14) $i(all_22_0)
% 9.32/2.00 | (15) cp(all_22_0) = 0
% 9.32/2.00 | (16) rf(i2003_11_14_17_21_15425, all_22_0) = 0
% 9.32/2.00 |
% 9.32/2.00 | DELTA: instantiating (11) with fresh symbol all_24_0 gives:
% 9.32/2.00 | (17) rf1(i2003_11_14_17_21_15425, all_24_0) = 0 & cpxcomp(all_24_0) = 0 &
% 9.32/2.00 | $i(all_24_0)
% 9.32/2.00 |
% 9.32/2.00 | ALPHA: (17) implies:
% 9.32/2.00 | (18) $i(all_24_0)
% 9.32/2.00 | (19) cpxcomp(all_24_0) = 0
% 9.32/2.00 | (20) rf1(i2003_11_14_17_21_15425, all_24_0) = 0
% 9.32/2.00 |
% 9.32/2.00 | DELTA: instantiating (10) with fresh symbol all_26_0 gives:
% 9.32/2.00 | (21) rs(i2003_11_14_17_21_15425, all_26_0) = 0 & cowlThing(all_26_0) = 0 &
% 9.32/2.00 | $i(all_26_0)
% 9.32/2.00 |
% 9.32/2.00 | ALPHA: (21) implies:
% 9.32/2.00 | (22) $i(all_26_0)
% 9.32/2.00 | (23) rs(i2003_11_14_17_21_15425, all_26_0) = 0
% 9.32/2.00 |
% 9.32/2.00 | GROUND_INST: instantiating (5) with all_24_0, simplifying with (18), (19)
% 9.32/2.00 | gives:
% 9.32/2.00 | (24) ? [v0: $i] : (ra_Px1(all_24_0, v0) = 0 & $i(v0))
% 9.32/2.00 |
% 9.32/2.00 | GROUND_INST: instantiating (9) with i2003_11_14_17_21_15425, all_26_0,
% 9.32/2.00 | simplifying with (6), (22), (23) gives:
% 9.32/2.00 | (25) rf1(i2003_11_14_17_21_15425, all_26_0) = 0
% 9.32/2.00 |
% 9.32/2.00 | GROUND_INST: instantiating (8) with i2003_11_14_17_21_15425, all_26_0,
% 9.32/2.00 | simplifying with (6), (22), (23) gives:
% 9.32/2.00 | (26) rf(i2003_11_14_17_21_15425, all_26_0) = 0
% 9.32/2.00 |
% 9.32/2.00 | DELTA: instantiating (24) with fresh symbol all_34_0 gives:
% 9.32/2.00 | (27) ra_Px1(all_24_0, all_34_0) = 0 & $i(all_34_0)
% 9.32/2.00 |
% 9.32/2.00 | ALPHA: (27) implies:
% 9.32/2.00 | (28) $i(all_34_0)
% 9.32/2.00 | (29) ra_Px1(all_24_0, all_34_0) = 0
% 9.32/2.00 |
% 9.32/2.00 | GROUND_INST: instantiating (axiom_5) with i2003_11_14_17_21_15425, all_22_0,
% 9.32/2.00 | all_26_0, simplifying with (6), (14), (16), (22), (26) gives:
% 9.32/2.00 | (30) all_26_0 = all_22_0
% 9.32/2.00 |
% 9.32/2.00 | GROUND_INST: instantiating (axiom_6) with i2003_11_14_17_21_15425, all_24_0,
% 9.32/2.00 | all_26_0, simplifying with (6), (18), (20), (22), (25) gives:
% 9.32/2.00 | (31) all_26_0 = all_24_0
% 9.32/2.00 |
% 9.32/2.01 | COMBINE_EQS: (30), (31) imply:
% 9.32/2.01 | (32) all_24_0 = all_22_0
% 9.32/2.01 |
% 9.32/2.01 | REDUCE: (29), (32) imply:
% 9.32/2.01 | (33) ra_Px1(all_22_0, all_34_0) = 0
% 9.32/2.01 |
% 9.32/2.01 | GROUND_INST: instantiating (4) with all_22_0, all_34_0, simplifying with (14),
% 9.32/2.01 | (15), (28), (33) gives:
% 9.32/2.01 | (34) $false
% 9.32/2.01 |
% 9.32/2.01 | CLOSE: (34) is inconsistent.
% 9.32/2.01 |
% 9.32/2.01 End of proof
% 9.32/2.01 % SZS output end Proof for theBenchmark
% 9.32/2.01
% 9.32/2.01 1493ms
%------------------------------------------------------------------------------