TSTP Solution File: SYO311^5 by Vampire---4.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.9
% Problem : SYO311^5 : TPTP v8.2.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire %s %d THM
% 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 Jun 24 21:01:41 EDT 2024
% Result : Theorem 0.19s 0.37s
% Output : Refutation 0.19s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : SYO311^5 : TPTP v8.2.0. Released v4.0.0.
% 0.11/0.12 % Command : run_vampire %s %d THM
% 0.11/0.33 % Computer : n023.cluster.edu
% 0.11/0.33 % Model : x86_64 x86_64
% 0.11/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.33 % Memory : 8042.1875MB
% 0.11/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.33 % CPULimit : 300
% 0.11/0.33 % WCLimit : 300
% 0.11/0.33 % DateTime : Sun Jun 23 07:07:39 EDT 2024
% 0.11/0.33 % CPUTime :
% 0.19/0.34 This is a TH0_THM_NEQ_NAR problem
% 0.19/0.35 Running higher-order theorem proving
% 0.19/0.35 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.19/0.37 % (32264)lrs+1002_1:8_bd=off:fd=off:hud=10:tnu=1:i=183:si=on:rtra=on_0 on theBenchmark for (3000ds/183Mi)
% 0.19/0.37 % (32267)lrs+10_1:1_au=on:inj=on:i=2:si=on:rtra=on_0 on theBenchmark for (3000ds/2Mi)
% 0.19/0.37 % (32266)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 (3000ds/27Mi)
% 0.19/0.37 % (32268)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 (3000ds/2Mi)
% 0.19/0.37 % (32270)lrs+1004_1:128_cond=on:e2e=on:sp=weighted_frequency:i=18:si=on:rtra=on_0 on theBenchmark for (3000ds/18Mi)
% 0.19/0.37 % (32269)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 (3000ds/275Mi)
% 0.19/0.37 % (32265)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 (3000ds/4Mi)
% 0.19/0.37 % (32268)Instruction limit reached!
% 0.19/0.37 % (32268)------------------------------
% 0.19/0.37 % (32268)Version: Vampire 4.8 (commit 11aac991b on 2023-10-04 16:26:07 +0200)
% 0.19/0.37 % (32268)Termination reason: Unknown
% 0.19/0.37 % (32268)Termination phase: Saturation
% 0.19/0.37
% 0.19/0.37 % (32268)Memory used [KB]: 5500
% 0.19/0.37 % (32268)Time elapsed: 0.004 s
% 0.19/0.37 % (32268)Instructions burned: 2 (million)
% 0.19/0.37 % (32268)------------------------------
% 0.19/0.37 % (32268)------------------------------
% 0.19/0.37 % (32266)Refutation not found, incomplete strategy
% 0.19/0.37 % (32266)------------------------------
% 0.19/0.37 % (32266)Version: Vampire 4.8 (commit 11aac991b on 2023-10-04 16:26:07 +0200)
% 0.19/0.37 % (32266)Termination reason: Refutation not found, incomplete strategy
% 0.19/0.37
% 0.19/0.37
% 0.19/0.37 % (32266)Memory used [KB]: 5500
% 0.19/0.37 % (32266)Time elapsed: 0.003 s
% 0.19/0.37 % (32266)Instructions burned: 1 (million)
% 0.19/0.37 % (32266)------------------------------
% 0.19/0.37 % (32266)------------------------------
% 0.19/0.37 % (32267)First to succeed.
% 0.19/0.37 % (32270)Also succeeded, but the first one will report.
% 0.19/0.37 % (32267)Refutation found. Thanks to Tanya!
% 0.19/0.37 % SZS status Theorem for theBenchmark
% 0.19/0.37 % SZS output start Proof for theBenchmark
% 0.19/0.37 thf(func_def_4, type, sK0: $o > $o).
% 0.19/0.37 thf(func_def_7, type, ph2: !>[X0: $tType]:(X0)).
% 0.19/0.37 thf(f45,plain,(
% 0.19/0.37 $false),
% 0.19/0.37 inference(trivial_inequality_removal,[],[f44])).
% 0.19/0.37 thf(f44,plain,(
% 0.19/0.37 ($false = $true)),
% 0.19/0.37 inference(boolean_simplification,[],[f43])).
% 0.19/0.37 thf(f43,plain,(
% 0.19/0.37 ($true = ($false & $false))),
% 0.19/0.37 inference(trivial_inequality_removal,[],[f42])).
% 0.19/0.37 thf(f42,plain,(
% 0.19/0.37 ($true = ($false & $false)) | ($true != $true)),
% 0.19/0.37 inference(boolean_simplification,[],[f41])).
% 0.19/0.37 thf(f41,plain,(
% 0.19/0.37 (($true & $true) != $true) | ($true = ($false & $false))),
% 0.19/0.37 inference(trivial_inequality_removal,[],[f40])).
% 0.19/0.37 thf(f40,plain,(
% 0.19/0.37 ($true = ($false & $false)) | (($true & $true) != $true) | ($false = $true)),
% 0.19/0.37 inference(boolean_simplification,[],[f39])).
% 0.19/0.37 thf(f39,plain,(
% 0.19/0.37 ($true = ($true & $false)) | ($true = ($false & $false)) | (($true & $true) != $true)),
% 0.19/0.37 inference(trivial_inequality_removal,[],[f38])).
% 0.19/0.37 thf(f38,plain,(
% 0.19/0.37 ($false = $true) | (($true & $true) != $true) | ($true = ($false & $false)) | ($true = ($true & $false))),
% 0.19/0.37 inference(boolean_simplification,[],[f37])).
% 0.19/0.37 thf(f37,plain,(
% 0.19/0.37 ($true = ($false & $true)) | (($true & $true) != $true) | ($true = ($true & $false)) | ($true = ($false & $false))),
% 0.19/0.37 inference(beta_eta_normalization,[],[f19])).
% 0.19/0.37 thf(f19,plain,(
% 0.19/0.37 (((^[Y0 : $o]: ((^[Y1 : $o]: (Y1 & Y0)))) @ $false @ $true) = $true) | ($true = ((^[Y0 : $o]: ((^[Y1 : $o]: (Y1 & Y0)))) @ $true @ $false)) | (((^[Y0 : $o]: ((^[Y1 : $o]: (Y1 & Y0)))) @ $false @ $false) = $true) | (((^[Y0 : $o]: ((^[Y1 : $o]: (Y1 & Y0)))) @ $true @ $true) != $true)),
% 0.19/0.37 inference(primitive_instantiation,[],[f13])).
% 0.19/0.37 thf(f13,plain,(
% 0.19/0.37 ( ! [X0 : $o > $o > $o] : (($true != (X0 @ $true @ $true)) | ((X0 @ $false @ $false) = $true) | ((X0 @ $true @ $false) = $true) | ($true = (X0 @ $false @ $true))) )),
% 0.19/0.37 inference(trivial_inequality_removal,[],[f12])).
% 0.19/0.37 thf(f12,plain,(
% 0.19/0.37 ( ! [X0 : $o > $o > $o] : (((X0 @ $false @ $false) = $true) | ($true != (X0 @ $true @ $true)) | ((sK0 @ $true) != (sK0 @ $true)) | ($true = (X0 @ $false @ $true)) | ((X0 @ $true @ $false) = $true)) )),
% 0.19/0.37 inference(boolean_simplification,[],[f11])).
% 0.19/0.37 thf(f11,plain,(
% 0.19/0.37 ( ! [X0 : $o > $o > $o] : (((X0 @ $true @ $false) = $true) | ($true = (X0 @ $false @ $true)) | ((X0 @ $false @ $false) = $true) | ((sK0 @ ($true => $true)) != (sK0 @ $true)) | ($true != (X0 @ $true @ $true))) )),
% 0.19/0.37 inference(cnf_transformation,[],[f10])).
% 0.19/0.37 thf(f10,plain,(
% 0.19/0.37 ! [X0 : $o > $o > $o] : (((X0 @ $true @ $false) = $true) | ($true = (X0 @ $false @ $true)) | ((X0 @ $false @ $false) = $true) | ($true != (X0 @ $true @ $true))) | ((sK0 @ ($true => $true)) != (sK0 @ $true))),
% 0.19/0.37 inference(skolemisation,[status(esa),new_symbols(skolem,[sK0])],[f8,f9])).
% 0.19/0.37 thf(f9,plain,(
% 0.19/0.37 ? [X1 : $o > $o] : ((X1 @ ($true => $true)) != (X1 @ $true)) => ((sK0 @ ($true => $true)) != (sK0 @ $true))),
% 0.19/0.37 introduced(choice_axiom,[])).
% 0.19/0.37 thf(f8,plain,(
% 0.19/0.37 ! [X0 : $o > $o > $o] : (((X0 @ $true @ $false) = $true) | ($true = (X0 @ $false @ $true)) | ((X0 @ $false @ $false) = $true) | ($true != (X0 @ $true @ $true))) | ? [X1 : $o > $o] : ((X1 @ ($true => $true)) != (X1 @ $true))),
% 0.19/0.37 inference(rectify,[],[f7])).
% 0.19/0.37 thf(f7,plain,(
% 0.19/0.37 ! [X1 : $o > $o > $o] : (($true = (X1 @ $true @ $false)) | ((X1 @ $false @ $true) = $true) | ($true = (X1 @ $false @ $false)) | ((X1 @ $true @ $true) != $true)) | ? [X0 : $o > $o] : ((X0 @ $true) != (X0 @ ($true => $true)))),
% 0.19/0.37 inference(ennf_transformation,[],[f6])).
% 0.19/0.37 thf(f6,plain,(
% 0.19/0.37 ~(? [X1 : $o > $o > $o] : (($true != (X1 @ $false @ $false)) & ((X1 @ $false @ $true) != $true) & ($true != (X1 @ $true @ $false)) & ((X1 @ $true @ $true) = $true)) & ! [X0 : $o > $o] : ((X0 @ $true) = (X0 @ ($true => $true))))),
% 0.19/0.37 inference(flattening,[],[f5])).
% 0.19/0.37 thf(f5,plain,(
% 0.19/0.37 ~(! [X0 : $o > $o] : ((X0 @ $true) = (X0 @ ($true => $true))) & ? [X1 : $o > $o > $o] : (~($true = (X1 @ $true @ $false)) & ~((X1 @ $false @ $true) = $true) & ~($true = (X1 @ $false @ $false)) & ((X1 @ $true @ $true) = $true)))),
% 0.19/0.37 inference(fool_elimination,[],[f4])).
% 0.19/0.37 thf(f4,plain,(
% 0.19/0.37 ~(! [X0 : $o > $o] : ((X0 @ $true) <=> (X0 @ $true => $true)) & ? [X1 : $o > $o > $o] : (~(X1 @ $true @ $false) & ~(X1 @ $false @ $true) & ~(X1 @ $false @ $false) & (X1 @ $true @ $true)))),
% 0.19/0.37 inference(rectify,[],[f2])).
% 0.19/0.37 thf(f2,negated_conjecture,(
% 0.19/0.37 ~(! [X1 : $o > $o] : ((X1 @ $true) <=> (X1 @ $true => $true)) & ? [X0 : $o > $o > $o] : (~(X0 @ $true @ $false) & ~(X0 @ $false @ $true) & ~(X0 @ $false @ $false) & (X0 @ $true @ $true)))),
% 0.19/0.37 inference(negated_conjecture,[],[f1])).
% 0.19/0.37 thf(f1,conjecture,(
% 0.19/0.37 ! [X1 : $o > $o] : ((X1 @ $true) <=> (X1 @ $true => $true)) & ? [X0 : $o > $o > $o] : (~(X0 @ $true @ $false) & ~(X0 @ $false @ $true) & ~(X0 @ $false @ $false) & (X0 @ $true @ $true))),
% 0.19/0.37 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cOMEGA_EXAMPLE2)).
% 0.19/0.37 % SZS output end Proof for theBenchmark
% 0.19/0.37 % (32267)------------------------------
% 0.19/0.37 % (32267)Version: Vampire 4.8 (commit 11aac991b on 2023-10-04 16:26:07 +0200)
% 0.19/0.37 % (32267)Termination reason: Refutation
% 0.19/0.37
% 0.19/0.37 % (32267)Memory used [KB]: 5500
% 0.19/0.37 % (32267)Time elapsed: 0.006 s
% 0.19/0.37 % (32267)Instructions burned: 1 (million)
% 0.19/0.37 % (32267)------------------------------
% 0.19/0.37 % (32267)------------------------------
% 0.19/0.37 % (32262)Success in time 0.019 s
%------------------------------------------------------------------------------