TSTP Solution File: NUM415^1 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : NUM415^1 : TPTP v8.2.0. Released v3.6.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 : n026.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 01:41:47 EDT 2024
% Result : Theorem 0.15s 0.33s
% Output : Refutation 0.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 22
% Syntax : Number of formulae : 44 ( 30 unt; 14 typ; 0 def)
% Number of atoms : 30 ( 29 equ; 0 cnn)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 215 ( 5 ~; 0 |; 0 &; 210 @)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 2 ( 1 avg)
% Number of types : 1 ( 0 usr)
% Number of type conns : 177 ( 177 >; 0 *; 0 +; 0 <<)
% Number of symbols : 16 ( 14 usr; 1 con; 0-4 aty)
% Number of variables : 100 ( 100 ^ 0 !; 0 ?; 100 :)
% Comments :
%------------------------------------------------------------------------------
thf(func_def_0,type,
zero: ( $i > $i ) > $i > $i ).
thf(func_def_1,type,
one: ( $i > $i ) > $i > $i ).
thf(func_def_2,type,
two: ( $i > $i ) > $i > $i ).
thf(func_def_3,type,
three: ( $i > $i ) > $i > $i ).
thf(func_def_4,type,
four: ( $i > $i ) > $i > $i ).
thf(func_def_5,type,
five: ( $i > $i ) > $i > $i ).
thf(func_def_6,type,
six: ( $i > $i ) > $i > $i ).
thf(func_def_7,type,
seven: ( $i > $i ) > $i > $i ).
thf(func_def_8,type,
eight: ( $i > $i ) > $i > $i ).
thf(func_def_9,type,
nine: ( $i > $i ) > $i > $i ).
thf(func_def_10,type,
ten: ( $i > $i ) > $i > $i ).
thf(func_def_11,type,
succ: ( ( $i > $i ) > $i > $i ) > ( $i > $i ) > $i > $i ).
thf(func_def_12,type,
plus: ( ( $i > $i ) > $i > $i ) > ( ( $i > $i ) > $i > $i ) > ( $i > $i ) > $i > $i ).
thf(func_def_13,type,
mult: ( ( $i > $i ) > $i > $i ) > ( ( $i > $i ) > $i > $i ) > ( $i > $i ) > $i > $i ).
thf(f46,plain,
$false,
inference(trivial_inequality_removal,[],[f45]) ).
thf(f45,plain,
( ( ^ [Y0: $i > $i,Y1: $i] : ( Y0 @ ( Y0 @ ( Y0 @ ( Y0 @ ( Y0 @ ( Y0 @ ( Y0 @ ( Y0 @ ( Y0 @ ( Y0 @ ( Y0 @ ( Y0 @ ( Y0 @ ( Y0 @ ( Y0 @ ( Y0 @ ( Y0 @ ( Y0 @ ( Y0 @ ( Y0 @ Y1 ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) )
!= ( ^ [Y0: $i > $i,Y1: $i] : ( Y0 @ ( Y0 @ ( Y0 @ ( Y0 @ ( Y0 @ ( Y0 @ ( Y0 @ ( Y0 @ ( Y0 @ ( Y0 @ ( Y0 @ ( Y0 @ ( Y0 @ ( Y0 @ ( Y0 @ ( Y0 @ ( Y0 @ ( Y0 @ ( Y0 @ ( Y0 @ Y1 ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ),
inference(beta_eta_normalization,[],[f44]) ).
thf(f44,plain,
( ( ^ [Y0: ( $i > $i ) > $i > $i,Y1: ( $i > $i ) > $i > $i,Y2: $i > $i,Y3: $i] : ( Y0 @ ( Y1 @ Y2 ) @ Y3 )
@ ( ^ [Y0: ( $i > $i ) > $i > $i,Y1: ( $i > $i ) > $i > $i,Y2: $i > $i,Y3: $i] : ( Y0 @ ( Y1 @ Y2 ) @ Y3 )
@ ^ [Y0: $i > $i,Y1: $i] : ( Y0 @ ( Y0 @ Y1 ) )
@ ^ [Y0: $i > $i,Y1: $i] : ( Y0 @ ( Y0 @ ( Y0 @ ( Y0 @ ( Y0 @ Y1 ) ) ) ) ) )
@ ( ^ [Y0: ( $i > $i ) > $i > $i,Y1: ( $i > $i ) > $i > $i,Y2: $i > $i,Y3: $i] : ( Y0 @ Y2 @ ( Y1 @ Y2 @ Y3 ) )
@ ^ [Y0: $i > $i,Y1: $i] : ( Y0 @ Y1 )
@ ^ [Y0: $i > $i,Y1: $i] : ( Y0 @ Y1 ) ) )
!= ( ^ [Y0: ( $i > $i ) > $i > $i,Y1: ( $i > $i ) > $i > $i,Y2: $i > $i,Y3: $i] : ( Y0 @ ( Y1 @ Y2 ) @ Y3 )
@ ^ [Y0: $i > $i,Y1: $i] : ( Y0 @ ( Y0 @ Y1 ) )
@ ( ^ [Y0: ( $i > $i ) > $i > $i,Y1: ( $i > $i ) > $i > $i,Y2: $i > $i,Y3: $i] : ( Y0 @ Y2 @ ( Y1 @ Y2 @ Y3 ) )
@ ^ [Y0: $i > $i,Y1: $i] : ( Y0 @ ( Y0 @ ( Y0 @ Y1 ) ) )
@ ^ [Y0: $i > $i,Y1: $i] : ( Y0 @ ( Y0 @ ( Y0 @ ( Y0 @ ( Y0 @ ( Y0 @ ( Y0 @ Y1 ) ) ) ) ) ) ) ) ) ),
inference(definition_unfolding,[],[f42,f38,f37,f39,f36,f41,f38,f38,f37,f43,f39,f40,f40]) ).
thf(f40,plain,
( one
= ( ^ [Y0: $i > $i,Y1: $i] : ( Y0 @ Y1 ) ) ),
inference(cnf_transformation,[],[f18]) ).
thf(f18,plain,
( one
= ( ^ [Y0: $i > $i,Y1: $i] : ( Y0 @ Y1 ) ) ),
inference(fool_elimination,[],[f2]) ).
thf(f2,axiom,
( ( ^ [X0: $i > $i,X1: $i] : ( X0 @ X1 ) )
= one ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',one_ax) ).
thf(f43,plain,
( five
= ( ^ [Y0: $i > $i,Y1: $i] : ( Y0 @ ( Y0 @ ( Y0 @ ( Y0 @ ( Y0 @ Y1 ) ) ) ) ) ) ),
inference(cnf_transformation,[],[f27]) ).
thf(f27,plain,
( five
= ( ^ [Y0: $i > $i,Y1: $i] : ( Y0 @ ( Y0 @ ( Y0 @ ( Y0 @ ( Y0 @ Y1 ) ) ) ) ) ) ),
inference(fool_elimination,[],[f6]) ).
thf(f6,axiom,
( five
= ( ^ [X0: $i > $i,X1: $i] : ( X0 @ ( X0 @ ( X0 @ ( X0 @ ( X0 @ X1 ) ) ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',five_ax) ).
thf(f41,plain,
( seven
= ( ^ [Y0: $i > $i,Y1: $i] : ( Y0 @ ( Y0 @ ( Y0 @ ( Y0 @ ( Y0 @ ( Y0 @ ( Y0 @ Y1 ) ) ) ) ) ) ) ) ),
inference(cnf_transformation,[],[f30]) ).
thf(f30,plain,
( seven
= ( ^ [Y0: $i > $i,Y1: $i] : ( Y0 @ ( Y0 @ ( Y0 @ ( Y0 @ ( Y0 @ ( Y0 @ ( Y0 @ Y1 ) ) ) ) ) ) ) ) ),
inference(fool_elimination,[],[f8]) ).
thf(f8,axiom,
( ( ^ [X0: $i > $i,X1: $i] : ( X0 @ ( X0 @ ( X0 @ ( X0 @ ( X0 @ ( X0 @ ( X0 @ X1 ) ) ) ) ) ) ) )
= seven ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',seven_ax) ).
thf(f36,plain,
( three
= ( ^ [Y0: $i > $i,Y1: $i] : ( Y0 @ ( Y0 @ ( Y0 @ Y1 ) ) ) ) ),
inference(cnf_transformation,[],[f31]) ).
thf(f31,plain,
( three
= ( ^ [Y0: $i > $i,Y1: $i] : ( Y0 @ ( Y0 @ ( Y0 @ Y1 ) ) ) ) ),
inference(fool_elimination,[],[f4]) ).
thf(f4,axiom,
( three
= ( ^ [X0: $i > $i,X1: $i] : ( X0 @ ( X0 @ ( X0 @ X1 ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',three_ax) ).
thf(f39,plain,
( plus
= ( ^ [Y0: ( $i > $i ) > $i > $i,Y1: ( $i > $i ) > $i > $i,Y2: $i > $i,Y3: $i] : ( Y0 @ Y2 @ ( Y1 @ Y2 @ Y3 ) ) ) ),
inference(cnf_transformation,[],[f23]) ).
thf(f23,plain,
( plus
= ( ^ [Y0: ( $i > $i ) > $i > $i,Y1: ( $i > $i ) > $i > $i,Y2: $i > $i,Y3: $i] : ( Y0 @ Y2 @ ( Y1 @ Y2 @ Y3 ) ) ) ),
inference(fool_elimination,[],[f22]) ).
thf(f22,plain,
( ( ^ [X0: ( $i > $i ) > $i > $i,X1: ( $i > $i ) > $i > $i,X2: $i > $i,X3: $i] : ( X0 @ X2 @ ( X1 @ X2 @ X3 ) ) )
= plus ),
inference(rectify,[],[f13]) ).
thf(f13,axiom,
( ( ^ [X3: ( $i > $i ) > $i > $i,X2: ( $i > $i ) > $i > $i,X0: $i > $i,X1: $i] : ( X3 @ X0 @ ( X2 @ X0 @ X1 ) ) )
= plus ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',plus_ax) ).
thf(f37,plain,
( two
= ( ^ [Y0: $i > $i,Y1: $i] : ( Y0 @ ( Y0 @ Y1 ) ) ) ),
inference(cnf_transformation,[],[f28]) ).
thf(f28,plain,
( two
= ( ^ [Y0: $i > $i,Y1: $i] : ( Y0 @ ( Y0 @ Y1 ) ) ) ),
inference(fool_elimination,[],[f3]) ).
thf(f3,axiom,
( two
= ( ^ [X0: $i > $i,X1: $i] : ( X0 @ ( X0 @ X1 ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',two_ax) ).
thf(f38,plain,
( mult
= ( ^ [Y0: ( $i > $i ) > $i > $i,Y1: ( $i > $i ) > $i > $i,Y2: $i > $i,Y3: $i] : ( Y0 @ ( Y1 @ Y2 ) @ Y3 ) ) ),
inference(cnf_transformation,[],[f25]) ).
thf(f25,plain,
( mult
= ( ^ [Y0: ( $i > $i ) > $i > $i,Y1: ( $i > $i ) > $i > $i,Y2: $i > $i,Y3: $i] : ( Y0 @ ( Y1 @ Y2 ) @ Y3 ) ) ),
inference(fool_elimination,[],[f24]) ).
thf(f24,plain,
( mult
= ( ^ [X0: ( $i > $i ) > $i > $i,X1: ( $i > $i ) > $i > $i,X2: $i > $i,X3: $i] : ( X0 @ ( X1 @ X2 ) @ X3 ) ) ),
inference(rectify,[],[f14]) ).
thf(f14,axiom,
( mult
= ( ^ [X3: ( $i > $i ) > $i > $i,X2: ( $i > $i ) > $i > $i,X0: $i > $i,X1: $i] : ( X3 @ ( X2 @ X0 ) @ X1 ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mult_ax) ).
thf(f42,plain,
( ( mult @ two @ ( plus @ three @ seven ) )
!= ( mult @ ( mult @ two @ five ) @ ( plus @ one @ one ) ) ),
inference(cnf_transformation,[],[f35]) ).
thf(f35,plain,
( ( mult @ two @ ( plus @ three @ seven ) )
!= ( mult @ ( mult @ two @ five ) @ ( plus @ one @ one ) ) ),
inference(flattening,[],[f16]) ).
thf(f16,negated_conjecture,
( ( mult @ two @ ( plus @ three @ seven ) )
!= ( mult @ ( mult @ two @ five ) @ ( plus @ one @ one ) ) ),
inference(negated_conjecture,[],[f15]) ).
thf(f15,conjecture,
( ( mult @ two @ ( plus @ three @ seven ) )
= ( mult @ ( mult @ two @ five ) @ ( plus @ one @ one ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',thm) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.09 % Problem : NUM415^1 : TPTP v8.2.0. Released v3.6.0.
% 0.09/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.10/0.31 % Computer : n026.cluster.edu
% 0.10/0.31 % Model : x86_64 x86_64
% 0.10/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.31 % Memory : 8042.1875MB
% 0.10/0.31 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.31 % CPULimit : 300
% 0.10/0.31 % WCLimit : 300
% 0.10/0.31 % DateTime : Mon May 20 06:27:23 EDT 2024
% 0.15/0.31 % CPUTime :
% 0.15/0.31 This is a TH0_THM_EQU_NAR problem
% 0.15/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.33 % (10489)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.15/0.33 % (10485)lrs+10_1:1_au=on:inj=on:i=2:si=on:rtra=on_0 on theBenchmark for (2999ds/2Mi)
% 0.15/0.33 % (10486)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.15/0.33 % (10484)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.15/0.33 % (10487)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.15/0.33 % (10483)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.15/0.33 % (10482)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.15/0.33 % (10488)lrs+1004_1:128_cond=on:e2e=on:sp=weighted_frequency:i=18:si=on:rtra=on_0 on theBenchmark for (2999ds/18Mi)
% 0.15/0.33 % (10485)Instruction limit reached!
% 0.15/0.33 % (10485)------------------------------
% 0.15/0.33 % (10485)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.15/0.33 % (10485)Termination reason: Unknown
% 0.15/0.33 % (10485)Termination phase: Property scanning
% 0.15/0.33 % (10486)Instruction limit reached!
% 0.15/0.33 % (10486)------------------------------
% 0.15/0.33 % (10486)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.15/0.33 % (10486)Termination reason: Unknown
% 0.15/0.33 % (10486)Termination phase: Property scanning
% 0.15/0.33
% 0.15/0.33 % (10486)Memory used [KB]: 895
% 0.15/0.33 % (10486)Time elapsed: 0.003 s
% 0.15/0.33 % (10486)Instructions burned: 4 (million)
% 0.15/0.33 % (10486)------------------------------
% 0.15/0.33 % (10486)------------------------------
% 0.15/0.33
% 0.15/0.33 % (10485)Memory used [KB]: 895
% 0.15/0.33 % (10485)Time elapsed: 0.003 s
% 0.15/0.33 % (10485)Instructions burned: 3 (million)
% 0.15/0.33 % (10485)------------------------------
% 0.15/0.33 % (10485)------------------------------
% 0.15/0.33 % (10489)Instruction limit reached!
% 0.15/0.33 % (10489)------------------------------
% 0.15/0.33 % (10489)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.15/0.33 % (10489)Termination reason: Unknown
% 0.15/0.33 % (10489)Termination phase: Saturation
% 0.15/0.33
% 0.15/0.33 % (10489)Memory used [KB]: 895
% 0.15/0.33 % (10489)Time elapsed: 0.004 s
% 0.15/0.33 % (10489)Instructions burned: 4 (million)
% 0.15/0.33 % (10489)------------------------------
% 0.15/0.33 % (10489)------------------------------
% 0.15/0.33 % (10483)Instruction limit reached!
% 0.15/0.33 % (10483)------------------------------
% 0.15/0.33 % (10483)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.15/0.33 % (10483)Termination reason: Unknown
% 0.15/0.33 % (10483)Termination phase: Saturation
% 0.15/0.33
% 0.15/0.33 % (10483)Memory used [KB]: 5500
% 0.15/0.33 % (10483)Time elapsed: 0.003 s
% 0.15/0.33 % (10483)Instructions burned: 4 (million)
% 0.15/0.33 % (10483)------------------------------
% 0.15/0.33 % (10483)------------------------------
% 0.15/0.33 % (10487)First to succeed.
% 0.15/0.33 % (10488)Also succeeded, but the first one will report.
% 0.15/0.33 % (10482)Also succeeded, but the first one will report.
% 0.15/0.33 % (10487)Refutation found. Thanks to Tanya!
% 0.15/0.33 % SZS status Theorem for theBenchmark
% 0.15/0.33 % SZS output start Proof for theBenchmark
% See solution above
% 0.15/0.33 % (10487)------------------------------
% 0.15/0.33 % (10487)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.15/0.33 % (10487)Termination reason: Refutation
% 0.15/0.33
% 0.15/0.33 % (10487)Memory used [KB]: 5500
% 0.15/0.33 % (10487)Time elapsed: 0.005 s
% 0.15/0.33 % (10487)Instructions burned: 5 (million)
% 0.15/0.33 % (10487)------------------------------
% 0.15/0.33 % (10487)------------------------------
% 0.15/0.33 % (10481)Success in time 0.016 s
% 0.15/0.33 % Vampire---4.8 exiting
%------------------------------------------------------------------------------