TSTP Solution File: KRS080+1 by Princess---230619
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Princess---230619
% Problem : KRS080+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 : n024.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:10 EDT 2023
% Result : Unsatisfiable 17.17s 3.17s
% Output : Proof 114.07s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : KRS080+1 : TPTP v8.1.2. Released v3.1.0.
% 0.06/0.13 % Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s
% 0.13/0.34 % Computer : n024.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:26:23 EDT 2023
% 0.13/0.35 % CPUTime :
% 0.68/0.67 ________ _____
% 0.68/0.67 ___ __ \_________(_)________________________________
% 0.68/0.67 __ /_/ /_ ___/_ /__ __ \ ___/ _ \_ ___/_ ___/
% 0.68/0.67 _ ____/_ / _ / _ / / / /__ / __/(__ )_(__ )
% 0.68/0.67 /_/ /_/ /_/ /_/ /_/\___/ \___//____/ /____/
% 0.68/0.67
% 0.68/0.67 A Theorem Prover for First-Order Logic modulo Linear Integer Arithmetic
% 0.68/0.67 (2023-06-19)
% 0.68/0.67
% 0.68/0.67 (c) Philipp Rümmer, 2009-2023
% 0.68/0.67 Contributors: Peter Backeman, Peter Baumgartner, Angelo Brillout, Zafer Esen,
% 0.68/0.67 Amanda Stjerna.
% 0.68/0.67 Free software under BSD-3-Clause.
% 0.68/0.67
% 0.68/0.67 For more information, visit http://www.philipp.ruemmer.org/princess.shtml
% 0.68/0.67
% 0.68/0.67 Loading /export/starexec/sandbox2/benchmark/theBenchmark.p ...
% 0.68/0.68 Running up to 7 provers in parallel.
% 0.68/0.70 Prover 1: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1571432423
% 0.68/0.70 Prover 2: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMinimalAndEmpty -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1065072994
% 0.68/0.70 Prover 3: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1922548996
% 0.68/0.70 Prover 4: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=1868514696
% 0.68/0.70 Prover 0: Options: +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1042961893
% 0.68/0.70 Prover 6: Options: -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximalOutermost -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1399714365
% 0.68/0.70 Prover 5: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=complete -randomSeed=1259561288
% 2.65/1.17 Prover 1: Preprocessing ...
% 2.65/1.17 Prover 4: Preprocessing ...
% 2.99/1.24 Prover 2: Preprocessing ...
% 2.99/1.24 Prover 6: Preprocessing ...
% 2.99/1.24 Prover 3: Preprocessing ...
% 2.99/1.24 Prover 0: Preprocessing ...
% 2.99/1.25 Prover 5: Preprocessing ...
% 6.39/1.70 Prover 2: Proving ...
% 6.39/1.70 Prover 5: Proving ...
% 7.07/1.76 Prover 1: Constructing countermodel ...
% 7.07/1.78 Prover 6: Proving ...
% 7.26/1.83 Prover 3: Constructing countermodel ...
% 17.17/3.16 Prover 5: proved (2463ms)
% 17.17/3.16
% 17.17/3.17 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 17.17/3.17
% 17.17/3.17 Prover 6: stopped
% 17.17/3.17 Prover 3: stopped
% 17.17/3.17 Prover 7: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470
% 17.17/3.17 Prover 10: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=919308125
% 17.17/3.18 Prover 2: stopped
% 17.17/3.18 Prover 11: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1509710984
% 17.17/3.18 Prover 8: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089
% 17.17/3.27 Prover 7: Preprocessing ...
% 17.17/3.28 Prover 8: Preprocessing ...
% 17.17/3.29 Prover 10: Preprocessing ...
% 17.17/3.30 Prover 11: Preprocessing ...
% 17.17/3.31 Prover 7: Warning: ignoring some quantifiers
% 18.36/3.33 Prover 7: Constructing countermodel ...
% 18.36/3.35 Prover 10: Warning: ignoring some quantifiers
% 18.36/3.36 Prover 10: Constructing countermodel ...
% 19.39/3.43 Prover 8: Warning: ignoring some quantifiers
% 19.39/3.45 Prover 8: Constructing countermodel ...
% 23.00/4.03 Prover 1: gave up
% 23.00/4.03 Prover 13: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=complete -randomSeed=1138197443
% 24.60/4.11 Prover 13: Preprocessing ...
% 24.78/4.14 Prover 13: Warning: ignoring some quantifiers
% 24.78/4.16 Prover 13: Constructing countermodel ...
% 28.33/4.69 Prover 8: gave up
% 28.33/4.71 Prover 16: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=completeFrugal -randomSeed=-2043353683
% 28.33/4.77 Prover 16: Preprocessing ...
% 30.20/4.89 Prover 16: Warning: ignoring some quantifiers
% 30.20/4.90 Prover 16: Constructing countermodel ...
% 47.74/7.16 Prover 4: Constructing countermodel ...
% 50.78/7.61 Prover 0: Proving ...
% 50.78/7.61 Prover 0: stopped
% 50.78/7.61 Prover 19: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=complete -randomSeed=-1780594085
% 50.78/7.64 Prover 19: Preprocessing ...
% 50.78/7.75 Prover 19: Warning: ignoring some quantifiers
% 50.78/7.75 Prover 19: Constructing countermodel ...
% 55.69/8.26 Prover 11: Constructing countermodel ...
% 60.43/8.74 Prover 19: gave up
% 68.55/9.84 Prover 13: stopped
% 83.92/11.96 Prover 16: stopped
% 113.29/17.98 Prover 7: Found proof (size 49)
% 113.29/17.98 Prover 7: proved (14740ms)
% 113.29/17.98 Prover 4: stopped
% 113.29/17.98 Prover 11: stopped
% 113.87/18.12 Prover 10: stopped
% 113.87/18.12
% 113.87/18.12 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 113.87/18.12
% 113.87/18.13 % SZS output start Proof for theBenchmark
% 113.87/18.13 Assumptions after simplification:
% 113.87/18.13 ---------------------------------
% 113.87/18.13
% 113.87/18.13 (axiom_2)
% 113.87/18.15 ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: $i] : ! [v4: $i] : ! [v5:
% 113.87/18.15 $i] : ! [v6: $i] : ! [v7: $i] : ( ~ $i(v7) | ~ $i(v6) | ~ $i(v5) | ~
% 113.87/18.15 $i(v4) | ~ $i(v3) | ~ $i(v2) | ~ $i(v1) | ~ $i(v0) | ~ rr(v0, v7) | ~
% 113.87/18.15 rr(v0, v6) | ~ rr(v0, v5) | ~ rr(v0, v4) | ~ rr(v0, v3) | ~ rr(v0, v2) |
% 113.87/18.15 ~ rr(v0, v1) | ~ cp4(v5) | ~ cp3(v3) | ~ cp3(v2) | ~ cp2(v4) | ~
% 113.87/18.15 cp2(v1) | ~ cp1(v7) | ~ cp1(v6) | ~ cp(v7) | ~ cp(v2) | ~ cp(v1) |
% 113.87/18.15 cUnsatisfiable(v0) | ? [v8: $i] : ? [v9: $i] : ? [v10: $i] : ? [v11: $i]
% 113.87/18.15 : ( ~ (v11 = v10) & ~ (v11 = v9) & ~ (v11 = v8) & ~ (v10 = v9) & ~ (v10
% 113.87/18.15 = v8) & ~ (v9 = v8) & $i(v11) & $i(v10) & $i(v9) & $i(v8) & rr(v0, v11)
% 113.87/18.15 & rr(v0, v10) & rr(v0, v9) & rr(v0, v8))) & ! [v0: $i] : ! [v1: $i] : !
% 113.87/18.15 [v2: $i] : ! [v3: $i] : ! [v4: $i] : (v4 = v3 | v4 = v2 | v4 = v1 | v3 = v2
% 113.87/18.15 | v3 = v1 | v2 = v1 | ~ $i(v4) | ~ $i(v3) | ~ $i(v2) | ~ $i(v1) | ~
% 113.87/18.15 $i(v0) | ~ rr(v0, v4) | ~ rr(v0, v3) | ~ rr(v0, v2) | ~ rr(v0, v1) | ~
% 113.87/18.15 cUnsatisfiable(v0)) & ! [v0: $i] : ( ~ $i(v0) | ~ cUnsatisfiable(v0) | ?
% 113.87/18.15 [v1: $i] : ($i(v1) & rr(v0, v1) & cp4(v1))) & ! [v0: $i] : ( ~ $i(v0) | ~
% 113.87/18.15 cUnsatisfiable(v0) | ? [v1: $i] : ($i(v1) & rr(v0, v1) & cp3(v1) & cp(v1)))
% 113.87/18.15 & ! [v0: $i] : ( ~ $i(v0) | ~ cUnsatisfiable(v0) | ? [v1: $i] : ($i(v1) &
% 113.87/18.15 rr(v0, v1) & cp3(v1))) & ! [v0: $i] : ( ~ $i(v0) | ~ cUnsatisfiable(v0)
% 113.87/18.15 | ? [v1: $i] : ($i(v1) & rr(v0, v1) & cp2(v1) & cp(v1))) & ! [v0: $i] : (
% 113.87/18.15 ~ $i(v0) | ~ cUnsatisfiable(v0) | ? [v1: $i] : ($i(v1) & rr(v0, v1) &
% 113.87/18.15 cp2(v1))) & ! [v0: $i] : ( ~ $i(v0) | ~ cUnsatisfiable(v0) | ? [v1: $i]
% 113.87/18.15 : ($i(v1) & rr(v0, v1) & cp1(v1) & cp(v1))) & ! [v0: $i] : ( ~ $i(v0) | ~
% 113.87/18.15 cUnsatisfiable(v0) | ? [v1: $i] : ($i(v1) & rr(v0, v1) & cp1(v1)))
% 113.87/18.15
% 113.87/18.15 (axiom_3)
% 113.87/18.15 ! [v0: $i] : ( ~ $i(v0) | ~ cp5(v0) | ~ cp1(v0)) & ! [v0: $i] : ( ~ $i(v0)
% 113.87/18.15 | ~ cp4(v0) | ~ cp1(v0)) & ! [v0: $i] : ( ~ $i(v0) | ~ cp3(v0) | ~
% 113.87/18.15 cp1(v0)) & ! [v0: $i] : ( ~ $i(v0) | ~ cp2(v0) | ~ cp1(v0))
% 113.87/18.15
% 113.87/18.15 (axiom_4)
% 113.87/18.15 ! [v0: $i] : ( ~ $i(v0) | ~ cp5(v0) | ~ cp2(v0)) & ! [v0: $i] : ( ~ $i(v0)
% 113.87/18.15 | ~ cp4(v0) | ~ cp2(v0)) & ! [v0: $i] : ( ~ $i(v0) | ~ cp3(v0) | ~
% 113.87/18.15 cp2(v0))
% 113.87/18.15
% 113.87/18.15 (axiom_5)
% 113.87/18.15 ! [v0: $i] : ( ~ $i(v0) | ~ cp5(v0) | ~ cp3(v0)) & ! [v0: $i] : ( ~ $i(v0)
% 113.87/18.15 | ~ cp4(v0) | ~ cp3(v0))
% 113.87/18.15
% 113.87/18.15 (axiom_7)
% 113.87/18.15 $i(i2003_11_14_17_19_21224) & cUnsatisfiable(i2003_11_14_17_19_21224)
% 113.87/18.15
% 113.87/18.15 Further assumptions not needed in the proof:
% 113.87/18.15 --------------------------------------------
% 113.87/18.15 axiom_0, axiom_1, axiom_6, cUnsatisfiable_substitution_1,
% 113.87/18.15 cowlNothing_substitution_1, cowlThing_substitution_1, cp1_substitution_1,
% 113.87/18.15 cp2_substitution_1, cp3_substitution_1, cp4_substitution_1, cp5_substitution_1,
% 113.87/18.15 cp_substitution_1, rr_substitution_1, rr_substitution_2,
% 113.87/18.15 xsd_integer_substitution_1, xsd_string_substitution_1
% 113.87/18.15
% 113.87/18.15 Those formulas are unsatisfiable:
% 113.87/18.15 ---------------------------------
% 113.87/18.15
% 113.87/18.15 Begin of proof
% 113.87/18.16 |
% 114.07/18.16 | ALPHA: (axiom_7) implies:
% 114.07/18.16 | (1) cUnsatisfiable(i2003_11_14_17_19_21224)
% 114.07/18.16 | (2) $i(i2003_11_14_17_19_21224)
% 114.07/18.16 |
% 114.07/18.16 | ALPHA: (axiom_5) implies:
% 114.07/18.16 | (3) ! [v0: $i] : ( ~ $i(v0) | ~ cp4(v0) | ~ cp3(v0))
% 114.07/18.16 |
% 114.07/18.16 | ALPHA: (axiom_4) implies:
% 114.07/18.16 | (4) ! [v0: $i] : ( ~ $i(v0) | ~ cp3(v0) | ~ cp2(v0))
% 114.07/18.16 | (5) ! [v0: $i] : ( ~ $i(v0) | ~ cp4(v0) | ~ cp2(v0))
% 114.07/18.16 |
% 114.07/18.16 | ALPHA: (axiom_3) implies:
% 114.07/18.16 | (6) ! [v0: $i] : ( ~ $i(v0) | ~ cp2(v0) | ~ cp1(v0))
% 114.07/18.16 | (7) ! [v0: $i] : ( ~ $i(v0) | ~ cp3(v0) | ~ cp1(v0))
% 114.07/18.16 | (8) ! [v0: $i] : ( ~ $i(v0) | ~ cp4(v0) | ~ cp1(v0))
% 114.07/18.16 |
% 114.07/18.16 | ALPHA: (axiom_2) implies:
% 114.07/18.16 | (9) ! [v0: $i] : ( ~ $i(v0) | ~ cUnsatisfiable(v0) | ? [v1: $i] :
% 114.07/18.16 | ($i(v1) & rr(v0, v1) & cp1(v1) & cp(v1)))
% 114.07/18.16 | (10) ! [v0: $i] : ( ~ $i(v0) | ~ cUnsatisfiable(v0) | ? [v1: $i] :
% 114.07/18.16 | ($i(v1) & rr(v0, v1) & cp2(v1)))
% 114.07/18.16 | (11) ! [v0: $i] : ( ~ $i(v0) | ~ cUnsatisfiable(v0) | ? [v1: $i] :
% 114.07/18.16 | ($i(v1) & rr(v0, v1) & cp3(v1) & cp(v1)))
% 114.07/18.17 | (12) ! [v0: $i] : ( ~ $i(v0) | ~ cUnsatisfiable(v0) | ? [v1: $i] :
% 114.07/18.17 | ($i(v1) & rr(v0, v1) & cp4(v1)))
% 114.07/18.17 | (13) ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: $i] : ! [v4: $i] :
% 114.07/18.17 | (v4 = v3 | v4 = v2 | v4 = v1 | v3 = v2 | v3 = v1 | v2 = v1 | ~ $i(v4)
% 114.07/18.17 | | ~ $i(v3) | ~ $i(v2) | ~ $i(v1) | ~ $i(v0) | ~ rr(v0, v4) | ~
% 114.07/18.17 | rr(v0, v3) | ~ rr(v0, v2) | ~ rr(v0, v1) | ~ cUnsatisfiable(v0))
% 114.07/18.17 |
% 114.07/18.17 | GROUND_INST: instantiating (12) with i2003_11_14_17_19_21224, simplifying with
% 114.07/18.17 | (1), (2) gives:
% 114.07/18.17 | (14) ? [v0: $i] : ($i(v0) & rr(i2003_11_14_17_19_21224, v0) & cp4(v0))
% 114.07/18.17 |
% 114.07/18.17 | GROUND_INST: instantiating (11) with i2003_11_14_17_19_21224, simplifying with
% 114.07/18.17 | (1), (2) gives:
% 114.07/18.17 | (15) ? [v0: $i] : ($i(v0) & rr(i2003_11_14_17_19_21224, v0) & cp3(v0) &
% 114.07/18.17 | cp(v0))
% 114.07/18.17 |
% 114.07/18.17 | GROUND_INST: instantiating (10) with i2003_11_14_17_19_21224, simplifying with
% 114.07/18.17 | (1), (2) gives:
% 114.07/18.17 | (16) ? [v0: $i] : ($i(v0) & rr(i2003_11_14_17_19_21224, v0) & cp2(v0))
% 114.07/18.17 |
% 114.07/18.17 | GROUND_INST: instantiating (9) with i2003_11_14_17_19_21224, simplifying with
% 114.07/18.17 | (1), (2) gives:
% 114.07/18.17 | (17) ? [v0: $i] : ($i(v0) & rr(i2003_11_14_17_19_21224, v0) & cp1(v0) &
% 114.07/18.17 | cp(v0))
% 114.07/18.17 |
% 114.07/18.17 | DELTA: instantiating (16) with fresh symbol all_19_0 gives:
% 114.07/18.17 | (18) $i(all_19_0) & rr(i2003_11_14_17_19_21224, all_19_0) & cp2(all_19_0)
% 114.07/18.17 |
% 114.07/18.17 | ALPHA: (18) implies:
% 114.07/18.17 | (19) cp2(all_19_0)
% 114.07/18.17 | (20) rr(i2003_11_14_17_19_21224, all_19_0)
% 114.07/18.17 | (21) $i(all_19_0)
% 114.07/18.17 |
% 114.07/18.17 | DELTA: instantiating (14) with fresh symbol all_23_0 gives:
% 114.07/18.17 | (22) $i(all_23_0) & rr(i2003_11_14_17_19_21224, all_23_0) & cp4(all_23_0)
% 114.07/18.17 |
% 114.07/18.17 | ALPHA: (22) implies:
% 114.07/18.17 | (23) cp4(all_23_0)
% 114.07/18.17 | (24) rr(i2003_11_14_17_19_21224, all_23_0)
% 114.07/18.17 | (25) $i(all_23_0)
% 114.07/18.17 |
% 114.07/18.17 | DELTA: instantiating (17) with fresh symbol all_25_0 gives:
% 114.07/18.17 | (26) $i(all_25_0) & rr(i2003_11_14_17_19_21224, all_25_0) & cp1(all_25_0) &
% 114.07/18.17 | cp(all_25_0)
% 114.07/18.17 |
% 114.07/18.17 | ALPHA: (26) implies:
% 114.07/18.18 | (27) cp1(all_25_0)
% 114.07/18.18 | (28) rr(i2003_11_14_17_19_21224, all_25_0)
% 114.07/18.18 | (29) $i(all_25_0)
% 114.07/18.18 |
% 114.07/18.18 | DELTA: instantiating (15) with fresh symbol all_27_0 gives:
% 114.07/18.18 | (30) $i(all_27_0) & rr(i2003_11_14_17_19_21224, all_27_0) & cp3(all_27_0) &
% 114.07/18.18 | cp(all_27_0)
% 114.07/18.18 |
% 114.07/18.18 | ALPHA: (30) implies:
% 114.07/18.18 | (31) cp3(all_27_0)
% 114.07/18.18 | (32) rr(i2003_11_14_17_19_21224, all_27_0)
% 114.07/18.18 | (33) $i(all_27_0)
% 114.07/18.18 |
% 114.07/18.18 | GROUND_INST: instantiating (6) with all_19_0, simplifying with (19), (21)
% 114.07/18.18 | gives:
% 114.07/18.18 | (34) ~ cp1(all_19_0)
% 114.07/18.18 |
% 114.07/18.18 | GROUND_INST: instantiating (4) with all_27_0, simplifying with (31), (33)
% 114.07/18.18 | gives:
% 114.07/18.18 | (35) ~ cp2(all_27_0)
% 114.07/18.18 |
% 114.07/18.18 | GROUND_INST: instantiating (7) with all_25_0, simplifying with (27), (29)
% 114.07/18.18 | gives:
% 114.07/18.18 | (36) ~ cp3(all_25_0)
% 114.07/18.18 |
% 114.07/18.18 | GROUND_INST: instantiating (3) with all_23_0, simplifying with (23), (25)
% 114.07/18.18 | gives:
% 114.07/18.18 | (37) ~ cp3(all_23_0)
% 114.07/18.18 |
% 114.07/18.18 | GROUND_INST: instantiating (5) with all_23_0, simplifying with (23), (25)
% 114.07/18.18 | gives:
% 114.07/18.18 | (38) ~ cp2(all_23_0)
% 114.07/18.18 |
% 114.07/18.18 | GROUND_INST: instantiating (8) with all_23_0, simplifying with (23), (25)
% 114.07/18.18 | gives:
% 114.07/18.18 | (39) ~ cp1(all_23_0)
% 114.07/18.18 |
% 114.07/18.18 | GROUND_INST: instantiating (13) with i2003_11_14_17_19_21224, all_19_0,
% 114.07/18.18 | all_23_0, all_25_0, all_27_0, simplifying with (1), (2), (20),
% 114.07/18.18 | (21), (24), (25), (28), (29), (32), (33) gives:
% 114.07/18.18 | (40) all_27_0 = all_25_0 | all_27_0 = all_23_0 | all_27_0 = all_19_0 |
% 114.07/18.18 | all_25_0 = all_23_0 | all_25_0 = all_19_0 | all_23_0 = all_19_0
% 114.07/18.18 |
% 114.07/18.18 | PRED_UNIFY: (27), (34) imply:
% 114.07/18.18 | (41) ~ (all_25_0 = all_19_0)
% 114.07/18.18 |
% 114.07/18.18 | PRED_UNIFY: (27), (39) imply:
% 114.07/18.18 | (42) ~ (all_25_0 = all_23_0)
% 114.07/18.18 |
% 114.07/18.18 | PRED_UNIFY: (19), (38) imply:
% 114.07/18.18 | (43) ~ (all_23_0 = all_19_0)
% 114.07/18.18 |
% 114.07/18.18 | PRED_UNIFY: (19), (35) imply:
% 114.07/18.18 | (44) ~ (all_27_0 = all_19_0)
% 114.07/18.18 |
% 114.07/18.18 | PRED_UNIFY: (31), (37) imply:
% 114.07/18.18 | (45) ~ (all_27_0 = all_23_0)
% 114.07/18.18 |
% 114.07/18.18 | PRED_UNIFY: (31), (36) imply:
% 114.07/18.18 | (46) ~ (all_27_0 = all_25_0)
% 114.07/18.18 |
% 114.07/18.18 | BETA: splitting (40) gives:
% 114.07/18.18 |
% 114.07/18.19 | Case 1:
% 114.07/18.19 | |
% 114.07/18.19 | | (47) all_27_0 = all_25_0
% 114.07/18.19 | |
% 114.07/18.19 | | REDUCE: (46), (47) imply:
% 114.07/18.19 | | (48) $false
% 114.07/18.19 | |
% 114.07/18.19 | | CLOSE: (48) is inconsistent.
% 114.07/18.19 | |
% 114.07/18.19 | Case 2:
% 114.07/18.19 | |
% 114.07/18.19 | | (49) all_27_0 = all_23_0 | all_27_0 = all_19_0 | all_25_0 = all_23_0 |
% 114.07/18.19 | | all_25_0 = all_19_0 | all_23_0 = all_19_0
% 114.07/18.19 | |
% 114.07/18.19 | | BETA: splitting (49) gives:
% 114.07/18.19 | |
% 114.07/18.19 | | Case 1:
% 114.07/18.19 | | |
% 114.07/18.19 | | | (50) all_27_0 = all_23_0
% 114.07/18.19 | | |
% 114.07/18.19 | | | REDUCE: (45), (50) imply:
% 114.07/18.19 | | | (51) $false
% 114.07/18.19 | | |
% 114.07/18.19 | | | CLOSE: (51) is inconsistent.
% 114.07/18.19 | | |
% 114.07/18.19 | | Case 2:
% 114.07/18.19 | | |
% 114.07/18.19 | | | (52) all_27_0 = all_19_0 | all_25_0 = all_23_0 | all_25_0 = all_19_0 |
% 114.07/18.19 | | | all_23_0 = all_19_0
% 114.07/18.19 | | |
% 114.07/18.19 | | | BETA: splitting (52) gives:
% 114.07/18.19 | | |
% 114.07/18.19 | | | Case 1:
% 114.07/18.19 | | | |
% 114.07/18.19 | | | | (53) all_27_0 = all_19_0
% 114.07/18.19 | | | |
% 114.07/18.19 | | | | REDUCE: (44), (53) imply:
% 114.07/18.19 | | | | (54) $false
% 114.07/18.19 | | | |
% 114.07/18.19 | | | | CLOSE: (54) is inconsistent.
% 114.07/18.19 | | | |
% 114.07/18.19 | | | Case 2:
% 114.07/18.19 | | | |
% 114.07/18.19 | | | | (55) all_25_0 = all_23_0 | all_25_0 = all_19_0 | all_23_0 = all_19_0
% 114.07/18.19 | | | |
% 114.07/18.19 | | | | BETA: splitting (55) gives:
% 114.07/18.19 | | | |
% 114.07/18.19 | | | | Case 1:
% 114.07/18.19 | | | | |
% 114.07/18.19 | | | | | (56) all_25_0 = all_23_0
% 114.07/18.19 | | | | |
% 114.07/18.19 | | | | | REDUCE: (42), (56) imply:
% 114.07/18.19 | | | | | (57) $false
% 114.07/18.19 | | | | |
% 114.07/18.19 | | | | | CLOSE: (57) is inconsistent.
% 114.07/18.19 | | | | |
% 114.07/18.19 | | | | Case 2:
% 114.07/18.19 | | | | |
% 114.07/18.19 | | | | | (58) all_25_0 = all_19_0 | all_23_0 = all_19_0
% 114.07/18.19 | | | | |
% 114.07/18.19 | | | | | BETA: splitting (58) gives:
% 114.07/18.19 | | | | |
% 114.07/18.19 | | | | | Case 1:
% 114.07/18.19 | | | | | |
% 114.07/18.19 | | | | | | (59) all_25_0 = all_19_0
% 114.07/18.19 | | | | | |
% 114.07/18.19 | | | | | | REDUCE: (41), (59) imply:
% 114.07/18.19 | | | | | | (60) $false
% 114.07/18.19 | | | | | |
% 114.07/18.19 | | | | | | CLOSE: (60) is inconsistent.
% 114.07/18.19 | | | | | |
% 114.07/18.19 | | | | | Case 2:
% 114.07/18.19 | | | | | |
% 114.07/18.19 | | | | | | (61) all_23_0 = all_19_0
% 114.07/18.19 | | | | | |
% 114.07/18.19 | | | | | | REDUCE: (43), (61) imply:
% 114.07/18.19 | | | | | | (62) $false
% 114.07/18.19 | | | | | |
% 114.07/18.19 | | | | | | CLOSE: (62) is inconsistent.
% 114.07/18.19 | | | | | |
% 114.07/18.19 | | | | | End of split
% 114.07/18.19 | | | | |
% 114.07/18.19 | | | | End of split
% 114.07/18.19 | | | |
% 114.07/18.19 | | | End of split
% 114.07/18.19 | | |
% 114.07/18.19 | | End of split
% 114.07/18.19 | |
% 114.07/18.19 | End of split
% 114.07/18.19 |
% 114.07/18.19 End of proof
% 114.07/18.19 % SZS output end Proof for theBenchmark
% 114.07/18.19
% 114.07/18.19 17520ms
%------------------------------------------------------------------------------