%------------------------------------------------------------------------------ % File : Princess---230619 % Problem : SEU127+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:42:38 EDT 2023 % Result : Theorem 5.16s 1.49s % Output : Proof 6.94s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.12 % Problem : SEU127+1 : TPTP v8.1.2. Released v3.3.0. % 0.00/0.12 % Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s % 0.16/0.32 % Computer : n018.cluster.edu % 0.16/0.32 % Model : x86_64 x86_64 % 0.16/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.16/0.32 % Memory : 8042.1875MB % 0.16/0.32 % OS : Linux 3.10.0-693.el7.x86_64 % 0.16/0.32 % CPULimit : 300 % 0.16/0.32 % WCLimit : 300 % 0.16/0.32 % DateTime : Wed Aug 23 16:10:12 EDT 2023 % 0.16/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 modulo Linear Integer Arithmetic % 0.18/0.58 (2023-06-19) % 0.18/0.58 % 0.18/0.58 (c) Philipp Rümmer, 2009-2023 % 0.18/0.58 Contributors: Peter Backeman, Peter Baumgartner, Angelo Brillout, Zafer Esen, % 0.18/0.58 Amanda Stjerna. % 0.18/0.58 Free software under BSD-3-Clause. % 0.18/0.58 % 0.18/0.58 For more information, visit http://www.philipp.ruemmer.org/princess.shtml % 0.18/0.58 % 0.18/0.58 Loading /export/starexec/sandbox2/benchmark/theBenchmark.p ... % 0.18/0.60 Running up to 7 provers in parallel. % 0.18/0.61 Prover 0: Options: +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1042961893 % 0.18/0.61 Prover 1: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1571432423 % 0.18/0.61 Prover 2: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMinimalAndEmpty -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1065072994 % 0.18/0.61 Prover 3: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1922548996 % 0.18/0.61 Prover 4: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=1868514696 % 0.18/0.61 Prover 5: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=complete -randomSeed=1259561288 % 0.18/0.61 Prover 6: Options: -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximalOutermost -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1399714365 % 1.93/0.96 Prover 1: Preprocessing ... % 1.93/0.96 Prover 4: Preprocessing ... % 2.49/1.00 Prover 5: Preprocessing ... % 2.49/1.00 Prover 2: Preprocessing ... % 2.49/1.00 Prover 3: Preprocessing ... % 2.49/1.00 Prover 6: Preprocessing ... % 2.49/1.00 Prover 0: Preprocessing ... % 4.51/1.28 Prover 1: Warning: ignoring some quantifiers % 4.51/1.29 Prover 3: Warning: ignoring some quantifiers % 4.51/1.30 Prover 3: Constructing countermodel ... % 4.51/1.30 Prover 2: Proving ... % 4.51/1.30 Prover 5: Proving ... % 4.51/1.30 Prover 6: Proving ... % 4.51/1.31 Prover 1: Constructing countermodel ... % 4.51/1.31 Prover 0: Proving ... % 4.51/1.31 Prover 4: Warning: ignoring some quantifiers % 4.51/1.32 Prover 4: Constructing countermodel ... % 5.16/1.48 Prover 3: proved (873ms) % 5.16/1.49 % 5.16/1.49 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 5.16/1.49 % 5.16/1.49 Prover 2: stopped % 5.16/1.50 Prover 5: stopped % 5.16/1.50 Prover 0: stopped % 5.16/1.50 Prover 6: stopped % 5.16/1.51 Prover 7: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470 % 5.16/1.51 Prover 8: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089 % 5.16/1.51 Prover 10: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=919308125 % 5.16/1.51 Prover 13: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=complete -randomSeed=1138197443 % 6.03/1.51 Prover 8: Preprocessing ... % 6.03/1.52 Prover 7: Preprocessing ... % 6.03/1.52 Prover 11: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1509710984 % 6.03/1.53 Prover 13: Preprocessing ... % 6.03/1.53 Prover 10: Preprocessing ... % 6.29/1.54 Prover 4: Found proof (size 20) % 6.29/1.54 Prover 1: Found proof (size 25) % 6.29/1.54 Prover 1: proved (940ms) % 6.34/1.55 Prover 11: Preprocessing ... % 6.34/1.55 Prover 10: stopped % 6.34/1.55 Prover 13: stopped % 6.34/1.55 Prover 4: proved (942ms) % 6.34/1.56 Prover 7: Warning: ignoring some quantifiers % 6.34/1.56 Prover 7: Constructing countermodel ... % 6.34/1.57 Prover 7: stopped % 6.34/1.57 Prover 11: stopped % 6.34/1.58 Prover 8: Warning: ignoring some quantifiers % 6.34/1.58 Prover 8: Constructing countermodel ... % 6.34/1.59 Prover 8: stopped % 6.34/1.59 % 6.34/1.59 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 6.34/1.59 % 6.34/1.59 % SZS output start Proof for theBenchmark % 6.34/1.60 Assumptions after simplification: % 6.34/1.60 --------------------------------- % 6.34/1.60 % 6.34/1.60 (commutativity_k3_xboole_0) % 6.68/1.62 ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ( ~ (set_intersection2(v0, v1) = v2) % 6.68/1.62 | ~ $i(v1) | ~ $i(v0) | (set_intersection2(v1, v0) = v2 & $i(v2))) % 6.68/1.62 % 6.68/1.62 (d3_tarski) % 6.68/1.63 ! [v0: $i] : ! [v1: $i] : ! [v2: int] : (v2 = 0 | ~ (subset(v0, v1) = v2) % 6.68/1.63 | ~ $i(v1) | ~ $i(v0) | ? [v3: $i] : ? [v4: int] : ( ~ (v4 = 0) & in(v3, % 6.68/1.63 v1) = v4 & in(v3, v0) = 0 & $i(v3))) & ! [v0: $i] : ! [v1: $i] : ( ~ % 6.68/1.63 (subset(v0, v1) = 0) | ~ $i(v1) | ~ $i(v0) | ! [v2: $i] : ( ~ (in(v2, v0) % 6.68/1.63 = 0) | ~ $i(v2) | in(v2, v1) = 0)) % 6.68/1.63 % 6.68/1.63 (d3_xboole_0) % 6.68/1.63 ? [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: $i] : (v3 = v0 | ~ % 6.68/1.63 (set_intersection2(v1, v2) = v3) | ~ $i(v2) | ~ $i(v1) | ~ $i(v0) | ? % 6.68/1.63 [v4: $i] : ? [v5: any] : ? [v6: any] : ? [v7: any] : (in(v4, v2) = v7 & % 6.68/1.63 in(v4, v1) = v6 & in(v4, v0) = v5 & $i(v4) & ( ~ (v7 = 0) | ~ (v6 = 0) | % 6.68/1.63 ~ (v5 = 0)) & (v5 = 0 | (v7 = 0 & v6 = 0)))) & ! [v0: $i] : ! [v1: $i] % 6.68/1.63 : ! [v2: $i] : ( ~ (set_intersection2(v0, v1) = v2) | ~ $i(v2) | ~ $i(v1) | % 6.68/1.63 ~ $i(v0) | ( ! [v3: $i] : ! [v4: any] : ( ~ (in(v3, v0) = v4) | ~ $i(v3) % 6.68/1.63 | ? [v5: any] : ? [v6: any] : (in(v3, v2) = v5 & in(v3, v1) = v6 & ( ~ % 6.68/1.63 (v5 = 0) | (v6 = 0 & v4 = 0)))) & ! [v3: $i] : ( ~ (in(v3, v0) = 0) % 6.68/1.63 | ~ $i(v3) | ? [v4: any] : ? [v5: any] : (in(v3, v2) = v5 & in(v3, % 6.68/1.63 v1) = v4 & ( ~ (v4 = 0) | v5 = 0))))) % 6.68/1.63 % 6.68/1.64 (t17_xboole_1) % 6.68/1.64 ? [v0: $i] : ? [v1: $i] : ? [v2: $i] : ? [v3: int] : ( ~ (v3 = 0) & % 6.68/1.64 subset(v2, v0) = v3 & set_intersection2(v0, v1) = v2 & $i(v2) & $i(v1) & % 6.68/1.64 $i(v0)) % 6.68/1.64 % 6.68/1.64 (function-axioms) % 6.68/1.64 ! [v0: MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] : ! % 6.68/1.64 [v3: $i] : (v1 = v0 | ~ (subset(v3, v2) = v1) | ~ (subset(v3, v2) = v0)) & % 6.68/1.64 ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: $i] : (v1 = v0 | ~ % 6.68/1.64 (set_intersection2(v3, v2) = v1) | ~ (set_intersection2(v3, v2) = v0)) & ! % 6.68/1.64 [v0: MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] : ! [v3: % 6.68/1.64 $i] : (v1 = v0 | ~ (in(v3, v2) = v1) | ~ (in(v3, v2) = v0)) & ! [v0: % 6.68/1.64 MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] : (v1 = v0 | % 6.68/1.64 ~ (empty(v2) = v1) | ~ (empty(v2) = v0)) % 6.68/1.64 % 6.68/1.64 Further assumptions not needed in the proof: % 6.68/1.64 -------------------------------------------- % 6.68/1.64 antisymmetry_r2_hidden, dt_k1_xboole_0, dt_k3_xboole_0, fc1_xboole_0, % 6.68/1.64 idempotence_k3_xboole_0, rc1_xboole_0, rc2_xboole_0, reflexivity_r1_tarski, % 6.68/1.64 t2_boole, t6_boole, t7_boole, t8_boole % 6.68/1.64 % 6.68/1.64 Those formulas are unsatisfiable: % 6.68/1.64 --------------------------------- % 6.68/1.64 % 6.68/1.64 Begin of proof % 6.68/1.64 | % 6.68/1.64 | ALPHA: (d3_tarski) implies: % 6.68/1.65 | (1) ! [v0: $i] : ! [v1: $i] : ! [v2: int] : (v2 = 0 | ~ (subset(v0, v1) % 6.68/1.65 | = v2) | ~ $i(v1) | ~ $i(v0) | ? [v3: $i] : ? [v4: int] : ( ~ % 6.68/1.65 | (v4 = 0) & in(v3, v1) = v4 & in(v3, v0) = 0 & $i(v3))) % 6.68/1.65 | % 6.68/1.65 | ALPHA: (d3_xboole_0) implies: % 6.68/1.65 | (2) ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ( ~ (set_intersection2(v0, % 6.68/1.65 | v1) = v2) | ~ $i(v2) | ~ $i(v1) | ~ $i(v0) | ( ! [v3: $i] : ! % 6.68/1.65 | [v4: any] : ( ~ (in(v3, v0) = v4) | ~ $i(v3) | ? [v5: any] : ? % 6.68/1.65 | [v6: any] : (in(v3, v2) = v5 & in(v3, v1) = v6 & ( ~ (v5 = 0) | % 6.68/1.65 | (v6 = 0 & v4 = 0)))) & ! [v3: $i] : ( ~ (in(v3, v0) = 0) | % 6.68/1.65 | ~ $i(v3) | ? [v4: any] : ? [v5: any] : (in(v3, v2) = v5 & % 6.68/1.65 | in(v3, v1) = v4 & ( ~ (v4 = 0) | v5 = 0))))) % 6.68/1.65 | % 6.68/1.65 | ALPHA: (function-axioms) implies: % 6.68/1.65 | (3) ! [v0: MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] : % 6.68/1.65 | ! [v3: $i] : (v1 = v0 | ~ (in(v3, v2) = v1) | ~ (in(v3, v2) = v0)) % 6.68/1.65 | % 6.68/1.65 | DELTA: instantiating (t17_xboole_1) with fresh symbols all_20_0, all_20_1, % 6.68/1.65 | all_20_2, all_20_3 gives: % 6.68/1.65 | (4) ~ (all_20_0 = 0) & subset(all_20_1, all_20_3) = all_20_0 & % 6.68/1.65 | set_intersection2(all_20_3, all_20_2) = all_20_1 & $i(all_20_1) & % 6.68/1.65 | $i(all_20_2) & $i(all_20_3) % 6.68/1.65 | % 6.68/1.65 | ALPHA: (4) implies: % 6.68/1.65 | (5) ~ (all_20_0 = 0) % 6.68/1.65 | (6) $i(all_20_3) % 6.68/1.66 | (7) $i(all_20_2) % 6.68/1.66 | (8) $i(all_20_1) % 6.68/1.66 | (9) set_intersection2(all_20_3, all_20_2) = all_20_1 % 6.68/1.66 | (10) subset(all_20_1, all_20_3) = all_20_0 % 6.68/1.66 | % 6.68/1.66 | GROUND_INST: instantiating (2) with all_20_3, all_20_2, all_20_1, simplifying % 6.94/1.66 | with (6), (7), (8), (9) gives: % 6.94/1.66 | (11) ! [v0: $i] : ! [v1: any] : ( ~ (in(v0, all_20_3) = v1) | ~ $i(v0) | % 6.94/1.66 | ? [v2: any] : ? [v3: any] : (in(v0, all_20_1) = v2 & in(v0, % 6.94/1.66 | all_20_2) = v3 & ( ~ (v2 = 0) | (v3 = 0 & v1 = 0)))) & ! [v0: % 6.94/1.66 | $i] : ( ~ (in(v0, all_20_3) = 0) | ~ $i(v0) | ? [v1: any] : ? % 6.94/1.66 | [v2: any] : (in(v0, all_20_1) = v2 & in(v0, all_20_2) = v1 & ( ~ (v1 % 6.94/1.66 | = 0) | v2 = 0))) % 6.94/1.66 | % 6.94/1.66 | ALPHA: (11) implies: % 6.94/1.66 | (12) ! [v0: $i] : ! [v1: any] : ( ~ (in(v0, all_20_3) = v1) | ~ $i(v0) | % 6.94/1.66 | ? [v2: any] : ? [v3: any] : (in(v0, all_20_1) = v2 & in(v0, % 6.94/1.66 | all_20_2) = v3 & ( ~ (v2 = 0) | (v3 = 0 & v1 = 0)))) % 6.94/1.66 | % 6.94/1.66 | GROUND_INST: instantiating (commutativity_k3_xboole_0) with all_20_3, % 6.94/1.66 | all_20_2, all_20_1, simplifying with (6), (7), (9) gives: % 6.94/1.66 | (13) set_intersection2(all_20_2, all_20_3) = all_20_1 & $i(all_20_1) % 6.94/1.66 | % 6.94/1.66 | GROUND_INST: instantiating (1) with all_20_1, all_20_3, all_20_0, simplifying % 6.94/1.66 | with (6), (8), (10) gives: % 6.94/1.66 | (14) all_20_0 = 0 | ? [v0: $i] : ? [v1: int] : ( ~ (v1 = 0) & in(v0, % 6.94/1.66 | all_20_1) = 0 & in(v0, all_20_3) = v1 & $i(v0)) % 6.94/1.66 | % 6.94/1.66 | BETA: splitting (14) gives: % 6.94/1.66 | % 6.94/1.66 | Case 1: % 6.94/1.66 | | % 6.94/1.66 | | (15) all_20_0 = 0 % 6.94/1.66 | | % 6.94/1.66 | | REDUCE: (5), (15) imply: % 6.94/1.66 | | (16) $false % 6.94/1.67 | | % 6.94/1.67 | | CLOSE: (16) is inconsistent. % 6.94/1.67 | | % 6.94/1.67 | Case 2: % 6.94/1.67 | | % 6.94/1.67 | | (17) ? [v0: $i] : ? [v1: int] : ( ~ (v1 = 0) & in(v0, all_20_1) = 0 & % 6.94/1.67 | | in(v0, all_20_3) = v1 & $i(v0)) % 6.94/1.67 | | % 6.94/1.67 | | DELTA: instantiating (17) with fresh symbols all_35_0, all_35_1 gives: % 6.94/1.67 | | (18) ~ (all_35_0 = 0) & in(all_35_1, all_20_1) = 0 & in(all_35_1, % 6.94/1.67 | | all_20_3) = all_35_0 & $i(all_35_1) % 6.94/1.67 | | % 6.94/1.67 | | ALPHA: (18) implies: % 6.94/1.67 | | (19) ~ (all_35_0 = 0) % 6.94/1.67 | | (20) $i(all_35_1) % 6.94/1.67 | | (21) in(all_35_1, all_20_3) = all_35_0 % 6.94/1.67 | | (22) in(all_35_1, all_20_1) = 0 % 6.94/1.67 | | % 6.94/1.67 | | GROUND_INST: instantiating (12) with all_35_1, all_35_0, simplifying with % 6.94/1.67 | | (20), (21) gives: % 6.94/1.67 | | (23) ? [v0: any] : ? [v1: any] : (in(all_35_1, all_20_1) = v0 & % 6.94/1.67 | | in(all_35_1, all_20_2) = v1 & ( ~ (v0 = 0) | (v1 = 0 & all_35_0 = % 6.94/1.67 | | 0))) % 6.94/1.67 | | % 6.94/1.67 | | DELTA: instantiating (23) with fresh symbols all_47_0, all_47_1 gives: % 6.94/1.67 | | (24) in(all_35_1, all_20_1) = all_47_1 & in(all_35_1, all_20_2) = % 6.94/1.67 | | all_47_0 & ( ~ (all_47_1 = 0) | (all_47_0 = 0 & all_35_0 = 0)) % 6.94/1.67 | | % 6.94/1.67 | | ALPHA: (24) implies: % 6.94/1.67 | | (25) in(all_35_1, all_20_1) = all_47_1 % 6.94/1.67 | | (26) ~ (all_47_1 = 0) | (all_47_0 = 0 & all_35_0 = 0) % 6.94/1.67 | | % 6.94/1.67 | | BETA: splitting (26) gives: % 6.94/1.67 | | % 6.94/1.67 | | Case 1: % 6.94/1.67 | | | % 6.94/1.67 | | | (27) ~ (all_47_1 = 0) % 6.94/1.67 | | | % 6.94/1.67 | | | GROUND_INST: instantiating (3) with 0, all_47_1, all_20_1, all_35_1, % 6.94/1.67 | | | simplifying with (22), (25) gives: % 6.94/1.67 | | | (28) all_47_1 = 0 % 6.94/1.67 | | | % 6.94/1.67 | | | REDUCE: (27), (28) imply: % 6.94/1.67 | | | (29) $false % 6.94/1.67 | | | % 6.94/1.67 | | | CLOSE: (29) is inconsistent. % 6.94/1.67 | | | % 6.94/1.67 | | Case 2: % 6.94/1.67 | | | % 6.94/1.67 | | | (30) all_47_0 = 0 & all_35_0 = 0 % 6.94/1.67 | | | % 6.94/1.67 | | | ALPHA: (30) implies: % 6.94/1.67 | | | (31) all_35_0 = 0 % 6.94/1.67 | | | % 6.94/1.67 | | | REDUCE: (19), (31) imply: % 6.94/1.67 | | | (32) $false % 6.94/1.67 | | | % 6.94/1.67 | | | CLOSE: (32) is inconsistent. % 6.94/1.67 | | | % 6.94/1.67 | | End of split % 6.94/1.67 | | % 6.94/1.67 | End of split % 6.94/1.67 | % 6.94/1.67 End of proof % 6.94/1.67 % SZS output end Proof for theBenchmark % 6.94/1.67 % 6.94/1.67 1088ms %------------------------------------------------------------------------------