TSTP Solution File: SEU203+1 by Princess---230619
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Princess---230619
% Problem : SEU203+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 : n018.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:14 EDT 2023
% Result : Theorem 11.13s 2.37s
% Output : Proof 13.42s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : SEU203+1 : TPTP v8.1.2. Released v3.3.0.
% 0.00/0.14 % Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s
% 0.13/0.36 % Computer : n018.cluster.edu
% 0.13/0.36 % Model : x86_64 x86_64
% 0.13/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.36 % Memory : 8042.1875MB
% 0.13/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.36 % CPULimit : 300
% 0.13/0.36 % WCLimit : 300
% 0.13/0.36 % DateTime : Wed Aug 23 12:43:56 EDT 2023
% 0.13/0.36 % CPUTime :
% 0.20/0.63 ________ _____
% 0.20/0.63 ___ __ \_________(_)________________________________
% 0.20/0.63 __ /_/ /_ ___/_ /__ __ \ ___/ _ \_ ___/_ ___/
% 0.20/0.63 _ ____/_ / _ / _ / / / /__ / __/(__ )_(__ )
% 0.20/0.63 /_/ /_/ /_/ /_/ /_/\___/ \___//____/ /____/
% 0.20/0.63
% 0.20/0.63 A Theorem Prover for First-Order Logic modulo Linear Integer Arithmetic
% 0.20/0.63 (2023-06-19)
% 0.20/0.63
% 0.20/0.63 (c) Philipp Rümmer, 2009-2023
% 0.20/0.63 Contributors: Peter Backeman, Peter Baumgartner, Angelo Brillout, Zafer Esen,
% 0.20/0.63 Amanda Stjerna.
% 0.20/0.63 Free software under BSD-3-Clause.
% 0.20/0.63
% 0.20/0.63 For more information, visit http://www.philipp.ruemmer.org/princess.shtml
% 0.20/0.63
% 0.20/0.63 Loading /export/starexec/sandbox/benchmark/theBenchmark.p ...
% 0.20/0.64 Running up to 7 provers in parallel.
% 0.20/0.66 Prover 2: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMinimalAndEmpty -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1065072994
% 0.20/0.66 Prover 0: Options: +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1042961893
% 0.20/0.66 Prover 1: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1571432423
% 0.20/0.66 Prover 3: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1922548996
% 0.20/0.66 Prover 4: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=1868514696
% 0.20/0.66 Prover 5: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=complete -randomSeed=1259561288
% 0.20/0.66 Prover 6: Options: -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximalOutermost -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1399714365
% 2.58/1.10 Prover 4: Preprocessing ...
% 2.58/1.10 Prover 1: Preprocessing ...
% 2.58/1.14 Prover 0: Preprocessing ...
% 2.58/1.14 Prover 6: Preprocessing ...
% 2.58/1.14 Prover 5: Preprocessing ...
% 2.58/1.14 Prover 3: Preprocessing ...
% 2.58/1.14 Prover 2: Preprocessing ...
% 5.37/1.58 Prover 1: Warning: ignoring some quantifiers
% 6.32/1.62 Prover 3: Warning: ignoring some quantifiers
% 6.32/1.62 Prover 1: Constructing countermodel ...
% 6.32/1.63 Prover 5: Proving ...
% 6.32/1.63 Prover 3: Constructing countermodel ...
% 6.32/1.63 Prover 2: Proving ...
% 6.32/1.64 Prover 6: Proving ...
% 6.32/1.65 Prover 4: Warning: ignoring some quantifiers
% 6.32/1.67 Prover 0: Proving ...
% 6.32/1.68 Prover 4: Constructing countermodel ...
% 10.61/2.21 Prover 3: gave up
% 10.61/2.21 Prover 7: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470
% 10.61/2.26 Prover 7: Preprocessing ...
% 11.13/2.32 Prover 7: Warning: ignoring some quantifiers
% 11.13/2.33 Prover 7: Constructing countermodel ...
% 11.13/2.37 Prover 0: proved (1717ms)
% 11.13/2.37
% 11.13/2.37 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 11.13/2.37
% 11.13/2.37 Prover 8: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089
% 11.13/2.37 Prover 5: stopped
% 11.13/2.37 Prover 2: stopped
% 11.13/2.38 Prover 10: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=919308125
% 11.13/2.38 Prover 6: stopped
% 11.85/2.39 Prover 11: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1509710984
% 11.85/2.39 Prover 8: Preprocessing ...
% 11.85/2.39 Prover 13: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=complete -randomSeed=1138197443
% 11.96/2.39 Prover 10: Preprocessing ...
% 12.14/2.42 Prover 11: Preprocessing ...
% 12.14/2.43 Prover 13: Preprocessing ...
% 12.14/2.46 Prover 8: Warning: ignoring some quantifiers
% 12.14/2.47 Prover 10: Warning: ignoring some quantifiers
% 12.14/2.48 Prover 8: Constructing countermodel ...
% 12.14/2.49 Prover 10: Constructing countermodel ...
% 12.80/2.56 Prover 7: Found proof (size 17)
% 12.80/2.56 Prover 7: proved (355ms)
% 12.80/2.56 Prover 13: Warning: ignoring some quantifiers
% 12.80/2.56 Prover 8: stopped
% 12.80/2.56 Prover 4: stopped
% 12.80/2.57 Prover 10: stopped
% 12.80/2.57 Prover 1: stopped
% 12.80/2.58 Prover 13: Constructing countermodel ...
% 12.80/2.58 Prover 11: Warning: ignoring some quantifiers
% 12.80/2.58 Prover 13: stopped
% 13.42/2.59 Prover 11: Constructing countermodel ...
% 13.42/2.59 Prover 11: stopped
% 13.42/2.59
% 13.42/2.59 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 13.42/2.59
% 13.42/2.60 % SZS output start Proof for theBenchmark
% 13.42/2.60 Assumptions after simplification:
% 13.42/2.60 ---------------------------------
% 13.42/2.60
% 13.42/2.60 (d13_relat_1)
% 13.42/2.63 ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: $i] : ! [v4: $i] : ! [v5:
% 13.42/2.63 $i] : ( ~ (relation_image(v0, v1) = v2) | ~ (ordered_pair(v4, v3) = v5) |
% 13.42/2.63 ~ $i(v4) | ~ $i(v3) | ~ $i(v2) | ~ $i(v1) | ~ $i(v0) | ~ relation(v0) |
% 13.42/2.63 ~ in(v5, v0) | ~ in(v4, v1) | in(v3, v2)) & ! [v0: $i] : ! [v1: $i] : !
% 13.42/2.63 [v2: $i] : ! [v3: $i] : ( ~ (relation_image(v0, v1) = v2) | ~ $i(v3) | ~
% 13.42/2.63 $i(v2) | ~ $i(v1) | ~ $i(v0) | ~ relation(v0) | ~ in(v3, v2) | ? [v4:
% 13.42/2.63 $i] : ? [v5: $i] : (ordered_pair(v4, v3) = v5 & $i(v5) & $i(v4) & in(v5,
% 13.42/2.63 v0) & in(v4, v1))) & ? [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3:
% 13.42/2.63 $i] : (v3 = v0 | ~ (relation_image(v1, v2) = v3) | ~ $i(v2) | ~ $i(v1) |
% 13.42/2.63 ~ $i(v0) | ~ relation(v1) | ? [v4: $i] : ? [v5: $i] : ? [v6: $i] :
% 13.42/2.63 ($i(v5) & $i(v4) & ( ~ in(v4, v0) | ! [v7: $i] : ! [v8: $i] : ( ~
% 13.42/2.63 (ordered_pair(v7, v4) = v8) | ~ $i(v7) | ~ in(v8, v1) | ~ in(v7,
% 13.42/2.63 v2))) & (in(v4, v0) | (ordered_pair(v5, v4) = v6 & $i(v6) & in(v6,
% 13.42/2.63 v1) & in(v5, v2)))))
% 13.42/2.63
% 13.42/2.63 (d4_relat_1)
% 13.42/2.64 ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: $i] : ! [v4: $i] : ( ~
% 13.42/2.64 (relation_dom(v0) = v1) | ~ (ordered_pair(v2, v3) = v4) | ~ $i(v3) | ~
% 13.42/2.64 $i(v2) | ~ $i(v1) | ~ $i(v0) | ~ relation(v0) | ~ in(v4, v0) | in(v2,
% 13.42/2.64 v1)) & ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ( ~ (relation_dom(v0) =
% 13.42/2.64 v1) | ~ $i(v2) | ~ $i(v1) | ~ $i(v0) | ~ relation(v0) | ~ in(v2, v1)
% 13.42/2.64 | ? [v3: $i] : ? [v4: $i] : (ordered_pair(v2, v3) = v4 & $i(v4) & $i(v3) &
% 13.42/2.64 in(v4, v0))) & ? [v0: $i] : ! [v1: $i] : ! [v2: $i] : (v2 = v0 | ~
% 13.42/2.64 (relation_dom(v1) = v2) | ~ $i(v1) | ~ $i(v0) | ~ relation(v1) | ? [v3:
% 13.42/2.64 $i] : ? [v4: $i] : ? [v5: $i] : ($i(v4) & $i(v3) & ( ~ in(v3, v0) | !
% 13.42/2.64 [v6: $i] : ! [v7: $i] : ( ~ (ordered_pair(v3, v6) = v7) | ~ $i(v6) |
% 13.42/2.64 ~ in(v7, v1))) & (in(v3, v0) | (ordered_pair(v3, v4) = v5 & $i(v5) &
% 13.42/2.64 in(v5, v1)))))
% 13.42/2.64
% 13.42/2.64 (t143_relat_1)
% 13.42/2.64 ? [v0: $i] : ? [v1: $i] : ? [v2: $i] : ? [v3: $i] : ? [v4: $i] : ? [v5:
% 13.42/2.64 $i] : ? [v6: $i] : (relation_dom(v2) = v4 & relation_image(v2, v1) = v3 &
% 13.42/2.64 $i(v5) & $i(v4) & $i(v3) & $i(v2) & $i(v1) & $i(v0) & relation(v2) &
% 13.42/2.64 ((ordered_pair(v5, v0) = v6 & $i(v6) & in(v6, v2) & in(v5, v4) & in(v5, v1)
% 13.42/2.64 & ~ in(v0, v3)) | (in(v0, v3) & ! [v7: $i] : ! [v8: $i] : ( ~
% 13.42/2.64 (ordered_pair(v7, v0) = v8) | ~ $i(v7) | ~ in(v8, v2) | ~ in(v7,
% 13.42/2.64 v4) | ~ in(v7, v1)))))
% 13.42/2.64
% 13.42/2.64 Further assumptions not needed in the proof:
% 13.42/2.64 --------------------------------------------
% 13.42/2.64 antisymmetry_r2_hidden, cc1_relat_1, commutativity_k2_tarski, d5_tarski,
% 13.42/2.64 dt_k1_relat_1, dt_k1_tarski, dt_k1_xboole_0, dt_k2_tarski, dt_k4_tarski,
% 13.42/2.64 dt_k9_relat_1, dt_m1_subset_1, existence_m1_subset_1, fc1_xboole_0,
% 13.42/2.64 fc1_zfmisc_1, fc2_subset_1, fc3_subset_1, fc4_relat_1, fc5_relat_1, fc7_relat_1,
% 13.42/2.64 rc1_relat_1, rc1_xboole_0, rc2_relat_1, rc2_xboole_0, t1_subset, t2_subset,
% 13.42/2.64 t6_boole, t7_boole, t8_boole
% 13.42/2.64
% 13.42/2.64 Those formulas are unsatisfiable:
% 13.42/2.64 ---------------------------------
% 13.42/2.64
% 13.42/2.64 Begin of proof
% 13.42/2.64 |
% 13.42/2.64 | ALPHA: (d13_relat_1) implies:
% 13.42/2.65 | (1) ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: $i] : ( ~
% 13.42/2.65 | (relation_image(v0, v1) = v2) | ~ $i(v3) | ~ $i(v2) | ~ $i(v1) |
% 13.42/2.65 | ~ $i(v0) | ~ relation(v0) | ~ in(v3, v2) | ? [v4: $i] : ? [v5:
% 13.42/2.65 | $i] : (ordered_pair(v4, v3) = v5 & $i(v5) & $i(v4) & in(v5, v0) &
% 13.42/2.65 | in(v4, v1)))
% 13.42/2.65 | (2) ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: $i] : ! [v4: $i] :
% 13.42/2.65 | ! [v5: $i] : ( ~ (relation_image(v0, v1) = v2) | ~ (ordered_pair(v4,
% 13.42/2.65 | v3) = v5) | ~ $i(v4) | ~ $i(v3) | ~ $i(v2) | ~ $i(v1) | ~
% 13.42/2.65 | $i(v0) | ~ relation(v0) | ~ in(v5, v0) | ~ in(v4, v1) | in(v3,
% 13.42/2.65 | v2))
% 13.42/2.65 |
% 13.42/2.65 | ALPHA: (d4_relat_1) implies:
% 13.42/2.65 | (3) ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: $i] : ! [v4: $i] : (
% 13.42/2.65 | ~ (relation_dom(v0) = v1) | ~ (ordered_pair(v2, v3) = v4) | ~
% 13.42/2.65 | $i(v3) | ~ $i(v2) | ~ $i(v1) | ~ $i(v0) | ~ relation(v0) | ~
% 13.42/2.65 | in(v4, v0) | in(v2, v1))
% 13.42/2.65 |
% 13.42/2.65 | DELTA: instantiating (t143_relat_1) with fresh symbols all_33_0, all_33_1,
% 13.42/2.65 | all_33_2, all_33_3, all_33_4, all_33_5, all_33_6 gives:
% 13.42/2.65 | (4) relation_dom(all_33_4) = all_33_2 & relation_image(all_33_4, all_33_5)
% 13.42/2.65 | = all_33_3 & $i(all_33_1) & $i(all_33_2) & $i(all_33_3) & $i(all_33_4)
% 13.42/2.65 | & $i(all_33_5) & $i(all_33_6) & relation(all_33_4) &
% 13.42/2.65 | ((ordered_pair(all_33_1, all_33_6) = all_33_0 & $i(all_33_0) &
% 13.42/2.65 | in(all_33_0, all_33_4) & in(all_33_1, all_33_2) & in(all_33_1,
% 13.42/2.65 | all_33_5) & ~ in(all_33_6, all_33_3)) | (in(all_33_6, all_33_3)
% 13.42/2.65 | & ! [v0: $i] : ! [v1: $i] : ( ~ (ordered_pair(v0, all_33_6) = v1)
% 13.42/2.65 | | ~ $i(v0) | ~ in(v1, all_33_4) | ~ in(v0, all_33_2) | ~
% 13.42/2.65 | in(v0, all_33_5))))
% 13.42/2.65 |
% 13.42/2.65 | ALPHA: (4) implies:
% 13.42/2.65 | (5) relation(all_33_4)
% 13.42/2.65 | (6) $i(all_33_6)
% 13.42/2.65 | (7) $i(all_33_5)
% 13.42/2.65 | (8) $i(all_33_4)
% 13.42/2.65 | (9) $i(all_33_3)
% 13.42/2.65 | (10) $i(all_33_2)
% 13.42/2.65 | (11) $i(all_33_1)
% 13.42/2.65 | (12) relation_image(all_33_4, all_33_5) = all_33_3
% 13.42/2.65 | (13) relation_dom(all_33_4) = all_33_2
% 13.42/2.65 | (14) (ordered_pair(all_33_1, all_33_6) = all_33_0 & $i(all_33_0) &
% 13.42/2.65 | in(all_33_0, all_33_4) & in(all_33_1, all_33_2) & in(all_33_1,
% 13.42/2.65 | all_33_5) & ~ in(all_33_6, all_33_3)) | (in(all_33_6, all_33_3) &
% 13.42/2.65 | ! [v0: $i] : ! [v1: $i] : ( ~ (ordered_pair(v0, all_33_6) = v1) |
% 13.42/2.65 | ~ $i(v0) | ~ in(v1, all_33_4) | ~ in(v0, all_33_2) | ~ in(v0,
% 13.42/2.65 | all_33_5)))
% 13.42/2.65 |
% 13.42/2.65 | BETA: splitting (14) gives:
% 13.42/2.65 |
% 13.42/2.65 | Case 1:
% 13.42/2.65 | |
% 13.42/2.65 | | (15) ordered_pair(all_33_1, all_33_6) = all_33_0 & $i(all_33_0) &
% 13.42/2.65 | | in(all_33_0, all_33_4) & in(all_33_1, all_33_2) & in(all_33_1,
% 13.42/2.65 | | all_33_5) & ~ in(all_33_6, all_33_3)
% 13.42/2.65 | |
% 13.42/2.65 | | ALPHA: (15) implies:
% 13.42/2.65 | | (16) ~ in(all_33_6, all_33_3)
% 13.42/2.66 | | (17) in(all_33_1, all_33_5)
% 13.42/2.66 | | (18) in(all_33_0, all_33_4)
% 13.42/2.66 | | (19) ordered_pair(all_33_1, all_33_6) = all_33_0
% 13.42/2.66 | |
% 13.42/2.66 | | GROUND_INST: instantiating (2) with all_33_4, all_33_5, all_33_3, all_33_6,
% 13.42/2.66 | | all_33_1, all_33_0, simplifying with (5), (6), (7), (8), (9),
% 13.42/2.66 | | (11), (12), (16), (17), (18), (19) gives:
% 13.42/2.66 | | (20) $false
% 13.42/2.66 | |
% 13.42/2.66 | | CLOSE: (20) is inconsistent.
% 13.42/2.66 | |
% 13.42/2.66 | Case 2:
% 13.42/2.66 | |
% 13.42/2.66 | | (21) in(all_33_6, all_33_3) & ! [v0: $i] : ! [v1: $i] : ( ~
% 13.42/2.66 | | (ordered_pair(v0, all_33_6) = v1) | ~ $i(v0) | ~ in(v1,
% 13.42/2.66 | | all_33_4) | ~ in(v0, all_33_2) | ~ in(v0, all_33_5))
% 13.42/2.66 | |
% 13.42/2.66 | | ALPHA: (21) implies:
% 13.42/2.66 | | (22) in(all_33_6, all_33_3)
% 13.42/2.66 | | (23) ! [v0: $i] : ! [v1: $i] : ( ~ (ordered_pair(v0, all_33_6) = v1) |
% 13.42/2.66 | | ~ $i(v0) | ~ in(v1, all_33_4) | ~ in(v0, all_33_2) | ~ in(v0,
% 13.42/2.66 | | all_33_5))
% 13.42/2.66 | |
% 13.42/2.66 | | GROUND_INST: instantiating (1) with all_33_4, all_33_5, all_33_3, all_33_6,
% 13.42/2.66 | | simplifying with (5), (6), (7), (8), (9), (12), (22) gives:
% 13.42/2.66 | | (24) ? [v0: $i] : ? [v1: $i] : (ordered_pair(v0, all_33_6) = v1 &
% 13.42/2.66 | | $i(v1) & $i(v0) & in(v1, all_33_4) & in(v0, all_33_5))
% 13.42/2.66 | |
% 13.42/2.66 | | DELTA: instantiating (24) with fresh symbols all_70_0, all_70_1 gives:
% 13.42/2.66 | | (25) ordered_pair(all_70_1, all_33_6) = all_70_0 & $i(all_70_0) &
% 13.42/2.66 | | $i(all_70_1) & in(all_70_0, all_33_4) & in(all_70_1, all_33_5)
% 13.42/2.66 | |
% 13.42/2.66 | | ALPHA: (25) implies:
% 13.42/2.66 | | (26) in(all_70_1, all_33_5)
% 13.42/2.66 | | (27) in(all_70_0, all_33_4)
% 13.42/2.66 | | (28) $i(all_70_1)
% 13.42/2.66 | | (29) ordered_pair(all_70_1, all_33_6) = all_70_0
% 13.42/2.66 | |
% 13.42/2.66 | | GROUND_INST: instantiating (3) with all_33_4, all_33_2, all_70_1, all_33_6,
% 13.42/2.66 | | all_70_0, simplifying with (5), (6), (8), (10), (13), (27),
% 13.42/2.66 | | (28), (29) gives:
% 13.42/2.66 | | (30) in(all_70_1, all_33_2)
% 13.42/2.66 | |
% 13.42/2.66 | | GROUND_INST: instantiating (23) with all_70_1, all_70_0, simplifying with
% 13.42/2.66 | | (26), (27), (28), (29) gives:
% 13.42/2.66 | | (31) ~ in(all_70_1, all_33_2)
% 13.42/2.66 | |
% 13.42/2.66 | | PRED_UNIFY: (30), (31) imply:
% 13.42/2.66 | | (32) $false
% 13.42/2.66 | |
% 13.42/2.66 | | CLOSE: (32) is inconsistent.
% 13.42/2.66 | |
% 13.42/2.66 | End of split
% 13.42/2.66 |
% 13.42/2.66 End of proof
% 13.42/2.66 % SZS output end Proof for theBenchmark
% 13.42/2.66
% 13.42/2.66 2032ms
%------------------------------------------------------------------------------