TSTP Solution File: SYO310^5 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SYO310^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/sandbox/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% Computer : n011.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.20s 0.38s
% Output : Refutation 0.20s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.02/0.12 % Problem : SYO310^5 : TPTP v8.2.0. Released v4.0.0.
% 0.13/0.14 % Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% 0.14/0.35 % Computer : n011.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Mon May 20 10:14:22 EDT 2024
% 0.14/0.35 % CPUTime :
% 0.14/0.35 This is a TH0_THM_NEQ_NAR problem
% 0.20/0.35 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/sandbox/benchmark/theBenchmark.p
% 0.20/0.37 % (19281)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.20/0.37 % (19285)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.20/0.37 % (19281)First to succeed.
% 0.20/0.37 % (19285)Instruction limit reached!
% 0.20/0.37 % (19285)------------------------------
% 0.20/0.37 % (19285)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.20/0.37 % (19285)Termination reason: Unknown
% 0.20/0.37 % (19285)Termination phase: Saturation
% 0.20/0.37
% 0.20/0.37 % (19285)Memory used [KB]: 5373
% 0.20/0.37 % (19285)Time elapsed: 0.003 s
% 0.20/0.37 % (19285)Instructions burned: 2 (million)
% 0.20/0.37 % (19285)------------------------------
% 0.20/0.37 % (19285)------------------------------
% 0.20/0.37 % (19288)lrs+10_1:1_bet=on:cnfonf=off:fd=off:hud=5:inj=on:i=3:si=on:rtra=on_0 on theBenchmark for (3000ds/3Mi)
% 0.20/0.37 % (19287)lrs+1004_1:128_cond=on:e2e=on:sp=weighted_frequency:i=18:si=on:rtra=on_0 on theBenchmark for (3000ds/18Mi)
% 0.20/0.38 % (19281)Refutation found. Thanks to Tanya!
% 0.20/0.38 % SZS status Theorem for theBenchmark
% 0.20/0.38 % SZS output start Proof for theBenchmark
% 0.20/0.38 thf(func_def_4, type, sK0: $o > $o).
% 0.20/0.38 thf(func_def_7, type, ph2: !>[X0: $tType]:(X0)).
% 0.20/0.38 thf(f48,plain,(
% 0.20/0.38 $false),
% 0.20/0.38 inference(trivial_inequality_removal,[],[f47])).
% 0.20/0.38 thf(f47,plain,(
% 0.20/0.38 ($false = $true)),
% 0.20/0.38 inference(equality_proxy_clausification,[],[f46])).
% 0.20/0.38 thf(f46,plain,(
% 0.20/0.38 (($true = $false) = $true)),
% 0.20/0.38 inference(trivial_inequality_removal,[],[f45])).
% 0.20/0.38 thf(f45,plain,(
% 0.20/0.38 ($false = $true) | (($true = $false) = $true)),
% 0.20/0.38 inference(equality_proxy_clausification,[],[f44])).
% 0.20/0.38 thf(f44,plain,(
% 0.20/0.38 (($false = $true) = $true) | (($true = $false) = $true)),
% 0.20/0.38 inference(trivial_inequality_removal,[],[f43])).
% 0.20/0.38 thf(f43,plain,(
% 0.20/0.38 (($false = $true) = $true) | ($true != $true) | (($true = $false) = $true)),
% 0.20/0.38 inference(boolean_simplification,[],[f42])).
% 0.20/0.38 thf(f42,plain,(
% 0.20/0.38 (($false = $true) = $true) | (($true = $false) = $true) | (($false = $false) != $true)),
% 0.20/0.38 inference(trivial_inequality_removal,[],[f41])).
% 0.20/0.38 thf(f41,plain,(
% 0.20/0.38 (($false = $true) = $true) | (($false = $false) != $true) | (($true = $false) = $true) | ($true != $true)),
% 0.20/0.38 inference(boolean_simplification,[],[f40])).
% 0.20/0.38 thf(f40,plain,(
% 0.20/0.38 (($false = $true) = $true) | (($true = $false) = $true) | (($true = $true) != $true) | (($false = $false) != $true)),
% 0.20/0.38 inference(beta_eta_normalization,[],[f16])).
% 0.20/0.38 thf(f16,plain,(
% 0.20/0.38 (((^[Y0 : $o]: ((^[Y1 : $o]: (Y1 = Y0)))) @ $true @ $true) != $true) | (((^[Y0 : $o]: ((^[Y1 : $o]: (Y1 = Y0)))) @ $true @ $false) = $true) | (((^[Y0 : $o]: ((^[Y1 : $o]: (Y1 = Y0)))) @ $false @ $true) = $true) | (((^[Y0 : $o]: ((^[Y1 : $o]: (Y1 = Y0)))) @ $false @ $false) != $true)),
% 0.20/0.38 inference(primitive_instantiation,[],[f13])).
% 0.20/0.38 thf(f13,plain,(
% 0.20/0.38 ( ! [X0 : $o > $o > $o] : (($true = (X0 @ $false @ $true)) | ((X0 @ $true @ $true) != $true) | ((X0 @ $true @ $false) = $true) | ((X0 @ $false @ $false) != $true)) )),
% 0.20/0.38 inference(trivial_inequality_removal,[],[f12])).
% 0.20/0.38 thf(f12,plain,(
% 0.20/0.38 ( ! [X0 : $o > $o > $o] : (((sK0 @ $true) != (sK0 @ $true)) | ((X0 @ $false @ $false) != $true) | ((X0 @ $true @ $false) = $true) | ((X0 @ $true @ $true) != $true) | ($true = (X0 @ $false @ $true))) )),
% 0.20/0.38 inference(boolean_simplification,[],[f11])).
% 0.20/0.38 thf(f11,plain,(
% 0.20/0.38 ( ! [X0 : $o > $o > $o] : (((X0 @ $true @ $false) = $true) | ((sK0 @ $true) != (sK0 @ ($true => $true))) | ((X0 @ $true @ $true) != $true) | ($true = (X0 @ $false @ $true)) | ((X0 @ $false @ $false) != $true)) )),
% 0.20/0.38 inference(cnf_transformation,[],[f10])).
% 0.20/0.38 thf(f10,plain,(
% 0.20/0.38 ! [X0 : $o > $o > $o] : (((X0 @ $false @ $false) != $true) | ($true = (X0 @ $false @ $true)) | ((X0 @ $true @ $false) = $true) | ((X0 @ $true @ $true) != $true)) | ((sK0 @ $true) != (sK0 @ ($true => $true)))),
% 0.20/0.38 inference(skolemisation,[status(esa),new_symbols(skolem,[sK0])],[f8,f9])).
% 0.20/0.38 thf(f9,plain,(
% 0.20/0.38 ? [X1 : $o > $o] : ((X1 @ ($true => $true)) != (X1 @ $true)) => ((sK0 @ $true) != (sK0 @ ($true => $true)))),
% 0.20/0.38 introduced(choice_axiom,[])).
% 0.20/0.38 thf(f8,plain,(
% 0.20/0.38 ! [X0 : $o > $o > $o] : (((X0 @ $false @ $false) != $true) | ($true = (X0 @ $false @ $true)) | ((X0 @ $true @ $false) = $true) | ((X0 @ $true @ $true) != $true)) | ? [X1 : $o > $o] : ((X1 @ ($true => $true)) != (X1 @ $true))),
% 0.20/0.38 inference(rectify,[],[f7])).
% 0.20/0.38 thf(f7,plain,(
% 0.20/0.38 ! [X1 : $o > $o > $o] : (((X1 @ $false @ $false) != $true) | ((X1 @ $false @ $true) = $true) | ((X1 @ $true @ $false) = $true) | ($true != (X1 @ $true @ $true))) | ? [X0 : $o > $o] : ((X0 @ ($true => $true)) != (X0 @ $true))),
% 0.20/0.38 inference(ennf_transformation,[],[f6])).
% 0.20/0.38 thf(f6,plain,(
% 0.20/0.38 ~(? [X1 : $o > $o > $o] : (((X1 @ $false @ $true) != $true) & ((X1 @ $true @ $false) != $true) & ((X1 @ $false @ $false) = $true) & ($true = (X1 @ $true @ $true))) & ! [X0 : $o > $o] : ((X0 @ ($true => $true)) = (X0 @ $true)))),
% 0.20/0.38 inference(flattening,[],[f5])).
% 0.20/0.38 thf(f5,plain,(
% 0.20/0.38 ~(! [X0 : $o > $o] : ((X0 @ ($true => $true)) = (X0 @ $true)) & ? [X1 : $o > $o > $o] : (~((X1 @ $true @ $false) = $true) & ($true = (X1 @ $true @ $true)) & ~((X1 @ $false @ $true) = $true) & ((X1 @ $false @ $false) = $true)))),
% 0.20/0.38 inference(fool_elimination,[],[f4])).
% 0.20/0.38 thf(f4,plain,(
% 0.20/0.38 ~(! [X0 : $o > $o] : ((X0 @ $true => $true) <=> (X0 @ $true)) & ? [X1 : $o > $o > $o] : (~(X1 @ $true @ $false) & (X1 @ $true @ $true) & ~(X1 @ $false @ $true) & (X1 @ $false @ $false)))),
% 0.20/0.38 inference(rectify,[],[f2])).
% 0.20/0.38 thf(f2,negated_conjecture,(
% 0.20/0.38 ~(! [X1 : $o > $o] : ((X1 @ $true => $true) <=> (X1 @ $true)) & ? [X0 : $o > $o > $o] : (~(X0 @ $true @ $false) & (X0 @ $true @ $true) & ~(X0 @ $false @ $true) & (X0 @ $false @ $false)))),
% 0.20/0.38 inference(negated_conjecture,[],[f1])).
% 0.20/0.38 thf(f1,conjecture,(
% 0.20/0.38 ! [X1 : $o > $o] : ((X1 @ $true => $true) <=> (X1 @ $true)) & ? [X0 : $o > $o > $o] : (~(X0 @ $true @ $false) & (X0 @ $true @ $true) & ~(X0 @ $false @ $true) & (X0 @ $false @ $false))),
% 0.20/0.38 file('/export/starexec/sandbox/benchmark/theBenchmark.p',cOMEGA_EXAMPLE)).
% 0.20/0.38 % SZS output end Proof for theBenchmark
% 0.20/0.38 % (19281)------------------------------
% 0.20/0.38 % (19281)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.20/0.38 % (19281)Termination reason: Refutation
% 0.20/0.38
% 0.20/0.38 % (19281)Memory used [KB]: 5500
% 0.20/0.38 % (19281)Time elapsed: 0.005 s
% 0.20/0.38 % (19281)Instructions burned: 2 (million)
% 0.20/0.38 % (19281)------------------------------
% 0.20/0.38 % (19281)------------------------------
% 0.20/0.38 % (19280)Success in time 0.018 s
% 0.20/0.38 % Vampire---4.8 exiting
%------------------------------------------------------------------------------