%------------------------------------------------------------------------------ % File : Princess---230619 % Problem : KRS112+1 : TPTP v8.1.2. Released v3.1.0. % Transfm : none % Format : tptp % Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s % Computer : n028.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 05:51:17 EDT 2023 % Result : Unsatisfiable 6.81s 1.67s % Output : Proof 8.87s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.13 % Problem : KRS112+1 : TPTP v8.1.2. Released v3.1.0. % 0.00/0.14 % Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s % 0.14/0.35 % Computer : n028.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 : Mon Aug 28 01:44:39 EDT 2023 % 0.14/0.35 % CPUTime : % 0.21/0.60 ________ _____ % 0.21/0.60 ___ __ \_________(_)________________________________ % 0.21/0.60 __ /_/ /_ ___/_ /__ __ \ ___/ _ \_ ___/_ ___/ % 0.21/0.60 _ ____/_ / _ / _ / / / /__ / __/(__ )_(__ ) % 0.21/0.60 /_/ /_/ /_/ /_/ /_/\___/ \___//____/ /____/ % 0.21/0.60 % 0.21/0.60 A Theorem Prover for First-Order Logic modulo Linear Integer Arithmetic % 0.21/0.60 (2023-06-19) % 0.21/0.60 % 0.21/0.60 (c) Philipp Rümmer, 2009-2023 % 0.21/0.60 Contributors: Peter Backeman, Peter Baumgartner, Angelo Brillout, Zafer Esen, % 0.21/0.60 Amanda Stjerna. % 0.21/0.60 Free software under BSD-3-Clause. % 0.21/0.60 % 0.21/0.60 For more information, visit http://www.philipp.ruemmer.org/princess.shtml % 0.21/0.60 % 0.21/0.61 Loading /export/starexec/sandbox2/benchmark/theBenchmark.p ... % 0.21/0.62 Running up to 7 provers in parallel. % 0.21/0.63 Prover 1: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1571432423 % 0.21/0.63 Prover 0: Options: +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1042961893 % 0.21/0.63 Prover 2: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMinimalAndEmpty -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1065072994 % 0.21/0.63 Prover 3: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1922548996 % 0.21/0.63 Prover 4: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=1868514696 % 0.21/0.63 Prover 6: Options: -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximalOutermost -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1399714365 % 0.21/0.63 Prover 5: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=complete -randomSeed=1259561288 % 2.55/1.12 Prover 4: Preprocessing ... % 2.55/1.12 Prover 1: Preprocessing ... % 3.09/1.16 Prover 0: Preprocessing ... % 3.09/1.16 Prover 5: Preprocessing ... % 3.09/1.16 Prover 2: Preprocessing ... % 3.09/1.16 Prover 3: Preprocessing ... % 3.09/1.16 Prover 6: Preprocessing ... % 5.52/1.48 Prover 2: Proving ... % 5.52/1.50 Prover 5: Proving ... % 6.31/1.59 Prover 6: Proving ... % 6.31/1.60 Prover 1: Constructing countermodel ... % 6.65/1.64 Prover 3: Constructing countermodel ... % 6.81/1.65 Prover 4: Constructing countermodel ... % 6.81/1.67 Prover 2: proved (1047ms) % 6.81/1.67 % 6.81/1.67 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p % 6.81/1.67 % 6.81/1.68 Prover 3: stopped % 6.81/1.68 Prover 6: stopped % 6.81/1.68 Prover 5: stopped % 6.81/1.68 Prover 8: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089 % 6.81/1.68 Prover 7: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470 % 6.81/1.68 Prover 10: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=919308125 % 6.81/1.68 Prover 11: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1509710984 % 6.81/1.71 Prover 1: gave up % 6.81/1.71 Prover 13: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=complete -randomSeed=1138197443 % 7.36/1.73 Prover 0: Proving ... % 7.36/1.73 Prover 0: stopped % 7.36/1.73 Prover 16: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=completeFrugal -randomSeed=-2043353683 % 7.74/1.79 Prover 13: Preprocessing ... % 7.74/1.79 Prover 7: Preprocessing ... % 7.74/1.79 Prover 11: Preprocessing ... % 7.74/1.79 Prover 8: Preprocessing ... % 7.74/1.81 Prover 16: Preprocessing ... % 7.74/1.82 Prover 10: Preprocessing ... % 7.74/1.84 Prover 7: Warning: ignoring some quantifiers % 7.74/1.85 Prover 7: Constructing countermodel ... % 8.31/1.86 Prover 13: Warning: ignoring some quantifiers % 8.50/1.88 Prover 13: Constructing countermodel ... % 8.50/1.88 Prover 16: Warning: ignoring some quantifiers % 8.50/1.88 Prover 16: Constructing countermodel ... % 8.50/1.90 Prover 10: Warning: ignoring some quantifiers % 8.50/1.91 Prover 10: Constructing countermodel ... % 8.87/1.94 Prover 8: Warning: ignoring some quantifiers % 8.87/1.94 Prover 7: Found proof (size 31) % 8.87/1.95 Prover 7: proved (265ms) % 8.87/1.95 Prover 13: stopped % 8.87/1.95 Prover 10: stopped % 8.87/1.95 Prover 4: stopped % 8.87/1.95 Prover 16: stopped % 8.87/1.95 Prover 8: Constructing countermodel ... % 8.87/1.96 Prover 8: stopped % 8.87/1.97 Prover 11: Constructing countermodel ... % 8.87/1.98 Prover 11: stopped % 8.87/1.98 % 8.87/1.98 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p % 8.87/1.98 % 8.87/1.99 % SZS output start Proof for theBenchmark % 8.87/1.99 Assumptions after simplification: % 8.87/1.99 --------------------------------- % 8.87/1.99 % 8.87/1.99 (axiom_10) % 8.87/2.00 ! [v0: $i] : ! [v1: $i] : ( ~ $i(v1) | ~ $i(v0) | ~ rinvF1(v0, v1) | % 8.87/2.00 rf1(v1, v0)) & ! [v0: $i] : ! [v1: $i] : ( ~ $i(v1) | ~ $i(v0) | ~ % 8.87/2.00 rf1(v1, v0) | rinvF1(v0, v1)) % 8.87/2.00 % 8.87/2.00 (axiom_13) % 8.87/2.00 $i(i2003_11_14_17_21_19256) & cUnsatisfiable(i2003_11_14_17_21_19256) % 8.87/2.00 % 8.87/2.00 (axiom_14) % 8.87/2.00 ! [v0: $i] : ! [v1: $i] : ( ~ $i(v1) | ~ $i(v0) | ~ rs(v0, v1) | rf(v0, % 8.87/2.00 v1)) % 8.87/2.00 % 8.87/2.00 (axiom_15) % 8.87/2.00 ! [v0: $i] : ! [v1: $i] : ( ~ $i(v1) | ~ $i(v0) | ~ rs(v0, v1) | rf1(v0, % 8.87/2.00 v1)) % 8.87/2.00 % 8.87/2.00 (axiom_2) % 8.87/2.01 ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ( ~ $i(v2) | ~ $i(v1) | ~ $i(v0) | % 8.87/2.01 ~ rf1(v0, v2) | ~ rf(v0, v1) | ~ cp(v1) | ~ ca_Ax2(v2) | % 8.87/2.01 cUnsatisfiable(v0)) & ! [v0: $i] : ( ~ $i(v0) | ~ cUnsatisfiable(v0) | ? % 8.87/2.01 [v1: $i] : ($i(v1) & rf1(v0, v1) & ca_Ax2(v1))) & ! [v0: $i] : ( ~ $i(v0) | % 8.87/2.01 ~ cUnsatisfiable(v0) | ? [v1: $i] : ($i(v1) & rf(v0, v1) & cp(v1))) % 8.87/2.01 % 8.87/2.01 (axiom_3) % 8.87/2.01 ! [v0: $i] : ! [v1: $i] : ( ~ $i(v1) | ~ $i(v0) | ~ ra_Px1(v0, v1) | ~ % 8.87/2.01 cp(v0)) & ? [v0: $i] : ( ~ $i(v0) | cp(v0) | ? [v1: $i] : ($i(v1) & % 8.87/2.01 ra_Px1(v0, v1))) % 8.87/2.01 % 8.87/2.01 (axiom_4) % 8.87/2.01 ! [v0: $i] : ! [v1: $i] : ( ~ $i(v1) | ~ $i(v0) | ~ ra_Px1(v0, v1) | % 8.87/2.01 cpxcomp(v0)) & ! [v0: $i] : ( ~ $i(v0) | ~ cpxcomp(v0) | ? [v1: $i] : % 8.87/2.01 ($i(v1) & ra_Px1(v0, v1))) % 8.87/2.01 % 8.87/2.01 (axiom_5) % 8.87/2.01 ! [v0: $i] : ! [v1: $i] : ( ~ $i(v1) | ~ $i(v0) | ~ rinvF1(v0, v1) | ~ % 8.87/2.01 ca_Ax2(v0) | ca_Vx3(v1)) & ! [v0: $i] : ( ~ $i(v0) | ~ cpxcomp(v0) | % 8.87/2.01 ca_Ax2(v0) | ? [v1: $i] : ($i(v1) & rinvF1(v0, v1) & ~ ca_Vx3(v1))) & ! % 8.87/2.01 [v0: $i] : ( ~ $i(v0) | ~ ca_Ax2(v0) | cpxcomp(v0)) % 8.87/2.01 % 8.87/2.01 (axiom_6) % 8.87/2.01 ! [v0: $i] : ! [v1: $i] : ( ~ $i(v1) | ~ $i(v0) | ~ rs(v0, v1) | ~ % 8.87/2.01 cowlThing(v1) | ca_Vx3(v0)) & ! [v0: $i] : ( ~ $i(v0) | ~ ca_Vx3(v0) | ? % 8.87/2.01 [v1: $i] : ($i(v1) & rs(v0, v1) & cowlThing(v1))) % 8.87/2.01 % 8.87/2.01 (axiom_7) % 8.87/2.01 ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : (v2 = v1 | ~ $i(v2) | ~ $i(v1) | % 8.87/2.01 ~ $i(v0) | ~ rf(v0, v2) | ~ rf(v0, v1)) % 8.87/2.01 % 8.87/2.01 (axiom_8) % 8.87/2.01 ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : (v2 = v1 | ~ $i(v2) | ~ $i(v1) | % 8.87/2.01 ~ $i(v0) | ~ rf1(v0, v2) | ~ rf1(v0, v1)) % 8.87/2.01 % 8.87/2.01 Further assumptions not needed in the proof: % 8.87/2.01 -------------------------------------------- % 8.87/2.01 axiom_0, axiom_1, axiom_11, axiom_12, axiom_9, cUnsatisfiable_substitution_1, % 8.87/2.01 ca_Ax2_substitution_1, ca_Vx3_substitution_1, cowlNothing_substitution_1, % 8.87/2.01 cowlThing_substitution_1, cp_substitution_1, cpxcomp_substitution_1, % 8.87/2.01 ra_Px1_substitution_1, ra_Px1_substitution_2, rf1_substitution_1, % 8.87/2.01 rf1_substitution_2, rf_substitution_1, rf_substitution_2, rinvF1_substitution_1, % 8.87/2.01 rinvF1_substitution_2, rinvF_substitution_1, rinvF_substitution_2, % 8.87/2.01 rinvS_substitution_1, rinvS_substitution_2, rs_substitution_1, % 8.87/2.01 rs_substitution_2, xsd_integer_substitution_1, xsd_string_substitution_1 % 8.87/2.01 % 8.87/2.01 Those formulas are unsatisfiable: % 8.87/2.01 --------------------------------- % 8.87/2.01 % 8.87/2.01 Begin of proof % 8.87/2.02 | % 8.87/2.02 | ALPHA: (axiom_13) implies: % 8.87/2.02 | (1) cUnsatisfiable(i2003_11_14_17_21_19256) % 8.87/2.02 | (2) $i(i2003_11_14_17_21_19256) % 8.87/2.02 | % 8.87/2.02 | ALPHA: (axiom_10) implies: % 8.87/2.02 | (3) ! [v0: $i] : ! [v1: $i] : ( ~ $i(v1) | ~ $i(v0) | ~ rf1(v1, v0) | % 8.87/2.02 | rinvF1(v0, v1)) % 8.87/2.02 | % 8.87/2.02 | ALPHA: (axiom_6) implies: % 8.87/2.02 | (4) ! [v0: $i] : ( ~ $i(v0) | ~ ca_Vx3(v0) | ? [v1: $i] : ($i(v1) & % 8.87/2.02 | rs(v0, v1) & cowlThing(v1))) % 8.87/2.02 | % 8.87/2.02 | ALPHA: (axiom_5) implies: % 8.87/2.02 | (5) ! [v0: $i] : ( ~ $i(v0) | ~ ca_Ax2(v0) | cpxcomp(v0)) % 8.87/2.02 | (6) ! [v0: $i] : ! [v1: $i] : ( ~ $i(v1) | ~ $i(v0) | ~ rinvF1(v0, v1) % 8.87/2.02 | | ~ ca_Ax2(v0) | ca_Vx3(v1)) % 8.87/2.02 | % 8.87/2.02 | ALPHA: (axiom_4) implies: % 8.87/2.02 | (7) ! [v0: $i] : ( ~ $i(v0) | ~ cpxcomp(v0) | ? [v1: $i] : ($i(v1) & % 8.87/2.02 | ra_Px1(v0, v1))) % 8.87/2.02 | % 8.87/2.02 | ALPHA: (axiom_3) implies: % 8.87/2.02 | (8) ! [v0: $i] : ! [v1: $i] : ( ~ $i(v1) | ~ $i(v0) | ~ ra_Px1(v0, v1) % 8.87/2.02 | | ~ cp(v0)) % 8.87/2.02 | % 8.87/2.02 | ALPHA: (axiom_2) implies: % 8.87/2.02 | (9) ! [v0: $i] : ( ~ $i(v0) | ~ cUnsatisfiable(v0) | ? [v1: $i] : % 8.87/2.02 | ($i(v1) & rf(v0, v1) & cp(v1))) % 8.87/2.02 | (10) ! [v0: $i] : ( ~ $i(v0) | ~ cUnsatisfiable(v0) | ? [v1: $i] : % 8.87/2.02 | ($i(v1) & rf1(v0, v1) & ca_Ax2(v1))) % 8.87/2.02 | % 8.87/2.02 | GROUND_INST: instantiating (10) with i2003_11_14_17_21_19256, simplifying with % 8.87/2.02 | (1), (2) gives: % 8.87/2.02 | (11) ? [v0: $i] : ($i(v0) & rf1(i2003_11_14_17_21_19256, v0) & ca_Ax2(v0)) % 8.87/2.02 | % 8.87/2.02 | GROUND_INST: instantiating (9) with i2003_11_14_17_21_19256, simplifying with % 8.87/2.02 | (1), (2) gives: % 8.87/2.02 | (12) ? [v0: $i] : ($i(v0) & rf(i2003_11_14_17_21_19256, v0) & cp(v0)) % 8.87/2.02 | % 8.87/2.02 | DELTA: instantiating (12) with fresh symbol all_26_0 gives: % 8.87/2.03 | (13) $i(all_26_0) & rf(i2003_11_14_17_21_19256, all_26_0) & cp(all_26_0) % 8.87/2.03 | % 8.87/2.03 | ALPHA: (13) implies: % 8.87/2.03 | (14) cp(all_26_0) % 8.87/2.03 | (15) rf(i2003_11_14_17_21_19256, all_26_0) % 8.87/2.03 | (16) $i(all_26_0) % 8.87/2.03 | % 8.87/2.03 | DELTA: instantiating (11) with fresh symbol all_28_0 gives: % 8.87/2.03 | (17) $i(all_28_0) & rf1(i2003_11_14_17_21_19256, all_28_0) & % 8.87/2.03 | ca_Ax2(all_28_0) % 8.87/2.03 | % 8.87/2.03 | ALPHA: (17) implies: % 8.87/2.03 | (18) ca_Ax2(all_28_0) % 8.87/2.03 | (19) rf1(i2003_11_14_17_21_19256, all_28_0) % 8.87/2.03 | (20) $i(all_28_0) % 8.87/2.03 | % 8.87/2.03 | GROUND_INST: instantiating (5) with all_28_0, simplifying with (18), (20) % 8.87/2.03 | gives: % 8.87/2.03 | (21) cpxcomp(all_28_0) % 8.87/2.03 | % 8.87/2.03 | GROUND_INST: instantiating (3) with all_28_0, i2003_11_14_17_21_19256, % 8.87/2.03 | simplifying with (2), (19), (20) gives: % 8.87/2.03 | (22) rinvF1(all_28_0, i2003_11_14_17_21_19256) % 8.87/2.03 | % 8.87/2.03 | GROUND_INST: instantiating (7) with all_28_0, simplifying with (20), (21) % 8.87/2.03 | gives: % 8.87/2.03 | (23) ? [v0: $i] : ($i(v0) & ra_Px1(all_28_0, v0)) % 8.87/2.03 | % 8.87/2.03 | GROUND_INST: instantiating (6) with all_28_0, i2003_11_14_17_21_19256, % 8.87/2.03 | simplifying with (2), (18), (20), (22) gives: % 8.87/2.03 | (24) ca_Vx3(i2003_11_14_17_21_19256) % 8.87/2.03 | % 8.87/2.03 | DELTA: instantiating (23) with fresh symbol all_42_0 gives: % 8.87/2.03 | (25) $i(all_42_0) & ra_Px1(all_28_0, all_42_0) % 8.87/2.03 | % 8.87/2.03 | ALPHA: (25) implies: % 8.87/2.03 | (26) ra_Px1(all_28_0, all_42_0) % 8.87/2.03 | (27) $i(all_42_0) % 8.87/2.03 | % 8.87/2.03 | GROUND_INST: instantiating (4) with i2003_11_14_17_21_19256, simplifying with % 8.87/2.03 | (2), (24) gives: % 8.87/2.03 | (28) ? [v0: $i] : ($i(v0) & rs(i2003_11_14_17_21_19256, v0) & % 8.87/2.03 | cowlThing(v0)) % 8.87/2.03 | % 8.87/2.03 | GROUND_INST: instantiating (8) with all_26_0, all_42_0, simplifying with (14), % 8.87/2.03 | (16), (27) gives: % 8.87/2.03 | (29) ~ ra_Px1(all_26_0, all_42_0) % 8.87/2.03 | % 8.87/2.03 | DELTA: instantiating (28) with fresh symbol all_50_0 gives: % 8.87/2.03 | (30) $i(all_50_0) & rs(i2003_11_14_17_21_19256, all_50_0) & % 8.87/2.03 | cowlThing(all_50_0) % 8.87/2.03 | % 8.87/2.03 | ALPHA: (30) implies: % 8.87/2.03 | (31) rs(i2003_11_14_17_21_19256, all_50_0) % 8.87/2.03 | (32) $i(all_50_0) % 8.87/2.03 | % 8.87/2.03 | PRED_UNIFY: (26), (29) imply: % 8.87/2.03 | (33) ~ (all_28_0 = all_26_0) % 8.87/2.03 | % 8.87/2.03 | GROUND_INST: instantiating (axiom_15) with i2003_11_14_17_21_19256, all_50_0, % 8.87/2.03 | simplifying with (2), (31), (32) gives: % 8.87/2.03 | (34) rf1(i2003_11_14_17_21_19256, all_50_0) % 8.87/2.03 | % 8.87/2.03 | GROUND_INST: instantiating (axiom_14) with i2003_11_14_17_21_19256, all_50_0, % 8.87/2.03 | simplifying with (2), (31), (32) gives: % 8.87/2.03 | (35) rf(i2003_11_14_17_21_19256, all_50_0) % 8.87/2.03 | % 8.87/2.03 | GROUND_INST: instantiating (axiom_7) with i2003_11_14_17_21_19256, all_26_0, % 8.87/2.03 | all_50_0, simplifying with (2), (15), (16), (32), (35) gives: % 8.87/2.03 | (36) all_50_0 = all_26_0 % 8.87/2.03 | % 8.87/2.03 | GROUND_INST: instantiating (axiom_8) with i2003_11_14_17_21_19256, all_28_0, % 8.87/2.03 | all_50_0, simplifying with (2), (19), (20), (32), (34) gives: % 8.87/2.03 | (37) all_50_0 = all_28_0 % 8.87/2.03 | % 8.87/2.03 | COMBINE_EQS: (36), (37) imply: % 8.87/2.03 | (38) all_28_0 = all_26_0 % 8.87/2.03 | % 8.87/2.03 | REDUCE: (33), (38) imply: % 8.87/2.04 | (39) $false % 8.87/2.04 | % 8.87/2.04 | CLOSE: (39) is inconsistent. % 8.87/2.04 | % 8.87/2.04 End of proof % 8.87/2.04 % SZS output end Proof for theBenchmark % 8.87/2.04 % 8.87/2.04 1431ms %------------------------------------------------------------------------------