TSTP Solution File: SYO147^5 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SYO147^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 : n032.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:09 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.00/0.10 % Problem : SYO147^5 : TPTP v8.2.0. Released v4.0.0.
% 0.11/0.11 % 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.11/0.30 % Computer : n032.cluster.edu
% 0.11/0.30 % Model : x86_64 x86_64
% 0.11/0.30 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.30 % Memory : 8042.1875MB
% 0.11/0.30 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.30 % CPULimit : 300
% 0.11/0.30 % WCLimit : 300
% 0.11/0.30 % DateTime : Mon May 20 09:11:07 EDT 2024
% 0.11/0.31 % CPUTime :
% 0.11/0.31 This is a TH0_THM_NEQ_NAR problem
% 0.11/0.31 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 % (17043)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 % (17043)First to succeed.
% 0.15/0.32 % (17048)lrs+1004_1:128_cond=on:e2e=on:sp=weighted_frequency:i=18:si=on:rtra=on_0 on theBenchmark for (3000ds/18Mi)
% 0.15/0.32 % (17043)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, cP3: $i > $o).
% 0.15/0.32 thf(func_def_1, type, cP2: $i > $o).
% 0.15/0.32 thf(func_def_2, type, cP1: $i > $o).
% 0.15/0.32 thf(func_def_6, type, sK0: $i > $i).
% 0.15/0.32 thf(f27,plain,(
% 0.15/0.32 $false),
% 0.15/0.32 inference(trivial_inequality_removal,[],[f25])).
% 0.15/0.32 thf(f25,plain,(
% 0.15/0.32 ($false = $true)),
% 0.15/0.32 inference(backward_demodulation,[],[f10,f24])).
% 0.15/0.32 thf(f24,plain,(
% 0.15/0.32 ( ! [X0 : $i] : (((cP1 @ X0) = $false)) )),
% 0.15/0.32 inference(trivial_inequality_removal,[],[f23])).
% 0.15/0.32 thf(f23,plain,(
% 0.15/0.32 ( ! [X0 : $i] : (((cP1 @ X0) = $false) | ($true != $true)) )),
% 0.15/0.32 inference(fool_paramodulation,[],[f22])).
% 0.15/0.32 thf(f22,plain,(
% 0.15/0.32 ( ! [X0 : $i] : (((cP1 @ X0) != $true)) )),
% 0.15/0.32 inference(trivial_inequality_removal,[],[f20])).
% 0.15/0.32 thf(f20,plain,(
% 0.15/0.32 ( ! [X0 : $i] : (($false = $true) | ((cP1 @ X0) != $true)) )),
% 0.15/0.32 inference(backward_demodulation,[],[f11,f19])).
% 0.15/0.32 thf(f19,plain,(
% 0.15/0.32 ( ! [X0 : $i] : (((cP2 @ X0) = $false)) )),
% 0.15/0.32 inference(trivial_inequality_removal,[],[f18])).
% 0.15/0.32 thf(f18,plain,(
% 0.15/0.32 ( ! [X0 : $i] : (($true != $true) | ((cP2 @ X0) = $false)) )),
% 0.15/0.32 inference(fool_paramodulation,[],[f14])).
% 0.15/0.32 thf(f14,plain,(
% 0.15/0.32 ( ! [X0 : $i] : (((cP2 @ X0) != $true)) )),
% 0.15/0.32 inference(subsumption_resolution,[],[f12,f13])).
% 0.15/0.32 thf(f13,plain,(
% 0.15/0.32 ( ! [X0 : $i] : (((cP3 @ X0) != $true)) )),
% 0.15/0.32 inference(cnf_transformation,[],[f9])).
% 0.15/0.32 thf(f9,plain,(
% 0.15/0.32 ! [X0] : (((cP3 @ X0) != $true) & (((cP3 @ (sK0 @ X0)) = $true) | ((cP2 @ X0) != $true)) & (((cP2 @ (sK0 @ X0)) = $true) | ((cP1 @ X0) != $true)) & ((cP1 @ (sK0 @ X0)) = $true))),
% 0.15/0.32 inference(skolemisation,[status(esa),new_symbols(skolem,[sK0])],[f7,f8])).
% 0.15/0.32 thf(f8,plain,(
% 0.15/0.32 ! [X0] : (? [X1] : (((cP3 @ X0) != $true) & (((cP3 @ X1) = $true) | ((cP2 @ X0) != $true)) & (((cP2 @ X1) = $true) | ((cP1 @ X0) != $true)) & ((cP1 @ X1) = $true)) => (((cP3 @ X0) != $true) & (((cP3 @ (sK0 @ X0)) = $true) | ((cP2 @ X0) != $true)) & (((cP2 @ (sK0 @ X0)) = $true) | ((cP1 @ X0) != $true)) & ((cP1 @ (sK0 @ X0)) = $true)))),
% 0.15/0.32 introduced(choice_axiom,[])).
% 0.15/0.32 thf(f7,plain,(
% 0.15/0.32 ! [X0] : ? [X1] : (((cP3 @ X0) != $true) & (((cP3 @ X1) = $true) | ((cP2 @ X0) != $true)) & (((cP2 @ X1) = $true) | ((cP1 @ X0) != $true)) & ((cP1 @ X1) = $true))),
% 0.15/0.32 inference(flattening,[],[f6])).
% 0.15/0.32 thf(f6,plain,(
% 0.15/0.32 ! [X0] : ? [X1] : (((cP3 @ X0) != $true) & ((((cP3 @ X1) = $true) | ((cP2 @ X0) != $true)) & ((cP1 @ X1) = $true) & (((cP2 @ X1) = $true) | ((cP1 @ X0) != $true))))),
% 0.15/0.32 inference(ennf_transformation,[],[f5])).
% 0.15/0.32 thf(f5,plain,(
% 0.15/0.32 ~? [X0] : ! [X1] : (((((cP2 @ X0) = $true) => ((cP3 @ X1) = $true)) & ((cP1 @ X1) = $true) & (((cP1 @ X0) = $true) => ((cP2 @ X1) = $true))) => ((cP3 @ X0) = $true))),
% 0.15/0.32 inference(fool_elimination,[],[f4])).
% 0.15/0.32 thf(f4,plain,(
% 0.15/0.32 ~? [X0] : ! [X1] : ((((cP1 @ X0) => (cP2 @ X1)) & ((cP2 @ X0) => (cP3 @ X1)) & (cP1 @ X1)) => (cP3 @ X0))),
% 0.15/0.32 inference(rectify,[],[f2])).
% 0.15/0.32 thf(f2,negated_conjecture,(
% 0.15/0.32 ~? [X0] : ! [X1] : ((((cP1 @ X0) => (cP2 @ X1)) & ((cP2 @ X0) => (cP3 @ X1)) & (cP1 @ X1)) => (cP3 @ X0))),
% 0.15/0.32 inference(negated_conjecture,[],[f1])).
% 0.15/0.32 thf(f1,conjecture,(
% 0.15/0.32 ? [X0] : ! [X1] : ((((cP1 @ X0) => (cP2 @ X1)) & ((cP2 @ X0) => (cP3 @ X1)) & (cP1 @ X1)) => (cP3 @ X0))),
% 0.15/0.32 file('/export/starexec/sandbox/benchmark/theBenchmark.p',cBAFFLER3)).
% 0.15/0.32 thf(f12,plain,(
% 0.15/0.32 ( ! [X0 : $i] : (((cP3 @ (sK0 @ X0)) = $true) | ((cP2 @ X0) != $true)) )),
% 0.15/0.32 inference(cnf_transformation,[],[f9])).
% 0.15/0.32 thf(f11,plain,(
% 0.15/0.32 ( ! [X0 : $i] : (((cP2 @ (sK0 @ X0)) = $true) | ((cP1 @ X0) != $true)) )),
% 0.15/0.32 inference(cnf_transformation,[],[f9])).
% 0.15/0.32 thf(f10,plain,(
% 0.15/0.32 ( ! [X0 : $i] : (((cP1 @ (sK0 @ X0)) = $true)) )),
% 0.15/0.32 inference(cnf_transformation,[],[f9])).
% 0.15/0.32 % SZS output end Proof for theBenchmark
% 0.15/0.32 % (17043)------------------------------
% 0.15/0.32 % (17043)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.15/0.32 % (17043)Termination reason: Refutation
% 0.15/0.32
% 0.15/0.32 % (17043)Memory used [KB]: 5500
% 0.15/0.32 % (17043)Time elapsed: 0.002 s
% 0.15/0.32 % (17043)Instructions burned: 2 (million)
% 0.15/0.32 % (17043)------------------------------
% 0.15/0.32 % (17043)------------------------------
% 0.15/0.32 % (17041)Success in time 0.01 s
% 0.15/0.32 % Vampire---4.8 exiting
%------------------------------------------------------------------------------