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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Vampire---4.8
% Problem  : SYO010^1 : TPTP v8.2.0. Released v3.7.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:02:12 EDT 2024

% Result   : Theorem 0.13s 0.37s
% Output   : Refutation 0.13s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem    : SYO010^1 : TPTP v8.2.0. Released v3.7.0.
% 0.07/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.13/0.34  % Computer : n018.cluster.edu
% 0.13/0.34  % Model    : x86_64 x86_64
% 0.13/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34  % Memory   : 8042.1875MB
% 0.13/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34  % CPULimit   : 300
% 0.13/0.34  % WCLimit    : 300
% 0.13/0.34  % DateTime   : Mon May 20 10:56:08 EDT 2024
% 0.13/0.34  % CPUTime    : 
% 0.13/0.34  This is a TH0_THM_EQU_NAR problem
% 0.13/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.13/0.36  % (7827)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.13/0.36  % (7828)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.13/0.36  % (7831)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.13/0.36  % (7832)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.13/0.37  % (7831)Instruction limit reached!
% 0.13/0.37  % (7831)------------------------------
% 0.13/0.37  % (7831)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.13/0.37  % (7831)Termination reason: Unknown
% 0.13/0.37  % (7831)Termination phase: Saturation
% 0.13/0.37  
% 0.13/0.37  % (7831)Memory used [KB]: 5373
% 0.13/0.37  % (7831)Time elapsed: 0.003 s
% 0.13/0.37  % (7831)Instructions burned: 2 (million)
% 0.13/0.37  % (7831)------------------------------
% 0.13/0.37  % (7831)------------------------------
% 0.13/0.37  % (7832)Refutation not found, incomplete strategy
% 0.13/0.37  % (7832)------------------------------
% 0.13/0.37  % (7832)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.13/0.37  % (7832)Termination reason: Refutation not found, incomplete strategy
% 0.13/0.37  
% 0.13/0.37  
% 0.13/0.37  % (7832)Memory used [KB]: 5500
% 0.13/0.37  % (7832)Time elapsed: 0.003 s
% 0.13/0.37  % (7832)Instructions burned: 1 (million)
% 0.13/0.37  % (7832)------------------------------
% 0.13/0.37  % (7832)------------------------------
% 0.13/0.37  % (7828)Instruction limit reached!
% 0.13/0.37  % (7828)------------------------------
% 0.13/0.37  % (7828)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.13/0.37  % (7828)Termination reason: Unknown
% 0.13/0.37  % (7828)Termination phase: Saturation
% 0.13/0.37  
% 0.13/0.37  % (7828)Memory used [KB]: 5500
% 0.13/0.37  % (7827)First to succeed.
% 0.13/0.37  % (7828)Time elapsed: 0.005 s
% 0.13/0.37  % (7828)Instructions burned: 4 (million)
% 0.13/0.37  % (7828)------------------------------
% 0.13/0.37  % (7828)------------------------------
% 0.13/0.37  % (7829)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.13/0.37  % (7827)Refutation found. Thanks to Tanya!
% 0.13/0.37  % SZS status Theorem for theBenchmark
% 0.13/0.37  % SZS output start Proof for theBenchmark
% 0.13/0.37  thf(func_def_0, type, leibeq: $i > $i > $o).
% 0.13/0.37  thf(func_def_2, type, p: ($i > $i) > $o).
% 0.13/0.37  thf(func_def_3, type, f: $i > $i).
% 0.13/0.37  thf(func_def_14, type, ph1: !>[X0: $tType]:(X0)).
% 0.13/0.37  thf(f54,plain,(
% 0.13/0.37    $false),
% 0.13/0.37    inference(trivial_inequality_removal,[],[f52])).
% 0.13/0.37  thf(f52,plain,(
% 0.13/0.37    (sK2 != sK2)),
% 0.13/0.37    inference(superposition,[],[f24,f26])).
% 0.13/0.37  thf(f26,plain,(
% 0.13/0.37    ( ! [X0 : $i] : (((f @ X0) = X0)) )),
% 0.13/0.37    inference(leibniz_equality_elimination,[],[f19])).
% 0.13/0.37  thf(f19,plain,(
% 0.13/0.37    ( ! [X0 : $i,X1 : $i > $o] : (($false = (X1 @ (f @ X0))) | ($true = (X1 @ X0))) )),
% 0.13/0.37    inference(binary_proxy_clausification,[],[f18])).
% 0.13/0.37  thf(f18,plain,(
% 0.13/0.37    ( ! [X0 : $i,X1 : $i > $o] : ((((X1 @ (f @ X0)) => (X1 @ X0)) = $true)) )),
% 0.13/0.37    inference(beta_eta_normalization,[],[f17])).
% 0.13/0.37  thf(f17,plain,(
% 0.13/0.37    ( ! [X0 : $i,X1 : $i > $o] : ((((^[Y0 : $i > $o]: ((Y0 @ (f @ X0)) => (Y0 @ X0))) @ X1) = $true)) )),
% 0.13/0.37    inference(pi_clausification,[],[f16])).
% 0.13/0.37  thf(f16,plain,(
% 0.13/0.37    ( ! [X0 : $i] : (($true = (!! @ ($i > $o) @ (^[Y0 : $i > $o]: ((Y0 @ (f @ X0)) => (Y0 @ X0)))))) )),
% 0.13/0.37    inference(beta_eta_normalization,[],[f15])).
% 0.13/0.37  thf(f15,plain,(
% 0.13/0.37    ( ! [X0 : $i] : ((((^[Y0 : $i]: ((^[Y1 : $i]: (!! @ ($i > $o) @ (^[Y2 : $i > $o]: ((Y2 @ Y0) => (Y2 @ Y1))))))) @ (f @ X0) @ X0) = $true)) )),
% 0.13/0.37    inference(definition_unfolding,[],[f12,f11])).
% 0.13/0.37  thf(f11,plain,(
% 0.13/0.37    (leibeq = (^[Y0 : $i]: ((^[Y1 : $i]: (!! @ ($i > $o) @ (^[Y2 : $i > $o]: ((Y2 @ Y0) => (Y2 @ Y1))))))))),
% 0.13/0.37    inference(cnf_transformation,[],[f6])).
% 0.13/0.37  thf(f6,plain,(
% 0.13/0.37    (leibeq = (^[Y0 : $i]: ((^[Y1 : $i]: (!! @ ($i > $o) @ (^[Y2 : $i > $o]: ((Y2 @ Y0) => (Y2 @ Y1))))))))),
% 0.13/0.37    inference(fool_elimination,[],[f5])).
% 0.13/0.37  thf(f5,plain,(
% 0.13/0.37    (leibeq = (^[X0 : $i, X1 : $i] : (! [X2 : $i > $o] : ((X2 @ X0) => (X2 @ X1)))))),
% 0.13/0.37    inference(rectify,[],[f1])).
% 0.13/0.37  thf(f1,axiom,(
% 0.13/0.37    (leibeq = (^[X0 : $i, X1 : $i] : (! [X2 : $i > $o] : ((X2 @ X0) => (X2 @ X1)))))),
% 0.13/0.37    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',leibeq)).
% 0.13/0.37  thf(f12,plain,(
% 0.13/0.37    ( ! [X0 : $i] : (((leibeq @ (f @ X0) @ X0) = $true)) )),
% 0.13/0.37    inference(cnf_transformation,[],[f10])).
% 0.13/0.37  thf(f10,plain,(
% 0.13/0.37    ((p @ (^[Y0 : $i]: (Y0))) = $true) & ((p @ (^[Y0 : $i]: (f @ Y0))) != $true) & ! [X0] : ((leibeq @ (f @ X0) @ X0) = $true)),
% 0.13/0.37    inference(flattening,[],[f9])).
% 0.13/0.37  thf(f9,plain,(
% 0.13/0.37    ((p @ (^[Y0 : $i]: (f @ Y0))) != $true) & (! [X0] : ((leibeq @ (f @ X0) @ X0) = $true) & ((p @ (^[Y0 : $i]: (Y0))) = $true))),
% 0.13/0.37    inference(ennf_transformation,[],[f8])).
% 0.13/0.37  thf(f8,plain,(
% 0.13/0.37    ~((! [X0] : ((leibeq @ (f @ X0) @ X0) = $true) & ((p @ (^[Y0 : $i]: (Y0))) = $true)) => ((p @ (^[Y0 : $i]: (f @ Y0))) = $true))),
% 0.13/0.37    inference(fool_elimination,[],[f7])).
% 0.13/0.37  thf(f7,plain,(
% 0.13/0.37    ~((! [X0] : (leibeq @ (f @ X0) @ X0) & (p @ (^[X1 : $i] : (X1)))) => (p @ (^[X2 : $i] : (f @ X2))))),
% 0.13/0.37    inference(rectify,[],[f3])).
% 0.13/0.37  thf(f3,negated_conjecture,(
% 0.13/0.37    ~((! [X3] : (leibeq @ (f @ X3) @ X3) & (p @ (^[X3 : $i] : (X3)))) => (p @ (^[X3 : $i] : (f @ X3))))),
% 0.13/0.37    inference(negated_conjecture,[],[f2])).
% 0.13/0.37  thf(f2,conjecture,(
% 0.13/0.37    (! [X3] : (leibeq @ (f @ X3) @ X3) & (p @ (^[X3 : $i] : (X3)))) => (p @ (^[X3 : $i] : (f @ X3)))),
% 0.13/0.37    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',conj)).
% 0.13/0.37  thf(f24,plain,(
% 0.13/0.37    ((f @ sK2) != sK2)),
% 0.13/0.37    inference(beta_eta_normalization,[],[f23])).
% 0.13/0.37  thf(f23,plain,(
% 0.13/0.37    ((f @ sK2) != ((^[Y0 : $i]: (Y0)) @ sK2))),
% 0.13/0.37    inference(negative_extensionality,[],[f22])).
% 0.13/0.37  thf(f22,plain,(
% 0.13/0.37    (f != (^[Y0 : $i]: (Y0)))),
% 0.13/0.37    inference(trivial_inequality_removal,[],[f21])).
% 0.13/0.37  thf(f21,plain,(
% 0.13/0.37    (f != (^[Y0 : $i]: (Y0))) | ($true != $true)),
% 0.13/0.37    inference(constrained_superposition,[],[f20,f14])).
% 0.13/0.37  thf(f14,plain,(
% 0.13/0.37    ((p @ (^[Y0 : $i]: (Y0))) = $true)),
% 0.13/0.37    inference(cnf_transformation,[],[f10])).
% 0.13/0.37  thf(f20,plain,(
% 0.13/0.37    ($true != (p @ f))),
% 0.13/0.37    inference(beta_eta_normalization,[],[f13])).
% 0.13/0.37  thf(f13,plain,(
% 0.13/0.37    ((p @ (^[Y0 : $i]: (f @ Y0))) != $true)),
% 0.13/0.37    inference(cnf_transformation,[],[f10])).
% 0.13/0.37  % SZS output end Proof for theBenchmark
% 0.13/0.37  % (7827)------------------------------
% 0.13/0.37  % (7827)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.13/0.37  % (7827)Termination reason: Refutation
% 0.13/0.37  
% 0.13/0.37  % (7827)Memory used [KB]: 5500
% 0.13/0.37  % (7827)Time elapsed: 0.006 s
% 0.13/0.37  % (7827)Instructions burned: 4 (million)
% 0.13/0.37  % (7827)------------------------------
% 0.13/0.37  % (7827)------------------------------
% 0.13/0.37  % (7826)Success in time 0.006 s
% 0.13/0.37  % Vampire---4.8 exiting
%------------------------------------------------------------------------------