%------------------------------------------------------------------------------ % File : Princess---230619 % Problem : SWC044+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 : n017.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:21 EDT 2023 % Result : Theorem 27.92s 4.58s % Output : Proof 39.00s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.08/0.13 % Problem : SWC044+1 : TPTP v8.1.2. Released v2.4.0. % 0.08/0.14 % Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s % 0.13/0.35 % Computer : n017.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 : Mon Aug 28 15:29:57 EDT 2023 % 0.20/0.35 % CPUTime : % 0.20/0.62 ________ _____ % 0.20/0.62 ___ __ \_________(_)________________________________ % 0.20/0.62 __ /_/ /_ ___/_ /__ __ \ ___/ _ \_ ___/_ ___/ % 0.20/0.62 _ ____/_ / _ / _ / / / /__ / __/(__ )_(__ ) % 0.20/0.62 /_/ /_/ /_/ /_/ /_/\___/ \___//____/ /____/ % 0.20/0.62 % 0.20/0.62 A Theorem Prover for First-Order Logic modulo Linear Integer Arithmetic % 0.20/0.62 (2023-06-19) % 0.20/0.62 % 0.20/0.62 (c) Philipp Rümmer, 2009-2023 % 0.20/0.62 Contributors: Peter Backeman, Peter Baumgartner, Angelo Brillout, Zafer Esen, % 0.20/0.62 Amanda Stjerna. % 0.20/0.62 Free software under BSD-3-Clause. % 0.20/0.62 % 0.20/0.62 For more information, visit http://www.philipp.ruemmer.org/princess.shtml % 0.20/0.62 % 0.20/0.62 Loading /export/starexec/sandbox/benchmark/theBenchmark.p ... % 0.20/0.63 Running up to 7 provers in parallel. % 0.20/0.64 Prover 2: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMinimalAndEmpty -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1065072994 % 0.20/0.64 Prover 1: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1571432423 % 0.20/0.64 Prover 0: Options: +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1042961893 % 0.20/0.64 Prover 3: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1922548996 % 0.20/0.64 Prover 4: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=1868514696 % 0.20/0.64 Prover 5: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=complete -randomSeed=1259561288 % 0.20/0.64 Prover 6: Options: -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximalOutermost -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1399714365 % 6.44/1.66 Prover 4: Preprocessing ... % 7.01/1.71 Prover 2: Preprocessing ... % 7.01/1.71 Prover 3: Preprocessing ... % 7.01/1.71 Prover 6: Preprocessing ... % 7.01/1.71 Prover 5: Preprocessing ... % 7.01/1.71 Prover 0: Preprocessing ... % 7.01/1.71 Prover 1: Preprocessing ... % 22.11/3.72 Prover 2: Proving ... % 22.11/3.76 Prover 5: Constructing countermodel ... % 22.11/3.86 Prover 1: Constructing countermodel ... % 22.51/3.91 Prover 3: Constructing countermodel ... % 24.15/4.05 Prover 6: Proving ... % 27.92/4.58 Prover 3: proved (3938ms) % 27.92/4.58 % 27.92/4.58 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 27.92/4.58 % 27.92/4.58 Prover 5: stopped % 27.92/4.59 Prover 2: stopped % 27.92/4.59 Prover 6: stopped % 27.92/4.61 Prover 7: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470 % 27.92/4.61 Prover 8: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089 % 27.92/4.61 Prover 10: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=919308125 % 27.92/4.61 Prover 11: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1509710984 % 31.84/5.03 Prover 8: Preprocessing ... % 31.84/5.04 Prover 4: Constructing countermodel ... % 31.84/5.06 Prover 11: Preprocessing ... % 31.84/5.07 Prover 10: Preprocessing ... % 33.15/5.22 Prover 7: Preprocessing ... % 35.39/5.48 Prover 0: Proving ... % 35.39/5.51 Prover 0: stopped % 35.39/5.51 Prover 13: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=complete -randomSeed=1138197443 % 36.63/5.66 Prover 7: Constructing countermodel ... % 36.63/5.68 Prover 10: Constructing countermodel ... % 37.15/5.76 Prover 1: Found proof (size 24) % 37.15/5.76 Prover 1: proved (5117ms) % 37.15/5.76 Prover 10: stopped % 37.15/5.76 Prover 4: stopped % 37.15/5.76 Prover 7: stopped % 37.15/5.77 Prover 11: stopped % 37.62/5.82 Prover 13: Preprocessing ... % 37.62/5.90 Prover 8: Warning: ignoring some quantifiers % 37.62/5.93 Prover 8: Constructing countermodel ... % 37.62/5.93 Prover 13: stopped % 37.62/5.95 Prover 8: stopped % 37.62/5.95 % 37.62/5.95 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 37.62/5.95 % 38.32/5.95 % SZS output start Proof for theBenchmark % 38.32/5.96 Assumptions after simplification: % 38.32/5.96 --------------------------------- % 38.32/5.96 % 38.32/5.97 (ax48) % 38.74/6.00 ! [v0: $i] : ( ~ (ssList(v0) = 0) | ~ $i(v0) | ! [v1: $i] : (v1 = v0 | ~ % 38.74/6.00 (rearsegP(v0, v1) = 0) | ~ $i(v1) | ? [v2: any] : ? [v3: any] : % 38.74/6.00 (rearsegP(v1, v0) = v3 & ssList(v1) = v2 & ( ~ (v3 = 0) | ~ (v2 = 0))))) % 38.74/6.00 % 38.74/6.01 (ax52) % 38.74/6.01 $i(nil) & ! [v0: $i] : ! [v1: any] : ( ~ (rearsegP(nil, v0) = v1) | ~ % 38.74/6.01 $i(v0) | ? [v2: int] : ( ~ (v2 = 0) & ssList(v0) = v2) | (( ~ (v1 = 0) | v0 % 38.74/6.01 = nil) & ( ~ (v0 = nil) | v1 = 0))) % 38.74/6.01 % 38.74/6.01 (co1) % 38.74/6.01 $i(nil) & ? [v0: $i] : ( ~ (v0 = nil) & rearsegP(nil, v0) = 0 & ssList(v0) = % 38.74/6.01 0 & ssList(nil) = 0 & $i(v0)) % 38.74/6.01 % 38.74/6.01 (function-axioms) % 38.93/6.03 ! [v0: MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] : ! % 38.93/6.03 [v3: $i] : (v1 = v0 | ~ (gt(v3, v2) = v1) | ~ (gt(v3, v2) = v0)) & ! [v0: % 38.93/6.03 MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] : ! [v3: $i] % 38.93/6.03 : (v1 = v0 | ~ (geq(v3, v2) = v1) | ~ (geq(v3, v2) = v0)) & ! [v0: % 38.93/6.03 MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] : ! [v3: $i] % 38.93/6.03 : (v1 = v0 | ~ (lt(v3, v2) = v1) | ~ (lt(v3, v2) = v0)) & ! [v0: % 38.93/6.03 MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] : ! [v3: $i] % 38.93/6.03 : (v1 = v0 | ~ (leq(v3, v2) = v1) | ~ (leq(v3, v2) = v0)) & ! [v0: % 38.93/6.03 MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] : ! [v3: $i] % 38.93/6.03 : (v1 = v0 | ~ (segmentP(v3, v2) = v1) | ~ (segmentP(v3, v2) = v0)) & ! % 38.93/6.03 [v0: MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] : ! [v3: % 38.93/6.03 $i] : (v1 = v0 | ~ (rearsegP(v3, v2) = v1) | ~ (rearsegP(v3, v2) = v0)) & % 38.93/6.03 ! [v0: MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] : ! [v3: % 38.93/6.03 $i] : (v1 = v0 | ~ (frontsegP(v3, v2) = v1) | ~ (frontsegP(v3, v2) = v0)) % 38.93/6.03 & ! [v0: MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] : ! % 38.93/6.03 [v3: $i] : (v1 = v0 | ~ (memberP(v3, v2) = v1) | ~ (memberP(v3, v2) = v0)) & % 38.93/6.03 ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: $i] : (v1 = v0 | ~ % 38.93/6.03 (cons(v3, v2) = v1) | ~ (cons(v3, v2) = v0)) & ! [v0: $i] : ! [v1: $i] : % 38.93/6.03 ! [v2: $i] : ! [v3: $i] : (v1 = v0 | ~ (app(v3, v2) = v1) | ~ (app(v3, v2) % 38.93/6.03 = v0)) & ! [v0: MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: % 38.93/6.03 $i] : ! [v3: $i] : (v1 = v0 | ~ (neq(v3, v2) = v1) | ~ (neq(v3, v2) = % 38.93/6.03 v0)) & ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : (v1 = v0 | ~ (tl(v2) = % 38.93/6.03 v1) | ~ (tl(v2) = v0)) & ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : (v1 = % 38.93/6.03 v0 | ~ (hd(v2) = v1) | ~ (hd(v2) = v0)) & ! [v0: MultipleValueBool] : ! % 38.93/6.03 [v1: MultipleValueBool] : ! [v2: $i] : (v1 = v0 | ~ (equalelemsP(v2) = v1) | % 38.93/6.03 ~ (equalelemsP(v2) = v0)) & ! [v0: MultipleValueBool] : ! [v1: % 38.93/6.03 MultipleValueBool] : ! [v2: $i] : (v1 = v0 | ~ (duplicatefreeP(v2) = v1) | % 38.93/6.03 ~ (duplicatefreeP(v2) = v0)) & ! [v0: MultipleValueBool] : ! [v1: % 38.93/6.03 MultipleValueBool] : ! [v2: $i] : (v1 = v0 | ~ (strictorderedP(v2) = v1) | % 38.93/6.03 ~ (strictorderedP(v2) = v0)) & ! [v0: MultipleValueBool] : ! [v1: % 38.93/6.03 MultipleValueBool] : ! [v2: $i] : (v1 = v0 | ~ (totalorderedP(v2) = v1) | % 38.93/6.03 ~ (totalorderedP(v2) = v0)) & ! [v0: MultipleValueBool] : ! [v1: % 38.93/6.03 MultipleValueBool] : ! [v2: $i] : (v1 = v0 | ~ (strictorderP(v2) = v1) | % 38.93/6.03 ~ (strictorderP(v2) = v0)) & ! [v0: MultipleValueBool] : ! [v1: % 38.93/6.03 MultipleValueBool] : ! [v2: $i] : (v1 = v0 | ~ (totalorderP(v2) = v1) | ~ % 38.93/6.03 (totalorderP(v2) = v0)) & ! [v0: MultipleValueBool] : ! [v1: % 38.93/6.03 MultipleValueBool] : ! [v2: $i] : (v1 = v0 | ~ (cyclefreeP(v2) = v1) | ~ % 38.93/6.03 (cyclefreeP(v2) = v0)) & ! [v0: MultipleValueBool] : ! [v1: % 38.93/6.03 MultipleValueBool] : ! [v2: $i] : (v1 = v0 | ~ (singletonP(v2) = v1) | ~ % 38.93/6.03 (singletonP(v2) = v0)) & ! [v0: MultipleValueBool] : ! [v1: % 38.93/6.03 MultipleValueBool] : ! [v2: $i] : (v1 = v0 | ~ (ssList(v2) = v1) | ~ % 38.93/6.03 (ssList(v2) = v0)) & ! [v0: MultipleValueBool] : ! [v1: MultipleValueBool] % 38.93/6.03 : ! [v2: $i] : (v1 = v0 | ~ (ssItem(v2) = v1) | ~ (ssItem(v2) = v0)) % 38.93/6.03 % 38.93/6.03 Further assumptions not needed in the proof: % 38.93/6.03 -------------------------------------------- % 38.93/6.03 ax1, ax10, ax11, ax12, ax13, ax14, ax15, ax16, ax17, ax18, ax19, ax2, ax20, % 38.93/6.03 ax21, ax22, ax23, ax24, ax25, ax26, ax27, ax28, ax29, ax3, ax30, ax31, ax32, % 38.93/6.03 ax33, ax34, ax35, ax36, ax37, ax38, ax39, ax4, ax40, ax41, ax42, ax43, ax44, % 38.93/6.03 ax45, ax46, ax47, ax49, ax5, ax50, ax51, ax53, ax54, ax55, ax56, ax57, ax58, % 38.93/6.03 ax59, ax6, ax60, ax61, ax62, ax63, ax64, ax65, ax66, ax67, ax68, ax69, ax7, % 38.93/6.03 ax70, ax71, ax72, ax73, ax74, ax75, ax76, ax77, ax78, ax79, ax8, ax80, ax81, % 38.93/6.03 ax82, ax83, ax84, ax85, ax86, ax87, ax88, ax89, ax9, ax90, ax91, ax92, ax93, % 38.93/6.03 ax94, ax95 % 38.93/6.03 % 38.93/6.03 Those formulas are unsatisfiable: % 38.93/6.03 --------------------------------- % 38.93/6.03 % 38.93/6.03 Begin of proof % 38.93/6.03 | % 38.93/6.04 | ALPHA: (ax52) implies: % 39.00/6.04 | (1) ! [v0: $i] : ! [v1: any] : ( ~ (rearsegP(nil, v0) = v1) | ~ $i(v0) | % 39.00/6.04 | ? [v2: int] : ( ~ (v2 = 0) & ssList(v0) = v2) | (( ~ (v1 = 0) | v0 = % 39.00/6.04 | nil) & ( ~ (v0 = nil) | v1 = 0))) % 39.00/6.04 | % 39.00/6.04 | ALPHA: (co1) implies: % 39.00/6.04 | (2) $i(nil) % 39.00/6.04 | (3) ? [v0: $i] : ( ~ (v0 = nil) & rearsegP(nil, v0) = 0 & ssList(v0) = 0 & % 39.00/6.04 | ssList(nil) = 0 & $i(v0)) % 39.00/6.04 | % 39.00/6.04 | ALPHA: (function-axioms) implies: % 39.00/6.04 | (4) ! [v0: MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] : % 39.00/6.04 | (v1 = v0 | ~ (ssList(v2) = v1) | ~ (ssList(v2) = v0)) % 39.00/6.04 | % 39.00/6.04 | DELTA: instantiating (3) with fresh symbol all_91_0 gives: % 39.00/6.04 | (5) ~ (all_91_0 = nil) & rearsegP(nil, all_91_0) = 0 & ssList(all_91_0) = % 39.00/6.04 | 0 & ssList(nil) = 0 & $i(all_91_0) % 39.00/6.04 | % 39.00/6.04 | ALPHA: (5) implies: % 39.00/6.04 | (6) ~ (all_91_0 = nil) % 39.00/6.04 | (7) $i(all_91_0) % 39.00/6.04 | (8) ssList(nil) = 0 % 39.00/6.04 | (9) ssList(all_91_0) = 0 % 39.00/6.05 | (10) rearsegP(nil, all_91_0) = 0 % 39.00/6.05 | % 39.00/6.05 | GROUND_INST: instantiating (ax48) with nil, simplifying with (2), (8) gives: % 39.00/6.05 | (11) ! [v0: $i] : (v0 = nil | ~ (rearsegP(nil, v0) = 0) | ~ $i(v0) | ? % 39.00/6.05 | [v1: any] : ? [v2: any] : (rearsegP(v0, nil) = v2 & ssList(v0) = v1 % 39.00/6.05 | & ( ~ (v2 = 0) | ~ (v1 = 0)))) % 39.00/6.05 | % 39.00/6.05 | GROUND_INST: instantiating (1) with all_91_0, 0, simplifying with (7), (10) % 39.00/6.05 | gives: % 39.00/6.05 | (12) all_91_0 = nil | ? [v0: int] : ( ~ (v0 = 0) & ssList(all_91_0) = v0) % 39.00/6.05 | % 39.00/6.05 | GROUND_INST: instantiating (11) with all_91_0, simplifying with (7), (10) % 39.00/6.05 | gives: % 39.00/6.05 | (13) all_91_0 = nil | ? [v0: any] : ? [v1: any] : (rearsegP(all_91_0, % 39.00/6.05 | nil) = v1 & ssList(all_91_0) = v0 & ( ~ (v1 = 0) | ~ (v0 = 0))) % 39.00/6.05 | % 39.00/6.05 | BETA: splitting (12) gives: % 39.00/6.05 | % 39.00/6.05 | Case 1: % 39.00/6.05 | | % 39.00/6.05 | | (14) all_91_0 = nil % 39.00/6.05 | | % 39.00/6.05 | | REDUCE: (6), (14) imply: % 39.00/6.05 | | (15) $false % 39.00/6.05 | | % 39.00/6.05 | | CLOSE: (15) is inconsistent. % 39.00/6.05 | | % 39.00/6.05 | Case 2: % 39.00/6.05 | | % 39.00/6.05 | | (16) ? [v0: int] : ( ~ (v0 = 0) & ssList(all_91_0) = v0) % 39.00/6.05 | | % 39.00/6.05 | | DELTA: instantiating (16) with fresh symbol all_239_0 gives: % 39.00/6.05 | | (17) ~ (all_239_0 = 0) & ssList(all_91_0) = all_239_0 % 39.00/6.05 | | % 39.00/6.05 | | ALPHA: (17) implies: % 39.00/6.05 | | (18) ~ (all_239_0 = 0) % 39.00/6.06 | | (19) ssList(all_91_0) = all_239_0 % 39.00/6.06 | | % 39.00/6.06 | | BETA: splitting (13) gives: % 39.00/6.06 | | % 39.00/6.06 | | Case 1: % 39.00/6.06 | | | % 39.00/6.06 | | | (20) all_91_0 = nil % 39.00/6.06 | | | % 39.00/6.06 | | | REDUCE: (6), (20) imply: % 39.00/6.06 | | | (21) $false % 39.00/6.06 | | | % 39.00/6.06 | | | CLOSE: (21) is inconsistent. % 39.00/6.06 | | | % 39.00/6.06 | | Case 2: % 39.00/6.06 | | | % 39.00/6.06 | | | (22) ? [v0: any] : ? [v1: any] : (rearsegP(all_91_0, nil) = v1 & % 39.00/6.06 | | | ssList(all_91_0) = v0 & ( ~ (v1 = 0) | ~ (v0 = 0))) % 39.00/6.06 | | | % 39.00/6.06 | | | DELTA: instantiating (22) with fresh symbols all_255_0, all_255_1 gives: % 39.00/6.06 | | | (23) rearsegP(all_91_0, nil) = all_255_0 & ssList(all_91_0) = all_255_1 % 39.00/6.06 | | | & ( ~ (all_255_0 = 0) | ~ (all_255_1 = 0)) % 39.00/6.06 | | | % 39.00/6.06 | | | ALPHA: (23) implies: % 39.00/6.06 | | | (24) ssList(all_91_0) = all_255_1 % 39.00/6.06 | | | % 39.00/6.06 | | | GROUND_INST: instantiating (4) with 0, all_255_1, all_91_0, simplifying % 39.00/6.06 | | | with (9), (24) gives: % 39.00/6.06 | | | (25) all_255_1 = 0 % 39.00/6.06 | | | % 39.00/6.06 | | | GROUND_INST: instantiating (4) with all_239_0, all_255_1, all_91_0, % 39.00/6.06 | | | simplifying with (19), (24) gives: % 39.00/6.06 | | | (26) all_255_1 = all_239_0 % 39.00/6.06 | | | % 39.00/6.06 | | | COMBINE_EQS: (25), (26) imply: % 39.00/6.06 | | | (27) all_239_0 = 0 % 39.00/6.06 | | | % 39.00/6.06 | | | REDUCE: (18), (27) imply: % 39.00/6.06 | | | (28) $false % 39.00/6.06 | | | % 39.00/6.06 | | | CLOSE: (28) is inconsistent. % 39.00/6.06 | | | % 39.00/6.06 | | End of split % 39.00/6.06 | | % 39.00/6.06 | End of split % 39.00/6.06 | % 39.00/6.06 End of proof % 39.00/6.06 % SZS output end Proof for theBenchmark % 39.00/6.06 % 39.00/6.06 5439ms %------------------------------------------------------------------------------