TSTP Solution File: SEU808^2 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SEU808^2 : TPTP v8.2.0. Released v3.7.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 : 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 03:51:43 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.04/0.09 % Problem : SEU808^2 : TPTP v8.2.0. Released v3.7.0.
% 0.04/0.10 % 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.10/0.30 % Computer : n027.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 : Sun May 19 17:23:07 EDT 2024
% 0.10/0.31 % CPUTime :
% 0.10/0.31 This is a TH0_THM_EQU_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/sandbox2/benchmark/theBenchmark.p
% 0.15/0.32 % (13404)lrs+10_1:1_au=on:inj=on:i=2:si=on:rtra=on_0 on theBenchmark for (3000ds/2Mi)
% 0.15/0.32 % (13407)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 % (13401)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.32 % (13403)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.15/0.32 % (13405)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 % (13402)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 % (13406)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 % (13404)Instruction limit reached!
% 0.15/0.32 % (13404)------------------------------
% 0.15/0.32 % (13404)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.15/0.32 % (13404)Termination reason: Unknown
% 0.15/0.32 % (13404)Termination phase: Saturation
% 0.15/0.32
% 0.15/0.32 % (13408)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.15/0.32 % (13404)Memory used [KB]: 5500
% 0.15/0.32 % (13404)Time elapsed: 0.003 s
% 0.15/0.32 % (13404)Instructions burned: 2 (million)
% 0.15/0.32 % (13404)------------------------------
% 0.15/0.32 % (13404)------------------------------
% 0.15/0.32 % (13407)First to succeed.
% 0.15/0.32 % (13406)Refutation not found, incomplete strategy
% 0.15/0.32 % (13406)------------------------------
% 0.15/0.32 % (13406)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.15/0.33 % (13406)Termination reason: Refutation not found, incomplete strategy
% 0.15/0.33
% 0.15/0.33
% 0.15/0.33 % (13406)Memory used [KB]: 5500
% 0.15/0.33 % (13406)Time elapsed: 0.003 s
% 0.15/0.33 % (13406)Instructions burned: 2 (million)
% 0.15/0.33 % (13406)------------------------------
% 0.15/0.33 % (13406)------------------------------
% 0.15/0.33 % (13408)Refutation not found, incomplete strategy
% 0.15/0.33 % (13408)------------------------------
% 0.15/0.33 % (13408)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.15/0.33 % (13408)Termination reason: Refutation not found, incomplete strategy
% 0.15/0.33
% 0.15/0.33
% 0.15/0.33 % (13401)Also succeeded, but the first one will report.
% 0.15/0.33 % (13408)Memory used [KB]: 5500
% 0.15/0.33 % (13408)Time elapsed: 0.003 s
% 0.15/0.33 % (13408)Instructions burned: 1 (million)
% 0.15/0.33 % (13408)------------------------------
% 0.15/0.33 % (13408)------------------------------
% 0.15/0.33 % (13402)Also succeeded, but the first one will report.
% 0.15/0.33 % (13407)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, in: $i > $i > $o).
% 0.15/0.33 thf(func_def_1, type, setadjoin: $i > $i > $i).
% 0.15/0.33 thf(func_def_5, type, omegaS: $i > $i).
% 0.15/0.33 thf(f34,plain,(
% 0.15/0.33 $false),
% 0.15/0.33 inference(subsumption_resolution,[],[f33,f30])).
% 0.15/0.33 thf(f30,plain,(
% 0.15/0.33 ($true != (in @ (setadjoin @ sK0 @ sK0) @ omega))),
% 0.15/0.33 inference(beta_eta_normalization,[],[f26])).
% 0.15/0.33 thf(f26,plain,(
% 0.15/0.33 ((in @ ((^[Y0 : $i]: (setadjoin @ Y0 @ Y0)) @ sK0) @ omega) != $true)),
% 0.15/0.33 inference(definition_unfolding,[],[f20,f25])).
% 0.15/0.33 thf(f25,plain,(
% 0.15/0.33 (omegaS = (^[Y0 : $i]: (setadjoin @ Y0 @ Y0)))),
% 0.15/0.33 inference(cnf_transformation,[],[f10])).
% 0.15/0.33 thf(f10,plain,(
% 0.15/0.33 (omegaS = (^[Y0 : $i]: (setadjoin @ Y0 @ Y0)))),
% 0.15/0.33 inference(fool_elimination,[],[f2])).
% 0.15/0.33 thf(f2,axiom,(
% 0.15/0.33 (omegaS = (^[X0 : $i] : (setadjoin @ X0 @ X0)))),
% 0.15/0.33 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',omegaS)).
% 0.15/0.33 thf(f20,plain,(
% 0.15/0.33 ($true != (in @ (omegaS @ sK0) @ omega))),
% 0.15/0.33 inference(cnf_transformation,[],[f14])).
% 0.15/0.33 thf(f14,plain,(
% 0.15/0.33 (($true = (in @ sK0 @ omega)) & ($true != (in @ (omegaS @ sK0) @ omega))) & (omegaSAx = $true)),
% 0.15/0.33 inference(skolemisation,[status(esa),new_symbols(skolem,[sK0])],[f12,f13])).
% 0.15/0.33 thf(f13,plain,(
% 0.15/0.33 ? [X0] : (((in @ X0 @ omega) = $true) & ((in @ (omegaS @ X0) @ omega) != $true)) => (($true = (in @ sK0 @ omega)) & ($true != (in @ (omegaS @ sK0) @ omega)))),
% 0.15/0.33 introduced(choice_axiom,[])).
% 0.15/0.33 thf(f12,plain,(
% 0.15/0.33 ? [X0] : (((in @ X0 @ omega) = $true) & ((in @ (omegaS @ X0) @ omega) != $true)) & (omegaSAx = $true)),
% 0.15/0.33 inference(ennf_transformation,[],[f7])).
% 0.15/0.33 thf(f7,plain,(
% 0.15/0.33 ~((omegaSAx = $true) => ! [X0] : (((in @ X0 @ omega) = $true) => ((in @ (omegaS @ X0) @ omega) = $true)))),
% 0.15/0.33 inference(fool_elimination,[],[f6])).
% 0.15/0.33 thf(f6,plain,(
% 0.15/0.33 ~(omegaSAx => ! [X0] : ((in @ X0 @ omega) => (in @ (omegaS @ X0) @ omega)))),
% 0.15/0.33 inference(rectify,[],[f4])).
% 0.15/0.33 thf(f4,negated_conjecture,(
% 0.15/0.33 ~(omegaSAx => ! [X0] : ((in @ X0 @ omega) => (in @ (omegaS @ X0) @ omega)))),
% 0.15/0.33 inference(negated_conjecture,[],[f3])).
% 0.15/0.33 thf(f3,conjecture,(
% 0.15/0.33 omegaSAx => ! [X0] : ((in @ X0 @ omega) => (in @ (omegaS @ X0) @ omega))),
% 0.15/0.33 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',omegaSp)).
% 0.15/0.33 thf(f33,plain,(
% 0.15/0.33 ($true = (in @ (setadjoin @ sK0 @ sK0) @ omega))),
% 0.15/0.33 inference(trivial_inequality_removal,[],[f32])).
% 0.15/0.33 thf(f32,plain,(
% 0.15/0.33 ($true = (in @ (setadjoin @ sK0 @ sK0) @ omega)) | ($true != $true)),
% 0.15/0.33 inference(superposition,[],[f31,f21])).
% 0.15/0.33 thf(f21,plain,(
% 0.15/0.33 ($true = (in @ sK0 @ omega))),
% 0.15/0.33 inference(cnf_transformation,[],[f14])).
% 0.15/0.33 thf(f31,plain,(
% 0.15/0.33 ( ! [X0 : $i] : (((in @ X0 @ omega) != $true) | ((in @ (setadjoin @ X0 @ X0) @ omega) = $true)) )),
% 0.15/0.33 inference(trivial_inequality_removal,[],[f27])).
% 0.15/0.33 thf(f27,plain,(
% 0.15/0.33 ( ! [X0 : $i] : (($true != $true) | ((in @ (setadjoin @ X0 @ X0) @ omega) = $true) | ((in @ X0 @ omega) != $true)) )),
% 0.15/0.33 inference(definition_unfolding,[],[f24,f19])).
% 0.15/0.33 thf(f19,plain,(
% 0.15/0.33 (omegaSAx = $true)),
% 0.15/0.33 inference(cnf_transformation,[],[f14])).
% 0.15/0.33 thf(f24,plain,(
% 0.15/0.33 ( ! [X0 : $i] : (((in @ X0 @ omega) != $true) | ((in @ (setadjoin @ X0 @ X0) @ omega) = $true) | (omegaSAx != $true)) )),
% 0.15/0.33 inference(cnf_transformation,[],[f18])).
% 0.15/0.33 thf(f18,plain,(
% 0.15/0.33 (! [X0] : (((in @ X0 @ omega) != $true) | ((in @ (setadjoin @ X0 @ X0) @ omega) = $true)) | (omegaSAx != $true)) & ((omegaSAx = $true) | (($true = (in @ sK1 @ omega)) & ($true != (in @ (setadjoin @ sK1 @ sK1) @ omega))))),
% 0.15/0.33 inference(skolemisation,[status(esa),new_symbols(skolem,[sK1])],[f16,f17])).
% 0.15/0.33 thf(f17,plain,(
% 0.15/0.33 ? [X1] : (($true = (in @ X1 @ omega)) & ($true != (in @ (setadjoin @ X1 @ X1) @ omega))) => (($true = (in @ sK1 @ omega)) & ($true != (in @ (setadjoin @ sK1 @ sK1) @ omega)))),
% 0.15/0.33 introduced(choice_axiom,[])).
% 0.15/0.33 thf(f16,plain,(
% 0.15/0.33 (! [X0] : (((in @ X0 @ omega) != $true) | ((in @ (setadjoin @ X0 @ X0) @ omega) = $true)) | (omegaSAx != $true)) & ((omegaSAx = $true) | ? [X1] : (($true = (in @ X1 @ omega)) & ($true != (in @ (setadjoin @ X1 @ X1) @ omega))))),
% 0.15/0.33 inference(rectify,[],[f15])).
% 0.15/0.33 thf(f15,plain,(
% 0.15/0.33 (! [X0] : (((in @ X0 @ omega) != $true) | ((in @ (setadjoin @ X0 @ X0) @ omega) = $true)) | (omegaSAx != $true)) & ((omegaSAx = $true) | ? [X0] : (((in @ X0 @ omega) = $true) & ((in @ (setadjoin @ X0 @ X0) @ omega) != $true)))),
% 0.15/0.33 inference(nnf_transformation,[],[f11])).
% 0.15/0.33 thf(f11,plain,(
% 0.15/0.33 ! [X0] : (((in @ X0 @ omega) != $true) | ((in @ (setadjoin @ X0 @ X0) @ omega) = $true)) <=> (omegaSAx = $true)),
% 0.15/0.33 inference(ennf_transformation,[],[f9])).
% 0.15/0.33 thf(f9,plain,(
% 0.15/0.33 (omegaSAx = $true) <=> ! [X0] : (((in @ X0 @ omega) = $true) => ((in @ (setadjoin @ X0 @ X0) @ omega) = $true))),
% 0.15/0.33 inference(fool_elimination,[],[f8])).
% 0.15/0.33 thf(f8,plain,(
% 0.15/0.33 (omegaSAx = ! [X0] : ((in @ X0 @ omega) => (in @ (setadjoin @ X0 @ X0) @ omega)))),
% 0.15/0.33 inference(rectify,[],[f1])).
% 0.15/0.33 thf(f1,axiom,(
% 0.15/0.33 (omegaSAx = ! [X0] : ((in @ X0 @ omega) => (in @ (setadjoin @ X0 @ X0) @ omega)))),
% 0.15/0.33 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',omegaSAx)).
% 0.15/0.33 % SZS output end Proof for theBenchmark
% 0.15/0.33 % (13407)------------------------------
% 0.15/0.33 % (13407)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.15/0.33 % (13407)Termination reason: Refutation
% 0.15/0.33
% 0.15/0.33 % (13407)Memory used [KB]: 5500
% 0.15/0.33 % (13407)Time elapsed: 0.004 s
% 0.15/0.33 % (13407)Instructions burned: 2 (million)
% 0.15/0.33 % (13407)------------------------------
% 0.15/0.33 % (13407)------------------------------
% 0.15/0.33 % (13400)Success in time 0.014 s
% 0.15/0.33 % Vampire---4.8 exiting
%------------------------------------------------------------------------------