TSTP Solution File: SYO557^1 by Vampire---4.8

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Vampire---4.8
% Problem  : SYO557^1 : TPTP v8.2.0. Bugfixed v7.5.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 : n028.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:06:13 EDT 2024

% Result   : Theorem 0.14s 0.38s
% Output   : Refutation 0.14s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem    : SYO557^1 : TPTP v8.2.0. Bugfixed v7.5.0.
% 0.07/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 : n028.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.36  % CPULimit   : 300
% 0.14/0.36  % WCLimit    : 300
% 0.14/0.36  % DateTime   : Mon May 20 10:44:53 EDT 2024
% 0.14/0.36  % CPUTime    : 
% 0.14/0.36  This is a TH1_THM_EQU_NAR problem
% 0.14/0.36  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.14/0.37  % (16061)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.38  % (16061)Instruction limit reached!
% 0.14/0.38  % (16061)------------------------------
% 0.14/0.38  % (16061)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.14/0.38  % (16061)Termination reason: Unknown
% 0.14/0.38  % (16061)Termination phase: Saturation
% 0.14/0.38  
% 0.14/0.38  % (16061)Memory used [KB]: 5500
% 0.14/0.38  % (16061)Time elapsed: 0.004 s
% 0.14/0.38  % (16061)Instructions burned: 4 (million)
% 0.14/0.38  % (16061)------------------------------
% 0.14/0.38  % (16061)------------------------------
% 0.14/0.38  % (16060)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.38  % (16062)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.38  % (16063)lrs+10_1:1_au=on:inj=on:i=2:si=on:rtra=on_0 on theBenchmark for (3000ds/2Mi)
% 0.14/0.38  % (16064)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.14/0.38  % (16065)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.14/0.38  % (16066)lrs+1004_1:128_cond=on:e2e=on:sp=weighted_frequency:i=18:si=on:rtra=on_0 on theBenchmark for (3000ds/18Mi)
% 0.14/0.38  % (16067)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.14/0.38  % (16063)Instruction limit reached!
% 0.14/0.38  % (16063)------------------------------
% 0.14/0.38  % (16063)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.14/0.38  % (16063)Termination reason: Unknown
% 0.14/0.38  % (16064)Instruction limit reached!
% 0.14/0.38  % (16064)------------------------------
% 0.14/0.38  % (16064)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.14/0.38  % (16063)Termination phase: Saturation
% 0.14/0.38  
% 0.14/0.38  % (16063)Memory used [KB]: 5500
% 0.14/0.38  % (16063)Time elapsed: 0.004 s
% 0.14/0.38  % (16063)Instructions burned: 2 (million)
% 0.14/0.38  % (16063)------------------------------
% 0.14/0.38  % (16063)------------------------------
% 0.14/0.38  % (16064)Termination reason: Unknown
% 0.14/0.38  % (16064)Termination phase: Saturation
% 0.14/0.38  
% 0.14/0.38  % (16064)Memory used [KB]: 5500
% 0.14/0.38  % (16064)Time elapsed: 0.004 s
% 0.14/0.38  % (16064)Instructions burned: 2 (million)
% 0.14/0.38  % (16064)------------------------------
% 0.14/0.38  % (16064)------------------------------
% 0.14/0.38  % (16062)First to succeed.
% 0.14/0.38  % (16067)Instruction limit reached!
% 0.14/0.38  % (16067)------------------------------
% 0.14/0.38  % (16067)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.14/0.38  % (16067)Termination reason: Unknown
% 0.14/0.38  % (16067)Termination phase: Saturation
% 0.14/0.38  
% 0.14/0.38  % (16067)Memory used [KB]: 5500
% 0.14/0.38  % (16067)Time elapsed: 0.005 s
% 0.14/0.38  % (16067)Instructions burned: 3 (million)
% 0.14/0.38  % (16067)------------------------------
% 0.14/0.38  % (16067)------------------------------
% 0.14/0.38  % (16065)Also succeeded, but the first one will report.
% 0.14/0.38  % (16062)Refutation found. Thanks to Tanya!
% 0.14/0.38  % SZS status Theorem for theBenchmark
% 0.14/0.38  % SZS output start Proof for theBenchmark
% 0.14/0.38  thf(func_def_0, type, eps: ($i > $o) > $i).
% 0.14/0.38  thf(func_def_3, type, vEPSILON: !>[X0: $tType]:((X0 > $o) > X0)).
% 0.14/0.38  thf(func_def_9, type, ph1: !>[X0: $tType]:(X0)).
% 0.14/0.38  thf(func_def_10, type, sK2: $i > $o).
% 0.14/0.38  thf(f48,plain,(
% 0.14/0.38    $false),
% 0.14/0.38    inference(avatar_sat_refutation,[],[f28,f36,f39,f43,f47])).
% 0.14/0.38  thf(f47,plain,(
% 0.14/0.38    spl0_3 | ~spl0_4),
% 0.14/0.38    inference(avatar_split_clause,[],[f46,f33,f30])).
% 0.14/0.38  thf(f30,plain,(
% 0.14/0.38    spl0_3 <=> ! [X1] : ((sK2 @ X1) = $false)),
% 0.14/0.38    introduced(avatar_definition,[new_symbols(naming,[spl0_3])])).
% 0.14/0.38  thf(f33,plain,(
% 0.14/0.38    spl0_4 <=> ((sK2 @ (eps @ sK2)) = $false)),
% 0.14/0.38    introduced(avatar_definition,[new_symbols(naming,[spl0_4])])).
% 0.14/0.38  thf(f46,plain,(
% 0.14/0.38    ( ! [X1 : $i] : (((sK2 @ X1) = $false)) ) | ~spl0_4),
% 0.14/0.38    inference(trivial_inequality_removal,[],[f45])).
% 0.14/0.38  thf(f45,plain,(
% 0.14/0.38    ( ! [X1 : $i] : (($true = $false) | ((sK2 @ X1) = $false)) ) | ~spl0_4),
% 0.14/0.38    inference(forward_demodulation,[],[f44,f35])).
% 0.14/0.38  thf(f35,plain,(
% 0.14/0.38    ((sK2 @ (eps @ sK2)) = $false) | ~spl0_4),
% 0.14/0.38    inference(avatar_component_clause,[],[f33])).
% 0.14/0.38  thf(f44,plain,(
% 0.14/0.38    ( ! [X1 : $i] : (($true = (sK2 @ (eps @ sK2))) | ((sK2 @ X1) = $false)) )),
% 0.14/0.38    introduced(choice_axiom,[])).
% 0.14/0.38  thf(f43,plain,(
% 0.14/0.38    ~spl0_1 | ~spl0_3),
% 0.14/0.38    inference(avatar_contradiction_clause,[],[f42])).
% 0.14/0.38  thf(f42,plain,(
% 0.14/0.38    $false | (~spl0_1 | ~spl0_3)),
% 0.14/0.38    inference(trivial_inequality_removal,[],[f41])).
% 0.14/0.38  thf(f41,plain,(
% 0.14/0.38    ($true = $false) | (~spl0_1 | ~spl0_3)),
% 0.14/0.38    inference(forward_demodulation,[],[f23,f31])).
% 0.14/0.38  thf(f31,plain,(
% 0.14/0.38    ( ! [X1 : $i] : (((sK2 @ X1) = $false)) ) | ~spl0_3),
% 0.14/0.38    inference(avatar_component_clause,[],[f30])).
% 0.14/0.38  thf(f23,plain,(
% 0.14/0.38    ($true = (sK2 @ (eps @ sK2))) | ~spl0_1),
% 0.14/0.38    inference(avatar_component_clause,[],[f21])).
% 0.14/0.38  thf(f21,plain,(
% 0.14/0.38    spl0_1 <=> ($true = (sK2 @ (eps @ sK2)))),
% 0.14/0.38    introduced(avatar_definition,[new_symbols(naming,[spl0_1])])).
% 0.14/0.38  thf(f39,plain,(
% 0.14/0.38    ~spl0_2 | ~spl0_3),
% 0.14/0.38    inference(avatar_contradiction_clause,[],[f38])).
% 0.14/0.38  thf(f38,plain,(
% 0.14/0.38    $false | (~spl0_2 | ~spl0_3)),
% 0.14/0.38    inference(trivial_inequality_removal,[],[f37])).
% 0.14/0.38  thf(f37,plain,(
% 0.14/0.38    ($true = $false) | (~spl0_2 | ~spl0_3)),
% 0.14/0.38    inference(backward_demodulation,[],[f27,f31])).
% 0.14/0.38  thf(f27,plain,(
% 0.14/0.38    ($true = (sK2 @ sK3)) | ~spl0_2),
% 0.14/0.38    inference(avatar_component_clause,[],[f25])).
% 0.14/0.38  thf(f25,plain,(
% 0.14/0.38    spl0_2 <=> ($true = (sK2 @ sK3))),
% 0.14/0.38    introduced(avatar_definition,[new_symbols(naming,[spl0_2])])).
% 0.14/0.38  thf(f36,plain,(
% 0.14/0.38    spl0_3 | spl0_4),
% 0.14/0.38    inference(avatar_split_clause,[],[f18,f33,f30])).
% 0.14/0.38  thf(f18,plain,(
% 0.14/0.38    ( ! [X1 : $i] : (((sK2 @ (eps @ sK2)) = $false) | ((sK2 @ X1) = $false)) )),
% 0.14/0.38    inference(pi_clausification,[],[f17])).
% 0.14/0.38  thf(f17,plain,(
% 0.14/0.38    ((sK2 @ (eps @ sK2)) = $false) | ((?? @ $i @ sK2) = $false)),
% 0.14/0.38    inference(binary_proxy_clausification,[],[f15])).
% 0.14/0.38  thf(f15,plain,(
% 0.14/0.38    ((?? @ $i @ sK2) != (sK2 @ (eps @ sK2)))),
% 0.14/0.38    inference(beta_eta_normalization,[],[f14])).
% 0.14/0.38  thf(f14,plain,(
% 0.14/0.38    ((?? @ $i @ sK2) != ((^[Y0 : $i > $o]: (Y0 @ (eps @ Y0))) @ sK2))),
% 0.14/0.38    inference(negative_extensionality,[],[f13])).
% 0.14/0.38  thf(f13,plain,(
% 0.14/0.38    (?? @ $i != (^[Y0 : $i > $o]: (Y0 @ (eps @ Y0))))),
% 0.14/0.38    inference(beta_eta_normalization,[],[f11])).
% 0.14/0.38  thf(f11,plain,(
% 0.14/0.38    ((^[Y0 : $i > $o]: (Y0 @ (eps @ Y0))) != (^[Y0 : $i > $o]: (?? @ $i @ Y0)))),
% 0.14/0.38    inference(cnf_transformation,[],[f9])).
% 0.14/0.38  thf(f9,plain,(
% 0.14/0.38    ((^[Y0 : $i > $o]: (Y0 @ (eps @ Y0))) != (^[Y0 : $i > $o]: (?? @ $i @ Y0)))),
% 0.14/0.38    inference(flattening,[],[f8])).
% 0.14/0.38  thf(f8,plain,(
% 0.14/0.38    ~((^[Y0 : $i > $o]: (Y0 @ (eps @ Y0))) = (^[Y0 : $i > $o]: (?? @ $i @ Y0)))),
% 0.14/0.38    inference(fool_elimination,[],[f7])).
% 0.14/0.38  thf(f7,plain,(
% 0.14/0.38    ~((^[X0 : $i > $o] : (?? @ $i @ X0)) = (^[X1 : $i > $o] : (X1 @ (eps @ X1))))),
% 0.14/0.38    inference(rectify,[],[f3])).
% 0.14/0.38  thf(f3,negated_conjecture,(
% 0.14/0.38    ~((^[X0 : $i > $o] : (?? @ $i @ X0)) = (^[X0 : $i > $o] : (X0 @ (eps @ X0))))),
% 0.14/0.38    inference(negated_conjecture,[],[f2])).
% 0.14/0.38  thf(f2,conjecture,(
% 0.14/0.38    ((^[X0 : $i > $o] : (?? @ $i @ X0)) = (^[X0 : $i > $o] : (X0 @ (eps @ X0))))),
% 0.14/0.38    file('/export/starexec/sandbox/benchmark/theBenchmark.p',conj)).
% 0.14/0.38  thf(f28,plain,(
% 0.14/0.38    spl0_1 | spl0_2),
% 0.14/0.38    inference(avatar_split_clause,[],[f19,f25,f21])).
% 0.14/0.38  thf(f19,plain,(
% 0.14/0.38    ($true = (sK2 @ (eps @ sK2))) | ($true = (sK2 @ sK3))),
% 0.14/0.38    inference(sigma_clausification,[],[f16])).
% 0.14/0.38  thf(f16,plain,(
% 0.14/0.38    ($true = (?? @ $i @ sK2)) | ($true = (sK2 @ (eps @ sK2)))),
% 0.14/0.38    inference(binary_proxy_clausification,[],[f15])).
% 0.14/0.38  % SZS output end Proof for theBenchmark
% 0.14/0.38  % (16062)------------------------------
% 0.14/0.38  % (16062)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.14/0.38  % (16062)Termination reason: Refutation
% 0.14/0.38  
% 0.14/0.38  % (16062)Memory used [KB]: 5500
% 0.14/0.38  % (16062)Time elapsed: 0.005 s
% 0.14/0.38  % (16062)Instructions burned: 2 (million)
% 0.14/0.38  % (16062)------------------------------
% 0.14/0.38  % (16062)------------------------------
% 0.14/0.38  % (16059)Success in time 0.005 s
% 0.14/0.38  % Vampire---4.8 exiting
%------------------------------------------------------------------------------