TSTP Solution File: SYN356^5 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SYN356^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 : n004.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 08:22:00 EDT 2024
% Result : Theorem 0.14s 0.38s
% Output : Refutation 0.14s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SYN356^5 : TPTP v8.2.0. Released v4.0.0.
% 0.13/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.14/0.36 % Computer : n004.cluster.edu
% 0.14/0.36 % Model : x86_64 x86_64
% 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36 % Memory : 8042.1875MB
% 0.14/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36 % CPULimit : 300
% 0.14/0.36 % WCLimit : 300
% 0.14/0.36 % DateTime : Mon May 20 15:44:23 EDT 2024
% 0.14/0.36 % CPUTime :
% 0.14/0.36 This is a TH0_THM_NEQ_NAR problem
% 0.14/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.14/0.38 % (8542)lrs+10_1:1_au=on:inj=on:i=2:si=on:rtra=on_0 on theBenchmark for (3000ds/2Mi)
% 0.14/0.38 % (8541)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.14/0.38 % (8539)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.14/0.38 % (8543)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.14/0.38 % (8540)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.14/0.38 % (8544)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.14/0.38 % (8545)lrs+1004_1:128_cond=on:e2e=on:sp=weighted_frequency:i=18:si=on:rtra=on_0 on theBenchmark for (3000ds/18Mi)
% 0.14/0.38 % (8546)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.14/0.38 % (8543)Instruction limit reached!
% 0.14/0.38 % (8543)------------------------------
% 0.14/0.38 % (8543)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.14/0.38 % (8543)Termination reason: Unknown
% 0.14/0.38 % (8543)Termination phase: Property scanning
% 0.14/0.38
% 0.14/0.38 % (8543)Memory used [KB]: 895
% 0.14/0.38 % (8543)Time elapsed: 0.003 s
% 0.14/0.38 % (8543)Instructions burned: 2 (million)
% 0.14/0.38 % (8543)------------------------------
% 0.14/0.38 % (8543)------------------------------
% 0.14/0.38 % (8542)Instruction limit reached!
% 0.14/0.38 % (8542)------------------------------
% 0.14/0.38 % (8542)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.14/0.38 % (8542)Termination reason: Unknown
% 0.14/0.38 % (8542)Termination phase: Saturation
% 0.14/0.38
% 0.14/0.38 % (8542)Memory used [KB]: 5500
% 0.14/0.38 % (8542)Time elapsed: 0.004 s
% 0.14/0.38 % (8542)Instructions burned: 2 (million)
% 0.14/0.38 % (8542)------------------------------
% 0.14/0.38 % (8542)------------------------------
% 0.14/0.38 % (8546)Instruction limit reached!
% 0.14/0.38 % (8546)------------------------------
% 0.14/0.38 % (8546)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.14/0.38 % (8546)Termination reason: Unknown
% 0.14/0.38 % (8541)First to succeed.
% 0.14/0.38 % (8546)Termination phase: Saturation
% 0.14/0.38
% 0.14/0.38 % (8546)Memory used [KB]: 5500
% 0.14/0.38 % (8546)Time elapsed: 0.005 s
% 0.14/0.38 % (8546)Instructions burned: 3 (million)
% 0.14/0.38 % (8546)------------------------------
% 0.14/0.38 % (8546)------------------------------
% 0.14/0.38 % (8540)Instruction limit reached!
% 0.14/0.38 % (8540)------------------------------
% 0.14/0.38 % (8540)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.14/0.38 % (8540)Termination reason: Unknown
% 0.14/0.38 % (8540)Termination phase: Saturation
% 0.14/0.38
% 0.14/0.38 % (8540)Memory used [KB]: 5500
% 0.14/0.38 % (8540)Time elapsed: 0.005 s
% 0.14/0.38 % (8540)Instructions burned: 4 (million)
% 0.14/0.38 % (8540)------------------------------
% 0.14/0.38 % (8540)------------------------------
% 0.14/0.38 % (8539)Also succeeded, but the first one will report.
% 0.14/0.38 % (8541)Refutation found. Thanks to Tanya!
% 0.14/0.38 % SZS status Theorem for theBenchmark
% 0.14/0.38 % SZS output start Proof for theBenchmark
% 0.14/0.38 thf(func_def_1, type, cQ: $i > $i > $o).
% 0.14/0.38 thf(func_def_3, type, cR: $i > $i > $o).
% 0.14/0.38 thf(func_def_5, type, vEPSILON: !>[X0: $tType]:((X0 > $o) > X0)).
% 0.14/0.38 thf(f38,plain,(
% 0.14/0.38 $false),
% 0.14/0.38 inference(avatar_sat_refutation,[],[f22,f33,f37])).
% 0.14/0.38 thf(f37,plain,(
% 0.14/0.38 spl0_1),
% 0.14/0.38 inference(avatar_split_clause,[],[f36,f15])).
% 0.14/0.38 thf(f15,plain,(
% 0.14/0.38 spl0_1 <=> ((cQ @ cB @ cB) = $true)),
% 0.14/0.38 introduced(avatar_definition,[new_symbols(naming,[spl0_1])])).
% 0.14/0.38 thf(f36,plain,(
% 0.14/0.38 ((cQ @ cB @ cB) = $true)),
% 0.14/0.38 inference(trivial_inequality_removal,[],[f35])).
% 0.14/0.38 thf(f35,plain,(
% 0.14/0.38 ((cQ @ cB @ cB) = $true) | ($true != $true)),
% 0.14/0.38 inference(superposition,[],[f11,f30])).
% 0.14/0.38 thf(f30,plain,(
% 0.14/0.38 ($true = (cQ @ cB @ cA))),
% 0.14/0.38 inference(trivial_inequality_removal,[],[f28])).
% 0.14/0.38 thf(f28,plain,(
% 0.14/0.38 ($true = (cQ @ cB @ cA)) | ($true != $true)),
% 0.14/0.38 inference(superposition,[],[f13,f24])).
% 0.14/0.38 thf(f24,plain,(
% 0.14/0.38 ($true = (cR @ cB @ cA))),
% 0.14/0.38 inference(trivial_inequality_removal,[],[f23])).
% 0.14/0.38 thf(f23,plain,(
% 0.14/0.38 ($true = (cR @ cB @ cA)) | ($true != $true)),
% 0.14/0.38 inference(superposition,[],[f12,f9])).
% 0.14/0.38 thf(f9,plain,(
% 0.14/0.38 ((cR @ cA @ cB) = $true)),
% 0.14/0.38 inference(cnf_transformation,[],[f8])).
% 0.14/0.38 thf(f8,plain,(
% 0.14/0.38 ! [X0,X1] : ((((cQ @ X0 @ X1) = $true) & ((cR @ X1 @ X0) = $true)) | ((cR @ X0 @ X1) != $true)) & ! [X2,X3] : (((cQ @ X2 @ X2) = $true) | ((cQ @ X2 @ X3) != $true)) & (((cQ @ cA @ cA) != $true) | ((cQ @ cB @ cB) != $true)) & ((cR @ cA @ cB) = $true)),
% 0.14/0.38 inference(rectify,[],[f7])).
% 0.14/0.38 thf(f7,plain,(
% 0.14/0.38 ! [X3,X2] : ((($true = (cQ @ X3 @ X2)) & ((cR @ X2 @ X3) = $true)) | ($true != (cR @ X3 @ X2))) & ! [X0,X1] : (((cQ @ X0 @ X0) = $true) | ((cQ @ X0 @ X1) != $true)) & (((cQ @ cA @ cA) != $true) | ((cQ @ cB @ cB) != $true)) & ((cR @ cA @ cB) = $true)),
% 0.14/0.38 inference(flattening,[],[f6])).
% 0.14/0.38 thf(f6,plain,(
% 0.14/0.38 (((cQ @ cA @ cA) != $true) | ((cQ @ cB @ cB) != $true)) & (! [X0,X1] : (((cQ @ X0 @ X0) = $true) | ((cQ @ X0 @ X1) != $true)) & ((cR @ cA @ cB) = $true) & ! [X3,X2] : ((($true = (cQ @ X3 @ X2)) & ((cR @ X2 @ X3) = $true)) | ($true != (cR @ X3 @ X2))))),
% 0.14/0.38 inference(ennf_transformation,[],[f5])).
% 0.14/0.38 thf(f5,plain,(
% 0.14/0.38 ~((! [X1,X0] : (((cQ @ X0 @ X1) = $true) => ((cQ @ X0 @ X0) = $true)) & ((cR @ cA @ cB) = $true) & ! [X3,X2] : (($true = (cR @ X3 @ X2)) => (($true = (cQ @ X3 @ X2)) & ((cR @ X2 @ X3) = $true)))) => (((cQ @ cA @ cA) = $true) & ((cQ @ cB @ cB) = $true)))),
% 0.14/0.38 inference(fool_elimination,[],[f4])).
% 0.14/0.38 thf(f4,plain,(
% 0.14/0.38 ~(((cR @ cA @ cB) & ! [X0,X1] : ((cQ @ X0 @ X1) => (cQ @ X0 @ X0)) & ! [X2,X3] : ((cR @ X3 @ X2) => ((cR @ X2 @ X3) & (cQ @ X3 @ X2)))) => ((cQ @ cA @ cA) & (cQ @ cB @ cB)))),
% 0.14/0.38 inference(rectify,[],[f2])).
% 0.14/0.38 thf(f2,negated_conjecture,(
% 0.14/0.38 ~(((cR @ cA @ cB) & ! [X2,X3] : ((cQ @ X2 @ X3) => (cQ @ X2 @ X2)) & ! [X1,X0] : ((cR @ X0 @ X1) => ((cR @ X1 @ X0) & (cQ @ X0 @ X1)))) => ((cQ @ cA @ cA) & (cQ @ cB @ cB)))),
% 0.14/0.38 inference(negated_conjecture,[],[f1])).
% 0.14/0.38 thf(f1,conjecture,(
% 0.14/0.38 ((cR @ cA @ cB) & ! [X2,X3] : ((cQ @ X2 @ X3) => (cQ @ X2 @ X2)) & ! [X1,X0] : ((cR @ X0 @ X1) => ((cR @ X1 @ X0) & (cQ @ X0 @ X1)))) => ((cQ @ cA @ cA) & (cQ @ cB @ cB))),
% 0.14/0.38 file('/export/starexec/sandbox/benchmark/theBenchmark.p',cLX2107)).
% 0.14/0.38 thf(f12,plain,(
% 0.14/0.38 ( ! [X0 : $i,X1 : $i] : (((cR @ X0 @ X1) != $true) | ((cR @ X1 @ X0) = $true)) )),
% 0.14/0.38 inference(cnf_transformation,[],[f8])).
% 0.14/0.38 thf(f13,plain,(
% 0.14/0.38 ( ! [X0 : $i,X1 : $i] : (((cR @ X0 @ X1) != $true) | ((cQ @ X0 @ X1) = $true)) )),
% 0.14/0.38 inference(cnf_transformation,[],[f8])).
% 0.14/0.38 thf(f11,plain,(
% 0.14/0.38 ( ! [X2 : $i,X3 : $i] : (((cQ @ X2 @ X3) != $true) | ((cQ @ X2 @ X2) = $true)) )),
% 0.14/0.38 inference(cnf_transformation,[],[f8])).
% 0.14/0.38 thf(f33,plain,(
% 0.14/0.38 spl0_2),
% 0.14/0.38 inference(avatar_split_clause,[],[f32,f19])).
% 0.14/0.38 thf(f19,plain,(
% 0.14/0.38 spl0_2 <=> ((cQ @ cA @ cA) = $true)),
% 0.14/0.38 introduced(avatar_definition,[new_symbols(naming,[spl0_2])])).
% 0.14/0.38 thf(f32,plain,(
% 0.14/0.38 ((cQ @ cA @ cA) = $true)),
% 0.14/0.38 inference(trivial_inequality_removal,[],[f31])).
% 0.14/0.38 thf(f31,plain,(
% 0.14/0.38 ((cQ @ cA @ cA) = $true) | ($true != $true)),
% 0.14/0.38 inference(superposition,[],[f11,f29])).
% 0.14/0.38 thf(f29,plain,(
% 0.14/0.38 ($true = (cQ @ cA @ cB))),
% 0.14/0.38 inference(trivial_inequality_removal,[],[f27])).
% 0.14/0.38 thf(f27,plain,(
% 0.14/0.38 ($true = (cQ @ cA @ cB)) | ($true != $true)),
% 0.14/0.38 inference(superposition,[],[f13,f9])).
% 0.14/0.38 thf(f22,plain,(
% 0.14/0.38 ~spl0_1 | ~spl0_2),
% 0.14/0.38 inference(avatar_split_clause,[],[f10,f19,f15])).
% 0.14/0.38 thf(f10,plain,(
% 0.14/0.38 ((cQ @ cB @ cB) != $true) | ((cQ @ cA @ cA) != $true)),
% 0.14/0.38 inference(cnf_transformation,[],[f8])).
% 0.14/0.38 % SZS output end Proof for theBenchmark
% 0.14/0.38 % (8541)------------------------------
% 0.14/0.38 % (8541)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.14/0.38 % (8541)Termination reason: Refutation
% 0.14/0.38
% 0.14/0.38 % (8541)Memory used [KB]: 5500
% 0.14/0.38 % (8541)Time elapsed: 0.006 s
% 0.14/0.38 % (8541)Instructions burned: 3 (million)
% 0.14/0.38 % (8541)------------------------------
% 0.14/0.38 % (8541)------------------------------
% 0.14/0.38 % (8538)Success in time 0.006 s
% 0.14/0.39 % Vampire---4.8 exiting
%------------------------------------------------------------------------------