TSTP Solution File: SYO381^5 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SYO381^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 : n027.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:04:14 EDT 2024
% Result : Theorem 0.15s 0.40s
% Output : Refutation 0.15s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12 % Problem : SYO381^5 : TPTP v8.2.0. Released v4.0.0.
% 0.12/0.14 % 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.15/0.35 % Computer : n027.cluster.edu
% 0.15/0.35 % Model : x86_64 x86_64
% 0.15/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.35 % Memory : 8042.1875MB
% 0.15/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.35 % CPULimit : 300
% 0.15/0.35 % WCLimit : 300
% 0.15/0.35 % DateTime : Mon May 20 08:53:53 EDT 2024
% 0.15/0.36 % CPUTime :
% 0.15/0.36 This is a TH0_THM_NEQ_NAR problem
% 0.15/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/sandbox/benchmark/theBenchmark.p
% 0.15/0.39 % (23321)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 (2999ds/4Mi)
% 0.15/0.39 % (23320)lrs+1002_1:8_bd=off:fd=off:hud=10:tnu=1:i=183:si=on:rtra=on_0 on theBenchmark for (2999ds/183Mi)
% 0.15/0.39 % (23322)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 (2999ds/27Mi)
% 0.15/0.39 % (23323)lrs+10_1:1_au=on:inj=on:i=2:si=on:rtra=on_0 on theBenchmark for (2999ds/2Mi)
% 0.15/0.39 % (23324)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 (2999ds/2Mi)
% 0.15/0.39 % (23325)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 (2999ds/275Mi)
% 0.15/0.39 % (23326)lrs+1004_1:128_cond=on:e2e=on:sp=weighted_frequency:i=18:si=on:rtra=on_0 on theBenchmark for (2999ds/18Mi)
% 0.15/0.39 % (23327)lrs+10_1:1_bet=on:cnfonf=off:fd=off:hud=5:inj=on:i=3:si=on:rtra=on_0 on theBenchmark for (2999ds/3Mi)
% 0.15/0.39 % (23323)Instruction limit reached!
% 0.15/0.39 % (23323)------------------------------
% 0.15/0.39 % (23323)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.15/0.39 % (23323)Termination reason: Unknown
% 0.15/0.39 % (23323)Termination phase: Saturation
% 0.15/0.39 % (23324)Instruction limit reached!
% 0.15/0.39 % (23324)------------------------------
% 0.15/0.39 % (23324)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.15/0.39 % (23324)Termination reason: Unknown
% 0.15/0.39 % (23324)Termination phase: Saturation
% 0.15/0.39
% 0.15/0.39 % (23324)Memory used [KB]: 5500
% 0.15/0.39 % (23324)Time elapsed: 0.005 s
% 0.15/0.39 % (23324)Instructions burned: 2 (million)
% 0.15/0.39 % (23324)------------------------------
% 0.15/0.39 % (23324)------------------------------
% 0.15/0.39
% 0.15/0.39 % (23323)Memory used [KB]: 5500
% 0.15/0.39 % (23323)Time elapsed: 0.005 s
% 0.15/0.39 % (23323)Instructions burned: 2 (million)
% 0.15/0.39 % (23323)------------------------------
% 0.15/0.39 % (23323)------------------------------
% 0.15/0.39 % (23320)First to succeed.
% 0.15/0.39 % (23321)Also succeeded, but the first one will report.
% 0.15/0.39 % (23327)Instruction limit reached!
% 0.15/0.39 % (23327)------------------------------
% 0.15/0.39 % (23327)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.15/0.39 % (23327)Termination reason: Unknown
% 0.15/0.39 % (23327)Termination phase: Saturation
% 0.15/0.39
% 0.15/0.39 % (23327)Memory used [KB]: 5500
% 0.15/0.39 % (23327)Time elapsed: 0.006 s
% 0.15/0.39 % (23327)Instructions burned: 3 (million)
% 0.15/0.39 % (23327)------------------------------
% 0.15/0.39 % (23327)------------------------------
% 0.15/0.40 % (23320)Refutation found. Thanks to Tanya!
% 0.15/0.40 % SZS status Theorem for theBenchmark
% 0.15/0.40 % SZS output start Proof for theBenchmark
% 0.15/0.40 thf(func_def_0, type, cR: $i > $i > $o).
% 0.15/0.40 thf(func_def_4, type, sK0: $i > $i).
% 0.15/0.40 thf(func_def_5, type, sK1: $i > $i).
% 0.15/0.40 thf(f40,plain,(
% 0.15/0.40 $false),
% 0.15/0.40 inference(avatar_sat_refutation,[],[f21,f28,f31,f34,f37,f39])).
% 0.15/0.40 thf(f39,plain,(
% 0.15/0.40 ~spl3_1 | ~spl3_4),
% 0.15/0.40 inference(avatar_contradiction_clause,[],[f38])).
% 0.15/0.40 thf(f38,plain,(
% 0.15/0.40 $false | (~spl3_1 | ~spl3_4)),
% 0.15/0.40 inference(subsumption_resolution,[],[f17,f27])).
% 0.15/0.40 thf(f27,plain,(
% 0.15/0.40 ( ! [X0 : $i,X6 : $i] : (((cR @ X0 @ X6) = $true)) ) | ~spl3_4),
% 0.15/0.40 inference(avatar_component_clause,[],[f26])).
% 0.15/0.40 thf(f26,plain,(
% 0.15/0.40 spl3_4 <=> ! [X6,X0] : ((cR @ X0 @ X6) = $true)),
% 0.15/0.40 introduced(avatar_definition,[new_symbols(naming,[spl3_4])])).
% 0.15/0.40 thf(f17,plain,(
% 0.15/0.40 ( ! [X0 : $i] : (((cR @ X0 @ (sK1 @ X0)) != $true)) ) | ~spl3_1),
% 0.15/0.40 inference(avatar_component_clause,[],[f16])).
% 0.15/0.40 thf(f16,plain,(
% 0.15/0.40 spl3_1 <=> ! [X0] : ((cR @ X0 @ (sK1 @ X0)) != $true)),
% 0.15/0.40 introduced(avatar_definition,[new_symbols(naming,[spl3_1])])).
% 0.15/0.40 thf(f37,plain,(
% 0.15/0.40 ~spl3_2 | ~spl3_4),
% 0.15/0.40 inference(avatar_contradiction_clause,[],[f36])).
% 0.15/0.40 thf(f36,plain,(
% 0.15/0.40 $false | (~spl3_2 | ~spl3_4)),
% 0.15/0.40 inference(trivial_inequality_removal,[],[f35])).
% 0.15/0.40 thf(f35,plain,(
% 0.15/0.40 ($true != $true) | (~spl3_2 | ~spl3_4)),
% 0.15/0.40 inference(superposition,[],[f20,f27])).
% 0.15/0.40 thf(f20,plain,(
% 0.15/0.40 ( ! [X1 : $i] : (((cR @ X1 @ (sK0 @ X1)) != $true)) ) | ~spl3_2),
% 0.15/0.40 inference(avatar_component_clause,[],[f19])).
% 0.15/0.40 thf(f19,plain,(
% 0.15/0.40 spl3_2 <=> ! [X1] : ((cR @ X1 @ (sK0 @ X1)) != $true)),
% 0.15/0.40 introduced(avatar_definition,[new_symbols(naming,[spl3_2])])).
% 0.15/0.40 thf(f34,plain,(
% 0.15/0.40 ~spl3_1 | ~spl3_3),
% 0.15/0.40 inference(avatar_contradiction_clause,[],[f33])).
% 0.15/0.40 thf(f33,plain,(
% 0.15/0.40 $false | (~spl3_1 | ~spl3_3)),
% 0.15/0.40 inference(trivial_inequality_removal,[],[f32])).
% 0.15/0.40 thf(f32,plain,(
% 0.15/0.40 ($true != $true) | (~spl3_1 | ~spl3_3)),
% 0.15/0.40 inference(superposition,[],[f17,f24])).
% 0.15/0.40 thf(f24,plain,(
% 0.15/0.40 ( ! [X5 : $i] : (((cR @ sK2 @ X5) = $true)) ) | ~spl3_3),
% 0.15/0.40 inference(avatar_component_clause,[],[f23])).
% 0.15/0.40 thf(f23,plain,(
% 0.15/0.40 spl3_3 <=> ! [X5] : ((cR @ sK2 @ X5) = $true)),
% 0.15/0.40 introduced(avatar_definition,[new_symbols(naming,[spl3_3])])).
% 0.15/0.40 thf(f31,plain,(
% 0.15/0.40 ~spl3_2 | ~spl3_3),
% 0.15/0.40 inference(avatar_contradiction_clause,[],[f30])).
% 0.15/0.40 thf(f30,plain,(
% 0.15/0.40 $false | (~spl3_2 | ~spl3_3)),
% 0.15/0.40 inference(trivial_inequality_removal,[],[f29])).
% 0.15/0.40 thf(f29,plain,(
% 0.15/0.40 ($true != $true) | (~spl3_2 | ~spl3_3)),
% 0.15/0.40 inference(superposition,[],[f20,f24])).
% 0.15/0.40 thf(f28,plain,(
% 0.15/0.40 spl3_3 | spl3_4),
% 0.15/0.40 inference(avatar_split_clause,[],[f13,f26,f23])).
% 0.15/0.40 thf(f13,plain,(
% 0.15/0.40 ( ! [X0 : $i,X6 : $i,X5 : $i] : (((cR @ sK2 @ X5) = $true) | ((cR @ X0 @ X6) = $true)) )),
% 0.15/0.40 inference(cnf_transformation,[],[f12])).
% 0.15/0.40 thf(f12,plain,(
% 0.15/0.40 ! [X0] : ((! [X1] : ((cR @ X1 @ (sK0 @ X1)) != $true) | ((cR @ X0 @ (sK1 @ X0)) != $true)) & (! [X5] : ((cR @ sK2 @ X5) = $true) | ! [X6] : ((cR @ X0 @ X6) = $true)))),
% 0.15/0.40 inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2])],[f8,f11,f10,f9])).
% 0.15/0.40 thf(f9,plain,(
% 0.15/0.40 ! [X1] : (? [X2] : ((cR @ X1 @ X2) != $true) => ((cR @ X1 @ (sK0 @ X1)) != $true))),
% 0.15/0.40 introduced(choice_axiom,[])).
% 0.15/0.40 thf(f10,plain,(
% 0.15/0.40 ! [X0] : (? [X3] : ((cR @ X0 @ X3) != $true) => ((cR @ X0 @ (sK1 @ X0)) != $true))),
% 0.15/0.40 introduced(choice_axiom,[])).
% 0.15/0.40 thf(f11,plain,(
% 0.15/0.40 ? [X4] : ! [X5] : ((cR @ X4 @ X5) = $true) => ! [X5] : ((cR @ sK2 @ X5) = $true)),
% 0.15/0.40 introduced(choice_axiom,[])).
% 0.15/0.40 thf(f8,plain,(
% 0.15/0.40 ! [X0] : ((! [X1] : ? [X2] : ((cR @ X1 @ X2) != $true) | ? [X3] : ((cR @ X0 @ X3) != $true)) & (? [X4] : ! [X5] : ((cR @ X4 @ X5) = $true) | ! [X6] : ((cR @ X0 @ X6) = $true)))),
% 0.15/0.40 inference(rectify,[],[f7])).
% 0.15/0.40 thf(f7,plain,(
% 0.15/0.40 ! [X0] : ((! [X2] : ? [X3] : ((cR @ X2 @ X3) != $true) | ? [X1] : ((cR @ X0 @ X1) != $true)) & (? [X2] : ! [X3] : ((cR @ X2 @ X3) = $true) | ! [X1] : ((cR @ X0 @ X1) = $true)))),
% 0.15/0.40 inference(nnf_transformation,[],[f6])).
% 0.15/0.40 thf(f6,plain,(
% 0.15/0.40 ! [X0] : (! [X1] : ((cR @ X0 @ X1) = $true) <~> ? [X2] : ! [X3] : ((cR @ X2 @ X3) = $true))),
% 0.15/0.40 inference(ennf_transformation,[],[f5])).
% 0.15/0.40 thf(f5,plain,(
% 0.15/0.40 ~? [X0] : (? [X2] : ! [X3] : ((cR @ X2 @ X3) = $true) <=> ! [X1] : ((cR @ X0 @ X1) = $true))),
% 0.15/0.40 inference(fool_elimination,[],[f4])).
% 0.15/0.40 thf(f4,plain,(
% 0.15/0.40 ~? [X0] : (! [X1] : (cR @ X0 @ X1) <=> ? [X2] : ! [X3] : (cR @ X2 @ X3))),
% 0.15/0.40 inference(rectify,[],[f2])).
% 0.15/0.40 thf(f2,negated_conjecture,(
% 0.15/0.40 ~? [X0] : (! [X3] : (cR @ X0 @ X3) <=> ? [X1] : ! [X2] : (cR @ X1 @ X2))),
% 0.15/0.40 inference(negated_conjecture,[],[f1])).
% 0.15/0.40 thf(f1,conjecture,(
% 0.15/0.40 ? [X0] : (! [X3] : (cR @ X0 @ X3) <=> ? [X1] : ! [X2] : (cR @ X1 @ X2))),
% 0.15/0.40 file('/export/starexec/sandbox/benchmark/theBenchmark.p',cX_2002_12_17)).
% 0.15/0.40 thf(f21,plain,(
% 0.15/0.40 spl3_1 | spl3_2),
% 0.15/0.40 inference(avatar_split_clause,[],[f14,f19,f16])).
% 0.15/0.40 thf(f14,plain,(
% 0.15/0.40 ( ! [X0 : $i,X1 : $i] : (((cR @ X0 @ (sK1 @ X0)) != $true) | ((cR @ X1 @ (sK0 @ X1)) != $true)) )),
% 0.15/0.40 inference(cnf_transformation,[],[f12])).
% 0.15/0.40 % SZS output end Proof for theBenchmark
% 0.15/0.40 % (23320)------------------------------
% 0.15/0.40 % (23320)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.15/0.40 % (23320)Termination reason: Refutation
% 0.15/0.40
% 0.15/0.40 % (23320)Memory used [KB]: 5500
% 0.15/0.40 % (23320)Time elapsed: 0.007 s
% 0.15/0.40 % (23320)Instructions burned: 2 (million)
% 0.15/0.40 % (23320)------------------------------
% 0.15/0.40 % (23320)------------------------------
% 0.15/0.40 % (23319)Success in time 0.03 s
% 0.15/0.40 % Vampire---4.8 exiting
%------------------------------------------------------------------------------