TSTP Solution File: SEV200^5 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SEV200^5 : TPTP v8.2.0. Released v4.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 : n004.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:12:21 EDT 2024
% Result : Theorem 0.16s 0.40s
% Output : Refutation 0.16s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 12
% Syntax : Number of formulae : 26 ( 4 unt; 9 typ; 0 def)
% Number of atoms : 280 ( 189 equ; 0 cnn)
% Maximal formula atoms : 22 ( 16 avg)
% Number of connectives : 641 ( 92 ~; 67 |; 105 &; 345 @)
% ( 0 <=>; 32 =>; 0 <=; 0 <~>)
% Maximal formula depth : 24 ( 15 avg)
% Number of types : 2 ( 1 usr)
% Number of type conns : 48 ( 48 >; 0 *; 0 +; 0 <<)
% Number of symbols : 10 ( 7 usr; 4 con; 0-3 aty)
% Number of variables : 206 ( 0 ^ 163 !; 42 ?; 206 :)
% ( 1 !>; 0 ?*; 0 @-; 0 @+)
% Comments :
%------------------------------------------------------------------------------
thf(type_def_5,type,
a: $tType ).
thf(func_def_0,type,
a: $tType ).
thf(func_def_1,type,
x: a ).
thf(func_def_2,type,
cZ: a ).
thf(func_def_3,type,
cP: a > a > a ).
thf(func_def_5,type,
vEPSILON:
!>[X0: $tType] : ( ( X0 > $o ) > X0 ) ).
thf(func_def_8,type,
sK0: ( a > $o ) > a ).
thf(func_def_9,type,
sK1: ( a > $o ) > a ).
thf(func_def_10,type,
sK2: a > a > a > $o ).
thf(f31,plain,
$false,
inference(trivial_inequality_removal,[],[f30]) ).
thf(f30,plain,
$true != $true,
inference(superposition,[],[f13,f26]) ).
thf(f26,plain,
! [X12: a] :
( $true
= ( sK2 @ cZ @ X12 @ X12 ) ),
inference(equality_resolution,[],[f25]) ).
thf(f25,plain,
! [X12: a,X13: a] :
( ( $true
= ( sK2 @ X13 @ X12 @ X12 ) )
| ( cZ != X13 ) ),
inference(equality_resolution,[],[f15]) ).
thf(f15,plain,
! [X11: a,X12: a,X13: a] :
( ( $true
= ( sK2 @ X13 @ X12 @ X11 ) )
| ( X11 != X12 )
| ( cZ != X13 ) ),
inference(cnf_transformation,[],[f12]) ).
thf(f12,plain,
( ! [X0: a,X1: a,X2: a,X3: a] :
( ( ( X0 = X1 )
& ( X2 = X3 ) )
| ( ( cP @ X3 @ X1 )
!= ( cP @ X2 @ X0 ) ) )
& ! [X4: a,X5: a] :
( cZ
!= ( cP @ X5 @ X4 ) )
& ! [X6: a > $o] :
( ! [X7: a] :
( $true
= ( X6 @ X7 ) )
| ( ( $true
= ( X6 @ ( sK0 @ X6 ) ) )
& ( $true
= ( X6 @ ( sK1 @ X6 ) ) )
& ( $true
!= ( X6 @ ( cP @ ( sK0 @ X6 ) @ ( sK1 @ X6 ) ) ) ) )
| ( $true
!= ( X6 @ cZ ) ) )
& ! [X11: a,X12: a,X13: a] :
( ( $true
= ( sK2 @ X13 @ X12 @ X11 ) )
| ( ( ( cZ != X12 )
| ( X11 != X13 ) )
& ( ( X11 != X12 )
| ( cZ != X13 ) )
& ! [X14: a,X15: a,X16: a,X17: a,X18: a,X19: a] :
( ( $true
!= ( sK2 @ X19 @ X15 @ X14 ) )
| ( ( cP @ X19 @ X16 )
!= X13 )
| ( ( cP @ X15 @ X17 )
!= X12 )
| ( ( cP @ X14 @ X18 )
!= X11 )
| ( $true
!= ( sK2 @ X16 @ X17 @ X18 ) ) ) ) )
& ( $true
!= ( sK2 @ cZ @ x @ x ) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2])],[f9,f11,f10]) ).
thf(f10,plain,
! [X6: a > $o] :
( ? [X8: a,X9: a] :
( ( $true
= ( X6 @ X8 ) )
& ( $true
= ( X6 @ X9 ) )
& ( $true
!= ( X6 @ ( cP @ X8 @ X9 ) ) ) )
=> ( ( $true
= ( X6 @ ( sK0 @ X6 ) ) )
& ( $true
= ( X6 @ ( sK1 @ X6 ) ) )
& ( $true
!= ( X6 @ ( cP @ ( sK0 @ X6 ) @ ( sK1 @ X6 ) ) ) ) ) ),
introduced(choice_axiom,[]) ).
thf(f11,plain,
( ? [X10: a > a > a > $o] :
( ! [X11: a,X12: a,X13: a] :
( ( $true
= ( X10 @ X13 @ X12 @ X11 ) )
| ( ( ( cZ != X12 )
| ( X11 != X13 ) )
& ( ( X11 != X12 )
| ( cZ != X13 ) )
& ! [X14: a,X15: a,X16: a,X17: a,X18: a,X19: a] :
( ( $true
!= ( X10 @ X19 @ X15 @ X14 ) )
| ( ( cP @ X19 @ X16 )
!= X13 )
| ( ( cP @ X15 @ X17 )
!= X12 )
| ( ( cP @ X14 @ X18 )
!= X11 )
| ( $true
!= ( X10 @ X16 @ X17 @ X18 ) ) ) ) )
& ( $true
!= ( X10 @ cZ @ x @ x ) ) )
=> ( ! [X13: a,X12: a,X11: a] :
( ( $true
= ( sK2 @ X13 @ X12 @ X11 ) )
| ( ( ( cZ != X12 )
| ( X11 != X13 ) )
& ( ( X11 != X12 )
| ( cZ != X13 ) )
& ! [X19: a,X18: a,X17: a,X16: a,X15: a,X14: a] :
( ( $true
!= ( sK2 @ X19 @ X15 @ X14 ) )
| ( ( cP @ X19 @ X16 )
!= X13 )
| ( ( cP @ X15 @ X17 )
!= X12 )
| ( ( cP @ X14 @ X18 )
!= X11 )
| ( $true
!= ( sK2 @ X16 @ X17 @ X18 ) ) ) ) )
& ( $true
!= ( sK2 @ cZ @ x @ x ) ) ) ),
introduced(choice_axiom,[]) ).
thf(f9,plain,
( ! [X0: a,X1: a,X2: a,X3: a] :
( ( ( X0 = X1 )
& ( X2 = X3 ) )
| ( ( cP @ X3 @ X1 )
!= ( cP @ X2 @ X0 ) ) )
& ! [X4: a,X5: a] :
( cZ
!= ( cP @ X5 @ X4 ) )
& ! [X6: a > $o] :
( ! [X7: a] :
( $true
= ( X6 @ X7 ) )
| ? [X8: a,X9: a] :
( ( $true
= ( X6 @ X8 ) )
& ( $true
= ( X6 @ X9 ) )
& ( $true
!= ( X6 @ ( cP @ X8 @ X9 ) ) ) )
| ( $true
!= ( X6 @ cZ ) ) )
& ? [X10: a > a > a > $o] :
( ! [X11: a,X12: a,X13: a] :
( ( $true
= ( X10 @ X13 @ X12 @ X11 ) )
| ( ( ( cZ != X12 )
| ( X11 != X13 ) )
& ( ( X11 != X12 )
| ( cZ != X13 ) )
& ! [X14: a,X15: a,X16: a,X17: a,X18: a,X19: a] :
( ( $true
!= ( X10 @ X19 @ X15 @ X14 ) )
| ( ( cP @ X19 @ X16 )
!= X13 )
| ( ( cP @ X15 @ X17 )
!= X12 )
| ( ( cP @ X14 @ X18 )
!= X11 )
| ( $true
!= ( X10 @ X16 @ X17 @ X18 ) ) ) ) )
& ( $true
!= ( X10 @ cZ @ x @ x ) ) ) ),
inference(rectify,[],[f8]) ).
thf(f8,plain,
( ! [X6: a,X8: a,X9: a,X7: a] :
( ( ( X6 = X8 )
& ( X7 = X9 ) )
| ( ( cP @ X9 @ X6 )
!= ( cP @ X7 @ X8 ) ) )
& ! [X1: a,X0: a] :
( ( cP @ X0 @ X1 )
!= cZ )
& ! [X2: a > $o] :
( ! [X5: a] :
( $true
= ( X2 @ X5 ) )
| ? [X4: a,X3: a] :
( ( $true
= ( X2 @ X4 ) )
& ( $true
= ( X2 @ X3 ) )
& ( $true
!= ( X2 @ ( cP @ X4 @ X3 ) ) ) )
| ( $true
!= ( X2 @ cZ ) ) )
& ? [X10: a > a > a > $o] :
( ! [X11: a,X12: a,X13: a] :
( ( $true
= ( X10 @ X13 @ X12 @ X11 ) )
| ( ( ( cZ != X12 )
| ( X11 != X13 ) )
& ( ( X11 != X12 )
| ( cZ != X13 ) )
& ! [X18: a,X19: a,X16: a,X17: a,X15: a,X14: a] :
( ( $true
!= ( X10 @ X14 @ X19 @ X18 ) )
| ( ( cP @ X14 @ X16 )
!= X13 )
| ( ( cP @ X19 @ X17 )
!= X12 )
| ( ( cP @ X18 @ X15 )
!= X11 )
| ( $true
!= ( X10 @ X16 @ X17 @ X15 ) ) ) ) )
& ( $true
!= ( X10 @ cZ @ x @ x ) ) ) ),
inference(flattening,[],[f7]) ).
thf(f7,plain,
( ? [X10: a > a > a > $o] :
( ! [X11: a,X12: a,X13: a] :
( ( $true
= ( X10 @ X13 @ X12 @ X11 ) )
| ( ( ( cZ != X12 )
| ( X11 != X13 ) )
& ( ( X11 != X12 )
| ( cZ != X13 ) )
& ! [X18: a,X19: a,X16: a,X17: a,X15: a,X14: a] :
( ( $true
!= ( X10 @ X14 @ X19 @ X18 ) )
| ( ( cP @ X14 @ X16 )
!= X13 )
| ( ( cP @ X19 @ X17 )
!= X12 )
| ( ( cP @ X18 @ X15 )
!= X11 )
| ( $true
!= ( X10 @ X16 @ X17 @ X15 ) ) ) ) )
& ( $true
!= ( X10 @ cZ @ x @ x ) ) )
& ! [X2: a > $o] :
( ! [X5: a] :
( $true
= ( X2 @ X5 ) )
| ? [X3: a,X4: a] :
( ( $true
!= ( X2 @ ( cP @ X4 @ X3 ) ) )
& ( $true
= ( X2 @ X4 ) )
& ( $true
= ( X2 @ X3 ) ) )
| ( $true
!= ( X2 @ cZ ) ) )
& ! [X6: a,X8: a,X9: a,X7: a] :
( ( ( X6 = X8 )
& ( X7 = X9 ) )
| ( ( cP @ X9 @ X6 )
!= ( cP @ X7 @ X8 ) ) )
& ! [X1: a,X0: a] :
( ( cP @ X0 @ X1 )
!= cZ ) ),
inference(ennf_transformation,[],[f6]) ).
thf(f6,plain,
~ ( ( ! [X2: a > $o] :
( ( ! [X3: a,X4: a] :
( ( ( $true
= ( X2 @ X4 ) )
& ( $true
= ( X2 @ X3 ) ) )
=> ( $true
= ( X2 @ ( cP @ X4 @ X3 ) ) ) )
& ( $true
= ( X2 @ cZ ) ) )
=> ! [X5: a] :
( $true
= ( X2 @ X5 ) ) )
& ! [X8: a,X6: a,X9: a,X7: a] :
( ( ( cP @ X9 @ X6 )
= ( cP @ X7 @ X8 ) )
=> ( ( X6 = X8 )
& ( X7 = X9 ) ) )
& ! [X1: a,X0: a] :
( ( cP @ X0 @ X1 )
!= cZ ) )
=> ! [X10: a > a > a > $o] :
( ! [X12: a,X13: a,X11: a] :
( ( ? [X16: a,X17: a,X18: a,X15: a,X19: a,X14: a] :
( ( $true
= ( X10 @ X16 @ X17 @ X15 ) )
& ( ( cP @ X18 @ X15 )
= X11 )
& ( ( cP @ X14 @ X16 )
= X13 )
& ( ( cP @ X19 @ X17 )
= X12 )
& ( $true
= ( X10 @ X14 @ X19 @ X18 ) ) )
| ( ( X11 = X12 )
& ( cZ = X13 ) )
| ( ( X11 = X13 )
& ( cZ = X12 ) ) )
=> ( $true
= ( X10 @ X13 @ X12 @ X11 ) ) )
=> ( $true
= ( X10 @ cZ @ x @ x ) ) ) ),
inference(true_and_false_elimination,[],[f5]) ).
thf(f5,plain,
~ ( ( ! [X2: a > $o] :
( ( ! [X3: a,X4: a] :
( ( ( $true
= ( X2 @ X4 ) )
& ( $true
= ( X2 @ X3 ) ) )
=> ( $true
= ( X2 @ ( cP @ X4 @ X3 ) ) ) )
& ( $true
= ( X2 @ cZ ) ) )
=> ! [X5: a] :
( $true
= ( X2 @ X5 ) ) )
& ! [X8: a,X6: a,X9: a,X7: a] :
( ( ( cP @ X9 @ X6 )
= ( cP @ X7 @ X8 ) )
=> ( ( X6 = X8 )
& ( X7 = X9 ) ) )
& ! [X1: a,X0: a] :
( ( cP @ X0 @ X1 )
!= cZ ) )
=> ! [X10: a > a > a > $o] :
( ( ! [X12: a,X13: a,X11: a] :
( ( ? [X16: a,X17: a,X18: a,X15: a,X19: a,X14: a] :
( ( $true
= ( X10 @ X16 @ X17 @ X15 ) )
& ( ( cP @ X18 @ X15 )
= X11 )
& ( ( cP @ X14 @ X16 )
= X13 )
& ( ( cP @ X19 @ X17 )
= X12 )
& ( $true
= ( X10 @ X14 @ X19 @ X18 ) ) )
| ( ( X11 = X12 )
& ( cZ = X13 ) )
| ( ( X11 = X13 )
& ( cZ = X12 ) ) )
=> ( $true
= ( X10 @ X13 @ X12 @ X11 ) ) )
& $true )
=> ( $true
= ( X10 @ cZ @ x @ x ) ) ) ),
inference(fool_elimination,[],[f4]) ).
thf(f4,plain,
~ ( ( ! [X0: a,X1: a] :
( ( cP @ X0 @ X1 )
!= cZ )
& ! [X2: a > $o] :
( ( ! [X3: a,X4: a] :
( ( ( X2 @ X4 )
& ( X2 @ X3 ) )
=> ( X2 @ ( cP @ X4 @ X3 ) ) )
& ( X2 @ cZ ) )
=> ! [X5: a] : ( X2 @ X5 ) )
& ! [X6: a,X7: a,X8: a,X9: a] :
( ( ( cP @ X9 @ X6 )
= ( cP @ X7 @ X8 ) )
=> ( ( X6 = X8 )
& ( X7 = X9 ) ) ) )
=> ! [X10: a > a > a > $o] :
( ( ! [X11: a,X12: a,X13: a] :
( ( ? [X14: a,X15: a,X16: a,X17: a,X18: a,X19: a] :
( ( ( cP @ X19 @ X17 )
= X12 )
& ( X10 @ X14 @ X19 @ X18 )
& ( ( cP @ X14 @ X16 )
= X13 )
& ( ( cP @ X18 @ X15 )
= X11 )
& ( X10 @ X16 @ X17 @ X15 ) )
| ( ( cZ = X13 )
& ( X11 = X12 ) )
| ( ( X11 = X13 )
& ( cZ = X12 ) ) )
=> ( X10 @ X13 @ X12 @ X11 ) )
& $true )
=> ( X10 @ cZ @ x @ x ) ) ),
inference(rectify,[],[f2]) ).
thf(f2,negated_conjecture,
~ ( ( ! [X0: a,X1: a] :
( ( cP @ X0 @ X1 )
!= cZ )
& ! [X4: a > $o] :
( ( ! [X1: a,X0: a] :
( ( ( X4 @ X0 )
& ( X4 @ X1 ) )
=> ( X4 @ ( cP @ X0 @ X1 ) ) )
& ( X4 @ cZ ) )
=> ! [X0: a] : ( X4 @ X0 ) )
& ! [X3: a,X0: a,X2: a,X1: a] :
( ( ( cP @ X0 @ X2 )
= ( cP @ X1 @ X3 ) )
=> ( ( X2 = X3 )
& ( X0 = X1 ) ) ) )
=> ! [X5: a > a > a > $o] :
( ( ! [X8: a,X7: a,X6: a] :
( ( ? [X9: a,X14: a,X10: a,X12: a,X13: a,X11: a] :
( ( ( cP @ X11 @ X12 )
= X7 )
& ( X5 @ X9 @ X11 @ X13 )
& ( ( cP @ X9 @ X10 )
= X6 )
& ( ( cP @ X13 @ X14 )
= X8 )
& ( X5 @ X10 @ X12 @ X14 ) )
| ( ( cZ = X6 )
& ( X7 = X8 ) )
| ( ( X6 = X8 )
& ( cZ = X7 ) ) )
=> ( X5 @ X6 @ X7 @ X8 ) )
& $true )
=> ( X5 @ cZ @ x @ x ) ) ),
inference(negated_conjecture,[],[f1]) ).
thf(f1,conjecture,
( ( ! [X0: a,X1: a] :
( ( cP @ X0 @ X1 )
!= cZ )
& ! [X4: a > $o] :
( ( ! [X1: a,X0: a] :
( ( ( X4 @ X0 )
& ( X4 @ X1 ) )
=> ( X4 @ ( cP @ X0 @ X1 ) ) )
& ( X4 @ cZ ) )
=> ! [X0: a] : ( X4 @ X0 ) )
& ! [X3: a,X0: a,X2: a,X1: a] :
( ( ( cP @ X0 @ X2 )
= ( cP @ X1 @ X3 ) )
=> ( ( X2 = X3 )
& ( X0 = X1 ) ) ) )
=> ! [X5: a > a > a > $o] :
( ( ! [X8: a,X7: a,X6: a] :
( ( ? [X9: a,X14: a,X10: a,X12: a,X13: a,X11: a] :
( ( ( cP @ X11 @ X12 )
= X7 )
& ( X5 @ X9 @ X11 @ X13 )
& ( ( cP @ X9 @ X10 )
= X6 )
& ( ( cP @ X13 @ X14 )
= X8 )
& ( X5 @ X10 @ X12 @ X14 ) )
| ( ( cZ = X6 )
& ( X7 = X8 ) )
| ( ( X6 = X8 )
& ( cZ = X7 ) ) )
=> ( X5 @ X6 @ X7 @ X8 ) )
& $true )
=> ( X5 @ cZ @ x @ x ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cS_LEM1C_pme) ).
thf(f13,plain,
( $true
!= ( sK2 @ cZ @ x @ x ) ),
inference(cnf_transformation,[],[f12]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.13/0.14 % Problem : SEV200^5 : TPTP v8.2.0. Released v4.0.0.
% 0.13/0.16 % 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.16/0.37 % Computer : n004.cluster.edu
% 0.16/0.37 % Model : x86_64 x86_64
% 0.16/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.37 % Memory : 8042.1875MB
% 0.16/0.37 % OS : Linux 3.10.0-693.el7.x86_64
% 0.16/0.38 % CPULimit : 300
% 0.16/0.38 % WCLimit : 300
% 0.16/0.38 % DateTime : Sun May 19 18:37:38 EDT 2024
% 0.16/0.38 % CPUTime :
% 0.16/0.38 This is a TH0_THM_EQU_NAR problem
% 0.16/0.38 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.16/0.39 % (10941)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.16/0.40 % (10937)lrs+10_1:1_au=on:inj=on:i=2:si=on:rtra=on_0 on theBenchmark for (2999ds/2Mi)
% 0.16/0.40 % (10938)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.16/0.40 % (10936)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.16/0.40 % (10937)Instruction limit reached!
% 0.16/0.40 % (10937)------------------------------
% 0.16/0.40 % (10937)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.16/0.40 % (10937)Termination reason: Unknown
% 0.16/0.40 % (10937)Termination phase: Preprocessing 3
% 0.16/0.40
% 0.16/0.40 % (10938)Instruction limit reached!
% 0.16/0.40 % (10938)------------------------------
% 0.16/0.40 % (10938)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.16/0.40 % (10938)Termination reason: Unknown
% 0.16/0.40 % (10938)Termination phase: Property scanning
% 0.16/0.40
% 0.16/0.40 % (10938)Memory used [KB]: 1023
% 0.16/0.40 % (10938)Time elapsed: 0.003 s
% 0.16/0.40 % (10938)Instructions burned: 2 (million)
% 0.16/0.40 % (10938)------------------------------
% 0.16/0.40 % (10938)------------------------------
% 0.16/0.40 % (10937)Memory used [KB]: 1023
% 0.16/0.40 % (10937)Time elapsed: 0.003 s
% 0.16/0.40 % (10937)Instructions burned: 2 (million)
% 0.16/0.40 % (10937)------------------------------
% 0.16/0.40 % (10937)------------------------------
% 0.16/0.40 % (10941)Instruction limit reached!
% 0.16/0.40 % (10941)------------------------------
% 0.16/0.40 % (10941)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.16/0.40 % (10941)Termination reason: Unknown
% 0.16/0.40 % (10941)Termination phase: Saturation
% 0.16/0.40
% 0.16/0.40 % (10941)Memory used [KB]: 5500
% 0.16/0.40 % (10941)Time elapsed: 0.003 s
% 0.16/0.40 % (10941)Instructions burned: 3 (million)
% 0.16/0.40 % (10941)------------------------------
% 0.16/0.40 % (10941)------------------------------
% 0.16/0.40 % (10935)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.16/0.40 % (10934)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.16/0.40 % (10936)First to succeed.
% 0.16/0.40 % (10940)lrs+1004_1:128_cond=on:e2e=on:sp=weighted_frequency:i=18:si=on:rtra=on_0 on theBenchmark for (2999ds/18Mi)
% 0.16/0.40 % (10935)Instruction limit reached!
% 0.16/0.40 % (10935)------------------------------
% 0.16/0.40 % (10935)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.16/0.40 % (10935)Termination reason: Unknown
% 0.16/0.40 % (10935)Termination phase: Saturation
% 0.16/0.40
% 0.16/0.40 % (10935)Memory used [KB]: 5500
% 0.16/0.40 % (10935)Time elapsed: 0.005 s
% 0.16/0.40 % (10935)Instructions burned: 4 (million)
% 0.16/0.40 % (10935)------------------------------
% 0.16/0.40 % (10935)------------------------------
% 0.16/0.40 % (10934)Also succeeded, but the first one will report.
% 0.16/0.40 % (10936)Refutation found. Thanks to Tanya!
% 0.16/0.40 % SZS status Theorem for theBenchmark
% 0.16/0.40 % SZS output start Proof for theBenchmark
% See solution above
% 0.16/0.40 % (10936)------------------------------
% 0.16/0.40 % (10936)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.16/0.40 % (10936)Termination reason: Refutation
% 0.16/0.40
% 0.16/0.40 % (10936)Memory used [KB]: 5500
% 0.16/0.40 % (10936)Time elapsed: 0.005 s
% 0.16/0.40 % (10936)Instructions burned: 4 (million)
% 0.16/0.40 % (10936)------------------------------
% 0.16/0.40 % (10936)------------------------------
% 0.16/0.40 % (10933)Success in time 0.017 s
% 0.16/0.40 % Vampire---4.8 exiting
%------------------------------------------------------------------------------