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

View Problem - Process Solution

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

% Computer : n012.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:53 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.08/0.12  % Problem    : SYO084^5 : TPTP v8.2.0. Released v4.0.0.
% 0.08/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 : n012.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 08:36:53 EDT 2024
% 0.14/0.36  % CPUTime    : 
% 0.14/0.36  This is a TH0_THM_NEQ_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/sandbox2/benchmark/theBenchmark.p
% 0.14/0.38  % (10099)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  % (10100)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  % (10104)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  % (10102)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  % (10105)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  % (10098)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  % (10103)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  % (10102)Instruction limit reached!
% 0.14/0.38  % (10102)------------------------------
% 0.14/0.38  % (10102)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.14/0.38  % (10102)Termination reason: Unknown
% 0.14/0.38  % (10102)Termination phase: Saturation
% 0.14/0.38  
% 0.14/0.38  % (10102)Memory used [KB]: 5373
% 0.14/0.38  % (10102)Time elapsed: 0.003 s
% 0.14/0.38  % (10102)Instructions burned: 2 (million)
% 0.14/0.38  % (10102)------------------------------
% 0.14/0.38  % (10102)------------------------------
% 0.14/0.38  % (10100)First to succeed.
% 0.14/0.38  % (10104)Also succeeded, but the first one will report.
% 0.14/0.38  % (10100)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, cP: $i > $i > $i > $o).
% 0.14/0.38  thf(func_def_1, type, k: $i > $i).
% 0.14/0.38  thf(func_def_2, type, h: $i > $i).
% 0.14/0.38  thf(func_def_5, type, vEPSILON: !>[X0: $tType]:((X0 > $o) > X0)).
% 0.14/0.38  thf(func_def_8, type, sK0: $i > $i).
% 0.14/0.38  thf(f14,plain,(
% 0.14/0.38    $false),
% 0.14/0.38    inference(trivial_inequality_removal,[],[f13])).
% 0.14/0.38  thf(f13,plain,(
% 0.14/0.38    ($true != $true)),
% 0.14/0.38    inference(superposition,[],[f10,f12])).
% 0.14/0.38  thf(f12,plain,(
% 0.14/0.38    ($true = (cP @ a @ (sK0 @ a) @ (k @ (sK0 @ a))))),
% 0.14/0.38    inference(trivial_inequality_removal,[],[f11])).
% 0.14/0.38  thf(f11,plain,(
% 0.14/0.38    ($true != $true) | ($true = (cP @ a @ (sK0 @ a) @ (k @ (sK0 @ a))))),
% 0.14/0.38    inference(superposition,[],[f10,f9])).
% 0.14/0.38  thf(f9,plain,(
% 0.14/0.38    ( ! [X0 : $i] : (($true = (cP @ a @ (sK0 @ X0) @ (h @ (sK0 @ X0)))) | ($true = (cP @ X0 @ (sK0 @ X0) @ (k @ (sK0 @ X0))))) )),
% 0.14/0.38    inference(cnf_transformation,[],[f8])).
% 0.14/0.38  thf(f8,plain,(
% 0.14/0.38    ! [X0] : ! [X2] : (($true != (cP @ X0 @ (sK0 @ X0) @ X2)) & (($true = (cP @ X0 @ (sK0 @ X0) @ (k @ (sK0 @ X0)))) | ($true = (cP @ a @ (sK0 @ X0) @ (h @ (sK0 @ X0))))))),
% 0.14/0.38    inference(skolemisation,[status(esa),new_symbols(skolem,[sK0])],[f6,f7])).
% 0.14/0.38  thf(f7,plain,(
% 0.14/0.38    ! [X0] : (? [X1] : ! [X2] : (((cP @ X0 @ X1 @ X2) != $true) & (((cP @ X0 @ X1 @ (k @ X1)) = $true) | ((cP @ a @ X1 @ (h @ X1)) = $true))) => ! [X2] : (($true != (cP @ X0 @ (sK0 @ X0) @ X2)) & (($true = (cP @ X0 @ (sK0 @ X0) @ (k @ (sK0 @ X0)))) | ($true = (cP @ a @ (sK0 @ X0) @ (h @ (sK0 @ X0)))))))),
% 0.14/0.38    introduced(choice_axiom,[])).
% 0.14/0.38  thf(f6,plain,(
% 0.14/0.38    ! [X0] : ? [X1] : ! [X2] : (((cP @ X0 @ X1 @ X2) != $true) & (((cP @ X0 @ X1 @ (k @ X1)) = $true) | ((cP @ a @ X1 @ (h @ X1)) = $true)))),
% 0.14/0.38    inference(ennf_transformation,[],[f5])).
% 0.14/0.38  thf(f5,plain,(
% 0.14/0.38    ~? [X0] : ! [X1] : ? [X2] : ((((cP @ X0 @ X1 @ (k @ X1)) = $true) | ((cP @ a @ X1 @ (h @ X1)) = $true)) => ((cP @ X0 @ X1 @ X2) = $true))),
% 0.14/0.38    inference(fool_elimination,[],[f4])).
% 0.14/0.38  thf(f4,plain,(
% 0.14/0.38    ~? [X0] : ! [X1] : ? [X2] : (((cP @ a @ X1 @ (h @ X1)) | (cP @ X0 @ X1 @ (k @ X1))) => (cP @ X0 @ X1 @ X2))),
% 0.14/0.38    inference(rectify,[],[f2])).
% 0.14/0.38  thf(f2,negated_conjecture,(
% 0.14/0.38    ~? [X0] : ! [X1] : ? [X2] : (((cP @ a @ X1 @ (h @ X1)) | (cP @ X0 @ X1 @ (k @ X1))) => (cP @ X0 @ X1 @ X2))),
% 0.14/0.38    inference(negated_conjecture,[],[f1])).
% 0.14/0.38  thf(f1,conjecture,(
% 0.14/0.38    ? [X0] : ! [X1] : ? [X2] : (((cP @ a @ X1 @ (h @ X1)) | (cP @ X0 @ X1 @ (k @ X1))) => (cP @ X0 @ X1 @ X2))),
% 0.14/0.38    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cTHM75)).
% 0.14/0.38  thf(f10,plain,(
% 0.14/0.38    ( ! [X2 : $i,X0 : $i] : (($true != (cP @ X0 @ (sK0 @ X0) @ X2))) )),
% 0.14/0.38    inference(cnf_transformation,[],[f8])).
% 0.14/0.38  % SZS output end Proof for theBenchmark
% 0.14/0.38  % (10100)------------------------------
% 0.14/0.38  % (10100)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.14/0.38  % (10100)Termination reason: Refutation
% 0.14/0.38  
% 0.14/0.38  % (10100)Memory used [KB]: 5500
% 0.14/0.38  % (10100)Time elapsed: 0.005 s
% 0.14/0.38  % (10100)Instructions burned: 2 (million)
% 0.14/0.38  % (10100)------------------------------
% 0.14/0.38  % (10100)------------------------------
% 0.14/0.38  % (10094)Success in time 0.006 s
% 0.14/0.38  % Vampire---4.8 exiting
%------------------------------------------------------------------------------