TSTP Solution File: DAT137^1 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : DAT137^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/sandbox2/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% Computer : n016.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:49:48 EDT 2024
% Result : Theorem 0.20s 0.42s
% Output : Refutation 0.20s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : DAT137^1 : TPTP v8.2.0. Released v7.0.0.
% 0.07/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.35 % Computer : n016.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % 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 : Sun May 19 23:31:53 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 % (31236)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 % (31238)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 % (31243)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.39 % (31243)Instruction limit reached!
% 0.20/0.39 % (31243)------------------------------
% 0.20/0.39 % (31243)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.20/0.39 % (31243)Termination reason: Unknown
% 0.20/0.39 % (31243)Termination phase: shuffling
% 0.20/0.39
% 0.20/0.39 % (31243)Memory used [KB]: 1407
% 0.20/0.39 % (31243)Time elapsed: 0.005 s
% 0.20/0.39 % (31243)Instructions burned: 4 (million)
% 0.20/0.39 % (31243)------------------------------
% 0.20/0.39 % (31243)------------------------------
% 0.20/0.39 % (31237)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.39 % (31237)Instruction limit reached!
% 0.20/0.39 % (31237)------------------------------
% 0.20/0.39 % (31237)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.20/0.39 % (31237)Termination reason: Unknown
% 0.20/0.39 % (31237)Termination phase: shuffling
% 0.20/0.39
% 0.20/0.39 % (31237)Memory used [KB]: 1407
% 0.20/0.39 % (31237)Time elapsed: 0.004 s
% 0.20/0.39 % (31237)Instructions burned: 4 (million)
% 0.20/0.39 % (31237)------------------------------
% 0.20/0.39 % (31237)------------------------------
% 0.20/0.39 % (31241)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.40 % (31242)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.40 % (31239)lrs+10_1:1_au=on:inj=on:i=2:si=on:rtra=on_0 on theBenchmark for (2999ds/2Mi)
% 0.20/0.40 % (31238)Instruction limit reached!
% 0.20/0.40 % (31238)------------------------------
% 0.20/0.40 % (31238)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.20/0.40 % (31238)Termination reason: Unknown
% 0.20/0.40 % (31238)Termination phase: Property scanning
% 0.20/0.40
% 0.20/0.40 % (31238)Memory used [KB]: 1663
% 0.20/0.40 % (31238)Time elapsed: 0.018 s
% 0.20/0.40 % (31238)Instructions burned: 27 (million)
% 0.20/0.40 % (31238)------------------------------
% 0.20/0.40 % (31238)------------------------------
% 0.20/0.40 % (31239)Instruction limit reached!
% 0.20/0.40 % (31239)------------------------------
% 0.20/0.40 % (31239)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.20/0.40 % (31239)Termination reason: Unknown
% 0.20/0.40 % (31239)Termination phase: shuffling
% 0.20/0.40
% 0.20/0.40 % (31239)Memory used [KB]: 1407
% 0.20/0.40 % (31239)Time elapsed: 0.005 s
% 0.20/0.40 % (31239)Instructions burned: 2 (million)
% 0.20/0.40 % (31239)------------------------------
% 0.20/0.40 % (31239)------------------------------
% 0.20/0.40 % (31240)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.40 % (31240)Instruction limit reached!
% 0.20/0.40 % (31240)------------------------------
% 0.20/0.40 % (31240)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.20/0.40 % (31240)Termination reason: Unknown
% 0.20/0.40 % (31240)Termination phase: shuffling
% 0.20/0.40
% 0.20/0.40 % (31240)Memory used [KB]: 1407
% 0.20/0.40 % (31240)Time elapsed: 0.003 s
% 0.20/0.40 % (31240)Instructions burned: 4 (million)
% 0.20/0.40 % (31240)------------------------------
% 0.20/0.40 % (31240)------------------------------
% 0.20/0.41 % (31244)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.41 % (31242)Instruction limit reached!
% 0.20/0.41 % (31242)------------------------------
% 0.20/0.41 % (31242)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.20/0.41 % (31242)Termination reason: Unknown
% 0.20/0.41 % (31242)Termination phase: Property scanning
% 0.20/0.41
% 0.20/0.41 % (31242)Memory used [KB]: 1663
% 0.20/0.41 % (31242)Time elapsed: 0.014 s
% 0.20/0.41 % (31242)Instructions burned: 18 (million)
% 0.20/0.41 % (31242)------------------------------
% 0.20/0.41 % (31242)------------------------------
% 0.20/0.41 % (31246)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.41 % (31248)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 % (31246)Instruction limit reached!
% 0.20/0.42 % (31246)------------------------------
% 0.20/0.42 % (31246)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.20/0.42 % (31246)Termination reason: Unknown
% 0.20/0.42 % (31246)Termination phase: shuffling
% 0.20/0.42
% 0.20/0.42 % (31246)Memory used [KB]: 1407
% 0.20/0.42 % (31246)Time elapsed: 0.004 s
% 0.20/0.42 % (31246)Instructions burned: 4 (million)
% 0.20/0.42 % (31246)------------------------------
% 0.20/0.42 % (31246)------------------------------
% 0.20/0.42 % (31247)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.42 % (31248)Instruction limit reached!
% 0.20/0.42 % (31248)------------------------------
% 0.20/0.42 % (31248)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.20/0.42 % (31248)Termination reason: Unknown
% 0.20/0.42 % (31248)Termination phase: shuffling
% 0.20/0.42
% 0.20/0.42 % (31248)Memory used [KB]: 1535
% 0.20/0.42 % (31248)Time elapsed: 0.005 s
% 0.20/0.42 % (31248)Instructions burned: 8 (million)
% 0.20/0.42 % (31248)------------------------------
% 0.20/0.42 % (31248)------------------------------
% 0.20/0.42 % (31241)First to succeed.
% 0.20/0.42 % (31241)Refutation found. Thanks to Tanya!
% 0.20/0.42 % SZS status Theorem for theBenchmark
% 0.20/0.42 % SZS output start Proof for theBenchmark
% 0.20/0.42 thf(type_def_5, type, itself: ($tType) > $tType).
% 0.20/0.42 thf(type_def_7, type, nat: $tType).
% 0.20/0.42 thf(type_def_8, type, coindu1593790203_llist: ($tType) > $tType).
% 0.20/0.42 thf(type_def_9, type, extended_enat: $tType).
% 0.20/0.42 thf(type_def_10, type, list: ($tType) > $tType).
% 0.20/0.42 thf(type_def_11, type, num: $tType).
% 0.20/0.42 thf(func_def_0, type, coindu1593790203_llist: ($tType) > $tType).
% 0.20/0.42 thf(func_def_1, type, extended_enat: $tType).
% 0.20/0.42 thf(func_def_2, type, list: ($tType) > $tType).
% 0.20/0.42 thf(func_def_3, type, num: $tType).
% 0.20/0.42 thf(func_def_4, type, nat: $tType).
% 0.20/0.42 thf(func_def_5, type, itself: ($tType) > $tType).
% 0.20/0.42 thf(func_def_6, type, type: !>[X0: $tType]:(itself @ X0 > $o)).
% 0.20/0.42 thf(func_def_7, type, one: !>[X0: $tType]:(itself @ X0 > $o)).
% 0.20/0.42 thf(func_def_8, type, numeral: !>[X0: $tType]:(itself @ X0 > $o)).
% 0.20/0.42 thf(func_def_9, type, ring_1: !>[X0: $tType]:(itself @ X0 > $o)).
% 0.20/0.42 thf(func_def_10, type, uminus: !>[X0: $tType]:(itself @ X0 > $o)).
% 0.20/0.42 thf(func_def_11, type, ord: !>[X0: $tType]:(itself @ X0 > $o)).
% 0.20/0.42 thf(func_def_12, type, ring_char_0: !>[X0: $tType]:(itself @ X0 > $o)).
% 0.20/0.42 thf(func_def_13, type, neg_numeral: !>[X0: $tType]:(itself @ X0 > $o)).
% 0.20/0.42 thf(func_def_14, type, order: !>[X0: $tType]:(itself @ X0 > $o)).
% 0.20/0.42 thf(func_def_15, type, group_add: !>[X0: $tType]:(itself @ X0 > $o)).
% 0.20/0.42 thf(func_def_16, type, linorder: !>[X0: $tType]:(itself @ X0 > $o)).
% 0.20/0.42 thf(func_def_17, type, ab_group_add: !>[X0: $tType]:(itself @ X0 > $o)).
% 0.20/0.42 thf(func_def_18, type, semiring_char_0: !>[X0: $tType]:(itself @ X0 > $o)).
% 0.20/0.42 thf(func_def_19, type, semigroup_add: !>[X0: $tType]:(itself @ X0 > $o)).
% 0.20/0.42 thf(func_def_20, type, comm_semiring_1: !>[X0: $tType]:(itself @ X0 > $o)).
% 0.20/0.42 thf(func_def_21, type, linordered_idom: !>[X0: $tType]:(itself @ X0 > $o)).
% 0.20/0.42 thf(func_def_22, type, linordered_field: !>[X0: $tType]:(itself @ X0 > $o)).
% 0.20/0.42 thf(func_def_23, type, ab_semigroup_add: !>[X0: $tType]:(itself @ X0 > $o)).
% 0.20/0.42 thf(func_def_24, type, linordered_semidom: !>[X0: $tType]:(itself @ X0 > $o)).
% 0.20/0.42 thf(func_def_25, type, cancel_semigroup_add: !>[X0: $tType]:(itself @ X0 > $o)).
% 0.20/0.42 thf(func_def_26, type, ordered_ab_group_add: !>[X0: $tType]:(itself @ X0 > $o)).
% 0.20/0.42 thf(func_def_27, type, ordere779506340up_add: !>[X0: $tType]:(itself @ X0 > $o)).
% 0.20/0.42 thf(func_def_28, type, ordere236663937imp_le: !>[X0: $tType]:(itself @ X0 > $o)).
% 0.20/0.42 thf(func_def_29, type, ordere223160158up_add: !>[X0: $tType]:(itself @ X0 > $o)).
% 0.20/0.42 thf(func_def_30, type, strict2144017051up_add: !>[X0: $tType]:(itself @ X0 > $o)).
% 0.20/0.42 thf(func_def_31, type, condit1656338222tinuum: !>[X0: $tType]:(itself @ X0 > $o)).
% 0.20/0.42 thf(func_def_32, type, coindu493225792length: !>[X0: $tType]:(nat > coindu1593790203_llist @ X0 > extended_enat)).
% 0.20/0.42 thf(func_def_33, type, coindu1542816657of_aux: !>[X0: $tType]:(list @ X0 > coindu1593790203_llist @ X0 > list @ X0)).
% 0.20/0.42 thf(func_def_34, type, coindu1121789889_LCons: !>[X0: $tType]:(X0 > coindu1593790203_llist @ X0 > coindu1593790203_llist @ X0)).
% 0.20/0.42 thf(func_def_35, type, coindu1598213697e_LNil: !>[X0: $tType]:(coindu1593790203_llist @ X0)).
% 0.20/0.42 thf(func_def_36, type, coindu1079202755ist_of: !>[X0: $tType]:(list @ X0 > coindu1593790203_llist @ X0)).
% 0.20/0.42 thf(func_def_37, type, coindu567634248member: !>[X0: $tType]:(X0 > coindu1593790203_llist @ X0 > $o)).
% 0.20/0.42 thf(func_def_38, type, one_one: !>[X0: $tType]:(X0)).
% 0.20/0.42 thf(func_def_39, type, plus_plus: !>[X0: $tType]:(X0 > X0 > X0)).
% 0.20/0.42 thf(func_def_40, type, uminus_uminus: !>[X0: $tType]:(X0 > X0)).
% 0.20/0.42 thf(func_def_41, type, if: !>[X0: $tType]:($o > X0 > X0 > X0)).
% 0.20/0.42 thf(func_def_42, type, count_list: !>[X0: $tType]:(list @ X0 > X0 > nat)).
% 0.20/0.42 thf(func_def_43, type, gen_length: !>[X0: $tType]:(nat > list @ X0 > nat)).
% 0.20/0.42 thf(func_def_44, type, cons: !>[X0: $tType]:(X0 > list @ X0 > list @ X0)).
% 0.20/0.42 thf(func_def_45, type, nil: !>[X0: $tType]:(list @ X0)).
% 0.20/0.42 thf(func_def_46, type, member: !>[X0: $tType]:(list @ X0 > X0 > $o)).
% 0.20/0.42 thf(func_def_47, type, nth: !>[X0: $tType]:(list @ X0 > nat > X0)).
% 0.20/0.42 thf(func_def_48, type, ord_lexordp_eq: !>[X0: $tType]:(list @ X0 > list @ X0 > $o)).
% 0.20/0.42 thf(func_def_49, type, product_lists: !>[X0: $tType]:(list @ list @ X0 > list @ list @ X0)).
% 0.20/0.42 thf(func_def_50, type, sublists: !>[X0: $tType]:(list @ X0 > list @ list @ X0)).
% 0.20/0.42 thf(func_def_51, type, upt: nat > nat > list @ nat).
% 0.20/0.42 thf(func_def_52, type, suc: nat > nat).
% 0.20/0.42 thf(func_def_53, type, nat_triangle: nat > nat).
% 0.20/0.42 thf(func_def_54, type, bitM: num > num).
% 0.20/0.42 thf(func_def_55, type, inc: num > num).
% 0.20/0.42 thf(func_def_56, type, neg_numeral_dbl: !>[X0: $tType]:(X0 > X0)).
% 0.20/0.42 thf(func_def_57, type, neg_numeral_dbl_dec: !>[X0: $tType]:(X0 > X0)).
% 0.20/0.42 thf(func_def_58, type, neg_numeral_sub: !>[X0: $tType]:(num > num > X0)).
% 0.20/0.42 thf(func_def_59, type, bit0: num > num).
% 0.20/0.42 thf(func_def_60, type, one2: num).
% 0.20/0.42 thf(func_def_61, type, numeral_numeral: !>[X0: $tType]:(num > X0)).
% 0.20/0.42 thf(func_def_62, type, ring_1_iszero: !>[X0: $tType]:(X0 > $o)).
% 0.20/0.42 thf(func_def_63, type, ord_less: !>[X0: $tType]:(X0 > X0 > $o)).
% 0.20/0.42 thf(func_def_64, type, type2: !>[X0: $tType]:(itself @ X0)).
% 0.20/0.42 thf(func_def_65, type, prefixes: !>[X0: $tType]:(list @ X0 > list @ list @ X0)).
% 0.20/0.42 thf(func_def_66, type, ma: nat).
% 0.20/0.42 thf(func_def_67, type, na: nat).
% 0.20/0.42 thf(func_def_83, type, sK0: (nat > $o) > nat).
% 0.20/0.42 thf(func_def_84, type, sK1: !>[X0: $tType]:((X0 > $o) > (X0 > nat) > X0)).
% 0.20/0.42 thf(func_def_85, type, sK2: !>[X0: $tType, X1: $tType]:(((X0 > X1) > list @ X0 > list @ X1 > $o) > X0 > X1)).
% 0.20/0.42 thf(func_def_86, type, sK3: !>[X0: $tType, X1: $tType]:(((X0 > X1) > list @ X0 > list @ X1 > $o) > list @ X1)).
% 0.20/0.42 thf(func_def_87, type, sK4: !>[X0: $tType, X1: $tType]:(((X0 > X1) > list @ X0 > list @ X1 > $o) > X0 > X1)).
% 0.20/0.42 thf(func_def_88, type, sK5: !>[X0: $tType, X1: $tType]:(((X0 > X1) > list @ X0 > list @ X1 > $o) > X0)).
% 0.20/0.42 thf(func_def_89, type, sK6: !>[X0: $tType, X1: $tType]:(((X0 > X1) > list @ X0 > list @ X1 > $o) > list @ X0)).
% 0.20/0.42 thf(func_def_90, type, sK7: !>[X0: $tType, X1: $tType]:(((X0 > X1) > list @ X0 > list @ X1 > $o) > list @ X1)).
% 0.20/0.42 thf(func_def_91, type, sK8: !>[X0: $tType, X1: $tType]:((list @ X0 > list @ X1 > $o) > X0)).
% 0.20/0.42 thf(func_def_92, type, sK9: !>[X0: $tType, X1: $tType]:((list @ X0 > list @ X1 > $o) > list @ X0)).
% 0.20/0.42 thf(func_def_93, type, sK10: !>[X0: $tType, X1: $tType]:((list @ X0 > list @ X1 > $o) > X1)).
% 0.20/0.42 thf(func_def_94, type, sK11: !>[X0: $tType, X1: $tType]:((list @ X0 > list @ X1 > $o) > list @ X1)).
% 0.20/0.42 thf(func_def_95, type, sK12: !>[X0: $tType, X1: $tType]:((list @ X0 > list @ X1 > $o) > X0)).
% 0.20/0.42 thf(func_def_96, type, sK13: !>[X0: $tType, X1: $tType]:((list @ X0 > list @ X1 > $o) > list @ X0)).
% 0.20/0.42 thf(func_def_97, type, sK14: !>[X0: $tType, X1: $tType]:((list @ X0 > list @ X1 > $o) > X1)).
% 0.20/0.42 thf(func_def_98, type, sK15: !>[X0: $tType, X1: $tType]:((list @ X0 > list @ X1 > $o) > list @ X1)).
% 0.20/0.42 thf(func_def_99, type, sK16: !>[X0: $tType]:((list @ X0 > $o) > X0)).
% 0.20/0.42 thf(func_def_100, type, sK17: !>[X0: $tType]:((list @ X0 > $o) > list @ X0)).
% 0.20/0.42 thf(func_def_101, type, sK18: list @ nat > nat).
% 0.20/0.42 thf(func_def_102, type, sK19: list @ nat > list @ nat).
% 0.20/0.42 thf(func_def_103, type, sK20: !>[X0: $tType]:((X0 > $o) > (X0 > nat) > X0)).
% 0.20/0.42 thf(func_def_104, type, sK21: !>[X0: $tType]:(coindu1593790203_llist @ X0 > X0)).
% 0.20/0.42 thf(func_def_105, type, sK22: !>[X0: $tType]:(coindu1593790203_llist @ X0 > coindu1593790203_llist @ X0)).
% 0.20/0.42 thf(func_def_106, type, sK23: !>[X0: $tType]:((list @ X0 > list @ X0 > $o) > list @ X0)).
% 0.20/0.42 thf(func_def_107, type, sK24: !>[X0: $tType]:((list @ X0 > list @ X0 > $o) > X0)).
% 0.20/0.42 thf(func_def_108, type, sK25: !>[X0: $tType]:((list @ X0 > list @ X0 > $o) > list @ X0)).
% 0.20/0.42 thf(func_def_109, type, sK26: !>[X0: $tType]:((list @ X0 > list @ X0 > $o) > X0)).
% 0.20/0.42 thf(func_def_110, type, sK27: !>[X0: $tType]:((list @ X0 > list @ X0 > $o) > list @ X0)).
% 0.20/0.42 thf(func_def_111, type, sK28: !>[X0: $tType]:((list @ X0 > list @ X0 > $o) > list @ X0)).
% 0.20/0.42 thf(func_def_112, type, sK29: (list @ nat > $o) > nat).
% 0.20/0.42 thf(func_def_113, type, sK30: (list @ nat > $o) > list @ nat).
% 0.20/0.42 thf(func_def_114, type, sK31: !>[X0: $tType]:(list @ list @ X0 > list @ list @ X0)).
% 0.20/0.42 thf(func_def_115, type, sK32: !>[X0: $tType]:(list @ list @ X0 > X0)).
% 0.20/0.42 thf(func_def_116, type, sK33: !>[X0: $tType]:(list @ list @ X0 > list @ X0)).
% 0.20/0.42 thf(func_def_117, type, sK34: !>[X0: $tType]:(list @ list @ X0 > list @ list @ X0)).
% 0.20/0.42 thf(func_def_118, type, sK35: !>[X0: $tType]:(((nat > X0 > X0) > nat > nat > X0 > $o) > nat > X0 > X0)).
% 0.20/0.42 thf(func_def_119, type, sK36: !>[X0: $tType]:(((nat > X0 > X0) > nat > nat > X0 > $o) > nat)).
% 0.20/0.42 thf(func_def_120, type, sK37: !>[X0: $tType]:(((nat > X0 > X0) > nat > nat > X0 > $o) > nat)).
% 0.20/0.42 thf(func_def_121, type, sK38: !>[X0: $tType]:(((nat > X0 > X0) > nat > nat > X0 > $o) > X0)).
% 0.20/0.42 thf(func_def_122, type, sK39: !>[X0: $tType]:((list @ X0 > $o) > X0)).
% 0.20/0.42 thf(func_def_123, type, sK40: !>[X0: $tType]:((list @ X0 > $o) > list @ X0)).
% 0.20/0.42 thf(func_def_124, type, sK41: nat > nat > nat).
% 0.20/0.42 thf(func_def_125, type, sK42: !>[X0: $tType]:(list @ X0 > X0)).
% 0.20/0.42 thf(func_def_126, type, sK43: !>[X0: $tType]:(list @ X0 > list @ X0)).
% 0.20/0.42 thf(func_def_127, type, sK44: !>[X0: $tType]:(list @ X0 > X0)).
% 0.20/0.42 thf(func_def_128, type, sK45: !>[X0: $tType]:(list @ X0 > list @ X0)).
% 0.20/0.42 thf(func_def_129, type, sK46: (nat > $o) > nat > nat).
% 0.20/0.42 thf(func_def_130, type, sK47: (nat > $o) > nat > nat).
% 0.20/0.42 thf(func_def_131, type, sK48: !>[X0: $tType]:(coindu1593790203_llist @ X0 > X0 > list @ X0 > list @ X0)).
% 0.20/0.42 thf(func_def_132, type, sK49: !>[X0: $tType]:(list @ X0 > X0)).
% 0.20/0.42 thf(func_def_133, type, sK50: !>[X0: $tType]:(list @ X0 > X0)).
% 0.20/0.42 thf(func_def_134, type, sK51: !>[X0: $tType]:(list @ X0 > X0)).
% 0.20/0.42 thf(func_def_135, type, sK52: !>[X0: $tType]:(list @ X0 > list @ X0)).
% 0.20/0.42 thf(func_def_136, type, sK53: nat > nat > nat).
% 0.20/0.42 thf(func_def_137, type, sK54: nat > nat > nat).
% 0.20/0.42 thf(func_def_138, type, sK55: nat > nat > nat).
% 0.20/0.42 thf(func_def_139, type, sK56: (nat > $o) > nat).
% 0.20/0.42 thf(func_def_140, type, sK57: !>[X0: $tType]:((X0 > nat) > (X0 > $o) > X0)).
% 0.20/0.42 thf(func_def_141, type, sK58: (nat > nat > $o) > nat).
% 0.20/0.42 thf(func_def_142, type, sK59: (nat > nat > $o) > nat).
% 0.20/0.42 thf(func_def_143, type, sK60: (nat > nat > $o) > nat).
% 0.20/0.42 thf(func_def_144, type, sK61: (nat > nat > $o) > nat).
% 0.20/0.42 thf(func_def_145, type, sK62: !>[X0: $tType]:(list @ X0 > X0)).
% 0.20/0.42 thf(func_def_146, type, sK63: !>[X0: $tType]:(list @ X0 > list @ X0)).
% 0.20/0.42 thf(func_def_147, type, sK64: !>[X0: $tType]:((list @ X0 > list @ X0 > $o) > X0)).
% 0.20/0.42 thf(func_def_148, type, sK65: !>[X0: $tType]:((list @ X0 > list @ X0 > $o) > list @ X0)).
% 0.20/0.42 thf(func_def_149, type, sK66: !>[X0: $tType]:((list @ X0 > list @ X0 > $o) > X0)).
% 0.20/0.42 thf(func_def_150, type, sK67: !>[X0: $tType]:((list @ X0 > list @ X0 > $o) > list @ X0)).
% 0.20/0.42 thf(func_def_151, type, sK68: !>[X0: $tType]:((list @ X0 > list @ X0 > $o) > list @ X0)).
% 0.20/0.42 thf(func_def_152, type, sK69: !>[X0: $tType]:((list @ X0 > list @ X0 > $o) > X0)).
% 0.20/0.42 thf(func_def_153, type, sK70: !>[X0: $tType]:((list @ X0 > list @ X0 > $o) > list @ X0)).
% 0.20/0.42 thf(func_def_154, type, sK71: !>[X0: $tType]:((list @ X0 > $o) > X0)).
% 0.20/0.42 thf(func_def_155, type, sK72: !>[X0: $tType]:((list @ X0 > $o) > X0)).
% 0.20/0.42 thf(func_def_156, type, sK73: !>[X0: $tType]:((list @ X0 > $o) > X0)).
% 0.20/0.42 thf(func_def_157, type, sK74: !>[X0: $tType]:((list @ X0 > $o) > list @ X0)).
% 0.20/0.42 thf(func_def_158, type, sK75: !>[X0: $tType]:((list @ X0 > $o) > X0)).
% 0.20/0.42 thf(func_def_159, type, sK76: !>[X0: $tType]:((list @ X0 > $o) > X0)).
% 0.20/0.42 thf(func_def_160, type, sK77: !>[X0: $tType]:((list @ X0 > $o) > list @ X0)).
% 0.20/0.42 thf(func_def_161, type, sK78: !>[X0: $tType]:(coindu1593790203_llist @ X0 > X0)).
% 0.20/0.42 thf(func_def_162, type, sK79: !>[X0: $tType]:(coindu1593790203_llist @ X0 > coindu1593790203_llist @ X0)).
% 0.20/0.42 thf(func_def_164, type, ph81: !>[X0: $tType]:(X0)).
% 0.20/0.42 thf(f1216,plain,(
% 0.20/0.42 $false),
% 0.20/0.42 inference(subsumption_resolution,[],[f1215,f1201])).
% 0.20/0.42 thf(f1201,plain,(
% 0.20/0.42 ( ! [X1 : nat] : (($true = (ord_less @ nat @ X1 @ (plus_plus @ nat @ one_one @ nat @ X1)))) )),
% 0.20/0.42 inference(equality_resolution,[],[f1162])).
% 0.20/0.42 thf(f1162,plain,(
% 0.20/0.42 ( ! [X0 : nat,X1 : nat] : (($true = (ord_less @ nat @ X0 @ (plus_plus @ nat @ one_one @ nat @ X1))) | (X0 != X1)) )),
% 0.20/0.42 inference(definition_unfolding,[],[f1090,f1040])).
% 0.20/0.42 thf(f1040,plain,(
% 0.20/0.42 (suc = (plus_plus @ nat @ one_one @ nat))),
% 0.20/0.42 inference(cnf_transformation,[],[f134])).
% 0.20/0.42 thf(f134,axiom,(
% 0.20/0.42 (suc = (plus_plus @ nat @ one_one @ nat))),
% 0.20/0.42 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_133_Suc__eq__plus1__left)).
% 0.20/0.42 thf(f1090,plain,(
% 0.20/0.42 ( ! [X0 : nat,X1 : nat] : (($true = (ord_less @ nat @ X0 @ (suc @ X1))) | (X0 != X1)) )),
% 0.20/0.42 inference(cnf_transformation,[],[f957])).
% 0.20/0.42 thf(f957,plain,(
% 0.20/0.42 ! [X0 : nat,X1 : nat] : (((X0 = X1) | ($true = (ord_less @ nat @ X0 @ X1)) | ($true != (ord_less @ nat @ X0 @ (suc @ X1)))) & (($true = (ord_less @ nat @ X0 @ (suc @ X1))) | ((X0 != X1) & ($true != (ord_less @ nat @ X0 @ X1)))))),
% 0.20/0.42 inference(flattening,[],[f956])).
% 0.20/0.42 thf(f956,plain,(
% 0.20/0.42 ! [X0 : nat,X1 : nat] : ((((X0 = X1) | ($true = (ord_less @ nat @ X0 @ X1))) | ($true != (ord_less @ nat @ X0 @ (suc @ X1)))) & (($true = (ord_less @ nat @ X0 @ (suc @ X1))) | ((X0 != X1) & ($true != (ord_less @ nat @ X0 @ X1)))))),
% 0.20/0.42 inference(nnf_transformation,[],[f549])).
% 0.20/0.42 thf(f549,plain,(
% 0.20/0.42 ! [X0 : nat,X1 : nat] : (((X0 = X1) | ($true = (ord_less @ nat @ X0 @ X1))) <=> ($true = (ord_less @ nat @ X0 @ (suc @ X1))))),
% 0.20/0.42 inference(fool_elimination,[],[f548])).
% 0.20/0.42 thf(f548,plain,(
% 0.20/0.42 ! [X0 : nat,X1 : nat] : ((X0 = X1) | (ord_less @ nat @ X0 @ X1) = (ord_less @ nat @ X0 @ (suc @ X1)))),
% 0.20/0.42 inference(rectify,[],[f74])).
% 0.20/0.42 thf(f74,axiom,(
% 0.20/0.42 ! [X3 : nat,X4 : nat] : ((X3 = X4) | (ord_less @ nat @ X3 @ X4) = (ord_less @ nat @ X3 @ (suc @ X4)))),
% 0.20/0.42 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_73_less__Suc__eq)).
% 0.20/0.42 thf(f1215,plain,(
% 0.20/0.42 ($true != (ord_less @ nat @ ma @ (plus_plus @ nat @ one_one @ nat @ ma)))),
% 0.20/0.42 inference(trivial_inequality_removal,[],[f1209])).
% 0.20/0.42 thf(f1209,plain,(
% 0.20/0.42 ($true != $true) | ($true != (ord_less @ nat @ ma @ (plus_plus @ nat @ one_one @ nat @ ma)))),
% 0.20/0.42 inference(superposition,[],[f1207,f1035])).
% 0.20/0.42 thf(f1035,plain,(
% 0.20/0.42 ( ! [X2 : nat,X0 : nat,X1 : nat] : (((ord_less @ nat @ X0 @ (plus_plus @ nat @ X2 @ X1)) = $true) | ($true != (ord_less @ nat @ X0 @ X1))) )),
% 0.20/0.42 inference(cnf_transformation,[],[f840])).
% 0.20/0.42 thf(f840,plain,(
% 0.20/0.42 ! [X0 : nat,X1 : nat,X2 : nat] : (($true != (ord_less @ nat @ X0 @ X1)) | ((ord_less @ nat @ X0 @ (plus_plus @ nat @ X2 @ X1)) = $true))),
% 0.20/0.42 inference(ennf_transformation,[],[f741])).
% 0.20/0.42 thf(f741,plain,(
% 0.20/0.42 ! [X0 : nat,X1 : nat,X2 : nat] : (($true = (ord_less @ nat @ X0 @ X1)) => ((ord_less @ nat @ X0 @ (plus_plus @ nat @ X2 @ X1)) = $true))),
% 0.20/0.42 inference(fool_elimination,[],[f740])).
% 0.20/0.42 thf(f740,plain,(
% 0.20/0.42 ! [X0 : nat,X1 : nat,X2 : nat] : ((ord_less @ nat @ X0 @ X1) => (ord_less @ nat @ X0 @ (plus_plus @ nat @ X2 @ X1)))),
% 0.20/0.42 inference(rectify,[],[f89])).
% 0.20/0.42 thf(f89,axiom,(
% 0.20/0.42 ! [X24 : nat,X25 : nat,X3 : nat] : ((ord_less @ nat @ X24 @ X25) => (ord_less @ nat @ X24 @ (plus_plus @ nat @ X3 @ X25)))),
% 0.20/0.42 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_88_trans__less__add2)).
% 0.20/0.42 thf(f1207,plain,(
% 0.20/0.42 ($true != (ord_less @ nat @ ma @ (plus_plus @ nat @ na @ (plus_plus @ nat @ one_one @ nat @ ma))))),
% 0.20/0.42 inference(trivial_inequality_removal,[],[f1204])).
% 0.20/0.42 thf(f1204,plain,(
% 0.20/0.42 ((coindu1079202755ist_of @ nat @ (upt @ ma @ (plus_plus @ nat @ na @ (plus_plus @ nat @ one_one @ nat @ ma)))) != (coindu1079202755ist_of @ nat @ (upt @ ma @ (plus_plus @ nat @ na @ (plus_plus @ nat @ one_one @ nat @ ma))))) | ($true != (ord_less @ nat @ ma @ (plus_plus @ nat @ na @ (plus_plus @ nat @ one_one @ nat @ ma))))),
% 0.20/0.42 inference(superposition,[],[f1202,f1159])).
% 0.20/0.42 thf(f1159,plain,(
% 0.20/0.42 ( ! [X0 : nat,X1 : nat] : (((cons @ nat @ X0 @ (upt @ (plus_plus @ nat @ one_one @ nat @ X0) @ X1)) = (upt @ X0 @ X1)) | ($true != (ord_less @ nat @ X0 @ X1))) )),
% 0.20/0.42 inference(definition_unfolding,[],[f1087,f1040])).
% 0.20/0.42 thf(f1087,plain,(
% 0.20/0.42 ( ! [X0 : nat,X1 : nat] : (((cons @ nat @ X0 @ (upt @ (suc @ X0) @ X1)) = (upt @ X0 @ X1)) | ($true != (ord_less @ nat @ X0 @ X1))) )),
% 0.20/0.42 inference(cnf_transformation,[],[f858])).
% 0.20/0.42 thf(f858,plain,(
% 0.20/0.42 ! [X0 : nat,X1 : nat] : (((cons @ nat @ X0 @ (upt @ (suc @ X0) @ X1)) = (upt @ X0 @ X1)) | ($true != (ord_less @ nat @ X0 @ X1)))),
% 0.20/0.42 inference(ennf_transformation,[],[f569])).
% 0.20/0.42 thf(f569,plain,(
% 0.20/0.42 ! [X0 : nat,X1 : nat] : (($true = (ord_less @ nat @ X0 @ X1)) => ((cons @ nat @ X0 @ (upt @ (suc @ X0) @ X1)) = (upt @ X0 @ X1)))),
% 0.20/0.42 inference(fool_elimination,[],[f568])).
% 0.20/0.42 thf(f568,plain,(
% 0.20/0.42 ! [X0 : nat,X1 : nat] : ((ord_less @ nat @ X0 @ X1) => ((cons @ nat @ X0 @ (upt @ (suc @ X0) @ X1)) = (upt @ X0 @ X1)))),
% 0.20/0.42 inference(rectify,[],[f30])).
% 0.20/0.42 thf(f30,axiom,(
% 0.20/0.42 ! [X24 : nat,X25 : nat] : ((ord_less @ nat @ X24 @ X25) => ((upt @ X24 @ X25) = (cons @ nat @ X24 @ (upt @ (suc @ X24) @ X25))))),
% 0.20/0.42 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_29_upt__conv__Cons)).
% 0.20/0.42 thf(f1202,plain,(
% 0.20/0.42 ((coindu1079202755ist_of @ nat @ (cons @ nat @ ma @ (upt @ (plus_plus @ nat @ one_one @ nat @ ma) @ (plus_plus @ nat @ na @ (plus_plus @ nat @ one_one @ nat @ ma))))) != (coindu1079202755ist_of @ nat @ (upt @ ma @ (plus_plus @ nat @ na @ (plus_plus @ nat @ one_one @ nat @ ma)))))),
% 0.20/0.42 inference(forward_demodulation,[],[f1144,f1136])).
% 0.20/0.42 thf(f1136,plain,(
% 0.20/0.42 ( ! [X0 : nat,X1 : nat] : (((plus_plus @ nat @ X0 @ (plus_plus @ nat @ one_one @ nat @ X1)) = (plus_plus @ nat @ (plus_plus @ nat @ one_one @ nat @ X0) @ X1))) )),
% 0.20/0.42 inference(definition_unfolding,[],[f1033,f1040,f1040])).
% 0.20/0.42 thf(f1033,plain,(
% 0.20/0.42 ( ! [X0 : nat,X1 : nat] : (((plus_plus @ nat @ X0 @ (suc @ X1)) = (plus_plus @ nat @ (suc @ X0) @ X1))) )),
% 0.20/0.42 inference(cnf_transformation,[],[f782])).
% 0.20/0.42 thf(f782,plain,(
% 0.20/0.42 ! [X0 : nat,X1 : nat] : ((plus_plus @ nat @ X0 @ (suc @ X1)) = (plus_plus @ nat @ (suc @ X0) @ X1))),
% 0.20/0.42 inference(rectify,[],[f9])).
% 0.20/0.42 thf(f9,axiom,(
% 0.20/0.42 ! [X3 : nat,X4 : nat] : ((plus_plus @ nat @ X3 @ (suc @ X4)) = (plus_plus @ nat @ (suc @ X3) @ X4))),
% 0.20/0.42 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_8_add__Suc__shift)).
% 0.20/0.42 thf(f1144,plain,(
% 0.20/0.42 ((coindu1079202755ist_of @ nat @ (cons @ nat @ ma @ (upt @ (plus_plus @ nat @ one_one @ nat @ ma) @ (plus_plus @ nat @ na @ (plus_plus @ nat @ one_one @ nat @ ma))))) != (coindu1079202755ist_of @ nat @ (upt @ ma @ (plus_plus @ nat @ (plus_plus @ nat @ one_one @ nat @ na) @ ma))))),
% 0.20/0.42 inference(definition_unfolding,[],[f1050,f1040,f1040,f1040])).
% 0.20/0.42 thf(f1050,plain,(
% 0.20/0.42 ((coindu1079202755ist_of @ nat @ (cons @ nat @ ma @ (upt @ (suc @ ma) @ (plus_plus @ nat @ na @ (suc @ ma))))) != (coindu1079202755ist_of @ nat @ (upt @ ma @ (plus_plus @ nat @ (suc @ na) @ ma))))),
% 0.20/0.42 inference(cnf_transformation,[],[f774])).
% 0.20/0.42 thf(f774,plain,(
% 0.20/0.42 ((coindu1079202755ist_of @ nat @ (cons @ nat @ ma @ (upt @ (suc @ ma) @ (plus_plus @ nat @ na @ (suc @ ma))))) != (coindu1079202755ist_of @ nat @ (upt @ ma @ (plus_plus @ nat @ (suc @ na) @ ma))))),
% 0.20/0.42 inference(flattening,[],[f292])).
% 0.20/0.42 thf(f292,negated_conjecture,(
% 0.20/0.42 ~((coindu1079202755ist_of @ nat @ (cons @ nat @ ma @ (upt @ (suc @ ma) @ (plus_plus @ nat @ na @ (suc @ ma))))) = (coindu1079202755ist_of @ nat @ (upt @ ma @ (plus_plus @ nat @ (suc @ na) @ ma))))),
% 0.20/0.42 inference(negated_conjecture,[],[f291])).
% 0.20/0.42 thf(f291,conjecture,(
% 0.20/0.42 ((coindu1079202755ist_of @ nat @ (cons @ nat @ ma @ (upt @ (suc @ ma) @ (plus_plus @ nat @ na @ (suc @ ma))))) = (coindu1079202755ist_of @ nat @ (upt @ ma @ (plus_plus @ nat @ (suc @ na) @ ma))))),
% 0.20/0.42 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',conj_0)).
% 0.20/0.42 % SZS output end Proof for theBenchmark
% 0.20/0.42 % (31241)------------------------------
% 0.20/0.42 % (31241)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.20/0.42 % (31241)Termination reason: Refutation
% 0.20/0.42
% 0.20/0.42 % (31241)Memory used [KB]: 6652
% 0.20/0.42 % (31241)Time elapsed: 0.031 s
% 0.20/0.42 % (31241)Instructions burned: 61 (million)
% 0.20/0.42 % (31241)------------------------------
% 0.20/0.42 % (31241)------------------------------
% 0.20/0.42 % (31235)Success in time 0.066 s
% 0.20/0.42 % Vampire---4.8 exiting
%------------------------------------------------------------------------------