%------------------------------------------------------------------------------ % File : Princess---230619 % Problem : KRS114+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 : n020.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:18 EDT 2023 % Result : Unsatisfiable 6.80s 1.70s % Output : Proof 9.24s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.12 % Problem : KRS114+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.14/0.34 % Computer : n020.cluster.edu % 0.14/0.34 % Model : x86_64 x86_64 % 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.14/0.34 % Memory : 8042.1875MB % 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64 % 0.14/0.34 % CPULimit : 300 % 0.14/0.34 % WCLimit : 300 % 0.14/0.34 % DateTime : Mon Aug 28 01:13:14 EDT 2023 % 0.14/0.34 % CPUTime : % 0.20/0.62 ________ _____ % 0.20/0.62 ___ __ \_________(_)________________________________ % 0.20/0.62 __ /_/ /_ ___/_ /__ __ \ ___/ _ \_ ___/_ ___/ % 0.20/0.62 _ ____/_ / _ / _ / / / /__ / __/(__ )_(__ ) % 0.20/0.62 /_/ /_/ /_/ /_/ /_/\___/ \___//____/ /____/ % 0.20/0.62 % 0.20/0.62 A Theorem Prover for First-Order Logic modulo Linear Integer Arithmetic % 0.20/0.62 (2023-06-19) % 0.20/0.62 % 0.20/0.62 (c) Philipp Rümmer, 2009-2023 % 0.20/0.62 Contributors: Peter Backeman, Peter Baumgartner, Angelo Brillout, Zafer Esen, % 0.20/0.62 Amanda Stjerna. % 0.20/0.62 Free software under BSD-3-Clause. % 0.20/0.62 % 0.20/0.62 For more information, visit http://www.philipp.ruemmer.org/princess.shtml % 0.20/0.62 % 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 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 % 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 % 2.43/1.06 Prover 4: Preprocessing ... % 2.43/1.06 Prover 1: Preprocessing ... % 3.01/1.10 Prover 2: Preprocessing ... % 3.01/1.10 Prover 5: Preprocessing ... % 3.01/1.10 Prover 3: Preprocessing ... % 3.01/1.10 Prover 6: Preprocessing ... % 3.01/1.10 Prover 0: Preprocessing ... % 5.12/1.46 Prover 5: Proving ... % 5.12/1.46 Prover 2: Proving ... % 5.12/1.51 Prover 6: Proving ... % 5.12/1.54 Prover 1: Constructing countermodel ... % 5.12/1.54 Prover 3: Constructing countermodel ... % 5.12/1.55 Prover 4: Constructing countermodel ... % 5.97/1.60 Prover 0: Proving ... % 6.80/1.70 Prover 2: proved (1058ms) % 6.80/1.70 % 6.80/1.70 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p % 6.80/1.70 % 6.80/1.71 Prover 5: proved (1055ms) % 6.80/1.71 % 6.80/1.71 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p % 6.80/1.71 % 6.80/1.71 Prover 3: gave up % 6.80/1.71 Prover 6: stopped % 7.48/1.72 Prover 0: stopped % 7.48/1.72 Prover 7: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470 % 7.48/1.72 Prover 8: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089 % 7.48/1.72 Prover 10: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=919308125 % 7.48/1.72 Prover 11: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1509710984 % 7.48/1.72 Prover 13: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=complete -randomSeed=1138197443 % 7.48/1.75 Prover 1: gave up % 7.48/1.75 Prover 16: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=completeFrugal -randomSeed=-2043353683 % 7.48/1.75 Prover 4: Found proof (size 29) % 7.48/1.75 Prover 4: proved (1110ms) % 7.48/1.78 Prover 8: Preprocessing ... % 8.03/1.79 Prover 11: Preprocessing ... % 8.03/1.79 Prover 10: Preprocessing ... % 8.03/1.79 Prover 7: Preprocessing ... % 8.03/1.79 Prover 13: Preprocessing ... % 8.03/1.80 Prover 7: stopped % 8.03/1.82 Prover 10: stopped % 8.03/1.83 Prover 16: Preprocessing ... % 8.03/1.83 Prover 13: stopped % 8.03/1.84 Prover 16: stopped % 8.03/1.85 Prover 11: stopped % 8.79/1.93 Prover 8: Warning: ignoring some quantifiers % 8.79/1.94 Prover 8: Constructing countermodel ... % 8.79/1.95 Prover 8: stopped % 8.79/1.95 % 8.79/1.95 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p % 8.79/1.95 % 8.79/1.95 % SZS output start Proof for theBenchmark % 8.79/1.96 Assumptions after simplification: % 8.79/1.96 --------------------------------- % 8.79/1.96 % 8.79/1.96 (axiom_10) % 8.79/1.99 ! [v0: $i] : ! [v1: $i] : ! [v2: int] : (v2 = 0 | ~ (rr(v1, v0) = v2) | ~ % 8.79/1.99 $i(v1) | ~ $i(v0) | ? [v3: int] : ( ~ (v3 = 0) & rinvR(v0, v1) = v3)) & ! % 8.79/1.99 [v0: $i] : ! [v1: $i] : ! [v2: int] : (v2 = 0 | ~ (rinvR(v0, v1) = v2) | ~ % 8.79/1.99 $i(v1) | ~ $i(v0) | ? [v3: int] : ( ~ (v3 = 0) & rr(v1, v0) = v3)) & ! % 8.79/1.99 [v0: $i] : ! [v1: $i] : ( ~ (rr(v1, v0) = 0) | ~ $i(v1) | ~ $i(v0) | % 8.79/1.99 rinvR(v0, v1) = 0) & ! [v0: $i] : ! [v1: $i] : ( ~ (rinvR(v0, v1) = 0) | % 8.79/1.99 ~ $i(v1) | ~ $i(v0) | rr(v1, v0) = 0) % 8.79/1.99 % 8.79/1.99 (axiom_11) % 8.79/1.99 cUnsatisfiable(i2003_11_14_17_21_262) = 0 & $i(i2003_11_14_17_21_262) % 8.79/1.99 % 8.79/1.99 (axiom_2) % 8.79/2.00 ! [v0: $i] : ! [v1: int] : ! [v2: $i] : ! [v3: $i] : (v1 = 0 | ~ (rs(v0, % 8.79/2.00 v2) = 0) | ~ (rr(v0, v3) = 0) | ~ (cUnsatisfiable(v0) = v1) | ~ % 8.79/2.00 $i(v3) | ~ $i(v2) | ~ $i(v0) | ? [v4: int] : (( ~ (v4 = 0) & ca_Ax4(v3) = % 8.79/2.00 v4) | ( ~ (v4 = 0) & ca_Ax3(v2) = v4))) & ! [v0: $i] : ! [v1: int] : % 8.79/2.00 ! [v2: $i] : ! [v3: $i] : (v1 = 0 | ~ (rs(v0, v2) = 0) | ~ (ca_Ax4(v3) = 0) % 8.79/2.00 | ~ (cUnsatisfiable(v0) = v1) | ~ $i(v3) | ~ $i(v2) | ~ $i(v0) | ? [v4: % 8.79/2.00 int] : (( ~ (v4 = 0) & rr(v0, v3) = v4) | ( ~ (v4 = 0) & ca_Ax3(v2) = % 8.79/2.00 v4))) & ! [v0: $i] : ! [v1: int] : ! [v2: $i] : ! [v3: $i] : (v1 = 0 % 8.79/2.00 | ~ (rr(v0, v3) = 0) | ~ (ca_Ax3(v2) = 0) | ~ (cUnsatisfiable(v0) = v1) | % 8.79/2.00 ~ $i(v3) | ~ $i(v2) | ~ $i(v0) | ? [v4: int] : (( ~ (v4 = 0) & rs(v0, % 8.79/2.00 v2) = v4) | ( ~ (v4 = 0) & ca_Ax4(v3) = v4))) & ! [v0: $i] : ! [v1: % 8.79/2.00 int] : ! [v2: $i] : ! [v3: $i] : (v1 = 0 | ~ (ca_Ax4(v3) = 0) | ~ % 8.79/2.00 (ca_Ax3(v2) = 0) | ~ (cUnsatisfiable(v0) = v1) | ~ $i(v3) | ~ $i(v2) | ~ % 8.79/2.00 $i(v0) | ? [v4: int] : (( ~ (v4 = 0) & rs(v0, v2) = v4) | ( ~ (v4 = 0) & % 8.79/2.00 rr(v0, v3) = v4))) & ! [v0: $i] : ( ~ (cUnsatisfiable(v0) = 0) | ~ % 8.79/2.00 $i(v0) | ? [v1: $i] : (rs(v0, v1) = 0 & ca_Ax3(v1) = 0 & $i(v1))) & ! [v0: % 8.79/2.00 $i] : ( ~ (cUnsatisfiable(v0) = 0) | ~ $i(v0) | ? [v1: $i] : (rr(v0, v1) = % 8.79/2.00 0 & ca_Ax4(v1) = 0 & $i(v1))) % 8.79/2.00 % 8.79/2.00 (axiom_3) % 8.79/2.00 ! [v0: $i] : ! [v1: int] : (v1 = 0 | ~ (cp(v0) = v1) | ~ $i(v0) | ? [v2: % 8.79/2.00 $i] : (ra_Px1(v0, v2) = 0 & $i(v2))) & ! [v0: $i] : ! [v1: $i] : ( ~ % 8.79/2.00 (ra_Px1(v0, v1) = 0) | ~ (cp(v0) = 0) | ~ $i(v1) | ~ $i(v0)) % 8.79/2.00 % 8.79/2.00 (axiom_4) % 8.79/2.01 ! [v0: $i] : ! [v1: int] : ! [v2: $i] : (v1 = 0 | ~ (ra_Px1(v0, v2) = 0) | % 8.79/2.01 ~ (cpxcomp(v0) = v1) | ~ $i(v2) | ~ $i(v0)) & ! [v0: $i] : ( ~ % 8.79/2.01 (cpxcomp(v0) = 0) | ~ $i(v0) | ? [v1: $i] : (ra_Px1(v0, v1) = 0 & $i(v1))) % 8.79/2.01 % 8.79/2.01 (axiom_7) % 8.79/2.01 ! [v0: $i] : ! [v1: int] : (v1 = 0 | ~ (ca_Ax3(v0) = v1) | ~ $i(v0) | ? % 8.79/2.01 [v2: any] : ? [v3: any] : (cqxcomp(v0) = v2 & cpxcomp(v0) = v3 & ( ~ (v3 = % 8.79/2.01 0) | ~ (v2 = 0)))) & ! [v0: $i] : ! [v1: any] : ( ~ (cqxcomp(v0) = % 8.79/2.01 v1) | ~ $i(v0) | ? [v2: any] : ? [v3: any] : (cpxcomp(v0) = v3 & % 8.79/2.01 ca_Ax3(v0) = v2 & ( ~ (v2 = 0) | (v3 = 0 & v1 = 0)))) & ! [v0: $i] : ! % 8.79/2.01 [v1: any] : ( ~ (cpxcomp(v0) = v1) | ~ $i(v0) | ? [v2: any] : ? [v3: any] : % 8.79/2.01 (cqxcomp(v0) = v3 & ca_Ax3(v0) = v2 & ( ~ (v2 = 0) | (v3 = 0 & v1 = 0)))) & % 8.79/2.01 ! [v0: $i] : ( ~ (cqxcomp(v0) = 0) | ~ $i(v0) | ? [v1: any] : ? [v2: any] : % 8.79/2.01 (cpxcomp(v0) = v1 & ca_Ax3(v0) = v2 & ( ~ (v1 = 0) | v2 = 0))) & ! [v0: $i] % 9.24/2.01 : ( ~ (cpxcomp(v0) = 0) | ~ $i(v0) | ? [v1: any] : ? [v2: any] : % 9.24/2.01 (cqxcomp(v0) = v1 & ca_Ax3(v0) = v2 & ( ~ (v1 = 0) | v2 = 0))) & ! [v0: $i] % 9.24/2.01 : ( ~ (ca_Ax3(v0) = 0) | ~ $i(v0) | (cqxcomp(v0) = 0 & cpxcomp(v0) = 0)) % 9.24/2.01 % 9.24/2.01 (axiom_8) % 9.24/2.02 ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : (v2 = v1 | ~ (rinvR(v0, v2) = 0) | % 9.24/2.02 ~ (rinvR(v0, v1) = 0) | ~ (ca_Ax4(v0) = 0) | ~ $i(v2) | ~ $i(v1) | ~ % 9.24/2.02 $i(v0)) & ! [v0: $i] : ! [v1: int] : ! [v2: $i] : (v1 = 0 | ~ (rinvR(v0, % 9.24/2.02 v2) = 0) | ~ (ca_Ax4(v0) = v1) | ~ $i(v2) | ~ $i(v0) | ? [v3: int] : % 9.24/2.02 ? [v4: $i] : ? [v5: $i] : ? [v6: int] : ? [v7: int] : ($i(v5) & $i(v4) & % 9.24/2.02 ((v7 = 0 & v6 = 0 & ~ (v5 = v4) & rinvR(v0, v5) = 0 & rinvR(v0, v4) = 0) % 9.24/2.02 | ( ~ (v3 = 0) & ca_Vx5(v2) = v3)))) & ! [v0: $i] : ! [v1: int] : ! % 9.24/2.02 [v2: $i] : (v1 = 0 | ~ (ca_Vx5(v2) = 0) | ~ (ca_Ax4(v0) = v1) | ~ $i(v2) | % 9.24/2.02 ~ $i(v0) | ? [v3: int] : ? [v4: $i] : ? [v5: $i] : ? [v6: int] : ? [v7: % 9.24/2.02 int] : ($i(v5) & $i(v4) & ((v7 = 0 & v6 = 0 & ~ (v5 = v4) & rinvR(v0, v5) % 9.24/2.02 = 0 & rinvR(v0, v4) = 0) | ( ~ (v3 = 0) & rinvR(v0, v2) = v3)))) & ! % 9.24/2.02 [v0: $i] : ( ~ (ca_Ax4(v0) = 0) | ~ $i(v0) | ? [v1: $i] : (rinvR(v0, v1) = 0 % 9.24/2.02 & ca_Vx5(v1) = 0 & $i(v1))) % 9.24/2.02 % 9.24/2.02 (axiom_9) % 9.24/2.02 ! [v0: $i] : ! [v1: $i] : ! [v2: int] : (v2 = 0 | ~ (cp(v1) = v2) | ~ % 9.24/2.02 (ca_Vx5(v0) = 0) | ~ $i(v1) | ~ $i(v0) | ? [v3: int] : ( ~ (v3 = 0) & % 9.24/2.02 rs(v0, v1) = v3)) & ! [v0: $i] : ! [v1: int] : (v1 = 0 | ~ (ca_Vx5(v0) % 9.24/2.02 = v1) | ~ $i(v0) | ? [v2: $i] : ? [v3: int] : ( ~ (v3 = 0) & rs(v0, v2) % 9.24/2.02 = 0 & cp(v2) = v3 & $i(v2))) & ! [v0: $i] : ! [v1: $i] : ( ~ (rs(v0, v1) % 9.24/2.02 = 0) | ~ (ca_Vx5(v0) = 0) | ~ $i(v1) | ~ $i(v0) | cp(v1) = 0) % 9.24/2.02 % 9.24/2.02 Further assumptions not needed in the proof: % 9.24/2.02 -------------------------------------------- % 9.24/2.02 axiom_0, axiom_1, axiom_5, axiom_6, cUnsatisfiable_substitution_1, % 9.24/2.02 ca_Ax3_substitution_1, ca_Ax4_substitution_1, ca_Vx5_substitution_1, % 9.24/2.02 cowlNothing_substitution_1, cowlThing_substitution_1, cp_substitution_1, % 9.24/2.02 cpxcomp_substitution_1, cq_substitution_1, cqxcomp_substitution_1, % 9.24/2.02 ra_Px1_substitution_1, ra_Px1_substitution_2, ra_Px2_substitution_1, % 9.24/2.02 ra_Px2_substitution_2, rinvR_substitution_1, rinvR_substitution_2, % 9.24/2.02 rr_substitution_1, rr_substitution_2, rs_substitution_1, rs_substitution_2, % 9.24/2.02 xsd_integer_substitution_1, xsd_string_substitution_1 % 9.24/2.02 % 9.24/2.02 Those formulas are unsatisfiable: % 9.24/2.02 --------------------------------- % 9.24/2.02 % 9.24/2.02 Begin of proof % 9.24/2.03 | % 9.24/2.03 | ALPHA: (axiom_2) implies: % 9.24/2.03 | (1) ! [v0: $i] : ( ~ (cUnsatisfiable(v0) = 0) | ~ $i(v0) | ? [v1: $i] : % 9.24/2.03 | (rr(v0, v1) = 0 & ca_Ax4(v1) = 0 & $i(v1))) % 9.24/2.03 | (2) ! [v0: $i] : ( ~ (cUnsatisfiable(v0) = 0) | ~ $i(v0) | ? [v1: $i] : % 9.24/2.03 | (rs(v0, v1) = 0 & ca_Ax3(v1) = 0 & $i(v1))) % 9.24/2.03 | % 9.24/2.03 | ALPHA: (axiom_3) implies: % 9.24/2.03 | (3) ! [v0: $i] : ! [v1: $i] : ( ~ (ra_Px1(v0, v1) = 0) | ~ (cp(v0) = 0) % 9.24/2.03 | | ~ $i(v1) | ~ $i(v0)) % 9.24/2.03 | % 9.24/2.03 | ALPHA: (axiom_4) implies: % 9.24/2.03 | (4) ! [v0: $i] : ( ~ (cpxcomp(v0) = 0) | ~ $i(v0) | ? [v1: $i] : % 9.24/2.03 | (ra_Px1(v0, v1) = 0 & $i(v1))) % 9.24/2.03 | % 9.24/2.03 | ALPHA: (axiom_7) implies: % 9.24/2.03 | (5) ! [v0: $i] : ( ~ (ca_Ax3(v0) = 0) | ~ $i(v0) | (cqxcomp(v0) = 0 & % 9.24/2.03 | cpxcomp(v0) = 0)) % 9.24/2.03 | % 9.24/2.03 | ALPHA: (axiom_8) implies: % 9.24/2.03 | (6) ! [v0: $i] : ( ~ (ca_Ax4(v0) = 0) | ~ $i(v0) | ? [v1: $i] : % 9.24/2.03 | (rinvR(v0, v1) = 0 & ca_Vx5(v1) = 0 & $i(v1))) % 9.24/2.03 | (7) ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : (v2 = v1 | ~ (rinvR(v0, v2) % 9.24/2.03 | = 0) | ~ (rinvR(v0, v1) = 0) | ~ (ca_Ax4(v0) = 0) | ~ $i(v2) | % 9.24/2.03 | ~ $i(v1) | ~ $i(v0)) % 9.24/2.03 | % 9.24/2.03 | ALPHA: (axiom_9) implies: % 9.24/2.04 | (8) ! [v0: $i] : ! [v1: $i] : ( ~ (rs(v0, v1) = 0) | ~ (ca_Vx5(v0) = 0) % 9.24/2.04 | | ~ $i(v1) | ~ $i(v0) | cp(v1) = 0) % 9.24/2.04 | % 9.24/2.04 | ALPHA: (axiom_10) implies: % 9.24/2.04 | (9) ! [v0: $i] : ! [v1: $i] : ( ~ (rr(v1, v0) = 0) | ~ $i(v1) | ~ % 9.24/2.04 | $i(v0) | rinvR(v0, v1) = 0) % 9.24/2.04 | % 9.24/2.04 | ALPHA: (axiom_11) implies: % 9.24/2.04 | (10) $i(i2003_11_14_17_21_262) % 9.24/2.04 | (11) cUnsatisfiable(i2003_11_14_17_21_262) = 0 % 9.24/2.04 | % 9.24/2.04 | GROUND_INST: instantiating (2) with i2003_11_14_17_21_262, simplifying with % 9.24/2.04 | (10), (11) gives: % 9.24/2.04 | (12) ? [v0: $i] : (rs(i2003_11_14_17_21_262, v0) = 0 & ca_Ax3(v0) = 0 & % 9.24/2.04 | $i(v0)) % 9.24/2.04 | % 9.24/2.04 | GROUND_INST: instantiating (1) with i2003_11_14_17_21_262, simplifying with % 9.24/2.04 | (10), (11) gives: % 9.24/2.04 | (13) ? [v0: $i] : (rr(i2003_11_14_17_21_262, v0) = 0 & ca_Ax4(v0) = 0 & % 9.24/2.04 | $i(v0)) % 9.24/2.04 | % 9.24/2.04 | DELTA: instantiating (13) with fresh symbol all_20_0 gives: % 9.24/2.04 | (14) rr(i2003_11_14_17_21_262, all_20_0) = 0 & ca_Ax4(all_20_0) = 0 & % 9.24/2.04 | $i(all_20_0) % 9.24/2.04 | % 9.24/2.04 | ALPHA: (14) implies: % 9.24/2.04 | (15) $i(all_20_0) % 9.24/2.04 | (16) ca_Ax4(all_20_0) = 0 % 9.24/2.04 | (17) rr(i2003_11_14_17_21_262, all_20_0) = 0 % 9.24/2.04 | % 9.24/2.04 | DELTA: instantiating (12) with fresh symbol all_22_0 gives: % 9.24/2.04 | (18) rs(i2003_11_14_17_21_262, all_22_0) = 0 & ca_Ax3(all_22_0) = 0 & % 9.24/2.04 | $i(all_22_0) % 9.24/2.04 | % 9.24/2.04 | ALPHA: (18) implies: % 9.24/2.04 | (19) $i(all_22_0) % 9.24/2.04 | (20) ca_Ax3(all_22_0) = 0 % 9.24/2.04 | (21) rs(i2003_11_14_17_21_262, all_22_0) = 0 % 9.24/2.04 | % 9.24/2.04 | GROUND_INST: instantiating (5) with all_22_0, simplifying with (19), (20) % 9.24/2.04 | gives: % 9.24/2.04 | (22) cqxcomp(all_22_0) = 0 & cpxcomp(all_22_0) = 0 % 9.24/2.04 | % 9.24/2.04 | ALPHA: (22) implies: % 9.24/2.04 | (23) cpxcomp(all_22_0) = 0 % 9.24/2.04 | % 9.24/2.04 | GROUND_INST: instantiating (6) with all_20_0, simplifying with (15), (16) % 9.24/2.04 | gives: % 9.24/2.05 | (24) ? [v0: $i] : (rinvR(all_20_0, v0) = 0 & ca_Vx5(v0) = 0 & $i(v0)) % 9.24/2.05 | % 9.24/2.05 | GROUND_INST: instantiating (9) with all_20_0, i2003_11_14_17_21_262, % 9.24/2.05 | simplifying with (10), (15), (17) gives: % 9.24/2.05 | (25) rinvR(all_20_0, i2003_11_14_17_21_262) = 0 % 9.24/2.05 | % 9.24/2.05 | DELTA: instantiating (24) with fresh symbol all_30_0 gives: % 9.24/2.05 | (26) rinvR(all_20_0, all_30_0) = 0 & ca_Vx5(all_30_0) = 0 & $i(all_30_0) % 9.24/2.05 | % 9.24/2.05 | ALPHA: (26) implies: % 9.24/2.05 | (27) $i(all_30_0) % 9.24/2.05 | (28) ca_Vx5(all_30_0) = 0 % 9.24/2.05 | (29) rinvR(all_20_0, all_30_0) = 0 % 9.24/2.05 | % 9.24/2.05 | GROUND_INST: instantiating (4) with all_22_0, simplifying with (19), (23) % 9.24/2.05 | gives: % 9.24/2.05 | (30) ? [v0: $i] : (ra_Px1(all_22_0, v0) = 0 & $i(v0)) % 9.24/2.05 | % 9.24/2.05 | GROUND_INST: instantiating (7) with all_20_0, i2003_11_14_17_21_262, all_30_0, % 9.24/2.05 | simplifying with (10), (15), (16), (25), (27), (29) gives: % 9.24/2.05 | (31) all_30_0 = i2003_11_14_17_21_262 % 9.24/2.05 | % 9.24/2.05 | DELTA: instantiating (30) with fresh symbol all_38_0 gives: % 9.24/2.05 | (32) ra_Px1(all_22_0, all_38_0) = 0 & $i(all_38_0) % 9.24/2.05 | % 9.24/2.05 | ALPHA: (32) implies: % 9.24/2.05 | (33) $i(all_38_0) % 9.24/2.05 | (34) ra_Px1(all_22_0, all_38_0) = 0 % 9.24/2.05 | % 9.24/2.05 | REDUCE: (28), (31) imply: % 9.24/2.05 | (35) ca_Vx5(i2003_11_14_17_21_262) = 0 % 9.24/2.05 | % 9.24/2.05 | GROUND_INST: instantiating (8) with i2003_11_14_17_21_262, all_22_0, % 9.24/2.05 | simplifying with (10), (19), (21), (35) gives: % 9.24/2.05 | (36) cp(all_22_0) = 0 % 9.24/2.05 | % 9.24/2.05 | GROUND_INST: instantiating (3) with all_22_0, all_38_0, simplifying with (19), % 9.24/2.05 | (33), (34), (36) gives: % 9.24/2.05 | (37) $false % 9.24/2.05 | % 9.24/2.05 | CLOSE: (37) is inconsistent. % 9.24/2.05 | % 9.24/2.05 End of proof % 9.24/2.05 % SZS output end Proof for theBenchmark % 9.24/2.05 % 9.24/2.05 1434ms %------------------------------------------------------------------------------