TSTP Solution File: COM163^1 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : COM163^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 : n015.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:10:56 EDT 2024
% Result : Theorem 0.11s 0.37s
% Output : Refutation 0.11s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.10 % Problem : COM163^1 : TPTP v8.2.0. Released v7.0.0.
% 0.10/0.12 % 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.11/0.32 % Computer : n015.cluster.edu
% 0.11/0.32 % Model : x86_64 x86_64
% 0.11/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.32 % Memory : 8042.1875MB
% 0.11/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.32 % CPULimit : 300
% 0.11/0.32 % WCLimit : 300
% 0.11/0.32 % DateTime : Sun May 19 10:33:08 EDT 2024
% 0.11/0.32 % CPUTime :
% 0.11/0.32 This is a TH1_THM_EQU_NAR problem
% 0.11/0.32 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.11/0.35 % (29694)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.11/0.35 % (29695)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.11/0.35 % (29699)lrs+1004_1:128_cond=on:e2e=on:sp=weighted_frequency:i=18:si=on:rtra=on_0 on theBenchmark for (2999ds/18Mi)
% 0.11/0.35 % (29693)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.11/0.35 % (29700)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.11/0.35 % (29697)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.11/0.35 % (29698)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.11/0.35 % (29696)lrs+10_1:1_au=on:inj=on:i=2:si=on:rtra=on_0 on theBenchmark for (2999ds/2Mi)
% 0.11/0.35 % (29694)Instruction limit reached!
% 0.11/0.35 % (29694)------------------------------
% 0.11/0.35 % (29694)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.11/0.35 % (29694)Termination reason: Unknown
% 0.11/0.35 % (29694)Termination phase: shuffling
% 0.11/0.35
% 0.11/0.35 % (29694)Memory used [KB]: 1407
% 0.11/0.35 % (29694)Time elapsed: 0.003 s
% 0.11/0.35 % (29694)Instructions burned: 4 (million)
% 0.11/0.35 % (29694)------------------------------
% 0.11/0.35 % (29694)------------------------------
% 0.11/0.35 % (29696)Instruction limit reached!
% 0.11/0.35 % (29696)------------------------------
% 0.11/0.35 % (29696)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.11/0.35 % (29696)Termination reason: Unknown
% 0.11/0.35 % (29696)Termination phase: shuffling
% 0.11/0.35 % (29697)Instruction limit reached!
% 0.11/0.35 % (29697)------------------------------
% 0.11/0.35 % (29697)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.11/0.35
% 0.11/0.35 % (29696)Memory used [KB]: 1279
% 0.11/0.35 % (29696)Time elapsed: 0.002 s
% 0.11/0.35 % (29696)Instructions burned: 2 (million)
% 0.11/0.35 % (29696)------------------------------
% 0.11/0.35 % (29696)------------------------------
% 0.11/0.35 % (29697)Termination reason: Unknown
% 0.11/0.35 % (29697)Termination phase: shuffling
% 0.11/0.35
% 0.11/0.35 % (29697)Memory used [KB]: 1279
% 0.11/0.35 % (29697)Time elapsed: 0.003 s
% 0.11/0.35 % (29697)Instructions burned: 2 (million)
% 0.11/0.35 % (29697)------------------------------
% 0.11/0.35 % (29697)------------------------------
% 0.11/0.35 % (29700)Instruction limit reached!
% 0.11/0.35 % (29700)------------------------------
% 0.11/0.35 % (29700)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.11/0.35 % (29700)Termination reason: Unknown
% 0.11/0.35 % (29700)Termination phase: shuffling
% 0.11/0.35
% 0.11/0.35 % (29700)Memory used [KB]: 1407
% 0.11/0.35 % (29700)Time elapsed: 0.003 s
% 0.11/0.35 % (29700)Instructions burned: 3 (million)
% 0.11/0.35 % (29700)------------------------------
% 0.11/0.35 % (29700)------------------------------
% 0.11/0.36 % (29699)Instruction limit reached!
% 0.11/0.36 % (29699)------------------------------
% 0.11/0.36 % (29699)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.11/0.36 % (29699)Termination reason: Unknown
% 0.11/0.36 % (29699)Termination phase: Property scanning
% 0.11/0.36
% 0.11/0.36 % (29699)Memory used [KB]: 1791
% 0.11/0.36 % (29699)Time elapsed: 0.011 s
% 0.11/0.36 % (29699)Instructions burned: 19 (million)
% 0.11/0.36 % (29699)------------------------------
% 0.11/0.36 % (29699)------------------------------
% 0.11/0.37 % (29695)Instruction limit reached!
% 0.11/0.37 % (29695)------------------------------
% 0.11/0.37 % (29695)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.11/0.37 % (29695)Termination reason: Unknown
% 0.11/0.37 % (29695)Termination phase: Property scanning
% 0.11/0.37
% 0.11/0.37 % (29695)Memory used [KB]: 1791
% 0.11/0.37 % (29695)Time elapsed: 0.015 s
% 0.11/0.37 % (29695)Instructions burned: 28 (million)
% 0.11/0.37 % (29695)------------------------------
% 0.11/0.37 % (29695)------------------------------
% 0.11/0.37 % (29702)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.11/0.37 % (29701)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.11/0.37 % (29704)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.11/0.37 % (29703)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.11/0.37 % (29698)First to succeed.
% 0.11/0.37 % (29703)Instruction limit reached!
% 0.11/0.37 % (29703)------------------------------
% 0.11/0.37 % (29703)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.11/0.37 % (29703)Termination reason: Unknown
% 0.11/0.37 % (29703)Termination phase: shuffling
% 0.11/0.37
% 0.11/0.37 % (29703)Memory used [KB]: 1279
% 0.11/0.37 % (29703)Time elapsed: 0.003 s
% 0.11/0.37 % (29703)Instructions burned: 3 (million)
% 0.11/0.37 % (29703)------------------------------
% 0.11/0.37 % (29703)------------------------------
% 0.11/0.37 % (29698)Refutation found. Thanks to Tanya!
% 0.11/0.37 % SZS status Theorem for theBenchmark
% 0.11/0.37 % SZS output start Proof for theBenchmark
% 0.11/0.37 thf(type_def_5, type, itself: ($tType) > $tType).
% 0.11/0.37 thf(type_def_7, type, binDag_Mirabelle_dag: $tType).
% 0.11/0.37 thf(type_def_8, type, simpl_ref: $tType).
% 0.11/0.37 thf(type_def_9, type, nat: $tType).
% 0.11/0.37 thf(type_def_10, type, set: ($tType) > $tType).
% 0.11/0.37 thf(func_def_0, type, binDag_Mirabelle_dag: $tType).
% 0.11/0.37 thf(func_def_1, type, simpl_ref: $tType).
% 0.11/0.37 thf(func_def_2, type, set: ($tType) > $tType).
% 0.11/0.37 thf(func_def_3, type, nat: $tType).
% 0.11/0.37 thf(func_def_4, type, itself: ($tType) > $tType).
% 0.11/0.37 thf(func_def_5, type, type: !>[X0: $tType]:(itself @ X0 > $o)).
% 0.11/0.37 thf(func_def_6, type, field: !>[X0: $tType]:(itself @ X0 > $o)).
% 0.11/0.37 thf(func_def_7, type, ord: !>[X0: $tType]:(itself @ X0 > $o)).
% 0.11/0.37 thf(func_def_8, type, order: !>[X0: $tType]:(itself @ X0 > $o)).
% 0.11/0.37 thf(func_def_9, type, no_bot: !>[X0: $tType]:(itself @ X0 > $o)).
% 0.11/0.37 thf(func_def_10, type, no_top: !>[X0: $tType]:(itself @ X0 > $o)).
% 0.11/0.37 thf(func_def_11, type, linorder: !>[X0: $tType]:(itself @ X0 > $o)).
% 0.11/0.37 thf(func_def_12, type, preorder: !>[X0: $tType]:(itself @ X0 > $o)).
% 0.11/0.37 thf(func_def_13, type, zero_neq_one: !>[X0: $tType]:(itself @ X0 > $o)).
% 0.11/0.37 thf(func_def_14, type, wellorder: !>[X0: $tType]:(itself @ X0 > $o)).
% 0.11/0.37 thf(func_def_15, type, zero_less_one: !>[X0: $tType]:(itself @ X0 > $o)).
% 0.11/0.37 thf(func_def_16, type, division_ring: !>[X0: $tType]:(itself @ X0 > $o)).
% 0.11/0.37 thf(func_def_17, type, semidom_divide: !>[X0: $tType]:(itself @ X0 > $o)).
% 0.11/0.37 thf(func_def_18, type, dense_order: !>[X0: $tType]:(itself @ X0 > $o)).
% 0.11/0.37 thf(func_def_19, type, linordered_idom: !>[X0: $tType]:(itself @ X0 > $o)).
% 0.11/0.37 thf(func_def_20, type, linordered_field: !>[X0: $tType]:(itself @ X0 > $o)).
% 0.11/0.37 thf(func_def_21, type, dense_linorder: !>[X0: $tType]:(itself @ X0 > $o)).
% 0.11/0.37 thf(func_def_22, type, linordered_semidom: !>[X0: $tType]:(itself @ X0 > $o)).
% 0.11/0.37 thf(func_def_23, type, ordered_ab_group_add: !>[X0: $tType]:(itself @ X0 > $o)).
% 0.11/0.37 thf(func_def_24, type, linord219039673up_add: !>[X0: $tType]:(itself @ X0 > $o)).
% 0.11/0.37 thf(func_def_25, type, linord1659791738miring: !>[X0: $tType]:(itself @ X0 > $o)).
% 0.11/0.37 thf(func_def_26, type, canoni770627133id_add: !>[X0: $tType]:(itself @ X0 > $o)).
% 0.11/0.37 thf(func_def_27, type, condit1656338222tinuum: !>[X0: $tType]:(itself @ X0 > $o)).
% 0.11/0.37 thf(func_def_28, type, condit1037483654norder: !>[X0: $tType]:(itself @ X0 > $o)).
% 0.11/0.37 thf(func_def_29, type, binDag_Mirabelle_DAG: binDag_Mirabelle_dag > $o).
% 0.11/0.37 thf(func_def_30, type, binDag476092410e_Node: binDag_Mirabelle_dag > simpl_ref > binDag_Mirabelle_dag > binDag_Mirabelle_dag).
% 0.11/0.37 thf(func_def_31, type, binDag_Mirabelle_Tip: binDag_Mirabelle_dag).
% 0.11/0.37 thf(func_def_32, type, binDag1297733282se_dag: !>[X0: $tType]:(X0 > (binDag_Mirabelle_dag > simpl_ref > binDag_Mirabelle_dag > X0) > binDag_Mirabelle_dag > X0)).
% 0.11/0.37 thf(func_def_33, type, binDag1442713106ec_dag: !>[X0: $tType]:(X0 > (binDag_Mirabelle_dag > simpl_ref > binDag_Mirabelle_dag > X0 > X0 > X0) > binDag_Mirabelle_dag > X0)).
% 0.11/0.37 thf(func_def_34, type, binDag1924123185ze_dag: binDag_Mirabelle_dag > nat).
% 0.11/0.37 thf(func_def_35, type, binDag1380252983set_of: binDag_Mirabelle_dag > set @ simpl_ref).
% 0.11/0.37 thf(func_def_36, type, binDag786255756subdag: binDag_Mirabelle_dag > binDag_Mirabelle_dag > $o).
% 0.11/0.37 thf(func_def_37, type, one_one: !>[X0: $tType]:(X0)).
% 0.11/0.37 thf(func_def_38, type, sgn_sgn: !>[X0: $tType]:(X0 > X0)).
% 0.11/0.37 thf(func_def_39, type, uminus_uminus: !>[X0: $tType]:(X0 > X0)).
% 0.11/0.37 thf(func_def_40, type, zero_zero: !>[X0: $tType]:(X0)).
% 0.11/0.37 thf(func_def_41, type, if: !>[X0: $tType]:($o > X0 > X0 > X0)).
% 0.11/0.37 thf(func_def_42, type, size_size: !>[X0: $tType]:(X0 > nat)).
% 0.11/0.37 thf(func_def_43, type, ord_Least: !>[X0: $tType]:((X0 > $o) > X0)).
% 0.11/0.37 thf(func_def_44, type, ord_less: !>[X0: $tType]:(X0 > X0 > $o)).
% 0.11/0.37 thf(func_def_45, type, ord_less_eq: !>[X0: $tType]:(X0 > X0 > $o)).
% 0.11/0.37 thf(func_def_46, type, order_antimono: !>[X0: $tType, X1: $tType]:((X0 > X1) > $o)).
% 0.11/0.37 thf(func_def_47, type, order_strict_mono: !>[X0: $tType, X1: $tType]:((X0 > X1) > $o)).
% 0.11/0.37 thf(func_def_48, type, ordering: !>[X0: $tType]:((X0 > X0 > $o) > (X0 > X0 > $o) > $o)).
% 0.11/0.37 thf(func_def_49, type, type2: !>[X0: $tType]:(itself @ X0)).
% 0.11/0.37 thf(func_def_50, type, divide_divide: !>[X0: $tType]:(X0 > X0 > X0)).
% 0.11/0.37 thf(func_def_51, type, zero_neq_one_of_bool: !>[X0: $tType]:($o > X0)).
% 0.11/0.37 thf(func_def_52, type, collect: !>[X0: $tType]:((X0 > $o) > set @ X0)).
% 0.11/0.37 thf(func_def_53, type, member: !>[X0: $tType]:(X0 > set @ X0 > $o)).
% 0.11/0.37 thf(func_def_54, type, x: binDag_Mirabelle_dag).
% 0.11/0.37 thf(func_def_55, type, y: binDag_Mirabelle_dag).
% 0.11/0.37 thf(func_def_56, type, z: binDag_Mirabelle_dag).
% 0.11/0.37 thf(func_def_72, type, sK0: !>[X0: $tType, X1: $tType]:((X1 > X0) > (X1 > X0) > X1)).
% 0.11/0.37 thf(f845,plain,(
% 0.11/0.37 $false),
% 0.11/0.37 inference(subsumption_resolution,[],[f843,f837])).
% 0.11/0.37 thf(f837,plain,(
% 0.11/0.37 ((ord_less_eq @ binDag_Mirabelle_dag @ y @ z) = $true)),
% 0.11/0.37 inference(cnf_transformation,[],[f657])).
% 0.11/0.37 thf(f657,plain,(
% 0.11/0.37 ((ord_less_eq @ binDag_Mirabelle_dag @ y @ z) = $true)),
% 0.11/0.37 inference(fool_elimination,[],[f656])).
% 0.11/0.37 thf(f656,plain,(
% 0.11/0.37 (ord_less_eq @ binDag_Mirabelle_dag @ y @ z)),
% 0.11/0.37 inference(rectify,[],[f2])).
% 0.11/0.37 thf(f2,axiom,(
% 0.11/0.37 (ord_less_eq @ binDag_Mirabelle_dag @ y @ z)),
% 0.11/0.37 file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_1_y__z)).
% 0.11/0.37 thf(f843,plain,(
% 0.11/0.37 ((ord_less_eq @ binDag_Mirabelle_dag @ y @ z) != $true)),
% 0.11/0.37 inference(definition_unfolding,[],[f838,f840])).
% 0.11/0.37 thf(f840,plain,(
% 0.11/0.37 (x = y)),
% 0.11/0.37 inference(cnf_transformation,[],[f1])).
% 0.11/0.37 thf(f1,axiom,(
% 0.11/0.37 (x = y)),
% 0.11/0.37 file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_0_True)).
% 0.11/0.37 thf(f838,plain,(
% 0.11/0.37 ((ord_less_eq @ binDag_Mirabelle_dag @ x @ z) != $true)),
% 0.11/0.37 inference(cnf_transformation,[],[f828])).
% 0.11/0.37 thf(f828,plain,(
% 0.11/0.37 ((ord_less_eq @ binDag_Mirabelle_dag @ x @ z) != $true)),
% 0.11/0.37 inference(flattening,[],[f531])).
% 0.11/0.37 thf(f531,plain,(
% 0.11/0.37 ~((ord_less_eq @ binDag_Mirabelle_dag @ x @ z) = $true)),
% 0.11/0.37 inference(fool_elimination,[],[f530])).
% 0.11/0.37 thf(f530,plain,(
% 0.11/0.37 ~(ord_less_eq @ binDag_Mirabelle_dag @ x @ z)),
% 0.11/0.37 inference(rectify,[],[f284])).
% 0.11/0.37 thf(f284,negated_conjecture,(
% 0.11/0.37 ~(ord_less_eq @ binDag_Mirabelle_dag @ x @ z)),
% 0.11/0.37 inference(negated_conjecture,[],[f283])).
% 0.11/0.37 thf(f283,conjecture,(
% 0.11/0.37 (ord_less_eq @ binDag_Mirabelle_dag @ x @ z)),
% 0.11/0.37 file('/export/starexec/sandbox/benchmark/theBenchmark.p',conj_0)).
% 0.11/0.37 % SZS output end Proof for theBenchmark
% 0.11/0.37 % (29698)------------------------------
% 0.11/0.37 % (29698)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.11/0.37 % (29698)Termination reason: Refutation
% 0.11/0.37
% 0.11/0.37 % (29698)Memory used [KB]: 6268
% 0.11/0.37 % (29698)Time elapsed: 0.018 s
% 0.11/0.37 % (29698)Instructions burned: 30 (million)
% 0.11/0.37 % (29698)------------------------------
% 0.11/0.37 % (29698)------------------------------
% 0.11/0.37 % (29692)Success in time 0.031 s
% 0.11/0.37 % Vampire---4.8 exiting
%------------------------------------------------------------------------------