TSTP Solution File: SWC372+1 by Princess---230619
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Princess---230619
% Problem : SWC372+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 : n027.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:51:06 EDT 2023
% Result : Theorem 59.76s 8.79s
% Output : Proof 74.24s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SWC372+1 : TPTP v8.1.2. Released v2.4.0.
% 0.00/0.13 % Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s
% 0.12/0.34 % Computer : n027.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 300
% 0.12/0.34 % DateTime : Mon Aug 28 15:08:52 EDT 2023
% 0.12/0.34 % 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.65 Prover 1: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1571432423
% 0.20/0.65 Prover 0: Options: +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1042961893
% 0.20/0.65 Prover 2: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMinimalAndEmpty -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1065072994
% 0.20/0.65 Prover 4: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=1868514696
% 0.20/0.65 Prover 5: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=complete -randomSeed=1259561288
% 0.20/0.65 Prover 3: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1922548996
% 0.20/0.65 Prover 6: Options: -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximalOutermost -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1399714365
% 5.81/1.68 Prover 4: Preprocessing ...
% 6.20/1.70 Prover 1: Preprocessing ...
% 6.20/1.75 Prover 0: Preprocessing ...
% 6.20/1.75 Prover 6: Preprocessing ...
% 6.20/1.75 Prover 5: Preprocessing ...
% 6.20/1.75 Prover 2: Preprocessing ...
% 6.20/1.75 Prover 3: Preprocessing ...
% 19.11/3.53 Prover 2: Proving ...
% 19.11/3.61 Prover 5: Constructing countermodel ...
% 19.11/3.63 Prover 1: Constructing countermodel ...
% 20.12/3.68 Prover 3: Constructing countermodel ...
% 21.57/3.77 Prover 6: Proving ...
% 29.40/4.83 Prover 4: Constructing countermodel ...
% 30.77/4.99 Prover 0: Proving ...
% 59.76/8.79 Prover 5: proved (8141ms)
% 59.76/8.79
% 59.76/8.79 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 59.76/8.79
% 59.76/8.79 Prover 0: stopped
% 59.76/8.79 Prover 2: stopped
% 59.76/8.80 Prover 3: stopped
% 60.34/8.81 Prover 6: stopped
% 60.34/8.82 Prover 7: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470
% 60.34/8.82 Prover 8: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089
% 60.34/8.82 Prover 10: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=919308125
% 60.34/8.82 Prover 11: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1509710984
% 60.34/8.82 Prover 13: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=complete -randomSeed=1138197443
% 62.14/9.06 Prover 10: Preprocessing ...
% 62.14/9.07 Prover 8: Preprocessing ...
% 62.14/9.08 Prover 7: Preprocessing ...
% 62.14/9.08 Prover 11: Preprocessing ...
% 62.14/9.09 Prover 13: Preprocessing ...
% 63.24/9.28 Prover 7: Constructing countermodel ...
% 63.24/9.28 Prover 10: Constructing countermodel ...
% 64.19/9.35 Prover 13: Constructing countermodel ...
% 64.71/9.38 Prover 8: Warning: ignoring some quantifiers
% 64.71/9.39 Prover 8: Constructing countermodel ...
% 70.18/10.14 Prover 11: Constructing countermodel ...
% 73.25/10.57 Prover 10: Found proof (size 24)
% 73.25/10.57 Prover 10: proved (1772ms)
% 73.25/10.58 Prover 8: stopped
% 73.25/10.58 Prover 1: stopped
% 73.25/10.58 Prover 7: stopped
% 73.25/10.58 Prover 11: stopped
% 73.25/10.58 Prover 13: stopped
% 73.25/10.58 Prover 4: stopped
% 73.25/10.58
% 73.25/10.58 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 73.25/10.58
% 73.25/10.58 % SZS output start Proof for theBenchmark
% 73.25/10.59 Assumptions after simplification:
% 73.25/10.59 ---------------------------------
% 73.25/10.59
% 73.25/10.59 (ax17)
% 73.25/10.59 $i(nil) & ssList(nil)
% 73.25/10.59
% 73.25/10.59 (ax49)
% 73.25/10.59 ! [v0: $i] : ( ~ $i(v0) | ~ ssList(v0) | rearsegP(v0, v0))
% 73.25/10.59
% 73.25/10.59 (ax5)
% 73.25/10.61 ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ( ~ (app(v1, v2) = v0) | ~ $i(v2) |
% 73.25/10.61 ~ $i(v1) | ~ $i(v0) | ~ ssList(v2) | ~ ssList(v1) | ~ ssList(v0) |
% 73.25/10.62 frontsegP(v0, v1)) & ! [v0: $i] : ! [v1: $i] : ( ~ $i(v1) | ~ $i(v0) | ~
% 73.25/10.62 frontsegP(v0, v1) | ~ ssList(v1) | ~ ssList(v0) | ? [v2: $i] : (app(v1,
% 73.25/10.62 v2) = v0 & $i(v2) & ssList(v2)))
% 73.25/10.62
% 73.25/10.62 (ax58)
% 73.25/10.62 $i(nil) & ! [v0: $i] : (v0 = nil | ~ $i(v0) | ~ segmentP(nil, v0) | ~
% 73.25/10.62 ssList(v0)) & ( ~ ssList(nil) | segmentP(nil, nil))
% 73.25/10.62
% 73.25/10.62 (ax6)
% 73.77/10.62 ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ( ~ (app(v2, v1) = v0) | ~ $i(v2) |
% 73.77/10.62 ~ $i(v1) | ~ $i(v0) | ~ ssList(v2) | ~ ssList(v1) | ~ ssList(v0) |
% 73.77/10.62 rearsegP(v0, v1)) & ! [v0: $i] : ! [v1: $i] : ( ~ $i(v1) | ~ $i(v0) | ~
% 73.77/10.62 rearsegP(v0, v1) | ~ ssList(v1) | ~ ssList(v0) | ? [v2: $i] : (app(v2,
% 73.77/10.62 v1) = v0 & $i(v2) & ssList(v2)))
% 73.77/10.62
% 73.77/10.62 (ax7)
% 73.77/10.62 ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: $i] : ! [v4: $i] : ( ~
% 73.77/10.62 (app(v3, v4) = v0) | ~ (app(v2, v1) = v3) | ~ $i(v4) | ~ $i(v2) | ~
% 73.77/10.62 $i(v1) | ~ $i(v0) | ~ ssList(v4) | ~ ssList(v2) | ~ ssList(v1) | ~
% 73.77/10.62 ssList(v0) | segmentP(v0, v1)) & ! [v0: $i] : ! [v1: $i] : ( ~ $i(v1) | ~
% 73.77/10.62 $i(v0) | ~ segmentP(v0, v1) | ~ ssList(v1) | ~ ssList(v0) | ? [v2: $i] :
% 73.77/10.62 ? [v3: $i] : ? [v4: $i] : (app(v3, v4) = v0 & app(v2, v1) = v3 & $i(v4) &
% 73.77/10.62 $i(v3) & $i(v2) & ssList(v4) & ssList(v2)))
% 73.77/10.62
% 73.77/10.62 (co1)
% 73.77/10.62 $i(nil) & ? [v0: $i] : ? [v1: $i] : ? [v2: $i] : (app(v0, v2) = v1 & $i(v2)
% 73.77/10.63 & $i(v1) & $i(v0) & strictorderedP(v0) & ssList(v2) & ssList(v1) &
% 73.77/10.63 ssList(v0) & ~ segmentP(v1, v0) & ! [v3: $i] : ! [v4: $i] : ! [v5: $i] :
% 73.77/10.63 ! [v6: $i] : ! [v7: $i] : ! [v8: $i] : ( ~ (cons(v6, nil) = v7) | ~
% 73.77/10.63 (cons(v3, nil) = v4) | ~ (app(v8, v7) = v0) | ~ (app(v4, v5) = v2) | ~
% 73.77/10.63 $i(v8) | ~ $i(v6) | ~ $i(v5) | ~ $i(v3) | ~ lt(v6, v3) | ~ ssList(v8)
% 73.77/10.63 | ~ ssList(v5) | ~ ssItem(v6) | ~ ssItem(v3)) & ( ~ (v0 = nil) | v1 =
% 73.77/10.63 nil))
% 73.77/10.63
% 73.77/10.63 Further assumptions not needed in the proof:
% 73.77/10.63 --------------------------------------------
% 73.77/10.63 ax1, ax10, ax11, ax12, ax13, ax14, ax15, ax16, ax18, ax19, ax2, ax20, ax21,
% 73.77/10.63 ax22, ax23, ax24, ax25, ax26, ax27, ax28, ax29, ax3, ax30, ax31, ax32, ax33,
% 73.77/10.63 ax34, ax35, ax36, ax37, ax38, ax39, ax4, ax40, ax41, ax42, ax43, ax44, ax45,
% 73.77/10.63 ax46, ax47, ax48, ax50, ax51, ax52, ax53, ax54, ax55, ax56, ax57, ax59, ax60,
% 73.77/10.63 ax61, ax62, ax63, ax64, ax65, ax66, ax67, ax68, ax69, ax70, ax71, ax72, ax73,
% 73.77/10.63 ax74, ax75, ax76, ax77, ax78, ax79, ax8, ax80, ax81, ax82, ax83, ax84, ax85,
% 73.77/10.63 ax86, ax87, ax88, ax89, ax9, ax90, ax91, ax92, ax93, ax94, ax95
% 73.77/10.63
% 73.77/10.63 Those formulas are unsatisfiable:
% 73.77/10.63 ---------------------------------
% 73.77/10.63
% 73.77/10.63 Begin of proof
% 73.77/10.63 |
% 73.77/10.63 | ALPHA: (ax5) implies:
% 73.77/10.63 | (1) ! [v0: $i] : ! [v1: $i] : ( ~ $i(v1) | ~ $i(v0) | ~ frontsegP(v0,
% 73.77/10.63 | v1) | ~ ssList(v1) | ~ ssList(v0) | ? [v2: $i] : (app(v1, v2) =
% 73.77/10.63 | v0 & $i(v2) & ssList(v2)))
% 73.77/10.63 | (2) ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ( ~ (app(v1, v2) = v0) | ~
% 73.77/10.63 | $i(v2) | ~ $i(v1) | ~ $i(v0) | ~ ssList(v2) | ~ ssList(v1) | ~
% 73.77/10.63 | ssList(v0) | frontsegP(v0, v1))
% 73.77/10.63 |
% 73.77/10.63 | ALPHA: (ax6) implies:
% 73.77/10.63 | (3) ! [v0: $i] : ! [v1: $i] : ( ~ $i(v1) | ~ $i(v0) | ~ rearsegP(v0,
% 73.77/10.63 | v1) | ~ ssList(v1) | ~ ssList(v0) | ? [v2: $i] : (app(v2, v1) =
% 73.77/10.63 | v0 & $i(v2) & ssList(v2)))
% 73.77/10.63 |
% 73.77/10.63 | ALPHA: (ax7) implies:
% 73.77/10.63 | (4) ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: $i] : ! [v4: $i] : (
% 73.77/10.63 | ~ (app(v3, v4) = v0) | ~ (app(v2, v1) = v3) | ~ $i(v4) | ~ $i(v2)
% 73.77/10.63 | | ~ $i(v1) | ~ $i(v0) | ~ ssList(v4) | ~ ssList(v2) | ~
% 73.77/10.63 | ssList(v1) | ~ ssList(v0) | segmentP(v0, v1))
% 73.77/10.63 |
% 73.77/10.63 | ALPHA: (ax17) implies:
% 73.77/10.63 | (5) ssList(nil)
% 73.77/10.63 |
% 73.77/10.63 | ALPHA: (ax58) implies:
% 73.77/10.63 | (6) ~ ssList(nil) | segmentP(nil, nil)
% 73.77/10.63 |
% 73.77/10.63 | ALPHA: (co1) implies:
% 73.77/10.63 | (7) ? [v0: $i] : ? [v1: $i] : ? [v2: $i] : (app(v0, v2) = v1 & $i(v2) &
% 73.77/10.63 | $i(v1) & $i(v0) & strictorderedP(v0) & ssList(v2) & ssList(v1) &
% 73.77/10.63 | ssList(v0) & ~ segmentP(v1, v0) & ! [v3: $i] : ! [v4: $i] : !
% 73.77/10.63 | [v5: $i] : ! [v6: $i] : ! [v7: $i] : ! [v8: $i] : ( ~ (cons(v6,
% 73.77/10.63 | nil) = v7) | ~ (cons(v3, nil) = v4) | ~ (app(v8, v7) = v0) |
% 73.77/10.63 | ~ (app(v4, v5) = v2) | ~ $i(v8) | ~ $i(v6) | ~ $i(v5) | ~
% 73.77/10.63 | $i(v3) | ~ lt(v6, v3) | ~ ssList(v8) | ~ ssList(v5) | ~
% 73.77/10.63 | ssItem(v6) | ~ ssItem(v3)) & ( ~ (v0 = nil) | v1 = nil))
% 73.77/10.63 |
% 73.77/10.63 | DELTA: instantiating (7) with fresh symbols all_91_0, all_91_1, all_91_2
% 73.77/10.63 | gives:
% 73.77/10.64 | (8) app(all_91_2, all_91_0) = all_91_1 & $i(all_91_0) & $i(all_91_1) &
% 73.77/10.64 | $i(all_91_2) & strictorderedP(all_91_2) & ssList(all_91_0) &
% 73.77/10.64 | ssList(all_91_1) & ssList(all_91_2) & ~ segmentP(all_91_1, all_91_2) &
% 73.77/10.64 | ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: $i] : ! [v4: $i] :
% 73.77/10.64 | ! [v5: $i] : ( ~ (cons(v3, nil) = v4) | ~ (cons(v0, nil) = v1) | ~
% 73.77/10.64 | (app(v5, v4) = all_91_2) | ~ (app(v1, v2) = all_91_0) | ~ $i(v5) |
% 73.77/10.64 | ~ $i(v3) | ~ $i(v2) | ~ $i(v0) | ~ lt(v3, v0) | ~ ssList(v5) | ~
% 73.77/10.64 | ssList(v2) | ~ ssItem(v3) | ~ ssItem(v0)) & ( ~ (all_91_2 = nil) |
% 73.77/10.64 | all_91_1 = nil)
% 73.77/10.64 |
% 73.77/10.64 | ALPHA: (8) implies:
% 73.77/10.64 | (9) ~ segmentP(all_91_1, all_91_2)
% 73.77/10.64 | (10) ssList(all_91_2)
% 73.77/10.64 | (11) ssList(all_91_1)
% 73.77/10.64 | (12) ssList(all_91_0)
% 74.24/10.64 | (13) $i(all_91_2)
% 74.24/10.64 | (14) $i(all_91_1)
% 74.24/10.64 | (15) $i(all_91_0)
% 74.24/10.64 | (16) app(all_91_2, all_91_0) = all_91_1
% 74.24/10.64 |
% 74.24/10.64 | BETA: splitting (6) gives:
% 74.24/10.64 |
% 74.24/10.64 | Case 1:
% 74.24/10.64 | |
% 74.24/10.64 | | (17) ~ ssList(nil)
% 74.24/10.64 | |
% 74.24/10.64 | | PRED_UNIFY: (5), (17) imply:
% 74.24/10.64 | | (18) $false
% 74.24/10.64 | |
% 74.24/10.64 | | CLOSE: (18) is inconsistent.
% 74.24/10.64 | |
% 74.24/10.64 | Case 2:
% 74.24/10.64 | |
% 74.24/10.64 | |
% 74.24/10.64 | | GROUND_INST: instantiating (ax49) with all_91_2, simplifying with (10), (13)
% 74.24/10.64 | | gives:
% 74.24/10.64 | | (19) rearsegP(all_91_2, all_91_2)
% 74.24/10.64 | |
% 74.24/10.64 | | GROUND_INST: instantiating (2) with all_91_1, all_91_2, all_91_0,
% 74.24/10.64 | | simplifying with (10), (11), (12), (13), (14), (15), (16)
% 74.24/10.64 | | gives:
% 74.24/10.64 | | (20) frontsegP(all_91_1, all_91_2)
% 74.24/10.64 | |
% 74.24/10.64 | | GROUND_INST: instantiating (1) with all_91_1, all_91_2, simplifying with
% 74.24/10.64 | | (10), (11), (13), (14), (20) gives:
% 74.24/10.64 | | (21) ? [v0: $i] : (app(all_91_2, v0) = all_91_1 & $i(v0) & ssList(v0))
% 74.24/10.64 | |
% 74.24/10.64 | | GROUND_INST: instantiating (3) with all_91_2, all_91_2, simplifying with
% 74.24/10.64 | | (10), (13), (19) gives:
% 74.24/10.64 | | (22) ? [v0: $i] : (app(v0, all_91_2) = all_91_2 & $i(v0) & ssList(v0))
% 74.24/10.64 | |
% 74.24/10.64 | | DELTA: instantiating (21) with fresh symbol all_134_0 gives:
% 74.24/10.64 | | (23) app(all_91_2, all_134_0) = all_91_1 & $i(all_134_0) &
% 74.24/10.64 | | ssList(all_134_0)
% 74.24/10.64 | |
% 74.24/10.64 | | ALPHA: (23) implies:
% 74.24/10.64 | | (24) ssList(all_134_0)
% 74.24/10.64 | | (25) $i(all_134_0)
% 74.24/10.64 | | (26) app(all_91_2, all_134_0) = all_91_1
% 74.24/10.64 | |
% 74.24/10.64 | | DELTA: instantiating (22) with fresh symbol all_148_0 gives:
% 74.24/10.64 | | (27) app(all_148_0, all_91_2) = all_91_2 & $i(all_148_0) &
% 74.24/10.64 | | ssList(all_148_0)
% 74.24/10.64 | |
% 74.24/10.64 | | ALPHA: (27) implies:
% 74.24/10.64 | | (28) ssList(all_148_0)
% 74.24/10.64 | | (29) $i(all_148_0)
% 74.24/10.64 | | (30) app(all_148_0, all_91_2) = all_91_2
% 74.24/10.64 | |
% 74.24/10.65 | | GROUND_INST: instantiating (4) with all_91_1, all_91_2, all_148_0, all_91_2,
% 74.24/10.65 | | all_134_0, simplifying with (9), (10), (11), (13), (14), (24),
% 74.24/10.65 | | (25), (26), (28), (29), (30) gives:
% 74.24/10.65 | | (31) $false
% 74.24/10.65 | |
% 74.24/10.65 | | CLOSE: (31) is inconsistent.
% 74.24/10.65 | |
% 74.24/10.65 | End of split
% 74.24/10.65 |
% 74.24/10.65 End of proof
% 74.24/10.65 % SZS output end Proof for theBenchmark
% 74.24/10.65
% 74.24/10.65 10026ms
%------------------------------------------------------------------------------