TSTP Solution File: SEU572^2 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SEU572^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 : n002.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:40 EDT 2024
% Result : Theorem 0.13s 0.38s
% Output : Refutation 0.13s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12 % Problem : SEU572^2 : TPTP v8.2.0. Released v3.7.0.
% 0.10/0.14 % 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.13/0.35 % Computer : n002.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Sun May 19 17:00:53 EDT 2024
% 0.13/0.35 % CPUTime :
% 0.13/0.35 This is a TH0_THM_EQU_NAR problem
% 0.13/0.35 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.13/0.37 % (21631)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.13/0.37 % (21635)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.13/0.37 % (21633)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.13/0.37 % (21636)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.13/0.37 % (21637)lrs+1004_1:128_cond=on:e2e=on:sp=weighted_frequency:i=18:si=on:rtra=on_0 on theBenchmark for (2999ds/18Mi)
% 0.13/0.37 % (21635)Instruction limit reached!
% 0.13/0.37 % (21635)------------------------------
% 0.13/0.37 % (21635)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.13/0.37 % (21635)Termination reason: Unknown
% 0.13/0.37 % (21635)Termination phase: Property scanning
% 0.13/0.37
% 0.13/0.37 % (21635)Memory used [KB]: 895
% 0.13/0.37 % (21635)Time elapsed: 0.003 s
% 0.13/0.37 % (21635)Instructions burned: 2 (million)
% 0.13/0.37 % (21635)------------------------------
% 0.13/0.37 % (21635)------------------------------
% 0.13/0.38 % (21638)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.13/0.38 % (21636)First to succeed.
% 0.13/0.38 % (21638)Instruction limit reached!
% 0.13/0.38 % (21638)------------------------------
% 0.13/0.38 % (21638)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.13/0.38 % (21638)Termination reason: Unknown
% 0.13/0.38 % (21638)Termination phase: Saturation
% 0.13/0.38
% 0.13/0.38 % (21638)Memory used [KB]: 5500
% 0.13/0.38 % (21638)Time elapsed: 0.004 s
% 0.13/0.38 % (21638)Instructions burned: 3 (million)
% 0.13/0.38 % (21638)------------------------------
% 0.13/0.38 % (21638)------------------------------
% 0.13/0.38 % (21637)Also succeeded, but the first one will report.
% 0.13/0.38 % (21631)Also succeeded, but the first one will report.
% 0.13/0.38 % (21636)Refutation found. Thanks to Tanya!
% 0.13/0.38 % SZS status Theorem for theBenchmark
% 0.13/0.38 % SZS output start Proof for theBenchmark
% 0.13/0.38 thf(func_def_0, type, setadjoin: $i > $i > $i).
% 0.13/0.38 thf(func_def_1, type, subset: $i > $i > $o).
% 0.13/0.38 thf(f51,plain,(
% 0.13/0.38 $false),
% 0.13/0.38 inference(subsumption_resolution,[],[f50,f34])).
% 0.13/0.38 thf(f34,plain,(
% 0.13/0.38 ((subset @ sK4 @ sK5) = $true)),
% 0.13/0.38 inference(cnf_transformation,[],[f22])).
% 0.13/0.38 thf(f22,plain,(
% 0.13/0.38 (((subset @ sK4 @ sK5) = $true) & ((subset @ sK4 @ (setadjoin @ sK3 @ sK5)) != $true)) & (subsetTrans = $true) & (setadjoinSub = $true)),
% 0.13/0.38 inference(skolemisation,[status(esa),new_symbols(skolem,[sK3,sK4,sK5])],[f20,f21])).
% 0.13/0.38 thf(f21,plain,(
% 0.13/0.38 ? [X0,X1,X2] : (((subset @ X1 @ X2) = $true) & ((subset @ X1 @ (setadjoin @ X0 @ X2)) != $true)) => (((subset @ sK4 @ sK5) = $true) & ((subset @ sK4 @ (setadjoin @ sK3 @ sK5)) != $true))),
% 0.13/0.38 introduced(choice_axiom,[])).
% 0.13/0.38 thf(f20,plain,(
% 0.13/0.38 ? [X0,X1,X2] : (((subset @ X1 @ X2) = $true) & ((subset @ X1 @ (setadjoin @ X0 @ X2)) != $true)) & (subsetTrans = $true) & (setadjoinSub = $true)),
% 0.13/0.38 inference(rectify,[],[f13])).
% 0.13/0.38 thf(f13,plain,(
% 0.13/0.38 ? [X1,X0,X2] : (((subset @ X0 @ X2) = $true) & ($true != (subset @ X0 @ (setadjoin @ X1 @ X2)))) & (subsetTrans = $true) & (setadjoinSub = $true)),
% 0.13/0.38 inference(flattening,[],[f12])).
% 0.13/0.38 thf(f12,plain,(
% 0.13/0.38 (? [X1,X0,X2] : (((subset @ X0 @ X2) = $true) & ($true != (subset @ X0 @ (setadjoin @ X1 @ X2)))) & (setadjoinSub = $true)) & (subsetTrans = $true)),
% 0.13/0.38 inference(ennf_transformation,[],[f7])).
% 0.13/0.38 thf(f7,plain,(
% 0.13/0.38 ~((subsetTrans = $true) => ((setadjoinSub = $true) => ! [X2,X1,X0] : (((subset @ X0 @ X2) = $true) => ($true = (subset @ X0 @ (setadjoin @ X1 @ X2))))))),
% 0.13/0.38 inference(fool_elimination,[],[f6])).
% 0.13/0.38 thf(f6,plain,(
% 0.13/0.38 ~(subsetTrans => (setadjoinSub => ! [X0,X1,X2] : ((subset @ X0 @ X2) => (subset @ X0 @ (setadjoin @ X1 @ X2)))))),
% 0.13/0.38 inference(rectify,[],[f4])).
% 0.13/0.38 thf(f4,negated_conjecture,(
% 0.13/0.38 ~(subsetTrans => (setadjoinSub => ! [X0,X3,X1] : ((subset @ X0 @ X1) => (subset @ X0 @ (setadjoin @ X3 @ X1)))))),
% 0.13/0.38 inference(negated_conjecture,[],[f3])).
% 0.13/0.38 thf(f3,conjecture,(
% 0.13/0.38 subsetTrans => (setadjoinSub => ! [X0,X3,X1] : ((subset @ X0 @ X1) => (subset @ X0 @ (setadjoin @ X3 @ X1))))),
% 0.13/0.38 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',setadjoinSub2)).
% 0.13/0.38 thf(f50,plain,(
% 0.13/0.38 ((subset @ sK4 @ sK5) != $true)),
% 0.13/0.38 inference(trivial_inequality_removal,[],[f47])).
% 0.13/0.38 thf(f47,plain,(
% 0.13/0.38 ($true != $true) | ((subset @ sK4 @ sK5) != $true)),
% 0.13/0.38 inference(superposition,[],[f46,f44])).
% 0.13/0.38 thf(f44,plain,(
% 0.13/0.38 ( ! [X2 : $i,X3 : $i] : (($true = (subset @ X2 @ (setadjoin @ X3 @ X2)))) )),
% 0.13/0.38 inference(trivial_inequality_removal,[],[f42])).
% 0.13/0.38 thf(f42,plain,(
% 0.13/0.38 ( ! [X2 : $i,X3 : $i] : (($true != $true) | ($true = (subset @ X2 @ (setadjoin @ X3 @ X2)))) )),
% 0.13/0.38 inference(definition_unfolding,[],[f35,f31])).
% 0.13/0.38 thf(f31,plain,(
% 0.13/0.38 (setadjoinSub = $true)),
% 0.13/0.38 inference(cnf_transformation,[],[f22])).
% 0.13/0.38 thf(f35,plain,(
% 0.13/0.38 ( ! [X2 : $i,X3 : $i] : (($true = (subset @ X2 @ (setadjoin @ X3 @ X2))) | (setadjoinSub != $true)) )),
% 0.13/0.38 inference(cnf_transformation,[],[f26])).
% 0.13/0.38 thf(f26,plain,(
% 0.13/0.38 ((setadjoinSub = $true) | ((subset @ sK6 @ (setadjoin @ sK7 @ sK6)) != $true)) & (! [X2,X3] : ($true = (subset @ X2 @ (setadjoin @ X3 @ X2))) | (setadjoinSub != $true))),
% 0.13/0.38 inference(skolemisation,[status(esa),new_symbols(skolem,[sK6,sK7])],[f24,f25])).
% 0.13/0.38 thf(f25,plain,(
% 0.13/0.38 ? [X0,X1] : ($true != (subset @ X0 @ (setadjoin @ X1 @ X0))) => ((subset @ sK6 @ (setadjoin @ sK7 @ sK6)) != $true)),
% 0.13/0.38 introduced(choice_axiom,[])).
% 0.13/0.38 thf(f24,plain,(
% 0.13/0.38 ((setadjoinSub = $true) | ? [X0,X1] : ($true != (subset @ X0 @ (setadjoin @ X1 @ X0)))) & (! [X2,X3] : ($true = (subset @ X2 @ (setadjoin @ X3 @ X2))) | (setadjoinSub != $true))),
% 0.13/0.38 inference(rectify,[],[f23])).
% 0.13/0.38 thf(f23,plain,(
% 0.13/0.38 ((setadjoinSub = $true) | ? [X0,X1] : ($true != (subset @ X0 @ (setadjoin @ X1 @ X0)))) & (! [X0,X1] : ($true = (subset @ X0 @ (setadjoin @ X1 @ X0))) | (setadjoinSub != $true))),
% 0.13/0.38 inference(nnf_transformation,[],[f9])).
% 0.13/0.38 thf(f9,plain,(
% 0.13/0.38 (setadjoinSub = $true) <=> ! [X0,X1] : ($true = (subset @ X0 @ (setadjoin @ X1 @ X0)))),
% 0.13/0.38 inference(fool_elimination,[],[f8])).
% 0.13/0.38 thf(f8,plain,(
% 0.13/0.38 (setadjoinSub = ! [X0,X1] : (subset @ X0 @ (setadjoin @ X1 @ X0)))),
% 0.13/0.38 inference(rectify,[],[f2])).
% 0.13/0.38 thf(f2,axiom,(
% 0.13/0.38 (setadjoinSub = ! [X0,X3] : (subset @ X0 @ (setadjoin @ X3 @ X0)))),
% 0.13/0.38 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',setadjoinSub)).
% 0.13/0.38 thf(f46,plain,(
% 0.13/0.38 ( ! [X0 : $i] : (((subset @ X0 @ (setadjoin @ sK3 @ sK5)) != $true) | ((subset @ sK4 @ X0) != $true)) )),
% 0.13/0.38 inference(trivial_inequality_removal,[],[f45])).
% 0.13/0.38 thf(f45,plain,(
% 0.13/0.38 ( ! [X0 : $i] : (($true != $true) | ((subset @ sK4 @ X0) != $true) | ((subset @ X0 @ (setadjoin @ sK3 @ sK5)) != $true)) )),
% 0.13/0.38 inference(superposition,[],[f33,f43])).
% 0.13/0.38 thf(f43,plain,(
% 0.13/0.38 ( ! [X2 : $i,X0 : $i,X1 : $i] : (((subset @ X0 @ X2) = $true) | ((subset @ X0 @ X1) != $true) | ((subset @ X1 @ X2) != $true)) )),
% 0.13/0.38 inference(trivial_inequality_removal,[],[f37])).
% 0.13/0.38 thf(f37,plain,(
% 0.13/0.38 ( ! [X2 : $i,X0 : $i,X1 : $i] : (((subset @ X1 @ X2) != $true) | ($true != $true) | ((subset @ X0 @ X1) != $true) | ((subset @ X0 @ X2) = $true)) )),
% 0.13/0.38 inference(definition_unfolding,[],[f30,f32])).
% 0.13/0.38 thf(f32,plain,(
% 0.13/0.38 (subsetTrans = $true)),
% 0.13/0.38 inference(cnf_transformation,[],[f22])).
% 0.13/0.38 thf(f30,plain,(
% 0.13/0.38 ( ! [X2 : $i,X0 : $i,X1 : $i] : (((subset @ X0 @ X2) = $true) | ((subset @ X1 @ X2) != $true) | ((subset @ X0 @ X1) != $true) | (subsetTrans != $true)) )),
% 0.13/0.38 inference(cnf_transformation,[],[f19])).
% 0.13/0.38 thf(f19,plain,(
% 0.13/0.38 (! [X0,X1,X2] : (((subset @ X0 @ X2) = $true) | ((subset @ X1 @ X2) != $true) | ((subset @ X0 @ X1) != $true)) | (subsetTrans != $true)) & ((subsetTrans = $true) | (((subset @ sK0 @ sK2) != $true) & ((subset @ sK1 @ sK2) = $true) & ((subset @ sK0 @ sK1) = $true)))),
% 0.13/0.38 inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2])],[f17,f18])).
% 0.13/0.38 thf(f18,plain,(
% 0.13/0.38 ? [X3,X4,X5] : (($true != (subset @ X3 @ X5)) & ((subset @ X4 @ X5) = $true) & ($true = (subset @ X3 @ X4))) => (((subset @ sK0 @ sK2) != $true) & ((subset @ sK1 @ sK2) = $true) & ((subset @ sK0 @ sK1) = $true))),
% 0.13/0.38 introduced(choice_axiom,[])).
% 0.13/0.38 thf(f17,plain,(
% 0.13/0.38 (! [X0,X1,X2] : (((subset @ X0 @ X2) = $true) | ((subset @ X1 @ X2) != $true) | ((subset @ X0 @ X1) != $true)) | (subsetTrans != $true)) & ((subsetTrans = $true) | ? [X3,X4,X5] : (($true != (subset @ X3 @ X5)) & ((subset @ X4 @ X5) = $true) & ($true = (subset @ X3 @ X4))))),
% 0.13/0.38 inference(rectify,[],[f16])).
% 0.13/0.38 thf(f16,plain,(
% 0.13/0.38 (! [X2,X0,X1] : (((subset @ X2 @ X1) = $true) | ((subset @ X0 @ X1) != $true) | ((subset @ X2 @ X0) != $true)) | (subsetTrans != $true)) & ((subsetTrans = $true) | ? [X2,X0,X1] : (((subset @ X2 @ X1) != $true) & ((subset @ X0 @ X1) = $true) & ((subset @ X2 @ X0) = $true)))),
% 0.13/0.38 inference(nnf_transformation,[],[f15])).
% 0.13/0.38 thf(f15,plain,(
% 0.13/0.38 ! [X2,X0,X1] : (((subset @ X2 @ X1) = $true) | ((subset @ X0 @ X1) != $true) | ((subset @ X2 @ X0) != $true)) <=> (subsetTrans = $true)),
% 0.13/0.38 inference(flattening,[],[f14])).
% 0.13/0.38 thf(f14,plain,(
% 0.13/0.38 (subsetTrans = $true) <=> ! [X0,X2,X1] : ((((subset @ X2 @ X1) = $true) | ((subset @ X0 @ X1) != $true)) | ((subset @ X2 @ X0) != $true))),
% 0.13/0.38 inference(ennf_transformation,[],[f11])).
% 0.13/0.38 thf(f11,plain,(
% 0.13/0.38 (subsetTrans = $true) <=> ! [X0,X2,X1] : (((subset @ X2 @ X0) = $true) => (((subset @ X0 @ X1) = $true) => ((subset @ X2 @ X1) = $true)))),
% 0.13/0.38 inference(fool_elimination,[],[f10])).
% 0.13/0.38 thf(f10,plain,(
% 0.13/0.38 (! [X0,X1,X2] : ((subset @ X2 @ X0) => ((subset @ X0 @ X1) => (subset @ X2 @ X1))) = subsetTrans)),
% 0.13/0.38 inference(rectify,[],[f1])).
% 0.13/0.38 thf(f1,axiom,(
% 0.13/0.38 (! [X1,X2,X0] : ((subset @ X0 @ X1) => ((subset @ X1 @ X2) => (subset @ X0 @ X2))) = subsetTrans)),
% 0.13/0.38 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',subsetTrans)).
% 0.13/0.38 thf(f33,plain,(
% 0.13/0.38 ((subset @ sK4 @ (setadjoin @ sK3 @ sK5)) != $true)),
% 0.13/0.38 inference(cnf_transformation,[],[f22])).
% 0.13/0.38 % SZS output end Proof for theBenchmark
% 0.13/0.38 % (21636)------------------------------
% 0.13/0.38 % (21636)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.13/0.38 % (21636)Termination reason: Refutation
% 0.13/0.38
% 0.13/0.38 % (21636)Memory used [KB]: 5500
% 0.13/0.38 % (21636)Time elapsed: 0.006 s
% 0.13/0.38 % (21636)Instructions burned: 3 (million)
% 0.13/0.38 % (21636)------------------------------
% 0.13/0.38 % (21636)------------------------------
% 0.13/0.38 % (21630)Success in time 0.007 s
% 0.13/0.38 % Vampire---4.8 exiting
%------------------------------------------------------------------------------