%------------------------------------------------------------------------------ % File : ePrincess---1.0 % Problem : SET578+3 : TPTP v8.1.0. Released v2.2.0. % Transfm : none % Format : tptp:raw % Command : ePrincess-casc -timeout=%d %s % Computer : n007.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 : 600s % DateTime : Tue Jul 19 00:20:23 EDT 2022 % Result : Theorem 11.07s 3.23s % Output : Proof 14.77s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.09/0.12 % Problem : SET578+3 : TPTP v8.1.0. Released v2.2.0. % 0.09/0.12 % Command : ePrincess-casc -timeout=%d %s % 0.12/0.33 % Computer : n007.cluster.edu % 0.12/0.33 % Model : x86_64 x86_64 % 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.12/0.33 % Memory : 8042.1875MB % 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64 % 0.12/0.33 % CPULimit : 300 % 0.12/0.33 % WCLimit : 600 % 0.12/0.33 % DateTime : Sun Jul 10 04:53:31 EDT 2022 % 0.12/0.33 % CPUTime : % 0.18/0.58 ____ _ % 0.18/0.58 ___ / __ \_____(_)___ ________ __________ % 0.18/0.58 / _ \/ /_/ / ___/ / __ \/ ___/ _ \/ ___/ ___/ % 0.18/0.58 / __/ ____/ / / / / / / /__/ __(__ |__ ) % 0.18/0.58 \___/_/ /_/ /_/_/ /_/\___/\___/____/____/ % 0.18/0.58 % 0.18/0.58 A Theorem Prover for First-Order Logic % 0.18/0.58 (ePrincess v.1.0) % 0.18/0.58 % 0.18/0.58 (c) Philipp Rümmer, 2009-2015 % 0.18/0.58 (c) Peter Backeman, 2014-2015 % 0.18/0.58 (contributions by Angelo Brillout, Peter Baumgartner) % 0.18/0.58 Free software under GNU Lesser General Public License (LGPL). % 0.18/0.58 Bug reports to peter@backeman.se % 0.18/0.58 % 0.18/0.58 For more information, visit http://user.uu.se/~petba168/breu/ % 0.18/0.58 % 0.18/0.58 Loading /export/starexec/sandbox/benchmark/theBenchmark.p ... % 0.67/0.63 Prover 0: Options: -triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -resolutionMethod=nonUnifying +ignoreQuantifiers -generateTriggers=all % 1.32/0.89 Prover 0: Preprocessing ... % 1.67/1.04 Prover 0: Warning: ignoring some quantifiers % 1.67/1.06 Prover 0: Constructing countermodel ... % 2.18/1.18 Prover 0: gave up % 2.18/1.18 Prover 1: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -resolutionMethod=normal +ignoreQuantifiers -generateTriggers=all % 2.18/1.20 Prover 1: Preprocessing ... % 2.42/1.27 Prover 1: Warning: ignoring some quantifiers % 2.42/1.28 Prover 1: Constructing countermodel ... % 2.42/1.31 Prover 1: gave up % 2.42/1.31 Prover 2: Options: +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -resolutionMethod=nonUnifying +ignoreQuantifiers -generateTriggers=all % 2.42/1.32 Prover 2: Preprocessing ... % 3.00/1.41 Prover 2: Warning: ignoring some quantifiers % 3.00/1.41 Prover 2: Constructing countermodel ... % 3.29/1.46 Prover 2: gave up % 3.29/1.46 Prover 3: Options: -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -resolutionMethod=nonUnifying +ignoreQuantifiers -generateTriggers=all % 3.29/1.47 Prover 3: Preprocessing ... % 3.29/1.49 Prover 3: Warning: ignoring some quantifiers % 3.29/1.50 Prover 3: Constructing countermodel ... % 3.53/1.53 Prover 3: gave up % 3.53/1.53 Prover 4: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -resolutionMethod=nonUnifying +ignoreQuantifiers -generateTriggers=complete % 3.53/1.54 Prover 4: Preprocessing ... % 3.69/1.62 Prover 4: Warning: ignoring some quantifiers % 3.69/1.62 Prover 4: Constructing countermodel ... % 5.37/1.96 Prover 4: gave up % 5.37/1.96 Prover 5: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allMinimal -resolutionMethod=nonUnifying +ignoreQuantifiers -generateTriggers=all % 5.37/1.96 Prover 5: Preprocessing ... % 5.60/2.00 Prover 5: Warning: ignoring some quantifiers % 5.60/2.01 Prover 5: Constructing countermodel ... % 5.60/2.03 Prover 5: gave up % 5.60/2.03 Prover 6: Options: +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -resolutionMethod=normal +ignoreQuantifiers -generateTriggers=all % 5.60/2.04 Prover 6: Preprocessing ... % 5.94/2.07 Prover 6: Warning: ignoring some quantifiers % 5.94/2.07 Prover 6: Constructing countermodel ... % 6.07/2.09 Prover 6: gave up % 6.07/2.09 Prover 7: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximalOutermost -resolutionMethod=normal -ignoreQuantifiers -generateTriggers=all % 6.07/2.10 Prover 7: Preprocessing ... % 6.07/2.11 Prover 7: Proving ... % 11.07/3.23 Prover 7: proved (1142ms) % 11.07/3.23 % 11.07/3.23 % SZS status Theorem for theBenchmark % 11.07/3.23 % 11.07/3.23 Generating proof ... found it (size 60) % 14.47/4.07 % 14.47/4.07 % SZS output start Proof for theBenchmark % 14.47/4.07 Assumed formulas after preprocessing and simplification: % 14.47/4.07 | (0) ! [v0] : ! [v1] : ! [v2] : ! [v3] : (v1 = v0 | ~ (intersection(v3, v2) = v1) | ~ (intersection(v3, v2) = v0)) & ! [v0] : ! [v1] : ! [v2] : ! [v3] : ( ~ (intersection(v0, v1) = v3) | ~ member(v2, v3) | (member(v2, v1) & member(v2, v0))) & ! [v0] : ! [v1] : ! [v2] : ! [v3] : ( ~ (intersection(v0, v1) = v3) | ~ member(v2, v1) | ~ member(v2, v0) | member(v2, v3)) & ! [v0] : ! [v1] : ! [v2] : ( ~ (intersection(v0, v1) = v2) | intersection(v1, v0) = v2) & ! [v0] : ! [v1] : (v1 = v0 | ~ subset(v1, v0) | ~ subset(v0, v1)) & ! [v0] : ! [v1] : (v1 = v0 | ? [v2] : (( ~ member(v2, v1) | ~ member(v2, v0)) & (member(v2, v1) | member(v2, v0)))) & ! [v0] : ! [v1] : ( ~ subset(v0, v1) | ! [v2] : ( ~ member(v2, v0) | member(v2, v1))) & ! [v0] : ! [v1] : (subset(v0, v1) | ? [v2] : (member(v2, v0) & ~ member(v2, v1))) & ! [v0] : subset(v0, v0) & ? [v0] : ? [v1] : ? [v2] : ? [v3] : ( ~ (v3 = v0) & intersection(v1, v2) = v3 & ! [v4] : ( ~ member(v4, v2) | ~ member(v4, v1) | member(v4, v0)) & ! [v4] : ( ~ member(v4, v0) | (member(v4, v2) & member(v4, v1)))) % 14.47/4.09 | Applying alpha-rule on (0) yields: % 14.47/4.09 | (1) ! [v0] : ! [v1] : (v1 = v0 | ? [v2] : (( ~ member(v2, v1) | ~ member(v2, v0)) & (member(v2, v1) | member(v2, v0)))) % 14.47/4.09 | (2) ! [v0] : subset(v0, v0) % 14.47/4.09 | (3) ! [v0] : ! [v1] : (subset(v0, v1) | ? [v2] : (member(v2, v0) & ~ member(v2, v1))) % 14.47/4.09 | (4) ! [v0] : ! [v1] : ! [v2] : ! [v3] : ( ~ (intersection(v0, v1) = v3) | ~ member(v2, v1) | ~ member(v2, v0) | member(v2, v3)) % 14.47/4.09 | (5) ! [v0] : ! [v1] : ! [v2] : ( ~ (intersection(v0, v1) = v2) | intersection(v1, v0) = v2) % 14.47/4.09 | (6) ? [v0] : ? [v1] : ? [v2] : ? [v3] : ( ~ (v3 = v0) & intersection(v1, v2) = v3 & ! [v4] : ( ~ member(v4, v2) | ~ member(v4, v1) | member(v4, v0)) & ! [v4] : ( ~ member(v4, v0) | (member(v4, v2) & member(v4, v1)))) % 14.47/4.09 | (7) ! [v0] : ! [v1] : ( ~ subset(v0, v1) | ! [v2] : ( ~ member(v2, v0) | member(v2, v1))) % 14.47/4.10 | (8) ! [v0] : ! [v1] : ! [v2] : ! [v3] : ( ~ (intersection(v0, v1) = v3) | ~ member(v2, v3) | (member(v2, v1) & member(v2, v0))) % 14.47/4.10 | (9) ! [v0] : ! [v1] : ! [v2] : ! [v3] : (v1 = v0 | ~ (intersection(v3, v2) = v1) | ~ (intersection(v3, v2) = v0)) % 14.47/4.10 | (10) ! [v0] : ! [v1] : (v1 = v0 | ~ subset(v1, v0) | ~ subset(v0, v1)) % 14.47/4.10 | % 14.47/4.10 | Instantiating (6) with all_1_0_0, all_1_1_1, all_1_2_2, all_1_3_3 yields: % 14.47/4.10 | (11) ~ (all_1_0_0 = all_1_3_3) & intersection(all_1_2_2, all_1_1_1) = all_1_0_0 & ! [v0] : ( ~ member(v0, all_1_1_1) | ~ member(v0, all_1_2_2) | member(v0, all_1_3_3)) & ! [v0] : ( ~ member(v0, all_1_3_3) | (member(v0, all_1_1_1) & member(v0, all_1_2_2))) % 14.47/4.10 | % 14.47/4.10 | Applying alpha-rule on (11) yields: % 14.47/4.10 | (12) ~ (all_1_0_0 = all_1_3_3) % 14.47/4.10 | (13) intersection(all_1_2_2, all_1_1_1) = all_1_0_0 % 14.47/4.10 | (14) ! [v0] : ( ~ member(v0, all_1_1_1) | ~ member(v0, all_1_2_2) | member(v0, all_1_3_3)) % 14.47/4.10 | (15) ! [v0] : ( ~ member(v0, all_1_3_3) | (member(v0, all_1_1_1) & member(v0, all_1_2_2))) % 14.47/4.10 | % 14.47/4.10 | Introducing new symbol ex_16_1_5 defined by: % 14.47/4.10 | (16) ex_16_1_5 = all_1_0_0 % 14.47/4.10 | % 14.47/4.10 | Introducing new symbol ex_16_0_4 defined by: % 14.47/4.10 | (17) ex_16_0_4 = all_1_3_3 % 14.47/4.10 | % 14.47/4.10 | Instantiating formula (1) with ex_16_0_4, ex_16_1_5 yields: % 14.47/4.10 | (18) ex_16_0_4 = ex_16_1_5 | ? [v0] : (( ~ member(v0, ex_16_0_4) | ~ member(v0, ex_16_1_5)) & (member(v0, ex_16_0_4) | member(v0, ex_16_1_5))) % 14.47/4.10 | % 14.47/4.10 +-Applying beta-rule and splitting (18), into two cases. % 14.47/4.10 |-Branch one: % 14.47/4.10 | (19) ex_16_0_4 = ex_16_1_5 % 14.47/4.10 | % 14.47/4.10 | Combining equations (17,19) yields a new equation: % 14.47/4.10 | (20) ex_16_1_5 = all_1_3_3 % 14.47/4.10 | % 14.47/4.10 | Combining equations (20,16) yields a new equation: % 14.47/4.10 | (21) all_1_0_0 = all_1_3_3 % 14.47/4.10 | % 14.47/4.10 | Equations (21) can reduce 12 to: % 14.47/4.10 | (22) $false % 14.47/4.10 | % 14.47/4.10 |-The branch is then unsatisfiable % 14.47/4.10 |-Branch two: % 14.47/4.10 | (23) ? [v0] : (( ~ member(v0, ex_16_0_4) | ~ member(v0, ex_16_1_5)) & (member(v0, ex_16_0_4) | member(v0, ex_16_1_5))) % 14.47/4.10 | % 14.47/4.10 | Instantiating (23) with all_19_0_6 yields: % 14.47/4.10 | (24) ( ~ member(all_19_0_6, ex_16_0_4) | ~ member(all_19_0_6, ex_16_1_5)) & (member(all_19_0_6, ex_16_0_4) | member(all_19_0_6, ex_16_1_5)) % 14.47/4.10 | % 14.47/4.10 | Applying alpha-rule on (24) yields: % 14.47/4.10 | (25) ~ member(all_19_0_6, ex_16_0_4) | ~ member(all_19_0_6, ex_16_1_5) % 14.47/4.10 | (26) member(all_19_0_6, ex_16_0_4) | member(all_19_0_6, ex_16_1_5) % 14.47/4.10 | % 14.47/4.10 +-Applying beta-rule and splitting (26), into two cases. % 14.47/4.10 |-Branch one: % 14.47/4.10 | (27) member(all_19_0_6, ex_16_0_4) % 14.47/4.10 | % 14.47/4.10 +-Applying beta-rule and splitting (25), into two cases. % 14.47/4.10 |-Branch one: % 14.47/4.10 | (28) ~ member(all_19_0_6, ex_16_0_4) % 14.47/4.10 | % 14.47/4.10 | Using (27) and (28) yields: % 14.47/4.10 | (29) $false % 14.47/4.10 | % 14.47/4.10 |-The branch is then unsatisfiable % 14.47/4.10 |-Branch two: % 14.47/4.10 | (30) ~ member(all_19_0_6, ex_16_1_5) % 14.47/4.10 | % 14.47/4.10 | Instantiating formula (14) with all_19_0_6 yields: % 14.47/4.10 | (31) ~ member(all_19_0_6, all_1_1_1) | ~ member(all_19_0_6, all_1_2_2) | member(all_19_0_6, all_1_3_3) % 14.47/4.10 | % 14.47/4.10 | Instantiating formula (15) with all_19_0_6 yields: % 14.47/4.10 | (32) ~ member(all_19_0_6, all_1_3_3) | (member(all_19_0_6, all_1_1_1) & member(all_19_0_6, all_1_2_2)) % 14.47/4.10 | % 14.47/4.10 +-Applying beta-rule and splitting (31), into two cases. % 14.47/4.10 |-Branch one: % 14.47/4.10 | (33) ~ member(all_19_0_6, all_1_1_1) % 14.47/4.10 | % 14.47/4.10 +-Applying beta-rule and splitting (32), into two cases. % 14.47/4.10 |-Branch one: % 14.47/4.10 | (34) ~ member(all_19_0_6, all_1_3_3) % 14.47/4.10 | % 14.47/4.10 | From (17) and (27) follows: % 14.47/4.10 | (35) member(all_19_0_6, all_1_3_3) % 14.47/4.10 | % 14.47/4.10 | Using (35) and (34) yields: % 14.47/4.10 | (29) $false % 14.47/4.10 | % 14.47/4.10 |-The branch is then unsatisfiable % 14.47/4.10 |-Branch two: % 14.47/4.10 | (37) member(all_19_0_6, all_1_1_1) & member(all_19_0_6, all_1_2_2) % 14.47/4.10 | % 14.47/4.10 | Applying alpha-rule on (37) yields: % 14.47/4.10 | (38) member(all_19_0_6, all_1_1_1) % 14.47/4.10 | (39) member(all_19_0_6, all_1_2_2) % 14.47/4.10 | % 14.47/4.10 | Using (38) and (33) yields: % 14.47/4.10 | (29) $false % 14.47/4.10 | % 14.47/4.10 |-The branch is then unsatisfiable % 14.47/4.10 |-Branch two: % 14.47/4.10 | (38) member(all_19_0_6, all_1_1_1) % 14.47/4.11 | (42) ~ member(all_19_0_6, all_1_2_2) | member(all_19_0_6, all_1_3_3) % 14.47/4.11 | % 14.47/4.11 +-Applying beta-rule and splitting (42), into two cases. % 14.47/4.11 |-Branch one: % 14.47/4.11 | (43) ~ member(all_19_0_6, all_1_2_2) % 14.47/4.11 | % 14.47/4.11 +-Applying beta-rule and splitting (32), into two cases. % 14.47/4.11 |-Branch one: % 14.47/4.11 | (34) ~ member(all_19_0_6, all_1_3_3) % 14.47/4.11 | % 14.47/4.11 | From (17) and (27) follows: % 14.47/4.11 | (35) member(all_19_0_6, all_1_3_3) % 14.47/4.11 | % 14.47/4.11 | Using (35) and (34) yields: % 14.47/4.11 | (29) $false % 14.47/4.11 | % 14.47/4.11 |-The branch is then unsatisfiable % 14.47/4.11 |-Branch two: % 14.47/4.11 | (37) member(all_19_0_6, all_1_1_1) & member(all_19_0_6, all_1_2_2) % 14.47/4.11 | % 14.47/4.11 | Applying alpha-rule on (37) yields: % 14.47/4.11 | (38) member(all_19_0_6, all_1_1_1) % 14.47/4.11 | (39) member(all_19_0_6, all_1_2_2) % 14.47/4.11 | % 14.47/4.11 | Using (39) and (43) yields: % 14.47/4.11 | (29) $false % 14.47/4.11 | % 14.47/4.11 |-The branch is then unsatisfiable % 14.47/4.11 |-Branch two: % 14.47/4.11 | (39) member(all_19_0_6, all_1_2_2) % 14.47/4.11 | (35) member(all_19_0_6, all_1_3_3) % 14.77/4.11 | % 14.77/4.11 | Instantiating formula (4) with all_1_0_0, all_19_0_6, all_1_1_1, all_1_2_2 and discharging atoms intersection(all_1_2_2, all_1_1_1) = all_1_0_0, member(all_19_0_6, all_1_1_1), member(all_19_0_6, all_1_2_2), yields: % 14.77/4.11 | (53) member(all_19_0_6, all_1_0_0) % 14.77/4.11 | % 14.77/4.11 | From (16) and (30) follows: % 14.77/4.11 | (54) ~ member(all_19_0_6, all_1_0_0) % 14.77/4.11 | % 14.77/4.11 | Using (53) and (54) yields: % 14.77/4.11 | (29) $false % 14.77/4.11 | % 14.77/4.11 |-The branch is then unsatisfiable % 14.77/4.11 |-Branch two: % 14.77/4.11 | (28) ~ member(all_19_0_6, ex_16_0_4) % 14.77/4.11 | (57) member(all_19_0_6, ex_16_1_5) % 14.77/4.11 | % 14.77/4.11 | Instantiating formula (8) with all_1_0_0, all_19_0_6, all_1_1_1, all_1_2_2 and discharging atoms intersection(all_1_2_2, all_1_1_1) = all_1_0_0, yields: % 14.77/4.11 | (58) ~ member(all_19_0_6, all_1_0_0) | (member(all_19_0_6, all_1_1_1) & member(all_19_0_6, all_1_2_2)) % 14.77/4.11 | % 14.77/4.11 | Instantiating formula (14) with all_19_0_6 yields: % 14.77/4.11 | (31) ~ member(all_19_0_6, all_1_1_1) | ~ member(all_19_0_6, all_1_2_2) | member(all_19_0_6, all_1_3_3) % 14.77/4.11 | % 14.77/4.11 +-Applying beta-rule and splitting (31), into two cases. % 14.77/4.11 |-Branch one: % 14.77/4.11 | (33) ~ member(all_19_0_6, all_1_1_1) % 14.77/4.11 | % 14.77/4.11 +-Applying beta-rule and splitting (58), into two cases. % 14.77/4.11 |-Branch one: % 14.77/4.11 | (54) ~ member(all_19_0_6, all_1_0_0) % 14.77/4.11 | % 14.77/4.11 | From (16) and (57) follows: % 14.77/4.11 | (53) member(all_19_0_6, all_1_0_0) % 14.77/4.11 | % 14.77/4.11 | Using (53) and (54) yields: % 14.77/4.11 | (29) $false % 14.77/4.11 | % 14.77/4.11 |-The branch is then unsatisfiable % 14.77/4.11 |-Branch two: % 14.77/4.11 | (37) member(all_19_0_6, all_1_1_1) & member(all_19_0_6, all_1_2_2) % 14.77/4.11 | % 14.77/4.11 | Applying alpha-rule on (37) yields: % 14.77/4.11 | (38) member(all_19_0_6, all_1_1_1) % 14.77/4.11 | (39) member(all_19_0_6, all_1_2_2) % 14.77/4.11 | % 14.77/4.11 | Using (38) and (33) yields: % 14.77/4.11 | (29) $false % 14.77/4.11 | % 14.77/4.11 |-The branch is then unsatisfiable % 14.77/4.11 |-Branch two: % 14.77/4.11 | (42) ~ member(all_19_0_6, all_1_2_2) | member(all_19_0_6, all_1_3_3) % 14.77/4.11 | % 14.77/4.11 +-Applying beta-rule and splitting (42), into two cases. % 14.77/4.11 |-Branch one: % 14.77/4.11 | (43) ~ member(all_19_0_6, all_1_2_2) % 14.77/4.11 | % 14.77/4.11 +-Applying beta-rule and splitting (58), into two cases. % 14.77/4.11 |-Branch one: % 14.77/4.11 | (54) ~ member(all_19_0_6, all_1_0_0) % 14.77/4.11 | % 14.77/4.11 | From (16) and (57) follows: % 14.77/4.11 | (53) member(all_19_0_6, all_1_0_0) % 14.77/4.11 | % 14.77/4.11 | Using (53) and (54) yields: % 14.77/4.11 | (29) $false % 14.77/4.11 | % 14.77/4.11 |-The branch is then unsatisfiable % 14.77/4.11 |-Branch two: % 14.77/4.11 | (37) member(all_19_0_6, all_1_1_1) & member(all_19_0_6, all_1_2_2) % 14.77/4.11 | % 14.77/4.11 | Applying alpha-rule on (37) yields: % 14.77/4.11 | (38) member(all_19_0_6, all_1_1_1) % 14.77/4.11 | (39) member(all_19_0_6, all_1_2_2) % 14.77/4.11 | % 14.77/4.11 | Using (39) and (43) yields: % 14.77/4.11 | (29) $false % 14.77/4.11 | % 14.77/4.11 |-The branch is then unsatisfiable % 14.77/4.11 |-Branch two: % 14.77/4.11 | (35) member(all_19_0_6, all_1_3_3) % 14.77/4.11 | % 14.77/4.11 | From (17) and (28) follows: % 14.77/4.11 | (34) ~ member(all_19_0_6, all_1_3_3) % 14.77/4.11 | % 14.77/4.11 | Using (35) and (34) yields: % 14.77/4.11 | (29) $false % 14.77/4.11 | % 14.77/4.11 |-The branch is then unsatisfiable % 14.77/4.11 % SZS output end Proof for theBenchmark % 14.77/4.11 % 14.77/4.11 3524ms %------------------------------------------------------------------------------