TSTP Solution File: SEU899^5 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SEU899^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/sandbox/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% Computer : n006.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:52:07 EDT 2024
% Result : Theorem 0.22s 0.38s
% Output : Refutation 0.22s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 26
% Syntax : Number of formulae : 72 ( 1 unt; 12 typ; 0 def)
% Number of atoms : 474 ( 187 equ; 0 cnn)
% Maximal formula atoms : 28 ( 7 avg)
% Number of connectives : 515 ( 106 ~; 139 |; 57 &; 195 @)
% ( 13 <=>; 4 =>; 0 <=; 1 <~>)
% Maximal formula depth : 9 ( 4 avg)
% Number of types : 3 ( 2 usr)
% Number of type conns : 5 ( 5 >; 0 *; 0 +; 0 <<)
% Number of symbols : 20 ( 17 usr; 15 con; 0-2 aty)
% Number of variables : 69 ( 0 ^ 30 !; 38 ?; 69 :)
% ( 1 !>; 0 ?*; 0 @-; 0 @+)
% Comments :
%------------------------------------------------------------------------------
thf(type_def_5,type,
b: $tType ).
thf(type_def_6,type,
a: $tType ).
thf(func_def_0,type,
b: $tType ).
thf(func_def_1,type,
a: $tType ).
thf(func_def_2,type,
cF: b > a ).
thf(func_def_3,type,
cS: b > $o ).
thf(func_def_4,type,
cR: b > $o ).
thf(func_def_6,type,
vEPSILON:
!>[X0: $tType] : ( ( X0 > $o ) > X0 ) ).
thf(func_def_9,type,
sK0: a ).
thf(func_def_10,type,
sK1: b ).
thf(func_def_11,type,
sK2: b ).
thf(func_def_12,type,
sK3: b ).
thf(f89,plain,
$false,
inference(avatar_sat_refutation,[],[f39,f52,f53,f58,f59,f60,f68,f70,f71,f72,f77,f82,f83,f88]) ).
thf(f88,plain,
( ~ spl4_2
| ~ spl4_7
| ~ spl4_8 ),
inference(avatar_split_clause,[],[f87,f62,f55,f32]) ).
thf(f32,plain,
( spl4_2
<=> ( $true
= ( cS @ sK3 ) ) ),
introduced(avatar_definition,[new_symbols(naming,[spl4_2])]) ).
thf(f55,plain,
( spl4_7
<=> ( sK0
= ( cF @ sK3 ) ) ),
introduced(avatar_definition,[new_symbols(naming,[spl4_7])]) ).
thf(f62,plain,
( spl4_8
<=> ! [X3: b] :
( ( ( cS @ X3 )
!= $true )
| ( sK0
!= ( cF @ X3 ) ) ) ),
introduced(avatar_definition,[new_symbols(naming,[spl4_8])]) ).
thf(f87,plain,
( ( $true
!= ( cS @ sK3 ) )
| ~ spl4_7
| ~ spl4_8 ),
inference(trivial_inequality_removal,[],[f85]) ).
thf(f85,plain,
( ( sK0 != sK0 )
| ( $true
!= ( cS @ sK3 ) )
| ~ spl4_7
| ~ spl4_8 ),
inference(superposition,[],[f63,f57]) ).
thf(f57,plain,
( ( sK0
= ( cF @ sK3 ) )
| ~ spl4_7 ),
inference(avatar_component_clause,[],[f55]) ).
thf(f63,plain,
( ! [X3: b] :
( ( sK0
!= ( cF @ X3 ) )
| ( ( cS @ X3 )
!= $true ) )
| ~ spl4_8 ),
inference(avatar_component_clause,[],[f62]) ).
thf(f83,plain,
( ~ spl4_4
| ~ spl4_1
| ~ spl4_9 ),
inference(avatar_split_clause,[],[f80,f65,f28,f41]) ).
thf(f41,plain,
( spl4_4
<=> ( ( cR @ sK1 )
= $true ) ),
introduced(avatar_definition,[new_symbols(naming,[spl4_4])]) ).
thf(f28,plain,
( spl4_1
<=> ( ( cF @ sK1 )
= sK0 ) ),
introduced(avatar_definition,[new_symbols(naming,[spl4_1])]) ).
thf(f65,plain,
( spl4_9
<=> ! [X1: b] :
( ( ( cR @ X1 )
!= $true )
| ( ( cF @ X1 )
!= sK0 ) ) ),
introduced(avatar_definition,[new_symbols(naming,[spl4_9])]) ).
thf(f80,plain,
( ( ( cR @ sK1 )
!= $true )
| ~ spl4_1
| ~ spl4_9 ),
inference(trivial_inequality_removal,[],[f78]) ).
thf(f78,plain,
( ( sK0 != sK0 )
| ( ( cR @ sK1 )
!= $true )
| ~ spl4_1
| ~ spl4_9 ),
inference(superposition,[],[f66,f30]) ).
thf(f30,plain,
( ( ( cF @ sK1 )
= sK0 )
| ~ spl4_1 ),
inference(avatar_component_clause,[],[f28]) ).
thf(f66,plain,
( ! [X1: b] :
( ( ( cF @ X1 )
!= sK0 )
| ( ( cR @ X1 )
!= $true ) )
| ~ spl4_9 ),
inference(avatar_component_clause,[],[f65]) ).
thf(f82,plain,
( ~ spl4_6
| ~ spl4_1
| ~ spl4_8 ),
inference(avatar_split_clause,[],[f81,f62,f28,f49]) ).
thf(f49,plain,
( spl4_6
<=> ( ( cS @ sK1 )
= $true ) ),
introduced(avatar_definition,[new_symbols(naming,[spl4_6])]) ).
thf(f81,plain,
( ( ( cS @ sK1 )
!= $true )
| ~ spl4_1
| ~ spl4_8 ),
inference(trivial_inequality_removal,[],[f79]) ).
thf(f79,plain,
( ( sK0 != sK0 )
| ( ( cS @ sK1 )
!= $true )
| ~ spl4_1
| ~ spl4_8 ),
inference(superposition,[],[f63,f30]) ).
thf(f77,plain,
( ~ spl4_3
| ~ spl4_5
| ~ spl4_9 ),
inference(avatar_split_clause,[],[f76,f65,f45,f36]) ).
thf(f36,plain,
( spl4_3
<=> ( $true
= ( cR @ sK2 ) ) ),
introduced(avatar_definition,[new_symbols(naming,[spl4_3])]) ).
thf(f45,plain,
( spl4_5
<=> ( ( cF @ sK2 )
= sK0 ) ),
introduced(avatar_definition,[new_symbols(naming,[spl4_5])]) ).
thf(f76,plain,
( ( $true
!= ( cR @ sK2 ) )
| ~ spl4_5
| ~ spl4_9 ),
inference(trivial_inequality_removal,[],[f75]) ).
thf(f75,plain,
( ( $true
!= ( cR @ sK2 ) )
| ( sK0 != sK0 )
| ~ spl4_5
| ~ spl4_9 ),
inference(superposition,[],[f66,f47]) ).
thf(f47,plain,
( ( ( cF @ sK2 )
= sK0 )
| ~ spl4_5 ),
inference(avatar_component_clause,[],[f45]) ).
thf(f72,plain,
( spl4_9
| spl4_9 ),
inference(avatar_split_clause,[],[f26,f65,f65]) ).
thf(f26,plain,
! [X2: b,X1: b] :
( ( ( cF @ X1 )
!= sK0 )
| ( $true
!= ( cR @ X2 ) )
| ( ( cR @ X1 )
!= $true )
| ( ( cF @ X2 )
!= sK0 ) ),
inference(cnf_transformation,[],[f14]) ).
thf(f14,plain,
( ( ! [X1: b] :
( ( ( ( cR @ X1 )
!= $true )
& ( ( cS @ X1 )
!= $true ) )
| ( ( cF @ X1 )
!= sK0 ) )
| ( ! [X2: b] :
( ( $true
!= ( cR @ X2 ) )
| ( ( cF @ X2 )
!= sK0 ) )
& ! [X3: b] :
( ( sK0
!= ( cF @ X3 ) )
| ( ( cS @ X3 )
!= $true ) ) ) )
& ( ( ( ( ( cR @ sK1 )
= $true )
| ( ( cS @ sK1 )
= $true ) )
& ( ( cF @ sK1 )
= sK0 ) )
| ( ( $true
= ( cR @ sK2 ) )
& ( ( cF @ sK2 )
= sK0 ) )
| ( ( sK0
= ( cF @ sK3 ) )
& ( $true
= ( cS @ sK3 ) ) ) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3])],[f9,f13,f12,f11,f10]) ).
thf(f10,plain,
( ? [X0: a] :
( ( ! [X1: b] :
( ( ( ( cR @ X1 )
!= $true )
& ( ( cS @ X1 )
!= $true ) )
| ( ( cF @ X1 )
!= X0 ) )
| ( ! [X2: b] :
( ( $true
!= ( cR @ X2 ) )
| ( ( cF @ X2 )
!= X0 ) )
& ! [X3: b] :
( ( ( cF @ X3 )
!= X0 )
| ( ( cS @ X3 )
!= $true ) ) ) )
& ( ? [X4: b] :
( ( ( ( cR @ X4 )
= $true )
| ( ( cS @ X4 )
= $true ) )
& ( ( cF @ X4 )
= X0 ) )
| ? [X5: b] :
( ( $true
= ( cR @ X5 ) )
& ( ( cF @ X5 )
= X0 ) )
| ? [X6: b] :
( ( ( cF @ X6 )
= X0 )
& ( ( cS @ X6 )
= $true ) ) ) )
=> ( ( ! [X1: b] :
( ( ( ( cR @ X1 )
!= $true )
& ( ( cS @ X1 )
!= $true ) )
| ( ( cF @ X1 )
!= sK0 ) )
| ( ! [X2: b] :
( ( $true
!= ( cR @ X2 ) )
| ( ( cF @ X2 )
!= sK0 ) )
& ! [X3: b] :
( ( sK0
!= ( cF @ X3 ) )
| ( ( cS @ X3 )
!= $true ) ) ) )
& ( ? [X4: b] :
( ( ( ( cR @ X4 )
= $true )
| ( ( cS @ X4 )
= $true ) )
& ( sK0
= ( cF @ X4 ) ) )
| ? [X5: b] :
( ( $true
= ( cR @ X5 ) )
& ( sK0
= ( cF @ X5 ) ) )
| ? [X6: b] :
( ( sK0
= ( cF @ X6 ) )
& ( ( cS @ X6 )
= $true ) ) ) ) ),
introduced(choice_axiom,[]) ).
thf(f11,plain,
( ? [X4: b] :
( ( ( ( cR @ X4 )
= $true )
| ( ( cS @ X4 )
= $true ) )
& ( sK0
= ( cF @ X4 ) ) )
=> ( ( ( ( cR @ sK1 )
= $true )
| ( ( cS @ sK1 )
= $true ) )
& ( ( cF @ sK1 )
= sK0 ) ) ),
introduced(choice_axiom,[]) ).
thf(f12,plain,
( ? [X5: b] :
( ( $true
= ( cR @ X5 ) )
& ( sK0
= ( cF @ X5 ) ) )
=> ( ( $true
= ( cR @ sK2 ) )
& ( ( cF @ sK2 )
= sK0 ) ) ),
introduced(choice_axiom,[]) ).
thf(f13,plain,
( ? [X6: b] :
( ( sK0
= ( cF @ X6 ) )
& ( ( cS @ X6 )
= $true ) )
=> ( ( sK0
= ( cF @ sK3 ) )
& ( $true
= ( cS @ sK3 ) ) ) ),
introduced(choice_axiom,[]) ).
thf(f9,plain,
? [X0: a] :
( ( ! [X1: b] :
( ( ( ( cR @ X1 )
!= $true )
& ( ( cS @ X1 )
!= $true ) )
| ( ( cF @ X1 )
!= X0 ) )
| ( ! [X2: b] :
( ( $true
!= ( cR @ X2 ) )
| ( ( cF @ X2 )
!= X0 ) )
& ! [X3: b] :
( ( ( cF @ X3 )
!= X0 )
| ( ( cS @ X3 )
!= $true ) ) ) )
& ( ? [X4: b] :
( ( ( ( cR @ X4 )
= $true )
| ( ( cS @ X4 )
= $true ) )
& ( ( cF @ X4 )
= X0 ) )
| ? [X5: b] :
( ( $true
= ( cR @ X5 ) )
& ( ( cF @ X5 )
= X0 ) )
| ? [X6: b] :
( ( ( cF @ X6 )
= X0 )
& ( ( cS @ X6 )
= $true ) ) ) ),
inference(rectify,[],[f8]) ).
thf(f8,plain,
? [X0: a] :
( ( ! [X1: b] :
( ( ( ( cR @ X1 )
!= $true )
& ( ( cS @ X1 )
!= $true ) )
| ( ( cF @ X1 )
!= X0 ) )
| ( ! [X2: b] :
( ( $true
!= ( cR @ X2 ) )
| ( ( cF @ X2 )
!= X0 ) )
& ! [X3: b] :
( ( ( cF @ X3 )
!= X0 )
| ( ( cS @ X3 )
!= $true ) ) ) )
& ( ? [X1: b] :
( ( ( ( cR @ X1 )
= $true )
| ( ( cS @ X1 )
= $true ) )
& ( ( cF @ X1 )
= X0 ) )
| ? [X2: b] :
( ( $true
= ( cR @ X2 ) )
& ( ( cF @ X2 )
= X0 ) )
| ? [X3: b] :
( ( ( cF @ X3 )
= X0 )
& ( ( cS @ X3 )
= $true ) ) ) ),
inference(flattening,[],[f7]) ).
thf(f7,plain,
? [X0: a] :
( ( ! [X1: b] :
( ( ( ( cR @ X1 )
!= $true )
& ( ( cS @ X1 )
!= $true ) )
| ( ( cF @ X1 )
!= X0 ) )
| ( ! [X2: b] :
( ( $true
!= ( cR @ X2 ) )
| ( ( cF @ X2 )
!= X0 ) )
& ! [X3: b] :
( ( ( cF @ X3 )
!= X0 )
| ( ( cS @ X3 )
!= $true ) ) ) )
& ( ? [X1: b] :
( ( ( ( cR @ X1 )
= $true )
| ( ( cS @ X1 )
= $true ) )
& ( ( cF @ X1 )
= X0 ) )
| ? [X2: b] :
( ( $true
= ( cR @ X2 ) )
& ( ( cF @ X2 )
= X0 ) )
| ? [X3: b] :
( ( ( cF @ X3 )
= X0 )
& ( ( cS @ X3 )
= $true ) ) ) ),
inference(nnf_transformation,[],[f6]) ).
thf(f6,plain,
? [X0: a] :
( ( ? [X2: b] :
( ( $true
= ( cR @ X2 ) )
& ( ( cF @ X2 )
= X0 ) )
| ? [X3: b] :
( ( ( cF @ X3 )
= X0 )
& ( ( cS @ X3 )
= $true ) ) )
<~> ? [X1: b] :
( ( ( ( cR @ X1 )
= $true )
| ( ( cS @ X1 )
= $true ) )
& ( ( cF @ X1 )
= X0 ) ) ),
inference(ennf_transformation,[],[f5]) ).
thf(f5,plain,
~ ! [X0: a] :
( ( ? [X2: b] :
( ( $true
= ( cR @ X2 ) )
& ( ( cF @ X2 )
= X0 ) )
| ? [X3: b] :
( ( ( cF @ X3 )
= X0 )
& ( ( cS @ X3 )
= $true ) ) )
<=> ? [X1: b] :
( ( ( ( cR @ X1 )
= $true )
| ( ( cS @ X1 )
= $true ) )
& ( ( cF @ X1 )
= X0 ) ) ),
inference(fool_elimination,[],[f4]) ).
thf(f4,plain,
~ ! [X0: a] :
( ? [X1: b] :
( ( ( cR @ X1 )
| ( cS @ X1 ) )
& ( ( cF @ X1 )
= X0 ) )
<=> ( ? [X2: b] :
( ( ( cF @ X2 )
= X0 )
& ( cR @ X2 ) )
| ? [X3: b] :
( ( ( cF @ X3 )
= X0 )
& ( cS @ X3 ) ) ) ),
inference(rectify,[],[f2]) ).
thf(f2,negated_conjecture,
~ ! [X0: a] :
( ? [X1: b] :
( ( ( cR @ X1 )
| ( cS @ X1 ) )
& ( ( cF @ X1 )
= X0 ) )
<=> ( ? [X1: b] :
( ( ( cF @ X1 )
= X0 )
& ( cR @ X1 ) )
| ? [X1: b] :
( ( ( cF @ X1 )
= X0 )
& ( cS @ X1 ) ) ) ),
inference(negated_conjecture,[],[f1]) ).
thf(f1,conjecture,
! [X0: a] :
( ? [X1: b] :
( ( ( cR @ X1 )
| ( cS @ X1 ) )
& ( ( cF @ X1 )
= X0 ) )
<=> ( ? [X1: b] :
( ( ( cF @ X1 )
= X0 )
& ( cR @ X1 ) )
| ? [X1: b] :
( ( ( cF @ X1 )
= X0 )
& ( cS @ X1 ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cTHM34_pme) ).
thf(f71,plain,
( spl4_7
| spl4_3
| spl4_1 ),
inference(avatar_split_clause,[],[f18,f28,f36,f55]) ).
thf(f18,plain,
( ( sK0
= ( cF @ sK3 ) )
| ( ( cF @ sK1 )
= sK0 )
| ( $true
= ( cR @ sK2 ) ) ),
inference(cnf_transformation,[],[f14]) ).
thf(f70,plain,
( spl4_5
| spl4_1
| spl4_7 ),
inference(avatar_split_clause,[],[f16,f55,f28,f45]) ).
thf(f16,plain,
( ( sK0
= ( cF @ sK3 ) )
| ( ( cF @ sK2 )
= sK0 )
| ( ( cF @ sK1 )
= sK0 ) ),
inference(cnf_transformation,[],[f14]) ).
thf(f68,plain,
( spl4_8
| spl4_8 ),
inference(avatar_split_clause,[],[f23,f62,f62]) ).
thf(f23,plain,
! [X3: b,X1: b] :
( ( ( cS @ X1 )
!= $true )
| ( ( cS @ X3 )
!= $true )
| ( sK0
!= ( cF @ X3 ) )
| ( ( cF @ X1 )
!= sK0 ) ),
inference(cnf_transformation,[],[f14]) ).
thf(f60,plain,
( spl4_7
| spl4_6
| spl4_3
| spl4_4 ),
inference(avatar_split_clause,[],[f22,f41,f36,f49,f55]) ).
thf(f22,plain,
( ( sK0
= ( cF @ sK3 ) )
| ( $true
= ( cR @ sK2 ) )
| ( ( cR @ sK1 )
= $true )
| ( ( cS @ sK1 )
= $true ) ),
inference(cnf_transformation,[],[f14]) ).
thf(f59,plain,
( spl4_2
| spl4_4
| spl4_6
| spl4_3 ),
inference(avatar_split_clause,[],[f21,f36,f49,f41,f32]) ).
thf(f21,plain,
( ( ( cS @ sK1 )
= $true )
| ( $true
= ( cR @ sK2 ) )
| ( ( cR @ sK1 )
= $true )
| ( $true
= ( cS @ sK3 ) ) ),
inference(cnf_transformation,[],[f14]) ).
thf(f58,plain,
( spl4_5
| spl4_4
| spl4_6
| spl4_7 ),
inference(avatar_split_clause,[],[f20,f55,f49,f41,f45]) ).
thf(f20,plain,
( ( ( cF @ sK2 )
= sK0 )
| ( ( cR @ sK1 )
= $true )
| ( ( cS @ sK1 )
= $true )
| ( sK0
= ( cF @ sK3 ) ) ),
inference(cnf_transformation,[],[f14]) ).
thf(f53,plain,
( spl4_1
| spl4_2
| spl4_5 ),
inference(avatar_split_clause,[],[f15,f45,f32,f28]) ).
thf(f15,plain,
( ( ( cF @ sK2 )
= sK0 )
| ( ( cF @ sK1 )
= sK0 )
| ( $true
= ( cS @ sK3 ) ) ),
inference(cnf_transformation,[],[f14]) ).
thf(f52,plain,
( spl4_4
| spl4_5
| spl4_6
| spl4_2 ),
inference(avatar_split_clause,[],[f19,f32,f49,f45,f41]) ).
thf(f19,plain,
( ( $true
= ( cS @ sK3 ) )
| ( ( cS @ sK1 )
= $true )
| ( ( cR @ sK1 )
= $true )
| ( ( cF @ sK2 )
= sK0 ) ),
inference(cnf_transformation,[],[f14]) ).
thf(f39,plain,
( spl4_1
| spl4_2
| spl4_3 ),
inference(avatar_split_clause,[],[f17,f36,f32,f28]) ).
thf(f17,plain,
( ( ( cF @ sK1 )
= sK0 )
| ( $true
= ( cS @ sK3 ) )
| ( $true
= ( cR @ sK2 ) ) ),
inference(cnf_transformation,[],[f14]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SEU899^5 : TPTP v8.2.0. Released v4.0.0.
% 0.03/0.14 % 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.15/0.35 % Computer : n006.cluster.edu
% 0.15/0.35 % Model : x86_64 x86_64
% 0.15/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.35 % Memory : 8042.1875MB
% 0.15/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.35 % CPULimit : 300
% 0.15/0.35 % WCLimit : 300
% 0.15/0.35 % DateTime : Sun May 19 17:05:38 EDT 2024
% 0.15/0.35 % CPUTime :
% 0.15/0.35 This is a TH0_THM_EQU_NAR problem
% 0.15/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.22/0.37 % (13132)lrs+10_1:1_au=on:inj=on:i=2:si=on:rtra=on_0 on theBenchmark for (3000ds/2Mi)
% 0.22/0.37 % (13129)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.22/0.37 % (13131)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.22/0.37 % (13133)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.22/0.37 % (13130)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.22/0.37 % (13134)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.22/0.37 % (13135)lrs+1004_1:128_cond=on:e2e=on:sp=weighted_frequency:i=18:si=on:rtra=on_0 on theBenchmark for (3000ds/18Mi)
% 0.22/0.37 % (13132)Instruction limit reached!
% 0.22/0.37 % (13132)------------------------------
% 0.22/0.37 % (13132)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.22/0.37 % (13136)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.22/0.37 % (13132)Termination reason: Unknown
% 0.22/0.37 % (13132)Termination phase: Saturation
% 0.22/0.37 % (13133)Instruction limit reached!
% 0.22/0.37 % (13133)------------------------------
% 0.22/0.37 % (13133)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.22/0.37
% 0.22/0.37 % (13132)Memory used [KB]: 5500
% 0.22/0.37 % (13132)Time elapsed: 0.004 s
% 0.22/0.37 % (13132)Instructions burned: 2 (million)
% 0.22/0.37 % (13132)------------------------------
% 0.22/0.37 % (13132)------------------------------
% 0.22/0.37 % (13133)Termination reason: Unknown
% 0.22/0.37 % (13133)Termination phase: Saturation
% 0.22/0.37
% 0.22/0.37 % (13133)Memory used [KB]: 895
% 0.22/0.37 % (13133)Time elapsed: 0.003 s
% 0.22/0.37 % (13133)Instructions burned: 2 (million)
% 0.22/0.37 % (13133)------------------------------
% 0.22/0.37 % (13133)------------------------------
% 0.22/0.38 % (13130)Instruction limit reached!
% 0.22/0.38 % (13130)------------------------------
% 0.22/0.38 % (13130)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.22/0.38 % (13130)Termination reason: Unknown
% 0.22/0.38 % (13130)Termination phase: Saturation
% 0.22/0.38
% 0.22/0.38 % (13130)Memory used [KB]: 5500
% 0.22/0.38 % (13130)Time elapsed: 0.004 s
% 0.22/0.38 % (13130)Instructions burned: 4 (million)
% 0.22/0.38 % (13130)------------------------------
% 0.22/0.38 % (13130)------------------------------
% 0.22/0.38 % (13136)Instruction limit reached!
% 0.22/0.38 % (13136)------------------------------
% 0.22/0.38 % (13136)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.22/0.38 % (13136)Termination reason: Unknown
% 0.22/0.38 % (13136)Termination phase: Saturation
% 0.22/0.38
% 0.22/0.38 % (13136)Memory used [KB]: 5500
% 0.22/0.38 % (13136)Time elapsed: 0.004 s
% 0.22/0.38 % (13136)Instructions burned: 3 (million)
% 0.22/0.38 % (13136)------------------------------
% 0.22/0.38 % (13136)------------------------------
% 0.22/0.38 % (13131)First to succeed.
% 0.22/0.38 % (13134)Also succeeded, but the first one will report.
% 0.22/0.38 % (13131)Refutation found. Thanks to Tanya!
% 0.22/0.38 % SZS status Theorem for theBenchmark
% 0.22/0.38 % SZS output start Proof for theBenchmark
% See solution above
% 0.22/0.38 % (13131)------------------------------
% 0.22/0.38 % (13131)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.22/0.38 % (13131)Termination reason: Refutation
% 0.22/0.38
% 0.22/0.38 % (13131)Memory used [KB]: 5500
% 0.22/0.38 % (13131)Time elapsed: 0.007 s
% 0.22/0.38 % (13131)Instructions burned: 5 (million)
% 0.22/0.38 % (13131)------------------------------
% 0.22/0.38 % (13131)------------------------------
% 0.22/0.38 % (13128)Success in time 0.019 s
% 0.22/0.38 % Vampire---4.8 exiting
%------------------------------------------------------------------------------