TSTP Solution File: SEU819^2 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SEU819^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 : n019.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:48 EDT 2024
% Result : Theorem 0.21s 0.37s
% Output : Refutation 0.21s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.12 % Problem : SEU819^2 : TPTP v8.2.0. Released v3.7.0.
% 0.04/0.13 % 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.14/0.34 % Computer : n019.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 300
% 0.14/0.34 % DateTime : Sun May 19 16:24:08 EDT 2024
% 0.14/0.35 % CPUTime :
% 0.14/0.35 This is a TH0_THM_EQU_NAR problem
% 0.14/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.14/0.36 % (338)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.14/0.36 % (338)Instruction limit reached!
% 0.14/0.36 % (338)------------------------------
% 0.14/0.36 % (338)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.14/0.36 % (338)Termination reason: Unknown
% 0.14/0.36 % (338)Termination phase: Function definition elimination
% 0.14/0.36
% 0.14/0.36 % (338)Memory used [KB]: 1023
% 0.14/0.36 % (338)Time elapsed: 0.002 s
% 0.14/0.36 % (338)Instructions burned: 4 (million)
% 0.14/0.36 % (338)------------------------------
% 0.14/0.36 % (338)------------------------------
% 0.14/0.37 % (339)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.14/0.37 % (336)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.14/0.37 % (340)lrs+1004_1:128_cond=on:e2e=on:sp=weighted_frequency:i=18:si=on:rtra=on_0 on theBenchmark for (2999ds/18Mi)
% 0.14/0.37 % (334)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.21/0.37 % (337)lrs+10_1:1_au=on:inj=on:i=2:si=on:rtra=on_0 on theBenchmark for (2999ds/2Mi)
% 0.21/0.37 % (341)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.21/0.37 % (335)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.21/0.37 % (337)Instruction limit reached!
% 0.21/0.37 % (337)------------------------------
% 0.21/0.37 % (337)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.21/0.37 % (337)Termination reason: Unknown
% 0.21/0.37 % (337)Termination phase: Preprocessing 1
% 0.21/0.37
% 0.21/0.37 % (337)Memory used [KB]: 1023
% 0.21/0.37 % (337)Time elapsed: 0.003 s
% 0.21/0.37 % (337)Instructions burned: 3 (million)
% 0.21/0.37 % (337)------------------------------
% 0.21/0.37 % (337)------------------------------
% 0.21/0.37 % (341)Instruction limit reached!
% 0.21/0.37 % (341)------------------------------
% 0.21/0.37 % (341)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.21/0.37 % (341)Termination reason: Unknown
% 0.21/0.37 % (341)Termination phase: Property scanning
% 0.21/0.37
% 0.21/0.37 % (341)Memory used [KB]: 1023
% 0.21/0.37 % (341)Time elapsed: 0.003 s
% 0.21/0.37 % (341)Instructions burned: 3 (million)
% 0.21/0.37 % (341)------------------------------
% 0.21/0.37 % (341)------------------------------
% 0.21/0.37 % (345)lrs+1002_1:1_cnfonf=lazy_not_be_gen:hud=14:prag=on:sp=weighted_frequency:tnu=1:i=37:si=on:rtra=on_0 on theBenchmark for (2999ds/37Mi)
% 0.21/0.37 % (339)First to succeed.
% 0.21/0.37 % (335)Instruction limit reached!
% 0.21/0.37 % (335)------------------------------
% 0.21/0.37 % (335)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.21/0.37 % (335)Termination reason: Unknown
% 0.21/0.37 % (335)Termination phase: Property scanning
% 0.21/0.37
% 0.21/0.37 % (335)Memory used [KB]: 1023
% 0.21/0.37 % (335)Time elapsed: 0.004 s
% 0.21/0.37 % (335)Instructions burned: 4 (million)
% 0.21/0.37 % (335)------------------------------
% 0.21/0.37 % (335)------------------------------
% 0.21/0.37 % (339)Refutation found. Thanks to Tanya!
% 0.21/0.37 % SZS status Theorem for theBenchmark
% 0.21/0.37 % SZS output start Proof for theBenchmark
% 0.21/0.37 thf(func_def_0, type, in: $i > $i > $o).
% 0.21/0.37 thf(func_def_2, type, powerset: $i > $i).
% 0.21/0.37 thf(func_def_3, type, setunion: $i > $i).
% 0.21/0.37 thf(func_def_4, type, nonempty: $i > $o).
% 0.21/0.37 thf(func_def_5, type, subset: $i > $i > $o).
% 0.21/0.37 thf(func_def_6, type, transitiveset: $i > $o).
% 0.21/0.37 thf(func_def_9, type, stricttotalorderedByIn: $i > $o).
% 0.21/0.37 thf(func_def_10, type, wellorderedByIn: $i > $o).
% 0.21/0.37 thf(func_def_11, type, ordinal: $i > $o).
% 0.21/0.37 thf(func_def_27, type, sK1: $i > $i).
% 0.21/0.37 thf(f58,plain,(
% 0.21/0.37 $false),
% 0.21/0.37 inference(subsumption_resolution,[],[f57,f51])).
% 0.21/0.37 thf(f51,plain,(
% 0.21/0.37 ($true != (transitiveset @ (sK1 @ sK0)))),
% 0.21/0.37 inference(trivial_inequality_removal,[],[f50])).
% 0.21/0.37 thf(f50,plain,(
% 0.21/0.37 ($true != $true) | ($true != (transitiveset @ (sK1 @ sK0)))),
% 0.21/0.37 inference(superposition,[],[f34,f45])).
% 0.21/0.37 thf(f45,plain,(
% 0.21/0.37 ( ! [X0 : $i] : (($true = (transitiveset @ (setunion @ X0))) | ($true != (transitiveset @ (sK1 @ X0)))) )),
% 0.21/0.37 inference(trivial_inequality_removal,[],[f41])).
% 0.21/0.37 thf(f41,plain,(
% 0.21/0.37 ( ! [X0 : $i] : (($true = (transitiveset @ (setunion @ X0))) | ($true != (transitiveset @ (sK1 @ X0))) | ($true != $true)) )),
% 0.21/0.37 inference(definition_unfolding,[],[f39,f33])).
% 0.21/0.37 thf(f33,plain,(
% 0.21/0.37 (setunionTransitive = $true)),
% 0.21/0.37 inference(cnf_transformation,[],[f26])).
% 0.21/0.37 thf(f26,plain,(
% 0.21/0.37 (! [X1] : (($true = (ordinal @ X1)) | ($true != (in @ X1 @ sK0))) & ($true != (transitiveset @ (setunion @ sK0)))) & (setunionTransitive = $true)),
% 0.21/0.37 inference(skolemisation,[status(esa),new_symbols(skolem,[sK0])],[f23,f25])).
% 0.21/0.37 thf(f25,plain,(
% 0.21/0.37 ? [X0] : (! [X1] : (($true = (ordinal @ X1)) | ($true != (in @ X1 @ X0))) & ($true != (transitiveset @ (setunion @ X0)))) => (! [X1] : (($true = (ordinal @ X1)) | ($true != (in @ X1 @ sK0))) & ($true != (transitiveset @ (setunion @ sK0))))),
% 0.21/0.37 introduced(choice_axiom,[])).
% 0.21/0.37 thf(f23,plain,(
% 0.21/0.37 ? [X0] : (! [X1] : (($true = (ordinal @ X1)) | ($true != (in @ X1 @ X0))) & ($true != (transitiveset @ (setunion @ X0)))) & (setunionTransitive = $true)),
% 0.21/0.37 inference(ennf_transformation,[],[f15])).
% 0.21/0.37 thf(f15,plain,(
% 0.21/0.37 ~((setunionTransitive = $true) => ! [X0] : (! [X1] : (($true = (in @ X1 @ X0)) => ($true = (ordinal @ X1))) => ($true = (transitiveset @ (setunion @ X0)))))),
% 0.21/0.37 inference(fool_elimination,[],[f14])).
% 0.21/0.37 thf(f14,plain,(
% 0.21/0.37 ~(setunionTransitive => ! [X0] : (! [X1] : ((in @ X1 @ X0) => (ordinal @ X1)) => (transitiveset @ (setunion @ X0))))),
% 0.21/0.37 inference(rectify,[],[f8])).
% 0.21/0.37 thf(f8,negated_conjecture,(
% 0.21/0.37 ~(setunionTransitive => ! [X2] : (! [X0] : ((in @ X0 @ X2) => (ordinal @ X0)) => (transitiveset @ (setunion @ X2))))),
% 0.21/0.37 inference(negated_conjecture,[],[f7])).
% 0.21/0.37 thf(f7,conjecture,(
% 0.21/0.37 setunionTransitive => ! [X2] : (! [X0] : ((in @ X0 @ X2) => (ordinal @ X0)) => (transitiveset @ (setunion @ X2)))),
% 0.21/0.37 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',setunionOrdinalLem1)).
% 0.21/0.37 thf(f39,plain,(
% 0.21/0.37 ( ! [X0 : $i] : (($true = (transitiveset @ (setunion @ X0))) | ($true != (transitiveset @ (sK1 @ X0))) | (setunionTransitive != $true)) )),
% 0.21/0.37 inference(cnf_transformation,[],[f31])).
% 0.21/0.37 thf(f31,plain,(
% 0.21/0.37 (! [X0] : (($true = (transitiveset @ (setunion @ X0))) | (($true != (transitiveset @ (sK1 @ X0))) & ($true = (in @ (sK1 @ X0) @ X0)))) | (setunionTransitive != $true)) & ((setunionTransitive = $true) | (($true != (transitiveset @ (setunion @ sK2))) & ! [X3] : (($true = (transitiveset @ X3)) | ($true != (in @ X3 @ sK2)))))),
% 0.21/0.37 inference(skolemisation,[status(esa),new_symbols(skolem,[sK1,sK2])],[f28,f30,f29])).
% 0.21/0.37 thf(f29,plain,(
% 0.21/0.37 ! [X0] : (? [X1] : (($true != (transitiveset @ X1)) & ($true = (in @ X1 @ X0))) => (($true != (transitiveset @ (sK1 @ X0))) & ($true = (in @ (sK1 @ X0) @ X0))))),
% 0.21/0.37 introduced(choice_axiom,[])).
% 0.21/0.37 thf(f30,plain,(
% 0.21/0.37 ? [X2] : (((transitiveset @ (setunion @ X2)) != $true) & ! [X3] : (($true = (transitiveset @ X3)) | ((in @ X3 @ X2) != $true))) => (($true != (transitiveset @ (setunion @ sK2))) & ! [X3] : (($true = (transitiveset @ X3)) | ($true != (in @ X3 @ sK2))))),
% 0.21/0.37 introduced(choice_axiom,[])).
% 0.21/0.37 thf(f28,plain,(
% 0.21/0.37 (! [X0] : (($true = (transitiveset @ (setunion @ X0))) | ? [X1] : (($true != (transitiveset @ X1)) & ($true = (in @ X1 @ X0)))) | (setunionTransitive != $true)) & ((setunionTransitive = $true) | ? [X2] : (((transitiveset @ (setunion @ X2)) != $true) & ! [X3] : (($true = (transitiveset @ X3)) | ((in @ X3 @ X2) != $true))))),
% 0.21/0.37 inference(rectify,[],[f27])).
% 0.21/0.37 thf(f27,plain,(
% 0.21/0.37 (! [X0] : (($true = (transitiveset @ (setunion @ X0))) | ? [X1] : (($true != (transitiveset @ X1)) & ($true = (in @ X1 @ X0)))) | (setunionTransitive != $true)) & ((setunionTransitive = $true) | ? [X0] : (($true != (transitiveset @ (setunion @ X0))) & ! [X1] : (($true = (transitiveset @ X1)) | ($true != (in @ X1 @ X0)))))),
% 0.21/0.37 inference(nnf_transformation,[],[f24])).
% 0.21/0.37 thf(f24,plain,(
% 0.21/0.37 ! [X0] : (($true = (transitiveset @ (setunion @ X0))) | ? [X1] : (($true != (transitiveset @ X1)) & ($true = (in @ X1 @ X0)))) <=> (setunionTransitive = $true)),
% 0.21/0.37 inference(ennf_transformation,[],[f11])).
% 0.21/0.37 thf(f11,plain,(
% 0.21/0.37 ! [X0] : (! [X1] : (($true = (in @ X1 @ X0)) => ($true = (transitiveset @ X1))) => ($true = (transitiveset @ (setunion @ X0)))) <=> (setunionTransitive = $true)),
% 0.21/0.37 inference(fool_elimination,[],[f10])).
% 0.21/0.37 thf(f10,plain,(
% 0.21/0.37 (setunionTransitive = ! [X0] : (! [X1] : ((in @ X1 @ X0) => (transitiveset @ X1)) => (transitiveset @ (setunion @ X0))))),
% 0.21/0.37 inference(rectify,[],[f3])).
% 0.21/0.37 thf(f3,axiom,(
% 0.21/0.37 (setunionTransitive = ! [X2] : (! [X0] : ((in @ X0 @ X2) => (transitiveset @ X0)) => (transitiveset @ (setunion @ X2))))),
% 0.21/0.37 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',setunionTransitive)).
% 0.21/0.37 thf(f34,plain,(
% 0.21/0.37 ($true != (transitiveset @ (setunion @ sK0)))),
% 0.21/0.37 inference(cnf_transformation,[],[f26])).
% 0.21/0.37 thf(f57,plain,(
% 0.21/0.37 ($true = (transitiveset @ (sK1 @ sK0)))),
% 0.21/0.37 inference(subsumption_resolution,[],[f56,f34])).
% 0.21/0.37 thf(f56,plain,(
% 0.21/0.37 ($true = (transitiveset @ (setunion @ sK0))) | ($true = (transitiveset @ (sK1 @ sK0)))),
% 0.21/0.37 inference(trivial_inequality_removal,[],[f55])).
% 0.21/0.37 thf(f55,plain,(
% 0.21/0.37 ($true != $true) | ($true = (transitiveset @ (sK1 @ sK0))) | ($true = (transitiveset @ (setunion @ sK0)))),
% 0.21/0.37 inference(superposition,[],[f49,f46])).
% 0.21/0.37 thf(f46,plain,(
% 0.21/0.37 ( ! [X0 : $i] : (($true = (in @ (sK1 @ X0) @ X0)) | ($true = (transitiveset @ (setunion @ X0)))) )),
% 0.21/0.37 inference(trivial_inequality_removal,[],[f42])).
% 0.21/0.37 thf(f42,plain,(
% 0.21/0.37 ( ! [X0 : $i] : (($true = (transitiveset @ (setunion @ X0))) | ($true != $true) | ($true = (in @ (sK1 @ X0) @ X0))) )),
% 0.21/0.37 inference(definition_unfolding,[],[f38,f33])).
% 0.21/0.37 thf(f38,plain,(
% 0.21/0.37 ( ! [X0 : $i] : (($true = (transitiveset @ (setunion @ X0))) | ($true = (in @ (sK1 @ X0) @ X0)) | (setunionTransitive != $true)) )),
% 0.21/0.37 inference(cnf_transformation,[],[f31])).
% 0.21/0.37 thf(f49,plain,(
% 0.21/0.37 ( ! [X1 : $i] : (($true != (in @ X1 @ sK0)) | ($true = (transitiveset @ X1))) )),
% 0.21/0.37 inference(binary_proxy_clausification,[],[f47])).
% 0.21/0.37 thf(f47,plain,(
% 0.21/0.37 ( ! [X1 : $i] : (($true != (in @ X1 @ sK0)) | ($true = ((transitiveset @ X1) & (wellorderedByIn @ X1)))) )),
% 0.21/0.37 inference(beta_eta_normalization,[],[f40])).
% 0.21/0.37 thf(f40,plain,(
% 0.21/0.37 ( ! [X1 : $i] : (($true != (in @ X1 @ sK0)) | ($true = ((^[Y0 : $i]: ((transitiveset @ Y0) & (wellorderedByIn @ Y0))) @ X1))) )),
% 0.21/0.37 inference(definition_unfolding,[],[f35,f32])).
% 0.21/0.37 thf(f32,plain,(
% 0.21/0.37 (ordinal = (^[Y0 : $i]: ((transitiveset @ Y0) & (wellorderedByIn @ Y0))))),
% 0.21/0.37 inference(cnf_transformation,[],[f20])).
% 0.21/0.37 thf(f20,plain,(
% 0.21/0.37 (ordinal = (^[Y0 : $i]: ((transitiveset @ Y0) & (wellorderedByIn @ Y0))))),
% 0.21/0.37 inference(fool_elimination,[],[f19])).
% 0.21/0.37 thf(f19,plain,(
% 0.21/0.37 (ordinal = (^[X0 : $i] : ((wellorderedByIn @ X0) & (transitiveset @ X0))))),
% 0.21/0.37 inference(rectify,[],[f6])).
% 0.21/0.37 thf(f6,axiom,(
% 0.21/0.37 (ordinal = (^[X0 : $i] : ((wellorderedByIn @ X0) & (transitiveset @ X0))))),
% 0.21/0.37 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ordinal)).
% 0.21/0.37 thf(f35,plain,(
% 0.21/0.37 ( ! [X1 : $i] : (($true = (ordinal @ X1)) | ($true != (in @ X1 @ sK0))) )),
% 0.21/0.37 inference(cnf_transformation,[],[f26])).
% 0.21/0.37 % SZS output end Proof for theBenchmark
% 0.21/0.37 % (339)------------------------------
% 0.21/0.37 % (339)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.21/0.37 % (339)Termination reason: Refutation
% 0.21/0.37
% 0.21/0.37 % (339)Memory used [KB]: 5500
% 0.21/0.37 % (339)Time elapsed: 0.006 s
% 0.21/0.37 % (339)Instructions burned: 5 (million)
% 0.21/0.37 % (339)------------------------------
% 0.21/0.37 % (339)------------------------------
% 0.21/0.37 % (331)Success in time 0.014 s
% 0.21/0.37 % Vampire---4.8 exiting
%------------------------------------------------------------------------------