TSTP Solution File: SEV411^5 by Vampire---4.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.9
% Problem : SEV411^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.13s 0.39s
% Output : Refutation 0.13s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : SEV411^5 : TPTP v8.2.0. Released v4.0.0.
% 0.06/0.12 % Command : run_vampire %s %d THM
% 0.13/0.34 % Computer : n021.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Fri Jun 21 18:23:54 EDT 2024
% 0.13/0.34 % CPUTime :
% 0.13/0.36 This is a TH0_THM_NEQ_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.38 % (20717)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.38 % (20716)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.38 % (20718)lrs+10_1:1_au=on:inj=on:i=2:si=on:rtra=on_0 on theBenchmark for (2999ds/2Mi)
% 0.13/0.38 % (20719)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.38 % (20720)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.38 % (20715)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.38 % (20719)First to succeed.
% 0.13/0.39 % (20718)Also succeeded, but the first one will report.
% 0.13/0.39 % (20715)Also succeeded, but the first one will report.
% 0.13/0.39 % (20719)Refutation found. Thanks to Tanya!
% 0.13/0.39 % SZS status Theorem for theBenchmark
% 0.13/0.39 % SZS output start Proof for theBenchmark
% 0.13/0.39 thf(func_def_0, type, cB: $i > $o).
% 0.13/0.39 thf(func_def_1, type, cA: $i > $o).
% 0.13/0.39 thf(f10,plain,(
% 0.13/0.39 $false),
% 0.13/0.39 inference(trivial_inequality_removal,[],[f9])).
% 0.13/0.39 thf(f9,plain,(
% 0.13/0.39 ($false = $true)),
% 0.13/0.39 inference(boolean_simplification,[],[f8])).
% 0.13/0.39 thf(f8,plain,(
% 0.13/0.39 ((~ $true) = $true)),
% 0.13/0.39 inference(boolean_simplification,[],[f7])).
% 0.13/0.39 thf(f7,plain,(
% 0.13/0.39 ((~ ((!! @ $i @ (^[Y0 : $i]: ((cA @ Y0) => (cB @ Y0)))) => (!! @ $i @ (^[Y0 : $i]: ((cA @ Y0) => (cB @ Y0)))))) = $true)),
% 0.13/0.39 inference(boolean_simplification,[],[f6])).
% 0.13/0.39 thf(f6,plain,(
% 0.13/0.39 ((~ (((!! @ $i @ (^[Y0 : $i]: ((cA @ Y0) => (cB @ Y0)))) | (!! @ $i @ (^[Y0 : $i]: ((cA @ Y0) => (cB @ Y0))))) => (!! @ $i @ (^[Y0 : $i]: ((cA @ Y0) => (cB @ Y0)))))) = $true)),
% 0.13/0.39 inference(cnf_transformation,[],[f5])).
% 0.13/0.39 thf(f5,plain,(
% 0.13/0.39 ((~ (((!! @ $i @ (^[Y0 : $i]: ((cA @ Y0) => (cB @ Y0)))) | (!! @ $i @ (^[Y0 : $i]: ((cA @ Y0) => (cB @ Y0))))) => (!! @ $i @ (^[Y0 : $i]: ((cA @ Y0) => (cB @ Y0)))))) = $true)),
% 0.13/0.39 inference(fool_elimination,[],[f4])).
% 0.13/0.39 thf(f4,plain,(
% 0.13/0.39 ~((! [X0] : ((cA @ X0) => (cB @ X0)) | ! [X1] : ((cA @ X1) => (cB @ X1))) => ! [X2] : ((cA @ X2) => (cB @ X2)))),
% 0.13/0.39 inference(rectify,[],[f2])).
% 0.13/0.39 thf(f2,negated_conjecture,(
% 0.13/0.39 ~((! [X0] : ((cA @ X0) => (cB @ X0)) | ! [X0] : ((cA @ X0) => (cB @ X0))) => ! [X0] : ((cA @ X0) => (cB @ X0)))),
% 0.13/0.39 inference(negated_conjecture,[],[f1])).
% 0.13/0.39 thf(f1,conjecture,(
% 0.13/0.39 (! [X0] : ((cA @ X0) => (cB @ X0)) | ! [X0] : ((cA @ X0) => (cB @ X0))) => ! [X0] : ((cA @ X0) => (cB @ X0))),
% 0.13/0.39 file('/export/starexec/sandbox/benchmark/theBenchmark.p',cDUAL_EG1_pme)).
% 0.13/0.39 % SZS output end Proof for theBenchmark
% 0.13/0.39 % (20719)------------------------------
% 0.13/0.39 % (20719)Version: Vampire 4.8 (commit 11aac991b on 2023-10-04 16:26:07 +0200)
% 0.13/0.39 % (20719)Termination reason: Refutation
% 0.13/0.39
% 0.13/0.39 % (20719)Memory used [KB]: 5373
% 0.13/0.39 % (20719)Time elapsed: 0.004 s
% 0.13/0.39 % (20719)Instructions burned: 1 (million)
% 0.13/0.39 % (20719)------------------------------
% 0.13/0.39 % (20719)------------------------------
% 0.13/0.39 % (20714)Success in time 0.008 s
%------------------------------------------------------------------------------