TSTP Solution File: ANA110^1 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : ANA110^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/sandbox2/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% Computer : n005.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:40:31 EDT 2024
% Result : Theorem 0.21s 0.39s
% Output : Refutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 26
% Syntax : Number of formulae : 46 ( 19 unt; 20 typ; 0 def)
% Number of atoms : 101 ( 51 equ; 0 cnn)
% Maximal formula atoms : 3 ( 3 avg)
% Number of connectives : 480 ( 12 ~; 3 |; 4 &; 457 @)
% ( 0 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 4 avg)
% Number of types : 3 ( 2 usr)
% Number of type conns : 56 ( 56 >; 0 *; 0 +; 0 <<)
% Number of symbols : 19 ( 16 usr; 4 con; 0-5 aty)
% Number of variables : 54 ( 0 ^ 42 !; 4 ?; 54 :)
% ( 8 !>; 0 ?*; 0 @-; 0 @+)
% Comments :
%------------------------------------------------------------------------------
thf(type_def_5,type,
'type/nums/num': $tType ).
thf(type_def_6,type,
'type/realax/real': $tType ).
thf(func_def_0,type,
'type/realax/real': $tType ).
thf(func_def_1,type,
'type/nums/num': $tType ).
thf(func_def_2,type,
'const/realax/real_of_num': 'type/nums/num' > 'type/realax/real' ).
thf(func_def_3,type,
'const/realax/real_add': 'type/realax/real' > 'type/realax/real' > 'type/realax/real' ).
thf(func_def_4,type,
'const/nums/SUC': 'type/nums/num' > 'type/nums/num' ).
thf(func_def_5,type,
'const/nums/NUMERAL': 'type/nums/num' > 'type/nums/num' ).
thf(func_def_6,type,
'const/nums/_0': 'type/nums/num' ).
thf(func_def_7,type,
'const/iterate/sum':
!>[X0: $tType] : ( ( X0 > $o ) > ( X0 > 'type/realax/real' ) > 'type/realax/real' ) ).
thf(func_def_8,type,
'const/iterate/neutral':
!>[X0: $tType] : ( ( X0 > X0 > X0 ) > X0 ) ).
thf(func_def_9,type,
'const/iterate/monoidal':
!>[X0: $tType] : ( ( X0 > X0 > X0 ) > $o ) ).
thf(func_def_10,type,
'const/iterate/iterate':
!>[X0: $tType,X1: $tType] : ( ( X1 > X1 > X1 ) > ( X0 > $o ) > ( X0 > X1 ) > X1 ) ).
thf(func_def_11,type,
'const/iterate/..': 'type/nums/num' > 'type/nums/num' > 'type/nums/num' > $o ).
thf(func_def_12,type,
'const/class/COND':
!>[X0: $tType] : ( $o > X0 > X0 > X0 ) ).
thf(func_def_13,type,
'const/arith/<=': 'type/nums/num' > 'type/nums/num' > $o ).
thf(func_def_15,type,
vEPSILON:
!>[X0: $tType] : ( ( X0 > $o ) > X0 ) ).
thf(func_def_19,type,
sK0: 'type/nums/num' > 'type/realax/real' ).
thf(func_def_20,type,
sK1: 'type/nums/num' ).
thf(func_def_22,type,
ph3:
!>[X0: $tType] : X0 ).
thf(f28,plain,
$false,
inference(trivial_inequality_removal,[],[f27]) ).
thf(f27,plain,
( ( 'const/class/COND' @ 'type/realax/real'
@ ( ( 'const/nums/NUMERAL' @ 'const/nums/_0' )
= sK1 )
@ ( sK0 @ ( 'const/nums/NUMERAL' @ 'const/nums/_0' ) )
@ ( 'const/realax/real_of_num' @ ( 'const/nums/NUMERAL' @ 'const/nums/_0' ) ) )
!= ( 'const/class/COND' @ 'type/realax/real'
@ ( ( 'const/nums/NUMERAL' @ 'const/nums/_0' )
= sK1 )
@ ( sK0 @ ( 'const/nums/NUMERAL' @ 'const/nums/_0' ) )
@ ( 'const/realax/real_of_num' @ ( 'const/nums/NUMERAL' @ 'const/nums/_0' ) ) ) ),
inference(superposition,[],[f23,f26]) ).
thf(f26,plain,
! [X0: 'type/nums/num',X1: 'type/nums/num' > 'type/realax/real'] :
( ( 'const/class/COND' @ 'type/realax/real'
@ ( ( 'const/nums/NUMERAL' @ 'const/nums/_0' )
= X0 )
@ ( X1 @ ( 'const/nums/NUMERAL' @ 'const/nums/_0' ) )
@ ( 'const/realax/real_of_num' @ ( 'const/nums/NUMERAL' @ 'const/nums/_0' ) ) )
= ( 'const/iterate/iterate' @ 'type/nums/num' @ 'type/realax/real' @ 'const/realax/real_add' @ ( 'const/iterate/..' @ X0 @ ( 'const/nums/NUMERAL' @ 'const/nums/_0' ) ) @ X1 ) ),
inference(forward_demodulation,[],[f25,f19]) ).
thf(f19,plain,
( ( 'const/iterate/neutral' @ 'type/realax/real' @ 'const/realax/real_add' )
= ( 'const/realax/real_of_num' @ ( 'const/nums/NUMERAL' @ 'const/nums/_0' ) ) ),
inference(cnf_transformation,[],[f2]) ).
thf(f2,axiom,
( ( 'const/iterate/neutral' @ 'type/realax/real' @ 'const/realax/real_add' )
= ( 'const/realax/real_of_num' @ ( 'const/nums/NUMERAL' @ 'const/nums/_0' ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p','thm/iterate/NEUTRAL_REAL_ADD_') ).
thf(f25,plain,
! [X0: 'type/nums/num',X1: 'type/nums/num' > 'type/realax/real'] :
( ( 'const/class/COND' @ 'type/realax/real'
@ ( ( 'const/nums/NUMERAL' @ 'const/nums/_0' )
= X0 )
@ ( X1 @ ( 'const/nums/NUMERAL' @ 'const/nums/_0' ) )
@ ( 'const/iterate/neutral' @ 'type/realax/real' @ 'const/realax/real_add' ) )
= ( 'const/iterate/iterate' @ 'type/nums/num' @ 'type/realax/real' @ 'const/realax/real_add' @ ( 'const/iterate/..' @ X0 @ ( 'const/nums/NUMERAL' @ 'const/nums/_0' ) ) @ X1 ) ),
inference(trivial_inequality_removal,[],[f24]) ).
thf(f24,plain,
! [X0: 'type/nums/num',X1: 'type/nums/num' > 'type/realax/real'] :
( ( $true != $true )
| ( ( 'const/class/COND' @ 'type/realax/real'
@ ( ( 'const/nums/NUMERAL' @ 'const/nums/_0' )
= X0 )
@ ( X1 @ ( 'const/nums/NUMERAL' @ 'const/nums/_0' ) )
@ ( 'const/iterate/neutral' @ 'type/realax/real' @ 'const/realax/real_add' ) )
= ( 'const/iterate/iterate' @ 'type/nums/num' @ 'type/realax/real' @ 'const/realax/real_add' @ ( 'const/iterate/..' @ X0 @ ( 'const/nums/NUMERAL' @ 'const/nums/_0' ) ) @ X1 ) ) ),
inference(superposition,[],[f21,f17]) ).
thf(f17,plain,
( ( 'const/iterate/monoidal' @ 'type/realax/real' @ 'const/realax/real_add' )
= $true ),
inference(cnf_transformation,[],[f12]) ).
thf(f12,plain,
( ( 'const/iterate/monoidal' @ 'type/realax/real' @ 'const/realax/real_add' )
= $true ),
inference(fool_elimination,[],[f11]) ).
thf(f11,plain,
'const/iterate/monoidal' @ 'type/realax/real' @ 'const/realax/real_add',
inference(rectify,[],[f4]) ).
thf(f4,axiom,
'const/iterate/monoidal' @ 'type/realax/real' @ 'const/realax/real_add',
file('/export/starexec/sandbox2/benchmark/theBenchmark.p','thm/iterate/MONOIDAL_REAL_ADD_') ).
thf(f21,plain,
! [X0: $tType,X2: X0 > X0 > X0,X1: 'type/nums/num' > X0,X5: 'type/nums/num'] :
( ( ( 'const/iterate/monoidal' @ X0 @ X2 )
!= $true )
| ( ( 'const/class/COND' @ X0
@ ( ( 'const/nums/NUMERAL' @ 'const/nums/_0' )
= X5 )
@ ( X1 @ ( 'const/nums/NUMERAL' @ 'const/nums/_0' ) )
@ ( 'const/iterate/neutral' @ X0 @ X2 ) )
= ( 'const/iterate/iterate' @ 'type/nums/num' @ X0 @ X2 @ ( 'const/iterate/..' @ X5 @ ( 'const/nums/NUMERAL' @ 'const/nums/_0' ) ) @ X1 ) ) ),
inference(cnf_transformation,[],[f13]) ).
thf(f13,plain,
! [X0: $tType,X1: 'type/nums/num' > X0,X2: X0 > X0 > X0] :
( ( ( 'const/iterate/monoidal' @ X0 @ X2 )
!= $true )
| ( ! [X3: 'type/nums/num',X4: 'type/nums/num'] :
( ( 'const/iterate/iterate' @ 'type/nums/num' @ X0 @ X2 @ ( 'const/iterate/..' @ X3 @ ( 'const/nums/SUC' @ X4 ) ) @ X1 )
= ( 'const/class/COND' @ X0 @ ( 'const/arith/<=' @ X3 @ ( 'const/nums/SUC' @ X4 ) ) @ ( X2 @ ( 'const/iterate/iterate' @ 'type/nums/num' @ X0 @ X2 @ ( 'const/iterate/..' @ X3 @ X4 ) @ X1 ) @ ( X1 @ ( 'const/nums/SUC' @ X4 ) ) ) @ ( 'const/iterate/iterate' @ 'type/nums/num' @ X0 @ X2 @ ( 'const/iterate/..' @ X3 @ X4 ) @ X1 ) ) )
& ! [X5: 'type/nums/num'] :
( ( 'const/class/COND' @ X0
@ ( ( 'const/nums/NUMERAL' @ 'const/nums/_0' )
= X5 )
@ ( X1 @ ( 'const/nums/NUMERAL' @ 'const/nums/_0' ) )
@ ( 'const/iterate/neutral' @ X0 @ X2 ) )
= ( 'const/iterate/iterate' @ 'type/nums/num' @ X0 @ X2 @ ( 'const/iterate/..' @ X5 @ ( 'const/nums/NUMERAL' @ 'const/nums/_0' ) ) @ X1 ) ) ) ),
inference(ennf_transformation,[],[f9]) ).
thf(f9,plain,
! [X0: $tType,X1: 'type/nums/num' > X0,X2: X0 > X0 > X0] :
( ( ( 'const/iterate/monoidal' @ X0 @ X2 )
= $true )
=> ( ! [X3: 'type/nums/num',X4: 'type/nums/num'] :
( ( 'const/iterate/iterate' @ 'type/nums/num' @ X0 @ X2 @ ( 'const/iterate/..' @ X3 @ ( 'const/nums/SUC' @ X4 ) ) @ X1 )
= ( 'const/class/COND' @ X0 @ ( 'const/arith/<=' @ X3 @ ( 'const/nums/SUC' @ X4 ) ) @ ( X2 @ ( 'const/iterate/iterate' @ 'type/nums/num' @ X0 @ X2 @ ( 'const/iterate/..' @ X3 @ X4 ) @ X1 ) @ ( X1 @ ( 'const/nums/SUC' @ X4 ) ) ) @ ( 'const/iterate/iterate' @ 'type/nums/num' @ X0 @ X2 @ ( 'const/iterate/..' @ X3 @ X4 ) @ X1 ) ) )
& ! [X5: 'type/nums/num'] :
( ( 'const/class/COND' @ X0
@ ( ( 'const/nums/NUMERAL' @ 'const/nums/_0' )
= X5 )
@ ( X1 @ ( 'const/nums/NUMERAL' @ 'const/nums/_0' ) )
@ ( 'const/iterate/neutral' @ X0 @ X2 ) )
= ( 'const/iterate/iterate' @ 'type/nums/num' @ X0 @ X2 @ ( 'const/iterate/..' @ X5 @ ( 'const/nums/NUMERAL' @ 'const/nums/_0' ) ) @ X1 ) ) ) ),
inference(fool_elimination,[],[f8]) ).
thf(f8,plain,
! [X0: $tType,X1: 'type/nums/num' > X0,X2: X0 > X0 > X0] :
( ( 'const/iterate/monoidal' @ X0 @ X2 )
=> ( ! [X3: 'type/nums/num',X4: 'type/nums/num'] :
( ( 'const/iterate/iterate' @ 'type/nums/num' @ X0 @ X2 @ ( 'const/iterate/..' @ X3 @ ( 'const/nums/SUC' @ X4 ) ) @ X1 )
= ( 'const/class/COND' @ X0 @ ( 'const/arith/<=' @ X3 @ ( 'const/nums/SUC' @ X4 ) ) @ ( X2 @ ( 'const/iterate/iterate' @ 'type/nums/num' @ X0 @ X2 @ ( 'const/iterate/..' @ X3 @ X4 ) @ X1 ) @ ( X1 @ ( 'const/nums/SUC' @ X4 ) ) ) @ ( 'const/iterate/iterate' @ 'type/nums/num' @ X0 @ X2 @ ( 'const/iterate/..' @ X3 @ X4 ) @ X1 ) ) )
& ! [X5: 'type/nums/num'] :
( ( 'const/iterate/iterate' @ 'type/nums/num' @ X0 @ X2 @ ( 'const/iterate/..' @ X5 @ ( 'const/nums/NUMERAL' @ 'const/nums/_0' ) ) @ X1 )
= ( 'const/class/COND' @ X0
@ ( ( 'const/nums/NUMERAL' @ 'const/nums/_0' )
= X5 )
@ ( X1 @ ( 'const/nums/NUMERAL' @ 'const/nums/_0' ) )
@ ( 'const/iterate/neutral' @ X0 @ X2 ) ) ) ) ),
inference(rectify,[],[f3]) ).
thf(f3,axiom,
! [X0: $tType,X1: 'type/nums/num' > X0,X2: X0 > X0 > X0] :
( ( 'const/iterate/monoidal' @ X0 @ X2 )
=> ( ! [X3: 'type/nums/num',X4: 'type/nums/num'] :
( ( 'const/iterate/iterate' @ 'type/nums/num' @ X0 @ X2 @ ( 'const/iterate/..' @ X3 @ ( 'const/nums/SUC' @ X4 ) ) @ X1 )
= ( 'const/class/COND' @ X0 @ ( 'const/arith/<=' @ X3 @ ( 'const/nums/SUC' @ X4 ) ) @ ( X2 @ ( 'const/iterate/iterate' @ 'type/nums/num' @ X0 @ X2 @ ( 'const/iterate/..' @ X3 @ X4 ) @ X1 ) @ ( X1 @ ( 'const/nums/SUC' @ X4 ) ) ) @ ( 'const/iterate/iterate' @ 'type/nums/num' @ X0 @ X2 @ ( 'const/iterate/..' @ X3 @ X4 ) @ X1 ) ) )
& ! [X3: 'type/nums/num'] :
( ( 'const/iterate/iterate' @ 'type/nums/num' @ X0 @ X2 @ ( 'const/iterate/..' @ X3 @ ( 'const/nums/NUMERAL' @ 'const/nums/_0' ) ) @ X1 )
= ( 'const/class/COND' @ X0
@ ( ( 'const/nums/NUMERAL' @ 'const/nums/_0' )
= X3 )
@ ( X1 @ ( 'const/nums/NUMERAL' @ 'const/nums/_0' ) )
@ ( 'const/iterate/neutral' @ X0 @ X2 ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p','thm/iterate/ITERATE_CLAUSES_NUMSEG_') ).
thf(f23,plain,
( ( 'const/class/COND' @ 'type/realax/real'
@ ( ( 'const/nums/NUMERAL' @ 'const/nums/_0' )
= sK1 )
@ ( sK0 @ ( 'const/nums/NUMERAL' @ 'const/nums/_0' ) )
@ ( 'const/realax/real_of_num' @ ( 'const/nums/NUMERAL' @ 'const/nums/_0' ) ) )
!= ( 'const/iterate/iterate' @ 'type/nums/num' @ 'type/realax/real' @ 'const/realax/real_add' @ ( 'const/iterate/..' @ sK1 @ ( 'const/nums/NUMERAL' @ 'const/nums/_0' ) ) @ sK0 ) ),
inference(definition_unfolding,[],[f18,f20]) ).
thf(f20,plain,
! [X0: $tType] :
( 'const/iterate/sum'
@ ( X0
= ( 'const/iterate/iterate' @ X0 @ 'type/realax/real' @ 'const/realax/real_add' ) ) ),
inference(cnf_transformation,[],[f1]) ).
thf(f1,axiom,
! [X0: $tType] :
( 'const/iterate/sum'
@ ( X0
= ( 'const/iterate/iterate' @ X0 @ 'type/realax/real' @ 'const/realax/real_add' ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p','thm/iterate/sum_') ).
thf(f18,plain,
( ( 'const/class/COND' @ 'type/realax/real'
@ ( ( 'const/nums/NUMERAL' @ 'const/nums/_0' )
= sK1 )
@ ( sK0 @ ( 'const/nums/NUMERAL' @ 'const/nums/_0' ) )
@ ( 'const/realax/real_of_num' @ ( 'const/nums/NUMERAL' @ 'const/nums/_0' ) ) )
!= ( 'const/iterate/sum' @ 'type/nums/num' @ ( 'const/iterate/..' @ sK1 @ ( 'const/nums/NUMERAL' @ 'const/nums/_0' ) ) @ sK0 ) ),
inference(cnf_transformation,[],[f16]) ).
thf(f16,plain,
( ( 'const/class/COND' @ 'type/realax/real'
@ ( ( 'const/nums/NUMERAL' @ 'const/nums/_0' )
= sK1 )
@ ( sK0 @ ( 'const/nums/NUMERAL' @ 'const/nums/_0' ) )
@ ( 'const/realax/real_of_num' @ ( 'const/nums/NUMERAL' @ 'const/nums/_0' ) ) )
!= ( 'const/iterate/sum' @ 'type/nums/num' @ ( 'const/iterate/..' @ sK1 @ ( 'const/nums/NUMERAL' @ 'const/nums/_0' ) ) @ sK0 ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1])],[f14,f15]) ).
thf(f15,plain,
( ? [X0: 'type/nums/num' > 'type/realax/real',X1: 'type/nums/num'] :
( ( 'const/iterate/sum' @ 'type/nums/num' @ ( 'const/iterate/..' @ X1 @ ( 'const/nums/NUMERAL' @ 'const/nums/_0' ) ) @ X0 )
!= ( 'const/class/COND' @ 'type/realax/real'
@ ( ( 'const/nums/NUMERAL' @ 'const/nums/_0' )
= X1 )
@ ( X0 @ ( 'const/nums/NUMERAL' @ 'const/nums/_0' ) )
@ ( 'const/realax/real_of_num' @ ( 'const/nums/NUMERAL' @ 'const/nums/_0' ) ) ) )
=> ( ( 'const/class/COND' @ 'type/realax/real'
@ ( ( 'const/nums/NUMERAL' @ 'const/nums/_0' )
= sK1 )
@ ( sK0 @ ( 'const/nums/NUMERAL' @ 'const/nums/_0' ) )
@ ( 'const/realax/real_of_num' @ ( 'const/nums/NUMERAL' @ 'const/nums/_0' ) ) )
!= ( 'const/iterate/sum' @ 'type/nums/num' @ ( 'const/iterate/..' @ sK1 @ ( 'const/nums/NUMERAL' @ 'const/nums/_0' ) ) @ sK0 ) ) ),
introduced(choice_axiom,[]) ).
thf(f14,plain,
? [X0: 'type/nums/num' > 'type/realax/real',X1: 'type/nums/num'] :
( ( 'const/iterate/sum' @ 'type/nums/num' @ ( 'const/iterate/..' @ X1 @ ( 'const/nums/NUMERAL' @ 'const/nums/_0' ) ) @ X0 )
!= ( 'const/class/COND' @ 'type/realax/real'
@ ( ( 'const/nums/NUMERAL' @ 'const/nums/_0' )
= X1 )
@ ( X0 @ ( 'const/nums/NUMERAL' @ 'const/nums/_0' ) )
@ ( 'const/realax/real_of_num' @ ( 'const/nums/NUMERAL' @ 'const/nums/_0' ) ) ) ),
inference(ennf_transformation,[],[f10]) ).
thf(f10,plain,
~ ! [X0: 'type/nums/num' > 'type/realax/real',X1: 'type/nums/num'] :
( ( 'const/iterate/sum' @ 'type/nums/num' @ ( 'const/iterate/..' @ X1 @ ( 'const/nums/NUMERAL' @ 'const/nums/_0' ) ) @ X0 )
= ( 'const/class/COND' @ 'type/realax/real'
@ ( ( 'const/nums/NUMERAL' @ 'const/nums/_0' )
= X1 )
@ ( X0 @ ( 'const/nums/NUMERAL' @ 'const/nums/_0' ) )
@ ( 'const/realax/real_of_num' @ ( 'const/nums/NUMERAL' @ 'const/nums/_0' ) ) ) ),
inference(fool_elimination,[],[f6]) ).
thf(f6,negated_conjecture,
~ ! [X0: 'type/nums/num' > 'type/realax/real',X1: 'type/nums/num'] :
( ( 'const/iterate/sum' @ 'type/nums/num' @ ( 'const/iterate/..' @ X1 @ ( 'const/nums/NUMERAL' @ 'const/nums/_0' ) ) @ X0 )
= ( 'const/class/COND' @ 'type/realax/real'
@ ( ( 'const/nums/NUMERAL' @ 'const/nums/_0' )
= X1 )
@ ( X0 @ ( 'const/nums/NUMERAL' @ 'const/nums/_0' ) )
@ ( 'const/realax/real_of_num' @ ( 'const/nums/NUMERAL' @ 'const/nums/_0' ) ) ) ),
inference(negated_conjecture,[],[f5]) ).
thf(f5,conjecture,
! [X0: 'type/nums/num' > 'type/realax/real',X1: 'type/nums/num'] :
( ( 'const/iterate/sum' @ 'type/nums/num' @ ( 'const/iterate/..' @ X1 @ ( 'const/nums/NUMERAL' @ 'const/nums/_0' ) ) @ X0 )
= ( 'const/class/COND' @ 'type/realax/real'
@ ( ( 'const/nums/NUMERAL' @ 'const/nums/_0' )
= X1 )
@ ( X0 @ ( 'const/nums/NUMERAL' @ 'const/nums/_0' ) )
@ ( 'const/realax/real_of_num' @ ( 'const/nums/NUMERAL' @ 'const/nums/_0' ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p','thm/iterate/SUM_CLAUSES_NUMSEG_0') ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : ANA110^1 : TPTP v8.2.0. Released v7.0.0.
% 0.06/0.14 % 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.14/0.35 % Computer : n005.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Mon May 20 07:56:38 EDT 2024
% 0.14/0.35 % CPUTime :
% 0.14/0.35 This is a TH1_THM_EQU_NAR problem
% 0.14/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/sandbox2/benchmark/theBenchmark.p
% 0.14/0.37 % (1489)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.14/0.37 % (1489)Refutation not found, incomplete strategy
% 0.14/0.37 % (1489)------------------------------
% 0.14/0.37 % (1489)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.14/0.37 % (1489)Termination reason: Refutation not found, incomplete strategy
% 0.14/0.37
% 0.14/0.37
% 0.14/0.37 % (1489)Memory used [KB]: 5500
% 0.14/0.37 % (1489)Time elapsed: 0.003 s
% 0.14/0.37 % (1489)Instructions burned: 3 (million)
% 0.14/0.37 % (1489)------------------------------
% 0.14/0.37 % (1489)------------------------------
% 0.14/0.37 % (1488)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.14/0.37 % (1488)Instruction limit reached!
% 0.14/0.37 % (1488)------------------------------
% 0.14/0.37 % (1488)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.14/0.37 % (1488)Termination reason: Unknown
% 0.14/0.37 % (1488)Termination phase: Property scanning
% 0.14/0.37
% 0.14/0.37 % (1488)Memory used [KB]: 1023
% 0.14/0.37 % (1488)Time elapsed: 0.003 s
% 0.14/0.37 % (1488)Instructions burned: 3 (million)
% 0.14/0.37 % (1488)------------------------------
% 0.14/0.37 % (1488)------------------------------
% 0.14/0.38 % (1491)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.14/0.38 % (1491)Instruction limit reached!
% 0.14/0.38 % (1491)------------------------------
% 0.14/0.38 % (1491)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.14/0.38 % (1491)Termination reason: Unknown
% 0.14/0.38 % (1491)Termination phase: Saturation
% 0.14/0.38
% 0.14/0.38 % (1491)Memory used [KB]: 895
% 0.14/0.38 % (1491)Time elapsed: 0.003 s
% 0.14/0.38 % (1491)Instructions burned: 3 (million)
% 0.14/0.38 % (1491)------------------------------
% 0.14/0.38 % (1491)------------------------------
% 0.14/0.38 % (1490)lrs+1004_1:128_cond=on:e2e=on:sp=weighted_frequency:i=18:si=on:rtra=on_0 on theBenchmark for (2999ds/18Mi)
% 0.14/0.38 % (1484)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.14/0.38 % (1487)lrs+10_1:1_au=on:inj=on:i=2:si=on:rtra=on_0 on theBenchmark for (2999ds/2Mi)
% 0.14/0.38 % (1485)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.14/0.38 % (1487)Instruction limit reached!
% 0.14/0.38 % (1487)------------------------------
% 0.14/0.38 % (1487)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.14/0.38 % (1487)Termination reason: Unknown
% 0.14/0.38 % (1487)Termination phase: Property scanning
% 0.14/0.38
% 0.14/0.38 % (1487)Memory used [KB]: 895
% 0.14/0.38 % (1487)Time elapsed: 0.003 s
% 0.14/0.38 % (1487)Instructions burned: 2 (million)
% 0.14/0.38 % (1487)------------------------------
% 0.14/0.38 % (1487)------------------------------
% 0.14/0.38 % (1485)Instruction limit reached!
% 0.14/0.38 % (1485)------------------------------
% 0.14/0.38 % (1485)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.14/0.38 % (1485)Termination reason: Unknown
% 0.14/0.38 % (1485)Termination phase: Saturation
% 0.14/0.38
% 0.14/0.38 % (1485)Memory used [KB]: 5500
% 0.14/0.38 % (1485)Time elapsed: 0.006 s
% 0.14/0.38 % (1485)Instructions burned: 5 (million)
% 0.14/0.38 % (1485)------------------------------
% 0.14/0.38 % (1485)------------------------------
% 0.21/0.39 % (1492)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.21/0.39 % (1486)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.39 % (1493)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.21/0.39 % (1490)Instruction limit reached!
% 0.21/0.39 % (1490)------------------------------
% 0.21/0.39 % (1490)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.21/0.39 % (1490)Termination reason: Unknown
% 0.21/0.39 % (1490)Termination phase: Saturation
% 0.21/0.39
% 0.21/0.39 % (1490)Memory used [KB]: 5628
% 0.21/0.39 % (1490)Time elapsed: 0.011 s
% 0.21/0.39 % (1490)Instructions burned: 19 (million)
% 0.21/0.39 % (1490)------------------------------
% 0.21/0.39 % (1490)------------------------------
% 0.21/0.39 % (1486)First to succeed.
% 0.21/0.39 % (1493)Also succeeded, but the first one will report.
% 0.21/0.39 % (1486)Refutation found. Thanks to Tanya!
% 0.21/0.39 % SZS status Theorem for theBenchmark
% 0.21/0.39 % SZS output start Proof for theBenchmark
% See solution above
% 0.21/0.39 % (1486)------------------------------
% 0.21/0.39 % (1486)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.21/0.39 % (1486)Termination reason: Refutation
% 0.21/0.39
% 0.21/0.39 % (1486)Memory used [KB]: 5500
% 0.21/0.39 % (1486)Time elapsed: 0.031 s
% 0.21/0.39 % (1486)Instructions burned: 5 (million)
% 0.21/0.39 % (1486)------------------------------
% 0.21/0.39 % (1486)------------------------------
% 0.21/0.39 % (1483)Success in time 0.035 s
% 0.21/0.39 % Vampire---4.8 exiting
%------------------------------------------------------------------------------