%------------------------------------------------------------------------------ % File : ePrincess---1.0 % Problem : SET985+1 : TPTP v8.1.0. Released v3.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:23:37 EDT 2022 % Result : Theorem 2.74s 1.37s % Output : Proof 3.81s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.10/0.12 % Problem : SET985+1 : TPTP v8.1.0. Released v3.2.0. % 0.10/0.12 % Command : ePrincess-casc -timeout=%d %s % 0.12/0.34 % Computer : n007.cluster.edu % 0.12/0.34 % Model : x86_64 x86_64 % 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.12/0.34 % Memory : 8042.1875MB % 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64 % 0.12/0.34 % CPULimit : 300 % 0.12/0.34 % WCLimit : 600 % 0.12/0.34 % DateTime : Mon Jul 11 06:05:47 EDT 2022 % 0.12/0.34 % CPUTime : % 0.59/0.59 ____ _ % 0.59/0.59 ___ / __ \_____(_)___ ________ __________ % 0.59/0.59 / _ \/ /_/ / ___/ / __ \/ ___/ _ \/ ___/ ___/ % 0.59/0.59 / __/ ____/ / / / / / / /__/ __(__ |__ ) % 0.59/0.59 \___/_/ /_/ /_/_/ /_/\___/\___/____/____/ % 0.59/0.59 % 0.59/0.59 A Theorem Prover for First-Order Logic % 0.59/0.59 (ePrincess v.1.0) % 0.59/0.59 % 0.59/0.59 (c) Philipp Rümmer, 2009-2015 % 0.59/0.59 (c) Peter Backeman, 2014-2015 % 0.59/0.59 (contributions by Angelo Brillout, Peter Baumgartner) % 0.59/0.59 Free software under GNU Lesser General Public License (LGPL). % 0.59/0.59 Bug reports to peter@backeman.se % 0.59/0.59 % 0.59/0.59 For more information, visit http://user.uu.se/~petba168/breu/ % 0.59/0.59 % 0.59/0.59 Loading /export/starexec/sandbox/benchmark/theBenchmark.p ... % 0.69/0.67 Prover 0: Options: -triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -resolutionMethod=nonUnifying +ignoreQuantifiers -generateTriggers=all % 1.37/0.90 Prover 0: Preprocessing ... % 1.43/1.02 Prover 0: Warning: ignoring some quantifiers % 1.67/1.03 Prover 0: Constructing countermodel ... % 2.17/1.23 Prover 0: gave up % 2.17/1.23 Prover 1: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -resolutionMethod=normal +ignoreQuantifiers -generateTriggers=all % 2.17/1.24 Prover 1: Preprocessing ... % 2.59/1.29 Prover 1: Constructing countermodel ... % 2.74/1.37 Prover 1: proved (141ms) % 2.74/1.37 % 2.74/1.37 No countermodel exists, formula is valid % 2.74/1.37 % SZS status Theorem for theBenchmark % 2.74/1.37 % 2.74/1.37 Generating proof ... found it (size 53) % 3.75/1.62 % 3.75/1.62 % SZS output start Proof for theBenchmark % 3.75/1.62 Assumed formulas after preprocessing and simplification: % 3.75/1.62 | (0) ? [v0] : ? [v1] : ? [v2] : ? [v3] : ? [v4] : ? [v5] : ? [v6] : ? [v7] : ? [v8] : ? [v9] : ? [v10] : ? [v11] : ? [v12] : ? [v13] : ? [v14] : ( ~ (v13 = 0) & ~ (v11 = 0) & ~ (v1 = 0) & cartesian_product2(v4, v3) = v9 & cartesian_product2(v3, v4) = v6 & cartesian_product2(v2, v0) = v8 & cartesian_product2(v0, v2) = v5 & subset(v8, v9) = v10 & subset(v5, v6) = v7 & subset(v2, v4) = v11 & empty(v14) = 0 & empty(v12) = v13 & empty(v0) = v1 & empty(empty_set) = 0 & ! [v15] : ! [v16] : ! [v17] : ! [v18] : ! [v19] : ! [v20] : (v19 = empty_set | ~ (cartesian_product2(v17, v18) = v20) | ~ (cartesian_product2(v15, v16) = v19) | ~ (subset(v19, v20) = 0) | (subset(v16, v18) = 0 & subset(v15, v17) = 0)) & ! [v15] : ! [v16] : ! [v17] : ! [v18] : (v16 = v15 | ~ (cartesian_product2(v18, v17) = v16) | ~ (cartesian_product2(v18, v17) = v15)) & ! [v15] : ! [v16] : ! [v17] : ! [v18] : (v16 = v15 | ~ (subset(v18, v17) = v16) | ~ (subset(v18, v17) = v15)) & ! [v15] : ! [v16] : ! [v17] : (v16 = v15 | ~ (empty(v17) = v16) | ~ (empty(v17) = v15)) & ! [v15] : ! [v16] : (v16 = empty_set | v15 = empty_set | ~ (cartesian_product2(v15, v16) = empty_set)) & ! [v15] : ! [v16] : (v16 = empty_set | ~ (cartesian_product2(v15, empty_set) = v16)) & ! [v15] : ! [v16] : (v16 = empty_set | ~ (cartesian_product2(empty_set, v15) = v16)) & ! [v15] : ! [v16] : (v16 = 0 | ~ (subset(v15, v15) = v16)) & ! [v15] : ! [v16] : (v16 = 0 | ~ (subset(empty_set, v15) = v16)) & (v10 = 0 | v7 = 0)) % 3.81/1.65 | Instantiating (0) with all_0_0_0, all_0_1_1, all_0_2_2, all_0_3_3, all_0_4_4, all_0_5_5, all_0_6_6, all_0_7_7, all_0_8_8, all_0_9_9, all_0_10_10, all_0_11_11, all_0_12_12, all_0_13_13, all_0_14_14 yields: % 3.81/1.65 | (1) ~ (all_0_1_1 = 0) & ~ (all_0_3_3 = 0) & ~ (all_0_13_13 = 0) & cartesian_product2(all_0_10_10, all_0_11_11) = all_0_5_5 & cartesian_product2(all_0_11_11, all_0_10_10) = all_0_8_8 & cartesian_product2(all_0_12_12, all_0_14_14) = all_0_6_6 & cartesian_product2(all_0_14_14, all_0_12_12) = all_0_9_9 & subset(all_0_6_6, all_0_5_5) = all_0_4_4 & subset(all_0_9_9, all_0_8_8) = all_0_7_7 & subset(all_0_12_12, all_0_10_10) = all_0_3_3 & empty(all_0_0_0) = 0 & empty(all_0_2_2) = all_0_1_1 & empty(all_0_14_14) = all_0_13_13 & empty(empty_set) = 0 & ! [v0] : ! [v1] : ! [v2] : ! [v3] : ! [v4] : ! [v5] : (v4 = empty_set | ~ (cartesian_product2(v2, v3) = v5) | ~ (cartesian_product2(v0, v1) = v4) | ~ (subset(v4, v5) = 0) | (subset(v1, v3) = 0 & subset(v0, v2) = 0)) & ! [v0] : ! [v1] : ! [v2] : ! [v3] : (v1 = v0 | ~ (cartesian_product2(v3, v2) = v1) | ~ (cartesian_product2(v3, v2) = v0)) & ! [v0] : ! [v1] : ! [v2] : ! [v3] : (v1 = v0 | ~ (subset(v3, v2) = v1) | ~ (subset(v3, v2) = v0)) & ! [v0] : ! [v1] : ! [v2] : (v1 = v0 | ~ (empty(v2) = v1) | ~ (empty(v2) = v0)) & ! [v0] : ! [v1] : (v1 = empty_set | v0 = empty_set | ~ (cartesian_product2(v0, v1) = empty_set)) & ! [v0] : ! [v1] : (v1 = empty_set | ~ (cartesian_product2(v0, empty_set) = v1)) & ! [v0] : ! [v1] : (v1 = empty_set | ~ (cartesian_product2(empty_set, v0) = v1)) & ! [v0] : ! [v1] : (v1 = 0 | ~ (subset(v0, v0) = v1)) & ! [v0] : ! [v1] : (v1 = 0 | ~ (subset(empty_set, v0) = v1)) & (all_0_4_4 = 0 | all_0_7_7 = 0) % 3.81/1.65 | % 3.81/1.65 | Applying alpha-rule on (1) yields: % 3.81/1.65 | (2) cartesian_product2(all_0_10_10, all_0_11_11) = all_0_5_5 % 3.81/1.66 | (3) ~ (all_0_1_1 = 0) % 3.81/1.66 | (4) ~ (all_0_13_13 = 0) % 3.81/1.66 | (5) empty(empty_set) = 0 % 3.81/1.66 | (6) cartesian_product2(all_0_12_12, all_0_14_14) = all_0_6_6 % 3.81/1.66 | (7) subset(all_0_9_9, all_0_8_8) = all_0_7_7 % 3.81/1.66 | (8) ~ (all_0_3_3 = 0) % 3.81/1.66 | (9) ! [v0] : ! [v1] : (v1 = 0 | ~ (subset(v0, v0) = v1)) % 3.81/1.66 | (10) ! [v0] : ! [v1] : (v1 = 0 | ~ (subset(empty_set, v0) = v1)) % 3.81/1.66 | (11) ! [v0] : ! [v1] : (v1 = empty_set | ~ (cartesian_product2(empty_set, v0) = v1)) % 3.81/1.66 | (12) empty(all_0_2_2) = all_0_1_1 % 3.81/1.66 | (13) ! [v0] : ! [v1] : (v1 = empty_set | ~ (cartesian_product2(v0, empty_set) = v1)) % 3.81/1.66 | (14) ! [v0] : ! [v1] : ! [v2] : ! [v3] : ! [v4] : ! [v5] : (v4 = empty_set | ~ (cartesian_product2(v2, v3) = v5) | ~ (cartesian_product2(v0, v1) = v4) | ~ (subset(v4, v5) = 0) | (subset(v1, v3) = 0 & subset(v0, v2) = 0)) % 3.81/1.66 | (15) subset(all_0_12_12, all_0_10_10) = all_0_3_3 % 3.81/1.66 | (16) ! [v0] : ! [v1] : ! [v2] : ! [v3] : (v1 = v0 | ~ (subset(v3, v2) = v1) | ~ (subset(v3, v2) = v0)) % 3.81/1.66 | (17) all_0_4_4 = 0 | all_0_7_7 = 0 % 3.81/1.66 | (18) ! [v0] : ! [v1] : ! [v2] : (v1 = v0 | ~ (empty(v2) = v1) | ~ (empty(v2) = v0)) % 3.81/1.66 | (19) ! [v0] : ! [v1] : ! [v2] : ! [v3] : (v1 = v0 | ~ (cartesian_product2(v3, v2) = v1) | ~ (cartesian_product2(v3, v2) = v0)) % 3.81/1.66 | (20) cartesian_product2(all_0_11_11, all_0_10_10) = all_0_8_8 % 3.81/1.66 | (21) ! [v0] : ! [v1] : (v1 = empty_set | v0 = empty_set | ~ (cartesian_product2(v0, v1) = empty_set)) % 3.81/1.66 | (22) empty(all_0_14_14) = all_0_13_13 % 3.81/1.66 | (23) empty(all_0_0_0) = 0 % 3.81/1.66 | (24) cartesian_product2(all_0_14_14, all_0_12_12) = all_0_9_9 % 3.81/1.66 | (25) subset(all_0_6_6, all_0_5_5) = all_0_4_4 % 3.81/1.66 | % 3.81/1.66 | Instantiating formula (21) with all_0_14_14, all_0_12_12 yields: % 3.81/1.66 | (26) all_0_12_12 = empty_set | all_0_14_14 = empty_set | ~ (cartesian_product2(all_0_12_12, all_0_14_14) = empty_set) % 3.81/1.66 | % 3.81/1.66 | Instantiating formula (21) with all_0_12_12, all_0_14_14 yields: % 3.81/1.66 | (27) all_0_12_12 = empty_set | all_0_14_14 = empty_set | ~ (cartesian_product2(all_0_14_14, all_0_12_12) = empty_set) % 3.81/1.66 | % 3.81/1.66 | Instantiating formula (10) with all_0_3_3, all_0_10_10 yields: % 3.81/1.66 | (28) all_0_3_3 = 0 | ~ (subset(empty_set, all_0_10_10) = all_0_3_3) % 3.81/1.66 | % 3.81/1.66 | Instantiating formula (18) with empty_set, 0, all_0_13_13 and discharging atoms empty(empty_set) = 0, yields: % 3.81/1.66 | (29) all_0_13_13 = 0 | ~ (empty(empty_set) = all_0_13_13) % 3.81/1.66 | % 3.81/1.66 | Instantiating formula (14) with all_0_5_5, all_0_6_6, all_0_11_11, all_0_10_10, all_0_14_14, all_0_12_12 and discharging atoms cartesian_product2(all_0_10_10, all_0_11_11) = all_0_5_5, cartesian_product2(all_0_12_12, all_0_14_14) = all_0_6_6, yields: % 3.81/1.66 | (30) all_0_6_6 = empty_set | ~ (subset(all_0_6_6, all_0_5_5) = 0) | (subset(all_0_12_12, all_0_10_10) = 0 & subset(all_0_14_14, all_0_11_11) = 0) % 3.81/1.67 | % 3.81/1.67 | Instantiating formula (14) with all_0_8_8, all_0_9_9, all_0_10_10, all_0_11_11, all_0_12_12, all_0_14_14 and discharging atoms cartesian_product2(all_0_11_11, all_0_10_10) = all_0_8_8, cartesian_product2(all_0_14_14, all_0_12_12) = all_0_9_9, yields: % 3.81/1.67 | (31) all_0_9_9 = empty_set | ~ (subset(all_0_9_9, all_0_8_8) = 0) | (subset(all_0_12_12, all_0_10_10) = 0 & subset(all_0_14_14, all_0_11_11) = 0) % 3.81/1.67 | % 3.81/1.67 +-Applying beta-rule and splitting (29), into two cases. % 3.81/1.67 |-Branch one: % 3.81/1.67 | (32) ~ (empty(empty_set) = all_0_13_13) % 3.81/1.67 | % 3.81/1.67 +-Applying beta-rule and splitting (28), into two cases. % 3.81/1.67 |-Branch one: % 3.81/1.67 | (33) ~ (subset(empty_set, all_0_10_10) = all_0_3_3) % 3.81/1.67 | % 3.81/1.67 | Using (15) and (33) yields: % 3.81/1.67 | (34) ~ (all_0_12_12 = empty_set) % 3.81/1.67 | % 3.81/1.67 | Using (22) and (32) yields: % 3.81/1.67 | (35) ~ (all_0_14_14 = empty_set) % 3.81/1.67 | % 3.81/1.67 +-Applying beta-rule and splitting (26), into two cases. % 3.81/1.67 |-Branch one: % 3.81/1.67 | (36) ~ (cartesian_product2(all_0_12_12, all_0_14_14) = empty_set) % 3.81/1.67 | % 3.81/1.67 +-Applying beta-rule and splitting (27), into two cases. % 3.81/1.67 |-Branch one: % 3.81/1.67 | (37) ~ (cartesian_product2(all_0_14_14, all_0_12_12) = empty_set) % 3.81/1.67 | % 3.81/1.67 | Using (6) and (36) yields: % 3.81/1.67 | (38) ~ (all_0_6_6 = empty_set) % 3.81/1.67 | % 3.81/1.67 | Using (24) and (37) yields: % 3.81/1.67 | (39) ~ (all_0_9_9 = empty_set) % 3.81/1.67 | % 3.81/1.67 +-Applying beta-rule and splitting (31), into two cases. % 3.81/1.67 |-Branch one: % 3.81/1.67 | (40) ~ (subset(all_0_9_9, all_0_8_8) = 0) % 3.81/1.67 | % 3.81/1.67 +-Applying beta-rule and splitting (30), into two cases. % 3.81/1.67 |-Branch one: % 3.81/1.67 | (41) ~ (subset(all_0_6_6, all_0_5_5) = 0) % 3.81/1.67 | % 3.81/1.67 | Using (25) and (41) yields: % 3.81/1.67 | (42) ~ (all_0_4_4 = 0) % 3.81/1.67 | % 3.81/1.67 | Using (7) and (40) yields: % 3.81/1.67 | (43) ~ (all_0_7_7 = 0) % 3.81/1.67 | % 3.81/1.67 +-Applying beta-rule and splitting (17), into two cases. % 3.81/1.67 |-Branch one: % 3.81/1.67 | (44) all_0_4_4 = 0 % 3.81/1.67 | % 3.81/1.67 | Equations (44) can reduce 42 to: % 3.81/1.67 | (45) $false % 3.81/1.67 | % 3.81/1.67 |-The branch is then unsatisfiable % 3.81/1.67 |-Branch two: % 3.81/1.67 | (42) ~ (all_0_4_4 = 0) % 3.81/1.67 | (47) all_0_7_7 = 0 % 3.81/1.67 | % 3.81/1.67 | Equations (47) can reduce 43 to: % 3.81/1.67 | (45) $false % 3.81/1.67 | % 3.81/1.67 |-The branch is then unsatisfiable % 3.81/1.67 |-Branch two: % 3.81/1.67 | (49) subset(all_0_6_6, all_0_5_5) = 0 % 3.81/1.67 | (50) all_0_6_6 = empty_set | (subset(all_0_12_12, all_0_10_10) = 0 & subset(all_0_14_14, all_0_11_11) = 0) % 3.81/1.67 | % 3.81/1.67 +-Applying beta-rule and splitting (50), into two cases. % 3.81/1.67 |-Branch one: % 3.81/1.67 | (51) all_0_6_6 = empty_set % 3.81/1.67 | % 3.81/1.67 | Equations (51) can reduce 38 to: % 3.81/1.67 | (45) $false % 3.81/1.67 | % 3.81/1.67 |-The branch is then unsatisfiable % 3.81/1.67 |-Branch two: % 3.81/1.67 | (38) ~ (all_0_6_6 = empty_set) % 3.81/1.67 | (54) subset(all_0_12_12, all_0_10_10) = 0 & subset(all_0_14_14, all_0_11_11) = 0 % 3.81/1.67 | % 3.81/1.67 | Applying alpha-rule on (54) yields: % 3.81/1.67 | (55) subset(all_0_12_12, all_0_10_10) = 0 % 3.81/1.67 | (56) subset(all_0_14_14, all_0_11_11) = 0 % 3.81/1.67 | % 3.81/1.67 | Instantiating formula (16) with all_0_12_12, all_0_10_10, 0, all_0_3_3 and discharging atoms subset(all_0_12_12, all_0_10_10) = all_0_3_3, subset(all_0_12_12, all_0_10_10) = 0, yields: % 3.81/1.67 | (57) all_0_3_3 = 0 % 3.81/1.67 | % 3.81/1.67 | Equations (57) can reduce 8 to: % 3.81/1.67 | (45) $false % 3.81/1.67 | % 3.81/1.67 |-The branch is then unsatisfiable % 3.81/1.67 |-Branch two: % 3.81/1.67 | (59) subset(all_0_9_9, all_0_8_8) = 0 % 3.81/1.67 | (60) all_0_9_9 = empty_set | (subset(all_0_12_12, all_0_10_10) = 0 & subset(all_0_14_14, all_0_11_11) = 0) % 3.81/1.67 | % 3.81/1.68 +-Applying beta-rule and splitting (60), into two cases. % 3.81/1.68 |-Branch one: % 3.81/1.68 | (61) all_0_9_9 = empty_set % 3.81/1.68 | % 3.81/1.68 | Equations (61) can reduce 39 to: % 3.81/1.68 | (45) $false % 3.81/1.68 | % 3.81/1.68 |-The branch is then unsatisfiable % 3.81/1.68 |-Branch two: % 3.81/1.68 | (39) ~ (all_0_9_9 = empty_set) % 3.81/1.68 | (54) subset(all_0_12_12, all_0_10_10) = 0 & subset(all_0_14_14, all_0_11_11) = 0 % 3.81/1.68 | % 3.81/1.68 | Applying alpha-rule on (54) yields: % 3.81/1.68 | (55) subset(all_0_12_12, all_0_10_10) = 0 % 3.81/1.68 | (56) subset(all_0_14_14, all_0_11_11) = 0 % 3.81/1.68 | % 3.81/1.68 | Instantiating formula (16) with all_0_12_12, all_0_10_10, 0, all_0_3_3 and discharging atoms subset(all_0_12_12, all_0_10_10) = all_0_3_3, subset(all_0_12_12, all_0_10_10) = 0, yields: % 3.81/1.68 | (57) all_0_3_3 = 0 % 3.81/1.68 | % 3.81/1.68 | Equations (57) can reduce 8 to: % 3.81/1.68 | (45) $false % 3.81/1.68 | % 3.81/1.68 |-The branch is then unsatisfiable % 3.81/1.68 |-Branch two: % 3.81/1.68 | (69) cartesian_product2(all_0_14_14, all_0_12_12) = empty_set % 3.81/1.68 | (70) all_0_12_12 = empty_set | all_0_14_14 = empty_set % 3.81/1.68 | % 3.81/1.68 +-Applying beta-rule and splitting (70), into two cases. % 3.81/1.68 |-Branch one: % 3.81/1.68 | (71) all_0_12_12 = empty_set % 3.81/1.68 | % 3.81/1.68 | Equations (71) can reduce 34 to: % 3.81/1.68 | (45) $false % 3.81/1.68 | % 3.81/1.68 |-The branch is then unsatisfiable % 3.81/1.68 |-Branch two: % 3.81/1.68 | (34) ~ (all_0_12_12 = empty_set) % 3.81/1.68 | (74) all_0_14_14 = empty_set % 3.81/1.68 | % 3.81/1.68 | Equations (74) can reduce 35 to: % 3.81/1.68 | (45) $false % 3.81/1.68 | % 3.81/1.68 |-The branch is then unsatisfiable % 3.81/1.68 |-Branch two: % 3.81/1.68 | (76) cartesian_product2(all_0_12_12, all_0_14_14) = empty_set % 3.81/1.68 | (70) all_0_12_12 = empty_set | all_0_14_14 = empty_set % 3.81/1.68 | % 3.81/1.68 +-Applying beta-rule and splitting (70), into two cases. % 3.81/1.68 |-Branch one: % 3.81/1.68 | (71) all_0_12_12 = empty_set % 3.81/1.68 | % 3.81/1.68 | Equations (71) can reduce 34 to: % 3.81/1.68 | (45) $false % 3.81/1.68 | % 3.81/1.68 |-The branch is then unsatisfiable % 3.81/1.68 |-Branch two: % 3.81/1.68 | (34) ~ (all_0_12_12 = empty_set) % 3.81/1.68 | (74) all_0_14_14 = empty_set % 3.81/1.68 | % 3.81/1.68 | Equations (74) can reduce 35 to: % 3.81/1.68 | (45) $false % 3.81/1.68 | % 3.81/1.68 |-The branch is then unsatisfiable % 3.81/1.68 |-Branch two: % 3.81/1.68 | (83) subset(empty_set, all_0_10_10) = all_0_3_3 % 3.81/1.68 | (57) all_0_3_3 = 0 % 3.81/1.68 | % 3.81/1.68 | Equations (57) can reduce 8 to: % 3.81/1.68 | (45) $false % 3.81/1.68 | % 3.81/1.68 |-The branch is then unsatisfiable % 3.81/1.68 |-Branch two: % 3.81/1.68 | (86) empty(empty_set) = all_0_13_13 % 3.81/1.68 | (87) all_0_13_13 = 0 % 3.81/1.68 | % 3.81/1.68 | Equations (87) can reduce 4 to: % 3.81/1.68 | (45) $false % 3.81/1.68 | % 3.81/1.68 |-The branch is then unsatisfiable % 3.81/1.68 % SZS output end Proof for theBenchmark % 3.81/1.68 % 3.81/1.68 1073ms %------------------------------------------------------------------------------