TSTP Solution File: SYO311^5 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SYO311^5 : TPTP v8.2.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox2/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% Computer : n020.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 : Tue May 21 09:03:55 EDT 2024
% Result : Theorem 0.14s 0.37s
% Output : Refutation 0.14s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SYO311^5 : TPTP v8.2.0. Released v4.0.0.
% 0.03/0.13 % Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox2/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% 0.14/0.34 % Computer : n020.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 300
% 0.14/0.34 % DateTime : Mon May 20 08:55:23 EDT 2024
% 0.14/0.34 % CPUTime :
% 0.14/0.34 This is a TH0_THM_NEQ_NAR problem
% 0.14/0.34 Running vampire_ho --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_hol --cores 8 -m 12000 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.14/0.36 % (8012)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.14/0.36 % (8011)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.14/0.36 % (8010)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.14/0.36 % (8012)Refutation not found, incomplete strategy
% 0.14/0.36 % (8012)------------------------------
% 0.14/0.36 % (8012)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.14/0.36 % (8012)Termination reason: Refutation not found, incomplete strategy
% 0.14/0.36
% 0.14/0.36
% 0.14/0.36 % (8012)Memory used [KB]: 5500
% 0.14/0.36 % (8012)Time elapsed: 0.003 s
% 0.14/0.36 % (8012)Instructions burned: 1 (million)
% 0.14/0.36 % (8012)------------------------------
% 0.14/0.36 % (8012)------------------------------
% 0.14/0.37 % (8011)First to succeed.
% 0.14/0.37 % (8010)Also succeeded, but the first one will report.
% 0.14/0.37 % (8011)Refutation found. Thanks to Tanya!
% 0.14/0.37 % SZS status Theorem for theBenchmark
% 0.14/0.37 % SZS output start Proof for theBenchmark
% 0.14/0.37 thf(func_def_4, type, sK0: $o > $o).
% 0.14/0.37 thf(func_def_7, type, ph2: !>[X0: $tType]:(X0)).
% 0.14/0.37 thf(f54,plain,(
% 0.14/0.37 $false),
% 0.14/0.37 inference(trivial_inequality_removal,[],[f53])).
% 0.14/0.37 thf(f53,plain,(
% 0.14/0.37 ($true = $false)),
% 0.14/0.37 inference(boolean_simplification,[],[f52])).
% 0.14/0.37 thf(f52,plain,(
% 0.14/0.37 ($true = ($false & $true))),
% 0.14/0.37 inference(trivial_inequality_removal,[],[f51])).
% 0.14/0.37 thf(f51,plain,(
% 0.14/0.37 ($true = ($false & $true)) | ($true = $false)),
% 0.14/0.37 inference(boolean_simplification,[],[f50])).
% 0.14/0.37 thf(f50,plain,(
% 0.14/0.37 (($true & $false) = $true) | ($true = ($false & $true))),
% 0.14/0.37 inference(trivial_inequality_removal,[],[f49])).
% 0.14/0.37 thf(f49,plain,(
% 0.14/0.37 ($true != $true) | (($true & $false) = $true) | ($true = ($false & $true))),
% 0.14/0.37 inference(boolean_simplification,[],[f48])).
% 0.14/0.37 thf(f48,plain,(
% 0.14/0.37 (($true & $true) != $true) | (($true & $false) = $true) | ($true = ($false & $true))),
% 0.14/0.37 inference(trivial_inequality_removal,[],[f47])).
% 0.14/0.37 thf(f47,plain,(
% 0.14/0.37 ($true = $false) | (($true & $true) != $true) | (($true & $false) = $true) | ($true = ($false & $true))),
% 0.14/0.37 inference(boolean_simplification,[],[f46])).
% 0.14/0.37 thf(f46,plain,(
% 0.14/0.37 ($true = ($false & $false)) | (($true & $true) != $true) | (($true & $false) = $true) | ($true = ($false & $true))),
% 0.14/0.37 inference(beta_eta_normalization,[],[f20])).
% 0.14/0.37 thf(f20,plain,(
% 0.14/0.37 (((^[Y0 : $o]: ((^[Y1 : $o]: (Y1 & Y0)))) @ $false @ $false) = $true) | (((^[Y0 : $o]: ((^[Y1 : $o]: (Y1 & Y0)))) @ $true @ $false) = $true) | ($true = ((^[Y0 : $o]: ((^[Y1 : $o]: (Y1 & Y0)))) @ $false @ $true)) | (((^[Y0 : $o]: ((^[Y1 : $o]: (Y1 & Y0)))) @ $true @ $true) != $true)),
% 0.14/0.37 inference(primitive_instantiation,[],[f13])).
% 0.14/0.37 thf(f13,plain,(
% 0.14/0.37 ( ! [X1 : $o > $o > $o] : (((X1 @ $true @ $true) != $true) | ((X1 @ $false @ $false) = $true) | ((X1 @ $true @ $false) = $true) | ($true = (X1 @ $false @ $true))) )),
% 0.14/0.37 inference(trivial_inequality_removal,[],[f12])).
% 0.14/0.37 thf(f12,plain,(
% 0.14/0.37 ( ! [X1 : $o > $o > $o] : (((X1 @ $false @ $false) = $true) | ((X1 @ $true @ $true) != $true) | ((X1 @ $true @ $false) = $true) | ($true = (X1 @ $false @ $true)) | ((sK0 @ $true) != (sK0 @ $true))) )),
% 0.14/0.37 inference(boolean_simplification,[],[f11])).
% 0.14/0.37 thf(f11,plain,(
% 0.14/0.37 ( ! [X1 : $o > $o > $o] : (((X1 @ $false @ $false) = $true) | ((sK0 @ $true) != (sK0 @ ($true => $true))) | ($true = (X1 @ $false @ $true)) | ((X1 @ $true @ $false) = $true) | ((X1 @ $true @ $true) != $true)) )),
% 0.14/0.37 inference(cnf_transformation,[],[f10])).
% 0.14/0.37 thf(f10,plain,(
% 0.14/0.37 ((sK0 @ $true) != (sK0 @ ($true => $true))) | ! [X1 : $o > $o > $o] : (((X1 @ $false @ $false) = $true) | ($true = (X1 @ $false @ $true)) | ((X1 @ $true @ $true) != $true) | ((X1 @ $true @ $false) = $true))),
% 0.14/0.37 inference(skolemisation,[status(esa),new_symbols(skolem,[sK0])],[f8,f9])).
% 0.14/0.37 thf(f9,plain,(
% 0.14/0.37 ? [X0 : $o > $o] : ((X0 @ $true) != (X0 @ ($true => $true))) => ((sK0 @ $true) != (sK0 @ ($true => $true)))),
% 0.14/0.37 introduced(choice_axiom,[])).
% 0.14/0.37 thf(f8,plain,(
% 0.14/0.37 ? [X0 : $o > $o] : ((X0 @ $true) != (X0 @ ($true => $true))) | ! [X1 : $o > $o > $o] : (((X1 @ $false @ $false) = $true) | ($true = (X1 @ $false @ $true)) | ((X1 @ $true @ $true) != $true) | ((X1 @ $true @ $false) = $true))),
% 0.14/0.37 inference(rectify,[],[f7])).
% 0.14/0.37 thf(f7,plain,(
% 0.14/0.37 ? [X1 : $o > $o] : ((X1 @ $true) != (X1 @ ($true => $true))) | ! [X0 : $o > $o > $o] : (((X0 @ $false @ $false) = $true) | ((X0 @ $false @ $true) = $true) | ((X0 @ $true @ $true) != $true) | ((X0 @ $true @ $false) = $true))),
% 0.14/0.37 inference(ennf_transformation,[],[f6])).
% 0.14/0.37 thf(f6,plain,(
% 0.14/0.37 ~(? [X0 : $o > $o > $o] : (((X0 @ $false @ $true) != $true) & ((X0 @ $true @ $false) != $true) & ((X0 @ $false @ $false) != $true) & ((X0 @ $true @ $true) = $true)) & ! [X1 : $o > $o] : ((X1 @ $true) = (X1 @ ($true => $true))))),
% 0.14/0.37 inference(flattening,[],[f5])).
% 0.14/0.37 thf(f5,plain,(
% 0.14/0.37 ~(? [X0 : $o > $o > $o] : (~((X0 @ $true @ $false) = $true) & ~((X0 @ $false @ $false) = $true) & ((X0 @ $true @ $true) = $true) & ~((X0 @ $false @ $true) = $true)) & ! [X1 : $o > $o] : ((X1 @ $true) = (X1 @ ($true => $true))))),
% 0.14/0.37 inference(fool_elimination,[],[f4])).
% 0.14/0.37 thf(f4,plain,(
% 0.14/0.37 ~(? [X0 : $o > $o > $o] : (~(X0 @ $true @ $false) & ~(X0 @ $false @ $false) & (X0 @ $true @ $true) & ~(X0 @ $false @ $true)) & ! [X1 : $o > $o] : ((X1 @ $true) <=> (X1 @ $true => $true)))),
% 0.14/0.37 inference(rectify,[],[f2])).
% 0.14/0.37 thf(f2,negated_conjecture,(
% 0.14/0.37 ~(? [X0 : $o > $o > $o] : (~(X0 @ $true @ $false) & ~(X0 @ $false @ $false) & (X0 @ $true @ $true) & ~(X0 @ $false @ $true)) & ! [X1 : $o > $o] : ((X1 @ $true) <=> (X1 @ $true => $true)))),
% 0.14/0.37 inference(negated_conjecture,[],[f1])).
% 0.14/0.37 thf(f1,conjecture,(
% 0.14/0.37 ? [X0 : $o > $o > $o] : (~(X0 @ $true @ $false) & ~(X0 @ $false @ $false) & (X0 @ $true @ $true) & ~(X0 @ $false @ $true)) & ! [X1 : $o > $o] : ((X1 @ $true) <=> (X1 @ $true => $true))),
% 0.14/0.37 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cOMEGA_EXAMPLE2)).
% 0.14/0.37 % SZS output end Proof for theBenchmark
% 0.14/0.37 % (8011)------------------------------
% 0.14/0.37 % (8011)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.14/0.37 % (8011)Termination reason: Refutation
% 0.14/0.37
% 0.14/0.37 % (8011)Memory used [KB]: 5500
% 0.14/0.37 % (8011)Time elapsed: 0.005 s
% 0.14/0.37 % (8011)Instructions burned: 3 (million)
% 0.14/0.37 % (8011)------------------------------
% 0.14/0.37 % (8011)------------------------------
% 0.14/0.37 % (8009)Success in time 0.006 s
% 0.14/0.37 % Vampire---4.8 exiting
%------------------------------------------------------------------------------