%------------------------------------------------------------------------------ % File : Princess---230619 % Problem : PRO009+2 : TPTP v8.1.2. Released v4.0.0. % Transfm : none % Format : tptp % Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s % Computer : n002.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 13:08:47 EDT 2023 % Result : Theorem 12.46s 2.72s % Output : Proof 25.87s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.08/0.12 % Problem : PRO009+2 : TPTP v8.1.2. Released v4.0.0. % 0.08/0.12 % Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s % 0.12/0.33 % Computer : n002.cluster.edu % 0.12/0.33 % Model : x86_64 x86_64 % 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.12/0.33 % Memory : 8042.1875MB % 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64 % 0.12/0.33 % CPULimit : 300 % 0.12/0.33 % WCLimit : 300 % 0.12/0.33 % DateTime : Mon Aug 28 19:47:19 EDT 2023 % 0.12/0.33 % CPUTime : % 0.19/0.60 ________ _____ % 0.19/0.60 ___ __ \_________(_)________________________________ % 0.19/0.60 __ /_/ /_ ___/_ /__ __ \ ___/ _ \_ ___/_ ___/ % 0.19/0.60 _ ____/_ / _ / _ / / / /__ / __/(__ )_(__ ) % 0.19/0.60 /_/ /_/ /_/ /_/ /_/\___/ \___//____/ /____/ % 0.19/0.60 % 0.19/0.60 A Theorem Prover for First-Order Logic modulo Linear Integer Arithmetic % 0.19/0.60 (2023-06-19) % 0.19/0.60 % 0.19/0.60 (c) Philipp Rümmer, 2009-2023 % 0.19/0.60 Contributors: Peter Backeman, Peter Baumgartner, Angelo Brillout, Zafer Esen, % 0.19/0.60 Amanda Stjerna. % 0.19/0.60 Free software under BSD-3-Clause. % 0.19/0.60 % 0.19/0.60 For more information, visit http://www.philipp.ruemmer.org/princess.shtml % 0.19/0.60 % 0.19/0.61 Loading /export/starexec/sandbox2/benchmark/theBenchmark.p ... % 0.19/0.62 Running up to 7 provers in parallel. % 0.19/0.64 Prover 1: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1571432423 % 0.19/0.64 Prover 0: Options: +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1042961893 % 0.19/0.64 Prover 2: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMinimalAndEmpty -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1065072994 % 0.19/0.64 Prover 3: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1922548996 % 0.19/0.64 Prover 4: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=1868514696 % 0.19/0.64 Prover 5: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=complete -randomSeed=1259561288 % 0.19/0.64 Prover 6: Options: -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximalOutermost -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1399714365 % 3.16/1.20 Prover 1: Preprocessing ... % 3.16/1.20 Prover 4: Preprocessing ... % 3.16/1.26 Prover 6: Preprocessing ... % 3.16/1.26 Prover 3: Preprocessing ... % 3.16/1.26 Prover 2: Preprocessing ... % 3.16/1.26 Prover 5: Preprocessing ... % 3.16/1.26 Prover 0: Preprocessing ... % 6.10/1.86 Prover 2: Constructing countermodel ... % 6.10/1.87 Prover 5: Proving ... % 7.13/1.92 Prover 6: Proving ... % 7.13/1.97 Prover 3: Constructing countermodel ... % 7.13/1.97 Prover 1: Constructing countermodel ... % 8.51/2.09 Prover 0: Proving ... % 8.74/2.18 Prover 4: Constructing countermodel ... % 12.46/2.72 Prover 5: proved (2082ms) % 12.46/2.72 % 12.46/2.72 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 12.46/2.72 % 12.46/2.72 Prover 2: stopped % 12.46/2.72 Prover 3: stopped % 12.62/2.74 Prover 7: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470 % 12.62/2.74 Prover 0: stopped % 12.62/2.74 Prover 6: stopped % 12.62/2.75 Prover 8: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089 % 12.62/2.75 Prover 10: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=919308125 % 12.62/2.75 Prover 11: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1509710984 % 12.62/2.75 Prover 13: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=complete -randomSeed=1138197443 % 12.62/2.82 Prover 7: Preprocessing ... % 12.62/2.82 Prover 8: Preprocessing ... % 12.62/2.82 Prover 11: Preprocessing ... % 13.27/2.83 Prover 10: Preprocessing ... % 13.27/2.84 Prover 13: Preprocessing ... % 13.66/2.96 Prover 13: Constructing countermodel ... % 14.20/2.97 Prover 10: Constructing countermodel ... % 14.20/2.97 Prover 7: Constructing countermodel ... % 14.43/3.10 Prover 8: Warning: ignoring some quantifiers % 15.08/3.14 Prover 8: Constructing countermodel ... % 15.72/3.24 Prover 11: Constructing countermodel ... % 25.87/4.70 Prover 7: Found proof (size 39) % 25.87/4.70 Prover 7: proved (1973ms) % 25.87/4.70 Prover 8: stopped % 25.87/4.70 Prover 10: stopped % 25.87/4.70 Prover 13: stopped % 25.87/4.70 Prover 4: stopped % 25.87/4.70 Prover 11: stopped % 25.87/4.71 Prover 1: stopped % 25.87/4.71 % 25.87/4.71 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 25.87/4.71 % 25.87/4.71 % SZS output start Proof for theBenchmark % 25.87/4.72 Assumptions after simplification: % 25.87/4.72 --------------------------------- % 25.87/4.72 % 25.87/4.72 (goals) % 25.87/4.72 $i(tptp1) & $i(tptp2) & $i(tptp3) & $i(tptp0) & ? [v0: $i] : ($i(v0) & % 25.87/4.72 occurrence_of(v0, tptp0) & ! [v1: $i] : ! [v2: $i] : ( ~ $i(v2) | ~ % 25.87/4.72 $i(v1) | ~ leaf_occ(v2, v0) | ~ root_occ(v1, v0) | ~ occurrence_of(v2, % 25.87/4.72 tptp1) | ~ occurrence_of(v1, tptp3) | ~ min_precedes(v1, v2, tptp0)) & % 25.87/4.72 ! [v1: $i] : ! [v2: $i] : ( ~ $i(v2) | ~ $i(v1) | ~ leaf_occ(v2, v0) | % 25.87/4.72 ~ root_occ(v1, v0) | ~ occurrence_of(v2, tptp2) | ~ occurrence_of(v1, % 25.87/4.72 tptp3) | ~ min_precedes(v1, v2, tptp0))) % 25.87/4.72 % 25.87/4.72 (sos) % 25.87/4.73 ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: $i] : ( ~ $i(v3) | ~ $i(v2) % 25.87/4.73 | ~ $i(v1) | ~ $i(v0) | ~ min_precedes(v1, v2, v3) | ~ min_precedes(v0, % 25.87/4.73 v1, v3) | min_precedes(v0, v2, v3)) % 25.87/4.73 % 25.87/4.73 (sos_02) % 25.87/4.73 ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: $i] : (v1 = v0 | ~ $i(v3) | % 25.87/4.73 ~ $i(v2) | ~ $i(v1) | ~ $i(v0) | ~ root_occ(v1, v2) | ~ root_occ(v0, % 25.87/4.73 v2) | ~ occurrence_of(v2, v3)) % 25.87/4.73 % 25.87/4.73 (sos_04) % 25.87/4.73 ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: $i] : ( ~ $i(v3) | ~ $i(v2) % 25.87/4.73 | ~ $i(v1) | ~ $i(v0) | ~ next_subocc(v0, v1, v2) | ~ min_precedes(v3, % 25.87/4.73 v1, v2) | ~ min_precedes(v0, v3, v2)) & ! [v0: $i] : ! [v1: $i] : ! % 25.87/4.73 [v2: $i] : ( ~ $i(v2) | ~ $i(v1) | ~ $i(v0) | ~ next_subocc(v0, v1, v2) | % 25.87/4.73 min_precedes(v0, v1, v2)) & ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ( ~ % 25.87/4.73 $i(v2) | ~ $i(v1) | ~ $i(v0) | ~ min_precedes(v0, v1, v2) | % 25.87/4.73 next_subocc(v0, v1, v2) | ? [v3: $i] : ($i(v3) & min_precedes(v3, v1, v2) & % 25.87/4.73 min_precedes(v0, v3, v2))) % 25.87/4.73 % 25.87/4.73 (sos_10) % 25.87/4.73 ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ( ~ $i(v2) | ~ $i(v1) | ~ $i(v0) | % 25.87/4.73 ~ subactivity_occurrence(v0, v1) | ~ root(v0, v2) | ~ occurrence_of(v1, % 25.87/4.73 v2) | root_occ(v0, v1)) & ! [v0: $i] : ! [v1: $i] : ( ~ $i(v1) | ~ % 25.87/4.73 $i(v0) | ~ root_occ(v0, v1) | ? [v2: $i] : ($i(v2) & % 25.87/4.73 subactivity_occurrence(v0, v1) & root(v0, v2) & occurrence_of(v1, v2))) % 25.87/4.73 % 25.87/4.73 (sos_18) % 25.87/4.73 ! [v0: $i] : ( ~ $i(v0) | ~ activity_occurrence(v0) | ? [v1: $i] : ($i(v1) % 25.87/4.73 & activity(v1) & occurrence_of(v0, v1))) % 25.87/4.73 % 25.87/4.73 (sos_22) % 25.87/4.74 ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : (v2 = v1 | ~ $i(v2) | ~ $i(v1) | % 25.87/4.74 ~ $i(v0) | ~ occurrence_of(v0, v2) | ~ occurrence_of(v0, v1)) % 25.87/4.74 % 25.87/4.74 (sos_29) % 25.87/4.74 ! [v0: $i] : ! [v1: $i] : ( ~ $i(v1) | ~ $i(v0) | ~ occurrence_of(v1, v0) % 25.87/4.74 | activity(v0)) & ! [v0: $i] : ! [v1: $i] : ( ~ $i(v1) | ~ $i(v0) | ~ % 25.87/4.74 occurrence_of(v1, v0) | activity_occurrence(v1)) % 25.87/4.74 % 25.87/4.74 (sos_30) % 25.87/4.74 ! [v0: $i] : ! [v1: $i] : ( ~ $i(v1) | ~ $i(v0) | ~ occurrence_of(v1, v0) % 25.87/4.74 | atomic(v0) | ? [v2: $i] : ($i(v2) & subactivity_occurrence(v2, v1) & % 25.87/4.74 root(v2, v0))) % 25.87/4.74 % 25.87/4.74 (sos_32) % 25.87/4.74 $i(tptp1) & $i(tptp2) & $i(tptp4) & $i(tptp3) & $i(tptp0) & ! [v0: $i] : ( ~ % 25.87/4.74 $i(v0) | ~ occurrence_of(v0, tptp0) | ? [v1: $i] : ? [v2: $i] : ? [v3: % 25.87/4.74 $i] : ($i(v3) & $i(v2) & $i(v1) & next_subocc(v2, v3, tptp0) & % 25.87/4.74 next_subocc(v1, v2, tptp0) & leaf_occ(v3, v0) & root_occ(v1, v0) & % 25.87/4.74 occurrence_of(v2, tptp4) & occurrence_of(v1, tptp3) & (occurrence_of(v3, % 25.87/4.74 tptp1) | occurrence_of(v3, tptp2)))) % 25.87/4.74 % 25.87/4.74 (sos_34) % 25.87/4.74 $i(tptp0) & ~ atomic(tptp0) % 25.87/4.74 % 25.87/4.74 (sos_39) % 25.87/4.74 ~ (tptp4 = tptp3) & $i(tptp4) & $i(tptp3) % 25.87/4.74 % 25.87/4.74 Further assumptions not needed in the proof: % 25.87/4.74 -------------------------------------------- % 25.87/4.74 sos_01, sos_03, sos_05, sos_06, sos_07, sos_08, sos_09, sos_11, sos_12, sos_13, % 25.87/4.74 sos_14, sos_15, sos_16, sos_17, sos_19, sos_20, sos_21, sos_23, sos_24, sos_25, % 25.87/4.74 sos_26, sos_27, sos_28, sos_31, sos_33, sos_35, sos_36, sos_37, sos_38, sos_40, % 25.87/4.74 sos_41, sos_42, sos_43, sos_44 % 25.87/4.74 % 25.87/4.74 Those formulas are unsatisfiable: % 25.87/4.74 --------------------------------- % 25.87/4.74 % 25.87/4.74 Begin of proof % 25.87/4.74 | % 25.87/4.74 | ALPHA: (goals) implies: % 25.87/4.75 | (1) ? [v0: $i] : ($i(v0) & occurrence_of(v0, tptp0) & ! [v1: $i] : ! % 25.87/4.75 | [v2: $i] : ( ~ $i(v2) | ~ $i(v1) | ~ leaf_occ(v2, v0) | ~ % 25.87/4.75 | root_occ(v1, v0) | ~ occurrence_of(v2, tptp1) | ~ % 25.87/4.75 | occurrence_of(v1, tptp3) | ~ min_precedes(v1, v2, tptp0)) & ! % 25.87/4.75 | [v1: $i] : ! [v2: $i] : ( ~ $i(v2) | ~ $i(v1) | ~ leaf_occ(v2, v0) % 25.87/4.75 | | ~ root_occ(v1, v0) | ~ occurrence_of(v2, tptp2) | ~ % 25.87/4.75 | occurrence_of(v1, tptp3) | ~ min_precedes(v1, v2, tptp0))) % 25.87/4.75 | % 25.87/4.75 | ALPHA: (sos_39) implies: % 25.87/4.75 | (2) ~ (tptp4 = tptp3) % 25.87/4.75 | % 25.87/4.75 | ALPHA: (sos_34) implies: % 25.87/4.75 | (3) ~ atomic(tptp0) % 25.87/4.75 | % 25.87/4.75 | ALPHA: (sos_32) implies: % 25.87/4.75 | (4) $i(tptp0) % 25.87/4.75 | (5) $i(tptp3) % 25.87/4.75 | (6) $i(tptp4) % 25.87/4.75 | (7) ! [v0: $i] : ( ~ $i(v0) | ~ occurrence_of(v0, tptp0) | ? [v1: $i] : % 25.87/4.75 | ? [v2: $i] : ? [v3: $i] : ($i(v3) & $i(v2) & $i(v1) & % 25.87/4.75 | next_subocc(v2, v3, tptp0) & next_subocc(v1, v2, tptp0) & % 25.87/4.75 | leaf_occ(v3, v0) & root_occ(v1, v0) & occurrence_of(v2, tptp4) & % 25.87/4.75 | occurrence_of(v1, tptp3) & (occurrence_of(v3, tptp1) | % 25.87/4.75 | occurrence_of(v3, tptp2)))) % 25.87/4.75 | % 25.87/4.75 | ALPHA: (sos_29) implies: % 25.87/4.75 | (8) ! [v0: $i] : ! [v1: $i] : ( ~ $i(v1) | ~ $i(v0) | ~ % 25.87/4.75 | occurrence_of(v1, v0) | activity_occurrence(v1)) % 25.87/4.75 | % 25.87/4.75 | ALPHA: (sos_10) implies: % 25.87/4.75 | (9) ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ( ~ $i(v2) | ~ $i(v1) | ~ % 25.87/4.75 | $i(v0) | ~ subactivity_occurrence(v0, v1) | ~ root(v0, v2) | ~ % 25.87/4.75 | occurrence_of(v1, v2) | root_occ(v0, v1)) % 25.87/4.75 | % 25.87/4.75 | ALPHA: (sos_04) implies: % 25.87/4.75 | (10) ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ( ~ $i(v2) | ~ $i(v1) | ~ % 25.87/4.75 | $i(v0) | ~ next_subocc(v0, v1, v2) | min_precedes(v0, v1, v2)) % 25.87/4.75 | % 25.87/4.75 | DELTA: instantiating (1) with fresh symbol all_36_0 gives: % 25.87/4.75 | (11) $i(all_36_0) & occurrence_of(all_36_0, tptp0) & ! [v0: $i] : ! [v1: % 25.87/4.75 | $i] : ( ~ $i(v1) | ~ $i(v0) | ~ leaf_occ(v1, all_36_0) | ~ % 25.87/4.75 | root_occ(v0, all_36_0) | ~ occurrence_of(v1, tptp1) | ~ % 25.87/4.75 | occurrence_of(v0, tptp3) | ~ min_precedes(v0, v1, tptp0)) & ! [v0: % 25.87/4.75 | $i] : ! [v1: $i] : ( ~ $i(v1) | ~ $i(v0) | ~ leaf_occ(v1, % 25.87/4.75 | all_36_0) | ~ root_occ(v0, all_36_0) | ~ occurrence_of(v1, % 25.87/4.75 | tptp2) | ~ occurrence_of(v0, tptp3) | ~ min_precedes(v0, v1, % 25.87/4.75 | tptp0)) % 25.87/4.75 | % 25.87/4.75 | ALPHA: (11) implies: % 25.87/4.75 | (12) occurrence_of(all_36_0, tptp0) % 25.87/4.75 | (13) $i(all_36_0) % 25.87/4.75 | (14) ! [v0: $i] : ! [v1: $i] : ( ~ $i(v1) | ~ $i(v0) | ~ leaf_occ(v1, % 25.87/4.75 | all_36_0) | ~ root_occ(v0, all_36_0) | ~ occurrence_of(v1, % 25.87/4.75 | tptp2) | ~ occurrence_of(v0, tptp3) | ~ min_precedes(v0, v1, % 25.87/4.75 | tptp0)) % 25.87/4.75 | (15) ! [v0: $i] : ! [v1: $i] : ( ~ $i(v1) | ~ $i(v0) | ~ leaf_occ(v1, % 25.87/4.75 | all_36_0) | ~ root_occ(v0, all_36_0) | ~ occurrence_of(v1, % 25.87/4.75 | tptp1) | ~ occurrence_of(v0, tptp3) | ~ min_precedes(v0, v1, % 25.87/4.75 | tptp0)) % 25.87/4.75 | % 25.87/4.76 | GROUND_INST: instantiating (7) with all_36_0, simplifying with (12), (13) % 25.87/4.76 | gives: % 25.87/4.76 | (16) ? [v0: $i] : ? [v1: $i] : ? [v2: $i] : ($i(v2) & $i(v1) & $i(v0) & % 25.87/4.76 | next_subocc(v1, v2, tptp0) & next_subocc(v0, v1, tptp0) & % 25.87/4.76 | leaf_occ(v2, all_36_0) & root_occ(v0, all_36_0) & occurrence_of(v1, % 25.87/4.76 | tptp4) & occurrence_of(v0, tptp3) & (occurrence_of(v2, tptp1) | % 25.87/4.76 | occurrence_of(v2, tptp2))) % 25.87/4.76 | % 25.87/4.76 | GROUND_INST: instantiating (8) with tptp0, all_36_0, simplifying with (4), % 25.87/4.76 | (12), (13) gives: % 25.87/4.76 | (17) activity_occurrence(all_36_0) % 25.87/4.76 | % 25.87/4.76 | GROUND_INST: instantiating (sos_30) with tptp0, all_36_0, simplifying with % 25.87/4.76 | (3), (4), (12), (13) gives: % 25.87/4.76 | (18) ? [v0: $i] : ($i(v0) & subactivity_occurrence(v0, all_36_0) & % 25.87/4.76 | root(v0, tptp0)) % 25.87/4.76 | % 25.87/4.76 | DELTA: instantiating (18) with fresh symbol all_49_0 gives: % 25.87/4.76 | (19) $i(all_49_0) & subactivity_occurrence(all_49_0, all_36_0) & % 25.87/4.76 | root(all_49_0, tptp0) % 25.87/4.76 | % 25.87/4.76 | ALPHA: (19) implies: % 25.87/4.76 | (20) root(all_49_0, tptp0) % 25.87/4.76 | (21) subactivity_occurrence(all_49_0, all_36_0) % 25.87/4.76 | (22) $i(all_49_0) % 25.87/4.76 | % 25.87/4.76 | DELTA: instantiating (16) with fresh symbols all_51_0, all_51_1, all_51_2 % 25.87/4.76 | gives: % 25.87/4.76 | (23) $i(all_51_0) & $i(all_51_1) & $i(all_51_2) & next_subocc(all_51_1, % 25.87/4.76 | all_51_0, tptp0) & next_subocc(all_51_2, all_51_1, tptp0) & % 25.87/4.76 | leaf_occ(all_51_0, all_36_0) & root_occ(all_51_2, all_36_0) & % 25.87/4.76 | occurrence_of(all_51_1, tptp4) & occurrence_of(all_51_2, tptp3) & % 25.87/4.76 | (occurrence_of(all_51_0, tptp1) | occurrence_of(all_51_0, tptp2)) % 25.87/4.76 | % 25.87/4.76 | ALPHA: (23) implies: % 25.87/4.76 | (24) occurrence_of(all_51_2, tptp3) % 25.87/4.76 | (25) root_occ(all_51_2, all_36_0) % 25.87/4.76 | (26) leaf_occ(all_51_0, all_36_0) % 25.87/4.76 | (27) next_subocc(all_51_2, all_51_1, tptp0) % 25.87/4.76 | (28) next_subocc(all_51_1, all_51_0, tptp0) % 25.87/4.76 | (29) $i(all_51_2) % 25.87/4.76 | (30) $i(all_51_1) % 25.87/4.76 | (31) $i(all_51_0) % 25.87/4.76 | (32) occurrence_of(all_51_0, tptp1) | occurrence_of(all_51_0, tptp2) % 25.87/4.76 | % 25.87/4.76 | GROUND_INST: instantiating (sos_22) with all_51_2, tptp3, tptp4, simplifying % 25.87/4.76 | with (5), (6), (24), (29) gives: % 25.87/4.76 | (33) tptp4 = tptp3 | ~ occurrence_of(all_51_2, tptp4) % 25.87/4.76 | % 25.87/4.76 | GROUND_INST: instantiating (10) with all_51_2, all_51_1, tptp0, simplifying % 25.87/4.76 | with (4), (27), (29), (30) gives: % 25.87/4.76 | (34) min_precedes(all_51_2, all_51_1, tptp0) % 25.87/4.76 | % 25.87/4.76 | GROUND_INST: instantiating (10) with all_51_1, all_51_0, tptp0, simplifying % 25.87/4.76 | with (4), (28), (30), (31) gives: % 25.87/4.76 | (35) min_precedes(all_51_1, all_51_0, tptp0) % 25.87/4.76 | % 25.87/4.76 | GROUND_INST: instantiating (9) with all_49_0, all_36_0, tptp0, simplifying % 25.87/4.76 | with (4), (12), (13), (20), (21), (22) gives: % 25.87/4.76 | (36) root_occ(all_49_0, all_36_0) % 25.87/4.76 | % 25.87/4.76 | GROUND_INST: instantiating (sos_18) with all_36_0, simplifying with (13), (17) % 25.87/4.76 | gives: % 25.87/4.76 | (37) ? [v0: $i] : ($i(v0) & activity(v0) & occurrence_of(all_36_0, v0)) % 25.87/4.76 | % 25.87/4.76 | DELTA: instantiating (37) with fresh symbol all_61_0 gives: % 25.87/4.76 | (38) $i(all_61_0) & activity(all_61_0) & occurrence_of(all_36_0, all_61_0) % 25.87/4.76 | % 25.87/4.76 | ALPHA: (38) implies: % 25.87/4.76 | (39) occurrence_of(all_36_0, all_61_0) % 25.87/4.76 | (40) $i(all_61_0) % 25.87/4.76 | % 25.87/4.76 | BETA: splitting (33) gives: % 25.87/4.76 | % 25.87/4.77 | Case 1: % 25.87/4.77 | | % 25.87/4.77 | | % 25.87/4.77 | | GROUND_INST: instantiating (sos) with all_51_2, all_51_1, all_51_0, tptp0, % 25.87/4.77 | | simplifying with (4), (29), (30), (31), (34), (35) gives: % 25.87/4.77 | | (41) min_precedes(all_51_2, all_51_0, tptp0) % 25.87/4.77 | | % 25.87/4.77 | | GROUND_INST: instantiating (sos_02) with all_51_2, all_49_0, all_36_0, % 25.87/4.77 | | all_61_0, simplifying with (13), (22), (25), (29), (36), (39), % 25.87/4.77 | | (40) gives: % 25.87/4.77 | | (42) all_51_2 = all_49_0 % 25.87/4.77 | | % 25.87/4.77 | | REDUCE: (24), (42) imply: % 25.87/4.77 | | (43) occurrence_of(all_49_0, tptp3) % 25.87/4.77 | | % 25.87/4.77 | | REDUCE: (41), (42) imply: % 25.87/4.77 | | (44) min_precedes(all_49_0, all_51_0, tptp0) % 25.87/4.77 | | % 25.87/4.77 | | BETA: splitting (32) gives: % 25.87/4.77 | | % 25.87/4.77 | | Case 1: % 25.87/4.77 | | | % 25.87/4.77 | | | (45) occurrence_of(all_51_0, tptp1) % 25.87/4.77 | | | % 25.87/4.77 | | | GROUND_INST: instantiating (15) with all_49_0, all_51_0, simplifying with % 25.87/4.77 | | | (22), (26), (31), (36), (43), (44), (45) gives: % 25.87/4.77 | | | (46) $false % 25.87/4.77 | | | % 25.87/4.77 | | | CLOSE: (46) is inconsistent. % 25.87/4.77 | | | % 25.87/4.77 | | Case 2: % 25.87/4.77 | | | % 25.87/4.77 | | | (47) occurrence_of(all_51_0, tptp2) % 25.87/4.77 | | | % 25.87/4.77 | | | GROUND_INST: instantiating (14) with all_49_0, all_51_0, simplifying with % 25.87/4.77 | | | (22), (26), (31), (36), (43), (44), (47) gives: % 25.87/4.77 | | | (48) $false % 25.87/4.77 | | | % 25.87/4.77 | | | CLOSE: (48) is inconsistent. % 25.87/4.77 | | | % 25.87/4.77 | | End of split % 25.87/4.77 | | % 25.87/4.77 | Case 2: % 25.87/4.77 | | % 25.87/4.77 | | (49) tptp4 = tptp3 % 25.87/4.77 | | % 25.87/4.77 | | REDUCE: (2), (49) imply: % 25.87/4.77 | | (50) $false % 25.87/4.77 | | % 25.87/4.77 | | CLOSE: (50) is inconsistent. % 25.87/4.77 | | % 25.87/4.77 | End of split % 25.87/4.77 | % 25.87/4.77 End of proof % 25.87/4.77 % SZS output end Proof for theBenchmark % 25.87/4.77 % 25.87/4.77 4166ms %------------------------------------------------------------------------------