TSTP Solution File: SEU608^2 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SEU608^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 : n008.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:49:56 EDT 2024
% Result : Theorem 0.16s 0.33s
% Output : Refutation 0.16s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.10 % Problem : SEU608^2 : TPTP v8.2.0. Released v3.7.0.
% 0.10/0.11 % 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.31 % Computer : n008.cluster.edu
% 0.11/0.31 % Model : x86_64 x86_64
% 0.11/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.31 % Memory : 8042.1875MB
% 0.11/0.31 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.31 % CPULimit : 300
% 0.11/0.31 % WCLimit : 300
% 0.11/0.31 % DateTime : Sun May 19 17:42:08 EDT 2024
% 0.11/0.31 % CPUTime :
% 0.11/0.31 This is a TH0_THM_EQU_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.16/0.33 % (27212)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.16/0.33 % (27215)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.16/0.33 % (27211)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.16/0.33 % (27213)lrs+1004_1:128_cond=on:e2e=on:sp=weighted_frequency:i=18:si=on:rtra=on_0 on theBenchmark for (3000ds/18Mi)
% 0.16/0.33 % (27215)Refutation not found, incomplete strategy
% 0.16/0.33 % (27215)------------------------------
% 0.16/0.33 % (27215)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.16/0.33 % (27212)First to succeed.
% 0.16/0.33 % (27215)Termination reason: Refutation not found, incomplete strategy
% 0.16/0.33
% 0.16/0.33
% 0.16/0.33 % (27215)Memory used [KB]: 5500
% 0.16/0.33 % (27215)Time elapsed: 0.003 s
% 0.16/0.33 % (27215)Instructions burned: 2 (million)
% 0.16/0.33 % (27215)------------------------------
% 0.16/0.33 % (27215)------------------------------
% 0.16/0.33 % (27209)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.16/0.33 % (27213)Also succeeded, but the first one will report.
% 0.16/0.33 % (27212)Refutation found. Thanks to Tanya!
% 0.16/0.33 % SZS status Theorem for theBenchmark
% 0.16/0.33 % SZS output start Proof for theBenchmark
% 0.16/0.33 thf(func_def_0, type, in: $i > $i > $o).
% 0.16/0.33 thf(func_def_1, type, setminus: $i > $i > $i).
% 0.16/0.33 thf(f32,plain,(
% 0.16/0.33 $false),
% 0.16/0.33 inference(subsumption_resolution,[],[f31,f20])).
% 0.16/0.33 thf(f20,plain,(
% 0.16/0.33 ((in @ sK1 @ sK2) = $true)),
% 0.16/0.33 inference(cnf_transformation,[],[f15])).
% 0.16/0.33 thf(f15,plain,(
% 0.16/0.33 (setminusER = $true) & (((in @ sK1 @ (setminus @ sK0 @ sK2)) = $true) & ((in @ sK1 @ sK2) = $true))),
% 0.16/0.33 inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2])],[f13,f14])).
% 0.16/0.33 thf(f14,plain,(
% 0.16/0.33 ? [X0,X1,X2] : (((in @ X1 @ (setminus @ X0 @ X2)) = $true) & ((in @ X1 @ X2) = $true)) => (((in @ sK1 @ (setminus @ sK0 @ sK2)) = $true) & ((in @ sK1 @ sK2) = $true))),
% 0.16/0.33 introduced(choice_axiom,[])).
% 0.16/0.33 thf(f13,plain,(
% 0.16/0.33 (setminusER = $true) & ? [X0,X1,X2] : (((in @ X1 @ (setminus @ X0 @ X2)) = $true) & ((in @ X1 @ X2) = $true))),
% 0.16/0.33 inference(rectify,[],[f11])).
% 0.16/0.33 thf(f11,plain,(
% 0.16/0.33 (setminusER = $true) & ? [X2,X0,X1] : (((in @ X0 @ (setminus @ X2 @ X1)) = $true) & ((in @ X0 @ X1) = $true))),
% 0.16/0.33 inference(ennf_transformation,[],[f9])).
% 0.16/0.33 thf(f9,plain,(
% 0.16/0.33 ~((setminusER = $true) => ! [X0,X1,X2] : (((in @ X0 @ X1) = $true) => ((in @ X0 @ (setminus @ X2 @ X1)) != $true)))),
% 0.16/0.33 inference(flattening,[],[f8])).
% 0.16/0.33 thf(f8,plain,(
% 0.16/0.33 ~((setminusER = $true) => ! [X0,X1,X2] : (((in @ X0 @ X1) = $true) => ~((in @ X0 @ (setminus @ X2 @ X1)) = $true)))),
% 0.16/0.33 inference(fool_elimination,[],[f7])).
% 0.16/0.33 thf(f7,plain,(
% 0.16/0.33 ~(setminusER => ! [X0,X1,X2] : ((in @ X0 @ X1) => ~(in @ X0 @ (setminus @ X2 @ X1))))),
% 0.16/0.33 inference(rectify,[],[f3])).
% 0.16/0.33 thf(f3,negated_conjecture,(
% 0.16/0.33 ~(setminusER => ! [X2,X1,X0] : ((in @ X2 @ X1) => ~(in @ X2 @ (setminus @ X0 @ X1))))),
% 0.16/0.33 inference(negated_conjecture,[],[f2])).
% 0.16/0.33 thf(f2,conjecture,(
% 0.16/0.33 setminusER => ! [X2,X1,X0] : ((in @ X2 @ X1) => ~(in @ X2 @ (setminus @ X0 @ X1)))),
% 0.16/0.33 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',setminusIRneg)).
% 0.16/0.33 thf(f31,plain,(
% 0.16/0.33 ((in @ sK1 @ sK2) != $true)),
% 0.16/0.33 inference(trivial_inequality_removal,[],[f30])).
% 0.16/0.33 thf(f30,plain,(
% 0.16/0.33 ((in @ sK1 @ sK2) != $true) | ($true != $true)),
% 0.16/0.33 inference(superposition,[],[f29,f21])).
% 0.16/0.33 thf(f21,plain,(
% 0.16/0.33 ((in @ sK1 @ (setminus @ sK0 @ sK2)) = $true)),
% 0.16/0.33 inference(cnf_transformation,[],[f15])).
% 0.16/0.33 thf(f29,plain,(
% 0.16/0.33 ( ! [X2 : $i,X0 : $i,X1 : $i] : (((in @ X2 @ (setminus @ X1 @ X0)) != $true) | ($true != (in @ X2 @ X0))) )),
% 0.16/0.33 inference(trivial_inequality_removal,[],[f26])).
% 0.16/0.33 thf(f26,plain,(
% 0.16/0.33 ( ! [X2 : $i,X0 : $i,X1 : $i] : (((in @ X2 @ (setminus @ X1 @ X0)) != $true) | ($true != $true) | ($true != (in @ X2 @ X0))) )),
% 0.16/0.33 inference(definition_unfolding,[],[f25,f22])).
% 0.16/0.33 thf(f22,plain,(
% 0.16/0.33 (setminusER = $true)),
% 0.16/0.33 inference(cnf_transformation,[],[f15])).
% 0.16/0.33 thf(f25,plain,(
% 0.16/0.33 ( ! [X2 : $i,X0 : $i,X1 : $i] : (($true != (in @ X2 @ X0)) | ((in @ X2 @ (setminus @ X1 @ X0)) != $true) | (setminusER != $true)) )),
% 0.16/0.33 inference(cnf_transformation,[],[f19])).
% 0.16/0.33 thf(f19,plain,(
% 0.16/0.33 (! [X0,X1,X2] : (($true != (in @ X2 @ X0)) | ((in @ X2 @ (setminus @ X1 @ X0)) != $true)) | (setminusER != $true)) & ((setminusER = $true) | (($true = (in @ sK5 @ sK3)) & ($true = (in @ sK5 @ (setminus @ sK4 @ sK3)))))),
% 0.16/0.33 inference(skolemisation,[status(esa),new_symbols(skolem,[sK3,sK4,sK5])],[f17,f18])).
% 0.16/0.33 thf(f18,plain,(
% 0.16/0.33 ? [X3,X4,X5] : (((in @ X5 @ X3) = $true) & ($true = (in @ X5 @ (setminus @ X4 @ X3)))) => (($true = (in @ sK5 @ sK3)) & ($true = (in @ sK5 @ (setminus @ sK4 @ sK3))))),
% 0.16/0.33 introduced(choice_axiom,[])).
% 0.16/0.33 thf(f17,plain,(
% 0.16/0.33 (! [X0,X1,X2] : (($true != (in @ X2 @ X0)) | ((in @ X2 @ (setminus @ X1 @ X0)) != $true)) | (setminusER != $true)) & ((setminusER = $true) | ? [X3,X4,X5] : (((in @ X5 @ X3) = $true) & ($true = (in @ X5 @ (setminus @ X4 @ X3)))))),
% 0.16/0.33 inference(rectify,[],[f16])).
% 0.16/0.33 thf(f16,plain,(
% 0.16/0.33 (! [X2,X1,X0] : (($true != (in @ X0 @ X2)) | ($true != (in @ X0 @ (setminus @ X1 @ X2)))) | (setminusER != $true)) & ((setminusER = $true) | ? [X2,X1,X0] : (($true = (in @ X0 @ X2)) & ($true = (in @ X0 @ (setminus @ X1 @ X2)))))),
% 0.16/0.33 inference(nnf_transformation,[],[f12])).
% 0.16/0.33 thf(f12,plain,(
% 0.16/0.33 ! [X2,X1,X0] : (($true != (in @ X0 @ X2)) | ($true != (in @ X0 @ (setminus @ X1 @ X2)))) <=> (setminusER = $true)),
% 0.16/0.33 inference(ennf_transformation,[],[f10])).
% 0.16/0.33 thf(f10,plain,(
% 0.16/0.33 (setminusER = $true) <=> ! [X2,X0,X1] : (($true = (in @ X0 @ (setminus @ X1 @ X2))) => ($true != (in @ X0 @ X2)))),
% 0.16/0.33 inference(flattening,[],[f6])).
% 0.16/0.33 thf(f6,plain,(
% 0.16/0.33 (setminusER = $true) <=> ! [X0,X1,X2] : (($true = (in @ X0 @ (setminus @ X1 @ X2))) => ~($true = (in @ X0 @ X2)))),
% 0.16/0.33 inference(fool_elimination,[],[f5])).
% 0.16/0.33 thf(f5,plain,(
% 0.16/0.33 (setminusER = ! [X0,X1,X2] : ((in @ X0 @ (setminus @ X1 @ X2)) => ~(in @ X0 @ X2)))),
% 0.16/0.33 inference(rectify,[],[f1])).
% 0.16/0.33 thf(f1,axiom,(
% 0.16/0.33 (setminusER = ! [X2,X0,X1] : ((in @ X2 @ (setminus @ X0 @ X1)) => ~(in @ X2 @ X1)))),
% 0.16/0.33 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',setminusER)).
% 0.16/0.33 % SZS output end Proof for theBenchmark
% 0.16/0.33 % (27212)------------------------------
% 0.16/0.33 % (27212)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.16/0.33 % (27212)Termination reason: Refutation
% 0.16/0.33
% 0.16/0.33 % (27212)Memory used [KB]: 5500
% 0.16/0.33 % (27212)Time elapsed: 0.004 s
% 0.16/0.33 % (27212)Instructions burned: 2 (million)
% 0.16/0.33 % (27212)------------------------------
% 0.16/0.33 % (27212)------------------------------
% 0.16/0.33 % (27206)Success in time 0.014 s
% 0.16/0.34 % Vampire---4.8 exiting
%------------------------------------------------------------------------------