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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Vampire---4.8
% Problem  : SYO255^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 : n023.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:40 EDT 2024

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

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem    : SYO255^5 : TPTP v8.2.0. Released v4.0.0.
% 0.12/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.13/0.35  % Computer : n023.cluster.edu
% 0.13/0.35  % Model    : x86_64 x86_64
% 0.13/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35  % Memory   : 8042.1875MB
% 0.13/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35  % CPULimit   : 300
% 0.13/0.35  % WCLimit    : 300
% 0.13/0.35  % DateTime   : Mon May 20 10:21:38 EDT 2024
% 0.13/0.35  % CPUTime    : 
% 0.13/0.35  This is a TH0_THM_NEQ_NAR problem
% 0.20/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/sandbox/benchmark/theBenchmark.p
% 0.20/0.37  % (6555)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.20/0.37  % (6554)lrs+1004_1:128_cond=on:e2e=on:sp=weighted_frequency:i=18:si=on:rtra=on_0 on theBenchmark for (3000ds/18Mi)
% 0.20/0.37  % (6555)First to succeed.
% 0.20/0.37  % (6554)Also succeeded, but the first one will report.
% 0.20/0.37  % (6548)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.20/0.37  % (6549)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.20/0.37  % (6552)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.20/0.37  % (6555)Refutation found. Thanks to Tanya!
% 0.20/0.37  % SZS status Theorem for theBenchmark
% 0.20/0.37  % SZS output start Proof for theBenchmark
% 0.20/0.37  thf(func_def_0, type, cP: $i > $o).
% 0.20/0.37  thf(func_def_5, type, sK0: ($i > $o) > $i).
% 0.20/0.37  thf(func_def_8, type, ph2: !>[X0: $tType]:(X0)).
% 0.20/0.37  thf(f28,plain,(
% 0.20/0.37    $false),
% 0.20/0.37    inference(subsumption_resolution,[],[f22,f11])).
% 0.20/0.37  thf(f11,plain,(
% 0.20/0.37    ( ! [X0 : $i > $o,X1 : $i] : (((X0 @ X1) != $true) | ((cP @ (sK0 @ X0)) != $true)) )),
% 0.20/0.37    inference(cnf_transformation,[],[f9])).
% 0.20/0.37  thf(f9,plain,(
% 0.20/0.37    ((cP @ a) = $true) & ! [X0 : $i > $o] : (! [X1] : ((X0 @ X1) != $true) | (((cP @ (sK0 @ X0)) != $true) & ((X0 @ (sK0 @ X0)) = $true)))),
% 0.20/0.37    inference(skolemisation,[status(esa),new_symbols(skolem,[sK0])],[f7,f8])).
% 0.20/0.37  thf(f8,plain,(
% 0.20/0.37    ! [X0 : $i > $o] : (? [X2] : (($true != (cP @ X2)) & ((X0 @ X2) = $true)) => (((cP @ (sK0 @ X0)) != $true) & ((X0 @ (sK0 @ X0)) = $true)))),
% 0.20/0.37    introduced(choice_axiom,[])).
% 0.20/0.37  thf(f7,plain,(
% 0.20/0.37    ((cP @ a) = $true) & ! [X0 : $i > $o] : (! [X1] : ((X0 @ X1) != $true) | ? [X2] : (($true != (cP @ X2)) & ((X0 @ X2) = $true)))),
% 0.20/0.37    inference(rectify,[],[f6])).
% 0.20/0.37  thf(f6,plain,(
% 0.20/0.37    ((cP @ a) = $true) & ! [X0 : $i > $o] : (! [X2] : ((X0 @ X2) != $true) | ? [X1] : (((cP @ X1) != $true) & ((X0 @ X1) = $true)))),
% 0.20/0.37    inference(ennf_transformation,[],[f5])).
% 0.20/0.37  thf(f5,plain,(
% 0.20/0.37    ~(((cP @ a) = $true) => ? [X0 : $i > $o] : (! [X1] : (((X0 @ X1) = $true) => ((cP @ X1) = $true)) & ? [X2] : ((X0 @ X2) = $true)))),
% 0.20/0.37    inference(fool_elimination,[],[f4])).
% 0.20/0.37  thf(f4,plain,(
% 0.20/0.37    ~((cP @ a) => ? [X0 : $i > $o] : (! [X1] : ((X0 @ X1) => (cP @ X1)) & ? [X2] : (X0 @ X2)))),
% 0.20/0.37    inference(rectify,[],[f2])).
% 0.20/0.37  thf(f2,negated_conjecture,(
% 0.20/0.37    ~((cP @ a) => ? [X0 : $i > $o] : (! [X1] : ((X0 @ X1) => (cP @ X1)) & ? [X2] : (X0 @ X2)))),
% 0.20/0.37    inference(negated_conjecture,[],[f1])).
% 0.20/0.37  thf(f1,conjecture,(
% 0.20/0.37    (cP @ a) => ? [X0 : $i > $o] : (! [X1] : ((X0 @ X1) => (cP @ X1)) & ? [X2] : (X0 @ X2))),
% 0.20/0.37    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cBLEDSOE3)).
% 0.20/0.37  thf(f22,plain,(
% 0.20/0.37    ($true = (cP @ (sK0 @ cP)))),
% 0.20/0.37    inference(beta_eta_normalization,[],[f21])).
% 0.20/0.37  thf(f21,plain,(
% 0.20/0.37    (((^[Y0 : $i]: (cP @ ((^[Y1 : $i]: (Y1)) @ Y0))) @ (sK0 @ (^[Y0 : $i]: (cP @ ((^[Y1 : $i]: (Y1)) @ Y0))))) = $true)),
% 0.20/0.37    inference(trivial_inequality_removal,[],[f17])).
% 0.20/0.37  thf(f17,plain,(
% 0.20/0.37    (((^[Y0 : $i]: (cP @ ((^[Y1 : $i]: (Y1)) @ Y0))) @ (sK0 @ (^[Y0 : $i]: (cP @ ((^[Y1 : $i]: (Y1)) @ Y0))))) = $true) | ($true != $true)),
% 0.20/0.37    inference(superposition,[],[f10,f12])).
% 0.20/0.37  thf(f12,plain,(
% 0.20/0.37    ((cP @ a) = $true)),
% 0.20/0.37    inference(cnf_transformation,[],[f9])).
% 0.20/0.37  thf(f10,plain,(
% 0.20/0.37    ( ! [X0 : $i > $o,X1 : $i] : (((X0 @ X1) != $true) | ((X0 @ (sK0 @ X0)) = $true)) )),
% 0.20/0.37    inference(cnf_transformation,[],[f9])).
% 0.20/0.37  % SZS output end Proof for theBenchmark
% 0.20/0.37  % (6555)------------------------------
% 0.20/0.37  % (6555)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.20/0.37  % (6555)Termination reason: Refutation
% 0.20/0.37  
% 0.20/0.37  % (6555)Memory used [KB]: 5500
% 0.20/0.37  % (6555)Time elapsed: 0.003 s
% 0.20/0.37  % (6555)Instructions burned: 1 (million)
% 0.20/0.37  % (6555)------------------------------
% 0.20/0.37  % (6555)------------------------------
% 0.20/0.37  % (6547)Success in time 0.014 s
% 0.20/0.37  % Vampire---4.8 exiting
%------------------------------------------------------------------------------