TSTP Solution File: SEV409^5 by Vampire---4.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.9
% Problem : SEV409^5 : TPTP v8.2.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire %s %d THM
% Computer : n026.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.15s 0.33s
% Output : Refutation 0.15s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.09 % Problem : SEV409^5 : TPTP v8.2.0. Released v4.0.0.
% 0.00/0.09 % Command : run_vampire %s %d THM
% 0.08/0.29 % Computer : n026.cluster.edu
% 0.08/0.29 % Model : x86_64 x86_64
% 0.08/0.29 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.29 % Memory : 8042.1875MB
% 0.08/0.29 % OS : Linux 3.10.0-693.el7.x86_64
% 0.08/0.29 % CPULimit : 300
% 0.08/0.29 % WCLimit : 300
% 0.08/0.29 % DateTime : Fri Jun 21 18:55:39 EDT 2024
% 0.08/0.29 % CPUTime :
% 0.14/0.31 This is a TH0_THM_NEQ_NAR problem
% 0.15/0.31 Running higher-order theorem proving
% 0.15/0.31 Running /export/starexec/sandbox2/solver/bin/vampire_ho --cores 7 --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_hol /export/starexec/sandbox2/benchmark/theBenchmark.p -m 16384 -t 300
% 0.15/0.32 % (954)lrs+1004_1:128_cond=on:e2e=on:sp=weighted_frequency:i=18:si=on:rtra=on_0 on theBenchmark for (2999ds/18Mi)
% 0.15/0.33 % (946)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.15/0.33 % (948)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.15/0.33 % (951)lrs+10_1:1_au=on:inj=on:i=2:si=on:rtra=on_0 on theBenchmark for (2999ds/2Mi)
% 0.15/0.33 % (952)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.15/0.33 % (954)First to succeed.
% 0.15/0.33 % (952)Instruction limit reached!
% 0.15/0.33 % (952)------------------------------
% 0.15/0.33 % (952)Version: Vampire 4.8 (commit 11aac991b on 2023-10-04 16:26:07 +0200)
% 0.15/0.33 % (952)Termination reason: Unknown
% 0.15/0.33 % (952)Termination phase: Saturation
% 0.15/0.33
% 0.15/0.33 % (952)Memory used [KB]: 5500
% 0.15/0.33 % (952)Time elapsed: 0.003 s
% 0.15/0.33 % (952)Instructions burned: 2 (million)
% 0.15/0.33 % (952)------------------------------
% 0.15/0.33 % (952)------------------------------
% 0.15/0.33 % (946)Also succeeded, but the first one will report.
% 0.15/0.33 % (954)Refutation found. Thanks to Tanya!
% 0.15/0.33 % SZS status Theorem for theBenchmark
% 0.15/0.33 % SZS output start Proof for theBenchmark
% 0.15/0.33 thf(func_def_3, type, sK0: (($i > $o) > ($i > $o) > $o) > $i > $o).
% 0.15/0.33 thf(func_def_4, type, sK1: (($i > $o) > ($i > $o) > $o) > $i > $o).
% 0.15/0.33 thf(func_def_5, type, sK2: (($i > $o) > ($i > $o) > $o) > $i).
% 0.15/0.33 thf(func_def_8, type, ph4: !>[X0: $tType]:(X0)).
% 0.15/0.33 thf(f28,plain,(
% 0.15/0.33 $false),
% 0.15/0.33 inference(trivial_inequality_removal,[],[f27])).
% 0.15/0.33 thf(f27,plain,(
% 0.15/0.33 ($true = $false)),
% 0.15/0.33 inference(beta_eta_normalization,[],[f19])).
% 0.15/0.33 thf(f19,plain,(
% 0.15/0.33 ($true = ((^[Y0 : $i > $o]: ((^[Y1 : $i > $o]: ($false)))) @ (sK1 @ (^[Y0 : $i > $o]: ((^[Y1 : $i > $o]: ($false))))) @ (sK0 @ (^[Y0 : $i > $o]: ((^[Y1 : $i > $o]: ($false)))))))),
% 0.15/0.33 inference(primitive_instantiation,[],[f11])).
% 0.15/0.33 thf(f11,plain,(
% 0.15/0.33 ( ! [X0 : ($i > $o) > ($i > $o) > $o] : (($true = (X0 @ (sK1 @ X0) @ (sK0 @ X0)))) )),
% 0.15/0.33 inference(cnf_transformation,[],[f10])).
% 0.15/0.33 thf(f10,plain,(
% 0.15/0.33 ! [X0 : ($i > $o) > ($i > $o) > $o] : (((sK1 @ X0 @ (sK2 @ X0)) != (sK0 @ X0 @ (sK2 @ X0))) & ($true = (X0 @ (sK0 @ X0) @ (sK1 @ X0))) & ($true = (X0 @ (sK1 @ X0) @ (sK0 @ X0))))),
% 0.15/0.33 inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2])],[f7,f9,f8])).
% 0.15/0.33 thf(f8,plain,(
% 0.15/0.33 ! [X0 : ($i > $o) > ($i > $o) > $o] : (? [X1 : $i > $o,X2 : $i > $o] : (? [X3] : ((X1 @ X3) != (X2 @ X3)) & ((X0 @ X1 @ X2) = $true) & ((X0 @ X2 @ X1) = $true)) => (? [X3] : ((sK1 @ X0 @ X3) != (sK0 @ X0 @ X3)) & ($true = (X0 @ (sK0 @ X0) @ (sK1 @ X0))) & ($true = (X0 @ (sK1 @ X0) @ (sK0 @ X0)))))),
% 0.15/0.33 introduced(choice_axiom,[])).
% 0.15/0.33 thf(f9,plain,(
% 0.15/0.33 ! [X0 : ($i > $o) > ($i > $o) > $o] : (? [X3] : ((sK1 @ X0 @ X3) != (sK0 @ X0 @ X3)) => ((sK1 @ X0 @ (sK2 @ X0)) != (sK0 @ X0 @ (sK2 @ X0))))),
% 0.15/0.33 introduced(choice_axiom,[])).
% 0.15/0.33 thf(f7,plain,(
% 0.15/0.33 ! [X0 : ($i > $o) > ($i > $o) > $o] : ? [X1 : $i > $o,X2 : $i > $o] : (? [X3] : ((X1 @ X3) != (X2 @ X3)) & ((X0 @ X1 @ X2) = $true) & ((X0 @ X2 @ X1) = $true))),
% 0.15/0.33 inference(flattening,[],[f6])).
% 0.15/0.33 thf(f6,plain,(
% 0.15/0.33 ! [X0 : ($i > $o) > ($i > $o) > $o] : ? [X2 : $i > $o,X1 : $i > $o] : (? [X3] : ((X1 @ X3) != (X2 @ X3)) & (((X0 @ X2 @ X1) = $true) & ((X0 @ X1 @ X2) = $true)))),
% 0.15/0.33 inference(ennf_transformation,[],[f5])).
% 0.15/0.33 thf(f5,plain,(
% 0.15/0.33 ~? [X0 : ($i > $o) > ($i > $o) > $o] : ! [X2 : $i > $o,X1 : $i > $o] : ((((X0 @ X2 @ X1) = $true) & ((X0 @ X1 @ X2) = $true)) => ! [X3] : ((X1 @ X3) = (X2 @ X3)))),
% 0.15/0.33 inference(fool_elimination,[],[f4])).
% 0.15/0.33 thf(f4,plain,(
% 0.15/0.33 ~? [X0 : ($i > $o) > ($i > $o) > $o] : ! [X1 : $i > $o,X2 : $i > $o] : (((X0 @ X1 @ X2) & (X0 @ X2 @ X1)) => ! [X3] : ((X1 @ X3) <=> (X2 @ X3)))),
% 0.15/0.33 inference(rectify,[],[f2])).
% 0.15/0.33 thf(f2,negated_conjecture,(
% 0.15/0.33 ~? [X0 : ($i > $o) > ($i > $o) > $o] : ! [X1 : $i > $o,X2 : $i > $o] : (((X0 @ X1 @ X2) & (X0 @ X2 @ X1)) => ! [X3] : ((X1 @ X3) <=> (X2 @ X3)))),
% 0.15/0.33 inference(negated_conjecture,[],[f1])).
% 0.15/0.33 thf(f1,conjecture,(
% 0.15/0.33 ? [X0 : ($i > $o) > ($i > $o) > $o] : ! [X1 : $i > $o,X2 : $i > $o] : (((X0 @ X1 @ X2) & (X0 @ X2 @ X1)) => ! [X3] : ((X1 @ X3) <=> (X2 @ X3)))),
% 0.15/0.33 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cTHM120_BUG_pme)).
% 0.15/0.33 % SZS output end Proof for theBenchmark
% 0.15/0.33 % (954)------------------------------
% 0.15/0.33 % (954)Version: Vampire 4.8 (commit 11aac991b on 2023-10-04 16:26:07 +0200)
% 0.15/0.33 % (954)Termination reason: Refutation
% 0.15/0.33
% 0.15/0.33 % (954)Memory used [KB]: 5500
% 0.15/0.33 % (954)Time elapsed: 0.004 s
% 0.15/0.33 % (954)Instructions burned: 2 (million)
% 0.15/0.33 % (954)------------------------------
% 0.15/0.33 % (954)------------------------------
% 0.15/0.33 % (945)Success in time 0.016 s
%------------------------------------------------------------------------------