TSTP Solution File: COM192^1 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : COM192^1 : TPTP v8.2.0. Released v7.0.0.
% Transfm : none
% Format : tptp:raw
% Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% Computer : n010.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 : Mon May 20 19:11:03 EDT 2024
% Result : Theorem 0.21s 0.46s
% Output : Refutation 0.21s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : COM192^1 : TPTP v8.2.0. Released v7.0.0.
% 0.07/0.15 % Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% 0.14/0.36 % Computer : n010.cluster.edu
% 0.14/0.36 % Model : x86_64 x86_64
% 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36 % Memory : 8042.1875MB
% 0.14/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36 % CPULimit : 300
% 0.14/0.36 % WCLimit : 300
% 0.14/0.36 % DateTime : Sun May 19 10:36:38 EDT 2024
% 0.14/0.36 % CPUTime :
% 0.14/0.36 This is a TH1_THM_EQU_NAR problem
% 0.14/0.36 Running vampire_ho --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_hol --cores 8 -m 12000 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.21/0.40 % (23122)lrs+10_1:1_au=on:inj=on:i=2:si=on:rtra=on_0 on theBenchmark for (2999ds/2Mi)
% 0.21/0.40 % (23119)lrs+1002_1:8_bd=off:fd=off:hud=10:tnu=1:i=183:si=on:rtra=on_0 on theBenchmark for (2999ds/183Mi)
% 0.21/0.40 % (23120)lrs+10_1:1_c=on:cnfonf=conj_eager:fd=off:fe=off:kws=frequency:spb=intro:i=4:si=on:rtra=on_0 on theBenchmark for (2999ds/4Mi)
% 0.21/0.40 % (23121)dis+1010_1:1_au=on:cbe=off:chr=on:fsr=off:hfsq=on:nm=64:sos=theory:sp=weighted_frequency:i=27:si=on:rtra=on_0 on theBenchmark for (2999ds/27Mi)
% 0.21/0.40 % (23124)lrs+1002_1:1_au=on:bd=off:e2e=on:sd=2:sos=on:ss=axioms:i=275:si=on:rtra=on_0 on theBenchmark for (2999ds/275Mi)
% 0.21/0.40 % (23123)lrs+1002_1:128_aac=none:au=on:cnfonf=lazy_not_gen_be_off:sos=all:i=2:si=on:rtra=on_0 on theBenchmark for (2999ds/2Mi)
% 0.21/0.40 % (23125)lrs+1004_1:128_cond=on:e2e=on:sp=weighted_frequency:i=18:si=on:rtra=on_0 on theBenchmark for (2999ds/18Mi)
% 0.21/0.40 % (23126)lrs+10_1:1_bet=on:cnfonf=off:fd=off:hud=5:inj=on:i=3:si=on:rtra=on_0 on theBenchmark for (2999ds/3Mi)
% 0.21/0.40 % (23122)Instruction limit reached!
% 0.21/0.40 % (23122)------------------------------
% 0.21/0.40 % (23122)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.21/0.40 % (23122)Termination reason: Unknown
% 0.21/0.40 % (23122)Termination phase: shuffling
% 0.21/0.40
% 0.21/0.40 % (23123)Instruction limit reached!
% 0.21/0.40 % (23123)------------------------------
% 0.21/0.40 % (23123)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.21/0.40 % (23123)Termination reason: Unknown
% 0.21/0.40 % (23123)Termination phase: shuffling
% 0.21/0.40
% 0.21/0.40 % (23123)Memory used [KB]: 1407
% 0.21/0.40 % (23123)Time elapsed: 0.003 s
% 0.21/0.40 % (23123)Instructions burned: 3 (million)
% 0.21/0.40 % (23123)------------------------------
% 0.21/0.40 % (23123)------------------------------
% 0.21/0.40 % (23122)Memory used [KB]: 1407
% 0.21/0.40 % (23122)Time elapsed: 0.004 s
% 0.21/0.40 % (23122)Instructions burned: 2 (million)
% 0.21/0.40 % (23122)------------------------------
% 0.21/0.40 % (23122)------------------------------
% 0.21/0.40 % (23120)Instruction limit reached!
% 0.21/0.40 % (23120)------------------------------
% 0.21/0.40 % (23120)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.21/0.40 % (23120)Termination reason: Unknown
% 0.21/0.40 % (23120)Termination phase: shuffling
% 0.21/0.40
% 0.21/0.40 % (23120)Memory used [KB]: 1535
% 0.21/0.40 % (23120)Time elapsed: 0.004 s
% 0.21/0.40 % (23120)Instructions burned: 4 (million)
% 0.21/0.40 % (23120)------------------------------
% 0.21/0.40 % (23120)------------------------------
% 0.21/0.40 % (23126)Instruction limit reached!
% 0.21/0.40 % (23126)------------------------------
% 0.21/0.40 % (23126)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.21/0.40 % (23126)Termination reason: Unknown
% 0.21/0.41 % (23126)Termination phase: shuffling
% 0.21/0.41
% 0.21/0.41 % (23126)Memory used [KB]: 1407
% 0.21/0.41 % (23126)Time elapsed: 0.005 s
% 0.21/0.41 % (23126)Instructions burned: 4 (million)
% 0.21/0.41 % (23126)------------------------------
% 0.21/0.41 % (23126)------------------------------
% 0.21/0.41 % (23125)Instruction limit reached!
% 0.21/0.41 % (23125)------------------------------
% 0.21/0.41 % (23125)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.21/0.41 % (23125)Termination reason: Unknown
% 0.21/0.41 % (23125)Termination phase: Property scanning
% 0.21/0.41
% 0.21/0.41 % (23125)Memory used [KB]: 1791
% 0.21/0.41 % (23125)Time elapsed: 0.015 s
% 0.21/0.41 % (23125)Instructions burned: 19 (million)
% 0.21/0.41 % (23125)------------------------------
% 0.21/0.41 % (23125)------------------------------
% 0.21/0.42 % (23127)lrs+1002_1:1_cnfonf=lazy_not_be_gen:hud=14:prag=on:sp=weighted_frequency:tnu=1:i=37:si=on:rtra=on_0 on theBenchmark for (2999ds/37Mi)
% 0.21/0.42 % (23128)lrs+2_16:1_acc=model:au=on:bd=off:c=on:e2e=on:nm=2:sos=all:i=15:si=on:rtra=on_0 on theBenchmark for (2999ds/15Mi)
% 0.21/0.42 % (23129)dis+21_1:1_cbe=off:cnfonf=off:fs=off:fsr=off:hud=1:inj=on:i=3:si=on:rtra=on_0 on theBenchmark for (2999ds/3Mi)
% 0.21/0.42 % (23121)Instruction limit reached!
% 0.21/0.42 % (23121)------------------------------
% 0.21/0.42 % (23121)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.21/0.42 % (23121)Termination reason: Unknown
% 0.21/0.42 % (23121)Termination phase: Property scanning
% 0.21/0.42
% 0.21/0.42 % (23121)Memory used [KB]: 1791
% 0.21/0.42 % (23121)Time elapsed: 0.019 s
% 0.21/0.42 % (23121)Instructions burned: 28 (million)
% 0.21/0.42 % (23121)------------------------------
% 0.21/0.42 % (23121)------------------------------
% 0.21/0.42 % (23130)lrs+1002_1:1_aac=none:au=on:cnfonf=lazy_gen:plsq=on:plsqc=1:plsqr=4203469,65536:i=1041:si=on:rtra=on_0 on theBenchmark for (2999ds/1041Mi)
% 0.21/0.42 % (23129)Instruction limit reached!
% 0.21/0.42 % (23129)------------------------------
% 0.21/0.42 % (23129)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.21/0.42 % (23129)Termination reason: Unknown
% 0.21/0.42 % (23129)Termination phase: shuffling
% 0.21/0.42
% 0.21/0.42 % (23129)Memory used [KB]: 1407
% 0.21/0.42 % (23129)Time elapsed: 0.004 s
% 0.21/0.42 % (23129)Instructions burned: 3 (million)
% 0.21/0.42 % (23129)------------------------------
% 0.21/0.42 % (23129)------------------------------
% 0.21/0.43 % (23128)Instruction limit reached!
% 0.21/0.43 % (23128)------------------------------
% 0.21/0.43 % (23128)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.21/0.43 % (23128)Termination reason: Unknown
% 0.21/0.43 % (23128)Termination phase: shuffling
% 0.21/0.43
% 0.21/0.43 % (23128)Memory used [KB]: 1791
% 0.21/0.43 % (23128)Time elapsed: 0.013 s
% 0.21/0.43 % (23128)Instructions burned: 16 (million)
% 0.21/0.43 % (23128)------------------------------
% 0.21/0.43 % (23128)------------------------------
% 0.21/0.43 % (23131)lrs+10_1:1_av=off:chr=on:plsq=on:slsq=on:i=7:si=on:rtra=on_0 on theBenchmark for (2999ds/7Mi)
% 0.21/0.43 % (23132)lrs+10_1:1_acc=on:amm=sco:cs=on:tgt=full:i=16:si=on:rtra=on_0 on theBenchmark for (2999ds/16Mi)
% 0.21/0.43 % (23131)Instruction limit reached!
% 0.21/0.43 % (23131)------------------------------
% 0.21/0.43 % (23131)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.21/0.43 % (23131)Termination reason: Unknown
% 0.21/0.43 % (23131)Termination phase: shuffling
% 0.21/0.43
% 0.21/0.43 % (23131)Memory used [KB]: 1535
% 0.21/0.43 % (23131)Time elapsed: 0.007 s
% 0.21/0.43 % (23131)Instructions burned: 7 (million)
% 0.21/0.43 % (23131)------------------------------
% 0.21/0.43 % (23131)------------------------------
% 0.21/0.44 % (23133)lrs+21_1:1_au=on:cnfonf=off:fd=preordered:fe=off:fsr=off:hud=11:inj=on:kws=precedence:s2pl=no:sp=weighted_frequency:tgt=full:i=3:si=on:rtra=on_0 on theBenchmark for (2999ds/3Mi)
% 0.21/0.44 % (23133)Instruction limit reached!
% 0.21/0.44 % (23133)------------------------------
% 0.21/0.44 % (23133)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.21/0.44 % (23133)Termination reason: Unknown
% 0.21/0.44 % (23133)Termination phase: shuffling
% 0.21/0.44
% 0.21/0.44 % (23133)Memory used [KB]: 1407
% 0.21/0.44 % (23133)Time elapsed: 0.004 s
% 0.21/0.44 % (23133)Instructions burned: 3 (million)
% 0.21/0.44 % (23133)------------------------------
% 0.21/0.44 % (23133)------------------------------
% 0.21/0.44 % (23127)Instruction limit reached!
% 0.21/0.44 % (23127)------------------------------
% 0.21/0.44 % (23127)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.21/0.44 % (23127)Termination reason: Unknown
% 0.21/0.44 % (23127)Termination phase: shuffling
% 0.21/0.44
% 0.21/0.44 % (23127)Memory used [KB]: 2174
% 0.21/0.44 % (23127)Time elapsed: 0.023 s
% 0.21/0.44 % (23127)Instructions burned: 38 (million)
% 0.21/0.44 % (23127)------------------------------
% 0.21/0.44 % (23127)------------------------------
% 0.21/0.44 % (23134)lrs+2_1:1_apa=on:au=on:bd=preordered:cnfonf=off:cs=on:ixr=off:sos=on:i=3:si=on:rtra=on_0 on theBenchmark for (2999ds/3Mi)
% 0.21/0.45 % (23132)Instruction limit reached!
% 0.21/0.45 % (23132)------------------------------
% 0.21/0.45 % (23132)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.21/0.45 % (23132)Termination reason: Unknown
% 0.21/0.45 % (23132)Termination phase: shuffling
% 0.21/0.45
% 0.21/0.45 % (23132)Memory used [KB]: 1791
% 0.21/0.45 % (23132)Time elapsed: 0.013 s
% 0.21/0.45 % (23132)Instructions burned: 16 (million)
% 0.21/0.45 % (23132)------------------------------
% 0.21/0.45 % (23132)------------------------------
% 0.21/0.45 % (23134)Instruction limit reached!
% 0.21/0.45 % (23134)------------------------------
% 0.21/0.45 % (23134)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.21/0.45 % (23134)Termination reason: Unknown
% 0.21/0.45 % (23134)Termination phase: shuffling
% 0.21/0.45
% 0.21/0.45 % (23134)Memory used [KB]: 1407
% 0.21/0.45 % (23134)Time elapsed: 0.004 s
% 0.21/0.45 % (23134)Instructions burned: 3 (million)
% 0.21/0.45 % (23134)------------------------------
% 0.21/0.45 % (23134)------------------------------
% 0.21/0.45 % (23135)lrs+10_1:1_cnfonf=off:cs=on:hud=3:prag=on:sup=off:i=7:si=on:rtra=on_0 on theBenchmark for (2999ds/7Mi)
% 0.21/0.45 % (23136)dis+1002_1:1_add=large:cnfonf=lazy_pi_sigma_gen:fe=off:prag=on:i=3:si=on:rtra=on_0 on theBenchmark for (2999ds/3Mi)
% 0.21/0.45 % (23136)Instruction limit reached!
% 0.21/0.45 % (23136)------------------------------
% 0.21/0.45 % (23136)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.21/0.45 % (23136)Termination reason: Unknown
% 0.21/0.45 % (23136)Termination phase: shuffling
% 0.21/0.45
% 0.21/0.45 % (23136)Memory used [KB]: 1407
% 0.21/0.45 % (23136)Time elapsed: 0.004 s
% 0.21/0.45 % (23136)Instructions burned: 3 (million)
% 0.21/0.45 % (23136)------------------------------
% 0.21/0.45 % (23136)------------------------------
% 0.21/0.46 % (23137)dis+1004_1:1_cha=on:cs=on:fe=off:hud=1:i=4:si=on:rtra=on_0 on theBenchmark for (2999ds/4Mi)
% 0.21/0.46 % (23135)Instruction limit reached!
% 0.21/0.46 % (23135)------------------------------
% 0.21/0.46 % (23135)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.21/0.46 % (23135)Termination reason: Unknown
% 0.21/0.46 % (23135)Termination phase: shuffling
% 0.21/0.46
% 0.21/0.46 % (23135)Memory used [KB]: 1535
% 0.21/0.46 % (23135)Time elapsed: 0.007 s
% 0.21/0.46 % (23135)Instructions burned: 7 (million)
% 0.21/0.46 % (23135)------------------------------
% 0.21/0.46 % (23135)------------------------------
% 0.21/0.46 % (23124)First to succeed.
% 0.21/0.46 % (23137)Instruction limit reached!
% 0.21/0.46 % (23137)------------------------------
% 0.21/0.46 % (23137)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.21/0.46 % (23137)Termination reason: Unknown
% 0.21/0.46 % (23137)Termination phase: shuffling
% 0.21/0.46
% 0.21/0.46 % (23137)Memory used [KB]: 1407
% 0.21/0.46 % (23137)Time elapsed: 0.005 s
% 0.21/0.46 % (23137)Instructions burned: 4 (million)
% 0.21/0.46 % (23137)------------------------------
% 0.21/0.46 % (23137)------------------------------
% 0.21/0.46 % (23124)Refutation found. Thanks to Tanya!
% 0.21/0.46 % SZS status Theorem for theBenchmark
% 0.21/0.46 % SZS output start Proof for theBenchmark
% 0.21/0.46 thf(type_def_5, type, itself: ($tType) > $tType).
% 0.21/0.46 thf(type_def_7, type, n: $tType).
% 0.21/0.46 thf(type_def_8, type, t: $tType).
% 0.21/0.46 thf(type_def_9, type, dtree: $tType).
% 0.21/0.46 thf(type_def_10, type, sum_sum: ($tType * $tType) > $tType).
% 0.21/0.46 thf(type_def_11, type, set: ($tType) > $tType).
% 0.21/0.46 thf(type_def_12, type, option: ($tType) > $tType).
% 0.21/0.46 thf(type_def_13, type, product_prod: ($tType * $tType) > $tType).
% 0.21/0.46 thf(func_def_0, type, product_prod: ($tType * $tType) > $tType).
% 0.21/0.46 thf(func_def_1, type, sum_sum: ($tType * $tType) > $tType).
% 0.21/0.46 thf(func_def_2, type, option: ($tType) > $tType).
% 0.21/0.46 thf(func_def_3, type, dtree: $tType).
% 0.21/0.46 thf(func_def_4, type, set: ($tType) > $tType).
% 0.21/0.46 thf(func_def_5, type, t: $tType).
% 0.21/0.46 thf(func_def_6, type, n: $tType).
% 0.21/0.46 thf(func_def_7, type, itself: ($tType) > $tType).
% 0.21/0.46 thf(func_def_8, type, type: !>[X0: $tType]:(itself @ X0 > $o)).
% 0.21/0.46 thf(func_def_9, type, top: !>[X0: $tType]:(itself @ X0 > $o)).
% 0.21/0.46 thf(func_def_10, type, finite_finite: !>[X0: $tType]:(itself @ X0 > $o)).
% 0.21/0.46 thf(func_def_11, type, semiring_char_0: !>[X0: $tType]:(itself @ X0 > $o)).
% 0.21/0.46 thf(func_def_12, type, node: n > set @ sum_sum @ t @ dtree > dtree).
% 0.21/0.46 thf(func_def_13, type, cont: dtree > set @ sum_sum @ t @ dtree).
% 0.21/0.46 thf(func_def_14, type, corec: !>[X0: $tType]:((X0 > n) > (X0 > set @ sum_sum @ t @ sum_sum @ dtree @ X0) > X0 > dtree)).
% 0.21/0.46 thf(func_def_15, type, root: dtree > n).
% 0.21/0.46 thf(func_def_16, type, unfold: !>[X0: $tType]:((X0 > n) > (X0 > set @ sum_sum @ t @ X0) > X0 > dtree)).
% 0.21/0.46 thf(func_def_17, type, finite_finite2: !>[X0: $tType]:(set @ X0 > $o)).
% 0.21/0.46 thf(func_def_18, type, comp: !>[X0: $tType, X1: $tType, X2: $tType]:((X0 > X1) > (X2 > X0) > X2 > X1)).
% 0.21/0.46 thf(func_def_19, type, id: !>[X0: $tType]:(X0 > X0)).
% 0.21/0.46 thf(func_def_20, type, inj_on: !>[X0: $tType, X1: $tType]:((X0 > X1) > set @ X0 > $o)).
% 0.21/0.46 thf(func_def_21, type, gram_L1451583624elle_H: dtree > n > dtree).
% 0.21/0.46 thf(func_def_22, type, gram_L1221482011le_H_c: dtree > n > set @ sum_sum @ t @ n).
% 0.21/0.46 thf(func_def_23, type, gram_L1221482026le_H_r: dtree > n > n).
% 0.21/0.46 thf(func_def_24, type, gram_L1451583635elle_S: n > set @ sum_sum @ t @ n).
% 0.21/0.46 thf(func_def_25, type, gram_L1231612515_deftr: n > dtree).
% 0.21/0.46 thf(func_def_26, type, gram_L1004374585hsubst: dtree > dtree > dtree).
% 0.21/0.46 thf(func_def_27, type, gram_L1905609002ubst_c: dtree > dtree > set @ sum_sum @ t @ dtree).
% 0.21/0.46 thf(func_def_28, type, gram_L1905609017ubst_r: dtree > n).
% 0.21/0.46 thf(func_def_29, type, gram_L805317441_inFr2: set @ n > dtree > t > $o).
% 0.21/0.46 thf(func_def_30, type, gram_L830233218_inItr: set @ n > dtree > n > $o).
% 0.21/0.46 thf(func_def_31, type, gram_L315592705e_pick: dtree > n > dtree).
% 0.21/0.46 thf(func_def_32, type, gram_L716654942_subtr: set @ n > dtree > dtree > $o).
% 0.21/0.46 thf(func_def_33, type, gram_L1614515765ubtrOf: dtree > n > dtree).
% 0.21/0.46 thf(func_def_34, type, gram_L864798063lle_wf: dtree > $o).
% 0.21/0.46 thf(func_def_35, type, if: !>[X0: $tType]:($o > X0 > X0 > X0)).
% 0.21/0.46 thf(func_def_36, type, top_top: !>[X0: $tType]:(X0)).
% 0.21/0.46 thf(func_def_37, type, type2: !>[X0: $tType]:(itself @ X0)).
% 0.21/0.46 thf(func_def_38, type, collect: !>[X0: $tType]:((X0 > $o) > set @ X0)).
% 0.21/0.46 thf(func_def_39, type, image: !>[X0: $tType, X1: $tType]:((X0 > X1) > set @ X0 > set @ X1)).
% 0.21/0.46 thf(func_def_40, type, vimage: !>[X0: $tType, X1: $tType]:((X0 > X1) > set @ X1 > set @ X0)).
% 0.21/0.46 thf(func_def_41, type, sum_Inl: !>[X0: $tType, X1: $tType]:(X0 > sum_sum @ X0 @ X1)).
% 0.21/0.46 thf(func_def_42, type, sum_Inr: !>[X0: $tType, X1: $tType]:(X0 > sum_sum @ X1 @ X0)).
% 0.21/0.46 thf(func_def_43, type, sum_map_sum: !>[X0: $tType, X1: $tType, X2: $tType, X3: $tType]:((X0 > X1) > (X2 > X3) > sum_sum @ X0 @ X2 > sum_sum @ X1 @ X3)).
% 0.21/0.46 thf(func_def_44, type, sum_rec_sum: !>[X0: $tType, X1: $tType, X2: $tType]:((X0 > X1) > (X2 > X1) > sum_sum @ X0 @ X2 > X1)).
% 0.21/0.46 thf(func_def_45, type, sum_case_sum: !>[X0: $tType, X1: $tType, X2: $tType]:((X0 > X1) > (X2 > X1) > sum_sum @ X0 @ X2 > X1)).
% 0.21/0.46 thf(func_def_46, type, member: !>[X0: $tType]:(X0 > set @ X0 > $o)).
% 0.21/0.46 thf(func_def_47, type, a: t).
% 0.21/0.46 thf(func_def_48, type, n2: n).
% 0.21/0.46 thf(func_def_49, type, t_tr: sum_sum @ t @ dtree).
% 0.21/0.46 thf(func_def_50, type, tr0: dtree).
% 0.21/0.46 thf(func_def_67, type, sP0: (set @ n > dtree > dtree > $o) > $o).
% 0.21/0.46 thf(func_def_68, type, sP1: (set @ n > dtree > n > $o) > $o).
% 0.21/0.46 thf(func_def_69, type, sK2: !>[X0: $tType, X1: $tType]:(sum_sum @ X0 @ X1 > X1)).
% 0.21/0.46 thf(func_def_70, type, sK3: !>[X0: $tType, X1: $tType]:(sum_sum @ X0 @ X1 > X0)).
% 0.21/0.46 thf(func_def_71, type, sK4: !>[X0: $tType, X1: $tType, X2: $tType]:((X2 > X1) > (X2 > X1) > set @ X0 > (X0 > X2) > X0)).
% 0.21/0.46 thf(func_def_72, type, sK5: !>[X0: $tType, X1: $tType]:((X0 > $o) > set @ X1 > (X1 > X0) > X1)).
% 0.21/0.46 thf(func_def_73, type, sK6: dtree > n).
% 0.21/0.46 thf(func_def_74, type, sK7: !>[X0: $tType, X1: $tType, X2: $tType]:(set @ sum_sum @ X1 @ X2 > (X2 > X0) > X0 > X2)).
% 0.21/0.46 thf(func_def_75, type, sK8: (set @ n > dtree > dtree > $o) > dtree).
% 0.21/0.46 thf(func_def_76, type, sK9: (set @ n > dtree > dtree > $o) > set @ n).
% 0.21/0.46 thf(func_def_77, type, sK10: (set @ n > dtree > dtree > $o) > dtree).
% 0.21/0.46 thf(func_def_78, type, sK11: (set @ n > dtree > dtree > $o) > dtree).
% 0.21/0.46 thf(func_def_79, type, sK12: (set @ n > dtree > dtree > $o) > dtree).
% 0.21/0.46 thf(func_def_80, type, sK13: (set @ n > dtree > dtree > $o) > set @ n).
% 0.21/0.46 thf(func_def_81, type, sK14: !>[X0: $tType, X1: $tType, X2: $tType]:($o > (sum_sum @ X0 @ X1 > X2) > X2 > X0)).
% 0.21/0.46 thf(func_def_82, type, sK15: !>[X0: $tType, X1: $tType, X2: $tType]:($o > (sum_sum @ X0 @ X1 > X2) > X2 > X1)).
% 0.21/0.46 thf(func_def_83, type, sK16: !>[X0: $tType, X1: $tType]:(X0 > (X1 > X0) > X1)).
% 0.21/0.46 thf(func_def_84, type, sK17: n > dtree > set @ n > dtree).
% 0.21/0.46 thf(func_def_85, type, sK18: !>[X0: $tType, X1: $tType]:((X1 > X0) > (X1 > X0) > set @ X1 > X1)).
% 0.21/0.46 thf(func_def_86, type, sK19: !>[X0: $tType, X1: $tType]:((X1 > X0) > (X1 > X0) > set @ X1 > X1)).
% 0.21/0.46 thf(func_def_87, type, sK20: !>[X0: $tType, X1: $tType]:(X0 > (X1 > X0) > X1)).
% 0.21/0.46 thf(func_def_88, type, sK21: !>[X0: $tType, X1: $tType]:((X1 > X0) > (X1 > X0) > set @ X1 > X1)).
% 0.21/0.46 thf(func_def_89, type, sK22: !>[X0: $tType, X1: $tType]:(sum_sum @ X0 @ X1 > X0)).
% 0.21/0.46 thf(func_def_90, type, sK23: !>[X0: $tType, X1: $tType]:(sum_sum @ X0 @ X1 > X1)).
% 0.21/0.46 thf(func_def_91, type, sK24: n > dtree > set @ n > dtree).
% 0.21/0.46 thf(func_def_92, type, sK25: !>[X0: $tType, X1: $tType]:((X1 > X0) > (X0 > X1) > X1)).
% 0.21/0.46 thf(func_def_93, type, sK26: !>[X0: $tType]:(set @ X0 > X0)).
% 0.21/0.46 thf(func_def_94, type, sK27: !>[X0: $tType, X1: $tType, X2: $tType]:(X2 > sum_sum @ X1 @ X0 > (X1 > X2) > X1)).
% 0.21/0.46 thf(func_def_95, type, sK28: !>[X0: $tType, X1: $tType]:(X1 > (X0 > X1) > X0)).
% 0.21/0.46 thf(func_def_96, type, sK29: !>[X0: $tType, X1: $tType]:((X0 > X1) > X1)).
% 0.21/0.46 thf(func_def_97, type, sK30: !>[X0: $tType]:((X0 > X0) > X0)).
% 0.21/0.46 thf(func_def_98, type, sK31: (set @ n > dtree > dtree > $o) > set @ n).
% 0.21/0.46 thf(func_def_99, type, sK32: (set @ n > dtree > dtree > $o) > dtree).
% 0.21/0.46 thf(func_def_100, type, sK33: (set @ n > dtree > dtree > $o) > set @ n).
% 0.21/0.46 thf(func_def_101, type, sK34: (set @ n > dtree > dtree > $o) > dtree).
% 0.21/0.46 thf(func_def_102, type, sK35: (set @ n > dtree > dtree > $o) > dtree).
% 0.21/0.46 thf(func_def_103, type, sK36: (set @ n > dtree > dtree > $o) > dtree).
% 0.21/0.46 thf(func_def_104, type, sK37: dtree > dtree > set @ n > dtree).
% 0.21/0.46 thf(func_def_105, type, sK38: !>[X0: $tType]:(X0)).
% 0.21/0.46 thf(func_def_106, type, sK39: !>[X0: $tType, X1: $tType]:(set @ X1 > (X1 > X0) > X0 > X1)).
% 0.21/0.46 thf(func_def_107, type, sK40: dtree > dtree > n).
% 0.21/0.46 thf(func_def_108, type, sK41: !>[X0: $tType, X1: $tType]:((X1 > X0) > (X1 > X0) > X1)).
% 0.21/0.46 thf(func_def_109, type, sK42: !>[X0: $tType, X1: $tType, X2: $tType]:((X1 > X0) > (X1 > X0) > (X2 > X1) > (X2 > X1) > X1)).
% 0.21/0.46 thf(func_def_110, type, sK43: !>[X0: $tType, X1: $tType, X2: $tType]:((X1 > X0) > (X1 > X0) > (X2 > X1) > (X2 > X1) > X1)).
% 0.21/0.46 thf(func_def_111, type, sK44: !>[X0: $tType, X1: $tType, X2: $tType]:((X1 > X0) > (X1 > X0) > (X2 > X1) > X1)).
% 0.21/0.46 thf(func_def_112, type, sK45: (dtree > dtree > $o) > dtree).
% 0.21/0.46 thf(func_def_113, type, sK46: (dtree > dtree > $o) > dtree).
% 0.21/0.46 thf(func_def_114, type, sK47: (dtree > dtree > $o) > dtree).
% 0.21/0.46 thf(func_def_115, type, sK48: (dtree > dtree > $o) > dtree).
% 0.21/0.46 thf(func_def_116, type, sK49: (set @ n > dtree > n > $o) > dtree).
% 0.21/0.46 thf(func_def_117, type, sK50: (set @ n > dtree > n > $o) > set @ n).
% 0.21/0.46 thf(func_def_118, type, sK51: (set @ n > dtree > n > $o) > dtree).
% 0.21/0.46 thf(func_def_119, type, sK52: (set @ n > dtree > n > $o) > n).
% 0.21/0.46 thf(func_def_120, type, sK53: (set @ n > dtree > n > $o) > dtree).
% 0.21/0.46 thf(func_def_121, type, sK54: (set @ n > dtree > n > $o) > set @ n).
% 0.21/0.46 thf(func_def_122, type, sK55: !>[X0: $tType, X1: $tType, X2: $tType]:(X2 > sum_sum @ X0 @ X1 > (X1 > X2) > X1)).
% 0.21/0.46 thf(func_def_123, type, sK56: !>[X0: $tType, X1: $tType]:(sum_sum @ X0 @ X1 > X1)).
% 0.21/0.46 thf(func_def_124, type, sK57: !>[X0: $tType, X1: $tType]:(sum_sum @ X0 @ X1 > X0)).
% 0.21/0.46 thf(func_def_125, type, sK58: !>[X0: $tType, X1: $tType]:((X0 > $o) > set @ X1 > (X1 > X0) > X0)).
% 0.21/0.46 thf(func_def_126, type, sK59: !>[X0: $tType, X1: $tType]:((sum_sum @ X1 @ X0 > $o) > X0)).
% 0.21/0.46 thf(func_def_127, type, sK60: !>[X0: $tType, X1: $tType]:((sum_sum @ X1 @ X0 > $o) > X1)).
% 0.21/0.46 thf(func_def_128, type, sK61: !>[X0: $tType, X1: $tType, X2: $tType]:((X1 > X0) > (X1 > X0) > (X2 > X1) > X1)).
% 0.21/0.46 thf(func_def_129, type, sK62: !>[X0: $tType, X1: $tType, X2: $tType]:(set @ sum_sum @ X0 @ X1 > (X1 > X2) > X2 > X1)).
% 0.21/0.46 thf(func_def_131, type, ph64: !>[X0: $tType]:(X0)).
% 0.21/0.46 thf(f1125,plain,(
% 0.21/0.46 $false),
% 0.21/0.46 inference(subsumption_resolution,[],[f1124,f956])).
% 0.21/0.46 thf(f956,plain,(
% 0.21/0.46 ( ! [X1 : $tType,X0 : $tType,X3 : $tType,X2 : $tType,X6 : X3,X4 : X3 > X2,X5 : X0 > X1] : (((sum_Inl @ X2 @ X1 @ (X4 @ X6)) = (sum_map_sum @ X3 @ X2 @ X0 @ X1 @ X4 @ X5 @ (sum_Inl @ X3 @ X0 @ X6)))) )),
% 0.21/0.46 inference(cnf_transformation,[],[f586])).
% 0.21/0.46 thf(f586,plain,(
% 0.21/0.46 ! [X0 : $tType,X1 : $tType,X2 : $tType,X3 : $tType,X4 : X3 > X2,X5 : X0 > X1,X6 : X3] : ((sum_Inl @ X2 @ X1 @ (X4 @ X6)) = (sum_map_sum @ X3 @ X2 @ X0 @ X1 @ X4 @ X5 @ (sum_Inl @ X3 @ X0 @ X6)))),
% 0.21/0.46 inference(rectify,[],[f58])).
% 0.21/0.46 thf(f58,axiom,(
% 0.21/0.46 ! [X1 : $tType,X3 : $tType,X2 : $tType,X0 : $tType,X44 : X0 > X2,X45 : X1 > X3,X16 : X0] : ((sum_map_sum @ X0 @ X2 @ X1 @ X3 @ X44 @ X45 @ (sum_Inl @ X0 @ X1 @ X16)) = (sum_Inl @ X2 @ X3 @ (X44 @ X16)))),
% 0.21/0.46 file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_57_map__sum_Osimps_I1_J)).
% 0.21/0.46 thf(f1124,plain,(
% 0.21/0.46 ((sum_Inl @ t @ n @ (id @ t @ a)) != (sum_map_sum @ t @ t @ dtree @ n @ id @ t @ root @ (sum_Inl @ t @ dtree @ a)))),
% 0.21/0.46 inference(forward_demodulation,[],[f1084,f956])).
% 0.21/0.46 thf(f1084,plain,(
% 0.21/0.46 ((sum_map_sum @ t @ t @ dtree @ n @ id @ t @ root @ (sum_Inl @ t @ dtree @ a)) != (sum_map_sum @ t @ t @ dtree @ n @ id @ t @ (comp @ n @ n @ dtree @ (comp @ dtree @ n @ n @ root @ (gram_L1451583624elle_H @ tr0)) @ root) @ (sum_Inl @ t @ dtree @ a)))),
% 0.21/0.46 inference(definition_unfolding,[],[f997,f1032,f1032])).
% 0.21/0.46 thf(f1032,plain,(
% 0.21/0.46 (t_tr = (sum_Inl @ t @ dtree @ a))),
% 0.21/0.46 inference(cnf_transformation,[],[f271])).
% 0.21/0.46 thf(f271,axiom,(
% 0.21/0.46 (t_tr = (sum_Inl @ t @ dtree @ a))),
% 0.21/0.46 file('/export/starexec/sandbox/benchmark/theBenchmark.p',conj_2)).
% 0.21/0.46 thf(f997,plain,(
% 0.21/0.46 ((sum_map_sum @ t @ t @ dtree @ n @ id @ t @ (comp @ n @ n @ dtree @ (comp @ dtree @ n @ n @ root @ (gram_L1451583624elle_H @ tr0)) @ root) @ t_tr) != (sum_map_sum @ t @ t @ dtree @ n @ id @ t @ root @ t_tr))),
% 0.21/0.46 inference(cnf_transformation,[],[f579])).
% 0.21/0.46 thf(f579,plain,(
% 0.21/0.46 ((sum_map_sum @ t @ t @ dtree @ n @ id @ t @ (comp @ n @ n @ dtree @ (comp @ dtree @ n @ n @ root @ (gram_L1451583624elle_H @ tr0)) @ root) @ t_tr) != (sum_map_sum @ t @ t @ dtree @ n @ id @ t @ root @ t_tr))),
% 0.21/0.46 inference(flattening,[],[f273])).
% 0.21/0.46 thf(f273,negated_conjecture,(
% 0.21/0.46 ~((sum_map_sum @ t @ t @ dtree @ n @ id @ t @ (comp @ n @ n @ dtree @ (comp @ dtree @ n @ n @ root @ (gram_L1451583624elle_H @ tr0)) @ root) @ t_tr) = (sum_map_sum @ t @ t @ dtree @ n @ id @ t @ root @ t_tr))),
% 0.21/0.46 inference(negated_conjecture,[],[f272])).
% 0.21/0.46 thf(f272,conjecture,(
% 0.21/0.46 ((sum_map_sum @ t @ t @ dtree @ n @ id @ t @ (comp @ n @ n @ dtree @ (comp @ dtree @ n @ n @ root @ (gram_L1451583624elle_H @ tr0)) @ root) @ t_tr) = (sum_map_sum @ t @ t @ dtree @ n @ id @ t @ root @ t_tr))),
% 0.21/0.46 file('/export/starexec/sandbox/benchmark/theBenchmark.p',conj_3)).
% 0.21/0.46 % SZS output end Proof for theBenchmark
% 0.21/0.46 % (23124)------------------------------
% 0.21/0.46 % (23124)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.21/0.46 % (23124)Termination reason: Refutation
% 0.21/0.46
% 0.21/0.46 % (23124)Memory used [KB]: 7164
% 0.21/0.46 % (23124)Time elapsed: 0.057 s
% 0.21/0.46 % (23124)Instructions burned: 88 (million)
% 0.21/0.46 % (23124)------------------------------
% 0.21/0.46 % (23124)------------------------------
% 0.21/0.46 % (23118)Success in time 0.092 s
% 0.21/0.46 % Vampire---4.8 exiting
%------------------------------------------------------------------------------