TSTP Solution File: ALG278^5 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : ALG278^5 : TPTP v8.2.0. Bugfixed v5.3.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/sandbox/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% Computer : n018.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 : Mon May 20 18:20:48 EDT 2024
% Result : Theorem 0.13s 0.38s
% Output : Refutation 0.13s
% Verified :
% SZS Type : Refutation
% Derivation depth : 27
% Number of leaves : 17
% Syntax : Number of formulae : 68 ( 50 unt; 10 typ; 0 def)
% Number of atoms : 213 ( 102 equ; 0 cnn)
% Maximal formula atoms : 4 ( 3 avg)
% Number of connectives : 474 ( 11 ~; 0 |; 19 &; 390 @)
% ( 0 <=>; 6 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 2 avg)
% Number of types : 2 ( 1 usr)
% Number of type conns : 78 ( 78 >; 0 *; 0 +; 0 <<)
% Number of symbols : 13 ( 8 usr; 6 con; 0-2 aty)
% ( 40 !!; 8 ??; 0 @@+; 0 @@-)
% Number of variables : 161 ( 96 ^ 55 !; 10 ?; 161 :)
% Comments :
%------------------------------------------------------------------------------
thf(type_def_5,type,
g: $tType ).
thf(func_def_0,type,
g: $tType ).
thf(func_def_1,type,
cGROUP2: ( g > g > g ) > g > $o ).
thf(func_def_2,type,
cGRP_ASSOC: ( g > g > g ) > $o ).
thf(func_def_3,type,
cGRP_LEFT_INVERSE: ( g > g > g ) > g > $o ).
thf(func_def_4,type,
cGRP_LEFT_UNIT: ( g > g > g ) > g > $o ).
thf(func_def_17,type,
sK0: g ).
thf(func_def_18,type,
sK1: g > g > g ).
thf(func_def_19,type,
sK2: g ).
thf(func_def_21,type,
sK4: g > g ).
thf(f116,plain,
$false,
inference(trivial_inequality_removal,[],[f115]) ).
thf(f115,plain,
sK2 != sK2,
inference(superposition,[],[f26,f100]) ).
thf(f100,plain,
! [X0: g] :
( ( sK1 @ X0 @ sK0 )
= X0 ),
inference(forward_demodulation,[],[f96,f92]) ).
thf(f92,plain,
! [X0: g] :
( ( sK4 @ ( sK4 @ X0 ) )
= X0 ),
inference(superposition,[],[f88,f56]) ).
thf(f56,plain,
! [X0: g] :
( ( sK1 @ ( sK4 @ ( sK4 @ X0 ) ) @ sK0 )
= X0 ),
inference(superposition,[],[f54,f49]) ).
thf(f49,plain,
! [X1: g] :
( sK0
= ( sK1 @ ( sK4 @ X1 ) @ X1 ) ),
inference(equality_proxy_clausification,[],[f48]) ).
thf(f48,plain,
! [X1: g] :
( $true
= ( ( sK1 @ ( sK4 @ X1 ) @ X1 )
= sK0 ) ),
inference(beta_eta_normalization,[],[f47]) ).
thf(f47,plain,
! [X1: g] :
( $true
= ( ^ [Y0: g] :
( ( sK1 @ Y0 @ X1 )
= sK0 )
@ ( sK4 @ X1 ) ) ),
inference(sigma_clausification,[],[f46]) ).
thf(f46,plain,
! [X1: g] :
( $true
= ( ?? @ g
@ ^ [Y0: g] :
( ( sK1 @ Y0 @ X1 )
= sK0 ) ) ),
inference(beta_eta_normalization,[],[f45]) ).
thf(f45,plain,
! [X1: g] :
( $true
= ( ^ [Y0: g] :
( ?? @ g
@ ^ [Y1: g] :
( ( sK1 @ Y1 @ Y0 )
= sK0 ) )
@ X1 ) ),
inference(pi_clausification,[],[f31]) ).
thf(f31,plain,
( ( !! @ g
@ ^ [Y0: g] :
( ?? @ g
@ ^ [Y1: g] :
( ( sK1 @ Y1 @ Y0 )
= sK0 ) ) )
= $true ),
inference(binary_proxy_clausification,[],[f30]) ).
thf(f30,plain,
( $true
= ( ( !! @ g
@ ^ [Y0: g] :
( !! @ g
@ ^ [Y1: g] :
( !! @ g
@ ^ [Y2: g] :
( ( sK1 @ Y0 @ ( sK1 @ Y2 @ Y1 ) )
= ( sK1 @ ( sK1 @ Y0 @ Y2 ) @ Y1 ) ) ) ) )
& ( !! @ g
@ ^ [Y0: g] :
( ( sK1 @ sK0 @ Y0 )
= Y0 ) )
& ( !! @ g
@ ^ [Y0: g] :
( ?? @ g
@ ^ [Y1: g] :
( ( sK1 @ Y1 @ Y0 )
= sK0 ) ) ) ) ),
inference(beta_eta_normalization,[],[f29]) ).
thf(f29,plain,
( $true
= ( ^ [Y0: g > g > g,Y1: g] :
( ( ^ [Y2: g > g > g] :
( !! @ g
@ ^ [Y3: g] :
( !! @ g
@ ^ [Y4: g] :
( !! @ g
@ ^ [Y5: g] :
( ( Y2 @ Y3 @ ( Y2 @ Y5 @ Y4 ) )
= ( Y2 @ ( Y2 @ Y3 @ Y5 ) @ Y4 ) ) ) ) )
@ Y0 )
& ( ^ [Y2: g > g > g,Y3: g] :
( !! @ g
@ ^ [Y4: g] :
( ( Y2 @ Y3 @ Y4 )
= Y4 ) )
@ Y0
@ Y1 )
& ( ^ [Y2: g > g > g,Y3: g] :
( !! @ g
@ ^ [Y4: g] :
( ?? @ g
@ ^ [Y5: g] :
( ( Y2 @ Y5 @ Y4 )
= Y3 ) ) )
@ Y0
@ Y1 ) )
@ sK1
@ sK0 ) ),
inference(definition_unfolding,[],[f27,f28]) ).
thf(f28,plain,
( cGROUP2
= ( ^ [Y0: g > g > g,Y1: g] :
( ( ^ [Y2: g > g > g] :
( !! @ g
@ ^ [Y3: g] :
( !! @ g
@ ^ [Y4: g] :
( !! @ g
@ ^ [Y5: g] :
( ( Y2 @ Y3 @ ( Y2 @ Y5 @ Y4 ) )
= ( Y2 @ ( Y2 @ Y3 @ Y5 ) @ Y4 ) ) ) ) )
@ Y0 )
& ( ^ [Y2: g > g > g,Y3: g] :
( !! @ g
@ ^ [Y4: g] :
( ( Y2 @ Y3 @ Y4 )
= Y4 ) )
@ Y0
@ Y1 )
& ( ^ [Y2: g > g > g,Y3: g] :
( !! @ g
@ ^ [Y4: g] :
( ?? @ g
@ ^ [Y5: g] :
( ( Y2 @ Y5 @ Y4 )
= Y3 ) ) )
@ Y0
@ Y1 ) ) ) ),
inference(definition_unfolding,[],[f22,f23,f24,f25]) ).
thf(f25,plain,
( cGRP_LEFT_INVERSE
= ( ^ [Y0: g > g > g,Y1: g] :
( !! @ g
@ ^ [Y2: g] :
( ?? @ g
@ ^ [Y3: g] :
( ( Y0 @ Y3 @ Y2 )
= Y1 ) ) ) ) ),
inference(cnf_transformation,[],[f9]) ).
thf(f9,plain,
( cGRP_LEFT_INVERSE
= ( ^ [Y0: g > g > g,Y1: g] :
( !! @ g
@ ^ [Y2: g] :
( ?? @ g
@ ^ [Y3: g] :
( ( Y0 @ Y3 @ Y2 )
= Y1 ) ) ) ) ),
inference(fool_elimination,[],[f8]) ).
thf(f8,plain,
( cGRP_LEFT_INVERSE
= ( ^ [X0: g > g > g,X1: g] :
! [X2: g] :
? [X3: g] :
( ( X0 @ X3 @ X2 )
= X1 ) ) ),
inference(rectify,[],[f2]) ).
thf(f2,axiom,
( cGRP_LEFT_INVERSE
= ( ^ [X0: g > g > g,X4: g] :
! [X1: g] :
? [X2: g] :
( ( X0 @ X2 @ X1 )
= X4 ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cGRP_LEFT_INVERSE_def) ).
thf(f24,plain,
( cGRP_LEFT_UNIT
= ( ^ [Y0: g > g > g,Y1: g] :
( !! @ g
@ ^ [Y2: g] :
( ( Y0 @ Y1 @ Y2 )
= Y2 ) ) ) ),
inference(cnf_transformation,[],[f13]) ).
thf(f13,plain,
( cGRP_LEFT_UNIT
= ( ^ [Y0: g > g > g,Y1: g] :
( !! @ g
@ ^ [Y2: g] :
( ( Y0 @ Y1 @ Y2 )
= Y2 ) ) ) ),
inference(fool_elimination,[],[f12]) ).
thf(f12,plain,
( ( ^ [X0: g > g > g,X1: g] :
! [X2: g] :
( ( X0 @ X1 @ X2 )
= X2 ) )
= cGRP_LEFT_UNIT ),
inference(rectify,[],[f3]) ).
thf(f3,axiom,
( ( ^ [X0: g > g > g,X4: g] :
! [X1: g] :
( ( X0 @ X4 @ X1 )
= X1 ) )
= cGRP_LEFT_UNIT ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cGRP_LEFT_UNIT_def) ).
thf(f23,plain,
( cGRP_ASSOC
= ( ^ [Y0: g > g > g] :
( !! @ g
@ ^ [Y1: g] :
( !! @ g
@ ^ [Y2: g] :
( !! @ g
@ ^ [Y3: g] :
( ( Y0 @ Y1 @ ( Y0 @ Y3 @ Y2 ) )
= ( Y0 @ ( Y0 @ Y1 @ Y3 ) @ Y2 ) ) ) ) ) ) ),
inference(cnf_transformation,[],[f11]) ).
thf(f11,plain,
( cGRP_ASSOC
= ( ^ [Y0: g > g > g] :
( !! @ g
@ ^ [Y1: g] :
( !! @ g
@ ^ [Y2: g] :
( !! @ g
@ ^ [Y3: g] :
( ( Y0 @ Y1 @ ( Y0 @ Y3 @ Y2 ) )
= ( Y0 @ ( Y0 @ Y1 @ Y3 ) @ Y2 ) ) ) ) ) ) ),
inference(fool_elimination,[],[f10]) ).
thf(f10,plain,
( ( ^ [X0: g > g > g] :
! [X1: g,X2: g,X3: g] :
( ( X0 @ X3 @ ( X0 @ X1 @ X2 ) )
= ( X0 @ ( X0 @ X3 @ X1 ) @ X2 ) ) )
= cGRP_ASSOC ),
inference(rectify,[],[f1]) ).
thf(f1,axiom,
( ( ^ [X0: g > g > g] :
! [X2: g,X3: g,X1: g] :
( ( X0 @ ( X0 @ X1 @ X2 ) @ X3 )
= ( X0 @ X1 @ ( X0 @ X2 @ X3 ) ) ) )
= cGRP_ASSOC ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cGRP_ASSOC_def) ).
thf(f22,plain,
( cGROUP2
= ( ^ [Y0: g > g > g,Y1: g] :
( ( cGRP_ASSOC @ Y0 )
& ( cGRP_LEFT_UNIT @ Y0 @ Y1 )
& ( cGRP_LEFT_INVERSE @ Y0 @ Y1 ) ) ) ),
inference(cnf_transformation,[],[f17]) ).
thf(f17,plain,
( cGROUP2
= ( ^ [Y0: g > g > g,Y1: g] :
( ( cGRP_ASSOC @ Y0 )
& ( cGRP_LEFT_UNIT @ Y0 @ Y1 )
& ( cGRP_LEFT_INVERSE @ Y0 @ Y1 ) ) ) ),
inference(fool_elimination,[],[f16]) ).
thf(f16,plain,
( ( ^ [X0: g > g > g,X1: g] :
( ( cGRP_LEFT_INVERSE @ X0 @ X1 )
& ( cGRP_LEFT_UNIT @ X0 @ X1 )
& ( cGRP_ASSOC @ X0 ) ) )
= cGROUP2 ),
inference(rectify,[],[f4]) ).
thf(f4,axiom,
( ( ^ [X0: g > g > g,X4: g] :
( ( cGRP_LEFT_INVERSE @ X0 @ X4 )
& ( cGRP_LEFT_UNIT @ X0 @ X4 )
& ( cGRP_ASSOC @ X0 ) ) )
= cGROUP2 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cGROUP2_def) ).
thf(f27,plain,
( $true
= ( cGROUP2 @ sK1 @ sK0 ) ),
inference(cnf_transformation,[],[f21]) ).
thf(f21,plain,
( ( $true
= ( cGROUP2 @ sK1 @ sK0 ) )
& ( sK2
!= ( sK1 @ sK2 @ sK0 ) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2])],[f18,f20,f19]) ).
thf(f19,plain,
( ? [X0: g,X1: g > g > g] :
( ( $true
= ( cGROUP2 @ X1 @ X0 ) )
& ? [X2: g] :
( ( X1 @ X2 @ X0 )
!= X2 ) )
=> ( ( $true
= ( cGROUP2 @ sK1 @ sK0 ) )
& ? [X2: g] :
( ( sK1 @ X2 @ sK0 )
!= X2 ) ) ),
introduced(choice_axiom,[]) ).
thf(f20,plain,
( ? [X2: g] :
( ( sK1 @ X2 @ sK0 )
!= X2 )
=> ( sK2
!= ( sK1 @ sK2 @ sK0 ) ) ),
introduced(choice_axiom,[]) ).
thf(f18,plain,
? [X0: g,X1: g > g > g] :
( ( $true
= ( cGROUP2 @ X1 @ X0 ) )
& ? [X2: g] :
( ( X1 @ X2 @ X0 )
!= X2 ) ),
inference(ennf_transformation,[],[f15]) ).
thf(f15,plain,
~ ! [X0: g,X1: g > g > g] :
( ( $true
= ( cGROUP2 @ X1 @ X0 ) )
=> ! [X2: g] :
( ( X1 @ X2 @ X0 )
= X2 ) ),
inference(fool_elimination,[],[f14]) ).
thf(f14,plain,
~ ! [X0: g,X1: g > g > g] :
( ( cGROUP2 @ X1 @ X0 )
=> ! [X2: g] :
( ( X1 @ X2 @ X0 )
= X2 ) ),
inference(rectify,[],[f6]) ).
thf(f6,negated_conjecture,
~ ! [X4: g,X0: g > g > g] :
( ( cGROUP2 @ X0 @ X4 )
=> ! [X1: g] :
( ( X0 @ X1 @ X4 )
= X1 ) ),
inference(negated_conjecture,[],[f5]) ).
thf(f5,conjecture,
! [X4: g,X0: g > g > g] :
( ( cGROUP2 @ X0 @ X4 )
=> ! [X1: g] :
( ( X0 @ X1 @ X4 )
= X1 ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cE12A1) ).
thf(f54,plain,
! [X0: g,X1: g] :
( ( sK1 @ ( sK4 @ X0 ) @ ( sK1 @ X0 @ X1 ) )
= X1 ),
inference(forward_demodulation,[],[f51,f44]) ).
thf(f44,plain,
! [X1: g] :
( ( sK1 @ sK0 @ X1 )
= X1 ),
inference(equality_proxy_clausification,[],[f43]) ).
thf(f43,plain,
! [X1: g] :
( $true
= ( ( sK1 @ sK0 @ X1 )
= X1 ) ),
inference(beta_eta_normalization,[],[f42]) ).
thf(f42,plain,
! [X1: g] :
( $true
= ( ^ [Y0: g] :
( ( sK1 @ sK0 @ Y0 )
= Y0 )
@ X1 ) ),
inference(pi_clausification,[],[f33]) ).
thf(f33,plain,
( $true
= ( !! @ g
@ ^ [Y0: g] :
( ( sK1 @ sK0 @ Y0 )
= Y0 ) ) ),
inference(binary_proxy_clausification,[],[f32]) ).
thf(f32,plain,
( $true
= ( ( !! @ g
@ ^ [Y0: g] :
( !! @ g
@ ^ [Y1: g] :
( !! @ g
@ ^ [Y2: g] :
( ( sK1 @ Y0 @ ( sK1 @ Y2 @ Y1 ) )
= ( sK1 @ ( sK1 @ Y0 @ Y2 ) @ Y1 ) ) ) ) )
& ( !! @ g
@ ^ [Y0: g] :
( ( sK1 @ sK0 @ Y0 )
= Y0 ) ) ) ),
inference(binary_proxy_clausification,[],[f30]) ).
thf(f51,plain,
! [X0: g,X1: g] :
( ( sK1 @ ( sK4 @ X0 ) @ ( sK1 @ X0 @ X1 ) )
= ( sK1 @ sK0 @ X1 ) ),
inference(superposition,[],[f41,f49]) ).
thf(f41,plain,
! [X2: g,X3: g,X1: g] :
( ( sK1 @ ( sK1 @ X1 @ X3 ) @ X2 )
= ( sK1 @ X1 @ ( sK1 @ X3 @ X2 ) ) ),
inference(equality_proxy_clausification,[],[f40]) ).
thf(f40,plain,
! [X2: g,X3: g,X1: g] :
( $true
= ( ( sK1 @ X1 @ ( sK1 @ X3 @ X2 ) )
= ( sK1 @ ( sK1 @ X1 @ X3 ) @ X2 ) ) ),
inference(beta_eta_normalization,[],[f39]) ).
thf(f39,plain,
! [X2: g,X3: g,X1: g] :
( $true
= ( ^ [Y0: g] :
( ( sK1 @ X1 @ ( sK1 @ Y0 @ X2 ) )
= ( sK1 @ ( sK1 @ X1 @ Y0 ) @ X2 ) )
@ X3 ) ),
inference(pi_clausification,[],[f38]) ).
thf(f38,plain,
! [X2: g,X1: g] :
( $true
= ( !! @ g
@ ^ [Y0: g] :
( ( sK1 @ X1 @ ( sK1 @ Y0 @ X2 ) )
= ( sK1 @ ( sK1 @ X1 @ Y0 ) @ X2 ) ) ) ),
inference(beta_eta_normalization,[],[f37]) ).
thf(f37,plain,
! [X2: g,X1: g] :
( $true
= ( ^ [Y0: g] :
( !! @ g
@ ^ [Y1: g] :
( ( sK1 @ X1 @ ( sK1 @ Y1 @ Y0 ) )
= ( sK1 @ ( sK1 @ X1 @ Y1 ) @ Y0 ) ) )
@ X2 ) ),
inference(pi_clausification,[],[f36]) ).
thf(f36,plain,
! [X1: g] :
( $true
= ( !! @ g
@ ^ [Y0: g] :
( !! @ g
@ ^ [Y1: g] :
( ( sK1 @ X1 @ ( sK1 @ Y1 @ Y0 ) )
= ( sK1 @ ( sK1 @ X1 @ Y1 ) @ Y0 ) ) ) ) ),
inference(beta_eta_normalization,[],[f35]) ).
thf(f35,plain,
! [X1: g] :
( $true
= ( ^ [Y0: g] :
( !! @ g
@ ^ [Y1: g] :
( !! @ g
@ ^ [Y2: g] :
( ( sK1 @ Y0 @ ( sK1 @ Y2 @ Y1 ) )
= ( sK1 @ ( sK1 @ Y0 @ Y2 ) @ Y1 ) ) ) )
@ X1 ) ),
inference(pi_clausification,[],[f34]) ).
thf(f34,plain,
( $true
= ( !! @ g
@ ^ [Y0: g] :
( !! @ g
@ ^ [Y1: g] :
( !! @ g
@ ^ [Y2: g] :
( ( sK1 @ Y0 @ ( sK1 @ Y2 @ Y1 ) )
= ( sK1 @ ( sK1 @ Y0 @ Y2 ) @ Y1 ) ) ) ) ) ),
inference(binary_proxy_clausification,[],[f32]) ).
thf(f88,plain,
! [X0: g] :
( ( sK1 @ ( sK4 @ ( sK4 @ ( sK4 @ ( sK4 @ X0 ) ) ) ) @ sK0 )
= X0 ),
inference(superposition,[],[f54,f65]) ).
thf(f65,plain,
! [X0: g] :
( sK0
= ( sK1 @ ( sK4 @ ( sK4 @ ( sK4 @ X0 ) ) ) @ X0 ) ),
inference(superposition,[],[f54,f56]) ).
thf(f96,plain,
! [X0: g] :
( ( sK1 @ ( sK4 @ ( sK4 @ X0 ) ) @ sK0 )
= X0 ),
inference(backward_demodulation,[],[f88,f92]) ).
thf(f26,plain,
( sK2
!= ( sK1 @ sK2 @ sK0 ) ),
inference(cnf_transformation,[],[f21]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : ALG278^5 : TPTP v8.2.0. Bugfixed v5.3.0.
% 0.07/0.13 % Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% 0.13/0.34 % Computer : n018.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Sat May 18 23:40:23 EDT 2024
% 0.13/0.34 % 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/sandbox/benchmark/theBenchmark.p
% 0.13/0.36 % (3061)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 (3000ds/4Mi)
% 0.13/0.36 % (3067)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.13/0.36 % (3067)Instruction limit reached!
% 0.13/0.36 % (3067)------------------------------
% 0.13/0.36 % (3067)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.13/0.36 % (3067)Termination reason: Unknown
% 0.13/0.36 % (3067)Termination phase: Saturation
% 0.13/0.36
% 0.13/0.36 % (3067)Memory used [KB]: 1023
% 0.13/0.36 % (3067)Time elapsed: 0.002 s
% 0.13/0.36 % (3067)Instructions burned: 3 (million)
% 0.13/0.36 % (3067)------------------------------
% 0.13/0.36 % (3067)------------------------------
% 0.13/0.36 % (3061)Instruction limit reached!
% 0.13/0.36 % (3061)------------------------------
% 0.13/0.36 % (3061)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.13/0.36 % (3061)Termination reason: Unknown
% 0.13/0.36 % (3061)Termination phase: Saturation
% 0.13/0.36
% 0.13/0.36 % (3061)Memory used [KB]: 5500
% 0.13/0.36 % (3061)Time elapsed: 0.003 s
% 0.13/0.36 % (3061)Instructions burned: 4 (million)
% 0.13/0.36 % (3061)------------------------------
% 0.13/0.36 % (3061)------------------------------
% 0.13/0.36 % (3063)lrs+10_1:1_au=on:inj=on:i=2:si=on:rtra=on_0 on theBenchmark for (3000ds/2Mi)
% 0.13/0.36 % (3063)Instruction limit reached!
% 0.13/0.36 % (3063)------------------------------
% 0.13/0.36 % (3063)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.13/0.36 % (3063)Termination reason: Unknown
% 0.13/0.36 % (3063)Termination phase: shuffling
% 0.13/0.36
% 0.13/0.36 % (3063)Memory used [KB]: 895
% 0.13/0.36 % (3063)Time elapsed: 0.003 s
% 0.13/0.36 % (3063)Instructions burned: 2 (million)
% 0.13/0.36 % (3063)------------------------------
% 0.13/0.36 % (3063)------------------------------
% 0.13/0.36 % (3060)lrs+1002_1:8_bd=off:fd=off:hud=10:tnu=1:i=183:si=on:rtra=on_0 on theBenchmark for (3000ds/183Mi)
% 0.13/0.36 % (3062)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.13/0.36 % (3066)lrs+1004_1:128_cond=on:e2e=on:sp=weighted_frequency:i=18:si=on:rtra=on_0 on theBenchmark for (3000ds/18Mi)
% 0.13/0.36 % (3065)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.13/0.36 % (3064)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.13/0.37 % (3064)Instruction limit reached!
% 0.13/0.37 % (3064)------------------------------
% 0.13/0.37 % (3064)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.13/0.37 % (3064)Termination reason: Unknown
% 0.13/0.37 % (3064)Termination phase: Saturation
% 0.13/0.37
% 0.13/0.37 % (3064)Memory used [KB]: 895
% 0.13/0.37 % (3064)Time elapsed: 0.003 s
% 0.13/0.37 % (3064)Instructions burned: 3 (million)
% 0.13/0.37 % (3064)------------------------------
% 0.13/0.37 % (3064)------------------------------
% 0.13/0.37 % (3065)Refutation not found, incomplete strategy
% 0.13/0.37 % (3065)------------------------------
% 0.13/0.37 % (3065)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.13/0.37 % (3065)Termination reason: Refutation not found, incomplete strategy
% 0.13/0.37
% 0.13/0.37
% 0.13/0.37 % (3065)Memory used [KB]: 5500
% 0.13/0.37 % (3065)Time elapsed: 0.004 s
% 0.13/0.37 % (3065)Instructions burned: 2 (million)
% 0.13/0.37 % (3065)------------------------------
% 0.13/0.37 % (3065)------------------------------
% 0.13/0.37 % (3068)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.13/0.37 % (3069)lrs+2_16:1_acc=model:au=on:bd=off:c=on:e2e=on:nm=2:sos=all:i=15:si=on:rtra=on_0 on theBenchmark for (2999ds/15Mi)
% 0.13/0.37 % (3069)Instruction limit reached!
% 0.13/0.37 % (3069)------------------------------
% 0.13/0.37 % (3069)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.13/0.37 % (3069)Termination reason: Unknown
% 0.13/0.37 % (3069)Termination phase: Saturation
% 0.13/0.37
% 0.13/0.37 % (3069)Memory used [KB]: 5628
% 0.13/0.37 % (3069)Time elapsed: 0.007 s
% 0.13/0.37 % (3069)Instructions burned: 16 (million)
% 0.13/0.37 % (3069)------------------------------
% 0.13/0.37 % (3069)------------------------------
% 0.13/0.38 % (3066)First to succeed.
% 0.13/0.38 % (3070)dis+21_1:1_cbe=off:cnfonf=off:fs=off:fsr=off:hud=1:inj=on:i=3:si=on:rtra=on_0 on theBenchmark for (2999ds/3Mi)
% 0.13/0.38 % (3066)Refutation found. Thanks to Tanya!
% 0.13/0.38 % SZS status Theorem for theBenchmark
% 0.13/0.38 % SZS output start Proof for theBenchmark
% See solution above
% 0.13/0.38 % (3066)------------------------------
% 0.13/0.38 % (3066)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.13/0.38 % (3066)Termination reason: Refutation
% 0.13/0.38
% 0.13/0.38 % (3066)Memory used [KB]: 5628
% 0.13/0.38 % (3066)Time elapsed: 0.015 s
% 0.13/0.38 % (3066)Instructions burned: 16 (million)
% 0.13/0.38 % (3066)------------------------------
% 0.13/0.38 % (3066)------------------------------
% 0.13/0.38 % (3059)Success in time 0.018 s
% 0.13/0.38 % Vampire---4.8 exiting
%------------------------------------------------------------------------------