TSTP Solution File: SYO286^5 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SYO286^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 : n016.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:49 EDT 2024
% Result : Theorem 0.11s 0.34s
% Output : Refutation 0.11s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.11 % Problem : SYO286^5 : TPTP v8.2.0. Released v4.0.0.
% 0.06/0.12 % 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.11/0.32 % Computer : n016.cluster.edu
% 0.11/0.32 % Model : x86_64 x86_64
% 0.11/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.32 % Memory : 8042.1875MB
% 0.11/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.32 % CPULimit : 300
% 0.11/0.32 % WCLimit : 300
% 0.11/0.32 % DateTime : Mon May 20 08:42:37 EDT 2024
% 0.11/0.32 % CPUTime :
% 0.11/0.32 This is a TH0_THM_NEQ_NAR problem
% 0.11/0.32 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.11/0.34 % (31912)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.11/0.34 % (31907)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.11/0.34 % (31906)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.11/0.34 % (31910)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.11/0.34 % (31909)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.11/0.34 % (31908)lrs+10_1:1_au=on:inj=on:i=2:si=on:rtra=on_0 on theBenchmark for (3000ds/2Mi)
% 0.11/0.34 % (31911)lrs+1004_1:128_cond=on:e2e=on:sp=weighted_frequency:i=18:si=on:rtra=on_0 on theBenchmark for (3000ds/18Mi)
% 0.11/0.34 % (31910)First to succeed.
% 0.11/0.34 % (31908)Also succeeded, but the first one will report.
% 0.11/0.34 % (31905)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.11/0.34 % (31910)Refutation found. Thanks to Tanya!
% 0.11/0.34 % SZS status Theorem for theBenchmark
% 0.11/0.34 % SZS output start Proof for theBenchmark
% 0.11/0.34 thf(func_def_1, type, cQ: $i > $o).
% 0.11/0.34 thf(func_def_2, type, cR: $i > $o).
% 0.11/0.34 thf(f13,plain,(
% 0.11/0.34 $false),
% 0.11/0.34 inference(subsumption_resolution,[],[f11,f12])).
% 0.11/0.34 thf(f12,plain,(
% 0.11/0.34 ( ! [X0 : $i > $o] : (((X0 @ y) = $true)) )),
% 0.11/0.34 inference(cnf_transformation,[],[f9])).
% 0.11/0.34 thf(f9,plain,(
% 0.11/0.34 ! [X0 : $i > $o] : ((X0 @ y) = $true) & ((cQ @ y) != $true) & ((cR @ sK0) = $true)),
% 0.11/0.34 inference(skolemisation,[status(esa),new_symbols(skolem,[sK0])],[f7,f8])).
% 0.11/0.34 thf(f8,plain,(
% 0.11/0.34 ? [X1] : ((cR @ X1) = $true) => ((cR @ sK0) = $true)),
% 0.11/0.34 introduced(choice_axiom,[])).
% 0.11/0.34 thf(f7,plain,(
% 0.11/0.34 ! [X0 : $i > $o] : ((X0 @ y) = $true) & ((cQ @ y) != $true) & ? [X1] : ((cR @ X1) = $true)),
% 0.11/0.34 inference(flattening,[],[f6])).
% 0.11/0.34 thf(f6,plain,(
% 0.11/0.34 (((cQ @ y) != $true) & ? [X1] : ((cR @ X1) = $true)) & ! [X0 : $i > $o] : ((X0 @ y) = $true)),
% 0.11/0.34 inference(ennf_transformation,[],[f5])).
% 0.11/0.34 thf(f5,plain,(
% 0.11/0.34 ~(! [X0 : $i > $o] : ((X0 @ y) = $true) => (? [X1] : ((cR @ X1) = $true) => ((cQ @ y) = $true)))),
% 0.11/0.34 inference(fool_elimination,[],[f4])).
% 0.11/0.34 thf(f4,plain,(
% 0.11/0.34 ~(! [X0 : $i > $o] : (X0 @ y) => (? [X1] : (cR @ X1) => (cQ @ y)))),
% 0.11/0.34 inference(rectify,[],[f2])).
% 0.11/0.34 thf(f2,negated_conjecture,(
% 0.11/0.34 ~(! [X0 : $i > $o] : (X0 @ y) => (? [X1] : (cR @ X1) => (cQ @ y)))),
% 0.11/0.34 inference(negated_conjecture,[],[f1])).
% 0.11/0.34 thf(f1,conjecture,(
% 0.11/0.34 ! [X0 : $i > $o] : (X0 @ y) => (? [X1] : (cR @ X1) => (cQ @ y))),
% 0.11/0.34 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cTEST1)).
% 0.11/0.34 thf(f11,plain,(
% 0.11/0.34 ((cQ @ y) != $true)),
% 0.11/0.34 inference(cnf_transformation,[],[f9])).
% 0.11/0.34 % SZS output end Proof for theBenchmark
% 0.11/0.34 % (31910)------------------------------
% 0.11/0.34 % (31910)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.11/0.34 % (31910)Termination reason: Refutation
% 0.11/0.34
% 0.11/0.34 % (31910)Memory used [KB]: 5373
% 0.11/0.34 % (31910)Time elapsed: 0.003 s
% 0.11/0.34 % (31910)Instructions burned: 1 (million)
% 0.11/0.34 % (31910)------------------------------
% 0.11/0.34 % (31910)------------------------------
% 0.11/0.34 % (31904)Success in time 0.015 s
% 0.11/0.34 % Vampire---4.8 exiting
%------------------------------------------------------------------------------