TSTP Solution File: SEV392^5 by Vampire---4.9

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Vampire---4.9
% Problem  : SEV392^5 : TPTP v8.2.0. Released v4.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_vampire %s %d THM

% Computer : n020.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 : Mon Jun 24 16:03:41 EDT 2024

% Result   : Theorem 0.19s 0.39s
% Output   : Refutation 0.19s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.13  % Problem    : SEV392^5 : TPTP v8.2.0. Released v4.0.0.
% 0.12/0.13  % Command    : run_vampire %s %d THM
% 0.13/0.34  % Computer : n020.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   : Fri Jun 21 19:31:39 EDT 2024
% 0.19/0.34  % CPUTime    : 
% 0.19/0.36  This is a TH0_THM_EQU_NAR problem
% 0.19/0.36  Running higher-order theorem proving
% 0.19/0.36  Running /export/starexec/sandbox/solver/bin/vampire_ho --cores 7 --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_hol /export/starexec/sandbox/benchmark/theBenchmark.p -m 16384 -t 300
% 0.19/0.38  % (24851)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 (2999ds/2Mi)
% 0.19/0.38  % (24848)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 (2999ds/4Mi)
% 0.19/0.38  % (24847)lrs+1002_1:8_bd=off:fd=off:hud=10:tnu=1:i=183:si=on:rtra=on_0 on theBenchmark for (2999ds/183Mi)
% 0.19/0.38  % (24849)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 (2999ds/27Mi)
% 0.19/0.38  % (24850)lrs+10_1:1_au=on:inj=on:i=2:si=on:rtra=on_0 on theBenchmark for (2999ds/2Mi)
% 0.19/0.38  % (24852)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 (2999ds/275Mi)
% 0.19/0.38  % (24853)lrs+1004_1:128_cond=on:e2e=on:sp=weighted_frequency:i=18:si=on:rtra=on_0 on theBenchmark for (2999ds/18Mi)
% 0.19/0.39  % (24850)Instruction limit reached!
% 0.19/0.39  % (24850)------------------------------
% 0.19/0.39  % (24850)Version: Vampire 4.8 (commit 11aac991b on 2023-10-04 16:26:07 +0200)
% 0.19/0.39  % (24851)Instruction limit reached!
% 0.19/0.39  % (24851)------------------------------
% 0.19/0.39  % (24851)Version: Vampire 4.8 (commit 11aac991b on 2023-10-04 16:26:07 +0200)
% 0.19/0.39  % (24850)Termination reason: Unknown
% 0.19/0.39  % (24850)Termination phase: Saturation
% 0.19/0.39  
% 0.19/0.39  % (24850)Memory used [KB]: 5500
% 0.19/0.39  % (24850)Time elapsed: 0.004 s
% 0.19/0.39  % (24850)Instructions burned: 2 (million)
% 0.19/0.39  % (24850)------------------------------
% 0.19/0.39  % (24850)------------------------------
% 0.19/0.39  % (24851)Termination reason: Unknown
% 0.19/0.39  % (24851)Termination phase: Saturation
% 0.19/0.39  
% 0.19/0.39  % (24851)Memory used [KB]: 5500
% 0.19/0.39  % (24851)Time elapsed: 0.004 s
% 0.19/0.39  % (24851)Instructions burned: 2 (million)
% 0.19/0.39  % (24851)------------------------------
% 0.19/0.39  % (24851)------------------------------
% 0.19/0.39  % (24852)First to succeed.
% 0.19/0.39  % (24849)Also succeeded, but the first one will report.
% 0.19/0.39  % (24848)Instruction limit reached!
% 0.19/0.39  % (24848)------------------------------
% 0.19/0.39  % (24848)Version: Vampire 4.8 (commit 11aac991b on 2023-10-04 16:26:07 +0200)
% 0.19/0.39  % (24848)Termination reason: Unknown
% 0.19/0.39  % (24848)Termination phase: Saturation
% 0.19/0.39  
% 0.19/0.39  % (24848)Memory used [KB]: 5500
% 0.19/0.39  % (24848)Time elapsed: 0.006 s
% 0.19/0.39  % (24848)Instructions burned: 4 (million)
% 0.19/0.39  % (24848)------------------------------
% 0.19/0.39  % (24848)------------------------------
% 0.19/0.39  % (24847)Also succeeded, but the first one will report.
% 0.19/0.39  % (24852)Refutation found. Thanks to Tanya!
% 0.19/0.39  % SZS status Theorem for theBenchmark
% 0.19/0.39  % SZS output start Proof for theBenchmark
% 0.19/0.39  thf(func_def_0, type, cS: $i > $o).
% 0.19/0.39  thf(func_def_1, type, cR: $i > $o).
% 0.19/0.39  thf(func_def_11, type, ph2: !>[X0: $tType]:(X0)).
% 0.19/0.39  thf(f29,plain,(
% 0.19/0.39    $false),
% 0.19/0.39    inference(subsumption_resolution,[],[f28,f12])).
% 0.19/0.39  thf(f12,plain,(
% 0.19/0.39    ($true != (cS @ sK0))),
% 0.19/0.39    inference(cnf_transformation,[],[f9])).
% 0.19/0.39  thf(f9,plain,(
% 0.19/0.39    (($true != (cS @ sK0)) & ($true = (cR @ sK0))) & ((^[Y0 : $i]: ((cS @ Y0) & (cR @ Y0))) = (^[Y0 : $i]: ((cS @ Y0) | (cR @ Y0))))),
% 0.19/0.39    inference(skolemisation,[status(esa),new_symbols(skolem,[sK0])],[f7,f8])).
% 0.19/0.39  thf(f8,plain,(
% 0.19/0.39    ? [X0] : (((cS @ X0) != $true) & ((cR @ X0) = $true)) => (($true != (cS @ sK0)) & ($true = (cR @ sK0)))),
% 0.19/0.39    introduced(choice_axiom,[])).
% 0.19/0.39  thf(f7,plain,(
% 0.19/0.39    ? [X0] : (((cS @ X0) != $true) & ((cR @ X0) = $true)) & ((^[Y0 : $i]: ((cS @ Y0) & (cR @ Y0))) = (^[Y0 : $i]: ((cS @ Y0) | (cR @ Y0))))),
% 0.19/0.39    inference(ennf_transformation,[],[f6])).
% 0.19/0.39  thf(f6,plain,(
% 0.19/0.39    ~(((^[Y0 : $i]: ((cS @ Y0) & (cR @ Y0))) = (^[Y0 : $i]: ((cS @ Y0) | (cR @ Y0)))) => ! [X0] : (((cR @ X0) = $true) => ((cS @ X0) = $true)))),
% 0.19/0.39    inference(rectify,[],[f5])).
% 0.19/0.39  thf(f5,plain,(
% 0.19/0.39    ~(((^[Y0 : $i]: ((cS @ Y0) & (cR @ Y0))) = (^[Y0 : $i]: ((cS @ Y0) | (cR @ Y0)))) => ! [X2] : (((cR @ X2) = $true) => ($true = (cS @ X2))))),
% 0.19/0.39    inference(fool_elimination,[],[f4])).
% 0.19/0.39  thf(f4,plain,(
% 0.19/0.39    ~(((^[X0 : $i] : ((cR @ X0) | (cS @ X0))) = (^[X1 : $i] : ((cR @ X1) & (cS @ X1)))) => ! [X2] : ((cR @ X2) => (cS @ X2)))),
% 0.19/0.39    inference(rectify,[],[f2])).
% 0.19/0.39  thf(f2,negated_conjecture,(
% 0.19/0.39    ~(((^[X1 : $i] : ((cR @ X1) | (cS @ X1))) = (^[X0 : $i] : ((cR @ X0) & (cS @ X0)))) => ! [X0] : ((cR @ X0) => (cS @ X0)))),
% 0.19/0.39    inference(negated_conjecture,[],[f1])).
% 0.19/0.39  thf(f1,conjecture,(
% 0.19/0.39    ((^[X1 : $i] : ((cR @ X1) | (cS @ X1))) = (^[X0 : $i] : ((cR @ X0) & (cS @ X0)))) => ! [X0] : ((cR @ X0) => (cS @ X0))),
% 0.19/0.39    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cTHM38_pme)).
% 0.19/0.39  thf(f28,plain,(
% 0.19/0.39    ($true = (cS @ sK0))),
% 0.19/0.39    inference(trivial_inequality_removal,[],[f25])).
% 0.19/0.39  thf(f25,plain,(
% 0.19/0.39    ($true = (cS @ sK0)) | ($true = $false)),
% 0.19/0.39    inference(superposition,[],[f21,f11])).
% 0.19/0.39  thf(f11,plain,(
% 0.19/0.39    ($true = (cR @ sK0))),
% 0.19/0.39    inference(cnf_transformation,[],[f9])).
% 0.19/0.39  thf(f21,plain,(
% 0.19/0.39    ( ! [X1 : $i] : (((cR @ X1) = $false) | ((cS @ X1) = $true)) )),
% 0.19/0.39    inference(binary_proxy_clausification,[],[f20])).
% 0.19/0.39  thf(f20,plain,(
% 0.19/0.39    ( ! [X1 : $i] : (((cS @ X1) = $true) | (((cS @ X1) | (cR @ X1)) = $false)) )),
% 0.19/0.39    inference(binary_proxy_clausification,[],[f15])).
% 0.19/0.39  thf(f15,plain,(
% 0.19/0.39    ( ! [X1 : $i] : (($true = ((cS @ X1) & (cR @ X1))) | (((cS @ X1) | (cR @ X1)) = $false)) )),
% 0.19/0.39    inference(binary_proxy_clausification,[],[f14])).
% 0.19/0.39  thf(f14,plain,(
% 0.19/0.39    ( ! [X1 : $i] : ((((cS @ X1) & (cR @ X1)) = ((cS @ X1) | (cR @ X1)))) )),
% 0.19/0.39    inference(beta_eta_normalization,[],[f13])).
% 0.19/0.39  thf(f13,plain,(
% 0.19/0.39    ( ! [X1 : $i] : ((((^[Y0 : $i]: ((cS @ Y0) | (cR @ Y0))) @ X1) = ((^[Y0 : $i]: ((cS @ Y0) & (cR @ Y0))) @ X1))) )),
% 0.19/0.39    inference(argument_congruence,[],[f10])).
% 0.19/0.39  thf(f10,plain,(
% 0.19/0.39    ((^[Y0 : $i]: ((cS @ Y0) & (cR @ Y0))) = (^[Y0 : $i]: ((cS @ Y0) | (cR @ Y0))))),
% 0.19/0.39    inference(cnf_transformation,[],[f9])).
% 0.19/0.39  % SZS output end Proof for theBenchmark
% 0.19/0.39  % (24852)------------------------------
% 0.19/0.39  % (24852)Version: Vampire 4.8 (commit 11aac991b on 2023-10-04 16:26:07 +0200)
% 0.19/0.39  % (24852)Termination reason: Refutation
% 0.19/0.39  
% 0.19/0.39  % (24852)Memory used [KB]: 5500
% 0.19/0.39  % (24852)Time elapsed: 0.006 s
% 0.19/0.39  % (24852)Instructions burned: 2 (million)
% 0.19/0.39  % (24852)------------------------------
% 0.19/0.39  % (24852)------------------------------
% 0.19/0.39  % (24846)Success in time 0.01 s
%------------------------------------------------------------------------------