TSTP Solution File: NUM903_1 by Princess---230619
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Princess---230619
% Problem : NUM903_1 : TPTP v8.1.2. Released v5.0.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 11:50:38 EDT 2023
% Result : Theorem 6.29s 1.63s
% Output : Proof 7.74s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : NUM903_1 : TPTP v8.1.2. Released v5.0.0.
% 0.00/0.13 % Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s
% 0.13/0.35 % Computer : n012.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 : Fri Aug 25 10:52:56 EDT 2023
% 0.13/0.35 % CPUTime :
% 0.20/0.59 ________ _____
% 0.20/0.59 ___ __ \_________(_)________________________________
% 0.20/0.59 __ /_/ /_ ___/_ /__ __ \ ___/ _ \_ ___/_ ___/
% 0.20/0.59 _ ____/_ / _ / _ / / / /__ / __/(__ )_(__ )
% 0.20/0.59 /_/ /_/ /_/ /_/ /_/\___/ \___//____/ /____/
% 0.20/0.59
% 0.20/0.59 A Theorem Prover for First-Order Logic modulo Linear Integer Arithmetic
% 0.20/0.59 (2023-06-19)
% 0.20/0.59
% 0.20/0.59 (c) Philipp Rümmer, 2009-2023
% 0.20/0.59 Contributors: Peter Backeman, Peter Baumgartner, Angelo Brillout, Zafer Esen,
% 0.20/0.59 Amanda Stjerna.
% 0.20/0.59 Free software under BSD-3-Clause.
% 0.20/0.59
% 0.20/0.59 For more information, visit http://www.philipp.ruemmer.org/princess.shtml
% 0.20/0.59
% 0.20/0.59 Loading /export/starexec/sandbox2/benchmark/theBenchmark.p ...
% 0.20/0.60 Running up to 7 provers in parallel.
% 0.20/0.62 Prover 1: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1571432423
% 0.20/0.62 Prover 0: Options: +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1042961893
% 0.20/0.62 Prover 2: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMinimalAndEmpty -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1065072994
% 0.20/0.62 Prover 3: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1922548996
% 0.20/0.62 Prover 4: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=1868514696
% 0.20/0.62 Prover 5: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=complete -randomSeed=1259561288
% 0.20/0.62 Prover 6: Options: -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximalOutermost -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1399714365
% 1.50/0.91 Prover 5: Warning: Problem contains rationals, using incomplete axiomatisation
% 1.50/0.91 Prover 2: Warning: Problem contains rationals, using incomplete axiomatisation
% 1.50/0.91 Prover 1: Warning: Problem contains rationals, using incomplete axiomatisation
% 1.50/0.91 Prover 0: Warning: Problem contains rationals, using incomplete axiomatisation
% 1.50/0.91 Prover 4: Warning: Problem contains rationals, using incomplete axiomatisation
% 1.50/0.91 Prover 6: Warning: Problem contains rationals, using incomplete axiomatisation
% 1.50/0.91 Prover 3: Warning: Problem contains rationals, using incomplete axiomatisation
% 2.11/0.99 Prover 4: Preprocessing ...
% 2.11/0.99 Prover 1: Preprocessing ...
% 2.38/1.03 Prover 3: Preprocessing ...
% 2.38/1.03 Prover 0: Preprocessing ...
% 2.38/1.03 Prover 5: Preprocessing ...
% 2.38/1.03 Prover 6: Preprocessing ...
% 2.38/1.03 Prover 2: Preprocessing ...
% 4.46/1.42 Prover 5: Proving ...
% 4.46/1.44 Prover 6: Constructing countermodel ...
% 4.46/1.44 Prover 1: Constructing countermodel ...
% 4.46/1.45 Prover 3: Constructing countermodel ...
% 4.46/1.47 Prover 2: Proving ...
% 4.86/1.49 Prover 4: Constructing countermodel ...
% 4.86/1.52 Prover 0: Proving ...
% 6.29/1.63 Prover 6: proved (1012ms)
% 6.29/1.63
% 6.29/1.63 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 6.29/1.63
% 6.29/1.63 Prover 3: stopped
% 6.29/1.65 Prover 0: stopped
% 6.29/1.65 Prover 2: stopped
% 6.57/1.65 Prover 5: stopped
% 6.57/1.65 Prover 7: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470
% 6.57/1.65 Prover 7: Warning: Problem contains rationals, using incomplete axiomatisation
% 6.57/1.66 Prover 7: Preprocessing ...
% 6.57/1.66 Prover 8: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089
% 6.57/1.66 Prover 10: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=919308125
% 6.57/1.66 Prover 11: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1509710984
% 6.57/1.66 Prover 13: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=complete -randomSeed=1138197443
% 6.57/1.66 Prover 8: Warning: Problem contains rationals, using incomplete axiomatisation
% 6.57/1.66 Prover 11: Warning: Problem contains rationals, using incomplete axiomatisation
% 6.57/1.66 Prover 13: Warning: Problem contains rationals, using incomplete axiomatisation
% 6.57/1.66 Prover 8: Preprocessing ...
% 6.57/1.66 Prover 13: Preprocessing ...
% 6.57/1.66 Prover 11: Preprocessing ...
% 6.57/1.66 Prover 10: Warning: Problem contains rationals, using incomplete axiomatisation
% 6.57/1.67 Prover 10: Preprocessing ...
% 6.57/1.69 Prover 1: Found proof (size 8)
% 6.57/1.69 Prover 1: proved (1081ms)
% 6.57/1.69 Prover 4: stopped
% 6.57/1.69 Prover 10: stopped
% 6.57/1.70 Prover 13: stopped
% 6.57/1.70 Prover 11: stopped
% 6.57/1.73 Prover 7: Warning: ignoring some quantifiers
% 6.57/1.74 Prover 7: Constructing countermodel ...
% 7.15/1.74 Prover 7: stopped
% 7.15/1.76 Prover 8: Warning: ignoring some quantifiers
% 7.15/1.76 Prover 8: Constructing countermodel ...
% 7.15/1.77 Prover 8: stopped
% 7.15/1.77
% 7.15/1.77 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 7.15/1.77
% 7.15/1.78 % SZS output start Proof for theBenchmark
% 7.15/1.78 Assumptions after simplification:
% 7.15/1.78 ---------------------------------
% 7.15/1.78
% 7.15/1.78 (rat_uminus_problem_7)
% 7.40/1.81 ? [v0: $rat] : ? [v1: $rat] : ? [v2: $rat] : ( ~ (v2 = v0) &
% 7.40/1.81 rat_$uminus(v1) = v2 & rat_$uminus(v0) = v1)
% 7.40/1.81
% 7.40/1.81 (input)
% 7.40/1.84 ~ (rat_very_large = rat_very_small) & ~ (rat_very_large = rat_0) & ~
% 7.40/1.84 (rat_very_small = rat_0) & rat_$is_int(rat_0) = 0 & rat_$is_rat(rat_0) = 0 &
% 7.40/1.84 rat_$floor(rat_0) = rat_0 & rat_$ceiling(rat_0) = rat_0 & rat_$truncate(rat_0)
% 7.40/1.84 = rat_0 & rat_$round(rat_0) = rat_0 & rat_$to_int(rat_0) = 0 &
% 7.40/1.84 rat_$to_rat(rat_0) = rat_0 & rat_$to_real(rat_0) = real_0 & int_$to_rat(0) =
% 7.40/1.84 rat_0 & rat_$product(rat_0, rat_0) = rat_0 & rat_$difference(rat_0, rat_0) =
% 7.40/1.84 rat_0 & rat_$sum(rat_0, rat_0) = rat_0 & rat_$greatereq(rat_very_small,
% 7.40/1.84 rat_very_large) = 1 & rat_$greatereq(rat_0, rat_0) = 0 &
% 7.40/1.84 rat_$lesseq(rat_very_small, rat_very_large) = 0 & rat_$lesseq(rat_0, rat_0) =
% 7.40/1.84 0 & rat_$greater(rat_very_large, rat_0) = 0 & rat_$greater(rat_very_small,
% 7.40/1.84 rat_very_large) = 1 & rat_$greater(rat_0, rat_very_small) = 0 &
% 7.40/1.84 rat_$greater(rat_0, rat_0) = 1 & rat_$less(rat_very_small, rat_very_large) = 0
% 7.40/1.84 & rat_$less(rat_very_small, rat_0) = 0 & rat_$less(rat_0, rat_very_large) = 0
% 7.40/1.84 & rat_$less(rat_0, rat_0) = 1 & rat_$uminus(rat_0) = rat_0 & ! [v0: $rat] :
% 7.40/1.84 ! [v1: $rat] : ! [v2: $rat] : ! [v3: $rat] : ! [v4: $rat] : ( ~
% 7.40/1.84 (rat_$sum(v3, v0) = v4) | ~ (rat_$sum(v2, v1) = v3) | ? [v5: $rat] :
% 7.40/1.84 (rat_$sum(v2, v5) = v4 & rat_$sum(v1, v0) = v5)) & ! [v0: $rat] : ! [v1:
% 7.40/1.84 $rat] : ! [v2: $rat] : ! [v3: $rat] : (v3 = v1 | v0 = rat_0 | ~
% 7.40/1.84 (rat_$quotient(v2, v0) = v3) | ~ (rat_$product(v1, v0) = v2)) & ! [v0:
% 7.40/1.84 $rat] : ! [v1: $rat] : ! [v2: $rat] : ! [v3: int] : (v3 = 0 | ~
% 7.40/1.84 (rat_$lesseq(v2, v0) = v3) | ~ (rat_$lesseq(v1, v0) = 0) | ? [v4: int] : (
% 7.40/1.84 ~ (v4 = 0) & rat_$lesseq(v2, v1) = v4)) & ! [v0: $rat] : ! [v1: $rat] :
% 7.40/1.84 ! [v2: $rat] : ! [v3: int] : (v3 = 0 | ~ (rat_$lesseq(v1, v0) = 0) | ~
% 7.40/1.84 (rat_$less(v2, v0) = v3) | ? [v4: int] : ( ~ (v4 = 0) & rat_$less(v2, v1) =
% 7.40/1.84 v4)) & ! [v0: $rat] : ! [v1: $rat] : ! [v2: $rat] : ! [v3: $rat] : ( ~
% 7.40/1.84 (rat_$sum(v1, v2) = v3) | ~ (rat_$uminus(v0) = v2) | rat_$difference(v1,
% 7.40/1.84 v0) = v3) & ! [v0: $rat] : ! [v1: $rat] : ! [v2: $rat] : (v2 = rat_0 |
% 7.40/1.84 ~ (rat_$sum(v0, v1) = v2) | ~ (rat_$uminus(v0) = v1)) & ! [v0: $rat] : !
% 7.40/1.84 [v1: $rat] : ! [v2: int] : (v2 = 0 | ~ (rat_$greatereq(v0, v1) = v2) | ?
% 7.40/1.84 [v3: int] : ( ~ (v3 = 0) & rat_$lesseq(v1, v0) = v3)) & ! [v0: $rat] : !
% 7.40/1.84 [v1: $rat] : ! [v2: int] : (v2 = 0 | ~ (rat_$lesseq(v1, v0) = v2) | ( ~ (v1
% 7.40/1.84 = v0) & ? [v3: int] : ( ~ (v3 = 0) & rat_$less(v1, v0) = v3))) & !
% 7.40/1.84 [v0: $rat] : ! [v1: $rat] : ! [v2: int] : (v2 = 0 | ~ (rat_$greater(v0, v1)
% 7.40/1.84 = v2) | ? [v3: int] : ( ~ (v3 = 0) & rat_$less(v1, v0) = v3)) & ! [v0:
% 7.40/1.84 $rat] : ! [v1: $rat] : ! [v2: $rat] : ( ~ (rat_$product(v0, v1) = v2) |
% 7.40/1.84 rat_$product(v1, v0) = v2) & ! [v0: $rat] : ! [v1: $rat] : ! [v2: $rat] :
% 7.40/1.84 ( ~ (rat_$sum(v0, v1) = v2) | rat_$sum(v1, v0) = v2) & ! [v0: $rat] : ! [v1:
% 7.40/1.84 $rat] : ! [v2: $rat] : ( ~ (rat_$lesseq(v2, v1) = 0) | ~ (rat_$less(v1,
% 7.40/1.84 v0) = 0) | rat_$less(v2, v0) = 0) & ! [v0: $rat] : ! [v1: $rat] : (v1
% 7.40/1.84 = v0 | ~ (rat_$sum(v0, rat_0) = v1)) & ! [v0: $rat] : ! [v1: $rat] : (v1
% 7.40/1.84 = v0 | ~ (rat_$lesseq(v1, v0) = 0) | rat_$less(v1, v0) = 0) & ! [v0: $rat]
% 7.40/1.84 : ! [v1: $rat] : ( ~ (rat_$greatereq(v0, v1) = 0) | rat_$lesseq(v1, v0) = 0)
% 7.40/1.84 & ! [v0: $rat] : ! [v1: $rat] : ( ~ (rat_$greater(v0, v1) = 0) |
% 7.40/1.84 rat_$less(v1, v0) = 0) & ! [v0: $rat] : ! [v1: $rat] : ( ~
% 7.40/1.84 (rat_$uminus(v0) = v1) | rat_$uminus(v1) = v0) & ! [v0: $rat] : (v0 = rat_0
% 7.40/1.84 | ~ (rat_$uminus(v0) = v0))
% 7.40/1.84
% 7.40/1.84 (function-axioms)
% 7.70/1.85 ! [v0: $rat] : ! [v1: $rat] : ! [v2: $rat] : ! [v3: $rat] : (v1 = v0 | ~
% 7.70/1.85 (rat_$quotient(v3, v2) = v1) | ~ (rat_$quotient(v3, v2) = v0)) & ! [v0:
% 7.70/1.85 $rat] : ! [v1: $rat] : ! [v2: $rat] : ! [v3: $rat] : (v1 = v0 | ~
% 7.70/1.85 (rat_$product(v3, v2) = v1) | ~ (rat_$product(v3, v2) = v0)) & ! [v0:
% 7.70/1.85 $rat] : ! [v1: $rat] : ! [v2: $rat] : ! [v3: $rat] : (v1 = v0 | ~
% 7.70/1.85 (rat_$difference(v3, v2) = v1) | ~ (rat_$difference(v3, v2) = v0)) & !
% 7.70/1.85 [v0: $rat] : ! [v1: $rat] : ! [v2: $rat] : ! [v3: $rat] : (v1 = v0 | ~
% 7.70/1.85 (rat_$sum(v3, v2) = v1) | ~ (rat_$sum(v3, v2) = v0)) & ! [v0:
% 7.70/1.85 MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $rat] : ! [v3:
% 7.70/1.85 $rat] : (v1 = v0 | ~ (rat_$greatereq(v3, v2) = v1) | ~ (rat_$greatereq(v3,
% 7.70/1.85 v2) = v0)) & ! [v0: MultipleValueBool] : ! [v1: MultipleValueBool] :
% 7.70/1.85 ! [v2: $rat] : ! [v3: $rat] : (v1 = v0 | ~ (rat_$lesseq(v3, v2) = v1) | ~
% 7.70/1.85 (rat_$lesseq(v3, v2) = v0)) & ! [v0: MultipleValueBool] : ! [v1:
% 7.70/1.85 MultipleValueBool] : ! [v2: $rat] : ! [v3: $rat] : (v1 = v0 | ~
% 7.70/1.85 (rat_$greater(v3, v2) = v1) | ~ (rat_$greater(v3, v2) = v0)) & ! [v0:
% 7.70/1.85 MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $rat] : ! [v3:
% 7.70/1.85 $rat] : (v1 = v0 | ~ (rat_$less(v3, v2) = v1) | ~ (rat_$less(v3, v2) =
% 7.70/1.85 v0)) & ! [v0: MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2:
% 7.70/1.85 $rat] : (v1 = v0 | ~ (rat_$is_int(v2) = v1) | ~ (rat_$is_int(v2) = v0)) &
% 7.70/1.85 ! [v0: MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $rat] : (v1 =
% 7.70/1.85 v0 | ~ (rat_$is_rat(v2) = v1) | ~ (rat_$is_rat(v2) = v0)) & ! [v0: $rat]
% 7.70/1.85 : ! [v1: $rat] : ! [v2: $rat] : (v1 = v0 | ~ (rat_$floor(v2) = v1) | ~
% 7.70/1.85 (rat_$floor(v2) = v0)) & ! [v0: $rat] : ! [v1: $rat] : ! [v2: $rat] : (v1
% 7.70/1.85 = v0 | ~ (rat_$ceiling(v2) = v1) | ~ (rat_$ceiling(v2) = v0)) & ! [v0:
% 7.70/1.85 $rat] : ! [v1: $rat] : ! [v2: $rat] : (v1 = v0 | ~ (rat_$truncate(v2) =
% 7.70/1.85 v1) | ~ (rat_$truncate(v2) = v0)) & ! [v0: $rat] : ! [v1: $rat] : !
% 7.70/1.85 [v2: $rat] : (v1 = v0 | ~ (rat_$round(v2) = v1) | ~ (rat_$round(v2) = v0)) &
% 7.70/1.85 ! [v0: int] : ! [v1: int] : ! [v2: $rat] : (v1 = v0 | ~ (rat_$to_int(v2) =
% 7.70/1.85 v1) | ~ (rat_$to_int(v2) = v0)) & ! [v0: $rat] : ! [v1: $rat] : ! [v2:
% 7.70/1.85 $rat] : (v1 = v0 | ~ (rat_$to_rat(v2) = v1) | ~ (rat_$to_rat(v2) = v0)) &
% 7.70/1.85 ! [v0: $real] : ! [v1: $real] : ! [v2: $rat] : (v1 = v0 | ~
% 7.70/1.85 (rat_$to_real(v2) = v1) | ~ (rat_$to_real(v2) = v0)) & ! [v0: $rat] : !
% 7.70/1.85 [v1: $rat] : ! [v2: int] : (v1 = v0 | ~ (int_$to_rat(v2) = v1) | ~
% 7.70/1.85 (int_$to_rat(v2) = v0)) & ! [v0: $rat] : ! [v1: $rat] : ! [v2: $rat] :
% 7.70/1.85 (v1 = v0 | ~ (rat_$uminus(v2) = v1) | ~ (rat_$uminus(v2) = v0))
% 7.70/1.85
% 7.70/1.85 Those formulas are unsatisfiable:
% 7.70/1.85 ---------------------------------
% 7.70/1.85
% 7.70/1.85 Begin of proof
% 7.70/1.86 |
% 7.74/1.86 | ALPHA: (function-axioms) implies:
% 7.74/1.86 | (1) ! [v0: $rat] : ! [v1: $rat] : ! [v2: $rat] : (v1 = v0 | ~
% 7.74/1.86 | (rat_$uminus(v2) = v1) | ~ (rat_$uminus(v2) = v0))
% 7.74/1.86 |
% 7.74/1.86 | ALPHA: (input) implies:
% 7.74/1.86 | (2) ! [v0: $rat] : ! [v1: $rat] : ( ~ (rat_$uminus(v0) = v1) |
% 7.74/1.86 | rat_$uminus(v1) = v0)
% 7.74/1.86 |
% 7.74/1.86 | DELTA: instantiating (rat_uminus_problem_7) with fresh symbols all_5_0,
% 7.74/1.86 | all_5_1, all_5_2 gives:
% 7.74/1.86 | (3) ~ (all_5_0 = all_5_2) & rat_$uminus(all_5_1) = all_5_0 &
% 7.74/1.86 | rat_$uminus(all_5_2) = all_5_1
% 7.74/1.86 |
% 7.74/1.86 | ALPHA: (3) implies:
% 7.74/1.86 | (4) ~ (all_5_0 = all_5_2)
% 7.74/1.86 | (5) rat_$uminus(all_5_2) = all_5_1
% 7.74/1.86 | (6) rat_$uminus(all_5_1) = all_5_0
% 7.74/1.86 |
% 7.74/1.86 | GROUND_INST: instantiating (2) with all_5_2, all_5_1, simplifying with (5)
% 7.74/1.86 | gives:
% 7.74/1.86 | (7) rat_$uminus(all_5_1) = all_5_2
% 7.74/1.86 |
% 7.74/1.86 | GROUND_INST: instantiating (1) with all_5_0, all_5_2, all_5_1, simplifying
% 7.74/1.86 | with (6), (7) gives:
% 7.74/1.86 | (8) all_5_0 = all_5_2
% 7.74/1.86 |
% 7.74/1.86 | REDUCE: (4), (8) imply:
% 7.74/1.86 | (9) $false
% 7.74/1.86 |
% 7.74/1.86 | CLOSE: (9) is inconsistent.
% 7.74/1.86 |
% 7.74/1.86 End of proof
% 7.74/1.87 % SZS output end Proof for theBenchmark
% 7.74/1.87
% 7.74/1.87 1278ms
%------------------------------------------------------------------------------