TSTP Solution File: SYO305^5 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SYO305^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 : n011.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:54 EDT 2024
% Result : Theorem 0.15s 0.33s
% Output : Refutation 0.15s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.09 % Problem : SYO305^5 : TPTP v8.2.0. Released v4.0.0.
% 0.00/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.10/0.30 % Computer : n011.cluster.edu
% 0.10/0.30 % Model : x86_64 x86_64
% 0.10/0.30 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.30 % Memory : 8042.1875MB
% 0.10/0.30 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.30 % CPULimit : 300
% 0.10/0.30 % WCLimit : 300
% 0.10/0.30 % DateTime : Mon May 20 09:32:08 EDT 2024
% 0.10/0.31 % CPUTime :
% 0.10/0.31 This is a TH0_THM_NEQ_NAR problem
% 0.10/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 % (30065)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.15/0.32 % (30066)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.15/0.32 % (30065)Instruction limit reached!
% 0.15/0.32 % (30065)------------------------------
% 0.15/0.32 % (30065)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.15/0.32 % (30065)Termination reason: Unknown
% 0.15/0.32 % (30065)Termination phase: shuffling
% 0.15/0.32
% 0.15/0.32 % (30065)Memory used [KB]: 895
% 0.15/0.32 % (30065)Time elapsed: 0.003 s
% 0.15/0.32 % (30065)Instructions burned: 2 (million)
% 0.15/0.32 % (30065)------------------------------
% 0.15/0.32 % (30065)------------------------------
% 0.15/0.32 % (30066)First to succeed.
% 0.15/0.33 % (30061)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.15/0.33 % (30066)Refutation found. Thanks to Tanya!
% 0.15/0.33 % SZS status Theorem for theBenchmark
% 0.15/0.33 % SZS output start Proof for theBenchmark
% 0.15/0.33 thf(func_def_0, type, cB: $i > $o).
% 0.15/0.33 thf(func_def_1, type, cA: $i > $o).
% 0.15/0.33 thf(func_def_5, type, sK0: $i > $o).
% 0.15/0.33 thf(f19,plain,(
% 0.15/0.33 $false),
% 0.15/0.33 inference(subsumption_resolution,[],[f18,f13])).
% 0.15/0.33 thf(f13,plain,(
% 0.15/0.33 ((sK0 @ sK1) = $true)),
% 0.15/0.33 inference(cnf_transformation,[],[f10])).
% 0.15/0.33 thf(f10,plain,(
% 0.15/0.33 ((((cB @ sK1) != $true) & ((sK0 @ sK1) = $true)) & ! [X2] : (((cA @ X2) = $true) | ((sK0 @ X2) != $true))) & ! [X3] : (((cA @ X3) != $true) | ($true = (cB @ X3)))),
% 0.15/0.33 inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1])],[f7,f9,f8])).
% 0.15/0.33 thf(f8,plain,(
% 0.15/0.33 ? [X0 : $i > $o] : (? [X1] : (((cB @ X1) != $true) & ((X0 @ X1) = $true)) & ! [X2] : (((cA @ X2) = $true) | ((X0 @ X2) != $true))) => (? [X1] : (((cB @ X1) != $true) & ((sK0 @ X1) = $true)) & ! [X2] : (((cA @ X2) = $true) | ((sK0 @ X2) != $true)))),
% 0.15/0.33 introduced(choice_axiom,[])).
% 0.15/0.33 thf(f9,plain,(
% 0.15/0.33 ? [X1] : (((cB @ X1) != $true) & ((sK0 @ X1) = $true)) => (((cB @ sK1) != $true) & ((sK0 @ sK1) = $true))),
% 0.15/0.33 introduced(choice_axiom,[])).
% 0.15/0.33 thf(f7,plain,(
% 0.15/0.33 ? [X0 : $i > $o] : (? [X1] : (((cB @ X1) != $true) & ((X0 @ X1) = $true)) & ! [X2] : (((cA @ X2) = $true) | ((X0 @ X2) != $true))) & ! [X3] : (((cA @ X3) != $true) | ($true = (cB @ X3)))),
% 0.15/0.33 inference(rectify,[],[f6])).
% 0.15/0.33 thf(f6,plain,(
% 0.15/0.33 ? [X1 : $i > $o] : (? [X3] : (($true != (cB @ X3)) & ($true = (X1 @ X3))) & ! [X2] : (((cA @ X2) = $true) | ($true != (X1 @ X2)))) & ! [X0] : (((cA @ X0) != $true) | ((cB @ X0) = $true))),
% 0.15/0.33 inference(ennf_transformation,[],[f5])).
% 0.15/0.33 thf(f5,plain,(
% 0.15/0.33 ~(! [X0] : (((cA @ X0) = $true) => ((cB @ X0) = $true)) => ! [X1 : $i > $o] : (! [X2] : (($true = (X1 @ X2)) => ((cA @ X2) = $true)) => ! [X3] : (($true = (X1 @ X3)) => ($true = (cB @ X3)))))),
% 0.15/0.33 inference(fool_elimination,[],[f4])).
% 0.15/0.33 thf(f4,plain,(
% 0.15/0.33 ~(! [X0] : ((cA @ X0) => (cB @ X0)) => ! [X1 : $i > $o] : (! [X2] : ((X1 @ X2) => (cA @ X2)) => ! [X3] : ((X1 @ X3) => (cB @ X3))))),
% 0.15/0.33 inference(rectify,[],[f2])).
% 0.15/0.33 thf(f2,negated_conjecture,(
% 0.15/0.33 ~(! [X0] : ((cA @ X0) => (cB @ X0)) => ! [X0 : $i > $o] : (! [X1] : ((X0 @ X1) => (cA @ X1)) => ! [X1] : ((X0 @ X1) => (cB @ X1))))),
% 0.15/0.33 inference(negated_conjecture,[],[f1])).
% 0.15/0.33 thf(f1,conjecture,(
% 0.15/0.33 ! [X0] : ((cA @ X0) => (cB @ X0)) => ! [X0 : $i > $o] : (! [X1] : ((X0 @ X1) => (cA @ X1)) => ! [X1] : ((X0 @ X1) => (cB @ X1)))),
% 0.15/0.33 file('/export/starexec/sandbox/benchmark/theBenchmark.p',cSET79_pme)).
% 0.15/0.33 thf(f18,plain,(
% 0.15/0.33 ((sK0 @ sK1) != $true)),
% 0.15/0.33 inference(trivial_inequality_removal,[],[f17])).
% 0.15/0.33 thf(f17,plain,(
% 0.15/0.33 ((sK0 @ sK1) != $true) | ($true != $true)),
% 0.15/0.33 inference(superposition,[],[f16,f12])).
% 0.15/0.33 thf(f12,plain,(
% 0.15/0.33 ( ! [X2 : $i] : (((cA @ X2) = $true) | ((sK0 @ X2) != $true)) )),
% 0.15/0.33 inference(cnf_transformation,[],[f10])).
% 0.15/0.33 thf(f16,plain,(
% 0.15/0.33 ((cA @ sK1) != $true)),
% 0.15/0.33 inference(trivial_inequality_removal,[],[f15])).
% 0.15/0.33 thf(f15,plain,(
% 0.15/0.33 ($true != $true) | ((cA @ sK1) != $true)),
% 0.15/0.33 inference(superposition,[],[f14,f11])).
% 0.15/0.33 thf(f11,plain,(
% 0.15/0.33 ( ! [X3 : $i] : (($true = (cB @ X3)) | ((cA @ X3) != $true)) )),
% 0.15/0.33 inference(cnf_transformation,[],[f10])).
% 0.15/0.33 thf(f14,plain,(
% 0.15/0.33 ((cB @ sK1) != $true)),
% 0.15/0.33 inference(cnf_transformation,[],[f10])).
% 0.15/0.33 % SZS output end Proof for theBenchmark
% 0.15/0.33 % (30066)------------------------------
% 0.15/0.33 % (30066)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.15/0.33 % (30066)Termination reason: Refutation
% 0.15/0.33
% 0.15/0.33 % (30066)Memory used [KB]: 5500
% 0.15/0.33 % (30066)Time elapsed: 0.003 s
% 0.15/0.33 % (30066)Instructions burned: 1 (million)
% 0.15/0.33 % (30066)------------------------------
% 0.15/0.33 % (30066)------------------------------
% 0.15/0.33 % (30060)Success in time 0.015 s
% 0.15/0.33 % Vampire---4.8 exiting
%------------------------------------------------------------------------------