TSTP Solution File: SWC038+1 by Princess---230619
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Princess---230619
% Problem : SWC038+1 : TPTP v8.1.2. Released v2.4.0.
% Transfm : none
% Format : tptp
% Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s
% Computer : n018.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 20:49:19 EDT 2023
% Result : Theorem 17.21s 3.05s
% Output : Proof 23.44s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : SWC038+1 : TPTP v8.1.2. Released v2.4.0.
% 0.11/0.13 % Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s
% 0.13/0.33 % Computer : n018.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % WCLimit : 300
% 0.13/0.33 % DateTime : Mon Aug 28 15:57:17 EDT 2023
% 0.13/0.34 % 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/sandbox/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 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 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 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
% 6.15/1.50 Prover 4: Preprocessing ...
% 6.15/1.52 Prover 1: Preprocessing ...
% 6.38/1.56 Prover 5: Preprocessing ...
% 6.38/1.56 Prover 6: Preprocessing ...
% 6.38/1.56 Prover 3: Preprocessing ...
% 6.38/1.56 Prover 2: Preprocessing ...
% 6.38/1.56 Prover 0: Preprocessing ...
% 13.74/2.54 Prover 2: Proving ...
% 14.29/2.61 Prover 5: Constructing countermodel ...
% 14.29/2.66 Prover 1: Constructing countermodel ...
% 14.29/2.70 Prover 3: Constructing countermodel ...
% 14.29/2.71 Prover 6: Proving ...
% 17.21/3.05 Prover 6: proved (2428ms)
% 17.21/3.05
% 17.21/3.05 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 17.21/3.05
% 17.84/3.05 Prover 3: stopped
% 17.84/3.06 Prover 2: stopped
% 17.84/3.06 Prover 7: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470
% 17.84/3.06 Prover 5: stopped
% 17.84/3.06 Prover 10: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=919308125
% 17.84/3.06 Prover 8: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089
% 18.03/3.08 Prover 11: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1509710984
% 20.02/3.38 Prover 8: Preprocessing ...
% 20.66/3.43 Prover 10: Preprocessing ...
% 20.66/3.44 Prover 7: Preprocessing ...
% 20.66/3.46 Prover 11: Preprocessing ...
% 21.80/3.61 Prover 1: Found proof (size 24)
% 21.80/3.61 Prover 1: proved (3002ms)
% 22.14/3.64 Prover 0: Proving ...
% 22.35/3.65 Prover 0: stopped
% 22.35/3.66 Prover 4: Constructing countermodel ...
% 22.35/3.68 Prover 7: Constructing countermodel ...
% 22.35/3.69 Prover 10: Constructing countermodel ...
% 22.35/3.70 Prover 4: stopped
% 22.35/3.70 Prover 7: stopped
% 22.35/3.71 Prover 10: stopped
% 22.35/3.71 Prover 11: stopped
% 23.13/3.82 Prover 8: Warning: ignoring some quantifiers
% 23.13/3.84 Prover 8: Constructing countermodel ...
% 23.13/3.85 Prover 8: stopped
% 23.13/3.85
% 23.13/3.85 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 23.13/3.85
% 23.44/3.85 % SZS output start Proof for theBenchmark
% 23.44/3.86 Assumptions after simplification:
% 23.44/3.86 ---------------------------------
% 23.44/3.86
% 23.44/3.86 (ax41)
% 23.44/3.88 ! [v0: $i] : ( ~ (ssList(v0) = 0) | ~ $i(v0) | ! [v1: $i] : (v1 = v0 | ~
% 23.44/3.88 (frontsegP(v0, v1) = 0) | ~ $i(v1) | ? [v2: any] : ? [v3: any] :
% 23.44/3.88 (frontsegP(v1, v0) = v3 & ssList(v1) = v2 & ( ~ (v3 = 0) | ~ (v2 = 0)))))
% 23.44/3.88
% 23.44/3.88 (ax46)
% 23.44/3.88 $i(nil) & ! [v0: $i] : ! [v1: any] : ( ~ (frontsegP(nil, v0) = v1) | ~
% 23.44/3.88 $i(v0) | ? [v2: int] : ( ~ (v2 = 0) & ssList(v0) = v2) | (( ~ (v1 = 0) | v0
% 23.44/3.88 = nil) & ( ~ (v0 = nil) | v1 = 0)))
% 23.44/3.88
% 23.44/3.88 (co1)
% 23.44/3.88 $i(nil) & ? [v0: $i] : ( ~ (v0 = nil) & frontsegP(nil, v0) = 0 & ssList(v0) =
% 23.44/3.88 0 & ssList(nil) = 0 & neq(v0, nil) = 0 & $i(v0))
% 23.44/3.88
% 23.44/3.88 (function-axioms)
% 23.44/3.89 ! [v0: MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] : !
% 23.44/3.89 [v3: $i] : (v1 = v0 | ~ (gt(v3, v2) = v1) | ~ (gt(v3, v2) = v0)) & ! [v0:
% 23.44/3.89 MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] : ! [v3: $i]
% 23.44/3.89 : (v1 = v0 | ~ (geq(v3, v2) = v1) | ~ (geq(v3, v2) = v0)) & ! [v0:
% 23.44/3.89 MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] : ! [v3: $i]
% 23.44/3.89 : (v1 = v0 | ~ (lt(v3, v2) = v1) | ~ (lt(v3, v2) = v0)) & ! [v0:
% 23.44/3.89 MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] : ! [v3: $i]
% 23.44/3.89 : (v1 = v0 | ~ (leq(v3, v2) = v1) | ~ (leq(v3, v2) = v0)) & ! [v0:
% 23.44/3.89 MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] : ! [v3: $i]
% 23.44/3.89 : (v1 = v0 | ~ (segmentP(v3, v2) = v1) | ~ (segmentP(v3, v2) = v0)) & !
% 23.44/3.89 [v0: MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] : ! [v3:
% 23.44/3.89 $i] : (v1 = v0 | ~ (rearsegP(v3, v2) = v1) | ~ (rearsegP(v3, v2) = v0)) &
% 23.44/3.89 ! [v0: MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] : ! [v3:
% 23.44/3.89 $i] : (v1 = v0 | ~ (frontsegP(v3, v2) = v1) | ~ (frontsegP(v3, v2) = v0))
% 23.44/3.89 & ! [v0: MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] : !
% 23.44/3.89 [v3: $i] : (v1 = v0 | ~ (memberP(v3, v2) = v1) | ~ (memberP(v3, v2) = v0)) &
% 23.44/3.89 ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: $i] : (v1 = v0 | ~
% 23.44/3.89 (cons(v3, v2) = v1) | ~ (cons(v3, v2) = v0)) & ! [v0: $i] : ! [v1: $i] :
% 23.44/3.89 ! [v2: $i] : ! [v3: $i] : (v1 = v0 | ~ (app(v3, v2) = v1) | ~ (app(v3, v2)
% 23.44/3.89 = v0)) & ! [v0: MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2:
% 23.44/3.89 $i] : ! [v3: $i] : (v1 = v0 | ~ (neq(v3, v2) = v1) | ~ (neq(v3, v2) =
% 23.44/3.89 v0)) & ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : (v1 = v0 | ~ (tl(v2) =
% 23.44/3.89 v1) | ~ (tl(v2) = v0)) & ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : (v1 =
% 23.44/3.89 v0 | ~ (hd(v2) = v1) | ~ (hd(v2) = v0)) & ! [v0: MultipleValueBool] : !
% 23.44/3.89 [v1: MultipleValueBool] : ! [v2: $i] : (v1 = v0 | ~ (equalelemsP(v2) = v1) |
% 23.44/3.89 ~ (equalelemsP(v2) = v0)) & ! [v0: MultipleValueBool] : ! [v1:
% 23.44/3.89 MultipleValueBool] : ! [v2: $i] : (v1 = v0 | ~ (duplicatefreeP(v2) = v1) |
% 23.44/3.89 ~ (duplicatefreeP(v2) = v0)) & ! [v0: MultipleValueBool] : ! [v1:
% 23.44/3.89 MultipleValueBool] : ! [v2: $i] : (v1 = v0 | ~ (strictorderedP(v2) = v1) |
% 23.44/3.89 ~ (strictorderedP(v2) = v0)) & ! [v0: MultipleValueBool] : ! [v1:
% 23.44/3.89 MultipleValueBool] : ! [v2: $i] : (v1 = v0 | ~ (totalorderedP(v2) = v1) |
% 23.44/3.90 ~ (totalorderedP(v2) = v0)) & ! [v0: MultipleValueBool] : ! [v1:
% 23.44/3.90 MultipleValueBool] : ! [v2: $i] : (v1 = v0 | ~ (strictorderP(v2) = v1) |
% 23.44/3.90 ~ (strictorderP(v2) = v0)) & ! [v0: MultipleValueBool] : ! [v1:
% 23.44/3.90 MultipleValueBool] : ! [v2: $i] : (v1 = v0 | ~ (totalorderP(v2) = v1) | ~
% 23.44/3.90 (totalorderP(v2) = v0)) & ! [v0: MultipleValueBool] : ! [v1:
% 23.44/3.90 MultipleValueBool] : ! [v2: $i] : (v1 = v0 | ~ (cyclefreeP(v2) = v1) | ~
% 23.44/3.90 (cyclefreeP(v2) = v0)) & ! [v0: MultipleValueBool] : ! [v1:
% 23.44/3.90 MultipleValueBool] : ! [v2: $i] : (v1 = v0 | ~ (singletonP(v2) = v1) | ~
% 23.44/3.90 (singletonP(v2) = v0)) & ! [v0: MultipleValueBool] : ! [v1:
% 23.44/3.90 MultipleValueBool] : ! [v2: $i] : (v1 = v0 | ~ (ssList(v2) = v1) | ~
% 23.44/3.90 (ssList(v2) = v0)) & ! [v0: MultipleValueBool] : ! [v1: MultipleValueBool]
% 23.44/3.90 : ! [v2: $i] : (v1 = v0 | ~ (ssItem(v2) = v1) | ~ (ssItem(v2) = v0))
% 23.44/3.90
% 23.44/3.90 Further assumptions not needed in the proof:
% 23.44/3.90 --------------------------------------------
% 23.44/3.90 ax1, ax10, ax11, ax12, ax13, ax14, ax15, ax16, ax17, ax18, ax19, ax2, ax20,
% 23.44/3.90 ax21, ax22, ax23, ax24, ax25, ax26, ax27, ax28, ax29, ax3, ax30, ax31, ax32,
% 23.44/3.90 ax33, ax34, ax35, ax36, ax37, ax38, ax39, ax4, ax40, ax42, ax43, ax44, ax45,
% 23.44/3.90 ax47, ax48, ax49, ax5, ax50, ax51, ax52, ax53, ax54, ax55, ax56, ax57, ax58,
% 23.44/3.90 ax59, ax6, ax60, ax61, ax62, ax63, ax64, ax65, ax66, ax67, ax68, ax69, ax7,
% 23.44/3.90 ax70, ax71, ax72, ax73, ax74, ax75, ax76, ax77, ax78, ax79, ax8, ax80, ax81,
% 23.44/3.90 ax82, ax83, ax84, ax85, ax86, ax87, ax88, ax89, ax9, ax90, ax91, ax92, ax93,
% 23.44/3.90 ax94, ax95
% 23.44/3.90
% 23.44/3.90 Those formulas are unsatisfiable:
% 23.44/3.90 ---------------------------------
% 23.44/3.90
% 23.44/3.90 Begin of proof
% 23.44/3.90 |
% 23.44/3.90 | ALPHA: (ax46) implies:
% 23.44/3.90 | (1) ! [v0: $i] : ! [v1: any] : ( ~ (frontsegP(nil, v0) = v1) | ~ $i(v0)
% 23.44/3.90 | | ? [v2: int] : ( ~ (v2 = 0) & ssList(v0) = v2) | (( ~ (v1 = 0) | v0
% 23.44/3.90 | = nil) & ( ~ (v0 = nil) | v1 = 0)))
% 23.44/3.90 |
% 23.44/3.90 | ALPHA: (co1) implies:
% 23.44/3.90 | (2) $i(nil)
% 23.44/3.90 | (3) ? [v0: $i] : ( ~ (v0 = nil) & frontsegP(nil, v0) = 0 & ssList(v0) = 0
% 23.44/3.90 | & ssList(nil) = 0 & neq(v0, nil) = 0 & $i(v0))
% 23.44/3.90 |
% 23.44/3.90 | ALPHA: (function-axioms) implies:
% 23.44/3.90 | (4) ! [v0: MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] :
% 23.44/3.90 | (v1 = v0 | ~ (ssList(v2) = v1) | ~ (ssList(v2) = v0))
% 23.44/3.90 |
% 23.44/3.90 | DELTA: instantiating (3) with fresh symbol all_93_0 gives:
% 23.44/3.90 | (5) ~ (all_93_0 = nil) & frontsegP(nil, all_93_0) = 0 & ssList(all_93_0) =
% 23.44/3.90 | 0 & ssList(nil) = 0 & neq(all_93_0, nil) = 0 & $i(all_93_0)
% 23.44/3.90 |
% 23.44/3.90 | ALPHA: (5) implies:
% 23.44/3.90 | (6) ~ (all_93_0 = nil)
% 23.44/3.90 | (7) $i(all_93_0)
% 23.44/3.90 | (8) ssList(nil) = 0
% 23.44/3.90 | (9) ssList(all_93_0) = 0
% 23.44/3.90 | (10) frontsegP(nil, all_93_0) = 0
% 23.44/3.90 |
% 23.44/3.90 | GROUND_INST: instantiating (ax41) with nil, simplifying with (2), (8) gives:
% 23.44/3.90 | (11) ! [v0: $i] : (v0 = nil | ~ (frontsegP(nil, v0) = 0) | ~ $i(v0) | ?
% 23.44/3.90 | [v1: any] : ? [v2: any] : (frontsegP(v0, nil) = v2 & ssList(v0) =
% 23.44/3.90 | v1 & ( ~ (v2 = 0) | ~ (v1 = 0))))
% 23.44/3.90 |
% 23.44/3.91 | GROUND_INST: instantiating (1) with all_93_0, 0, simplifying with (7), (10)
% 23.44/3.91 | gives:
% 23.44/3.91 | (12) all_93_0 = nil | ? [v0: int] : ( ~ (v0 = 0) & ssList(all_93_0) = v0)
% 23.44/3.91 |
% 23.44/3.91 | GROUND_INST: instantiating (11) with all_93_0, simplifying with (7), (10)
% 23.44/3.91 | gives:
% 23.44/3.91 | (13) all_93_0 = nil | ? [v0: any] : ? [v1: any] : (frontsegP(all_93_0,
% 23.44/3.91 | nil) = v1 & ssList(all_93_0) = v0 & ( ~ (v1 = 0) | ~ (v0 = 0)))
% 23.44/3.91 |
% 23.44/3.91 | BETA: splitting (12) gives:
% 23.44/3.91 |
% 23.44/3.91 | Case 1:
% 23.44/3.91 | |
% 23.44/3.91 | | (14) all_93_0 = nil
% 23.44/3.91 | |
% 23.44/3.91 | | REDUCE: (6), (14) imply:
% 23.44/3.91 | | (15) $false
% 23.44/3.91 | |
% 23.44/3.91 | | CLOSE: (15) is inconsistent.
% 23.44/3.91 | |
% 23.44/3.91 | Case 2:
% 23.44/3.91 | |
% 23.44/3.91 | | (16) ? [v0: int] : ( ~ (v0 = 0) & ssList(all_93_0) = v0)
% 23.44/3.91 | |
% 23.44/3.91 | | DELTA: instantiating (16) with fresh symbol all_228_0 gives:
% 23.44/3.91 | | (17) ~ (all_228_0 = 0) & ssList(all_93_0) = all_228_0
% 23.44/3.91 | |
% 23.44/3.91 | | ALPHA: (17) implies:
% 23.44/3.91 | | (18) ~ (all_228_0 = 0)
% 23.44/3.91 | | (19) ssList(all_93_0) = all_228_0
% 23.44/3.91 | |
% 23.44/3.91 | | BETA: splitting (13) gives:
% 23.44/3.91 | |
% 23.44/3.91 | | Case 1:
% 23.44/3.91 | | |
% 23.44/3.91 | | | (20) all_93_0 = nil
% 23.44/3.91 | | |
% 23.44/3.91 | | | REDUCE: (6), (20) imply:
% 23.44/3.91 | | | (21) $false
% 23.44/3.91 | | |
% 23.44/3.91 | | | CLOSE: (21) is inconsistent.
% 23.44/3.91 | | |
% 23.44/3.91 | | Case 2:
% 23.44/3.91 | | |
% 23.44/3.91 | | | (22) ? [v0: any] : ? [v1: any] : (frontsegP(all_93_0, nil) = v1 &
% 23.44/3.91 | | | ssList(all_93_0) = v0 & ( ~ (v1 = 0) | ~ (v0 = 0)))
% 23.44/3.91 | | |
% 23.44/3.91 | | | DELTA: instantiating (22) with fresh symbols all_243_0, all_243_1 gives:
% 23.44/3.91 | | | (23) frontsegP(all_93_0, nil) = all_243_0 & ssList(all_93_0) =
% 23.44/3.91 | | | all_243_1 & ( ~ (all_243_0 = 0) | ~ (all_243_1 = 0))
% 23.44/3.91 | | |
% 23.44/3.91 | | | ALPHA: (23) implies:
% 23.44/3.91 | | | (24) ssList(all_93_0) = all_243_1
% 23.44/3.91 | | |
% 23.44/3.91 | | | GROUND_INST: instantiating (4) with 0, all_243_1, all_93_0, simplifying
% 23.44/3.91 | | | with (9), (24) gives:
% 23.44/3.91 | | | (25) all_243_1 = 0
% 23.44/3.91 | | |
% 23.44/3.91 | | | GROUND_INST: instantiating (4) with all_228_0, all_243_1, all_93_0,
% 23.44/3.91 | | | simplifying with (19), (24) gives:
% 23.44/3.91 | | | (26) all_243_1 = all_228_0
% 23.44/3.91 | | |
% 23.44/3.91 | | | COMBINE_EQS: (25), (26) imply:
% 23.44/3.91 | | | (27) all_228_0 = 0
% 23.44/3.91 | | |
% 23.44/3.91 | | | REDUCE: (18), (27) imply:
% 23.44/3.91 | | | (28) $false
% 23.44/3.91 | | |
% 23.44/3.91 | | | CLOSE: (28) is inconsistent.
% 23.44/3.91 | | |
% 23.44/3.91 | | End of split
% 23.44/3.91 | |
% 23.44/3.91 | End of split
% 23.44/3.91 |
% 23.44/3.91 End of proof
% 23.44/3.91 % SZS output end Proof for theBenchmark
% 23.44/3.91
% 23.44/3.91 3324ms
%------------------------------------------------------------------------------