TSTP Solution File: ITP132^2 by Vampire---4.8

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Vampire---4.8
% Problem  : ITP132^2 : TPTP v8.2.0. Released v7.5.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/sandbox2/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s

% Computer : n005.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 22:33:54 EDT 2024

% Result   : Theorem 0.20s 0.43s
% Output   : Refutation 0.20s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.13/0.13  % Problem    : ITP132^2 : TPTP v8.2.0. Released v7.5.0.
% 0.13/0.14  % Command    : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox2/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% 0.14/0.34  % Computer : n005.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.35  % CPULimit   : 300
% 0.14/0.35  % WCLimit    : 300
% 0.14/0.35  % DateTime   : Sat May 18 17:03:08 EDT 2024
% 0.14/0.35  % CPUTime    : 
% 0.14/0.35  This is a TH1_THM_EQU_NAR problem
% 0.14/0.35  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/sandbox2/benchmark/theBenchmark.p
% 0.20/0.38  % (20945)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.20/0.38  % (20952)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.20/0.38  % (20949)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.20/0.38  % (20946)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.20/0.38  % (20950)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.20/0.38  % (20948)lrs+10_1:1_au=on:inj=on:i=2:si=on:rtra=on_0 on theBenchmark for (2999ds/2Mi)
% 0.20/0.38  % (20947)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.20/0.39  % (20948)Instruction limit reached!
% 0.20/0.39  % (20948)------------------------------
% 0.20/0.39  % (20948)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.20/0.39  % (20951)lrs+1004_1:128_cond=on:e2e=on:sp=weighted_frequency:i=18:si=on:rtra=on_0 on theBenchmark for (2999ds/18Mi)
% 0.20/0.39  % (20948)Termination reason: Unknown
% 0.20/0.39  % (20949)Instruction limit reached!
% 0.20/0.39  % (20949)------------------------------
% 0.20/0.39  % (20949)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.20/0.39  % (20949)Termination reason: Unknown
% 0.20/0.39  % (20949)Termination phase: shuffling
% 0.20/0.39  
% 0.20/0.39  % (20949)Memory used [KB]: 1279
% 0.20/0.39  % (20949)Time elapsed: 0.003 s
% 0.20/0.39  % (20949)Instructions burned: 2 (million)
% 0.20/0.39  % (20949)------------------------------
% 0.20/0.39  % (20949)------------------------------
% 0.20/0.39  % (20948)Termination phase: shuffling
% 0.20/0.39  
% 0.20/0.39  % (20948)Memory used [KB]: 1279
% 0.20/0.39  % (20948)Time elapsed: 0.003 s
% 0.20/0.39  % (20948)Instructions burned: 2 (million)
% 0.20/0.39  % (20948)------------------------------
% 0.20/0.39  % (20948)------------------------------
% 0.20/0.39  % (20952)Instruction limit reached!
% 0.20/0.39  % (20952)------------------------------
% 0.20/0.39  % (20952)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.20/0.39  % (20952)Termination reason: Unknown
% 0.20/0.39  % (20952)Termination phase: shuffling
% 0.20/0.39  
% 0.20/0.39  % (20952)Memory used [KB]: 1407
% 0.20/0.39  % (20952)Time elapsed: 0.004 s
% 0.20/0.39  % (20952)Instructions burned: 4 (million)
% 0.20/0.39  % (20952)------------------------------
% 0.20/0.39  % (20952)------------------------------
% 0.20/0.39  % (20946)Instruction limit reached!
% 0.20/0.39  % (20946)------------------------------
% 0.20/0.39  % (20946)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.20/0.39  % (20946)Termination reason: Unknown
% 0.20/0.39  % (20946)Termination phase: shuffling
% 0.20/0.39  
% 0.20/0.39  % (20946)Memory used [KB]: 1407
% 0.20/0.39  % (20946)Time elapsed: 0.005 s
% 0.20/0.39  % (20946)Instructions burned: 5 (million)
% 0.20/0.39  % (20946)------------------------------
% 0.20/0.39  % (20946)------------------------------
% 0.20/0.40  % (20951)Instruction limit reached!
% 0.20/0.40  % (20951)------------------------------
% 0.20/0.40  % (20951)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.20/0.40  % (20951)Termination reason: Unknown
% 0.20/0.40  % (20951)Termination phase: Property scanning
% 0.20/0.40  
% 0.20/0.40  % (20951)Memory used [KB]: 1791
% 0.20/0.40  % (20951)Time elapsed: 0.014 s
% 0.20/0.40  % (20951)Instructions burned: 19 (million)
% 0.20/0.40  % (20951)------------------------------
% 0.20/0.40  % (20951)------------------------------
% 0.20/0.40  % (20947)Instruction limit reached!
% 0.20/0.40  % (20947)------------------------------
% 0.20/0.40  % (20947)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.20/0.40  % (20947)Termination reason: Unknown
% 0.20/0.40  % (20947)Termination phase: Property scanning
% 0.20/0.40  
% 0.20/0.40  % (20947)Memory used [KB]: 1791
% 0.20/0.40  % (20947)Time elapsed: 0.018 s
% 0.20/0.40  % (20947)Instructions burned: 27 (million)
% 0.20/0.40  % (20947)------------------------------
% 0.20/0.40  % (20947)------------------------------
% 0.20/0.40  % (20953)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.20/0.40  % (20955)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.20/0.40  % (20956)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.20/0.40  % (20955)Instruction limit reached!
% 0.20/0.40  % (20955)------------------------------
% 0.20/0.40  % (20955)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.20/0.40  % (20955)Termination reason: Unknown
% 0.20/0.40  % (20955)Termination phase: shuffling
% 0.20/0.40  
% 0.20/0.40  % (20955)Memory used [KB]: 1407
% 0.20/0.40  % (20955)Time elapsed: 0.003 s
% 0.20/0.40  % (20955)Instructions burned: 3 (million)
% 0.20/0.40  % (20955)------------------------------
% 0.20/0.40  % (20955)------------------------------
% 0.20/0.41  % (20954)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.20/0.42  % (20958)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.20/0.42  % (20954)Instruction limit reached!
% 0.20/0.42  % (20954)------------------------------
% 0.20/0.42  % (20954)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.20/0.42  % (20954)Termination reason: Unknown
% 0.20/0.42  % (20954)Termination phase: shuffling
% 0.20/0.42  
% 0.20/0.42  % (20954)Memory used [KB]: 1663
% 0.20/0.42  % (20954)Time elapsed: 0.011 s
% 0.20/0.42  % (20954)Instructions burned: 15 (million)
% 0.20/0.42  % (20954)------------------------------
% 0.20/0.42  % (20954)------------------------------
% 0.20/0.42  % (20959)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.20/0.42  % (20957)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.20/0.42  % (20959)Instruction limit reached!
% 0.20/0.42  % (20959)------------------------------
% 0.20/0.42  % (20959)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.20/0.42  % (20959)Termination reason: Unknown
% 0.20/0.42  % (20959)Termination phase: shuffling
% 0.20/0.42  
% 0.20/0.42  % (20959)Memory used [KB]: 1407
% 0.20/0.42  % (20959)Time elapsed: 0.004 s
% 0.20/0.42  % (20959)Instructions burned: 4 (million)
% 0.20/0.42  % (20959)------------------------------
% 0.20/0.42  % (20959)------------------------------
% 0.20/0.42  % (20953)Instruction limit reached!
% 0.20/0.42  % (20953)------------------------------
% 0.20/0.42  % (20953)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.20/0.42  % (20953)Termination reason: Unknown
% 0.20/0.42  % (20953)Termination phase: shuffling
% 0.20/0.42  
% 0.20/0.42  % (20953)Memory used [KB]: 2174
% 0.20/0.42  % (20953)Time elapsed: 0.022 s
% 0.20/0.42  % (20953)Instructions burned: 37 (million)
% 0.20/0.42  % (20953)------------------------------
% 0.20/0.42  % (20953)------------------------------
% 0.20/0.42  % (20957)Instruction limit reached!
% 0.20/0.42  % (20957)------------------------------
% 0.20/0.42  % (20957)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.20/0.42  % (20957)Termination reason: Unknown
% 0.20/0.42  % (20957)Termination phase: shuffling
% 0.20/0.42  
% 0.20/0.42  % (20957)Memory used [KB]: 1535
% 0.20/0.42  % (20957)Time elapsed: 0.004 s
% 0.20/0.42  % (20957)Instructions burned: 9 (million)
% 0.20/0.42  % (20957)------------------------------
% 0.20/0.42  % (20957)------------------------------
% 0.20/0.42  % (20950)First to succeed.
% 0.20/0.43  % (20958)Instruction limit reached!
% 0.20/0.43  % (20958)------------------------------
% 0.20/0.43  % (20958)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.20/0.43  % (20958)Termination reason: Unknown
% 0.20/0.43  % (20958)Termination phase: shuffling
% 0.20/0.43  
% 0.20/0.43  % (20958)Memory used [KB]: 1663
% 0.20/0.43  % (20958)Time elapsed: 0.011 s
% 0.20/0.43  % (20958)Instructions burned: 16 (million)
% 0.20/0.43  % (20958)------------------------------
% 0.20/0.43  % (20958)------------------------------
% 0.20/0.43  % (20950)Refutation found. Thanks to Tanya!
% 0.20/0.43  % SZS status Theorem for theBenchmark
% 0.20/0.43  % SZS output start Proof for theBenchmark
% 0.20/0.43  thf(type_def_6, type, set: ($tType) > $tType).
% 0.20/0.43  thf(type_def_7, type, nat: $tType).
% 0.20/0.43  thf(func_def_0, type, set: ($tType) > $tType).
% 0.20/0.43  thf(func_def_1, type, nat: $tType).
% 0.20/0.43  thf(func_def_2, type, type: !>[X0: $tType]:($o)).
% 0.20/0.43  thf(func_def_3, type, dvd: !>[X0: $tType]:($o)).
% 0.20/0.43  thf(func_def_4, type, one: !>[X0: $tType]:($o)).
% 0.20/0.43  thf(func_def_5, type, ring: !>[X0: $tType]:($o)).
% 0.20/0.43  thf(func_def_6, type, zero: !>[X0: $tType]:($o)).
% 0.20/0.43  thf(func_def_7, type, minus: !>[X0: $tType]:($o)).
% 0.20/0.43  thf(func_def_8, type, ord: !>[X0: $tType]:($o)).
% 0.20/0.43  thf(func_def_9, type, neg_numeral: !>[X0: $tType]:($o)).
% 0.20/0.43  thf(func_def_10, type, order: !>[X0: $tType]:($o)).
% 0.20/0.43  thf(func_def_11, type, comm_ring: !>[X0: $tType]:($o)).
% 0.20/0.43  thf(func_def_12, type, mult_zero: !>[X0: $tType]:($o)).
% 0.20/0.43  thf(func_def_13, type, group_add: !>[X0: $tType]:($o)).
% 0.20/0.43  thf(func_def_14, type, no_bot: !>[X0: $tType]:($o)).
% 0.20/0.43  thf(func_def_15, type, no_top: !>[X0: $tType]:($o)).
% 0.20/0.43  thf(func_def_16, type, semiring_0: !>[X0: $tType]:($o)).
% 0.20/0.43  thf(func_def_17, type, monoid_mult: !>[X0: $tType]:($o)).
% 0.20/0.43  thf(func_def_18, type, linorder: !>[X0: $tType]:($o)).
% 0.20/0.43  thf(func_def_19, type, preorder: !>[X0: $tType]:($o)).
% 0.20/0.43  thf(func_def_20, type, ordered_ring: !>[X0: $tType]:($o)).
% 0.20/0.43  thf(func_def_21, type, zero_neq_one: !>[X0: $tType]:($o)).
% 0.20/0.43  thf(func_def_22, type, ab_group_add: !>[X0: $tType]:($o)).
% 0.20/0.43  thf(func_def_23, type, wellorder: !>[X0: $tType]:($o)).
% 0.20/0.43  thf(func_def_24, type, semigroup_mult: !>[X0: $tType]:($o)).
% 0.20/0.43  thf(func_def_25, type, dense_order: !>[X0: $tType]:($o)).
% 0.20/0.43  thf(func_def_26, type, linordered_idom: !>[X0: $tType]:($o)).
% 0.20/0.43  thf(func_def_27, type, linordered_ring: !>[X0: $tType]:($o)).
% 0.20/0.43  thf(func_def_28, type, comm_monoid_add: !>[X0: $tType]:($o)).
% 0.20/0.43  thf(func_def_29, type, ordered_semiring: !>[X0: $tType]:($o)).
% 0.20/0.43  thf(func_def_30, type, comm_monoid_diff: !>[X0: $tType]:($o)).
% 0.20/0.43  thf(func_def_31, type, comm_monoid_mult: !>[X0: $tType]:($o)).
% 0.20/0.43  thf(func_def_32, type, ab_semigroup_mult: !>[X0: $tType]:($o)).
% 0.20/0.43  thf(func_def_33, type, ordered_semiring_0: !>[X0: $tType]:($o)).
% 0.20/0.43  thf(func_def_34, type, ordered_ab_group_add: !>[X0: $tType]:($o)).
% 0.20/0.43  thf(func_def_35, type, ordere1490568538miring: !>[X0: $tType]:($o)).
% 0.20/0.43  thf(func_def_36, type, comm_s1003936772cancel: !>[X0: $tType]:($o)).
% 0.20/0.43  thf(func_def_37, type, linord581940658strict: !>[X0: $tType]:($o)).
% 0.20/0.43  thf(func_def_38, type, cancel1352612707id_add: !>[X0: $tType]:($o)).
% 0.20/0.43  thf(func_def_39, type, ring_11004092258visors: !>[X0: $tType]:($o)).
% 0.20/0.43  thf(func_def_40, type, cancel146912293up_add: !>[X0: $tType]:($o)).
% 0.20/0.43  thf(func_def_41, type, ordere216010020id_add: !>[X0: $tType]:($o)).
% 0.20/0.43  thf(func_def_42, type, semiri1193490041visors: !>[X0: $tType]:($o)).
% 0.20/0.43  thf(func_def_43, type, linord1659791738miring: !>[X0: $tType]:($o)).
% 0.20/0.43  thf(func_def_44, type, canoni770627133id_add: !>[X0: $tType]:($o)).
% 0.20/0.43  thf(func_def_45, type, semiri1923998003cancel: !>[X0: $tType]:($o)).
% 0.20/0.43  thf(func_def_46, type, fun_upd: !>[X0: $tType, X1: $tType]:((X0 > X1) > X0 > X1 > X0 > X1)).
% 0.20/0.43  thf(func_def_47, type, minus_minus: !>[X0: $tType]:(X0 > X0 > X0)).
% 0.20/0.43  thf(func_def_48, type, one_one: !>[X0: $tType]:(X0)).
% 0.20/0.43  thf(func_def_49, type, times_times: !>[X0: $tType]:(X0 > X0 > X0)).
% 0.20/0.43  thf(func_def_50, type, zero_zero: !>[X0: $tType]:(X0)).
% 0.20/0.43  thf(func_def_51, type, groups1340683514dd_sum: !>[X0: $tType, X1: $tType]:((X0 > X1) > set @ X0 > X1)).
% 0.20/0.43  thf(func_def_52, type, if: !>[X0: $tType]:($o > X0 > X0 > X0)).
% 0.20/0.43  thf(func_def_53, type, number2016821345itions: (nat > nat) > nat > $o).
% 0.20/0.43  thf(func_def_54, type, ord_less: !>[X0: $tType]:(X0 > X0 > $o)).
% 0.20/0.43  thf(func_def_55, type, ord_less_eq: !>[X0: $tType]:(X0 > X0 > $o)).
% 0.20/0.43  thf(func_def_56, type, collect: !>[X0: $tType]:((X0 > $o) > set @ X0)).
% 0.20/0.43  thf(func_def_57, type, set_ord_atMost: !>[X0: $tType]:(X0 > set @ X0)).
% 0.20/0.43  thf(func_def_58, type, member: !>[X0: $tType]:(X0 > set @ X0 > $o)).
% 0.20/0.43  thf(func_def_59, type, k: nat).
% 0.20/0.43  thf(func_def_60, type, n: nat).
% 0.20/0.43  thf(func_def_61, type, p: nat > nat).
% 0.20/0.43  thf(func_def_76, type, sK0: !>[X0: $tType]:((X0 > nat) > (X0 > $o) > X0)).
% 0.20/0.43  thf(func_def_77, type, sK1: !>[X0: $tType, X1: $tType]:((X0 > X1) > X0)).
% 0.20/0.43  thf(func_def_78, type, sK2: !>[X0: $tType, X1: $tType]:((X0 > X1) > X0)).
% 0.20/0.43  thf(func_def_79, type, sK3: (nat > $o) > nat).
% 0.20/0.43  thf(func_def_80, type, sK4: nat > (nat > $o) > nat).
% 0.20/0.43  thf(func_def_81, type, sK5: !>[X0: $tType, X1: $tType]:((X1 > X0) > (X1 > X0) > X1)).
% 0.20/0.43  thf(func_def_82, type, sK6: !>[X0: $tType, X1: $tType]:((X1 > X0) > X1)).
% 0.20/0.43  thf(func_def_83, type, sK7: !>[X0: $tType, X1: $tType]:((X1 > X0) > X1)).
% 0.20/0.43  thf(func_def_84, type, sK8: !>[X0: $tType]:(set @ X0 > set @ X0 > X0)).
% 0.20/0.43  thf(func_def_85, type, sK9: !>[X0: $tType, X1: $tType]:((X1 > X0) > X1)).
% 0.20/0.43  thf(func_def_86, type, sK10: !>[X0: $tType, X1: $tType]:((X1 > X0) > X1)).
% 0.20/0.43  thf(func_def_87, type, sK11: !>[X0: $tType, X1: $tType]:((X1 > X0) > X1)).
% 0.20/0.43  thf(func_def_88, type, sK12: !>[X0: $tType, X1: $tType]:((X1 > X0) > X1)).
% 0.20/0.43  thf(func_def_89, type, sK13: !>[X0: $tType, X1: $tType]:((X0 > X1) > X0)).
% 0.20/0.43  thf(func_def_90, type, sK14: !>[X0: $tType, X1: $tType]:((X0 > X1) > X0)).
% 0.20/0.43  thf(func_def_91, type, sK15: !>[X0: $tType]:((X0 > nat) > (X0 > nat) > set @ X0 > X0)).
% 0.20/0.43  thf(func_def_92, type, sK16: !>[X0: $tType, X1: $tType]:((X0 > X1) > X0)).
% 0.20/0.43  thf(func_def_93, type, sK17: !>[X0: $tType, X1: $tType]:((X0 > X1) > X0)).
% 0.20/0.43  thf(func_def_94, type, sK18: nat > (nat > $o) > nat).
% 0.20/0.43  thf(func_def_95, type, sK19: (nat > $o) > nat).
% 0.20/0.43  thf(func_def_96, type, sK20: !>[X0: $tType, X1: $tType]:((X1 > X0) > (X1 > X0) > X1)).
% 0.20/0.43  thf(func_def_97, type, sK21: !>[X0: $tType, X1: $tType]:((X0 > X1) > X0)).
% 0.20/0.43  thf(func_def_98, type, sK22: !>[X0: $tType, X1: $tType]:((X0 > X1) > X0)).
% 0.20/0.43  thf(func_def_99, type, sK23: !>[X0: $tType, X1: $tType]:((X1 > X0) > X1)).
% 0.20/0.43  thf(func_def_100, type, sK24: !>[X0: $tType, X1: $tType]:((X1 > X0) > X1)).
% 0.20/0.43  thf(func_def_101, type, sK25: (nat > $o) > nat).
% 0.20/0.43  thf(func_def_102, type, sK26: nat > (nat > nat) > nat).
% 0.20/0.43  thf(func_def_103, type, sK27: (nat > $o) > nat).
% 0.20/0.43  thf(func_def_105, type, ph29: !>[X0: $tType]:(X0)).
% 0.20/0.43  thf(f1343,plain,(
% 0.20/0.43    $false),
% 0.20/0.43    inference(subsumption_resolution,[],[f1333,f1150])).
% 0.20/0.43  thf(f1150,plain,(
% 0.20/0.43    ((number2016821345itions @ p @ n) = $true)),
% 0.20/0.43    inference(cnf_transformation,[],[f374])).
% 0.20/0.43  thf(f374,plain,(
% 0.20/0.43    ((number2016821345itions @ p @ n) = $true)),
% 0.20/0.43    inference(fool_elimination,[],[f373])).
% 0.20/0.43  thf(f373,plain,(
% 0.20/0.43    (number2016821345itions @ p @ n)),
% 0.20/0.43    inference(rectify,[],[f1])).
% 0.20/0.43  thf(f1,axiom,(
% 0.20/0.43    (number2016821345itions @ p @ n)),
% 0.20/0.43    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_0_partitions)).
% 0.20/0.43  thf(f1333,plain,(
% 0.20/0.43    ((number2016821345itions @ p @ n) != $true)),
% 0.20/0.43    inference(trivial_inequality_removal,[],[f1330])).
% 0.20/0.43  thf(f1330,plain,(
% 0.20/0.43    ((minus_minus @ nat @ n @ k) != (minus_minus @ nat @ n @ k)) | ((number2016821345itions @ p @ n) != $true)),
% 0.20/0.43    inference(superposition,[],[f1188,f1235])).
% 0.20/0.43  thf(f1235,plain,(
% 0.20/0.43    ( ! [X0 : nat > nat,X1 : nat] : (((groups1340683514dd_sum @ nat @ nat @ (^[Y0 : nat]: (times_times @ nat @ (X0 @ Y0) @ Y0)) @ (set_ord_atMost @ nat @ X1)) = X1) | ((number2016821345itions @ X0 @ X1) != $true)) )),
% 0.20/0.43    inference(cnf_transformation,[],[f948])).
% 0.20/0.43  thf(f948,plain,(
% 0.20/0.43    ! [X0 : nat > nat,X1 : nat] : (((number2016821345itions @ X0 @ X1) != $true) | (((groups1340683514dd_sum @ nat @ nat @ (^[Y0 : nat]: (times_times @ nat @ (X0 @ Y0) @ Y0)) @ (set_ord_atMost @ nat @ X1)) = X1) & ! [X2 : nat] : ((((ord_less_eq @ nat @ one_one @ nat @ X2) = $true) & ((ord_less_eq @ nat @ X2 @ X1) = $true)) | (zero_zero @ nat = (X0 @ X2)))))),
% 0.20/0.43    inference(ennf_transformation,[],[f720])).
% 0.20/0.43  thf(f720,plain,(
% 0.20/0.43    ! [X0 : nat > nat,X1 : nat] : (((number2016821345itions @ X0 @ X1) = $true) => ~(! [X2 : nat] : ((zero_zero @ nat != (X0 @ X2)) => (((ord_less_eq @ nat @ one_one @ nat @ X2) = $true) & ((ord_less_eq @ nat @ X2 @ X1) = $true))) => ((groups1340683514dd_sum @ nat @ nat @ (^[Y0 : nat]: (times_times @ nat @ (X0 @ Y0) @ Y0)) @ (set_ord_atMost @ nat @ X1)) != X1)))),
% 0.20/0.43    inference(fool_elimination,[],[f719])).
% 0.20/0.43  thf(f719,plain,(
% 0.20/0.43    ! [X0 : nat > nat,X1 : nat] : ((number2016821345itions @ X0 @ X1) => ~(! [X2 : nat] : ((zero_zero @ nat != (X0 @ X2)) => ((ord_less_eq @ nat @ one_one @ nat @ X2) & (ord_less_eq @ nat @ X2 @ X1))) => ((groups1340683514dd_sum @ nat @ nat @ (^[X3 : nat] : (times_times @ nat @ (X0 @ X3) @ X3)) @ (set_ord_atMost @ nat @ X1)) != X1)))),
% 0.20/0.43    inference(rectify,[],[f66])).
% 0.20/0.43  thf(f66,axiom,(
% 0.20/0.43    ! [X33 : nat > nat,X17 : nat] : ((number2016821345itions @ X33 @ X17) => ~(! [X53 : nat] : ((zero_zero @ nat != (X33 @ X53)) => ((ord_less_eq @ nat @ one_one @ nat @ X53) & (ord_less_eq @ nat @ X53 @ X17))) => ((groups1340683514dd_sum @ nat @ nat @ (^[X7 : nat] : (times_times @ nat @ (X33 @ X7) @ X7)) @ (set_ord_atMost @ nat @ X17)) != X17)))),
% 0.20/0.43    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_65_partitionsE)).
% 0.20/0.43  thf(f1188,plain,(
% 0.20/0.43    ((minus_minus @ nat @ n @ k) != (minus_minus @ nat @ (groups1340683514dd_sum @ nat @ nat @ (^[Y0 : nat]: (times_times @ nat @ (p @ Y0) @ Y0)) @ (set_ord_atMost @ nat @ n)) @ k))),
% 0.20/0.43    inference(cnf_transformation,[],[f857])).
% 0.20/0.43  thf(f857,plain,(
% 0.20/0.43    ((minus_minus @ nat @ n @ k) != (minus_minus @ nat @ (groups1340683514dd_sum @ nat @ nat @ (^[Y0 : nat]: (times_times @ nat @ (p @ Y0) @ Y0)) @ (set_ord_atMost @ nat @ n)) @ k))),
% 0.20/0.43    inference(flattening,[],[f796])).
% 0.20/0.43  thf(f796,plain,(
% 0.20/0.43    ~((minus_minus @ nat @ n @ k) = (minus_minus @ nat @ (groups1340683514dd_sum @ nat @ nat @ (^[Y0 : nat]: (times_times @ nat @ (p @ Y0) @ Y0)) @ (set_ord_atMost @ nat @ n)) @ k))),
% 0.20/0.43    inference(fool_elimination,[],[f795])).
% 0.20/0.43  thf(f795,plain,(
% 0.20/0.43    ~((minus_minus @ nat @ n @ k) = (minus_minus @ nat @ (groups1340683514dd_sum @ nat @ nat @ (^[X0 : nat] : (times_times @ nat @ (p @ X0) @ X0)) @ (set_ord_atMost @ nat @ n)) @ k))),
% 0.20/0.43    inference(rectify,[],[f301])).
% 0.20/0.43  thf(f301,negated_conjecture,(
% 0.20/0.43    ~((minus_minus @ nat @ n @ k) = (minus_minus @ nat @ (groups1340683514dd_sum @ nat @ nat @ (^[X7 : nat] : (times_times @ nat @ (p @ X7) @ X7)) @ (set_ord_atMost @ nat @ n)) @ k))),
% 0.20/0.43    inference(negated_conjecture,[],[f300])).
% 0.20/0.43  thf(f300,conjecture,(
% 0.20/0.43    ((minus_minus @ nat @ n @ k) = (minus_minus @ nat @ (groups1340683514dd_sum @ nat @ nat @ (^[X7 : nat] : (times_times @ nat @ (p @ X7) @ X7)) @ (set_ord_atMost @ nat @ n)) @ k))),
% 0.20/0.43    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',conj_0)).
% 0.20/0.43  % SZS output end Proof for theBenchmark
% 0.20/0.43  % (20950)------------------------------
% 0.20/0.43  % (20950)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.20/0.43  % (20950)Termination reason: Refutation
% 0.20/0.43  
% 0.20/0.43  % (20950)Memory used [KB]: 6780
% 0.20/0.43  % (20950)Time elapsed: 0.042 s
% 0.20/0.43  % (20950)Instructions burned: 63 (million)
% 0.20/0.43  % (20950)------------------------------
% 0.20/0.43  % (20950)------------------------------
% 0.20/0.43  % (20944)Success in time 0.066 s
% 0.20/0.43  % Vampire---4.8 exiting
%------------------------------------------------------------------------------