TSTP Solution File: ITP010^2 by Vampire---4.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.9
% Problem : ITP010^2 : TPTP v8.2.0. Bugfixed v7.5.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire %s %d THM
% Computer : n006.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 Jun 24 09:33:13 EDT 2024
% Result : Theorem 0.13s 0.40s
% Output : Refutation 0.13s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12 % Problem : ITP010^2 : TPTP v8.2.0. Bugfixed v7.5.0.
% 0.10/0.12 % Command : run_vampire %s %d THM
% 0.13/0.33 % Computer : n006.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % WCLimit : 300
% 0.13/0.33 % DateTime : Wed Jun 19 00:44:39 EDT 2024
% 0.13/0.34 % CPUTime :
% 0.13/0.36 This is a TH0_THM_EQU_NAR problem
% 0.13/0.36 Running higher-order theorem proving
% 0.13/0.36 Running /export/starexec/sandbox/solver/bin/vampire_ho --cores 7 --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_hol /export/starexec/sandbox/benchmark/theBenchmark.p -m 16384 -t 300
% 0.13/0.39 % (27082)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.13/0.39 % (27079)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.13/0.39 % (27081)lrs+10_1:1_au=on:inj=on:i=2:si=on:rtra=on_0 on theBenchmark for (2999ds/2Mi)
% 0.13/0.39 % (27078)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.13/0.39 % (27081)Instruction limit reached!
% 0.13/0.39 % (27081)------------------------------
% 0.13/0.39 % (27081)Version: Vampire 4.8 (commit 11aac991b on 2023-10-04 16:26:07 +0200)
% 0.13/0.39 % (27081)Termination reason: Unknown
% 0.13/0.39 % (27081)Termination phase: shuffling
% 0.13/0.39
% 0.13/0.39 % (27081)Memory used [KB]: 1023
% 0.13/0.39 % (27081)Time elapsed: 0.003 s
% 0.13/0.39 % (27082)Instruction limit reached!
% 0.13/0.39 % (27082)------------------------------
% 0.13/0.39 % (27082)Version: Vampire 4.8 (commit 11aac991b on 2023-10-04 16:26:07 +0200)
% 0.13/0.39 % (27082)Termination reason: Unknown
% 0.13/0.39 % (27082)Termination phase: shuffling
% 0.13/0.39
% 0.13/0.39 % (27082)Memory used [KB]: 1023
% 0.13/0.39 % (27082)Time elapsed: 0.003 s
% 0.13/0.39 % (27082)Instructions burned: 2 (million)
% 0.13/0.39 % (27082)------------------------------
% 0.13/0.39 % (27082)------------------------------
% 0.13/0.39 % (27081)Instructions burned: 2 (million)
% 0.13/0.39 % (27081)------------------------------
% 0.13/0.39 % (27081)------------------------------
% 0.13/0.39 % (27079)Instruction limit reached!
% 0.13/0.39 % (27079)------------------------------
% 0.13/0.39 % (27079)Version: Vampire 4.8 (commit 11aac991b on 2023-10-04 16:26:07 +0200)
% 0.13/0.39 % (27079)Termination reason: Unknown
% 0.13/0.39 % (27079)Termination phase: shuffling
% 0.13/0.39
% 0.13/0.39 % (27079)Memory used [KB]: 1023
% 0.13/0.39 % (27079)Time elapsed: 0.004 s
% 0.13/0.39 % (27079)Instructions burned: 4 (million)
% 0.13/0.39 % (27079)------------------------------
% 0.13/0.39 % (27079)------------------------------
% 0.13/0.39 % (27084)lrs+1004_1:128_cond=on:e2e=on:sp=weighted_frequency:i=18:si=on:rtra=on_0 on theBenchmark for (2999ds/18Mi)
% 0.13/0.40 % (27083)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.13/0.40 % (27080)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.13/0.40 % (27078)First to succeed.
% 0.13/0.40 % (27084)Instruction limit reached!
% 0.13/0.40 % (27084)------------------------------
% 0.13/0.40 % (27084)Version: Vampire 4.8 (commit 11aac991b on 2023-10-04 16:26:07 +0200)
% 0.13/0.40 % (27084)Termination reason: Unknown
% 0.13/0.40 % (27084)Termination phase: Saturation
% 0.13/0.40
% 0.13/0.40 % (27084)Memory used [KB]: 5628
% 0.13/0.40 % (27084)Time elapsed: 0.011 s
% 0.13/0.40 % (27084)Instructions burned: 18 (million)
% 0.13/0.40 % (27084)------------------------------
% 0.13/0.40 % (27084)------------------------------
% 0.13/0.40 % (27083)Also succeeded, but the first one will report.
% 0.13/0.40 % (27078)Refutation found. Thanks to Tanya!
% 0.13/0.40 % SZS status Theorem for theBenchmark
% 0.13/0.40 % SZS output start Proof for theBenchmark
% 0.13/0.40 thf(type_def_5, type, del: $tType).
% 0.13/0.40 thf(func_def_0, type, del: $tType).
% 0.13/0.40 thf(func_def_1, type, bool: del).
% 0.13/0.40 thf(func_def_2, type, ind: del).
% 0.13/0.40 thf(func_def_3, type, arr: del > del > del).
% 0.13/0.40 thf(func_def_4, type, mem: $i > del > $o).
% 0.13/0.40 thf(func_def_5, type, ap: $i > $i > $i).
% 0.13/0.40 thf(func_def_6, type, lam: del > ($i > $i) > $i).
% 0.13/0.40 thf(func_def_7, type, p: $i > $o).
% 0.13/0.40 thf(func_def_8, type, inj__o: $o > $i).
% 0.13/0.40 thf(func_def_11, type, c_2Ecardinal_2Ecardleq: del > del > $i).
% 0.13/0.40 thf(func_def_17, type, c_2Emin_2E_3D: del > $i).
% 0.13/0.40 thf(func_def_18, type, c_2Ebool_2E_21: del > $i).
% 0.13/0.40 thf(func_def_21, type, sP0: $i > $i > $o).
% 0.13/0.40 thf(func_def_22, type, sP1: $i > $i > $o).
% 0.13/0.40 thf(func_def_23, type, sP2: $i > $i > $i > $o).
% 0.13/0.40 thf(func_def_24, type, sP3: $i > $i > $i > $o).
% 0.13/0.40 thf(func_def_25, type, sP4: $i > $i > $i > $o).
% 0.13/0.40 thf(func_def_26, type, sP5: $i > $i > $i > $o).
% 0.13/0.40 thf(func_def_27, type, sP6: $i > $i > $i > $o).
% 0.13/0.40 thf(func_def_28, type, sK7: del > ($i > $i) > del > $i).
% 0.13/0.40 thf(func_def_29, type, sK8: $i > del > $i > $i).
% 0.13/0.40 thf(func_def_30, type, sK9: del).
% 0.13/0.40 thf(func_def_32, type, sK11: del).
% 0.13/0.40 thf(func_def_34, type, sK13: $i > del > $i).
% 0.13/0.40 thf(func_def_35, type, sK14: $i > del > $i).
% 0.13/0.40 thf(f359,plain,(
% 0.13/0.40 $false),
% 0.13/0.40 inference(subsumption_resolution,[],[f357,f358])).
% 0.13/0.40 thf(f358,plain,(
% 0.13/0.40 ((p @ (ap @ (ap @ (c_2Ecardinal_2Ecardleq @ sK11 @ sK9) @ sK10) @ sK12)) != $true)),
% 0.13/0.40 inference(duplicate_literal_removal,[],[f267])).
% 0.13/0.40 thf(f267,plain,(
% 0.13/0.40 ((p @ (ap @ (ap @ (c_2Ecardinal_2Ecardleq @ sK11 @ sK9) @ sK10) @ sK12)) != $true) | ((p @ (ap @ (ap @ (c_2Ecardinal_2Ecardleq @ sK11 @ sK9) @ sK10) @ sK12)) != $true)),
% 0.13/0.40 inference(cnf_transformation,[],[f198])).
% 0.13/0.40 thf(f198,plain,(
% 0.13/0.40 (((mem @ sK12 @ (arr @ sK9 @ bool)) = $true) & (((p @ (ap @ (ap @ (c_2Ecardinal_2Ecardleq @ sK11 @ sK9) @ sK10) @ sK12)) = $true) | ((p @ (ap @ (ap @ (c_2Ecardinal_2Ecardleq @ sK11 @ sK9) @ sK10) @ sK12)) = $true)) & (((p @ (ap @ (ap @ (c_2Ecardinal_2Ecardleq @ sK11 @ sK9) @ sK10) @ sK12)) != $true) | ((p @ (ap @ (ap @ (c_2Ecardinal_2Ecardleq @ sK11 @ sK9) @ sK10) @ sK12)) != $true))) & ((mem @ sK10 @ (arr @ sK11 @ bool)) = $true)),
% 0.13/0.40 inference(skolemisation,[status(esa),new_symbols(skolem,[sK9,sK10,sK11,sK12])],[f195,f197,f196])).
% 0.13/0.40 thf(f196,plain,(
% 0.13/0.40 ? [X0 : del,X1,X2 : del] : (? [X3] : (((mem @ X3 @ (arr @ X0 @ bool)) = $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)) != $true))) & ((mem @ X1 @ (arr @ X2 @ bool)) = $true)) => (? [X3] : (((mem @ X3 @ (arr @ sK9 @ bool)) = $true) & (((p @ (ap @ (ap @ (c_2Ecardinal_2Ecardleq @ sK11 @ sK9) @ sK10) @ X3)) = $true) | ((p @ (ap @ (ap @ (c_2Ecardinal_2Ecardleq @ sK11 @ sK9) @ sK10) @ X3)) = $true)) & (((p @ (ap @ (ap @ (c_2Ecardinal_2Ecardleq @ sK11 @ sK9) @ sK10) @ X3)) != $true) | ((p @ (ap @ (ap @ (c_2Ecardinal_2Ecardleq @ sK11 @ sK9) @ sK10) @ X3)) != $true))) & ((mem @ sK10 @ (arr @ sK11 @ bool)) = $true))),
% 0.13/0.40 introduced(choice_axiom,[])).
% 0.13/0.40 thf(f197,plain,(
% 0.13/0.40 ? [X3] : (((mem @ X3 @ (arr @ sK9 @ bool)) = $true) & (((p @ (ap @ (ap @ (c_2Ecardinal_2Ecardleq @ sK11 @ sK9) @ sK10) @ X3)) = $true) | ((p @ (ap @ (ap @ (c_2Ecardinal_2Ecardleq @ sK11 @ sK9) @ sK10) @ X3)) = $true)) & (((p @ (ap @ (ap @ (c_2Ecardinal_2Ecardleq @ sK11 @ sK9) @ sK10) @ X3)) != $true) | ((p @ (ap @ (ap @ (c_2Ecardinal_2Ecardleq @ sK11 @ sK9) @ sK10) @ X3)) != $true))) => (((mem @ sK12 @ (arr @ sK9 @ bool)) = $true) & (((p @ (ap @ (ap @ (c_2Ecardinal_2Ecardleq @ sK11 @ sK9) @ sK10) @ sK12)) = $true) | ((p @ (ap @ (ap @ (c_2Ecardinal_2Ecardleq @ sK11 @ sK9) @ sK10) @ sK12)) = $true)) & (((p @ (ap @ (ap @ (c_2Ecardinal_2Ecardleq @ sK11 @ sK9) @ sK10) @ sK12)) != $true) | ((p @ (ap @ (ap @ (c_2Ecardinal_2Ecardleq @ sK11 @ sK9) @ sK10) @ sK12)) != $true)))),
% 0.13/0.40 introduced(choice_axiom,[])).
% 0.13/0.40 thf(f195,plain,(
% 0.13/0.40 ? [X0 : del,X1,X2 : del] : (? [X3] : (((mem @ X3 @ (arr @ X0 @ bool)) = $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)) != $true))) & ((mem @ X1 @ (arr @ X2 @ bool)) = $true))),
% 0.13/0.40 inference(rectify,[],[f194])).
% 0.13/0.40 thf(f194,plain,(
% 0.13/0.40 ? [X0 : del,X2,X1 : del] : (? [X3] : (((mem @ X3 @ (arr @ X0 @ bool)) = $true) & (((p @ (ap @ (ap @ (c_2Ecardinal_2Ecardleq @ X1 @ X0) @ X2) @ X3)) = $true) | ((p @ (ap @ (ap @ (c_2Ecardinal_2Ecardleq @ X1 @ X0) @ X2) @ X3)) = $true)) & (((p @ (ap @ (ap @ (c_2Ecardinal_2Ecardleq @ X1 @ X0) @ X2) @ X3)) != $true) | ((p @ (ap @ (ap @ (c_2Ecardinal_2Ecardleq @ X1 @ X0) @ X2) @ X3)) != $true))) & ((mem @ X2 @ (arr @ X1 @ bool)) = $true))),
% 0.13/0.40 inference(flattening,[],[f193])).
% 0.13/0.40 thf(f193,plain,(
% 0.13/0.40 ? [X0 : del,X2,X1 : del] : (? [X3] : (((mem @ X3 @ (arr @ X0 @ bool)) = $true) & ((((p @ (ap @ (ap @ (c_2Ecardinal_2Ecardleq @ X1 @ X0) @ X2) @ X3)) = $true) | ((p @ (ap @ (ap @ (c_2Ecardinal_2Ecardleq @ X1 @ X0) @ X2) @ X3)) = $true)) & (((p @ (ap @ (ap @ (c_2Ecardinal_2Ecardleq @ X1 @ X0) @ X2) @ X3)) != $true) | ((p @ (ap @ (ap @ (c_2Ecardinal_2Ecardleq @ X1 @ X0) @ X2) @ X3)) != $true)))) & ((mem @ X2 @ (arr @ X1 @ bool)) = $true))),
% 0.13/0.40 inference(nnf_transformation,[],[f166])).
% 0.13/0.40 thf(f166,plain,(
% 0.13/0.40 ? [X0 : del,X2,X1 : del] : (? [X3] : (((mem @ X3 @ (arr @ X0 @ bool)) = $true) & (((p @ (ap @ (ap @ (c_2Ecardinal_2Ecardleq @ X1 @ X0) @ X2) @ X3)) != $true) <~> ((p @ (ap @ (ap @ (c_2Ecardinal_2Ecardleq @ X1 @ X0) @ X2) @ X3)) != $true))) & ((mem @ X2 @ (arr @ X1 @ bool)) = $true))),
% 0.13/0.40 inference(ennf_transformation,[],[f126])).
% 0.13/0.40 thf(f126,plain,(
% 0.13/0.40 ~! [X1 : del,X2,X0 : del] : (((mem @ X2 @ (arr @ X1 @ bool)) = $true) => ! [X3] : (((mem @ X3 @ (arr @ X0 @ bool)) = $true) => (((p @ (ap @ (ap @ (c_2Ecardinal_2Ecardleq @ X1 @ X0) @ X2) @ X3)) != $true) <=> ((p @ (ap @ (ap @ (c_2Ecardinal_2Ecardleq @ X1 @ X0) @ X2) @ X3)) != $true))))),
% 0.13/0.40 inference(flattening,[],[f74])).
% 0.13/0.40 thf(f74,plain,(
% 0.13/0.40 ~! [X0 : del,X1 : del,X2] : (((mem @ X2 @ (arr @ X1 @ bool)) = $true) => ! [X3] : (((mem @ X3 @ (arr @ X0 @ bool)) = $true) => (~((p @ (ap @ (ap @ (c_2Ecardinal_2Ecardleq @ X1 @ X0) @ X2) @ X3)) = $true) <=> ~((p @ (ap @ (ap @ (c_2Ecardinal_2Ecardleq @ X1 @ X0) @ X2) @ X3)) = $true))))),
% 0.13/0.40 inference(fool_elimination,[],[f73])).
% 0.13/0.40 thf(f73,plain,(
% 0.13/0.40 ~! [X0 : del,X1 : del,X2] : ((mem @ X2 @ (arr @ X1 @ bool)) => ! [X3] : ((mem @ X3 @ (arr @ X0 @ bool)) => (~(p @ (ap @ (ap @ (c_2Ecardinal_2Ecardleq @ X1 @ X0) @ X2) @ X3)) <=> ~(p @ (ap @ (ap @ (c_2Ecardinal_2Ecardleq @ X1 @ X0) @ X2) @ X3)))))),
% 0.13/0.40 inference(rectify,[],[f41])).
% 0.13/0.40 thf(f41,negated_conjecture,(
% 0.13/0.40 ~! [X6 : del,X5 : del,X13] : ((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.13/0.40 inference(negated_conjecture,[],[f40])).
% 0.13/0.40 thf(f40,conjecture,(
% 0.13/0.40 ! [X6 : del,X5 : del,X13] : ((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.13/0.40 file('/export/starexec/sandbox/benchmark/theBenchmark.p',conj_thm_2Ecardinal_2ECARD__NOT__LE)).
% 0.13/0.40 thf(f357,plain,(
% 0.13/0.40 ((p @ (ap @ (ap @ (c_2Ecardinal_2Ecardleq @ sK11 @ sK9) @ sK10) @ sK12)) = $true)),
% 0.13/0.40 inference(duplicate_literal_removal,[],[f268])).
% 0.13/0.40 thf(f268,plain,(
% 0.13/0.40 ((p @ (ap @ (ap @ (c_2Ecardinal_2Ecardleq @ sK11 @ sK9) @ sK10) @ sK12)) = $true) | ((p @ (ap @ (ap @ (c_2Ecardinal_2Ecardleq @ sK11 @ sK9) @ sK10) @ sK12)) = $true)),
% 0.13/0.40 inference(cnf_transformation,[],[f198])).
% 0.13/0.40 % SZS output end Proof for theBenchmark
% 0.13/0.40 % (27078)------------------------------
% 0.13/0.40 % (27078)Version: Vampire 4.8 (commit 11aac991b on 2023-10-04 16:26:07 +0200)
% 0.13/0.40 % (27078)Termination reason: Refutation
% 0.13/0.40
% 0.13/0.40 % (27078)Memory used [KB]: 5756
% 0.13/0.40 % (27078)Time elapsed: 0.014 s
% 0.13/0.40 % (27078)Instructions burned: 19 (million)
% 0.13/0.40 % (27078)------------------------------
% 0.13/0.40 % (27078)------------------------------
% 0.13/0.40 % (27077)Success in time 0.034 s
%------------------------------------------------------------------------------