TSTP Solution File: ITP010^2 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : ITP010^2 : TPTP v8.2.0. Bugfixed 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 : n023.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:30:32 EDT 2024
% Result : Theorem 0.14s 0.37s
% Output : Refutation 0.14s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : ITP010^2 : TPTP v8.2.0. Bugfixed v7.5.0.
% 0.06/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.33 % Computer : n023.cluster.edu
% 0.14/0.33 % Model : x86_64 x86_64
% 0.14/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.33 % Memory : 8042.1875MB
% 0.14/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.33 % CPULimit : 300
% 0.14/0.33 % WCLimit : 300
% 0.14/0.33 % DateTime : Sat May 18 17:11:38 EDT 2024
% 0.14/0.33 % CPUTime :
% 0.14/0.33 This is a TH0_THM_EQU_NAR problem
% 0.14/0.34 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.14/0.35 % (5892)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.14/0.36 % (5891)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.14/0.36 % (5893)lrs+10_1:1_au=on:inj=on:i=2:si=on:rtra=on_0 on theBenchmark for (2999ds/2Mi)
% 0.14/0.36 % (5890)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.14/0.36 % (5895)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.14/0.36 % (5893)Instruction limit reached!
% 0.14/0.36 % (5893)------------------------------
% 0.14/0.36 % (5893)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.14/0.36 % (5893)Termination reason: Unknown
% 0.14/0.36 % (5893)Termination phase: shuffling
% 0.14/0.36
% 0.14/0.36 % (5893)Memory used [KB]: 1023
% 0.14/0.36 % (5897)lrs+1004_1:128_cond=on:e2e=on:sp=weighted_frequency:i=18:si=on:rtra=on_0 on theBenchmark for (2999ds/18Mi)
% 0.14/0.36 % (5893)Time elapsed: 0.003 s
% 0.14/0.36 % (5893)Instructions burned: 2 (million)
% 0.14/0.36 % (5893)------------------------------
% 0.14/0.36 % (5893)------------------------------
% 0.14/0.36 % (5892)Instruction limit reached!
% 0.14/0.36 % (5892)------------------------------
% 0.14/0.36 % (5892)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.14/0.36 % (5892)Termination reason: Unknown
% 0.14/0.36 % (5892)Termination phase: Saturation
% 0.14/0.36
% 0.14/0.36 % (5892)Memory used [KB]: 5628
% 0.14/0.36 % (5892)Time elapsed: 0.009 s
% 0.14/0.36 % (5892)Instructions burned: 29 (million)
% 0.14/0.36 % (5892)------------------------------
% 0.14/0.36 % (5892)------------------------------
% 0.14/0.36 % (5898)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.14/0.36 % (5891)Instruction limit reached!
% 0.14/0.36 % (5891)------------------------------
% 0.14/0.36 % (5891)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.14/0.36 % (5891)Termination reason: Unknown
% 0.14/0.36 % (5891)Termination phase: shuffling
% 0.14/0.36
% 0.14/0.36 % (5891)Memory used [KB]: 1023
% 0.14/0.36 % (5891)Time elapsed: 0.004 s
% 0.14/0.36 % (5891)Instructions burned: 5 (million)
% 0.14/0.36 % (5891)------------------------------
% 0.14/0.36 % (5891)------------------------------
% 0.14/0.36 % (5898)Instruction limit reached!
% 0.14/0.36 % (5898)------------------------------
% 0.14/0.36 % (5898)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.14/0.36 % (5898)Termination reason: Unknown
% 0.14/0.36 % (5898)Termination phase: shuffling
% 0.14/0.36
% 0.14/0.36 % (5898)Memory used [KB]: 1023
% 0.14/0.36 % (5898)Time elapsed: 0.004 s
% 0.14/0.36 % (5898)Instructions burned: 4 (million)
% 0.14/0.36 % (5898)------------------------------
% 0.14/0.36 % (5898)------------------------------
% 0.14/0.37 % (5894)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.14/0.37 % (5894)Instruction limit reached!
% 0.14/0.37 % (5894)------------------------------
% 0.14/0.37 % (5894)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.14/0.37 % (5894)Termination reason: Unknown
% 0.14/0.37 % (5894)Termination phase: shuffling
% 0.14/0.37
% 0.14/0.37 % (5894)Memory used [KB]: 1023
% 0.14/0.37 % (5894)Time elapsed: 0.004 s
% 0.14/0.37 % (5894)Instructions burned: 3 (million)
% 0.14/0.37 % (5894)------------------------------
% 0.14/0.37 % (5894)------------------------------
% 0.14/0.37 % (5895)First to succeed.
% 0.14/0.37 % (5901)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.14/0.37 % (5897)Instruction limit reached!
% 0.14/0.37 % (5897)------------------------------
% 0.14/0.37 % (5897)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.14/0.37 % (5897)Termination reason: Unknown
% 0.14/0.37 % (5897)Termination phase: Saturation
% 0.14/0.37
% 0.14/0.37 % (5897)Memory used [KB]: 5628
% 0.14/0.37 % (5897)Time elapsed: 0.012 s
% 0.14/0.37 % (5897)Instructions burned: 18 (million)
% 0.14/0.37 % (5897)------------------------------
% 0.14/0.37 % (5897)------------------------------
% 0.14/0.37 % (5895)Refutation found. Thanks to Tanya!
% 0.14/0.37 % SZS status Theorem for theBenchmark
% 0.14/0.37 % SZS output start Proof for theBenchmark
% 0.14/0.37 thf(type_def_5, type, del: $tType).
% 0.14/0.37 thf(func_def_0, type, del: $tType).
% 0.14/0.37 thf(func_def_1, type, bool: del).
% 0.14/0.37 thf(func_def_2, type, ind: del).
% 0.14/0.37 thf(func_def_3, type, arr: del > del > del).
% 0.14/0.37 thf(func_def_4, type, mem: $i > del > $o).
% 0.14/0.37 thf(func_def_5, type, ap: $i > $i > $i).
% 0.14/0.37 thf(func_def_6, type, lam: del > ($i > $i) > $i).
% 0.14/0.37 thf(func_def_7, type, p: $i > $o).
% 0.14/0.37 thf(func_def_8, type, inj__o: $o > $i).
% 0.14/0.37 thf(func_def_11, type, c_2Ecardinal_2Ecardleq: del > del > $i).
% 0.14/0.37 thf(func_def_17, type, c_2Emin_2E_3D: del > $i).
% 0.14/0.37 thf(func_def_18, type, c_2Ebool_2E_21: del > $i).
% 0.14/0.37 thf(func_def_21, type, sP0: $i > $i > $o).
% 0.14/0.37 thf(func_def_22, type, sP1: $i > $i > $o).
% 0.14/0.37 thf(func_def_23, type, sP2: $i > $i > $i > $o).
% 0.14/0.37 thf(func_def_24, type, sP3: $i > $i > $i > $o).
% 0.14/0.37 thf(func_def_25, type, sP4: $i > $i > $i > $o).
% 0.14/0.37 thf(func_def_26, type, sP5: $i > $i > $i > $o).
% 0.14/0.37 thf(func_def_27, type, sP6: $i > $i > $i > $o).
% 0.14/0.37 thf(func_def_28, type, sK7: $i > $i > del > $i).
% 0.14/0.37 thf(func_def_30, type, sK9: del).
% 0.14/0.37 thf(func_def_31, type, sK10: del).
% 0.14/0.37 thf(func_def_33, type, sK12: $i > del > $i).
% 0.14/0.37 thf(f288,plain,(
% 0.14/0.37 $false),
% 0.14/0.37 inference(subsumption_resolution,[],[f286,f287])).
% 0.14/0.37 thf(f287,plain,(
% 0.14/0.37 ((p @ (ap @ (ap @ (c_2Ecardinal_2Ecardleq @ sK9 @ sK10) @ sK8) @ sK11)) = $true)),
% 0.14/0.37 inference(duplicate_literal_removal,[],[f264])).
% 0.14/0.37 thf(f264,plain,(
% 0.14/0.37 ((p @ (ap @ (ap @ (c_2Ecardinal_2Ecardleq @ sK9 @ sK10) @ sK8) @ sK11)) = $true) | ((p @ (ap @ (ap @ (c_2Ecardinal_2Ecardleq @ sK9 @ sK10) @ sK8) @ sK11)) = $true)),
% 0.14/0.37 inference(cnf_transformation,[],[f199])).
% 0.14/0.37 thf(f199,plain,(
% 0.14/0.37 ($true = (mem @ sK8 @ (arr @ sK9 @ bool))) & ((((p @ (ap @ (ap @ (c_2Ecardinal_2Ecardleq @ sK9 @ sK10) @ sK8) @ sK11)) = $true) | ((p @ (ap @ (ap @ (c_2Ecardinal_2Ecardleq @ sK9 @ sK10) @ sK8) @ sK11)) = $true)) & (((p @ (ap @ (ap @ (c_2Ecardinal_2Ecardleq @ sK9 @ sK10) @ sK8) @ sK11)) != $true) | ((p @ (ap @ (ap @ (c_2Ecardinal_2Ecardleq @ sK9 @ sK10) @ sK8) @ sK11)) != $true)) & ((mem @ sK11 @ (arr @ sK10 @ bool)) = $true))),
% 0.14/0.37 inference(skolemisation,[status(esa),new_symbols(skolem,[sK8,sK9,sK10,sK11])],[f196,f198,f197])).
% 0.14/0.37 thf(f197,plain,(
% 0.14/0.37 ? [X0,X1 : del,X2 : del] : (($true = (mem @ X0 @ (arr @ X1 @ bool))) & ? [X3] : ((((p @ (ap @ (ap @ (c_2Ecardinal_2Ecardleq @ X1 @ X2) @ X0) @ X3)) = $true) | ((p @ (ap @ (ap @ (c_2Ecardinal_2Ecardleq @ X1 @ X2) @ X0) @ X3)) = $true)) & (((p @ (ap @ (ap @ (c_2Ecardinal_2Ecardleq @ X1 @ X2) @ X0) @ X3)) != $true) | ((p @ (ap @ (ap @ (c_2Ecardinal_2Ecardleq @ X1 @ X2) @ X0) @ X3)) != $true)) & ($true = (mem @ X3 @ (arr @ X2 @ bool))))) => (($true = (mem @ sK8 @ (arr @ sK9 @ bool))) & ? [X3] : ((($true = (p @ (ap @ (ap @ (c_2Ecardinal_2Ecardleq @ sK9 @ sK10) @ sK8) @ X3))) | ($true = (p @ (ap @ (ap @ (c_2Ecardinal_2Ecardleq @ sK9 @ sK10) @ sK8) @ X3)))) & (($true != (p @ (ap @ (ap @ (c_2Ecardinal_2Ecardleq @ sK9 @ sK10) @ sK8) @ X3))) | ($true != (p @ (ap @ (ap @ (c_2Ecardinal_2Ecardleq @ sK9 @ sK10) @ sK8) @ X3)))) & ($true = (mem @ X3 @ (arr @ sK10 @ bool)))))),
% 0.14/0.37 introduced(choice_axiom,[])).
% 0.14/0.37 thf(f198,plain,(
% 0.14/0.37 ? [X3] : ((($true = (p @ (ap @ (ap @ (c_2Ecardinal_2Ecardleq @ sK9 @ sK10) @ sK8) @ X3))) | ($true = (p @ (ap @ (ap @ (c_2Ecardinal_2Ecardleq @ sK9 @ sK10) @ sK8) @ X3)))) & (($true != (p @ (ap @ (ap @ (c_2Ecardinal_2Ecardleq @ sK9 @ sK10) @ sK8) @ X3))) | ($true != (p @ (ap @ (ap @ (c_2Ecardinal_2Ecardleq @ sK9 @ sK10) @ sK8) @ X3)))) & ($true = (mem @ X3 @ (arr @ sK10 @ bool)))) => ((((p @ (ap @ (ap @ (c_2Ecardinal_2Ecardleq @ sK9 @ sK10) @ sK8) @ sK11)) = $true) | ((p @ (ap @ (ap @ (c_2Ecardinal_2Ecardleq @ sK9 @ sK10) @ sK8) @ sK11)) = $true)) & (((p @ (ap @ (ap @ (c_2Ecardinal_2Ecardleq @ sK9 @ sK10) @ sK8) @ sK11)) != $true) | ((p @ (ap @ (ap @ (c_2Ecardinal_2Ecardleq @ sK9 @ sK10) @ sK8) @ sK11)) != $true)) & ((mem @ sK11 @ (arr @ sK10 @ bool)) = $true))),
% 0.14/0.37 introduced(choice_axiom,[])).
% 0.14/0.37 thf(f196,plain,(
% 0.14/0.37 ? [X0,X1 : del,X2 : del] : (($true = (mem @ X0 @ (arr @ X1 @ bool))) & ? [X3] : ((((p @ (ap @ (ap @ (c_2Ecardinal_2Ecardleq @ X1 @ X2) @ X0) @ X3)) = $true) | ((p @ (ap @ (ap @ (c_2Ecardinal_2Ecardleq @ X1 @ X2) @ X0) @ X3)) = $true)) & (((p @ (ap @ (ap @ (c_2Ecardinal_2Ecardleq @ X1 @ X2) @ X0) @ X3)) != $true) | ((p @ (ap @ (ap @ (c_2Ecardinal_2Ecardleq @ X1 @ X2) @ X0) @ X3)) != $true)) & ($true = (mem @ X3 @ (arr @ X2 @ bool)))))),
% 0.14/0.37 inference(rectify,[],[f195])).
% 0.14/0.37 thf(f195,plain,(
% 0.14/0.37 ? [X1,X2 : del,X0 : del] : (((mem @ X1 @ (arr @ X2 @ bool)) = $true) & ? [X3] : ((($true = (p @ (ap @ (ap @ (c_2Ecardinal_2Ecardleq @ X2 @ X0) @ X1) @ X3))) | ($true = (p @ (ap @ (ap @ (c_2Ecardinal_2Ecardleq @ X2 @ X0) @ X1) @ X3)))) & (($true != (p @ (ap @ (ap @ (c_2Ecardinal_2Ecardleq @ X2 @ X0) @ X1) @ X3))) | ($true != (p @ (ap @ (ap @ (c_2Ecardinal_2Ecardleq @ X2 @ X0) @ X1) @ X3)))) & ((mem @ X3 @ (arr @ X0 @ bool)) = $true)))),
% 0.14/0.37 inference(flattening,[],[f194])).
% 0.14/0.37 thf(f194,plain,(
% 0.14/0.37 ? [X1,X2 : del,X0 : del] : (((mem @ X1 @ (arr @ X2 @ bool)) = $true) & ? [X3] : (((($true = (p @ (ap @ (ap @ (c_2Ecardinal_2Ecardleq @ X2 @ X0) @ X1) @ X3))) | ($true = (p @ (ap @ (ap @ (c_2Ecardinal_2Ecardleq @ X2 @ X0) @ X1) @ X3)))) & (($true != (p @ (ap @ (ap @ (c_2Ecardinal_2Ecardleq @ X2 @ X0) @ X1) @ X3))) | ($true != (p @ (ap @ (ap @ (c_2Ecardinal_2Ecardleq @ X2 @ X0) @ X1) @ X3))))) & ((mem @ X3 @ (arr @ X0 @ bool)) = $true)))),
% 0.14/0.37 inference(nnf_transformation,[],[f139])).
% 0.14/0.37 thf(f139,plain,(
% 0.14/0.37 ? [X1,X2 : del,X0 : del] : (((mem @ X1 @ (arr @ X2 @ bool)) = $true) & ? [X3] : ((($true != (p @ (ap @ (ap @ (c_2Ecardinal_2Ecardleq @ X2 @ X0) @ X1) @ X3))) <~> ($true != (p @ (ap @ (ap @ (c_2Ecardinal_2Ecardleq @ X2 @ X0) @ X1) @ X3)))) & ((mem @ X3 @ (arr @ X0 @ bool)) = $true)))),
% 0.14/0.37 inference(ennf_transformation,[],[f119])).
% 0.14/0.37 thf(f119,plain,(
% 0.14/0.37 ~! [X2 : del,X0 : del,X1] : (((mem @ X1 @ (arr @ X2 @ bool)) = $true) => ! [X3] : (((mem @ X3 @ (arr @ X0 @ bool)) = $true) => (($true != (p @ (ap @ (ap @ (c_2Ecardinal_2Ecardleq @ X2 @ X0) @ X1) @ X3))) <=> ($true != (p @ (ap @ (ap @ (c_2Ecardinal_2Ecardleq @ X2 @ X0) @ X1) @ X3))))))),
% 0.14/0.37 inference(flattening,[],[f82])).
% 0.14/0.37 thf(f82,plain,(
% 0.14/0.37 ~! [X0 : del,X1,X2 : del] : (((mem @ X1 @ (arr @ X2 @ bool)) = $true) => ! [X3] : (((mem @ X3 @ (arr @ X0 @ bool)) = $true) => (~($true = (p @ (ap @ (ap @ (c_2Ecardinal_2Ecardleq @ X2 @ X0) @ X1) @ X3))) <=> ~($true = (p @ (ap @ (ap @ (c_2Ecardinal_2Ecardleq @ X2 @ X0) @ X1) @ X3))))))),
% 0.14/0.37 inference(fool_elimination,[],[f81])).
% 0.14/0.37 thf(f81,plain,(
% 0.14/0.37 ~! [X0 : del,X1,X2 : del] : ((mem @ X1 @ (arr @ X2 @ bool)) => ! [X3] : ((mem @ X3 @ (arr @ X0 @ bool)) => (~(p @ (ap @ (ap @ (c_2Ecardinal_2Ecardleq @ X2 @ X0) @ X1) @ X3)) <=> ~(p @ (ap @ (ap @ (c_2Ecardinal_2Ecardleq @ X2 @ X0) @ X1) @ X3)))))),
% 0.14/0.37 inference(rectify,[],[f41])).
% 0.14/0.37 thf(f41,negated_conjecture,(
% 0.14/0.37 ~! [X6 : del,X13,X5 : del] : ((mem @ X13 @ (arr @ X5 @ bool)) => ! [X14] : ((mem @ X14 @ (arr @ X6 @ bool)) => (~(p @ (ap @ (ap @ (c_2Ecardinal_2Ecardleq @ X5 @ X6) @ X13) @ X14)) <=> ~(p @ (ap @ (ap @ (c_2Ecardinal_2Ecardleq @ X5 @ X6) @ X13) @ X14)))))),
% 0.14/0.37 inference(negated_conjecture,[],[f40])).
% 0.14/0.37 thf(f40,conjecture,(
% 0.14/0.37 ! [X6 : del,X13,X5 : del] : ((mem @ X13 @ (arr @ X5 @ bool)) => ! [X14] : ((mem @ X14 @ (arr @ X6 @ bool)) => (~(p @ (ap @ (ap @ (c_2Ecardinal_2Ecardleq @ X5 @ X6) @ X13) @ X14)) <=> ~(p @ (ap @ (ap @ (c_2Ecardinal_2Ecardleq @ X5 @ X6) @ X13) @ X14)))))),
% 0.14/0.37 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',conj_thm_2Ecardinal_2ECARD__NOT__LE)).
% 0.14/0.37 thf(f286,plain,(
% 0.14/0.37 ((p @ (ap @ (ap @ (c_2Ecardinal_2Ecardleq @ sK9 @ sK10) @ sK8) @ sK11)) != $true)),
% 0.14/0.37 inference(duplicate_literal_removal,[],[f263])).
% 0.14/0.37 thf(f263,plain,(
% 0.14/0.37 ((p @ (ap @ (ap @ (c_2Ecardinal_2Ecardleq @ sK9 @ sK10) @ sK8) @ sK11)) != $true) | ((p @ (ap @ (ap @ (c_2Ecardinal_2Ecardleq @ sK9 @ sK10) @ sK8) @ sK11)) != $true)),
% 0.14/0.37 inference(cnf_transformation,[],[f199])).
% 0.14/0.37 % SZS output end Proof for theBenchmark
% 0.14/0.37 % (5895)------------------------------
% 0.14/0.37 % (5895)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.14/0.37 % (5895)Termination reason: Refutation
% 0.14/0.37
% 0.14/0.37 % (5895)Memory used [KB]: 5756
% 0.14/0.37 % (5895)Time elapsed: 0.011 s
% 0.14/0.37 % (5895)Instructions burned: 13 (million)
% 0.14/0.37 % (5895)------------------------------
% 0.14/0.37 % (5895)------------------------------
% 0.14/0.37 % (5884)Success in time 0.014 s
% 0.14/0.37 % Vampire---4.8 exiting
%------------------------------------------------------------------------------