%------------------------------------------------------------------------------ % File : Princess---230619 % Problem : KRS118+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 : n026.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:19 EDT 2023 % Result : Unsatisfiable 7.57s 1.83s % Output : Proof 10.71s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.12 % Problem : KRS118+1 : TPTP v8.1.2. Released v3.1.0. % 0.00/0.13 % Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s % 0.16/0.34 % Computer : n026.cluster.edu % 0.16/0.34 % Model : x86_64 x86_64 % 0.16/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.16/0.34 % Memory : 8042.1875MB % 0.16/0.34 % OS : Linux 3.10.0-693.el7.x86_64 % 0.16/0.34 % CPULimit : 300 % 0.16/0.34 % WCLimit : 300 % 0.16/0.34 % DateTime : Mon Aug 28 01:28:04 EDT 2023 % 0.16/0.34 % CPUTime : % 0.20/0.61 ________ _____ % 0.20/0.61 ___ __ \_________(_)________________________________ % 0.20/0.61 __ /_/ /_ ___/_ /__ __ \ ___/ _ \_ ___/_ ___/ % 0.20/0.61 _ ____/_ / _ / _ / / / /__ / __/(__ )_(__ ) % 0.20/0.61 /_/ /_/ /_/ /_/ /_/\___/ \___//____/ /____/ % 0.20/0.61 % 0.20/0.61 A Theorem Prover for First-Order Logic modulo Linear Integer Arithmetic % 0.20/0.61 (2023-06-19) % 0.20/0.61 % 0.20/0.61 (c) Philipp Rümmer, 2009-2023 % 0.20/0.61 Contributors: Peter Backeman, Peter Baumgartner, Angelo Brillout, Zafer Esen, % 0.20/0.61 Amanda Stjerna. % 0.20/0.61 Free software under BSD-3-Clause. % 0.20/0.61 % 0.20/0.61 For more information, visit http://www.philipp.ruemmer.org/princess.shtml % 0.20/0.61 % 0.20/0.62 Loading /export/starexec/sandbox/benchmark/theBenchmark.p ... % 0.20/0.63 Running up to 7 provers in parallel. % 0.20/0.64 Prover 0: Options: +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1042961893 % 0.20/0.64 Prover 1: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1571432423 % 0.20/0.64 Prover 2: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMinimalAndEmpty -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1065072994 % 0.20/0.64 Prover 3: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1922548996 % 0.20/0.64 Prover 4: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=1868514696 % 0.20/0.64 Prover 5: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=complete -randomSeed=1259561288 % 0.20/0.64 Prover 6: Options: -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximalOutermost -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1399714365 % 2.71/1.08 Prover 4: Preprocessing ... % 2.71/1.09 Prover 1: Preprocessing ... % 2.71/1.14 Prover 6: Preprocessing ... % 2.71/1.14 Prover 5: Preprocessing ... % 2.71/1.14 Prover 3: Preprocessing ... % 2.71/1.14 Prover 0: Preprocessing ... % 3.24/1.14 Prover 2: Preprocessing ... % 5.11/1.51 Prover 5: Proving ... % 5.11/1.51 Prover 2: Proving ... % 5.77/1.59 Prover 6: Proving ... % 6.32/1.64 Prover 1: Constructing countermodel ... % 6.32/1.64 Prover 3: Constructing countermodel ... % 6.32/1.70 Prover 3: gave up % 6.32/1.70 Prover 7: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470 % 6.32/1.72 Prover 4: Constructing countermodel ... % 7.08/1.74 Prover 1: gave up % 7.08/1.75 Prover 8: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089 % 7.08/1.75 Prover 7: Preprocessing ... % 7.08/1.76 Prover 0: Proving ... % 7.57/1.80 Prover 8: Preprocessing ... % 7.57/1.82 Prover 7: Warning: ignoring some quantifiers % 7.57/1.82 Prover 5: proved (1185ms) % 7.57/1.83 % 7.57/1.83 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p % 7.57/1.83 % 7.57/1.83 Prover 2: proved (1190ms) % 7.57/1.83 % 7.57/1.83 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p % 7.57/1.83 % 7.57/1.83 Prover 0: stopped % 7.57/1.83 Prover 6: stopped % 7.57/1.83 Prover 11: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1509710984 % 7.57/1.83 Prover 10: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=919308125 % 7.57/1.83 Prover 13: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=complete -randomSeed=1138197443 % 7.57/1.84 Prover 16: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=completeFrugal -randomSeed=-2043353683 % 7.57/1.84 Prover 7: Constructing countermodel ... % 8.01/1.88 Prover 10: Preprocessing ... % 8.01/1.89 Prover 16: Preprocessing ... % 8.01/1.89 Prover 13: Preprocessing ... % 8.01/1.90 Prover 11: Preprocessing ... % 8.01/1.94 Prover 10: Warning: ignoring some quantifiers % 8.01/1.95 Prover 10: Constructing countermodel ... % 8.67/1.96 Prover 16: Warning: ignoring some quantifiers % 8.67/1.97 Prover 13: Warning: ignoring some quantifiers % 8.67/1.97 Prover 16: Constructing countermodel ... % 8.67/1.98 Prover 8: Warning: ignoring some quantifiers % 8.67/1.98 Prover 13: Constructing countermodel ... % 8.67/1.99 Prover 8: Constructing countermodel ... % 9.21/2.09 Prover 8: gave up % 9.21/2.10 Prover 19: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=complete -randomSeed=-1780594085 % 9.21/2.12 Prover 7: Found proof (size 38) % 9.21/2.12 Prover 7: proved (418ms) % 9.21/2.12 Prover 10: stopped % 9.21/2.12 Prover 13: stopped % 9.21/2.12 Prover 16: stopped % 9.21/2.12 Prover 4: stopped % 9.21/2.14 Prover 19: Preprocessing ... % 9.21/2.15 Prover 11: Constructing countermodel ... % 9.21/2.16 Prover 11: stopped % 10.32/2.26 Prover 19: Warning: ignoring some quantifiers % 10.32/2.27 Prover 19: Constructing countermodel ... % 10.32/2.28 Prover 19: stopped % 10.32/2.28 % 10.32/2.28 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p % 10.32/2.28 % 10.32/2.29 % SZS output start Proof for theBenchmark % 10.71/2.30 Assumptions after simplification: % 10.71/2.30 --------------------------------- % 10.71/2.30 % 10.71/2.30 (axiom_11) % 10.71/2.30 $i(i2003_11_14_17_21_4056) & cUnsatisfiable(i2003_11_14_17_21_4056) % 10.71/2.30 % 10.71/2.30 (axiom_12) % 10.71/2.30 ! [v0: $i] : ! [v1: $i] : ( ~ $i(v1) | ~ $i(v0) | ~ rf(v0, v1) | rr(v0, % 10.71/2.30 v1)) % 10.71/2.30 % 10.71/2.30 (axiom_2) % 10.71/2.31 ! [v0: $i] : ! [v1: $i] : ( ~ $i(v1) | ~ $i(v0) | ~ rinvR(v0, v1) | ~ % 10.71/2.31 cUnsatisfiable(v0) | ca_Vx3(v1)) & ! [v0: $i] : ! [v1: $i] : ( ~ $i(v1) | % 10.71/2.31 ~ $i(v0) | ~ rinvF(v0, v1) | ~ cd(v1) | ~ ccxcomp(v0) | % 10.71/2.31 cUnsatisfiable(v0) | ? [v2: $i] : ($i(v2) & rinvR(v0, v2) & ~ ca_Vx3(v2))) % 10.71/2.31 & ! [v0: $i] : ( ~ $i(v0) | ~ cUnsatisfiable(v0) | ccxcomp(v0)) & ! [v0: % 10.71/2.31 $i] : ( ~ $i(v0) | ~ cUnsatisfiable(v0) | ? [v1: $i] : ($i(v1) & rinvF(v0, % 10.71/2.31 v1) & cd(v1))) % 10.71/2.31 % 10.71/2.31 (axiom_3) % 10.71/2.31 ! [v0: $i] : ! [v1: $i] : ( ~ $i(v1) | ~ $i(v0) | ~ ra_Px1(v0, v1) | ~ % 10.71/2.31 cc(v0)) & ? [v0: $i] : ( ~ $i(v0) | cc(v0) | ? [v1: $i] : ($i(v1) & % 10.71/2.31 ra_Px1(v0, v1))) % 10.71/2.31 % 10.71/2.31 (axiom_4) % 10.71/2.31 ! [v0: $i] : ! [v1: $i] : ( ~ $i(v1) | ~ $i(v0) | ~ ra_Px1(v0, v1) | % 10.71/2.31 ccxcomp(v0)) & ! [v0: $i] : ( ~ $i(v0) | ~ ccxcomp(v0) | ? [v1: $i] : % 10.71/2.31 ($i(v1) & ra_Px1(v0, v1))) % 10.71/2.31 % 10.71/2.31 (axiom_5) % 10.71/2.32 ! [v0: $i] : ! [v1: $i] : ( ~ $i(v1) | ~ $i(v0) | ~ rf(v0, v1) | ~ % 10.71/2.32 ccxcomp(v1) | ~ cc(v0) | cd(v0)) & ! [v0: $i] : ( ~ $i(v0) | ~ cd(v0) | % 10.71/2.32 cc(v0)) & ! [v0: $i] : ( ~ $i(v0) | ~ cd(v0) | ? [v1: $i] : ($i(v1) & % 10.71/2.32 rf(v0, v1) & ccxcomp(v1))) % 10.71/2.32 % 10.71/2.32 (axiom_6) % 10.71/2.32 ! [v0: $i] : ! [v1: $i] : ( ~ $i(v1) | ~ $i(v0) | ~ rinvF(v0, v1) | ~ % 10.71/2.32 cd(v1) | ca_Vx3(v0)) & ! [v0: $i] : ( ~ $i(v0) | ~ ca_Vx3(v0) | ? [v1: % 10.71/2.32 $i] : ($i(v1) & rinvF(v0, v1) & cd(v1))) % 10.71/2.32 % 10.71/2.32 (axiom_7) % 10.71/2.32 ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : (v2 = v1 | ~ $i(v2) | ~ $i(v1) | % 10.71/2.32 ~ $i(v0) | ~ rf(v0, v2) | ~ rf(v0, v1)) % 10.71/2.32 % 10.71/2.32 (axiom_8) % 10.71/2.32 ! [v0: $i] : ! [v1: $i] : ( ~ $i(v1) | ~ $i(v0) | ~ rinvF(v0, v1) | rf(v1, % 10.71/2.32 v0)) & ! [v0: $i] : ! [v1: $i] : ( ~ $i(v1) | ~ $i(v0) | ~ rf(v1, v0) % 10.71/2.32 | rinvF(v0, v1)) % 10.71/2.32 % 10.71/2.32 (axiom_9) % 10.71/2.32 ! [v0: $i] : ! [v1: $i] : ( ~ $i(v1) | ~ $i(v0) | ~ rr(v1, v0) | rinvR(v0, % 10.71/2.32 v1)) & ! [v0: $i] : ! [v1: $i] : ( ~ $i(v1) | ~ $i(v0) | ~ rinvR(v0, % 10.71/2.32 v1) | rr(v1, v0)) % 10.71/2.32 % 10.71/2.32 Further assumptions not needed in the proof: % 10.71/2.32 -------------------------------------------- % 10.71/2.32 axiom_0, axiom_1, axiom_10, cUnsatisfiable_substitution_1, % 10.71/2.33 ca_Vx3_substitution_1, cc_substitution_1, ccxcomp_substitution_1, % 10.71/2.33 cd_substitution_1, cowlNothing_substitution_1, cowlThing_substitution_1, % 10.71/2.33 ra_Px1_substitution_1, ra_Px1_substitution_2, rf_substitution_1, % 10.71/2.33 rf_substitution_2, rinvF_substitution_1, rinvF_substitution_2, % 10.71/2.33 rinvR_substitution_1, rinvR_substitution_2, rr_substitution_1, % 10.71/2.33 rr_substitution_2, xsd_integer_substitution_1, xsd_string_substitution_1 % 10.71/2.33 % 10.71/2.33 Those formulas are unsatisfiable: % 10.71/2.33 --------------------------------- % 10.71/2.33 % 10.71/2.33 Begin of proof % 10.71/2.33 | % 10.71/2.33 | ALPHA: (axiom_11) implies: % 10.71/2.33 | (1) cUnsatisfiable(i2003_11_14_17_21_4056) % 10.71/2.33 | (2) $i(i2003_11_14_17_21_4056) % 10.71/2.33 | % 10.71/2.33 | ALPHA: (axiom_9) implies: % 10.71/2.33 | (3) ! [v0: $i] : ! [v1: $i] : ( ~ $i(v1) | ~ $i(v0) | ~ rr(v1, v0) | % 10.71/2.33 | rinvR(v0, v1)) % 10.71/2.33 | % 10.71/2.33 | ALPHA: (axiom_8) implies: % 10.71/2.33 | (4) ! [v0: $i] : ! [v1: $i] : ( ~ $i(v1) | ~ $i(v0) | ~ rinvF(v0, v1) | % 10.71/2.33 | rf(v1, v0)) % 10.71/2.33 | % 10.71/2.33 | ALPHA: (axiom_6) implies: % 10.71/2.33 | (5) ! [v0: $i] : ( ~ $i(v0) | ~ ca_Vx3(v0) | ? [v1: $i] : ($i(v1) & % 10.71/2.33 | rinvF(v0, v1) & cd(v1))) % 10.71/2.33 | % 10.71/2.33 | ALPHA: (axiom_5) implies: % 10.71/2.33 | (6) ! [v0: $i] : ( ~ $i(v0) | ~ cd(v0) | ? [v1: $i] : ($i(v1) & rf(v0, % 10.71/2.33 | v1) & ccxcomp(v1))) % 10.71/2.33 | (7) ! [v0: $i] : ( ~ $i(v0) | ~ cd(v0) | cc(v0)) % 10.71/2.33 | % 10.71/2.33 | ALPHA: (axiom_4) implies: % 10.71/2.34 | (8) ! [v0: $i] : ( ~ $i(v0) | ~ ccxcomp(v0) | ? [v1: $i] : ($i(v1) & % 10.71/2.34 | ra_Px1(v0, v1))) % 10.71/2.34 | % 10.71/2.34 | ALPHA: (axiom_3) implies: % 10.71/2.34 | (9) ! [v0: $i] : ! [v1: $i] : ( ~ $i(v1) | ~ $i(v0) | ~ ra_Px1(v0, v1) % 10.71/2.34 | | ~ cc(v0)) % 10.71/2.34 | % 10.71/2.34 | ALPHA: (axiom_2) implies: % 10.71/2.34 | (10) ! [v0: $i] : ( ~ $i(v0) | ~ cUnsatisfiable(v0) | ? [v1: $i] : % 10.71/2.34 | ($i(v1) & rinvF(v0, v1) & cd(v1))) % 10.71/2.34 | (11) ! [v0: $i] : ! [v1: $i] : ( ~ $i(v1) | ~ $i(v0) | ~ rinvR(v0, v1) % 10.71/2.34 | | ~ cUnsatisfiable(v0) | ca_Vx3(v1)) % 10.71/2.34 | % 10.71/2.34 | GROUND_INST: instantiating (10) with i2003_11_14_17_21_4056, simplifying with % 10.71/2.34 | (1), (2) gives: % 10.71/2.34 | (12) ? [v0: $i] : ($i(v0) & rinvF(i2003_11_14_17_21_4056, v0) & cd(v0)) % 10.71/2.34 | % 10.71/2.34 | DELTA: instantiating (12) with fresh symbol all_24_0 gives: % 10.71/2.34 | (13) $i(all_24_0) & rinvF(i2003_11_14_17_21_4056, all_24_0) & cd(all_24_0) % 10.71/2.34 | % 10.71/2.34 | ALPHA: (13) implies: % 10.71/2.34 | (14) cd(all_24_0) % 10.71/2.34 | (15) rinvF(i2003_11_14_17_21_4056, all_24_0) % 10.71/2.34 | (16) $i(all_24_0) % 10.71/2.34 | % 10.71/2.34 | GROUND_INST: instantiating (7) with all_24_0, simplifying with (14), (16) % 10.71/2.34 | gives: % 10.71/2.34 | (17) cc(all_24_0) % 10.71/2.34 | % 10.71/2.34 | GROUND_INST: instantiating (6) with all_24_0, simplifying with (14), (16) % 10.71/2.34 | gives: % 10.71/2.34 | (18) ? [v0: $i] : ($i(v0) & rf(all_24_0, v0) & ccxcomp(v0)) % 10.71/2.34 | % 10.71/2.34 | GROUND_INST: instantiating (4) with i2003_11_14_17_21_4056, all_24_0, % 10.71/2.34 | simplifying with (2), (15), (16) gives: % 10.71/2.34 | (19) rf(all_24_0, i2003_11_14_17_21_4056) % 10.71/2.34 | % 10.71/2.34 | DELTA: instantiating (18) with fresh symbol all_34_0 gives: % 10.71/2.35 | (20) $i(all_34_0) & rf(all_24_0, all_34_0) & ccxcomp(all_34_0) % 10.71/2.35 | % 10.71/2.35 | ALPHA: (20) implies: % 10.71/2.35 | (21) rf(all_24_0, all_34_0) % 10.71/2.35 | (22) $i(all_34_0) % 10.71/2.35 | % 10.71/2.35 | GROUND_INST: instantiating (axiom_7) with all_24_0, i2003_11_14_17_21_4056, % 10.71/2.35 | all_34_0, simplifying with (2), (16), (19), (21), (22) gives: % 10.71/2.35 | (23) all_34_0 = i2003_11_14_17_21_4056 % 10.71/2.35 | % 10.71/2.35 | GROUND_INST: instantiating (axiom_12) with all_24_0, all_34_0, simplifying % 10.71/2.35 | with (16), (21), (22) gives: % 10.71/2.35 | (24) rr(all_24_0, all_34_0) % 10.71/2.35 | % 10.71/2.35 | REDUCE: (23), (24) imply: % 10.71/2.35 | (25) rr(all_24_0, i2003_11_14_17_21_4056) % 10.71/2.35 | % 10.71/2.35 | GROUND_INST: instantiating (3) with i2003_11_14_17_21_4056, all_24_0, % 10.71/2.35 | simplifying with (2), (16), (25) gives: % 10.71/2.35 | (26) rinvR(i2003_11_14_17_21_4056, all_24_0) % 10.71/2.35 | % 10.71/2.35 | GROUND_INST: instantiating (11) with i2003_11_14_17_21_4056, all_24_0, % 10.71/2.35 | simplifying with (1), (2), (16), (26) gives: % 10.71/2.35 | (27) ca_Vx3(all_24_0) % 10.71/2.35 | % 10.71/2.35 | GROUND_INST: instantiating (5) with all_24_0, simplifying with (16), (27) % 10.71/2.35 | gives: % 10.71/2.35 | (28) ? [v0: $i] : ($i(v0) & rinvF(all_24_0, v0) & cd(v0)) % 10.71/2.35 | % 10.71/2.35 | DELTA: instantiating (28) with fresh symbol all_76_0 gives: % 10.71/2.35 | (29) $i(all_76_0) & rinvF(all_24_0, all_76_0) & cd(all_76_0) % 10.71/2.35 | % 10.71/2.35 | ALPHA: (29) implies: % 10.71/2.35 | (30) cd(all_76_0) % 10.71/2.35 | (31) rinvF(all_24_0, all_76_0) % 10.71/2.35 | (32) $i(all_76_0) % 10.71/2.35 | % 10.71/2.35 | GROUND_INST: instantiating (6) with all_76_0, simplifying with (30), (32) % 10.71/2.35 | gives: % 10.71/2.35 | (33) ? [v0: $i] : ($i(v0) & rf(all_76_0, v0) & ccxcomp(v0)) % 10.71/2.35 | % 10.71/2.35 | GROUND_INST: instantiating (4) with all_24_0, all_76_0, simplifying with (16), % 10.71/2.35 | (31), (32) gives: % 10.71/2.35 | (34) rf(all_76_0, all_24_0) % 10.71/2.35 | % 10.71/2.35 | DELTA: instantiating (33) with fresh symbol all_84_0 gives: % 10.71/2.35 | (35) $i(all_84_0) & rf(all_76_0, all_84_0) & ccxcomp(all_84_0) % 10.71/2.35 | % 10.71/2.35 | ALPHA: (35) implies: % 10.71/2.35 | (36) ccxcomp(all_84_0) % 10.71/2.35 | (37) rf(all_76_0, all_84_0) % 10.71/2.35 | (38) $i(all_84_0) % 10.71/2.35 | % 10.71/2.35 | GROUND_INST: instantiating (8) with all_84_0, simplifying with (36), (38) % 10.71/2.35 | gives: % 10.71/2.35 | (39) ? [v0: $i] : ($i(v0) & ra_Px1(all_84_0, v0)) % 10.71/2.35 | % 10.71/2.35 | GROUND_INST: instantiating (axiom_7) with all_76_0, all_24_0, all_84_0, % 10.71/2.35 | simplifying with (16), (32), (34), (37), (38) gives: % 10.71/2.35 | (40) all_84_0 = all_24_0 % 10.71/2.35 | % 10.71/2.35 | DELTA: instantiating (39) with fresh symbol all_96_0 gives: % 10.71/2.36 | (41) $i(all_96_0) & ra_Px1(all_84_0, all_96_0) % 10.71/2.36 | % 10.71/2.36 | ALPHA: (41) implies: % 10.71/2.36 | (42) ra_Px1(all_84_0, all_96_0) % 10.71/2.36 | (43) $i(all_96_0) % 10.71/2.36 | % 10.71/2.36 | REDUCE: (40), (42) imply: % 10.71/2.36 | (44) ra_Px1(all_24_0, all_96_0) % 10.71/2.36 | % 10.71/2.36 | GROUND_INST: instantiating (9) with all_24_0, all_96_0, simplifying with (16), % 10.71/2.36 | (17), (43), (44) gives: % 10.71/2.36 | (45) $false % 10.71/2.36 | % 10.71/2.36 | CLOSE: (45) is inconsistent. % 10.71/2.36 | % 10.71/2.36 End of proof % 10.71/2.36 % SZS output end Proof for theBenchmark % 10.71/2.36 % 10.71/2.36 1742ms %------------------------------------------------------------------------------