TSTP Solution File: NUN048^1 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : NUN048^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/sandbox/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% Computer : n010.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 02:17:01 EDT 2024
% Result : Theorem 0.21s 0.38s
% Output : Refutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 20
% Syntax : Number of formulae : 55 ( 9 unt; 14 typ; 0 def)
% Number of atoms : 235 ( 86 equ; 0 cnn)
% Maximal formula atoms : 6 ( 5 avg)
% Number of connectives : 405 ( 40 ~; 21 |; 21 &; 306 @)
% ( 2 <=>; 15 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 5 avg)
% Number of types : 2 ( 1 usr)
% Number of type conns : 33 ( 33 >; 0 *; 0 +; 0 <<)
% Number of symbols : 15 ( 12 usr; 5 con; 0-3 aty)
% Number of variables : 86 ( 0 ^ 74 !; 9 ?; 86 :)
% ( 3 !>; 0 ?*; 0 @-; 0 @+)
% Comments :
%------------------------------------------------------------------------------
thf(type_def_6,type,
'type/nums/num': $tType ).
thf(func_def_0,type,
'type/nums/num': $tType ).
thf(func_def_1,type,
'const/trivia/I':
!>[X0: $tType] : ( X0 > X0 ) ).
thf(func_def_2,type,
'const/nums/NUMERAL': 'type/nums/num' > 'type/nums/num' ).
thf(func_def_3,type,
'const/nums/_0': 'type/nums/num' ).
thf(func_def_4,type,
'const/iterate/nsum':
!>[X0: $tType] : ( ( X0 > $o ) > ( X0 > 'type/nums/num' ) > 'type/nums/num' ) ).
thf(func_def_5,type,
'const/iterate/..': 'type/nums/num' > 'type/nums/num' > 'type/nums/num' > $o ).
thf(func_def_6,type,
'const/arith/<=': 'type/nums/num' > 'type/nums/num' > $o ).
thf(func_def_7,type,
'const/arith/<': 'type/nums/num' > 'type/nums/num' > $o ).
thf(func_def_11,type,
sK0: 'type/nums/num' > 'type/nums/num' ).
thf(func_def_12,type,
sK1: 'type/nums/num' ).
thf(func_def_13,type,
sK2: 'type/nums/num' ).
thf(func_def_14,type,
sK3: 'type/nums/num' > 'type/nums/num' > ( 'type/nums/num' > 'type/nums/num' ) > 'type/nums/num' ).
thf(func_def_16,type,
ph5:
!>[X0: $tType] : X0 ).
thf(f49,plain,
$false,
inference(subsumption_resolution,[],[f48,f42]) ).
thf(f42,plain,
( $true
= ( 'const/arith/<=' @ ( sK3 @ sK2 @ sK1 @ sK0 ) @ sK2 ) ),
inference(trivial_inequality_removal,[],[f37]) ).
thf(f37,plain,
( ( $true
= ( 'const/arith/<=' @ ( sK3 @ sK2 @ sK1 @ sK0 ) @ sK2 ) )
| ( ( 'const/nums/NUMERAL' @ 'const/nums/_0' )
!= ( 'const/nums/NUMERAL' @ 'const/nums/_0' ) ) ),
inference(superposition,[],[f28,f30]) ).
thf(f30,plain,
! [X2: 'type/nums/num',X0: 'type/nums/num' > 'type/nums/num',X1: 'type/nums/num'] :
( ( ( 'const/nums/NUMERAL' @ 'const/nums/_0' )
= ( 'const/iterate/nsum' @ 'type/nums/num' @ ( 'const/iterate/..' @ X1 @ X2 ) @ X0 ) )
| ( ( 'const/arith/<=' @ ( sK3 @ X2 @ X1 @ X0 ) @ X2 )
= $true ) ),
inference(cnf_transformation,[],[f25]) ).
thf(f25,plain,
! [X0: 'type/nums/num' > 'type/nums/num',X1: 'type/nums/num',X2: 'type/nums/num'] :
( ( ( ( 'const/nums/NUMERAL' @ 'const/nums/_0' )
!= ( X0 @ ( sK3 @ X2 @ X1 @ X0 ) ) )
& ( $true
= ( 'const/arith/<=' @ X1 @ ( sK3 @ X2 @ X1 @ X0 ) ) )
& ( ( 'const/arith/<=' @ ( sK3 @ X2 @ X1 @ X0 ) @ X2 )
= $true ) )
| ( ( 'const/nums/NUMERAL' @ 'const/nums/_0' )
= ( 'const/iterate/nsum' @ 'type/nums/num' @ ( 'const/iterate/..' @ X1 @ X2 ) @ X0 ) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK3])],[f21,f24]) ).
thf(f24,plain,
! [X0: 'type/nums/num' > 'type/nums/num',X1: 'type/nums/num',X2: 'type/nums/num'] :
( ? [X3: 'type/nums/num'] :
( ( ( X0 @ X3 )
!= ( 'const/nums/NUMERAL' @ 'const/nums/_0' ) )
& ( ( 'const/arith/<=' @ X1 @ X3 )
= $true )
& ( ( 'const/arith/<=' @ X3 @ X2 )
= $true ) )
=> ( ( ( 'const/nums/NUMERAL' @ 'const/nums/_0' )
!= ( X0 @ ( sK3 @ X2 @ X1 @ X0 ) ) )
& ( $true
= ( 'const/arith/<=' @ X1 @ ( sK3 @ X2 @ X1 @ X0 ) ) )
& ( ( 'const/arith/<=' @ ( sK3 @ X2 @ X1 @ X0 ) @ X2 )
= $true ) ) ),
introduced(choice_axiom,[]) ).
thf(f21,plain,
! [X0: 'type/nums/num' > 'type/nums/num',X1: 'type/nums/num',X2: 'type/nums/num'] :
( ? [X3: 'type/nums/num'] :
( ( ( X0 @ X3 )
!= ( 'const/nums/NUMERAL' @ 'const/nums/_0' ) )
& ( ( 'const/arith/<=' @ X1 @ X3 )
= $true )
& ( ( 'const/arith/<=' @ X3 @ X2 )
= $true ) )
| ( ( 'const/nums/NUMERAL' @ 'const/nums/_0' )
= ( 'const/iterate/nsum' @ 'type/nums/num' @ ( 'const/iterate/..' @ X1 @ X2 ) @ X0 ) ) ),
inference(flattening,[],[f20]) ).
thf(f20,plain,
! [X0: 'type/nums/num' > 'type/nums/num',X1: 'type/nums/num',X2: 'type/nums/num'] :
( ( ( 'const/nums/NUMERAL' @ 'const/nums/_0' )
= ( 'const/iterate/nsum' @ 'type/nums/num' @ ( 'const/iterate/..' @ X1 @ X2 ) @ X0 ) )
| ? [X3: 'type/nums/num'] :
( ( ( X0 @ X3 )
!= ( 'const/nums/NUMERAL' @ 'const/nums/_0' ) )
& ( ( 'const/arith/<=' @ X3 @ X2 )
= $true )
& ( ( 'const/arith/<=' @ X1 @ X3 )
= $true ) ) ),
inference(ennf_transformation,[],[f13]) ).
thf(f13,plain,
! [X0: 'type/nums/num' > 'type/nums/num',X1: 'type/nums/num',X2: 'type/nums/num'] :
( ! [X3: 'type/nums/num'] :
( ( ( ( 'const/arith/<=' @ X3 @ X2 )
= $true )
& ( ( 'const/arith/<=' @ X1 @ X3 )
= $true ) )
=> ( ( X0 @ X3 )
= ( 'const/nums/NUMERAL' @ 'const/nums/_0' ) ) )
=> ( ( 'const/nums/NUMERAL' @ 'const/nums/_0' )
= ( 'const/iterate/nsum' @ 'type/nums/num' @ ( 'const/iterate/..' @ X1 @ X2 ) @ X0 ) ) ),
inference(fool_elimination,[],[f12]) ).
thf(f12,plain,
! [X0: 'type/nums/num' > 'type/nums/num',X1: 'type/nums/num',X2: 'type/nums/num'] :
( ! [X3: 'type/nums/num'] :
( ( ( 'const/arith/<=' @ X1 @ X3 )
& ( 'const/arith/<=' @ X3 @ X2 ) )
=> ( ( X0 @ X3 )
= ( 'const/nums/NUMERAL' @ 'const/nums/_0' ) ) )
=> ( ( 'const/nums/NUMERAL' @ 'const/nums/_0' )
= ( 'const/iterate/nsum' @ 'type/nums/num' @ ( 'const/iterate/..' @ X1 @ X2 ) @ X0 ) ) ),
inference(rectify,[],[f4]) ).
thf(f4,axiom,
! [X0: 'type/nums/num' > 'type/nums/num',X1: 'type/nums/num',X2: 'type/nums/num'] :
( ! [X3: 'type/nums/num'] :
( ( ( 'const/arith/<=' @ X1 @ X3 )
& ( 'const/arith/<=' @ X3 @ X2 ) )
=> ( ( X0 @ X3 )
= ( 'const/nums/NUMERAL' @ 'const/nums/_0' ) ) )
=> ( ( 'const/nums/NUMERAL' @ 'const/nums/_0' )
= ( 'const/iterate/nsum' @ 'type/nums/num' @ ( 'const/iterate/..' @ X1 @ X2 ) @ X0 ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p','thm/iterate/NSUM_EQ_0_NUMSEG_') ).
thf(f28,plain,
( ( 'const/nums/NUMERAL' @ 'const/nums/_0' )
!= ( 'const/iterate/nsum' @ 'type/nums/num' @ ( 'const/iterate/..' @ sK1 @ sK2 ) @ sK0 ) ),
inference(cnf_transformation,[],[f23]) ).
thf(f23,plain,
( ( ( 'const/nums/NUMERAL' @ 'const/nums/_0' )
!= ( 'const/iterate/nsum' @ 'type/nums/num' @ ( 'const/iterate/..' @ sK1 @ sK2 ) @ sK0 ) )
& ( ( 'const/arith/<' @ sK2 @ sK1 )
= $true ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2])],[f19,f22]) ).
thf(f22,plain,
( ? [X0: 'type/nums/num' > 'type/nums/num',X1: 'type/nums/num',X2: 'type/nums/num'] :
( ( ( 'const/nums/NUMERAL' @ 'const/nums/_0' )
!= ( 'const/iterate/nsum' @ 'type/nums/num' @ ( 'const/iterate/..' @ X1 @ X2 ) @ X0 ) )
& ( ( 'const/arith/<' @ X2 @ X1 )
= $true ) )
=> ( ( ( 'const/nums/NUMERAL' @ 'const/nums/_0' )
!= ( 'const/iterate/nsum' @ 'type/nums/num' @ ( 'const/iterate/..' @ sK1 @ sK2 ) @ sK0 ) )
& ( ( 'const/arith/<' @ sK2 @ sK1 )
= $true ) ) ),
introduced(choice_axiom,[]) ).
thf(f19,plain,
? [X0: 'type/nums/num' > 'type/nums/num',X1: 'type/nums/num',X2: 'type/nums/num'] :
( ( ( 'const/nums/NUMERAL' @ 'const/nums/_0' )
!= ( 'const/iterate/nsum' @ 'type/nums/num' @ ( 'const/iterate/..' @ X1 @ X2 ) @ X0 ) )
& ( ( 'const/arith/<' @ X2 @ X1 )
= $true ) ),
inference(ennf_transformation,[],[f11]) ).
thf(f11,plain,
~ ! [X0: 'type/nums/num' > 'type/nums/num',X1: 'type/nums/num',X2: 'type/nums/num'] :
( ( ( 'const/arith/<' @ X2 @ X1 )
= $true )
=> ( ( 'const/nums/NUMERAL' @ 'const/nums/_0' )
= ( 'const/iterate/nsum' @ 'type/nums/num' @ ( 'const/iterate/..' @ X1 @ X2 ) @ X0 ) ) ),
inference(fool_elimination,[],[f10]) ).
thf(f10,plain,
~ ! [X0: 'type/nums/num' > 'type/nums/num',X1: 'type/nums/num',X2: 'type/nums/num'] :
( ( 'const/arith/<' @ X2 @ X1 )
=> ( ( 'const/nums/NUMERAL' @ 'const/nums/_0' )
= ( 'const/iterate/nsum' @ 'type/nums/num' @ ( 'const/iterate/..' @ X1 @ X2 ) @ X0 ) ) ),
inference(rectify,[],[f6]) ).
thf(f6,negated_conjecture,
~ ! [X0: 'type/nums/num' > 'type/nums/num',X1: 'type/nums/num',X2: 'type/nums/num'] :
( ( 'const/arith/<' @ X2 @ X1 )
=> ( ( 'const/nums/NUMERAL' @ 'const/nums/_0' )
= ( 'const/iterate/nsum' @ 'type/nums/num' @ ( 'const/iterate/..' @ X1 @ X2 ) @ X0 ) ) ),
inference(negated_conjecture,[],[f5]) ).
thf(f5,conjecture,
! [X0: 'type/nums/num' > 'type/nums/num',X1: 'type/nums/num',X2: 'type/nums/num'] :
( ( 'const/arith/<' @ X2 @ X1 )
=> ( ( 'const/nums/NUMERAL' @ 'const/nums/_0' )
= ( 'const/iterate/nsum' @ 'type/nums/num' @ ( 'const/iterate/..' @ X1 @ X2 ) @ X0 ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p','thm/iterate/NSUM_TRIV_NUMSEG_') ).
thf(f48,plain,
( $true
!= ( 'const/arith/<=' @ ( sK3 @ sK2 @ sK1 @ sK0 ) @ sK2 ) ),
inference(trivial_inequality_removal,[],[f47]) ).
thf(f47,plain,
( ( $true != $true )
| ( $true
!= ( 'const/arith/<=' @ ( sK3 @ sK2 @ sK1 @ sK0 ) @ sK2 ) ) ),
inference(superposition,[],[f44,f41]) ).
thf(f41,plain,
( ( 'const/arith/<=' @ sK1 @ ( sK3 @ sK2 @ sK1 @ sK0 ) )
= $true ),
inference(trivial_inequality_removal,[],[f38]) ).
thf(f38,plain,
( ( ( 'const/arith/<=' @ sK1 @ ( sK3 @ sK2 @ sK1 @ sK0 ) )
= $true )
| ( ( 'const/nums/NUMERAL' @ 'const/nums/_0' )
!= ( 'const/nums/NUMERAL' @ 'const/nums/_0' ) ) ),
inference(superposition,[],[f28,f31]) ).
thf(f31,plain,
! [X2: 'type/nums/num',X0: 'type/nums/num' > 'type/nums/num',X1: 'type/nums/num'] :
( ( ( 'const/nums/NUMERAL' @ 'const/nums/_0' )
= ( 'const/iterate/nsum' @ 'type/nums/num' @ ( 'const/iterate/..' @ X1 @ X2 ) @ X0 ) )
| ( $true
= ( 'const/arith/<=' @ X1 @ ( sK3 @ X2 @ X1 @ X0 ) ) ) ),
inference(cnf_transformation,[],[f25]) ).
thf(f44,plain,
! [X0: 'type/nums/num'] :
( ( ( 'const/arith/<=' @ sK1 @ X0 )
!= $true )
| ( ( 'const/arith/<=' @ X0 @ sK2 )
!= $true ) ),
inference(trivial_inequality_removal,[],[f43]) ).
thf(f43,plain,
! [X0: 'type/nums/num'] :
( ( ( 'const/arith/<=' @ sK1 @ X0 )
!= $true )
| ( ( 'const/arith/<=' @ X0 @ sK2 )
!= $true )
| ( $true != $true ) ),
inference(superposition,[],[f36,f29]) ).
thf(f29,plain,
! [X2: 'type/nums/num',X0: 'type/nums/num',X1: 'type/nums/num'] :
( ( ( 'const/arith/<=' @ X0 @ X2 )
= $true )
| ( ( 'const/arith/<=' @ X0 @ X1 )
!= $true )
| ( ( 'const/arith/<=' @ X1 @ X2 )
!= $true ) ),
inference(cnf_transformation,[],[f18]) ).
thf(f18,plain,
! [X0: 'type/nums/num',X1: 'type/nums/num',X2: 'type/nums/num'] :
( ( ( 'const/arith/<=' @ X0 @ X1 )
!= $true )
| ( ( 'const/arith/<=' @ X1 @ X2 )
!= $true )
| ( ( 'const/arith/<=' @ X0 @ X2 )
= $true ) ),
inference(flattening,[],[f17]) ).
thf(f17,plain,
! [X0: 'type/nums/num',X1: 'type/nums/num',X2: 'type/nums/num'] :
( ( ( 'const/arith/<=' @ X0 @ X2 )
= $true )
| ( ( 'const/arith/<=' @ X1 @ X2 )
!= $true )
| ( ( 'const/arith/<=' @ X0 @ X1 )
!= $true ) ),
inference(ennf_transformation,[],[f15]) ).
thf(f15,plain,
! [X0: 'type/nums/num',X1: 'type/nums/num',X2: 'type/nums/num'] :
( ( ( ( 'const/arith/<=' @ X1 @ X2 )
= $true )
& ( ( 'const/arith/<=' @ X0 @ X1 )
= $true ) )
=> ( ( 'const/arith/<=' @ X0 @ X2 )
= $true ) ),
inference(fool_elimination,[],[f14]) ).
thf(f14,plain,
! [X0: 'type/nums/num',X1: 'type/nums/num',X2: 'type/nums/num'] :
( ( ( 'const/arith/<=' @ X1 @ X2 )
& ( 'const/arith/<=' @ X0 @ X1 ) )
=> ( 'const/arith/<=' @ X0 @ X2 ) ),
inference(rectify,[],[f3]) ).
thf(f3,axiom,
! [X0: 'type/nums/num',X1: 'type/nums/num',X2: 'type/nums/num'] :
( ( ( 'const/arith/<=' @ X1 @ X2 )
& ( 'const/arith/<=' @ X0 @ X1 ) )
=> ( 'const/arith/<=' @ X0 @ X2 ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p','thm/arith/LE_TRANS_') ).
thf(f36,plain,
( ( 'const/arith/<=' @ sK1 @ sK2 )
!= $true ),
inference(trivial_inequality_removal,[],[f35]) ).
thf(f35,plain,
( ( $true != $true )
| ( ( 'const/arith/<=' @ sK1 @ sK2 )
!= $true ) ),
inference(superposition,[],[f34,f27]) ).
thf(f27,plain,
( ( 'const/arith/<' @ sK2 @ sK1 )
= $true ),
inference(cnf_transformation,[],[f23]) ).
thf(f34,plain,
! [X0: 'type/nums/num',X1: 'type/nums/num'] :
( ( ( 'const/arith/<' @ X0 @ X1 )
!= $true )
| ( ( 'const/arith/<=' @ X1 @ X0 )
!= $true ) ),
inference(cnf_transformation,[],[f26]) ).
thf(f26,plain,
! [X0: 'type/nums/num',X1: 'type/nums/num'] :
( ( ( ( 'const/arith/<' @ X0 @ X1 )
!= $true )
| ( ( 'const/arith/<=' @ X1 @ X0 )
!= $true ) )
& ( ( ( 'const/arith/<=' @ X1 @ X0 )
= $true )
| ( ( 'const/arith/<' @ X0 @ X1 )
= $true ) ) ),
inference(nnf_transformation,[],[f16]) ).
thf(f16,plain,
! [X0: 'type/nums/num',X1: 'type/nums/num'] :
( ( ( 'const/arith/<' @ X0 @ X1 )
!= $true )
<=> ( ( 'const/arith/<=' @ X1 @ X0 )
= $true ) ),
inference(flattening,[],[f9]) ).
thf(f9,plain,
! [X0: 'type/nums/num',X1: 'type/nums/num'] :
( ( ( 'const/arith/<=' @ X1 @ X0 )
= $true )
<=> ( ( 'const/arith/<' @ X0 @ X1 )
!= $true ) ),
inference(fool_elimination,[],[f8]) ).
thf(f8,plain,
! [X0: 'type/nums/num',X1: 'type/nums/num'] :
( ( 'const/arith/<=' @ X1 @ X0 )
= ( ~ ( 'const/arith/<' @ X0 @ X1 ) ) ),
inference(rectify,[],[f2]) ).
thf(f2,axiom,
! [X0: 'type/nums/num',X1: 'type/nums/num'] :
( ( 'const/arith/<=' @ X1 @ X0 )
= ( ~ ( 'const/arith/<' @ X0 @ X1 ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p','thm/arith/NOT_LT_') ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : NUN048^1 : TPTP v8.2.0. Released v7.0.0.
% 0.15/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 : n010.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 : Sat May 18 15:14:38 EDT 2024
% 0.15/0.35 % CPUTime :
% 0.15/0.35 This is a TH1_THM_EQU_NAR problem
% 0.15/0.36 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.21/0.37 % (19356)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.21/0.37 % (19355)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.21/0.37 % (19358)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.21/0.37 % (19357)lrs+10_1:1_au=on:inj=on:i=2:si=on:rtra=on_0 on theBenchmark for (2999ds/2Mi)
% 0.21/0.37 % (19354)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.21/0.37 % (19359)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.21/0.37 % (19360)lrs+1004_1:128_cond=on:e2e=on:sp=weighted_frequency:i=18:si=on:rtra=on_0 on theBenchmark for (2999ds/18Mi)
% 0.21/0.37 % (19361)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.21/0.37 % (19358)Instruction limit reached!
% 0.21/0.37 % (19358)------------------------------
% 0.21/0.37 % (19358)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.21/0.38 % (19358)Termination reason: Unknown
% 0.21/0.38 % (19358)Termination phase: Property scanning
% 0.21/0.38
% 0.21/0.38 % (19358)Memory used [KB]: 895
% 0.21/0.38 % (19358)Time elapsed: 0.003 s
% 0.21/0.38 % (19358)Instructions burned: 2 (million)
% 0.21/0.38 % (19358)------------------------------
% 0.21/0.38 % (19358)------------------------------
% 0.21/0.38 % (19357)Instruction limit reached!
% 0.21/0.38 % (19357)------------------------------
% 0.21/0.38 % (19357)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.21/0.38 % (19357)Termination reason: Unknown
% 0.21/0.38 % (19357)Termination phase: Saturation
% 0.21/0.38
% 0.21/0.38 % (19357)Memory used [KB]: 5500
% 0.21/0.38 % (19357)Time elapsed: 0.004 s
% 0.21/0.38 % (19357)Instructions burned: 2 (million)
% 0.21/0.38 % (19357)------------------------------
% 0.21/0.38 % (19357)------------------------------
% 0.21/0.38 % (19355)Instruction limit reached!
% 0.21/0.38 % (19355)------------------------------
% 0.21/0.38 % (19355)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.21/0.38 % (19355)Termination reason: Unknown
% 0.21/0.38 % (19355)Termination phase: Saturation
% 0.21/0.38
% 0.21/0.38 % (19355)Memory used [KB]: 5500
% 0.21/0.38 % (19355)Time elapsed: 0.005 s
% 0.21/0.38 % (19355)Instructions burned: 4 (million)
% 0.21/0.38 % (19355)------------------------------
% 0.21/0.38 % (19355)------------------------------
% 0.21/0.38 % (19361)Instruction limit reached!
% 0.21/0.38 % (19361)------------------------------
% 0.21/0.38 % (19361)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.21/0.38 % (19361)Termination reason: Unknown
% 0.21/0.38 % (19361)Termination phase: Saturation
% 0.21/0.38
% 0.21/0.38 % (19361)Memory used [KB]: 5500
% 0.21/0.38 % (19361)Time elapsed: 0.005 s
% 0.21/0.38 % (19361)Instructions burned: 3 (million)
% 0.21/0.38 % (19361)------------------------------
% 0.21/0.38 % (19361)------------------------------
% 0.21/0.38 % (19359)First to succeed.
% 0.21/0.38 % (19359)Refutation found. Thanks to Tanya!
% 0.21/0.38 % SZS status Theorem for theBenchmark
% 0.21/0.38 % SZS output start Proof for theBenchmark
% See solution above
% 0.21/0.38 % (19359)------------------------------
% 0.21/0.38 % (19359)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.21/0.38 % (19359)Termination reason: Refutation
% 0.21/0.38
% 0.21/0.38 % (19359)Memory used [KB]: 5500
% 0.21/0.38 % (19359)Time elapsed: 0.007 s
% 0.21/0.38 % (19359)Instructions burned: 4 (million)
% 0.21/0.38 % (19359)------------------------------
% 0.21/0.38 % (19359)------------------------------
% 0.21/0.38 % (19353)Success in time 0.008 s
% 0.21/0.38 % Vampire---4.8 exiting
%------------------------------------------------------------------------------