TSTP Solution File: SEV408^5 by Vampire---4.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.9
% Problem : SEV408^5 : TPTP v8.2.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire %s %d THM
% Computer : n021.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 16:03:45 EDT 2024
% Result : Theorem 0.12s 0.39s
% Output : Refutation 0.12s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : SEV408^5 : TPTP v8.2.0. Released v4.0.0.
% 0.07/0.13 % Command : run_vampire %s %d THM
% 0.12/0.34 % Computer : n021.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 300
% 0.12/0.34 % DateTime : Fri Jun 21 19:37:09 EDT 2024
% 0.12/0.34 % CPUTime :
% 0.12/0.36 This is a TH0_THM_NEQ_NAR problem
% 0.12/0.36 Running higher-order theorem proving
% 0.12/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.12/0.38 % (13901)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.12/0.38 % (13898)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.12/0.38 % (13900)lrs+10_1:1_au=on:inj=on:i=2:si=on:rtra=on_0 on theBenchmark for (2999ds/2Mi)
% 0.12/0.38 % (13897)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.12/0.38 % (13899)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.12/0.38 % (13902)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.12/0.38 % (13903)lrs+1004_1:128_cond=on:e2e=on:sp=weighted_frequency:i=18:si=on:rtra=on_0 on theBenchmark for (2999ds/18Mi)
% 0.12/0.38 % (13902)First to succeed.
% 0.12/0.38 % (13901)Instruction limit reached!
% 0.12/0.38 % (13901)------------------------------
% 0.12/0.38 % (13901)Version: Vampire 4.8 (commit 11aac991b on 2023-10-04 16:26:07 +0200)
% 0.12/0.38 % (13901)Termination reason: Unknown
% 0.12/0.38 % (13901)Termination phase: Saturation
% 0.12/0.38
% 0.12/0.38 % (13901)Memory used [KB]: 5500
% 0.12/0.38 % (13901)Time elapsed: 0.005 s
% 0.12/0.38 % (13901)Instructions burned: 3 (million)
% 0.12/0.38 % (13901)------------------------------
% 0.12/0.38 % (13901)------------------------------
% 0.12/0.39 % (13897)Also succeeded, but the first one will report.
% 0.12/0.39 % (13898)Also succeeded, but the first one will report.
% 0.12/0.39 % (13902)Refutation found. Thanks to Tanya!
% 0.12/0.39 % SZS status Theorem for theBenchmark
% 0.12/0.39 % SZS output start Proof for theBenchmark
% 0.12/0.39 thf(func_def_0, type, cF: ($i > $o) > $o).
% 0.12/0.39 thf(func_def_4, type, sK0: (($i > $o) > $o) > $i > $o).
% 0.12/0.39 thf(func_def_5, type, sK1: ($i > $o) > (($i > $o) > $o) > $i).
% 0.12/0.39 thf(func_def_7, type, ph3: !>[X0: $tType]:(X0)).
% 0.12/0.39 thf(f17,plain,(
% 0.12/0.39 $false),
% 0.12/0.39 inference(trivial_inequality_removal,[],[f16])).
% 0.12/0.39 thf(f16,plain,(
% 0.12/0.39 ($false = $true)),
% 0.12/0.39 inference(beta_eta_normalization,[],[f14])).
% 0.12/0.39 thf(f14,plain,(
% 0.12/0.39 (((^[Y0 : $i > $o]: ($false)) @ (sK0 @ (^[Y0 : $i > $o]: ($false)))) = $true)),
% 0.12/0.39 inference(primitive_instantiation,[],[f12])).
% 0.12/0.39 thf(f12,plain,(
% 0.12/0.39 ( ! [X0 : ($i > $o) > $o] : (($true = (X0 @ (sK0 @ X0)))) )),
% 0.12/0.39 inference(cnf_transformation,[],[f9])).
% 0.12/0.39 thf(f9,plain,(
% 0.12/0.39 ! [X0 : ($i > $o) > $o] : (($true = (X0 @ (sK0 @ X0))) & ! [X2 : $i > $o] : (((cF @ X2) != $true) | (((sK0 @ X0 @ (sK1 @ X2 @ X0)) = $true) & ($true != (X2 @ (sK1 @ X2 @ X0))))))),
% 0.12/0.39 inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1])],[f6,f8,f7])).
% 0.12/0.39 thf(f7,plain,(
% 0.12/0.39 ! [X0 : ($i > $o) > $o] : (? [X1 : $i > $o] : (((X0 @ X1) = $true) & ! [X2 : $i > $o] : (((cF @ X2) != $true) | ? [X3] : (((X1 @ X3) = $true) & ((X2 @ X3) != $true)))) => (($true = (X0 @ (sK0 @ X0))) & ! [X2 : $i > $o] : (((cF @ X2) != $true) | ? [X3] : (((sK0 @ X0 @ X3) = $true) & ((X2 @ X3) != $true)))))),
% 0.12/0.39 introduced(choice_axiom,[])).
% 0.12/0.39 thf(f8,plain,(
% 0.12/0.39 ! [X0 : ($i > $o) > $o,X2 : $i > $o] : (? [X3] : (((sK0 @ X0 @ X3) = $true) & ((X2 @ X3) != $true)) => (((sK0 @ X0 @ (sK1 @ X2 @ X0)) = $true) & ($true != (X2 @ (sK1 @ X2 @ X0)))))),
% 0.12/0.39 introduced(choice_axiom,[])).
% 0.12/0.39 thf(f6,plain,(
% 0.12/0.39 ! [X0 : ($i > $o) > $o] : ? [X1 : $i > $o] : (((X0 @ X1) = $true) & ! [X2 : $i > $o] : (((cF @ X2) != $true) | ? [X3] : (((X1 @ X3) = $true) & ((X2 @ X3) != $true))))),
% 0.12/0.39 inference(ennf_transformation,[],[f5])).
% 0.12/0.39 thf(f5,plain,(
% 0.12/0.39 ~? [X0 : ($i > $o) > $o] : ! [X1 : $i > $o] : (((X0 @ X1) = $true) => ? [X2 : $i > $o] : (((cF @ X2) = $true) & ! [X3] : (((X1 @ X3) = $true) => ((X2 @ X3) = $true))))),
% 0.12/0.39 inference(fool_elimination,[],[f4])).
% 0.12/0.39 thf(f4,plain,(
% 0.12/0.39 ~? [X0 : ($i > $o) > $o] : ! [X1 : $i > $o] : ((X0 @ X1) => ? [X2 : $i > $o] : ((cF @ X2) & ! [X3] : ((X1 @ X3) => (X2 @ X3))))),
% 0.12/0.39 inference(rectify,[],[f2])).
% 0.12/0.39 thf(f2,negated_conjecture,(
% 0.12/0.39 ~? [X0 : ($i > $o) > $o] : ! [X1 : $i > $o] : ((X0 @ X1) => ? [X2 : $i > $o] : ((cF @ X2) & ! [X3] : ((X1 @ X3) => (X2 @ X3))))),
% 0.12/0.39 inference(negated_conjecture,[],[f1])).
% 0.12/0.39 thf(f1,conjecture,(
% 0.12/0.39 ? [X0 : ($i > $o) > $o] : ! [X1 : $i > $o] : ((X0 @ X1) => ? [X2 : $i > $o] : ((cF @ X2) & ! [X3] : ((X1 @ X3) => (X2 @ X3))))),
% 0.12/0.39 file('/export/starexec/sandbox/benchmark/theBenchmark.p',cBLEDSOE2_pme)).
% 0.12/0.39 % SZS output end Proof for theBenchmark
% 0.12/0.39 % (13902)------------------------------
% 0.12/0.39 % (13902)Version: Vampire 4.8 (commit 11aac991b on 2023-10-04 16:26:07 +0200)
% 0.12/0.39 % (13902)Termination reason: Refutation
% 0.12/0.39
% 0.12/0.39 % (13902)Memory used [KB]: 5500
% 0.12/0.39 % (13902)Time elapsed: 0.005 s
% 0.12/0.39 % (13902)Instructions burned: 1 (million)
% 0.12/0.39 % (13902)------------------------------
% 0.12/0.39 % (13902)------------------------------
% 0.12/0.39 % (13896)Success in time 0.019 s
%------------------------------------------------------------------------------