TSTP Solution File: LCL650+1.001 by Princess---230619
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Princess---230619
% Problem : LCL650+1.001 : TPTP v8.1.2. Released v4.0.0.
% Transfm : none
% Format : tptp
% Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s
% Computer : n031.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 08:12:03 EDT 2023
% Result : Theorem 8.64s 2.06s
% Output : Proof 11.80s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : LCL650+1.001 : TPTP v8.1.2. Released v4.0.0.
% 0.13/0.13 % Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s
% 0.14/0.34 % Computer : n031.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 300
% 0.14/0.34 % DateTime : Thu Aug 24 22:13:36 EDT 2023
% 0.14/0.34 % CPUTime :
% 0.21/0.63 ________ _____
% 0.21/0.63 ___ __ \_________(_)________________________________
% 0.21/0.63 __ /_/ /_ ___/_ /__ __ \ ___/ _ \_ ___/_ ___/
% 0.21/0.63 _ ____/_ / _ / _ / / / /__ / __/(__ )_(__ )
% 0.21/0.63 /_/ /_/ /_/ /_/ /_/\___/ \___//____/ /____/
% 0.21/0.63
% 0.21/0.63 A Theorem Prover for First-Order Logic modulo Linear Integer Arithmetic
% 0.21/0.63 (2023-06-19)
% 0.21/0.63
% 0.21/0.63 (c) Philipp Rümmer, 2009-2023
% 0.21/0.63 Contributors: Peter Backeman, Peter Baumgartner, Angelo Brillout, Zafer Esen,
% 0.21/0.63 Amanda Stjerna.
% 0.21/0.63 Free software under BSD-3-Clause.
% 0.21/0.63
% 0.21/0.63 For more information, visit http://www.philipp.ruemmer.org/princess.shtml
% 0.21/0.63
% 0.21/0.63 Loading /export/starexec/sandbox/benchmark/theBenchmark.p ...
% 0.21/0.64 Running up to 7 provers in parallel.
% 0.21/0.65 Prover 0: Options: +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1042961893
% 0.21/0.65 Prover 2: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMinimalAndEmpty -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1065072994
% 0.21/0.65 Prover 1: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1571432423
% 0.21/0.65 Prover 3: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1922548996
% 0.21/0.65 Prover 4: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=1868514696
% 0.21/0.66 Prover 6: Options: -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximalOutermost -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1399714365
% 0.21/0.66 Prover 5: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=complete -randomSeed=1259561288
% 2.47/1.08 Prover 1: Preprocessing ...
% 2.47/1.08 Prover 4: Preprocessing ...
% 2.67/1.12 Prover 0: Preprocessing ...
% 2.67/1.12 Prover 5: Preprocessing ...
% 2.67/1.12 Prover 6: Preprocessing ...
% 2.67/1.12 Prover 3: Preprocessing ...
% 2.93/1.13 Prover 2: Preprocessing ...
% 3.97/1.31 Prover 2: Constructing countermodel ...
% 3.97/1.31 Prover 5: Constructing countermodel ...
% 3.97/1.39 Prover 3: Constructing countermodel ...
% 3.97/1.41 Prover 6: Proving ...
% 3.97/1.45 Prover 1: Constructing countermodel ...
% 5.03/1.47 Prover 0: Proving ...
% 5.03/1.47 Prover 4: Constructing countermodel ...
% 8.64/2.06 Prover 0: proved (1410ms)
% 8.64/2.06
% 8.64/2.06 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 8.64/2.06
% 8.64/2.06 Prover 3: stopped
% 8.64/2.07 Prover 5: stopped
% 9.39/2.08 Prover 7: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470
% 9.39/2.08 Prover 6: stopped
% 9.39/2.08 Prover 8: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089
% 9.39/2.08 Prover 2: stopped
% 9.39/2.08 Prover 10: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=919308125
% 9.39/2.11 Prover 13: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=complete -randomSeed=1138197443
% 9.39/2.11 Prover 11: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1509710984
% 9.39/2.11 Prover 7: Preprocessing ...
% 9.39/2.12 Prover 8: Preprocessing ...
% 9.39/2.13 Prover 10: Preprocessing ...
% 9.39/2.13 Prover 13: Preprocessing ...
% 9.39/2.14 Prover 7: Constructing countermodel ...
% 9.39/2.15 Prover 11: Preprocessing ...
% 10.38/2.17 Prover 10: Constructing countermodel ...
% 10.57/2.18 Prover 13: Constructing countermodel ...
% 10.57/2.21 Prover 8: Warning: ignoring some quantifiers
% 10.57/2.22 Prover 8: Constructing countermodel ...
% 11.06/2.27 Prover 11: Constructing countermodel ...
% 11.54/2.31 Prover 13: Found proof (size 19)
% 11.54/2.31 Prover 13: proved (202ms)
% 11.54/2.31 Prover 4: stopped
% 11.54/2.31 Prover 8: stopped
% 11.54/2.31 Prover 7: stopped
% 11.54/2.31 Prover 10: stopped
% 11.54/2.31 Prover 1: stopped
% 11.54/2.31 Prover 11: stopped
% 11.54/2.31
% 11.54/2.31 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 11.54/2.31
% 11.54/2.32 % SZS output start Proof for theBenchmark
% 11.54/2.32 Assumptions after simplification:
% 11.54/2.32 ---------------------------------
% 11.54/2.32
% 11.54/2.32 (main)
% 11.54/2.34 ? [v0: $i] : ? [v1: $i] : ? [v2: $i] : ? [v3: $i] : ? [v4: $i] : ? [v5:
% 11.54/2.34 $i] : ? [v6: $i] : ? [v7: $i] : ? [v8: $i] : ? [v9: $i] : ($i(v9) &
% 11.54/2.34 $i(v8) & $i(v7) & $i(v6) & $i(v5) & $i(v4) & $i(v3) & $i(v2) & $i(v1) &
% 11.54/2.34 $i(v0) & r1(v8, v9) & r1(v7, v8) & r1(v6, v7) & r1(v3, v4) & r1(v2, v3) &
% 11.54/2.34 r1(v1, v2) & r1(v0, v6) & r1(v0, v5) & r1(v0, v1) & ~ p5(v5) & ! [v10: $i]
% 11.54/2.34 : ! [v11: $i] : ! [v12: $i] : ! [v13: $i] : ( ~ $i(v13) | ~ $i(v12) | ~
% 11.54/2.34 $i(v11) | ~ $i(v10) | ~ p1(v13) | ~ p3(v13) | ~ r1(v12, v13) | ~
% 11.54/2.34 r1(v11, v12) | ~ r1(v10, v11) | ~ r1(v0, v10)) & ! [v10: $i] : ! [v11:
% 11.54/2.34 $i] : ! [v12: $i] : ! [v13: $i] : ( ~ $i(v13) | ~ $i(v12) | ~ $i(v11)
% 11.54/2.34 | ~ $i(v10) | ~ p1(v13) | ~ p2(v13) | ~ r1(v12, v13) | ~ r1(v11, v12)
% 11.54/2.34 | ~ r1(v10, v11) | ~ r1(v0, v10)) & ! [v10: $i] : ! [v11: $i] : !
% 11.54/2.34 [v12: $i] : ! [v13: $i] : ( ~ $i(v13) | ~ $i(v12) | ~ $i(v11) | ~
% 11.54/2.34 $i(v10) | ~ p3(v13) | ~ p2(v13) | ~ r1(v12, v13) | ~ r1(v11, v12) | ~
% 11.54/2.34 r1(v10, v11) | ~ r1(v0, v10)) & ! [v10: $i] : ! [v11: $i] : ! [v12:
% 11.54/2.34 $i] : ! [v13: $i] : ( ~ $i(v13) | ~ $i(v12) | ~ $i(v11) | ~ $i(v10) |
% 11.54/2.34 ~ r1(v12, v13) | ~ r1(v11, v12) | ~ r1(v10, v11) | ~ r1(v0, v10) |
% 11.54/2.34 p1(v13) | p3(v13)) & ! [v10: $i] : ! [v11: $i] : ! [v12: $i] : ! [v13:
% 11.54/2.34 $i] : ( ~ $i(v13) | ~ $i(v12) | ~ $i(v11) | ~ $i(v10) | ~ r1(v12, v13)
% 11.54/2.34 | ~ r1(v11, v12) | ~ r1(v10, v11) | ~ r1(v0, v10) | p1(v13) | p2(v13))
% 11.54/2.34 & ! [v10: $i] : ! [v11: $i] : ! [v12: $i] : ! [v13: $i] : ( ~ $i(v13) |
% 11.54/2.34 ~ $i(v12) | ~ $i(v11) | ~ $i(v10) | ~ r1(v12, v13) | ~ r1(v11, v12) |
% 11.54/2.34 ~ r1(v10, v11) | ~ r1(v0, v10) | p3(v13) | p2(v13)) & ! [v10: $i] : !
% 11.54/2.34 [v11: $i] : ( ~ $i(v11) | ~ $i(v10) | ~ r1(v10, v11) | ~ r1(v0, v10) | ?
% 11.54/2.34 [v12: $i] : ($i(v12) & r1(v11, v12) & ~ p3(v12))) & ! [v10: $i] : ( ~
% 11.54/2.34 $i(v10) | ~ r1(v0, v10) | ? [v11: $i] : ($i(v11) & r1(v10, v11) & ~
% 11.54/2.34 p4(v11))) & ( ~ p1(v4) | ~ p3(v4) | ~ p2(v4) | ~ p4(v4)) & (p2(v9) |
% 11.54/2.34 p4(v9) | p6(v9) | p8(v9)))
% 11.54/2.34
% 11.54/2.34 Those formulas are unsatisfiable:
% 11.54/2.34 ---------------------------------
% 11.54/2.34
% 11.54/2.34 Begin of proof
% 11.54/2.34 |
% 11.54/2.34 | DELTA: instantiating (main) with fresh symbols all_2_0, all_2_1, all_2_2,
% 11.54/2.34 | all_2_3, all_2_4, all_2_5, all_2_6, all_2_7, all_2_8, all_2_9 gives:
% 11.54/2.35 | (1) $i(all_2_0) & $i(all_2_1) & $i(all_2_2) & $i(all_2_3) & $i(all_2_4) &
% 11.54/2.35 | $i(all_2_5) & $i(all_2_6) & $i(all_2_7) & $i(all_2_8) & $i(all_2_9) &
% 11.54/2.35 | r1(all_2_1, all_2_0) & r1(all_2_2, all_2_1) & r1(all_2_3, all_2_2) &
% 11.54/2.35 | r1(all_2_6, all_2_5) & r1(all_2_7, all_2_6) & r1(all_2_8, all_2_7) &
% 11.54/2.35 | r1(all_2_9, all_2_3) & r1(all_2_9, all_2_4) & r1(all_2_9, all_2_8) & ~
% 11.54/2.35 | p5(all_2_4) & ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: $i] : (
% 11.54/2.35 | ~ $i(v3) | ~ $i(v2) | ~ $i(v1) | ~ $i(v0) | ~ p1(v3) | ~ p3(v3)
% 11.54/2.35 | | ~ r1(v2, v3) | ~ r1(v1, v2) | ~ r1(v0, v1) | ~ r1(all_2_9, v0))
% 11.54/2.35 | & ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: $i] : ( ~ $i(v3) |
% 11.54/2.35 | ~ $i(v2) | ~ $i(v1) | ~ $i(v0) | ~ p1(v3) | ~ p2(v3) | ~ r1(v2,
% 11.54/2.35 | v3) | ~ r1(v1, v2) | ~ r1(v0, v1) | ~ r1(all_2_9, v0)) & ! [v0:
% 11.54/2.35 | $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: $i] : ( ~ $i(v3) | ~
% 11.54/2.35 | $i(v2) | ~ $i(v1) | ~ $i(v0) | ~ p3(v3) | ~ p2(v3) | ~ r1(v2,
% 11.54/2.35 | v3) | ~ r1(v1, v2) | ~ r1(v0, v1) | ~ r1(all_2_9, v0)) & ! [v0:
% 11.54/2.35 | $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: $i] : ( ~ $i(v3) | ~
% 11.54/2.35 | $i(v2) | ~ $i(v1) | ~ $i(v0) | ~ r1(v2, v3) | ~ r1(v1, v2) | ~
% 11.54/2.35 | r1(v0, v1) | ~ r1(all_2_9, v0) | p1(v3) | p3(v3)) & ! [v0: $i] : !
% 11.54/2.35 | [v1: $i] : ! [v2: $i] : ! [v3: $i] : ( ~ $i(v3) | ~ $i(v2) | ~
% 11.54/2.35 | $i(v1) | ~ $i(v0) | ~ r1(v2, v3) | ~ r1(v1, v2) | ~ r1(v0, v1) |
% 11.54/2.35 | ~ r1(all_2_9, v0) | p1(v3) | p2(v3)) & ! [v0: $i] : ! [v1: $i] : !
% 11.54/2.35 | [v2: $i] : ! [v3: $i] : ( ~ $i(v3) | ~ $i(v2) | ~ $i(v1) | ~ $i(v0)
% 11.54/2.35 | | ~ r1(v2, v3) | ~ r1(v1, v2) | ~ r1(v0, v1) | ~ r1(all_2_9, v0)
% 11.54/2.35 | | p3(v3) | p2(v3)) & ! [v0: $i] : ! [v1: $i] : ( ~ $i(v1) | ~
% 11.54/2.35 | $i(v0) | ~ r1(v0, v1) | ~ r1(all_2_9, v0) | ? [v2: $i] : ($i(v2) &
% 11.54/2.35 | r1(v1, v2) & ~ p3(v2))) & ! [v0: $i] : ( ~ $i(v0) | ~
% 11.54/2.35 | r1(all_2_9, v0) | ? [v1: $i] : ($i(v1) & r1(v0, v1) & ~ p4(v1))) &
% 11.54/2.35 | ( ~ p1(all_2_5) | ~ p3(all_2_5) | ~ p2(all_2_5) | ~ p4(all_2_5)) &
% 11.54/2.35 | (p2(all_2_0) | p4(all_2_0) | p6(all_2_0) | p8(all_2_0))
% 11.54/2.35 |
% 11.54/2.35 | ALPHA: (1) implies:
% 11.54/2.35 | (2) r1(all_2_9, all_2_3)
% 11.54/2.35 | (3) r1(all_2_3, all_2_2)
% 11.54/2.35 | (4) r1(all_2_2, all_2_1)
% 11.54/2.35 | (5) r1(all_2_1, all_2_0)
% 11.54/2.35 | (6) $i(all_2_3)
% 11.54/2.35 | (7) $i(all_2_2)
% 11.54/2.35 | (8) $i(all_2_1)
% 11.54/2.35 | (9) $i(all_2_0)
% 11.54/2.35 | (10) ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: $i] : ( ~ $i(v3) |
% 11.54/2.35 | ~ $i(v2) | ~ $i(v1) | ~ $i(v0) | ~ r1(v2, v3) | ~ r1(v1, v2) |
% 11.54/2.35 | ~ r1(v0, v1) | ~ r1(all_2_9, v0) | p3(v3) | p2(v3))
% 11.54/2.36 | (11) ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: $i] : ( ~ $i(v3) |
% 11.54/2.36 | ~ $i(v2) | ~ $i(v1) | ~ $i(v0) | ~ r1(v2, v3) | ~ r1(v1, v2) |
% 11.54/2.36 | ~ r1(v0, v1) | ~ r1(all_2_9, v0) | p1(v3) | p2(v3))
% 11.54/2.36 | (12) ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: $i] : ( ~ $i(v3) |
% 11.54/2.36 | ~ $i(v2) | ~ $i(v1) | ~ $i(v0) | ~ r1(v2, v3) | ~ r1(v1, v2) |
% 11.54/2.36 | ~ r1(v0, v1) | ~ r1(all_2_9, v0) | p1(v3) | p3(v3))
% 11.54/2.36 | (13) ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: $i] : ( ~ $i(v3) |
% 11.54/2.36 | ~ $i(v2) | ~ $i(v1) | ~ $i(v0) | ~ p3(v3) | ~ p2(v3) | ~ r1(v2,
% 11.54/2.36 | v3) | ~ r1(v1, v2) | ~ r1(v0, v1) | ~ r1(all_2_9, v0))
% 11.54/2.36 | (14) ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: $i] : ( ~ $i(v3) |
% 11.54/2.36 | ~ $i(v2) | ~ $i(v1) | ~ $i(v0) | ~ p1(v3) | ~ p2(v3) | ~ r1(v2,
% 11.54/2.36 | v3) | ~ r1(v1, v2) | ~ r1(v0, v1) | ~ r1(all_2_9, v0))
% 11.54/2.36 | (15) ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: $i] : ( ~ $i(v3) |
% 11.54/2.36 | ~ $i(v2) | ~ $i(v1) | ~ $i(v0) | ~ p1(v3) | ~ p3(v3) | ~ r1(v2,
% 11.54/2.36 | v3) | ~ r1(v1, v2) | ~ r1(v0, v1) | ~ r1(all_2_9, v0))
% 11.54/2.36 |
% 11.54/2.36 | GROUND_INST: instantiating (12) with all_2_3, all_2_2, all_2_1, all_2_0,
% 11.54/2.36 | simplifying with (2), (3), (4), (5), (6), (7), (8), (9) gives:
% 11.54/2.36 | (16) p1(all_2_0) | p3(all_2_0)
% 11.54/2.36 |
% 11.54/2.36 | GROUND_INST: instantiating (11) with all_2_3, all_2_2, all_2_1, all_2_0,
% 11.54/2.36 | simplifying with (2), (3), (4), (5), (6), (7), (8), (9) gives:
% 11.54/2.36 | (17) p1(all_2_0) | p2(all_2_0)
% 11.54/2.36 |
% 11.80/2.36 | GROUND_INST: instantiating (10) with all_2_3, all_2_2, all_2_1, all_2_0,
% 11.80/2.36 | simplifying with (2), (3), (4), (5), (6), (7), (8), (9) gives:
% 11.80/2.36 | (18) p3(all_2_0) | p2(all_2_0)
% 11.80/2.36 |
% 11.80/2.36 | BETA: splitting (18) gives:
% 11.80/2.36 |
% 11.80/2.36 | Case 1:
% 11.80/2.36 | |
% 11.80/2.36 | | (19) p3(all_2_0)
% 11.80/2.36 | |
% 11.80/2.36 | | BETA: splitting (17) gives:
% 11.80/2.36 | |
% 11.80/2.36 | | Case 1:
% 11.80/2.36 | | |
% 11.80/2.36 | | | (20) p1(all_2_0)
% 11.80/2.36 | | |
% 11.80/2.36 | | | GROUND_INST: instantiating (15) with all_2_3, all_2_2, all_2_1, all_2_0,
% 11.80/2.36 | | | simplifying with (2), (3), (4), (5), (6), (7), (8), (9),
% 11.80/2.36 | | | (19), (20) gives:
% 11.80/2.36 | | | (21) $false
% 11.80/2.36 | | |
% 11.80/2.36 | | | CLOSE: (21) is inconsistent.
% 11.80/2.36 | | |
% 11.80/2.36 | | Case 2:
% 11.80/2.36 | | |
% 11.80/2.36 | | | (22) p2(all_2_0)
% 11.80/2.36 | | |
% 11.80/2.37 | | | GROUND_INST: instantiating (13) with all_2_3, all_2_2, all_2_1, all_2_0,
% 11.80/2.37 | | | simplifying with (2), (3), (4), (5), (6), (7), (8), (9),
% 11.80/2.37 | | | (19), (22) gives:
% 11.80/2.37 | | | (23) $false
% 11.80/2.37 | | |
% 11.80/2.37 | | | CLOSE: (23) is inconsistent.
% 11.80/2.37 | | |
% 11.80/2.37 | | End of split
% 11.80/2.37 | |
% 11.80/2.37 | Case 2:
% 11.80/2.37 | |
% 11.80/2.37 | | (24) p2(all_2_0)
% 11.80/2.37 | |
% 11.80/2.37 | | BETA: splitting (16) gives:
% 11.80/2.37 | |
% 11.80/2.37 | | Case 1:
% 11.80/2.37 | | |
% 11.80/2.37 | | | (25) p1(all_2_0)
% 11.80/2.37 | | |
% 11.80/2.37 | | | GROUND_INST: instantiating (14) with all_2_3, all_2_2, all_2_1, all_2_0,
% 11.80/2.37 | | | simplifying with (2), (3), (4), (5), (6), (7), (8), (9),
% 11.80/2.37 | | | (24), (25) gives:
% 11.80/2.37 | | | (26) $false
% 11.80/2.37 | | |
% 11.80/2.37 | | | CLOSE: (26) is inconsistent.
% 11.80/2.37 | | |
% 11.80/2.37 | | Case 2:
% 11.80/2.37 | | |
% 11.80/2.37 | | | (27) p3(all_2_0)
% 11.80/2.37 | | |
% 11.80/2.37 | | | GROUND_INST: instantiating (13) with all_2_3, all_2_2, all_2_1, all_2_0,
% 11.80/2.37 | | | simplifying with (2), (3), (4), (5), (6), (7), (8), (9),
% 11.80/2.37 | | | (24), (27) gives:
% 11.80/2.37 | | | (28) $false
% 11.80/2.37 | | |
% 11.80/2.37 | | | CLOSE: (28) is inconsistent.
% 11.80/2.37 | | |
% 11.80/2.37 | | End of split
% 11.80/2.37 | |
% 11.80/2.37 | End of split
% 11.80/2.37 |
% 11.80/2.37 End of proof
% 11.80/2.37 % SZS output end Proof for theBenchmark
% 11.80/2.37
% 11.80/2.37 1740ms
%------------------------------------------------------------------------------