TSTP Solution File: SYO107^5 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SYO107^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 : n026.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:57 EDT 2024
% Result : Theorem 0.15s 0.32s
% Output : Refutation 0.15s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.02/0.09 % Problem : SYO107^5 : TPTP v8.2.0. Released v4.0.0.
% 0.02/0.10 % 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.09/0.30 % Computer : n026.cluster.edu
% 0.09/0.30 % Model : x86_64 x86_64
% 0.09/0.30 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.30 % Memory : 8042.1875MB
% 0.09/0.30 % OS : Linux 3.10.0-693.el7.x86_64
% 0.09/0.30 % CPULimit : 300
% 0.09/0.30 % WCLimit : 300
% 0.09/0.30 % DateTime : Mon May 20 10:33:52 EDT 2024
% 0.09/0.30 % CPUTime :
% 0.09/0.30 This is a TH0_THM_NEQ_NAR problem
% 0.09/0.30 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.15/0.32 % (26151)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.15/0.32 % (26151)First to succeed.
% 0.15/0.32 % (26151)Refutation found. Thanks to Tanya!
% 0.15/0.32 % SZS status Theorem for theBenchmark
% 0.15/0.32 % SZS output start Proof for theBenchmark
% 0.15/0.32 thf(func_def_0, type, cP: $i > $o).
% 0.15/0.32 thf(func_def_5, type, sK1: $i > $i).
% 0.15/0.32 thf(f51,plain,(
% 0.15/0.32 $false),
% 0.15/0.32 inference(avatar_sat_refutation,[],[f22,f32,f47,f50])).
% 0.15/0.32 thf(f50,plain,(
% 0.15/0.32 ~spl4_1 | ~spl4_2),
% 0.15/0.32 inference(avatar_contradiction_clause,[],[f49])).
% 0.15/0.32 thf(f49,plain,(
% 0.15/0.32 $false | (~spl4_1 | ~spl4_2)),
% 0.15/0.32 inference(subsumption_resolution,[],[f25,f21])).
% 0.15/0.32 thf(f21,plain,(
% 0.15/0.32 ( ! [X0 : $i] : (((cP @ X0) = $true)) ) | ~spl4_1),
% 0.15/0.32 inference(avatar_component_clause,[],[f20])).
% 0.15/0.32 thf(f20,plain,(
% 0.15/0.32 spl4_1 <=> ! [X0] : ((cP @ X0) = $true)),
% 0.15/0.32 introduced(avatar_definition,[new_symbols(naming,[spl4_1])])).
% 0.15/0.32 thf(f25,plain,(
% 0.15/0.32 ( ! [X2 : $i] : (((cP @ (sK1 @ X2)) != $true)) ) | ~spl4_2),
% 0.15/0.32 inference(avatar_component_clause,[],[f24])).
% 0.15/0.32 thf(f24,plain,(
% 0.15/0.32 spl4_2 <=> ! [X2] : ((cP @ (sK1 @ X2)) != $true)),
% 0.15/0.32 introduced(avatar_definition,[new_symbols(naming,[spl4_2])])).
% 0.15/0.32 thf(f47,plain,(
% 0.15/0.32 ~spl4_1 | spl4_3),
% 0.15/0.32 inference(avatar_contradiction_clause,[],[f46])).
% 0.15/0.32 thf(f46,plain,(
% 0.15/0.32 $false | (~spl4_1 | spl4_3)),
% 0.15/0.32 inference(trivial_inequality_removal,[],[f44])).
% 0.15/0.32 thf(f44,plain,(
% 0.15/0.32 ($true != $true) | (~spl4_1 | spl4_3)),
% 0.15/0.32 inference(superposition,[],[f30,f21])).
% 0.15/0.32 thf(f30,plain,(
% 0.15/0.32 ($true != (cP @ sK0)) | spl4_3),
% 0.15/0.32 inference(avatar_component_clause,[],[f28])).
% 0.15/0.32 thf(f28,plain,(
% 0.15/0.32 spl4_3 <=> ($true = (cP @ sK0))),
% 0.15/0.32 introduced(avatar_definition,[new_symbols(naming,[spl4_3])])).
% 0.15/0.32 thf(f32,plain,(
% 0.15/0.32 ~spl4_3 | spl4_2),
% 0.15/0.32 inference(avatar_split_clause,[],[f18,f24,f28])).
% 0.15/0.32 thf(f18,plain,(
% 0.15/0.32 ( ! [X2 : $i] : (($true != (cP @ sK0)) | ((cP @ (sK1 @ X2)) != $true)) )),
% 0.15/0.32 inference(cnf_transformation,[],[f13])).
% 0.15/0.32 thf(f13,plain,(
% 0.15/0.32 (! [X0] : (($true != (cP @ sK0)) & ((cP @ X0) = $true)) | ! [X2] : (((cP @ (sK1 @ X2)) != $true) & ($true = (cP @ X2)))) & ((! [X5] : ((cP @ X5) = $true) | ($true != (cP @ sK2))) | ! [X7] : (((cP @ X7) = $true) | ($true != (cP @ sK3))))),
% 0.15/0.32 inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3])],[f8,f12,f11,f10,f9])).
% 0.15/0.32 thf(f9,plain,(
% 0.15/0.32 ? [X1] : ((cP @ X1) != $true) => ($true != (cP @ sK0))),
% 0.15/0.32 introduced(choice_axiom,[])).
% 0.15/0.32 thf(f10,plain,(
% 0.15/0.32 ! [X2] : (? [X3] : (($true != (cP @ X3)) & ($true = (cP @ X2))) => (((cP @ (sK1 @ X2)) != $true) & ($true = (cP @ X2))))),
% 0.15/0.32 introduced(choice_axiom,[])).
% 0.15/0.32 thf(f11,plain,(
% 0.15/0.32 ? [X4] : (! [X5] : ((cP @ X5) = $true) | ((cP @ X4) != $true)) => (! [X5] : ((cP @ X5) = $true) | ($true != (cP @ sK2)))),
% 0.15/0.32 introduced(choice_axiom,[])).
% 0.15/0.32 thf(f12,plain,(
% 0.15/0.32 ? [X6] : ! [X7] : (((cP @ X7) = $true) | ($true != (cP @ X6))) => ! [X7] : (((cP @ X7) = $true) | ($true != (cP @ sK3)))),
% 0.15/0.32 introduced(choice_axiom,[])).
% 0.15/0.32 thf(f8,plain,(
% 0.15/0.32 (! [X0] : (? [X1] : ((cP @ X1) != $true) & ((cP @ X0) = $true)) | ! [X2] : ? [X3] : (($true != (cP @ X3)) & ($true = (cP @ X2)))) & (? [X4] : (! [X5] : ((cP @ X5) = $true) | ((cP @ X4) != $true)) | ? [X6] : ! [X7] : (((cP @ X7) = $true) | ($true != (cP @ X6))))),
% 0.15/0.32 inference(rectify,[],[f7])).
% 0.15/0.32 thf(f7,plain,(
% 0.15/0.32 (! [X0] : (? [X1] : ((cP @ X1) != $true) & ((cP @ X0) = $true)) | ! [X2] : ? [X3] : (($true != (cP @ X3)) & ($true = (cP @ X2)))) & (? [X0] : (! [X1] : ((cP @ X1) = $true) | ((cP @ X0) != $true)) | ? [X2] : ! [X3] : (($true = (cP @ X3)) | ($true != (cP @ X2))))),
% 0.15/0.32 inference(nnf_transformation,[],[f6])).
% 0.15/0.32 thf(f6,plain,(
% 0.15/0.32 ? [X2] : ! [X3] : (($true = (cP @ X3)) | ($true != (cP @ X2))) <~> ? [X0] : (! [X1] : ((cP @ X1) = $true) | ((cP @ X0) != $true))),
% 0.15/0.32 inference(ennf_transformation,[],[f5])).
% 0.15/0.32 thf(f5,plain,(
% 0.15/0.32 ~(? [X0] : (((cP @ X0) = $true) => ! [X1] : ((cP @ X1) = $true)) <=> ? [X2] : ! [X3] : (($true = (cP @ X2)) => ($true = (cP @ X3))))),
% 0.15/0.32 inference(fool_elimination,[],[f4])).
% 0.15/0.32 thf(f4,plain,(
% 0.15/0.32 ~(? [X0] : ((cP @ X0) => ! [X1] : (cP @ X1)) <=> ? [X2] : ! [X3] : ((cP @ X2) => (cP @ X3)))),
% 0.15/0.32 inference(rectify,[],[f2])).
% 0.15/0.32 thf(f2,negated_conjecture,(
% 0.15/0.32 ~(? [X0] : ((cP @ X0) => ! [X1] : (cP @ X1)) <=> ? [X0] : ! [X1] : ((cP @ X0) => (cP @ X1)))),
% 0.15/0.32 inference(negated_conjecture,[],[f1])).
% 0.15/0.32 thf(f1,conjecture,(
% 0.15/0.32 ? [X0] : ((cP @ X0) => ! [X1] : (cP @ X1)) <=> ? [X0] : ! [X1] : ((cP @ X0) => (cP @ X1))),
% 0.15/0.32 file('/export/starexec/sandbox/benchmark/theBenchmark.p',cTHM66)).
% 0.15/0.32 thf(f22,plain,(
% 0.15/0.32 spl4_1 | spl4_1),
% 0.15/0.32 inference(avatar_split_clause,[],[f15,f20,f20])).
% 0.15/0.32 thf(f15,plain,(
% 0.15/0.32 ( ! [X2 : $i,X0 : $i] : (($true = (cP @ X2)) | ((cP @ X0) = $true)) )),
% 0.15/0.32 inference(cnf_transformation,[],[f13])).
% 0.15/0.32 % SZS output end Proof for theBenchmark
% 0.15/0.32 % (26151)------------------------------
% 0.15/0.32 % (26151)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.15/0.32 % (26151)Termination reason: Refutation
% 0.15/0.32
% 0.15/0.32 % (26151)Memory used [KB]: 5500
% 0.15/0.32 % (26151)Time elapsed: 0.004 s
% 0.15/0.32 % (26151)Instructions burned: 2 (million)
% 0.15/0.32 % (26151)------------------------------
% 0.15/0.32 % (26151)------------------------------
% 0.15/0.32 % (26149)Success in time 0.009 s
% 0.15/0.32 % Vampire---4.8 exiting
%------------------------------------------------------------------------------