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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Vampire---4.8
% Problem  : SYO558^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/sandbox2/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s

% Computer : n018.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.22s 0.38s
% Output   : Refutation 0.22s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem    : SYO558^1 : TPTP v8.2.0. Bugfixed v7.5.0.
% 0.14/0.14  % 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.35  % Computer : n018.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 09:39:23 EDT 2024
% 0.14/0.35  % CPUTime    : 
% 0.14/0.35  This is a TH1_THM_EQU_NAR problem
% 0.14/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/sandbox2/benchmark/theBenchmark.p
% 0.22/0.37  % (11640)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.22/0.37  % (11639)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.22/0.37  % (11641)lrs+10_1:1_au=on:inj=on:i=2:si=on:rtra=on_0 on theBenchmark for (3000ds/2Mi)
% 0.22/0.37  % (11643)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.22/0.37  % (11644)lrs+1004_1:128_cond=on:e2e=on:sp=weighted_frequency:i=18:si=on:rtra=on_0 on theBenchmark for (3000ds/18Mi)
% 0.22/0.37  % (11638)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.22/0.37  % (11641)Instruction limit reached!
% 0.22/0.37  % (11641)------------------------------
% 0.22/0.37  % (11641)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.22/0.37  % (11641)Termination reason: Unknown
% 0.22/0.37  % (11641)Termination phase: Saturation
% 0.22/0.37  
% 0.22/0.37  % (11641)Memory used [KB]: 5500
% 0.22/0.37  % (11641)Time elapsed: 0.004 s
% 0.22/0.37  % (11641)Instructions burned: 2 (million)
% 0.22/0.37  % (11641)------------------------------
% 0.22/0.37  % (11641)------------------------------
% 0.22/0.37  % (11643)Refutation not found, incomplete strategy
% 0.22/0.37  % (11643)------------------------------
% 0.22/0.37  % (11643)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.22/0.37  % (11643)Termination reason: Refutation not found, incomplete strategy
% 0.22/0.37  
% 0.22/0.37  
% 0.22/0.37  % (11643)Memory used [KB]: 5500
% 0.22/0.37  % (11643)Time elapsed: 0.004 s
% 0.22/0.37  % (11643)Instructions burned: 2 (million)
% 0.22/0.37  % (11643)------------------------------
% 0.22/0.37  % (11643)------------------------------
% 0.22/0.37  % (11639)Instruction limit reached!
% 0.22/0.37  % (11639)------------------------------
% 0.22/0.37  % (11639)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.22/0.37  % (11639)Termination reason: Unknown
% 0.22/0.37  % (11639)Termination phase: Saturation
% 0.22/0.37  % (11640)First to succeed.
% 0.22/0.37  
% 0.22/0.37  % (11639)Memory used [KB]: 5500
% 0.22/0.37  % (11639)Time elapsed: 0.005 s
% 0.22/0.37  % (11639)Instructions burned: 4 (million)
% 0.22/0.37  % (11639)------------------------------
% 0.22/0.37  % (11639)------------------------------
% 0.22/0.38  % (11642)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.22/0.38  % (11640)Refutation found. Thanks to Tanya!
% 0.22/0.38  % SZS status Theorem for theBenchmark
% 0.22/0.38  % SZS output start Proof for theBenchmark
% 0.22/0.38  thf(func_def_0, type, eps: ($i > $o) > $i).
% 0.22/0.38  thf(func_def_3, type, vEPSILON: !>[X0: $tType]:((X0 > $o) > X0)).
% 0.22/0.38  thf(func_def_11, type, ph1: !>[X0: $tType]:(X0)).
% 0.22/0.38  thf(func_def_12, type, sK2: $i > $o).
% 0.22/0.38  thf(f62,plain,(
% 0.22/0.38    $false),
% 0.22/0.38    inference(avatar_sat_refutation,[],[f27,f36,f41,f45,f55,f61])).
% 0.22/0.38  thf(f61,plain,(
% 0.22/0.38    ~spl0_1 | ~spl0_4),
% 0.22/0.38    inference(avatar_contradiction_clause,[],[f60])).
% 0.22/0.38  thf(f60,plain,(
% 0.22/0.38    $false | (~spl0_1 | ~spl0_4)),
% 0.22/0.38    inference(trivial_inequality_removal,[],[f57])).
% 0.22/0.38  thf(f57,plain,(
% 0.22/0.38    ($true = $false) | (~spl0_1 | ~spl0_4)),
% 0.22/0.38    inference(superposition,[],[f22,f35])).
% 0.22/0.38  thf(f35,plain,(
% 0.22/0.38    ((sK2 @ sK3) = $false) | ~spl0_4),
% 0.22/0.38    inference(avatar_component_clause,[],[f33])).
% 0.22/0.38  thf(f33,plain,(
% 0.22/0.38    spl0_4 <=> ((sK2 @ sK3) = $false)),
% 0.22/0.38    introduced(avatar_definition,[new_symbols(naming,[spl0_4])])).
% 0.22/0.38  thf(f22,plain,(
% 0.22/0.38    ( ! [X1 : $i] : (((sK2 @ X1) = $true)) ) | ~spl0_1),
% 0.22/0.38    inference(avatar_component_clause,[],[f21])).
% 0.22/0.38  thf(f21,plain,(
% 0.22/0.38    spl0_1 <=> ! [X1] : ((sK2 @ X1) = $true)),
% 0.22/0.38    introduced(avatar_definition,[new_symbols(naming,[spl0_1])])).
% 0.22/0.38  thf(f55,plain,(
% 0.22/0.38    ~spl0_1 | ~spl0_3),
% 0.22/0.38    inference(avatar_contradiction_clause,[],[f54])).
% 0.22/0.38  thf(f54,plain,(
% 0.22/0.38    $false | (~spl0_1 | ~spl0_3)),
% 0.22/0.38    inference(trivial_inequality_removal,[],[f51])).
% 0.22/0.38  thf(f51,plain,(
% 0.22/0.38    ($true = $false) | (~spl0_1 | ~spl0_3)),
% 0.22/0.38    inference(superposition,[],[f31,f22])).
% 0.22/0.38  thf(f31,plain,(
% 0.22/0.38    ((sK2 @ (eps @ (^[Y0 : $i]: (~ (sK2 @ Y0))))) = $false) | ~spl0_3),
% 0.22/0.38    inference(avatar_component_clause,[],[f29])).
% 0.22/0.38  thf(f29,plain,(
% 0.22/0.38    spl0_3 <=> ((sK2 @ (eps @ (^[Y0 : $i]: (~ (sK2 @ Y0))))) = $false)),
% 0.22/0.38    introduced(avatar_definition,[new_symbols(naming,[spl0_3])])).
% 0.22/0.38  thf(f45,plain,(
% 0.22/0.38    ~spl0_2 | ~spl0_3),
% 0.22/0.38    inference(avatar_contradiction_clause,[],[f44])).
% 0.22/0.38  thf(f44,plain,(
% 0.22/0.38    $false | (~spl0_2 | ~spl0_3)),
% 0.22/0.38    inference(trivial_inequality_removal,[],[f42])).
% 0.22/0.38  thf(f42,plain,(
% 0.22/0.38    ($true = $false) | (~spl0_2 | ~spl0_3)),
% 0.22/0.38    inference(backward_demodulation,[],[f26,f31])).
% 0.22/0.38  thf(f26,plain,(
% 0.22/0.38    ((sK2 @ (eps @ (^[Y0 : $i]: (~ (sK2 @ Y0))))) = $true) | ~spl0_2),
% 0.22/0.38    inference(avatar_component_clause,[],[f24])).
% 0.22/0.38  thf(f24,plain,(
% 0.22/0.38    spl0_2 <=> ((sK2 @ (eps @ (^[Y0 : $i]: (~ (sK2 @ Y0))))) = $true)),
% 0.22/0.38    introduced(avatar_definition,[new_symbols(naming,[spl0_2])])).
% 0.22/0.38  thf(f41,plain,(
% 0.22/0.38    spl0_3 | spl0_1),
% 0.22/0.38    inference(avatar_split_clause,[],[f40,f21,f29])).
% 0.22/0.38  thf(f40,plain,(
% 0.22/0.38    ( ! [X1 : $i] : (((sK2 @ X1) = $true) | ((sK2 @ (eps @ (^[Y0 : $i]: (~ (sK2 @ Y0))))) = $false)) )),
% 0.22/0.38    inference(not_proxy_clausification,[],[f39])).
% 0.22/0.38  thf(f39,plain,(
% 0.22/0.38    ( ! [X1 : $i] : (((~ (sK2 @ X1)) = $false) | ((sK2 @ (eps @ (^[Y0 : $i]: (~ (sK2 @ Y0))))) = $false)) )),
% 0.22/0.38    inference(not_proxy_clausification,[],[f38])).
% 0.22/0.38  thf(f38,plain,(
% 0.22/0.38    ( ! [X1 : $i] : (((~ (sK2 @ (eps @ (^[Y0 : $i]: (~ (sK2 @ Y0)))))) = $true) | ((~ (sK2 @ X1)) = $false)) )),
% 0.22/0.38    inference(beta_eta_normalization,[],[f37])).
% 0.22/0.38  thf(f37,plain,(
% 0.22/0.38    ( ! [X1 : $i] : ((((^[Y0 : $i]: (~ (sK2 @ Y0))) @ X1) = $false) | ($true = ((^[Y0 : $i]: (~ (sK2 @ Y0))) @ (eps @ (^[Y0 : $i]: (~ (sK2 @ Y0))))))) )),
% 0.22/0.38    introduced(choice_axiom,[])).
% 0.22/0.38  thf(f36,plain,(
% 0.22/0.38    spl0_3 | spl0_4),
% 0.22/0.38    inference(avatar_split_clause,[],[f18,f33,f29])).
% 0.22/0.38  thf(f18,plain,(
% 0.22/0.38    ((sK2 @ sK3) = $false) | ((sK2 @ (eps @ (^[Y0 : $i]: (~ (sK2 @ Y0))))) = $false)),
% 0.22/0.38    inference(sigma_clausification,[],[f17])).
% 0.22/0.38  thf(f17,plain,(
% 0.22/0.38    ((sK2 @ (eps @ (^[Y0 : $i]: (~ (sK2 @ Y0))))) = $false) | ((!! @ $i @ sK2) = $false)),
% 0.22/0.38    inference(binary_proxy_clausification,[],[f15])).
% 0.22/0.38  thf(f15,plain,(
% 0.22/0.38    ((sK2 @ (eps @ (^[Y0 : $i]: (~ (sK2 @ Y0))))) != (!! @ $i @ sK2))),
% 0.22/0.38    inference(beta_eta_normalization,[],[f14])).
% 0.22/0.38  thf(f14,plain,(
% 0.22/0.38    ((!! @ $i @ sK2) != ((^[Y0 : $i > $o]: (Y0 @ (eps @ (^[Y1 : $i]: (~ (Y0 @ Y1)))))) @ sK2))),
% 0.22/0.38    inference(negative_extensionality,[],[f13])).
% 0.22/0.38  thf(f13,plain,(
% 0.22/0.38    (!! @ $i != (^[Y0 : $i > $o]: (Y0 @ (eps @ (^[Y1 : $i]: (~ (Y0 @ Y1)))))))),
% 0.22/0.38    inference(beta_eta_normalization,[],[f12])).
% 0.22/0.38  thf(f12,plain,(
% 0.22/0.38    ((^[Y0 : $i > $o]: (!! @ $i @ Y0)) != (^[Y0 : $i > $o]: (Y0 @ (eps @ (^[Y1 : $i]: (~ (Y0 @ Y1)))))))),
% 0.22/0.38    inference(cnf_transformation,[],[f9])).
% 0.22/0.38  thf(f9,plain,(
% 0.22/0.38    ((^[Y0 : $i > $o]: (!! @ $i @ Y0)) != (^[Y0 : $i > $o]: (Y0 @ (eps @ (^[Y1 : $i]: (~ (Y0 @ Y1)))))))),
% 0.22/0.38    inference(flattening,[],[f6])).
% 0.22/0.38  thf(f6,plain,(
% 0.22/0.38    ~((^[Y0 : $i > $o]: (!! @ $i @ Y0)) = (^[Y0 : $i > $o]: (Y0 @ (eps @ (^[Y1 : $i]: (~ (Y0 @ Y1)))))))),
% 0.22/0.38    inference(fool_elimination,[],[f5])).
% 0.22/0.38  thf(f5,plain,(
% 0.22/0.38    ~((^[X0 : $i > $o] : (!! @ $i @ X0)) = (^[X1 : $i > $o] : (X1 @ (eps @ (^[X2 : $i] : (~(X1 @ X2)))))))),
% 0.22/0.38    inference(rectify,[],[f3])).
% 0.22/0.38  thf(f3,negated_conjecture,(
% 0.22/0.38    ~((^[X0 : $i > $o] : (!! @ $i @ X0)) = (^[X0 : $i > $o] : (X0 @ (eps @ (^[X1 : $i] : (~(X0 @ X1)))))))),
% 0.22/0.38    inference(negated_conjecture,[],[f2])).
% 0.22/0.38  thf(f2,conjecture,(
% 0.22/0.38    ((^[X0 : $i > $o] : (!! @ $i @ X0)) = (^[X0 : $i > $o] : (X0 @ (eps @ (^[X1 : $i] : (~(X0 @ X1)))))))),
% 0.22/0.38    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',conj)).
% 0.22/0.38  thf(f27,plain,(
% 0.22/0.38    spl0_1 | spl0_2),
% 0.22/0.38    inference(avatar_split_clause,[],[f19,f24,f21])).
% 0.22/0.38  thf(f19,plain,(
% 0.22/0.38    ( ! [X1 : $i] : (((sK2 @ X1) = $true) | ((sK2 @ (eps @ (^[Y0 : $i]: (~ (sK2 @ Y0))))) = $true)) )),
% 0.22/0.38    inference(pi_clausification,[],[f16])).
% 0.22/0.38  thf(f16,plain,(
% 0.22/0.38    ((sK2 @ (eps @ (^[Y0 : $i]: (~ (sK2 @ Y0))))) = $true) | ((!! @ $i @ sK2) = $true)),
% 0.22/0.38    inference(binary_proxy_clausification,[],[f15])).
% 0.22/0.38  % SZS output end Proof for theBenchmark
% 0.22/0.38  % (11640)------------------------------
% 0.22/0.38  % (11640)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.22/0.38  % (11640)Termination reason: Refutation
% 0.22/0.38  
% 0.22/0.38  % (11640)Memory used [KB]: 5500
% 0.22/0.38  % (11640)Time elapsed: 0.006 s
% 0.22/0.38  % (11640)Instructions burned: 2 (million)
% 0.22/0.38  % (11640)------------------------------
% 0.22/0.38  % (11640)------------------------------
% 0.22/0.38  % (11637)Success in time 0.006 s
% 0.22/0.38  % Vampire---4.8 exiting
%------------------------------------------------------------------------------