TSTP Solution File: SYO298^5 by Vampire---4.8

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Vampire---4.8
% Problem  : SYO298^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 : n027.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:52 EDT 2024

% Result   : Theorem 0.12s 0.36s
% Output   : Refutation 0.12s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.11  % Problem    : SYO298^5 : TPTP v8.2.0. Released v4.0.0.
% 0.11/0.13  % 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.12/0.34  % Computer : n027.cluster.edu
% 0.12/0.34  % Model    : x86_64 x86_64
% 0.12/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34  % Memory   : 8042.1875MB
% 0.12/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34  % CPULimit   : 300
% 0.12/0.34  % WCLimit    : 300
% 0.12/0.34  % DateTime   : Mon May 20 10:51:52 EDT 2024
% 0.12/0.34  % CPUTime    : 
% 0.12/0.34  This is a TH0_THM_NEQ_NAR problem
% 0.12/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/sandbox/benchmark/theBenchmark.p
% 0.12/0.36  % (2670)lrs+10_1:1_au=on:inj=on:i=2:si=on:rtra=on_0 on theBenchmark for (3000ds/2Mi)
% 0.12/0.36  % (2672)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.12/0.36  % (2671)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.12/0.36  % (2673)lrs+1004_1:128_cond=on:e2e=on:sp=weighted_frequency:i=18:si=on:rtra=on_0 on theBenchmark for (3000ds/18Mi)
% 0.12/0.36  % (2668)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.12/0.36  % (2671)Instruction limit reached!
% 0.12/0.36  % (2671)------------------------------
% 0.12/0.36  % (2671)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.12/0.36  % (2671)Termination reason: Unknown
% 0.12/0.36  % (2671)Termination phase: Saturation
% 0.12/0.36  
% 0.12/0.36  % (2671)Memory used [KB]: 5373
% 0.12/0.36  % (2671)Time elapsed: 0.003 s
% 0.12/0.36  % (2671)Instructions burned: 2 (million)
% 0.12/0.36  % (2671)------------------------------
% 0.12/0.36  % (2671)------------------------------
% 0.12/0.36  % (2672)First to succeed.
% 0.12/0.36  % (2674)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.12/0.36  % (2673)Also succeeded, but the first one will report.
% 0.12/0.36  % (2670)Also succeeded, but the first one will report.
% 0.12/0.36  % (2672)Refutation found. Thanks to Tanya!
% 0.12/0.36  % SZS status Theorem for theBenchmark
% 0.12/0.36  % SZS output start Proof for theBenchmark
% 0.12/0.36  thf(func_def_0, type, q: $i > $i > $o).
% 0.12/0.36  thf(func_def_1, type, p: $i > $i > $o).
% 0.12/0.36  thf(func_def_5, type, sK0: ($i > $o) > $i).
% 0.12/0.36  thf(func_def_6, type, sK1: $i > ($i > $o) > $i).
% 0.12/0.36  thf(func_def_8, type, ph3: !>[X0: $tType]:(X0)).
% 0.12/0.36  thf(f17,plain,(
% 0.12/0.36    $false),
% 0.12/0.36    inference(trivial_inequality_removal,[],[f16])).
% 0.12/0.36  thf(f16,plain,(
% 0.12/0.36    ($false = $true)),
% 0.12/0.36    inference(beta_eta_normalization,[],[f13])).
% 0.12/0.36  thf(f13,plain,(
% 0.12/0.36    ( ! [X2 : $i] : ((((^[Y0 : $i]: ($false)) @ (sK1 @ X2 @ (^[Y0 : $i]: ($false)))) = $true)) )),
% 0.12/0.36    inference(primitive_instantiation,[],[f11])).
% 0.12/0.36  thf(f11,plain,(
% 0.12/0.36    ( ! [X2 : $i,X0 : $i > $o] : (((X0 @ (sK1 @ X2 @ X0)) = $true)) )),
% 0.12/0.36    inference(cnf_transformation,[],[f9])).
% 0.12/0.36  thf(f9,plain,(
% 0.12/0.36    ! [X0 : $i > $o] : ! [X2] : (((X0 @ (sK1 @ X2 @ X0)) = $true) & (((p @ (sK1 @ X2 @ X0) @ X2) != $true) | ((q @ (sK0 @ X0) @ X2) != $true)))),
% 0.12/0.36    inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1])],[f6,f8,f7])).
% 0.12/0.36  thf(f7,plain,(
% 0.12/0.36    ! [X0 : $i > $o] : (? [X1] : ! [X2] : ? [X3] : (((X0 @ X3) = $true) & (((p @ X3 @ X2) != $true) | ((q @ X1 @ X2) != $true))) => ! [X2] : ? [X3] : (((X0 @ X3) = $true) & (((p @ X3 @ X2) != $true) | ((q @ (sK0 @ X0) @ X2) != $true))))),
% 0.12/0.36    introduced(choice_axiom,[])).
% 0.12/0.36  thf(f8,plain,(
% 0.12/0.36    ! [X0 : $i > $o,X2] : (? [X3] : (((X0 @ X3) = $true) & (((p @ X3 @ X2) != $true) | ((q @ (sK0 @ X0) @ X2) != $true))) => (((X0 @ (sK1 @ X2 @ X0)) = $true) & (((p @ (sK1 @ X2 @ X0) @ X2) != $true) | ((q @ (sK0 @ X0) @ X2) != $true))))),
% 0.12/0.36    introduced(choice_axiom,[])).
% 0.12/0.36  thf(f6,plain,(
% 0.12/0.36    ! [X0 : $i > $o] : ? [X1] : ! [X2] : ? [X3] : (((X0 @ X3) = $true) & (((p @ X3 @ X2) != $true) | ((q @ X1 @ X2) != $true)))),
% 0.12/0.36    inference(ennf_transformation,[],[f5])).
% 0.12/0.36  thf(f5,plain,(
% 0.12/0.36    ~? [X0 : $i > $o] : ! [X1] : ? [X2] : ! [X3] : (((X0 @ X3) = $true) => (((p @ X3 @ X2) = $true) & ((q @ X1 @ X2) = $true)))),
% 0.12/0.36    inference(fool_elimination,[],[f4])).
% 0.12/0.36  thf(f4,plain,(
% 0.12/0.36    ~? [X0 : $i > $o] : ! [X1] : ? [X2] : ! [X3] : ((X0 @ X3) => ((q @ X1 @ X2) & (p @ X3 @ X2)))),
% 0.12/0.36    inference(rectify,[],[f2])).
% 0.12/0.36  thf(f2,negated_conjecture,(
% 0.12/0.36    ~? [X0 : $i > $o] : ! [X1] : ? [X2] : ! [X3] : ((X0 @ X3) => ((q @ X1 @ X2) & (p @ X3 @ X2)))),
% 0.12/0.36    inference(negated_conjecture,[],[f1])).
% 0.12/0.36  thf(f1,conjecture,(
% 0.12/0.36    ? [X0 : $i > $o] : ! [X1] : ? [X2] : ! [X3] : ((X0 @ X3) => ((q @ X1 @ X2) & (p @ X3 @ X2)))),
% 0.12/0.36    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cBLEDSOE5B)).
% 0.12/0.36  % SZS output end Proof for theBenchmark
% 0.12/0.36  % (2672)------------------------------
% 0.12/0.36  % (2672)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.12/0.36  % (2672)Termination reason: Refutation
% 0.12/0.36  
% 0.12/0.36  % (2672)Memory used [KB]: 5500
% 0.12/0.36  % (2672)Time elapsed: 0.003 s
% 0.12/0.36  % (2672)Instructions burned: 2 (million)
% 0.12/0.36  % (2672)------------------------------
% 0.12/0.36  % (2672)------------------------------
% 0.12/0.36  % (2666)Success in time 0.015 s
% 0.12/0.36  % Vampire---4.8 exiting
%------------------------------------------------------------------------------