TSTP Solution File: SEV472^1 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SEV472^1 : TPTP v8.2.0. Released v7.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/sandbox2/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% Computer : n009.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 04:13:55 EDT 2024
% Result : Theorem 0.20s 0.55s
% Output : Refutation 0.20s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SEV472^1 : TPTP v8.2.0. Released v7.0.0.
% 0.07/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 : n009.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 19:01:38 EDT 2024
% 0.13/0.35 % CPUTime :
% 0.13/0.35 This is a TH1_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.36 ipcrm: permission denied for id (1765638144)
% 0.13/0.39 ipcrm: permission denied for id (1765670931)
% 0.20/0.41 ipcrm: permission denied for id (1765703719)
% 0.20/0.43 ipcrm: permission denied for id (1765736505)
% 0.20/0.45 ipcrm: permission denied for id (1765769287)
% 0.20/0.53 % (1822)lrs+10_1:1_au=on:inj=on:i=2:si=on:rtra=on_0 on theBenchmark for (2998ds/2Mi)
% 0.20/0.53 % (1822)Instruction limit reached!
% 0.20/0.53 % (1822)------------------------------
% 0.20/0.53 % (1822)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.20/0.53 % (1822)Termination reason: Unknown
% 0.20/0.53 % (1822)Termination phase: Saturation
% 0.20/0.53
% 0.20/0.53 % (1822)Memory used [KB]: 5373
% 0.20/0.53 % (1822)Time elapsed: 0.002 s
% 0.20/0.53 % (1822)Instructions burned: 2 (million)
% 0.20/0.53 % (1822)------------------------------
% 0.20/0.53 % (1822)------------------------------
% 0.20/0.54 % (1819)lrs+1002_1:8_bd=off:fd=off:hud=10:tnu=1:i=183:si=on:rtra=on_0 on theBenchmark for (2998ds/183Mi)
% 0.20/0.54 % (1820)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 (2998ds/4Mi)
% 0.20/0.54 % (1821)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 (2998ds/27Mi)
% 0.20/0.54 % (1825)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 (2998ds/2Mi)
% 0.20/0.54 % (1826)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 (2998ds/275Mi)
% 0.20/0.54 % (1827)lrs+1004_1:128_cond=on:e2e=on:sp=weighted_frequency:i=18:si=on:rtra=on_0 on theBenchmark for (2998ds/18Mi)
% 0.20/0.54 % (1828)lrs+10_1:1_bet=on:cnfonf=off:fd=off:hud=5:inj=on:i=3:si=on:rtra=on_0 on theBenchmark for (2998ds/3Mi)
% 0.20/0.54 % (1825)Instruction limit reached!
% 0.20/0.54 % (1825)------------------------------
% 0.20/0.54 % (1825)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.20/0.54 % (1825)Termination reason: Unknown
% 0.20/0.54 % (1825)Termination phase: shuffling
% 0.20/0.54
% 0.20/0.54 % (1825)Memory used [KB]: 895
% 0.20/0.54 % (1825)Time elapsed: 0.003 s
% 0.20/0.54 % (1825)Instructions burned: 2 (million)
% 0.20/0.54 % (1825)------------------------------
% 0.20/0.54 % (1825)------------------------------
% 0.20/0.54 % (1826)Refutation not found, incomplete strategy
% 0.20/0.54 % (1826)------------------------------
% 0.20/0.54 % (1826)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.20/0.54 % (1826)Termination reason: Refutation not found, incomplete strategy
% 0.20/0.54
% 0.20/0.54 % (1820)Instruction limit reached!
% 0.20/0.54 % (1820)------------------------------
% 0.20/0.54 % (1820)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.20/0.54
% 0.20/0.54 % (1826)Memory used [KB]: 5500
% 0.20/0.54 % (1826)Time elapsed: 0.004 s
% 0.20/0.54 % (1826)Instructions burned: 2 (million)
% 0.20/0.54 % (1826)------------------------------
% 0.20/0.54 % (1826)------------------------------
% 0.20/0.54 % (1820)Termination reason: Unknown
% 0.20/0.54 % (1820)Termination phase: Saturation
% 0.20/0.54
% 0.20/0.54 % (1820)Memory used [KB]: 5500
% 0.20/0.54 % (1820)Time elapsed: 0.005 s
% 0.20/0.54 % (1820)Instructions burned: 4 (million)
% 0.20/0.54 % (1820)------------------------------
% 0.20/0.54 % (1820)------------------------------
% 0.20/0.54 % (1833)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 (2998ds/37Mi)
% 0.20/0.54 % (1828)Instruction limit reached!
% 0.20/0.54 % (1828)------------------------------
% 0.20/0.54 % (1828)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.20/0.54 % (1828)Termination reason: Unknown
% 0.20/0.54 % (1828)Termination phase: Saturation
% 0.20/0.54
% 0.20/0.54 % (1828)Memory used [KB]: 5500
% 0.20/0.54 % (1828)Time elapsed: 0.004 s
% 0.20/0.54 % (1828)Instructions burned: 3 (million)
% 0.20/0.54 % (1828)------------------------------
% 0.20/0.54 % (1828)------------------------------
% 0.20/0.54 % Exception at run slice level
% 0.20/0.54 User error: Vampire does not support full TH1. This benchmark is either outside of the TH1 fragment, or outside of the fragment supported by Vampire
% 0.20/0.55 % (1821)First to succeed.
% 0.20/0.55 % (1821)Refutation found. Thanks to Tanya!
% 0.20/0.55 % SZS status Theorem for theBenchmark
% 0.20/0.55 % SZS output start Proof for theBenchmark
% 0.20/0.55 thf(type_def_6, type, sK0: $tType).
% 0.20/0.55 thf(func_def_0, type, 'const/trivia/I': !>[X0: $tType]:(X0 > X0)).
% 0.20/0.55 thf(func_def_1, type, 'const/sets/SUBSET': !>[X0: $tType]:((X0 > $o) > (X0 > $o) > $o)).
% 0.20/0.55 thf(func_def_2, type, 'const/sets/SETSPEC': !>[X0: $tType]:(X0 > $o > X0 > $o)).
% 0.20/0.55 thf(func_def_3, type, 'const/sets/IN': !>[X0: $tType]:(X0 > (X0 > $o) > $o)).
% 0.20/0.55 thf(func_def_4, type, 'const/sets/GSPEC': !>[X0: $tType]:((X0 > $o) > X0 > $o)).
% 0.20/0.55 thf(func_def_5, type, 'const/sets/FINITE': !>[X0: $tType]:((X0 > $o) > $o)).
% 0.20/0.55 thf(func_def_7, type, vEPSILON: !>[X0: $tType]:((X0 > $o) > X0)).
% 0.20/0.55 thf(func_def_15, type, sK1: sK0 > $o).
% 0.20/0.55 thf(func_def_16, type, sK2: sK0 > $o).
% 0.20/0.55 thf(func_def_18, type, ph4: !>[X0: $tType]:(X0)).
% 0.20/0.55 thf(f33,plain,(
% 0.20/0.55 $false),
% 0.20/0.55 inference(trivial_inequality_removal,[],[f30])).
% 0.20/0.55 thf(f30,plain,(
% 0.20/0.55 ($true != $true)),
% 0.20/0.55 inference(superposition,[],[f19,f28])).
% 0.20/0.55 thf(f28,plain,(
% 0.20/0.55 ( ! [X0 : sK0 > $o] : (($true = ('const/sets/FINITE' @ sK0 @ ('const/sets/GSPEC' @ sK0 @ (^[Y0 : sK0]: (?? @ sK0 @ (^[Y1 : sK0]: ('const/sets/SETSPEC' @ sK0 @ Y0 @ ((X0 @ Y1) & ('const/sets/IN' @ sK0 @ Y1 @ sK1)) @ Y1)))))))) )),
% 0.20/0.55 inference(trivial_inequality_removal,[],[f27])).
% 0.20/0.55 thf(f27,plain,(
% 0.20/0.55 ( ! [X0 : sK0 > $o] : (($true = ('const/sets/FINITE' @ sK0 @ ('const/sets/GSPEC' @ sK0 @ (^[Y0 : sK0]: (?? @ sK0 @ (^[Y1 : sK0]: ('const/sets/SETSPEC' @ sK0 @ Y0 @ ((X0 @ Y1) & ('const/sets/IN' @ sK0 @ Y1 @ sK1)) @ Y1))))))) | ($true != $true)) )),
% 0.20/0.55 inference(superposition,[],[f25,f18])).
% 0.20/0.55 thf(f18,plain,(
% 0.20/0.55 (('const/sets/FINITE' @ sK0 @ sK1) = $true)),
% 0.20/0.55 inference(cnf_transformation,[],[f17])).
% 0.20/0.55 thf(f17,plain,(
% 0.20/0.55 (('const/sets/FINITE' @ sK0 @ ('const/sets/GSPEC' @ sK0 @ (^[Y0 : sK0]: (?? @ sK0 @ (^[Y1 : sK0]: ('const/sets/SETSPEC' @ sK0 @ Y0 @ ((sK2 @ Y1) & ('const/sets/IN' @ sK0 @ Y1 @ sK1)) @ Y1)))))) != $true) & (('const/sets/FINITE' @ sK0 @ sK1) = $true)),
% 0.20/0.55 inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2])],[f15,f16])).
% 0.20/0.55 thf(f16,plain,(
% 0.20/0.55 ? [X0 : $tType,X1 : X0 > $o,X2 : X0 > $o] : ((('const/sets/FINITE' @ X0 @ ('const/sets/GSPEC' @ X0 @ (^[Y0 : X0]: (?? @ X0 @ (^[Y1 : X0]: ('const/sets/SETSPEC' @ X0 @ Y0 @ ((X2 @ Y1) & ('const/sets/IN' @ X0 @ Y1 @ X1)) @ Y1)))))) != $true) & (('const/sets/FINITE' @ X0 @ X1) = $true)) => ((('const/sets/FINITE' @ sK0 @ ('const/sets/GSPEC' @ sK0 @ (^[Y0 : sK0]: (?? @ sK0 @ (^[Y1 : sK0]: ('const/sets/SETSPEC' @ sK0 @ Y0 @ ((sK2 @ Y1) & ('const/sets/IN' @ sK0 @ Y1 @ sK1)) @ Y1)))))) != $true) & (('const/sets/FINITE' @ sK0 @ sK1) = $true))),
% 0.20/0.55 introduced(choice_axiom,[])).
% 0.20/0.55 thf(f15,plain,(
% 0.20/0.55 ? [X0 : $tType,X1 : X0 > $o,X2 : X0 > $o] : ((('const/sets/FINITE' @ X0 @ ('const/sets/GSPEC' @ X0 @ (^[Y0 : X0]: (?? @ X0 @ (^[Y1 : X0]: ('const/sets/SETSPEC' @ X0 @ Y0 @ ((X2 @ Y1) & ('const/sets/IN' @ X0 @ Y1 @ X1)) @ Y1)))))) != $true) & (('const/sets/FINITE' @ X0 @ X1) = $true))),
% 0.20/0.55 inference(ennf_transformation,[],[f10])).
% 0.20/0.55 thf(f10,plain,(
% 0.20/0.55 ~! [X0 : $tType,X1 : X0 > $o,X2 : X0 > $o] : ((('const/sets/FINITE' @ X0 @ X1) = $true) => (('const/sets/FINITE' @ X0 @ ('const/sets/GSPEC' @ X0 @ (^[Y0 : X0]: (?? @ X0 @ (^[Y1 : X0]: ('const/sets/SETSPEC' @ X0 @ Y0 @ ((X2 @ Y1) & ('const/sets/IN' @ X0 @ Y1 @ X1)) @ Y1)))))) = $true))),
% 0.20/0.55 inference(fool_elimination,[],[f9])).
% 0.20/0.55 thf(f9,plain,(
% 0.20/0.55 ~! [X0 : $tType,X1 : X0 > $o,X2 : X0 > $o] : (('const/sets/FINITE' @ X0 @ X1) => ('const/sets/FINITE' @ X0 @ ('const/sets/GSPEC' @ X0 @ (^[X3 : X0] : (? [X4 : X0] : ('const/sets/SETSPEC' @ X0 @ X3 @ ('const/sets/IN' @ X0 @ X4 @ X1) & (X2 @ X4) @ X4))))))),
% 0.20/0.55 inference(rectify,[],[f5])).
% 0.20/0.55 thf(f5,negated_conjecture,(
% 0.20/0.55 ~! [X0 : $tType,X1 : X0 > $o,X3 : X0 > $o] : (('const/sets/FINITE' @ X0 @ X1) => ('const/sets/FINITE' @ X0 @ ('const/sets/GSPEC' @ X0 @ (^[X2 : X0] : (? [X4 : X0] : ('const/sets/SETSPEC' @ X0 @ X2 @ ('const/sets/IN' @ X0 @ X4 @ X1) & (X3 @ X4) @ X4))))))),
% 0.20/0.55 inference(negated_conjecture,[],[f4])).
% 0.20/0.55 thf(f4,conjecture,(
% 0.20/0.55 ! [X0 : $tType,X1 : X0 > $o,X3 : X0 > $o] : (('const/sets/FINITE' @ X0 @ X1) => ('const/sets/FINITE' @ X0 @ ('const/sets/GSPEC' @ X0 @ (^[X2 : X0] : (? [X4 : X0] : ('const/sets/SETSPEC' @ X0 @ X2 @ ('const/sets/IN' @ X0 @ X4 @ X1) & (X3 @ X4) @ X4))))))),
% 0.20/0.55 file('/export/starexec/sandbox2/benchmark/theBenchmark.p','thm/sets/FINITE_RESTRICT_')).
% 0.20/0.55 thf(f25,plain,(
% 0.20/0.55 ( ! [X0 : $tType,X2 : X0 > $o,X1 : X0 > $o] : ((('const/sets/FINITE' @ X0 @ X2) != $true) | (('const/sets/FINITE' @ X0 @ ('const/sets/GSPEC' @ X0 @ (^[Y0 : X0]: (?? @ X0 @ (^[Y1 : X0]: ('const/sets/SETSPEC' @ X0 @ Y0 @ ((X1 @ Y1) & ('const/sets/IN' @ X0 @ Y1 @ X2)) @ Y1)))))) = $true)) )),
% 0.20/0.55 inference(trivial_inequality_removal,[],[f24])).
% 0.20/0.55 thf(f24,plain,(
% 0.20/0.55 ( ! [X0 : $tType,X2 : X0 > $o,X1 : X0 > $o] : ((('const/sets/FINITE' @ X0 @ X2) != $true) | ($true != $true) | (('const/sets/FINITE' @ X0 @ ('const/sets/GSPEC' @ X0 @ (^[Y0 : X0]: (?? @ X0 @ (^[Y1 : X0]: ('const/sets/SETSPEC' @ X0 @ Y0 @ ((X1 @ Y1) & ('const/sets/IN' @ X0 @ Y1 @ X2)) @ Y1)))))) = $true)) )),
% 0.20/0.55 inference(superposition,[],[f20,f22])).
% 0.20/0.55 thf(f22,plain,(
% 0.20/0.55 ( ! [X0 : $tType,X2 : X0 > $o,X1 : X0 > $o] : ((('const/sets/SUBSET' @ X0 @ ('const/sets/GSPEC' @ X0 @ (^[Y0 : X0]: (?? @ X0 @ (^[Y1 : X0]: ('const/sets/SETSPEC' @ X0 @ Y0 @ ((X2 @ Y1) & ('const/sets/IN' @ X0 @ Y1 @ X1)) @ Y1))))) @ X1) = $true)) )),
% 0.20/0.55 inference(cnf_transformation,[],[f8])).
% 0.20/0.55 thf(f8,plain,(
% 0.20/0.55 ! [X0 : $tType,X1 : X0 > $o,X2 : X0 > $o] : (('const/sets/SUBSET' @ X0 @ ('const/sets/GSPEC' @ X0 @ (^[Y0 : X0]: (?? @ X0 @ (^[Y1 : X0]: ('const/sets/SETSPEC' @ X0 @ Y0 @ ((X2 @ Y1) & ('const/sets/IN' @ X0 @ Y1 @ X1)) @ Y1))))) @ X1) = $true)),
% 0.20/0.55 inference(fool_elimination,[],[f7])).
% 0.20/0.55 thf(f7,plain,(
% 0.20/0.55 ! [X0 : $tType,X1 : X0 > $o,X2 : X0 > $o] : ('const/sets/SUBSET' @ X0 @ ('const/sets/GSPEC' @ X0 @ (^[X3 : X0] : (? [X4 : X0] : ('const/sets/SETSPEC' @ X0 @ X3 @ ('const/sets/IN' @ X0 @ X4 @ X1) & (X2 @ X4) @ X4)))) @ X1)),
% 0.20/0.55 inference(rectify,[],[f3])).
% 0.20/0.55 thf(f3,axiom,(
% 0.20/0.55 ! [X0 : $tType,X1 : X0 > $o,X3 : X0 > $o] : ('const/sets/SUBSET' @ X0 @ ('const/sets/GSPEC' @ X0 @ (^[X2 : X0] : (? [X4 : X0] : ('const/sets/SETSPEC' @ X0 @ X2 @ ('const/sets/IN' @ X0 @ X4 @ X1) & (X3 @ X4) @ X4)))) @ X1)),
% 0.20/0.55 file('/export/starexec/sandbox2/benchmark/theBenchmark.p','thm/sets/SUBSET_RESTRICT_')).
% 0.20/0.55 thf(f20,plain,(
% 0.20/0.55 ( ! [X0 : $tType,X2 : X0 > $o,X1 : X0 > $o] : ((('const/sets/SUBSET' @ X0 @ X1 @ X2) != $true) | (('const/sets/FINITE' @ X0 @ X1) = $true) | (('const/sets/FINITE' @ X0 @ X2) != $true)) )),
% 0.20/0.55 inference(cnf_transformation,[],[f14])).
% 0.20/0.55 thf(f14,plain,(
% 0.20/0.55 ! [X0 : $tType,X1 : X0 > $o,X2 : X0 > $o] : ((('const/sets/FINITE' @ X0 @ X1) = $true) | (('const/sets/FINITE' @ X0 @ X2) != $true) | (('const/sets/SUBSET' @ X0 @ X1 @ X2) != $true))),
% 0.20/0.55 inference(flattening,[],[f13])).
% 0.20/0.55 thf(f13,plain,(
% 0.20/0.55 ! [X0 : $tType,X1 : X0 > $o,X2 : X0 > $o] : ((('const/sets/FINITE' @ X0 @ X1) = $true) | ((('const/sets/SUBSET' @ X0 @ X1 @ X2) != $true) | (('const/sets/FINITE' @ X0 @ X2) != $true)))),
% 0.20/0.55 inference(ennf_transformation,[],[f12])).
% 0.20/0.55 thf(f12,plain,(
% 0.20/0.55 ! [X0 : $tType,X1 : X0 > $o,X2 : X0 > $o] : (((('const/sets/SUBSET' @ X0 @ X1 @ X2) = $true) & (('const/sets/FINITE' @ X0 @ X2) = $true)) => (('const/sets/FINITE' @ X0 @ X1) = $true))),
% 0.20/0.55 inference(fool_elimination,[],[f11])).
% 0.20/0.55 thf(f11,plain,(
% 0.20/0.55 ! [X0 : $tType,X1 : X0 > $o,X2 : X0 > $o] : ((('const/sets/SUBSET' @ X0 @ X1 @ X2) & ('const/sets/FINITE' @ X0 @ X2)) => ('const/sets/FINITE' @ X0 @ X1))),
% 0.20/0.55 inference(rectify,[],[f2])).
% 0.20/0.55 thf(f2,axiom,(
% 0.20/0.55 ! [X0 : $tType,X1 : X0 > $o,X2 : X0 > $o] : ((('const/sets/SUBSET' @ X0 @ X1 @ X2) & ('const/sets/FINITE' @ X0 @ X2)) => ('const/sets/FINITE' @ X0 @ X1))),
% 0.20/0.55 file('/export/starexec/sandbox2/benchmark/theBenchmark.p','thm/sets/FINITE_SUBSET_')).
% 0.20/0.55 thf(f19,plain,(
% 0.20/0.55 (('const/sets/FINITE' @ sK0 @ ('const/sets/GSPEC' @ sK0 @ (^[Y0 : sK0]: (?? @ sK0 @ (^[Y1 : sK0]: ('const/sets/SETSPEC' @ sK0 @ Y0 @ ((sK2 @ Y1) & ('const/sets/IN' @ sK0 @ Y1 @ sK1)) @ Y1)))))) != $true)),
% 0.20/0.55 inference(cnf_transformation,[],[f17])).
% 0.20/0.55 % SZS output end Proof for theBenchmark
% 0.20/0.55 % (1821)------------------------------
% 0.20/0.55 % (1821)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.20/0.55 % (1821)Termination reason: Refutation
% 0.20/0.55
% 0.20/0.55 % (1821)Memory used [KB]: 5500
% 0.20/0.55 % (1821)Time elapsed: 0.009 s
% 0.20/0.55 % (1821)Instructions burned: 8 (million)
% 0.20/0.55 % (1821)------------------------------
% 0.20/0.55 % (1821)------------------------------
% 0.20/0.55 % (1618)Success in time 0.19 s
% 0.20/0.55 % Vampire---4.8 exiting
%------------------------------------------------------------------------------