TSTP Solution File: SWV388+1 by Princess---230619
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Princess---230619
% Problem : SWV388+1 : TPTP v8.1.2. Released v3.3.0.
% Transfm : none
% Format : tptp
% Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s
% Computer : n005.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 22:56:08 EDT 2023
% Result : Theorem 13.11s 2.72s
% Output : Proof 16.36s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.09/0.11 % Problem : SWV388+1 : TPTP v8.1.2. Released v3.3.0.
% 0.09/0.11 % Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s
% 0.10/0.32 % Computer : n005.cluster.edu
% 0.10/0.32 % Model : x86_64 x86_64
% 0.10/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.32 % Memory : 8042.1875MB
% 0.10/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.32 % CPULimit : 300
% 0.10/0.32 % WCLimit : 300
% 0.10/0.32 % DateTime : Tue Aug 29 03:51:52 EDT 2023
% 0.10/0.32 % CPUTime :
% 0.17/0.62 ________ _____
% 0.17/0.62 ___ __ \_________(_)________________________________
% 0.17/0.62 __ /_/ /_ ___/_ /__ __ \ ___/ _ \_ ___/_ ___/
% 0.17/0.62 _ ____/_ / _ / _ / / / /__ / __/(__ )_(__ )
% 0.17/0.62 /_/ /_/ /_/ /_/ /_/\___/ \___//____/ /____/
% 0.17/0.62
% 0.17/0.62 A Theorem Prover for First-Order Logic modulo Linear Integer Arithmetic
% 0.17/0.62 (2023-06-19)
% 0.17/0.62
% 0.17/0.62 (c) Philipp Rümmer, 2009-2023
% 0.17/0.62 Contributors: Peter Backeman, Peter Baumgartner, Angelo Brillout, Zafer Esen,
% 0.17/0.62 Amanda Stjerna.
% 0.17/0.62 Free software under BSD-3-Clause.
% 0.17/0.62
% 0.17/0.62 For more information, visit http://www.philipp.ruemmer.org/princess.shtml
% 0.17/0.62
% 0.17/0.63 Loading /export/starexec/sandbox/benchmark/theBenchmark.p ...
% 0.17/0.64 Running up to 7 provers in parallel.
% 0.17/0.67 Prover 0: Options: +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1042961893
% 0.17/0.67 Prover 1: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1571432423
% 0.17/0.67 Prover 2: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMinimalAndEmpty -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1065072994
% 0.17/0.67 Prover 3: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1922548996
% 0.17/0.67 Prover 4: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=1868514696
% 0.17/0.67 Prover 5: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=complete -randomSeed=1259561288
% 0.17/0.67 Prover 6: Options: -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximalOutermost -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1399714365
% 3.33/1.33 Prover 4: Preprocessing ...
% 3.33/1.33 Prover 1: Preprocessing ...
% 3.33/1.38 Prover 5: Preprocessing ...
% 3.33/1.38 Prover 0: Preprocessing ...
% 3.33/1.38 Prover 6: Preprocessing ...
% 3.33/1.38 Prover 2: Preprocessing ...
% 3.33/1.38 Prover 3: Preprocessing ...
% 11.16/2.33 Prover 3: Warning: ignoring some quantifiers
% 11.16/2.36 Prover 1: Warning: ignoring some quantifiers
% 11.65/2.40 Prover 6: Proving ...
% 11.65/2.40 Prover 3: Constructing countermodel ...
% 11.65/2.42 Prover 1: Constructing countermodel ...
% 12.22/2.49 Prover 4: Constructing countermodel ...
% 12.22/2.49 Prover 2: Proving ...
% 12.43/2.50 Prover 5: Proving ...
% 12.43/2.53 Prover 0: Proving ...
% 13.11/2.71 Prover 3: proved (2050ms)
% 13.11/2.71
% 13.11/2.72 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 13.11/2.72
% 13.11/2.72 Prover 5: stopped
% 13.11/2.72 Prover 7: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470
% 13.11/2.72 Prover 8: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089
% 13.11/2.72 Prover 2: stopped
% 13.11/2.73 Prover 6: proved (2064ms)
% 13.11/2.73
% 13.11/2.73 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 13.11/2.73
% 13.11/2.73 Prover 0: stopped
% 13.78/2.74 Prover 11: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1509710984
% 13.78/2.74 Prover 10: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=919308125
% 13.78/2.74 Prover 13: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=complete -randomSeed=1138197443
% 14.31/2.82 Prover 11: Preprocessing ...
% 14.31/2.83 Prover 7: Preprocessing ...
% 14.31/2.83 Prover 8: Preprocessing ...
% 14.31/2.83 Prover 4: Found proof (size 17)
% 14.31/2.83 Prover 4: proved (2172ms)
% 14.31/2.83 Prover 1: Found proof (size 17)
% 14.31/2.83 Prover 1: proved (2183ms)
% 14.31/2.85 Prover 13: Preprocessing ...
% 14.68/2.87 Prover 10: Preprocessing ...
% 14.68/2.91 Prover 7: stopped
% 14.68/2.92 Prover 11: stopped
% 14.68/2.94 Prover 10: stopped
% 14.68/2.94 Prover 13: stopped
% 15.75/3.05 Prover 8: Warning: ignoring some quantifiers
% 15.75/3.08 Prover 8: Constructing countermodel ...
% 15.75/3.10 Prover 8: stopped
% 15.75/3.10
% 15.75/3.10 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 15.75/3.10
% 16.10/3.11 % SZS output start Proof for theBenchmark
% 16.10/3.12 Assumptions after simplification:
% 16.10/3.12 ---------------------------------
% 16.10/3.12
% 16.10/3.12 (l24_co)
% 16.10/3.16 ? [v0: $i] : ? [v1: $i] : ? [v2: $i] : ? [v3: $i] : ? [v4: int] : ? [v5:
% 16.10/3.16 $i] : ( ~ (v4 = 0) & ok(v5) = 0 & triple(v0, v1, v2) = v3 & check_cpq(v5) =
% 16.10/3.16 0 & check_cpq(v3) = v4 & findmin_cpq_eff(v3) = v5 & $i(v5) & $i(v3) & $i(v2)
% 16.10/3.16 & $i(v1) & $i(v0))
% 16.10/3.16
% 16.10/3.16 (l24_l34)
% 16.36/3.17 ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: $i] : ( ~ (triple(v0, v1,
% 16.36/3.17 v2) = v3) | ~ $i(v2) | ~ $i(v1) | ~ $i(v0) | ? [v4: any] : ? [v5:
% 16.36/3.17 $i] : ? [v6: any] : (check_cpq(v5) = v6 & check_cpq(v3) = v4 &
% 16.36/3.17 findmin_cpq_eff(v3) = v5 & $i(v5) & ( ~ (v6 = 0) | v4 = 0)))
% 16.36/3.17
% 16.36/3.17 (function-axioms)
% 16.36/3.19 ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: $i] : ! [v4: $i] : (v1 = v0
% 16.36/3.19 | ~ (triple(v4, v3, v2) = v1) | ~ (triple(v4, v3, v2) = v0)) & ! [v0:
% 16.36/3.19 MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] : ! [v3: $i]
% 16.36/3.19 : ! [v4: $i] : (v1 = v0 | ~ (pair_in_list(v4, v3, v2) = v1) | ~
% 16.36/3.19 (pair_in_list(v4, v3, v2) = v0)) & ! [v0: $i] : ! [v1: $i] : ! [v2: $i] :
% 16.36/3.19 ! [v3: $i] : (v1 = v0 | ~ (remove_pqp(v3, v2) = v1) | ~ (remove_pqp(v3, v2)
% 16.36/3.19 = v0)) & ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: $i] : (v1 = v0
% 16.36/3.19 | ~ (insert_pqp(v3, v2) = v1) | ~ (insert_pqp(v3, v2) = v0)) & ! [v0:
% 16.36/3.19 MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] : ! [v3: $i]
% 16.36/3.19 : (v1 = v0 | ~ (contains_cpq(v3, v2) = v1) | ~ (contains_cpq(v3, v2) = v0))
% 16.36/3.19 & ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: $i] : (v1 = v0 | ~
% 16.36/3.19 (remove_cpq(v3, v2) = v1) | ~ (remove_cpq(v3, v2) = v0)) & ! [v0: $i] : !
% 16.36/3.19 [v1: $i] : ! [v2: $i] : ! [v3: $i] : (v1 = v0 | ~ (insert_cpq(v3, v2) = v1)
% 16.36/3.19 | ~ (insert_cpq(v3, v2) = v0)) & ! [v0: MultipleValueBool] : ! [v1:
% 16.36/3.19 MultipleValueBool] : ! [v2: $i] : ! [v3: $i] : (v1 = v0 | ~ (succ_cpq(v3,
% 16.36/3.19 v2) = v1) | ~ (succ_cpq(v3, v2) = v0)) & ! [v0: $i] : ! [v1: $i] : !
% 16.36/3.19 [v2: $i] : ! [v3: $i] : (v1 = v0 | ~ (update_slb(v3, v2) = v1) | ~
% 16.36/3.19 (update_slb(v3, v2) = v0)) & ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : !
% 16.36/3.19 [v3: $i] : (v1 = v0 | ~ (lookup_slb(v3, v2) = v1) | ~ (lookup_slb(v3, v2) =
% 16.36/3.19 v0)) & ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: $i] : (v1 = v0 |
% 16.36/3.19 ~ (remove_slb(v3, v2) = v1) | ~ (remove_slb(v3, v2) = v0)) & ! [v0:
% 16.36/3.19 MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] : ! [v3: $i]
% 16.36/3.19 : (v1 = v0 | ~ (contains_slb(v3, v2) = v1) | ~ (contains_slb(v3, v2) = v0))
% 16.36/3.19 & ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: $i] : (v1 = v0 | ~
% 16.36/3.19 (pair(v3, v2) = v1) | ~ (pair(v3, v2) = v0)) & ! [v0: $i] : ! [v1: $i] :
% 16.36/3.19 ! [v2: $i] : ! [v3: $i] : (v1 = v0 | ~ (insert_slb(v3, v2) = v1) | ~
% 16.36/3.19 (insert_slb(v3, v2) = v0)) & ! [v0: MultipleValueBool] : ! [v1:
% 16.36/3.19 MultipleValueBool] : ! [v2: $i] : ! [v3: $i] : (v1 = v0 | ~
% 16.36/3.19 (strictly_less_than(v3, v2) = v1) | ~ (strictly_less_than(v3, v2) = v0)) &
% 16.36/3.19 ! [v0: MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] : ! [v3:
% 16.36/3.19 $i] : (v1 = v0 | ~ (less_than(v3, v2) = v1) | ~ (less_than(v3, v2) = v0))
% 16.36/3.19 & ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : (v1 = v0 | ~
% 16.36/3.19 (removemin_cpq_res(v2) = v1) | ~ (removemin_cpq_res(v2) = v0)) & ! [v0:
% 16.36/3.19 $i] : ! [v1: $i] : ! [v2: $i] : (v1 = v0 | ~ (findmin_cpq_res(v2) = v1) |
% 16.36/3.19 ~ (findmin_cpq_res(v2) = v0)) & ! [v0: $i] : ! [v1: $i] : ! [v2: $i] :
% 16.36/3.19 (v1 = v0 | ~ (findmin_pqp_res(v2) = v1) | ~ (findmin_pqp_res(v2) = v0)) & !
% 16.36/3.19 [v0: MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] : (v1 = v0
% 16.36/3.19 | ~ (ok(v2) = v1) | ~ (ok(v2) = v0)) & ! [v0: MultipleValueBool] : !
% 16.36/3.19 [v1: MultipleValueBool] : ! [v2: $i] : (v1 = v0 | ~ (check_cpq(v2) = v1) |
% 16.36/3.19 ~ (check_cpq(v2) = v0)) & ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : (v1 = v0
% 16.36/3.19 | ~ (removemin_cpq_eff(v2) = v1) | ~ (removemin_cpq_eff(v2) = v0)) & !
% 16.36/3.19 [v0: $i] : ! [v1: $i] : ! [v2: $i] : (v1 = v0 | ~ (findmin_cpq_eff(v2) =
% 16.36/3.19 v1) | ~ (findmin_cpq_eff(v2) = v0)) & ! [v0: MultipleValueBool] : !
% 16.36/3.19 [v1: MultipleValueBool] : ! [v2: $i] : (v1 = v0 | ~ (isnonempty_slb(v2) =
% 16.36/3.19 v1) | ~ (isnonempty_slb(v2) = v0))
% 16.36/3.19
% 16.36/3.19 Further assumptions not needed in the proof:
% 16.36/3.19 --------------------------------------------
% 16.36/3.19 ax18, ax19, ax20, ax21, ax22, ax23, ax24, ax25, ax26, ax27, ax28, ax29, ax30,
% 16.36/3.19 ax31, ax32, ax33, ax34, ax35, ax36, ax37, ax38, ax39, ax40, ax41, ax42, ax43,
% 16.36/3.19 ax44, ax45, ax46, ax47, ax48, ax49, ax50, ax51, ax52, ax53, bottom_smallest,
% 16.36/3.19 reflexivity, stricly_smaller_definition, totality, transitivity
% 16.36/3.19
% 16.36/3.19 Those formulas are unsatisfiable:
% 16.36/3.19 ---------------------------------
% 16.36/3.19
% 16.36/3.19 Begin of proof
% 16.36/3.20 |
% 16.36/3.20 | ALPHA: (function-axioms) implies:
% 16.36/3.20 | (1) ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : (v1 = v0 | ~
% 16.36/3.20 | (findmin_cpq_eff(v2) = v1) | ~ (findmin_cpq_eff(v2) = v0))
% 16.36/3.20 | (2) ! [v0: MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] :
% 16.36/3.20 | (v1 = v0 | ~ (check_cpq(v2) = v1) | ~ (check_cpq(v2) = v0))
% 16.36/3.20 |
% 16.36/3.20 | DELTA: instantiating (l24_co) with fresh symbols all_47_0, all_47_1, all_47_2,
% 16.36/3.20 | all_47_3, all_47_4, all_47_5 gives:
% 16.36/3.20 | (3) ~ (all_47_1 = 0) & ok(all_47_0) = 0 & triple(all_47_5, all_47_4,
% 16.36/3.20 | all_47_3) = all_47_2 & check_cpq(all_47_0) = 0 & check_cpq(all_47_2)
% 16.36/3.20 | = all_47_1 & findmin_cpq_eff(all_47_2) = all_47_0 & $i(all_47_0) &
% 16.36/3.20 | $i(all_47_2) & $i(all_47_3) & $i(all_47_4) & $i(all_47_5)
% 16.36/3.20 |
% 16.36/3.20 | ALPHA: (3) implies:
% 16.36/3.20 | (4) ~ (all_47_1 = 0)
% 16.36/3.21 | (5) $i(all_47_5)
% 16.36/3.21 | (6) $i(all_47_4)
% 16.36/3.21 | (7) $i(all_47_3)
% 16.36/3.21 | (8) findmin_cpq_eff(all_47_2) = all_47_0
% 16.36/3.21 | (9) check_cpq(all_47_2) = all_47_1
% 16.36/3.21 | (10) check_cpq(all_47_0) = 0
% 16.36/3.21 | (11) triple(all_47_5, all_47_4, all_47_3) = all_47_2
% 16.36/3.21 |
% 16.36/3.21 | GROUND_INST: instantiating (l24_l34) with all_47_5, all_47_4, all_47_3,
% 16.36/3.21 | all_47_2, simplifying with (5), (6), (7), (11) gives:
% 16.36/3.21 | (12) ? [v0: any] : ? [v1: $i] : ? [v2: any] : (check_cpq(v1) = v2 &
% 16.36/3.21 | check_cpq(all_47_2) = v0 & findmin_cpq_eff(all_47_2) = v1 & $i(v1) &
% 16.36/3.21 | ( ~ (v2 = 0) | v0 = 0))
% 16.36/3.21 |
% 16.36/3.21 | DELTA: instantiating (12) with fresh symbols all_56_0, all_56_1, all_56_2
% 16.36/3.21 | gives:
% 16.36/3.21 | (13) check_cpq(all_56_1) = all_56_0 & check_cpq(all_47_2) = all_56_2 &
% 16.36/3.21 | findmin_cpq_eff(all_47_2) = all_56_1 & $i(all_56_1) & ( ~ (all_56_0 =
% 16.36/3.21 | 0) | all_56_2 = 0)
% 16.36/3.21 |
% 16.36/3.21 | ALPHA: (13) implies:
% 16.36/3.21 | (14) findmin_cpq_eff(all_47_2) = all_56_1
% 16.36/3.21 | (15) check_cpq(all_47_2) = all_56_2
% 16.36/3.21 | (16) check_cpq(all_56_1) = all_56_0
% 16.36/3.21 | (17) ~ (all_56_0 = 0) | all_56_2 = 0
% 16.36/3.21 |
% 16.36/3.21 | GROUND_INST: instantiating (1) with all_47_0, all_56_1, all_47_2, simplifying
% 16.36/3.21 | with (8), (14) gives:
% 16.36/3.21 | (18) all_56_1 = all_47_0
% 16.36/3.21 |
% 16.36/3.21 | GROUND_INST: instantiating (2) with all_47_1, all_56_2, all_47_2, simplifying
% 16.36/3.21 | with (9), (15) gives:
% 16.36/3.21 | (19) all_56_2 = all_47_1
% 16.36/3.21 |
% 16.36/3.22 | REDUCE: (16), (18) imply:
% 16.36/3.22 | (20) check_cpq(all_47_0) = all_56_0
% 16.36/3.22 |
% 16.36/3.22 | BETA: splitting (17) gives:
% 16.36/3.22 |
% 16.36/3.22 | Case 1:
% 16.36/3.22 | |
% 16.36/3.22 | | (21) ~ (all_56_0 = 0)
% 16.36/3.22 | |
% 16.36/3.22 | | GROUND_INST: instantiating (2) with 0, all_56_0, all_47_0, simplifying with
% 16.36/3.22 | | (10), (20) gives:
% 16.36/3.22 | | (22) all_56_0 = 0
% 16.36/3.22 | |
% 16.36/3.22 | | REDUCE: (21), (22) imply:
% 16.36/3.22 | | (23) $false
% 16.36/3.22 | |
% 16.36/3.22 | | CLOSE: (23) is inconsistent.
% 16.36/3.22 | |
% 16.36/3.22 | Case 2:
% 16.36/3.22 | |
% 16.36/3.22 | | (24) all_56_2 = 0
% 16.36/3.22 | |
% 16.36/3.22 | | COMBINE_EQS: (19), (24) imply:
% 16.36/3.22 | | (25) all_47_1 = 0
% 16.36/3.22 | |
% 16.36/3.22 | | SIMP: (25) implies:
% 16.36/3.22 | | (26) all_47_1 = 0
% 16.36/3.22 | |
% 16.36/3.22 | | REDUCE: (4), (26) imply:
% 16.36/3.22 | | (27) $false
% 16.36/3.22 | |
% 16.36/3.22 | | CLOSE: (27) is inconsistent.
% 16.36/3.22 | |
% 16.36/3.22 | End of split
% 16.36/3.22 |
% 16.36/3.22 End of proof
% 16.36/3.22 % SZS output end Proof for theBenchmark
% 16.36/3.22
% 16.36/3.22 2596ms
%------------------------------------------------------------------------------