TSTP Solution File: SEU223+3 by Princess---230619
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Princess---230619
% Problem : SEU223+3 : TPTP v8.1.2. Released v3.2.0.
% Transfm : none
% Format : tptp
% Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s
% Computer : n008.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 17:43:26 EDT 2023
% Result : Theorem 12.40s 2.46s
% Output : Proof 13.01s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : SEU223+3 : TPTP v8.1.2. Released v3.2.0.
% 0.00/0.14 % Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s
% 0.14/0.35 % Computer : n008.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Wed Aug 23 17:27:17 EDT 2023
% 0.14/0.35 % 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.66 Prover 0: Options: +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1042961893
% 0.21/0.66 Prover 2: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMinimalAndEmpty -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1065072994
% 0.21/0.66 Prover 1: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1571432423
% 0.21/0.66 Prover 3: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1922548996
% 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
% 0.21/0.66 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
% 2.67/1.08 Prover 4: Preprocessing ...
% 2.67/1.08 Prover 1: Preprocessing ...
% 3.10/1.12 Prover 3: Preprocessing ...
% 3.10/1.12 Prover 5: Preprocessing ...
% 3.10/1.12 Prover 2: Preprocessing ...
% 3.10/1.12 Prover 6: Preprocessing ...
% 3.10/1.12 Prover 0: Preprocessing ...
% 6.34/1.59 Prover 1: Warning: ignoring some quantifiers
% 6.34/1.60 Prover 3: Warning: ignoring some quantifiers
% 6.34/1.60 Prover 5: Proving ...
% 6.34/1.61 Prover 3: Constructing countermodel ...
% 6.34/1.61 Prover 1: Constructing countermodel ...
% 6.34/1.63 Prover 6: Proving ...
% 7.30/1.74 Prover 2: Proving ...
% 9.07/1.97 Prover 4: Warning: ignoring some quantifiers
% 9.07/1.98 Prover 3: gave up
% 9.07/1.99 Prover 7: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470
% 9.07/2.03 Prover 4: Constructing countermodel ...
% 9.07/2.07 Prover 7: Preprocessing ...
% 9.07/2.11 Prover 0: Proving ...
% 9.72/2.19 Prover 1: gave up
% 9.72/2.19 Prover 8: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089
% 10.77/2.23 Prover 7: Warning: ignoring some quantifiers
% 10.77/2.23 Prover 8: Preprocessing ...
% 10.77/2.25 Prover 7: Constructing countermodel ...
% 12.25/2.41 Prover 8: Warning: ignoring some quantifiers
% 12.40/2.45 Prover 7: Found proof (size 18)
% 12.40/2.45 Prover 7: proved (464ms)
% 12.40/2.45 Prover 4: stopped
% 12.40/2.45 Prover 8: Constructing countermodel ...
% 12.40/2.45 Prover 2: stopped
% 12.40/2.45 Prover 5: stopped
% 12.40/2.46 Prover 0: stopped
% 12.40/2.46 Prover 6: stopped
% 12.40/2.46 Prover 8: stopped
% 12.40/2.46
% 12.40/2.46 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 12.40/2.46
% 12.40/2.46 % SZS output start Proof for theBenchmark
% 12.40/2.47 Assumptions after simplification:
% 12.40/2.47 ---------------------------------
% 12.40/2.47
% 12.40/2.47 (dt_k7_relat_1)
% 12.40/2.49 ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ( ~ (relation_dom_restriction(v0,
% 12.40/2.49 v1) = v2) | ~ $i(v1) | ~ $i(v0) | ~ relation(v0) | relation(v2))
% 12.40/2.49
% 12.40/2.49 (fc4_funct_1)
% 12.40/2.49 ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ( ~ (relation_dom_restriction(v0,
% 12.40/2.49 v1) = v2) | ~ $i(v1) | ~ $i(v0) | ~ function(v0) | ~ relation(v0) |
% 12.40/2.49 function(v2)) & ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ( ~
% 12.40/2.49 (relation_dom_restriction(v0, v1) = v2) | ~ $i(v1) | ~ $i(v0) | ~
% 12.40/2.49 function(v0) | ~ relation(v0) | relation(v2))
% 12.40/2.49
% 12.40/2.49 (t68_funct_1)
% 12.40/2.51 ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: $i] : ! [v4: $i] : ( ~
% 12.40/2.51 (relation_dom_restriction(v3, v0) = v4) | ~ (relation_dom(v1) = v2) | ~
% 12.40/2.51 $i(v3) | ~ $i(v1) | ~ $i(v0) | ~ function(v3) | ~ function(v1) | ~
% 12.40/2.51 relation(v3) | ~ relation(v1) | ? [v5: $i] : ? [v6: $i] : ? [v7: $i] :
% 12.40/2.51 ? [v8: $i] : ? [v9: $i] : ($i(v7) & ( ~ (v4 = v1) | (v6 = v2 &
% 12.40/2.51 relation_dom(v3) = v5 & set_intersection2(v5, v0) = v2 & $i(v5) &
% 12.40/2.51 $i(v2) & ! [v10: $i] : ! [v11: $i] : ( ~ (apply(v3, v10) = v11) | ~
% 12.40/2.51 $i(v10) | ~ in(v10, v2) | (apply(v1, v10) = v11 & $i(v11))) & !
% 12.40/2.51 [v10: $i] : ! [v11: $i] : ( ~ (apply(v1, v10) = v11) | ~ $i(v10) |
% 12.40/2.51 ~ in(v10, v2) | (apply(v3, v10) = v11 & $i(v11))))) & (v4 = v1 | ( ~
% 12.40/2.51 (v9 = v8) & apply(v3, v7) = v9 & apply(v1, v7) = v8 & $i(v9) & $i(v8)
% 12.40/2.51 & in(v7, v2)) | ( ~ (v6 = v2) & relation_dom(v3) = v5 &
% 12.40/2.51 set_intersection2(v5, v0) = v6 & $i(v6) & $i(v5))))) & ? [v0: $i] :
% 12.40/2.51 ! [v1: $i] : ! [v2: $i] : ! [v3: $i] : ! [v4: $i] : ( ~ (relation_dom(v3) =
% 12.40/2.51 v4) | ~ (relation_dom(v1) = v2) | ~ $i(v3) | ~ $i(v1) | ~ $i(v0) | ~
% 12.40/2.51 function(v3) | ~ function(v1) | ~ relation(v3) | ~ relation(v1) | ? [v5:
% 12.40/2.51 $i] : ? [v6: $i] : ? [v7: $i] : ? [v8: $i] : ? [v9: $i] : ($i(v7) &
% 12.40/2.51 ((v6 = v2 & set_intersection2(v4, v0) = v2 & $i(v2) & ! [v10: $i] : !
% 12.40/2.51 [v11: $i] : ( ~ (apply(v3, v10) = v11) | ~ $i(v10) | ~ in(v10, v2) |
% 12.40/2.51 (apply(v1, v10) = v11 & $i(v11))) & ! [v10: $i] : ! [v11: $i] : (
% 12.40/2.51 ~ (apply(v1, v10) = v11) | ~ $i(v10) | ~ in(v10, v2) | (apply(v3,
% 12.40/2.51 v10) = v11 & $i(v11)))) | ( ~ (v5 = v1) &
% 12.40/2.51 relation_dom_restriction(v3, v0) = v5 & $i(v5))) & ((v5 = v1 &
% 12.40/2.51 relation_dom_restriction(v3, v0) = v1) | ( ~ (v9 = v8) & apply(v3, v7)
% 12.40/2.51 = v9 & apply(v1, v7) = v8 & $i(v9) & $i(v8) & in(v7, v2)) | ( ~ (v6 =
% 12.40/2.51 v2) & set_intersection2(v4, v0) = v6 & $i(v6)))))
% 12.40/2.51
% 12.40/2.51 (t70_funct_1)
% 12.40/2.51 ? [v0: $i] : ? [v1: $i] : ? [v2: $i] : ? [v3: $i] : ? [v4: $i] : ? [v5:
% 12.40/2.51 $i] : ? [v6: $i] : ( ~ (v6 = v5) & apply(v3, v1) = v5 & apply(v2, v1) = v6
% 12.40/2.51 & relation_dom_restriction(v2, v0) = v3 & relation_dom(v3) = v4 & $i(v6) &
% 12.40/2.51 $i(v5) & $i(v4) & $i(v3) & $i(v2) & $i(v1) & $i(v0) & in(v1, v4) &
% 12.40/2.51 function(v2) & relation(v2))
% 12.40/2.51
% 12.40/2.51 (function-axioms)
% 13.01/2.52 ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: $i] : (v1 = v0 | ~
% 13.01/2.52 (apply(v3, v2) = v1) | ~ (apply(v3, v2) = v0)) & ! [v0: $i] : ! [v1: $i]
% 13.01/2.52 : ! [v2: $i] : ! [v3: $i] : (v1 = v0 | ~ (relation_dom_restriction(v3, v2)
% 13.01/2.52 = v1) | ~ (relation_dom_restriction(v3, v2) = v0)) & ! [v0: $i] : !
% 13.01/2.52 [v1: $i] : ! [v2: $i] : ! [v3: $i] : (v1 = v0 | ~ (set_intersection2(v3,
% 13.01/2.52 v2) = v1) | ~ (set_intersection2(v3, v2) = v0)) & ! [v0: $i] : ! [v1:
% 13.01/2.52 $i] : ! [v2: $i] : (v1 = v0 | ~ (relation_dom(v2) = v1) | ~
% 13.01/2.52 (relation_dom(v2) = v0)) & ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : (v1 =
% 13.01/2.52 v0 | ~ (powerset(v2) = v1) | ~ (powerset(v2) = v0))
% 13.01/2.52
% 13.01/2.52 Further assumptions not needed in the proof:
% 13.01/2.52 --------------------------------------------
% 13.01/2.52 antisymmetry_r2_hidden, cc1_funct_1, cc1_relat_1, cc2_funct_1,
% 13.01/2.52 commutativity_k3_xboole_0, existence_m1_subset_1, fc12_relat_1, fc13_relat_1,
% 13.01/2.52 fc1_relat_1, fc1_subset_1, fc1_xboole_0, fc4_relat_1, fc5_relat_1, fc7_relat_1,
% 13.01/2.52 idempotence_k3_xboole_0, rc1_funct_1, rc1_relat_1, rc1_subset_1, rc1_xboole_0,
% 13.01/2.52 rc2_funct_1, rc2_relat_1, rc2_subset_1, rc2_xboole_0, rc3_funct_1, rc3_relat_1,
% 13.01/2.52 reflexivity_r1_tarski, t1_subset, t2_boole, t2_subset, t3_subset, t4_subset,
% 13.01/2.52 t5_subset, t6_boole, t7_boole, t8_boole
% 13.01/2.52
% 13.01/2.52 Those formulas are unsatisfiable:
% 13.01/2.52 ---------------------------------
% 13.01/2.52
% 13.01/2.52 Begin of proof
% 13.01/2.52 |
% 13.01/2.52 | ALPHA: (fc4_funct_1) implies:
% 13.01/2.52 | (1) ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ( ~
% 13.01/2.52 | (relation_dom_restriction(v0, v1) = v2) | ~ $i(v1) | ~ $i(v0) | ~
% 13.01/2.52 | function(v0) | ~ relation(v0) | function(v2))
% 13.01/2.52 |
% 13.01/2.52 | ALPHA: (t68_funct_1) implies:
% 13.01/2.52 | (2) ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: $i] : ! [v4: $i] : (
% 13.01/2.52 | ~ (relation_dom_restriction(v3, v0) = v4) | ~ (relation_dom(v1) =
% 13.01/2.52 | v2) | ~ $i(v3) | ~ $i(v1) | ~ $i(v0) | ~ function(v3) | ~
% 13.01/2.52 | function(v1) | ~ relation(v3) | ~ relation(v1) | ? [v5: $i] : ?
% 13.01/2.52 | [v6: $i] : ? [v7: $i] : ? [v8: $i] : ? [v9: $i] : ($i(v7) & ( ~
% 13.01/2.52 | (v4 = v1) | (v6 = v2 & relation_dom(v3) = v5 &
% 13.01/2.52 | set_intersection2(v5, v0) = v2 & $i(v5) & $i(v2) & ! [v10: $i]
% 13.01/2.52 | : ! [v11: $i] : ( ~ (apply(v3, v10) = v11) | ~ $i(v10) | ~
% 13.01/2.52 | in(v10, v2) | (apply(v1, v10) = v11 & $i(v11))) & ! [v10:
% 13.01/2.52 | $i] : ! [v11: $i] : ( ~ (apply(v1, v10) = v11) | ~ $i(v10)
% 13.01/2.52 | | ~ in(v10, v2) | (apply(v3, v10) = v11 & $i(v11))))) & (v4
% 13.01/2.52 | = v1 | ( ~ (v9 = v8) & apply(v3, v7) = v9 & apply(v1, v7) = v8 &
% 13.01/2.52 | $i(v9) & $i(v8) & in(v7, v2)) | ( ~ (v6 = v2) &
% 13.01/2.52 | relation_dom(v3) = v5 & set_intersection2(v5, v0) = v6 & $i(v6)
% 13.01/2.52 | & $i(v5)))))
% 13.01/2.52 |
% 13.01/2.52 | ALPHA: (function-axioms) implies:
% 13.01/2.52 | (3) ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: $i] : (v1 = v0 | ~
% 13.01/2.52 | (apply(v3, v2) = v1) | ~ (apply(v3, v2) = v0))
% 13.01/2.52 |
% 13.01/2.52 | DELTA: instantiating (t70_funct_1) with fresh symbols all_47_0, all_47_1,
% 13.01/2.52 | all_47_2, all_47_3, all_47_4, all_47_5, all_47_6 gives:
% 13.01/2.52 | (4) ~ (all_47_0 = all_47_1) & apply(all_47_3, all_47_5) = all_47_1 &
% 13.01/2.52 | apply(all_47_4, all_47_5) = all_47_0 &
% 13.01/2.52 | relation_dom_restriction(all_47_4, all_47_6) = all_47_3 &
% 13.01/2.53 | relation_dom(all_47_3) = all_47_2 & $i(all_47_0) & $i(all_47_1) &
% 13.01/2.53 | $i(all_47_2) & $i(all_47_3) & $i(all_47_4) & $i(all_47_5) &
% 13.01/2.53 | $i(all_47_6) & in(all_47_5, all_47_2) & function(all_47_4) &
% 13.01/2.53 | relation(all_47_4)
% 13.01/2.53 |
% 13.01/2.53 | ALPHA: (4) implies:
% 13.01/2.53 | (5) ~ (all_47_0 = all_47_1)
% 13.01/2.53 | (6) relation(all_47_4)
% 13.01/2.53 | (7) function(all_47_4)
% 13.01/2.53 | (8) in(all_47_5, all_47_2)
% 13.01/2.53 | (9) $i(all_47_6)
% 13.01/2.53 | (10) $i(all_47_5)
% 13.01/2.53 | (11) $i(all_47_4)
% 13.01/2.53 | (12) $i(all_47_3)
% 13.01/2.53 | (13) relation_dom(all_47_3) = all_47_2
% 13.01/2.53 | (14) relation_dom_restriction(all_47_4, all_47_6) = all_47_3
% 13.01/2.53 | (15) apply(all_47_4, all_47_5) = all_47_0
% 13.01/2.53 | (16) apply(all_47_3, all_47_5) = all_47_1
% 13.01/2.53 |
% 13.01/2.53 | GROUND_INST: instantiating (3) with all_47_0, all_47_1, all_47_5, all_47_4,
% 13.01/2.53 | simplifying with (15) gives:
% 13.01/2.53 | (17) all_47_0 = all_47_1 | ~ (apply(all_47_4, all_47_5) = all_47_1)
% 13.01/2.53 |
% 13.01/2.53 | GROUND_INST: instantiating (1) with all_47_4, all_47_6, all_47_3, simplifying
% 13.01/2.53 | with (6), (7), (9), (11), (14) gives:
% 13.01/2.53 | (18) function(all_47_3)
% 13.01/2.53 |
% 13.01/2.53 | GROUND_INST: instantiating (dt_k7_relat_1) with all_47_4, all_47_6, all_47_3,
% 13.01/2.53 | simplifying with (6), (9), (11), (14) gives:
% 13.01/2.53 | (19) relation(all_47_3)
% 13.01/2.53 |
% 13.01/2.53 | GROUND_INST: instantiating (2) with all_47_6, all_47_3, all_47_2, all_47_4,
% 13.01/2.53 | all_47_3, simplifying with (6), (7), (9), (11), (12), (13), (14),
% 13.01/2.53 | (18), (19) gives:
% 13.01/2.53 | (20) ? [v0: $i] : ? [v1: $i] : (relation_dom(all_47_4) = v0 &
% 13.01/2.53 | set_intersection2(v0, all_47_6) = all_47_2 & $i(v1) & $i(v0) &
% 13.01/2.53 | $i(all_47_2) & ! [v2: $i] : ! [v3: $i] : ( ~ (apply(all_47_3, v2)
% 13.01/2.53 | = v3) | ~ $i(v2) | ~ in(v2, all_47_2) | (apply(all_47_4, v2) =
% 13.01/2.53 | v3 & $i(v3))) & ! [v2: $i] : ! [v3: $i] : ( ~ (apply(all_47_4,
% 13.01/2.53 | v2) = v3) | ~ $i(v2) | ~ in(v2, all_47_2) | (apply(all_47_3,
% 13.01/2.53 | v2) = v3 & $i(v3))))
% 13.01/2.53 |
% 13.01/2.53 | DELTA: instantiating (20) with fresh symbols all_70_0, all_70_1 gives:
% 13.01/2.53 | (21) relation_dom(all_47_4) = all_70_1 & set_intersection2(all_70_1,
% 13.01/2.53 | all_47_6) = all_47_2 & $i(all_70_0) & $i(all_70_1) & $i(all_47_2) &
% 13.01/2.53 | ! [v0: $i] : ! [v1: $i] : ( ~ (apply(all_47_3, v0) = v1) | ~ $i(v0)
% 13.01/2.53 | | ~ in(v0, all_47_2) | (apply(all_47_4, v0) = v1 & $i(v1))) & !
% 13.01/2.53 | [v0: $i] : ! [v1: $i] : ( ~ (apply(all_47_4, v0) = v1) | ~ $i(v0) |
% 13.01/2.53 | ~ in(v0, all_47_2) | (apply(all_47_3, v0) = v1 & $i(v1)))
% 13.01/2.53 |
% 13.01/2.53 | ALPHA: (21) implies:
% 13.01/2.53 | (22) ! [v0: $i] : ! [v1: $i] : ( ~ (apply(all_47_3, v0) = v1) | ~ $i(v0)
% 13.01/2.53 | | ~ in(v0, all_47_2) | (apply(all_47_4, v0) = v1 & $i(v1)))
% 13.01/2.53 |
% 13.01/2.54 | GROUND_INST: instantiating (22) with all_47_5, all_47_1, simplifying with (8),
% 13.01/2.54 | (10), (16) gives:
% 13.01/2.54 | (23) apply(all_47_4, all_47_5) = all_47_1 & $i(all_47_1)
% 13.01/2.54 |
% 13.01/2.54 | ALPHA: (23) implies:
% 13.01/2.54 | (24) apply(all_47_4, all_47_5) = all_47_1
% 13.01/2.54 |
% 13.01/2.54 | BETA: splitting (17) gives:
% 13.01/2.54 |
% 13.01/2.54 | Case 1:
% 13.01/2.54 | |
% 13.01/2.54 | | (25) ~ (apply(all_47_4, all_47_5) = all_47_1)
% 13.01/2.54 | |
% 13.01/2.54 | | PRED_UNIFY: (24), (25) imply:
% 13.01/2.54 | | (26) $false
% 13.01/2.54 | |
% 13.01/2.54 | | CLOSE: (26) is inconsistent.
% 13.01/2.54 | |
% 13.01/2.54 | Case 2:
% 13.01/2.54 | |
% 13.01/2.54 | | (27) all_47_0 = all_47_1
% 13.01/2.54 | |
% 13.01/2.54 | | REDUCE: (5), (27) imply:
% 13.01/2.54 | | (28) $false
% 13.01/2.54 | |
% 13.01/2.54 | | CLOSE: (28) is inconsistent.
% 13.01/2.54 | |
% 13.01/2.54 | End of split
% 13.01/2.54 |
% 13.01/2.54 End of proof
% 13.01/2.54 % SZS output end Proof for theBenchmark
% 13.01/2.54
% 13.01/2.54 1906ms
%------------------------------------------------------------------------------