TSTP Solution File: NUM926^1 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : NUM926^1 : TPTP v8.2.0. Released 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 : n012.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 01:47:13 EDT 2024
% Result : Theorem 0.20s 0.41s
% Output : Refutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 42
% Syntax : Number of formulae : 82 ( 13 unt; 31 typ; 0 def)
% Number of atoms : 168 ( 74 equ; 0 cnn)
% Maximal formula atoms : 6 ( 3 avg)
% Number of connectives : 691 ( 40 ~; 37 |; 9 &; 592 @)
% ( 7 <=>; 6 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 4 avg)
% Number of types : 3 ( 2 usr)
% Number of type conns : 26 ( 26 >; 0 *; 0 +; 0 <<)
% Number of symbols : 34 ( 31 usr; 17 con; 0-2 aty)
% Number of variables : 46 ( 0 ^ 20 !; 26 ?; 46 :)
% Comments :
%------------------------------------------------------------------------------
thf(type_def_5,type,
int: $tType ).
thf(type_def_6,type,
nat: $tType ).
thf(func_def_0,type,
int: $tType ).
thf(func_def_1,type,
nat: $tType ).
thf(func_def_2,type,
one_one_int: int ).
thf(func_def_3,type,
one_one_nat: nat ).
thf(func_def_4,type,
plus_plus_int: int > int > int ).
thf(func_def_5,type,
plus_plus_nat: nat > nat > nat ).
thf(func_def_6,type,
times_times_int: int > int > int ).
thf(func_def_7,type,
times_times_nat: nat > nat > nat ).
thf(func_def_8,type,
zprime: int > $o ).
thf(func_def_9,type,
bit0: int > int ).
thf(func_def_10,type,
bit1: int > int ).
thf(func_def_11,type,
pls: int ).
thf(func_def_12,type,
number_number_of_int: int > int ).
thf(func_def_13,type,
number_number_of_nat: int > nat ).
thf(func_def_14,type,
ord_less_int: int > int > $o ).
thf(func_def_15,type,
ord_less_nat: nat > nat > $o ).
thf(func_def_16,type,
ord_less_eq_int: int > int > $o ).
thf(func_def_17,type,
ord_less_eq_nat: nat > nat > $o ).
thf(func_def_18,type,
power_power_int: int > nat > int ).
thf(func_def_19,type,
power_power_nat: nat > nat > nat ).
thf(func_def_20,type,
twoSqu1013291560sum2sq: int > $o ).
thf(func_def_21,type,
m: int ).
thf(func_def_22,type,
s: int ).
thf(func_def_23,type,
t: int ).
thf(func_def_27,type,
sK0: int ).
thf(func_def_28,type,
sK1: int ).
thf(func_def_29,type,
sK2: int ).
thf(func_def_30,type,
sK3: int ).
thf(func_def_31,type,
sK4: int ).
thf(f640,plain,
$false,
inference(avatar_sat_refutation,[],[f598,f607,f635,f637,f639]) ).
thf(f639,plain,
~ spl5_4,
inference(avatar_contradiction_clause,[],[f638]) ).
thf(f638,plain,
( $false
| ~ spl5_4 ),
inference(subsumption_resolution,[],[f606,f399]) ).
thf(f399,plain,
! [X0: int,X1: int] :
( ( plus_plus_int @ ( power_power_int @ X0 @ ( number_number_of_nat @ ( bit0 @ ( bit1 @ pls ) ) ) ) @ ( power_power_int @ X1 @ ( number_number_of_nat @ ( bit0 @ ( bit1 @ pls ) ) ) ) )
!= ( plus_plus_int @ ( times_times_int @ ( number_number_of_int @ ( bit0 @ ( bit0 @ ( bit1 @ pls ) ) ) ) @ m ) @ one_one_int ) ),
inference(cnf_transformation,[],[f320]) ).
thf(f320,plain,
! [X0: int,X1: int] :
( ( plus_plus_int @ ( power_power_int @ X0 @ ( number_number_of_nat @ ( bit0 @ ( bit1 @ pls ) ) ) ) @ ( power_power_int @ X1 @ ( number_number_of_nat @ ( bit0 @ ( bit1 @ pls ) ) ) ) )
!= ( plus_plus_int @ ( times_times_int @ ( number_number_of_int @ ( bit0 @ ( bit0 @ ( bit1 @ pls ) ) ) ) @ m ) @ one_one_int ) ),
inference(rectify,[],[f297]) ).
thf(f297,plain,
! [X1: int,X0: int] :
( ( plus_plus_int @ ( times_times_int @ ( number_number_of_int @ ( bit0 @ ( bit0 @ ( bit1 @ pls ) ) ) ) @ m ) @ one_one_int )
!= ( plus_plus_int @ ( power_power_int @ X1 @ ( number_number_of_nat @ ( bit0 @ ( bit1 @ pls ) ) ) ) @ ( power_power_int @ X0 @ ( number_number_of_nat @ ( bit0 @ ( bit1 @ pls ) ) ) ) ) ),
inference(ennf_transformation,[],[f282]) ).
thf(f282,plain,
~ ? [X0: int,X1: int] :
( ( plus_plus_int @ ( times_times_int @ ( number_number_of_int @ ( bit0 @ ( bit0 @ ( bit1 @ pls ) ) ) ) @ m ) @ one_one_int )
= ( plus_plus_int @ ( power_power_int @ X1 @ ( number_number_of_nat @ ( bit0 @ ( bit1 @ pls ) ) ) ) @ ( power_power_int @ X0 @ ( number_number_of_nat @ ( bit0 @ ( bit1 @ pls ) ) ) ) ) ),
inference(rectify,[],[f125]) ).
thf(f125,negated_conjecture,
~ ? [X1: int,X0: int] :
( ( plus_plus_int @ ( power_power_int @ X0 @ ( number_number_of_nat @ ( bit0 @ ( bit1 @ pls ) ) ) ) @ ( power_power_int @ X1 @ ( number_number_of_nat @ ( bit0 @ ( bit1 @ pls ) ) ) ) )
= ( plus_plus_int @ ( times_times_int @ ( number_number_of_int @ ( bit0 @ ( bit0 @ ( bit1 @ pls ) ) ) ) @ m ) @ one_one_int ) ),
inference(negated_conjecture,[],[f124]) ).
thf(f124,conjecture,
? [X1: int,X0: int] :
( ( plus_plus_int @ ( power_power_int @ X0 @ ( number_number_of_nat @ ( bit0 @ ( bit1 @ pls ) ) ) ) @ ( power_power_int @ X1 @ ( number_number_of_nat @ ( bit0 @ ( bit1 @ pls ) ) ) ) )
= ( plus_plus_int @ ( times_times_int @ ( number_number_of_int @ ( bit0 @ ( bit0 @ ( bit1 @ pls ) ) ) ) @ m ) @ one_one_int ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',conj_0) ).
thf(f606,plain,
( ( ( plus_plus_int @ ( times_times_int @ ( number_number_of_int @ ( bit0 @ ( bit0 @ ( bit1 @ pls ) ) ) ) @ m ) @ one_one_int )
= ( plus_plus_int @ ( power_power_int @ sK4 @ ( number_number_of_nat @ ( bit0 @ ( bit1 @ pls ) ) ) ) @ ( power_power_int @ sK3 @ ( number_number_of_nat @ ( bit0 @ ( bit1 @ pls ) ) ) ) ) )
| ~ spl5_4 ),
inference(avatar_component_clause,[],[f604]) ).
thf(f604,plain,
( spl5_4
<=> ( ( plus_plus_int @ ( times_times_int @ ( number_number_of_int @ ( bit0 @ ( bit0 @ ( bit1 @ pls ) ) ) ) @ m ) @ one_one_int )
= ( plus_plus_int @ ( power_power_int @ sK4 @ ( number_number_of_nat @ ( bit0 @ ( bit1 @ pls ) ) ) ) @ ( power_power_int @ sK3 @ ( number_number_of_nat @ ( bit0 @ ( bit1 @ pls ) ) ) ) ) ) ),
introduced(avatar_definition,[new_symbols(naming,[spl5_4])]) ).
thf(f637,plain,
~ spl5_1,
inference(avatar_contradiction_clause,[],[f636]) ).
thf(f636,plain,
( $false
| ~ spl5_1 ),
inference(subsumption_resolution,[],[f593,f399]) ).
thf(f593,plain,
( ( ( plus_plus_int @ ( times_times_int @ ( number_number_of_int @ ( bit0 @ ( bit0 @ ( bit1 @ pls ) ) ) ) @ m ) @ one_one_int )
= ( plus_plus_int @ ( power_power_int @ sK0 @ ( number_number_of_nat @ ( bit0 @ ( bit1 @ pls ) ) ) ) @ ( power_power_int @ sK1 @ ( number_number_of_nat @ ( bit0 @ ( bit1 @ pls ) ) ) ) ) )
| ~ spl5_1 ),
inference(avatar_component_clause,[],[f591]) ).
thf(f591,plain,
( spl5_1
<=> ( ( plus_plus_int @ ( times_times_int @ ( number_number_of_int @ ( bit0 @ ( bit0 @ ( bit1 @ pls ) ) ) ) @ m ) @ one_one_int )
= ( plus_plus_int @ ( power_power_int @ sK0 @ ( number_number_of_nat @ ( bit0 @ ( bit1 @ pls ) ) ) ) @ ( power_power_int @ sK1 @ ( number_number_of_nat @ ( bit0 @ ( bit1 @ pls ) ) ) ) ) ) ),
introduced(avatar_definition,[new_symbols(naming,[spl5_1])]) ).
thf(f635,plain,
( spl5_2
| spl5_3 ),
inference(avatar_contradiction_clause,[],[f634]) ).
thf(f634,plain,
( $false
| spl5_2
| spl5_3 ),
inference(subsumption_resolution,[],[f633,f497]) ).
thf(f497,plain,
( ( ord_less_eq_int @ one_one_int @ t )
= $true ),
inference(cnf_transformation,[],[f174]) ).
thf(f174,plain,
( ( ord_less_eq_int @ one_one_int @ t )
= $true ),
inference(fool_elimination,[],[f173]) ).
thf(f173,plain,
ord_less_eq_int @ one_one_int @ t,
inference(rectify,[],[f1]) ).
thf(f1,axiom,
ord_less_eq_int @ one_one_int @ t,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_0_tpos) ).
thf(f633,plain,
( ( ( ord_less_eq_int @ one_one_int @ t )
!= $true )
| spl5_2
| spl5_3 ),
inference(subsumption_resolution,[],[f632,f602]) ).
thf(f602,plain,
( ( one_one_int != t )
| spl5_3 ),
inference(avatar_component_clause,[],[f600]) ).
thf(f600,plain,
( spl5_3
<=> ( one_one_int = t ) ),
introduced(avatar_definition,[new_symbols(naming,[spl5_3])]) ).
thf(f632,plain,
( ( one_one_int = t )
| ( ( ord_less_eq_int @ one_one_int @ t )
!= $true )
| spl5_2 ),
inference(trivial_inequality_removal,[],[f631]) ).
thf(f631,plain,
( ( $true != $true )
| ( one_one_int = t )
| ( ( ord_less_eq_int @ one_one_int @ t )
!= $true )
| spl5_2 ),
inference(superposition,[],[f597,f418]) ).
thf(f418,plain,
! [X0: int,X1: int] :
( ( $true
= ( ord_less_int @ X0 @ X1 ) )
| ( X0 = X1 )
| ( $true
!= ( ord_less_eq_int @ X0 @ X1 ) ) ),
inference(cnf_transformation,[],[f332]) ).
thf(f332,plain,
! [X0: int,X1: int] :
( ( ( $true
= ( ord_less_int @ X0 @ X1 ) )
| ( X0 = X1 )
| ( $true
!= ( ord_less_eq_int @ X0 @ X1 ) ) )
& ( ( ( X0 != X1 )
& ( $true
= ( ord_less_eq_int @ X0 @ X1 ) ) )
| ( $true
!= ( ord_less_int @ X0 @ X1 ) ) ) ),
inference(rectify,[],[f331]) ).
thf(f331,plain,
! [X1: int,X0: int] :
( ( ( $true
= ( ord_less_int @ X1 @ X0 ) )
| ( X0 = X1 )
| ( $true
!= ( ord_less_eq_int @ X1 @ X0 ) ) )
& ( ( ( X0 != X1 )
& ( $true
= ( ord_less_eq_int @ X1 @ X0 ) ) )
| ( $true
!= ( ord_less_int @ X1 @ X0 ) ) ) ),
inference(flattening,[],[f330]) ).
thf(f330,plain,
! [X1: int,X0: int] :
( ( ( $true
= ( ord_less_int @ X1 @ X0 ) )
| ( X0 = X1 )
| ( $true
!= ( ord_less_eq_int @ X1 @ X0 ) ) )
& ( ( ( X0 != X1 )
& ( $true
= ( ord_less_eq_int @ X1 @ X0 ) ) )
| ( $true
!= ( ord_less_int @ X1 @ X0 ) ) ) ),
inference(nnf_transformation,[],[f160]) ).
thf(f160,plain,
! [X1: int,X0: int] :
( ( $true
= ( ord_less_int @ X1 @ X0 ) )
<=> ( ( X0 != X1 )
& ( $true
= ( ord_less_eq_int @ X1 @ X0 ) ) ) ),
inference(fool_elimination,[],[f159]) ).
thf(f159,plain,
! [X0: int,X1: int] :
( ( ( X0 != X1 )
& ( ord_less_eq_int @ X1 @ X0 ) )
<=> ( ord_less_int @ X1 @ X0 ) ),
inference(rectify,[],[f29]) ).
thf(f29,axiom,
! [X14: int,X15: int] :
( ( ( X14 != X15 )
& ( ord_less_eq_int @ X15 @ X14 ) )
<=> ( ord_less_int @ X15 @ X14 ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_28_zless__le) ).
thf(f597,plain,
( ( ( ord_less_int @ one_one_int @ t )
!= $true )
| spl5_2 ),
inference(avatar_component_clause,[],[f595]) ).
thf(f595,plain,
( spl5_2
<=> ( ( ord_less_int @ one_one_int @ t )
= $true ) ),
introduced(avatar_definition,[new_symbols(naming,[spl5_2])]) ).
thf(f607,plain,
( ~ spl5_3
| spl5_4 ),
inference(avatar_split_clause,[],[f468,f604,f600]) ).
thf(f468,plain,
( ( one_one_int != t )
| ( ( plus_plus_int @ ( times_times_int @ ( number_number_of_int @ ( bit0 @ ( bit0 @ ( bit1 @ pls ) ) ) ) @ m ) @ one_one_int )
= ( plus_plus_int @ ( power_power_int @ sK4 @ ( number_number_of_nat @ ( bit0 @ ( bit1 @ pls ) ) ) ) @ ( power_power_int @ sK3 @ ( number_number_of_nat @ ( bit0 @ ( bit1 @ pls ) ) ) ) ) ) ),
inference(cnf_transformation,[],[f357]) ).
thf(f357,plain,
( ( ( plus_plus_int @ ( times_times_int @ ( number_number_of_int @ ( bit0 @ ( bit0 @ ( bit1 @ pls ) ) ) ) @ m ) @ one_one_int )
= ( plus_plus_int @ ( power_power_int @ sK4 @ ( number_number_of_nat @ ( bit0 @ ( bit1 @ pls ) ) ) ) @ ( power_power_int @ sK3 @ ( number_number_of_nat @ ( bit0 @ ( bit1 @ pls ) ) ) ) ) )
| ( one_one_int != t ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK3,sK4])],[f355,f356]) ).
thf(f356,plain,
( ? [X0: int,X1: int] :
( ( plus_plus_int @ ( times_times_int @ ( number_number_of_int @ ( bit0 @ ( bit0 @ ( bit1 @ pls ) ) ) ) @ m ) @ one_one_int )
= ( plus_plus_int @ ( power_power_int @ X1 @ ( number_number_of_nat @ ( bit0 @ ( bit1 @ pls ) ) ) ) @ ( power_power_int @ X0 @ ( number_number_of_nat @ ( bit0 @ ( bit1 @ pls ) ) ) ) ) )
=> ( ( plus_plus_int @ ( times_times_int @ ( number_number_of_int @ ( bit0 @ ( bit0 @ ( bit1 @ pls ) ) ) ) @ m ) @ one_one_int )
= ( plus_plus_int @ ( power_power_int @ sK4 @ ( number_number_of_nat @ ( bit0 @ ( bit1 @ pls ) ) ) ) @ ( power_power_int @ sK3 @ ( number_number_of_nat @ ( bit0 @ ( bit1 @ pls ) ) ) ) ) ) ),
introduced(choice_axiom,[]) ).
thf(f355,plain,
( ? [X0: int,X1: int] :
( ( plus_plus_int @ ( times_times_int @ ( number_number_of_int @ ( bit0 @ ( bit0 @ ( bit1 @ pls ) ) ) ) @ m ) @ one_one_int )
= ( plus_plus_int @ ( power_power_int @ X1 @ ( number_number_of_nat @ ( bit0 @ ( bit1 @ pls ) ) ) ) @ ( power_power_int @ X0 @ ( number_number_of_nat @ ( bit0 @ ( bit1 @ pls ) ) ) ) ) )
| ( one_one_int != t ) ),
inference(rectify,[],[f308]) ).
thf(f308,plain,
( ? [X1: int,X0: int] :
( ( plus_plus_int @ ( power_power_int @ X0 @ ( number_number_of_nat @ ( bit0 @ ( bit1 @ pls ) ) ) ) @ ( power_power_int @ X1 @ ( number_number_of_nat @ ( bit0 @ ( bit1 @ pls ) ) ) ) )
= ( plus_plus_int @ ( times_times_int @ ( number_number_of_int @ ( bit0 @ ( bit0 @ ( bit1 @ pls ) ) ) ) @ m ) @ one_one_int ) )
| ( one_one_int != t ) ),
inference(ennf_transformation,[],[f2]) ).
thf(f2,axiom,
( ( one_one_int = t )
=> ? [X1: int,X0: int] :
( ( plus_plus_int @ ( power_power_int @ X0 @ ( number_number_of_nat @ ( bit0 @ ( bit1 @ pls ) ) ) ) @ ( power_power_int @ X1 @ ( number_number_of_nat @ ( bit0 @ ( bit1 @ pls ) ) ) ) )
= ( plus_plus_int @ ( times_times_int @ ( number_number_of_int @ ( bit0 @ ( bit0 @ ( bit1 @ pls ) ) ) ) @ m ) @ one_one_int ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_1__096t_A_061_A1_A_061_061_062_AEX_Ax_Ay_O_Ax_A_094_A2_A_L_Ay_A_094_A2_A_06) ).
thf(f598,plain,
( spl5_1
| ~ spl5_2 ),
inference(avatar_split_clause,[],[f394,f595,f591]) ).
thf(f394,plain,
( ( ( ord_less_int @ one_one_int @ t )
!= $true )
| ( ( plus_plus_int @ ( times_times_int @ ( number_number_of_int @ ( bit0 @ ( bit0 @ ( bit1 @ pls ) ) ) ) @ m ) @ one_one_int )
= ( plus_plus_int @ ( power_power_int @ sK0 @ ( number_number_of_nat @ ( bit0 @ ( bit1 @ pls ) ) ) ) @ ( power_power_int @ sK1 @ ( number_number_of_nat @ ( bit0 @ ( bit1 @ pls ) ) ) ) ) ) ),
inference(cnf_transformation,[],[f318]) ).
thf(f318,plain,
( ( ( ord_less_int @ one_one_int @ t )
!= $true )
| ( ( plus_plus_int @ ( times_times_int @ ( number_number_of_int @ ( bit0 @ ( bit0 @ ( bit1 @ pls ) ) ) ) @ m ) @ one_one_int )
= ( plus_plus_int @ ( power_power_int @ sK0 @ ( number_number_of_nat @ ( bit0 @ ( bit1 @ pls ) ) ) ) @ ( power_power_int @ sK1 @ ( number_number_of_nat @ ( bit0 @ ( bit1 @ pls ) ) ) ) ) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1])],[f316,f317]) ).
thf(f317,plain,
( ? [X0: int,X1: int] :
( ( plus_plus_int @ ( power_power_int @ X0 @ ( number_number_of_nat @ ( bit0 @ ( bit1 @ pls ) ) ) ) @ ( power_power_int @ X1 @ ( number_number_of_nat @ ( bit0 @ ( bit1 @ pls ) ) ) ) )
= ( plus_plus_int @ ( times_times_int @ ( number_number_of_int @ ( bit0 @ ( bit0 @ ( bit1 @ pls ) ) ) ) @ m ) @ one_one_int ) )
=> ( ( plus_plus_int @ ( times_times_int @ ( number_number_of_int @ ( bit0 @ ( bit0 @ ( bit1 @ pls ) ) ) ) @ m ) @ one_one_int )
= ( plus_plus_int @ ( power_power_int @ sK0 @ ( number_number_of_nat @ ( bit0 @ ( bit1 @ pls ) ) ) ) @ ( power_power_int @ sK1 @ ( number_number_of_nat @ ( bit0 @ ( bit1 @ pls ) ) ) ) ) ) ),
introduced(choice_axiom,[]) ).
thf(f316,plain,
( ( ( ord_less_int @ one_one_int @ t )
!= $true )
| ? [X0: int,X1: int] :
( ( plus_plus_int @ ( power_power_int @ X0 @ ( number_number_of_nat @ ( bit0 @ ( bit1 @ pls ) ) ) ) @ ( power_power_int @ X1 @ ( number_number_of_nat @ ( bit0 @ ( bit1 @ pls ) ) ) ) )
= ( plus_plus_int @ ( times_times_int @ ( number_number_of_int @ ( bit0 @ ( bit0 @ ( bit1 @ pls ) ) ) ) @ m ) @ one_one_int ) ) ),
inference(rectify,[],[f300]) ).
thf(f300,plain,
( ( ( ord_less_int @ one_one_int @ t )
!= $true )
| ? [X1: int,X0: int] :
( ( plus_plus_int @ ( times_times_int @ ( number_number_of_int @ ( bit0 @ ( bit0 @ ( bit1 @ pls ) ) ) ) @ m ) @ one_one_int )
= ( plus_plus_int @ ( power_power_int @ X1 @ ( number_number_of_nat @ ( bit0 @ ( bit1 @ pls ) ) ) ) @ ( power_power_int @ X0 @ ( number_number_of_nat @ ( bit0 @ ( bit1 @ pls ) ) ) ) ) ) ),
inference(ennf_transformation,[],[f154]) ).
thf(f154,plain,
( ( ( ord_less_int @ one_one_int @ t )
= $true )
=> ? [X1: int,X0: int] :
( ( plus_plus_int @ ( times_times_int @ ( number_number_of_int @ ( bit0 @ ( bit0 @ ( bit1 @ pls ) ) ) ) @ m ) @ one_one_int )
= ( plus_plus_int @ ( power_power_int @ X1 @ ( number_number_of_nat @ ( bit0 @ ( bit1 @ pls ) ) ) ) @ ( power_power_int @ X0 @ ( number_number_of_nat @ ( bit0 @ ( bit1 @ pls ) ) ) ) ) ) ),
inference(fool_elimination,[],[f153]) ).
thf(f153,plain,
( ( ord_less_int @ one_one_int @ t )
=> ? [X0: int,X1: int] :
( ( plus_plus_int @ ( times_times_int @ ( number_number_of_int @ ( bit0 @ ( bit0 @ ( bit1 @ pls ) ) ) ) @ m ) @ one_one_int )
= ( plus_plus_int @ ( power_power_int @ X1 @ ( number_number_of_nat @ ( bit0 @ ( bit1 @ pls ) ) ) ) @ ( power_power_int @ X0 @ ( number_number_of_nat @ ( bit0 @ ( bit1 @ pls ) ) ) ) ) ) ),
inference(rectify,[],[f3]) ).
thf(f3,axiom,
( ( ord_less_int @ one_one_int @ t )
=> ? [X1: int,X0: int] :
( ( plus_plus_int @ ( power_power_int @ X0 @ ( number_number_of_nat @ ( bit0 @ ( bit1 @ pls ) ) ) ) @ ( power_power_int @ X1 @ ( number_number_of_nat @ ( bit0 @ ( bit1 @ pls ) ) ) ) )
= ( plus_plus_int @ ( times_times_int @ ( number_number_of_int @ ( bit0 @ ( bit0 @ ( bit1 @ pls ) ) ) ) @ m ) @ one_one_int ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_2__0961_A_060_At_A_061_061_062_AEX_Ax_Ay_O_Ax_A_094_A2_A_L_Ay_A_094_A2_A_06) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12 % Problem : NUM926^1 : TPTP v8.2.0. Released v5.3.0.
% 0.10/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.13/0.34 % Computer : n012.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 : Mon May 20 07:11:37 EDT 2024
% 0.13/0.35 % 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.37 % (14188)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.13/0.37 % (14194)lrs+1004_1:128_cond=on:e2e=on:sp=weighted_frequency:i=18:si=on:rtra=on_0 on theBenchmark for (2999ds/18Mi)
% 0.13/0.38 % (14195)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.13/0.38 % (14195)Instruction limit reached!
% 0.13/0.38 % (14195)------------------------------
% 0.13/0.38 % (14195)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.13/0.38 % (14195)Termination reason: Unknown
% 0.13/0.38 % (14195)Termination phase: shuffling
% 0.13/0.38
% 0.13/0.38 % (14195)Memory used [KB]: 1151
% 0.13/0.38 % (14195)Time elapsed: 0.004 s
% 0.13/0.38 % (14195)Instructions burned: 3 (million)
% 0.13/0.38 % (14195)------------------------------
% 0.13/0.38 % (14195)------------------------------
% 0.13/0.38 % (14190)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.13/0.38 % (14194)Instruction limit reached!
% 0.13/0.38 % (14194)------------------------------
% 0.13/0.38 % (14194)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.13/0.38 % (14194)Termination reason: Unknown
% 0.13/0.38 % (14194)Termination phase: Function definition elimination
% 0.13/0.38
% 0.13/0.38 % (14194)Memory used [KB]: 1407
% 0.13/0.38 % (14194)Time elapsed: 0.012 s
% 0.13/0.38 % (14194)Instructions burned: 19 (million)
% 0.13/0.38 % (14194)------------------------------
% 0.13/0.38 % (14194)------------------------------
% 0.13/0.39 % (14193)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.13/0.39 % (14189)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.13/0.39 % (14191)lrs+10_1:1_au=on:inj=on:i=2:si=on:rtra=on_0 on theBenchmark for (2999ds/2Mi)
% 0.13/0.39 % (14191)Instruction limit reached!
% 0.13/0.39 % (14191)------------------------------
% 0.13/0.39 % (14191)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.13/0.39 % (14191)Termination reason: Unknown
% 0.13/0.39 % (14191)Termination phase: shuffling
% 0.13/0.39
% 0.13/0.39 % (14191)Memory used [KB]: 1151
% 0.13/0.39 % (14191)Time elapsed: 0.003 s
% 0.13/0.39 % (14191)Instructions burned: 2 (million)
% 0.13/0.39 % (14191)------------------------------
% 0.13/0.39 % (14191)------------------------------
% 0.13/0.39 % (14189)Instruction limit reached!
% 0.13/0.39 % (14189)------------------------------
% 0.13/0.39 % (14189)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.13/0.39 % (14189)Termination reason: Unknown
% 0.13/0.39 % (14189)Termination phase: shuffling
% 0.13/0.39
% 0.13/0.39 % (14189)Memory used [KB]: 1151
% 0.13/0.39 % (14189)Time elapsed: 0.004 s
% 0.13/0.39 % (14189)Instructions burned: 4 (million)
% 0.13/0.39 % (14189)------------------------------
% 0.13/0.39 % (14189)------------------------------
% 0.13/0.39 % (14192)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.13/0.39 % (14192)Instruction limit reached!
% 0.13/0.39 % (14192)------------------------------
% 0.13/0.39 % (14192)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.13/0.39 % (14192)Termination reason: Unknown
% 0.13/0.39 % (14192)Termination phase: shuffling
% 0.13/0.39
% 0.13/0.39 % (14192)Memory used [KB]: 1151
% 0.13/0.39 % (14192)Time elapsed: 0.004 s
% 0.13/0.39 % (14192)Instructions burned: 3 (million)
% 0.13/0.39 % (14192)------------------------------
% 0.13/0.39 % (14192)------------------------------
% 0.13/0.39 % (14190)Instruction limit reached!
% 0.13/0.39 % (14190)------------------------------
% 0.13/0.39 % (14190)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.13/0.39 % (14190)Termination reason: Unknown
% 0.13/0.39 % (14190)Termination phase: Saturation
% 0.13/0.39
% 0.13/0.39 % (14190)Memory used [KB]: 5884
% 0.13/0.39 % (14190)Time elapsed: 0.015 s
% 0.13/0.39 % (14190)Instructions burned: 28 (million)
% 0.13/0.39 % (14190)------------------------------
% 0.13/0.39 % (14190)------------------------------
% 0.13/0.40 % (14197)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.40 % (14198)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.40 % (14199)lrs+1002_1:1_aac=none:au=on:cnfonf=lazy_gen:plsq=on:plsqc=1:plsqr=4203469,65536:i=1041:si=on:rtra=on_0 on theBenchmark for (2999ds/1041Mi)
% 0.13/0.40 % (14198)Instruction limit reached!
% 0.13/0.40 % (14198)------------------------------
% 0.13/0.40 % (14198)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.13/0.40 % (14198)Termination reason: Unknown
% 0.13/0.40 % (14198)Termination phase: shuffling
% 0.13/0.40
% 0.13/0.40 % (14198)Memory used [KB]: 1151
% 0.13/0.40 % (14198)Time elapsed: 0.003 s
% 0.13/0.40 % (14198)Instructions burned: 3 (million)
% 0.13/0.40 % (14198)------------------------------
% 0.13/0.40 % (14198)------------------------------
% 0.13/0.40 % (14196)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.20/0.40 % (14200)lrs+10_1:1_av=off:chr=on:plsq=on:slsq=on:i=7:si=on:rtra=on_0 on theBenchmark for (2999ds/7Mi)
% 0.20/0.41 % (14197)Instruction limit reached!
% 0.20/0.41 % (14197)------------------------------
% 0.20/0.41 % (14197)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.20/0.41 % (14188)First to succeed.
% 0.20/0.41 % (14197)Termination reason: Unknown
% 0.20/0.41 % (14197)Termination phase: Property scanning
% 0.20/0.41
% 0.20/0.41 % (14197)Memory used [KB]: 1407
% 0.20/0.41 % (14197)Time elapsed: 0.010 s
% 0.20/0.41 % (14197)Instructions burned: 15 (million)
% 0.20/0.41 % (14197)------------------------------
% 0.20/0.41 % (14197)------------------------------
% 0.20/0.41 % (14200)Instruction limit reached!
% 0.20/0.41 % (14200)------------------------------
% 0.20/0.41 % (14200)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.20/0.41 % (14200)Termination reason: Unknown
% 0.20/0.41 % (14200)Termination phase: Property scanning
% 0.20/0.41
% 0.20/0.41 % (14200)Memory used [KB]: 1151
% 0.20/0.41 % (14200)Time elapsed: 0.006 s
% 0.20/0.41 % (14200)Instructions burned: 8 (million)
% 0.20/0.41 % (14200)------------------------------
% 0.20/0.41 % (14200)------------------------------
% 0.20/0.41 % (14188)Refutation found. Thanks to Tanya!
% 0.20/0.41 % SZS status Theorem for theBenchmark
% 0.20/0.41 % SZS output start Proof for theBenchmark
% See solution above
% 0.20/0.41 % (14188)------------------------------
% 0.20/0.41 % (14188)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.20/0.41 % (14188)Termination reason: Refutation
% 0.20/0.41
% 0.20/0.41 % (14188)Memory used [KB]: 6140
% 0.20/0.41 % (14188)Time elapsed: 0.037 s
% 0.20/0.41 % (14188)Instructions burned: 57 (million)
% 0.20/0.41 % (14188)------------------------------
% 0.20/0.41 % (14188)------------------------------
% 0.20/0.41 % (14187)Success in time 0.053 s
% 0.20/0.41 % Vampire---4.8 exiting
%------------------------------------------------------------------------------