TSTP Solution File: SEV504^1 by Vampire---4.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.9
% Problem : SEV504^1 : TPTP v8.2.0. Released v7.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire %s %d THM
% Computer : n019.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 Jun 24 16:04:10 EDT 2024
% Result : Theorem 0.23s 0.52s
% Output : Refutation 0.23s
% Verified :
% SZS Type : Refutation
% Derivation depth : 31
% Number of leaves : 9
% Syntax : Number of formulae : 88 ( 13 unt; 0 typ; 0 def)
% Number of atoms : 727 ( 177 equ; 0 cnn)
% Maximal formula atoms : 6 ( 8 avg)
% Number of connectives : 1147 ( 73 ~; 104 |; 33 &; 906 @)
% ( 2 <=>; 25 =>; 0 <=; 0 <~>)
% Maximal formula depth : 14 ( 6 avg)
% Number of types : 3 ( 2 usr)
% Number of type conns : 137 ( 137 >; 0 *; 0 +; 0 <<)
% Number of symbols : 20 ( 16 usr; 6 con; 0-4 aty)
% ( 4 !!; 0 ??; 0 @@+; 0 @@-)
% Number of variables : 211 ( 6 ^ 190 !; 15 ?; 211 :)
% Comments :
%------------------------------------------------------------------------------
thf(type_def_6,type,
'type/nums/num': $tType ).
thf(type_def_7,type,
sK1: $tType ).
thf(func_def_0,type,
'type/nums/num': $tType ).
thf(func_def_1,type,
'const/sets/SUBSET':
!>[X0: $tType] : ( ( X0 > $o ) > ( X0 > $o ) > $o ) ).
thf(func_def_2,type,
'const/sets/IN':
!>[X0: $tType] : ( X0 > ( X0 > $o ) > $o ) ).
thf(func_def_3,type,
'const/sets/FINITE':
!>[X0: $tType] : ( ( X0 > $o ) > $o ) ).
thf(func_def_4,type,
'const/sets/DIFF':
!>[X0: $tType] : ( ( X0 > $o ) > ( X0 > $o ) > X0 > $o ) ).
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/nsum':
!>[X0: $tType] : ( ( X0 > $o ) > ( X0 > 'type/nums/num' ) > 'type/nums/num' ) ).
thf(func_def_8,type,
'const/arith/<=': 'type/nums/num' > 'type/nums/num' > $o ).
thf(func_def_18,type,
sK0:
!>[X0: $tType] : ( ( X0 > 'type/nums/num' ) > ( X0 > $o ) > ( X0 > $o ) > X0 ) ).
thf(func_def_19,type,
sK2: sK1 > $o ).
thf(func_def_20,type,
sK3: sK1 > $o ).
thf(func_def_21,type,
sK4: sK1 > 'type/nums/num' ).
thf(func_def_23,type,
sK6:
!>[X0: $tType] : ( ( X0 > $o ) > ( X0 > $o ) > X0 ) ).
thf(func_def_24,type,
ph7:
!>[X0: $tType] : X0 ).
thf(f416,plain,
$false,
inference(avatar_sat_refutation,[],[f66,f75,f415]) ).
thf(f415,plain,
( ~ spl5_1
| ~ spl5_2 ),
inference(avatar_contradiction_clause,[],[f414]) ).
thf(f414,plain,
( $false
| ~ spl5_1
| ~ spl5_2 ),
inference(trivial_inequality_removal,[],[f410]) ).
thf(f410,plain,
( ( $false = $true )
| ~ spl5_1
| ~ spl5_2 ),
inference(superposition,[],[f408,f87]) ).
thf(f87,plain,
( $false
= ( 'const/arith/<=' @ ( 'const/iterate/nsum' @ sK1 @ sK2 @ sK4 ) @ ( 'const/iterate/nsum' @ sK1 @ sK3 @ sK4 ) ) ),
inference(trivial_inequality_removal,[],[f86]) ).
thf(f86,plain,
( ( $false
= ( 'const/arith/<=' @ ( 'const/iterate/nsum' @ sK1 @ sK2 @ sK4 ) @ ( 'const/iterate/nsum' @ sK1 @ sK3 @ sK4 ) ) )
| ( $true != $true ) ),
inference(fool_paramodulation,[],[f34]) ).
thf(f34,plain,
( $true
!= ( 'const/arith/<=' @ ( 'const/iterate/nsum' @ sK1 @ sK2 @ sK4 ) @ ( 'const/iterate/nsum' @ sK1 @ sK3 @ sK4 ) ) ),
inference(cnf_transformation,[],[f27]) ).
thf(f27,plain,
( ( $true
= ( 'const/sets/SUBSET' @ sK1 @ sK2 @ sK3 ) )
& ( $true
!= ( 'const/arith/<=' @ ( 'const/iterate/nsum' @ sK1 @ sK2 @ sK4 ) @ ( 'const/iterate/nsum' @ sK1 @ sK3 @ sK4 ) ) )
& ( ( 'const/sets/FINITE' @ sK1 @ sK3 )
= $true ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK1,sK2,sK3,sK4])],[f19,f26]) ).
thf(f26,plain,
( ? [X0: $tType,X1: X0 > $o,X2: X0 > $o,X3: X0 > 'type/nums/num'] :
( ( ( 'const/sets/SUBSET' @ X0 @ X1 @ X2 )
= $true )
& ( ( 'const/arith/<=' @ ( 'const/iterate/nsum' @ X0 @ X1 @ X3 ) @ ( 'const/iterate/nsum' @ X0 @ X2 @ X3 ) )
!= $true )
& ( ( 'const/sets/FINITE' @ X0 @ X2 )
= $true ) )
=> ( ( $true
= ( 'const/sets/SUBSET' @ sK1 @ sK2 @ sK3 ) )
& ( $true
!= ( 'const/arith/<=' @ ( 'const/iterate/nsum' @ sK1 @ sK2 @ sK4 ) @ ( 'const/iterate/nsum' @ sK1 @ sK3 @ sK4 ) ) )
& ( ( 'const/sets/FINITE' @ sK1 @ sK3 )
= $true ) ) ),
introduced(choice_axiom,[]) ).
thf(f19,plain,
? [X0: $tType,X1: X0 > $o,X2: X0 > $o,X3: X0 > 'type/nums/num'] :
( ( ( 'const/sets/SUBSET' @ X0 @ X1 @ X2 )
= $true )
& ( ( 'const/arith/<=' @ ( 'const/iterate/nsum' @ X0 @ X1 @ X3 ) @ ( 'const/iterate/nsum' @ X0 @ X2 @ X3 ) )
!= $true )
& ( ( 'const/sets/FINITE' @ X0 @ X2 )
= $true ) ),
inference(flattening,[],[f18]) ).
thf(f18,plain,
? [X0: $tType,X1: X0 > $o,X2: X0 > $o,X3: X0 > 'type/nums/num'] :
( ( ( 'const/arith/<=' @ ( 'const/iterate/nsum' @ X0 @ X1 @ X3 ) @ ( 'const/iterate/nsum' @ X0 @ X2 @ X3 ) )
!= $true )
& ( ( 'const/sets/SUBSET' @ X0 @ X1 @ X2 )
= $true )
& ( ( 'const/sets/FINITE' @ X0 @ X2 )
= $true ) ),
inference(ennf_transformation,[],[f13]) ).
thf(f13,plain,
~ ! [X0: $tType,X1: X0 > $o,X2: X0 > $o,X3: X0 > 'type/nums/num'] :
( ( ( ( 'const/sets/SUBSET' @ X0 @ X1 @ X2 )
= $true )
& ( ( 'const/sets/FINITE' @ X0 @ X2 )
= $true ) )
=> ( ( 'const/arith/<=' @ ( 'const/iterate/nsum' @ X0 @ X1 @ X3 ) @ ( 'const/iterate/nsum' @ X0 @ X2 @ X3 ) )
= $true ) ),
inference(fool_elimination,[],[f12]) ).
thf(f12,plain,
~ ! [X0: $tType,X1: X0 > $o,X2: X0 > $o,X3: X0 > 'type/nums/num'] :
( ( ( 'const/sets/FINITE' @ X0 @ X2 )
& ( 'const/sets/SUBSET' @ X0 @ X1 @ X2 ) )
=> ( 'const/arith/<=' @ ( 'const/iterate/nsum' @ X0 @ X1 @ X3 ) @ ( 'const/iterate/nsum' @ X0 @ X2 @ X3 ) ) ),
inference(rectify,[],[f6]) ).
thf(f6,negated_conjecture,
~ ! [X0: $tType,X1: X0 > $o,X2: X0 > $o,X3: X0 > 'type/nums/num'] :
( ( ( 'const/sets/FINITE' @ X0 @ X2 )
& ( 'const/sets/SUBSET' @ X0 @ X1 @ X2 ) )
=> ( 'const/arith/<=' @ ( 'const/iterate/nsum' @ X0 @ X1 @ X3 ) @ ( 'const/iterate/nsum' @ X0 @ X2 @ X3 ) ) ),
inference(negated_conjecture,[],[f5]) ).
thf(f5,conjecture,
! [X0: $tType,X1: X0 > $o,X2: X0 > $o,X3: X0 > 'type/nums/num'] :
( ( ( 'const/sets/FINITE' @ X0 @ X2 )
& ( 'const/sets/SUBSET' @ X0 @ X1 @ X2 ) )
=> ( 'const/arith/<=' @ ( 'const/iterate/nsum' @ X0 @ X1 @ X3 ) @ ( 'const/iterate/nsum' @ X0 @ X2 @ X3 ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p','thm/iterate/NSUM_SUBSET_SIMPLE_') ).
thf(f408,plain,
( ! [X0: sK1 > 'type/nums/num'] :
( ( 'const/arith/<=' @ ( 'const/iterate/nsum' @ sK1 @ sK2 @ X0 ) @ ( 'const/iterate/nsum' @ sK1 @ sK3 @ X0 ) )
= $true )
| ~ spl5_1
| ~ spl5_2 ),
inference(trivial_inequality_removal,[],[f407]) ).
thf(f407,plain,
( ! [X0: sK1 > 'type/nums/num'] :
( ( ( 'const/arith/<=' @ ( 'const/iterate/nsum' @ sK1 @ sK2 @ X0 ) @ ( 'const/iterate/nsum' @ sK1 @ sK3 @ X0 ) )
= $true )
| ( $false = $true ) )
| ~ spl5_1
| ~ spl5_2 ),
inference(duplicate_literal_removal,[],[f393]) ).
thf(f393,plain,
( ! [X0: sK1 > 'type/nums/num'] :
( ( $false = $true )
| ( ( 'const/arith/<=' @ ( 'const/iterate/nsum' @ sK1 @ sK2 @ X0 ) @ ( 'const/iterate/nsum' @ sK1 @ sK3 @ X0 ) )
= $true )
| ( ( 'const/arith/<=' @ ( 'const/iterate/nsum' @ sK1 @ sK2 @ X0 ) @ ( 'const/iterate/nsum' @ sK1 @ sK3 @ X0 ) )
= $true ) )
| ~ spl5_1
| ~ spl5_2 ),
inference(superposition,[],[f360,f381]) ).
thf(f381,plain,
( ! [X2: sK1 > $o,X0: sK1 > 'type/nums/num'] :
( ( $false
= ( 'const/sets/IN' @ sK1 @ ( sK0 @ sK1 @ X0 @ sK3 @ sK2 ) @ X2 ) )
| ( ( 'const/arith/<=' @ ( 'const/iterate/nsum' @ sK1 @ sK2 @ X0 ) @ ( 'const/iterate/nsum' @ sK1 @ sK3 @ X0 ) )
= $true ) )
| ~ spl5_1
| ~ spl5_2 ),
inference(trivial_inequality_removal,[],[f368]) ).
thf(f368,plain,
( ! [X2: sK1 > $o,X0: sK1 > 'type/nums/num'] :
( ( $false = $true )
| ( $false
= ( 'const/sets/IN' @ sK1 @ ( sK0 @ sK1 @ X0 @ sK3 @ sK2 ) @ X2 ) )
| ( ( 'const/arith/<=' @ ( 'const/iterate/nsum' @ sK1 @ sK2 @ X0 ) @ ( 'const/iterate/nsum' @ sK1 @ sK3 @ X0 ) )
= $true ) )
| ~ spl5_1
| ~ spl5_2 ),
inference(superposition,[],[f360,f40]) ).
thf(f40,plain,
! [X0: $tType,X2: X0 > $o,X3: X0,X1: X0 > $o] :
( ( ( 'const/sets/IN' @ X0 @ X3 @ ( 'const/sets/DIFF' @ X0 @ X1 @ X2 ) )
= $false )
| ( ( 'const/sets/IN' @ X0 @ X3 @ X2 )
= $false ) ),
inference(not_proxy_clausification,[],[f39]) ).
thf(f39,plain,
! [X0: $tType,X2: X0 > $o,X3: X0,X1: X0 > $o] :
( ( $true
= ( ~ ( 'const/sets/IN' @ X0 @ X3 @ X2 ) ) )
| ( ( 'const/sets/IN' @ X0 @ X3 @ ( 'const/sets/DIFF' @ X0 @ X1 @ X2 ) )
= $false ) ),
inference(binary_proxy_clausification,[],[f37]) ).
thf(f37,plain,
! [X0: $tType,X2: X0 > $o,X3: X0,X1: X0 > $o] :
( ( $true
= ( ~ ( 'const/sets/IN' @ X0 @ X3 @ X2 )
& ( 'const/sets/IN' @ X0 @ X3 @ X1 ) ) )
| ( ( 'const/sets/IN' @ X0 @ X3 @ ( 'const/sets/DIFF' @ X0 @ X1 @ X2 ) )
= $false ) ),
inference(binary_proxy_clausification,[],[f29]) ).
thf(f29,plain,
! [X0: $tType,X2: X0 > $o,X3: X0,X1: X0 > $o] :
( ( 'const/sets/IN' @ X0 @ X3 @ ( 'const/sets/DIFF' @ X0 @ X1 @ X2 ) )
= ( ~ ( 'const/sets/IN' @ X0 @ X3 @ X2 )
& ( 'const/sets/IN' @ X0 @ X3 @ X1 ) ) ),
inference(cnf_transformation,[],[f15]) ).
thf(f15,plain,
! [X0: $tType,X1: X0 > $o,X2: X0 > $o,X3: X0] :
( ( 'const/sets/IN' @ X0 @ X3 @ ( 'const/sets/DIFF' @ X0 @ X1 @ X2 ) )
= ( ~ ( 'const/sets/IN' @ X0 @ X3 @ X2 )
& ( 'const/sets/IN' @ X0 @ X3 @ X1 ) ) ),
inference(fool_elimination,[],[f14]) ).
thf(f14,plain,
! [X0: $tType,X1: X0 > $o,X2: X0 > $o,X3: X0] :
( ( 'const/sets/IN' @ X0 @ X3 @ X1 )
& ( ( ~ ( 'const/sets/IN' @ X0 @ X3 @ X2 ) )
= ( 'const/sets/IN' @ X0 @ X3 @ ( 'const/sets/DIFF' @ X0 @ X1 @ X2 ) ) ) ),
inference(rectify,[],[f4]) ).
thf(f4,axiom,
! [X0: $tType,X1: X0 > $o,X2: X0 > $o,X3: X0] :
( ( 'const/sets/IN' @ X0 @ X3 @ X1 )
& ( ( ~ ( 'const/sets/IN' @ X0 @ X3 @ X2 ) )
= ( 'const/sets/IN' @ X0 @ X3 @ ( 'const/sets/DIFF' @ X0 @ X1 @ X2 ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p','thm/sets/IN_DIFF_') ).
thf(f360,plain,
( ! [X0: sK1 > 'type/nums/num',X1: sK1 > $o] :
( ( ( 'const/sets/IN' @ sK1 @ ( sK0 @ sK1 @ X0 @ sK3 @ sK2 ) @ X1 )
= $true )
| ( ( 'const/arith/<=' @ ( 'const/iterate/nsum' @ sK1 @ sK2 @ X0 ) @ ( 'const/iterate/nsum' @ sK1 @ sK3 @ X0 ) )
= $true ) )
| ~ spl5_1
| ~ spl5_2 ),
inference(trivial_inequality_removal,[],[f359]) ).
thf(f359,plain,
( ! [X0: sK1 > 'type/nums/num',X1: sK1 > $o] :
( ( ( 'const/sets/IN' @ sK1 @ ( sK0 @ sK1 @ X0 @ sK3 @ sK2 ) @ X1 )
= $true )
| ( $true != $true )
| ( ( 'const/arith/<=' @ ( 'const/iterate/nsum' @ sK1 @ sK2 @ X0 ) @ ( 'const/iterate/nsum' @ sK1 @ sK3 @ X0 ) )
= $true ) )
| ~ spl5_1
| ~ spl5_2 ),
inference(forward_demodulation,[],[f358,f61]) ).
thf(f61,plain,
( ( $true
= ( 'const/sets/FINITE' @ sK1 @ sK2 ) )
| ~ spl5_1 ),
inference(avatar_component_clause,[],[f59]) ).
thf(f59,plain,
( spl5_1
<=> ( $true
= ( 'const/sets/FINITE' @ sK1 @ sK2 ) ) ),
introduced(avatar_definition,[new_symbols(naming,[spl5_1])]) ).
thf(f358,plain,
( ! [X0: sK1 > 'type/nums/num',X1: sK1 > $o] :
( ( ( 'const/sets/IN' @ sK1 @ ( sK0 @ sK1 @ X0 @ sK3 @ sK2 ) @ X1 )
= $true )
| ( $true
!= ( 'const/sets/FINITE' @ sK1 @ sK2 ) )
| ( ( 'const/arith/<=' @ ( 'const/iterate/nsum' @ sK1 @ sK2 @ X0 ) @ ( 'const/iterate/nsum' @ sK1 @ sK3 @ X0 ) )
= $true ) )
| ~ spl5_2 ),
inference(trivial_inequality_removal,[],[f357]) ).
thf(f357,plain,
( ! [X0: sK1 > 'type/nums/num',X1: sK1 > $o] :
( ( $true != $true )
| ( $true
!= ( 'const/sets/FINITE' @ sK1 @ sK2 ) )
| ( ( 'const/arith/<=' @ ( 'const/iterate/nsum' @ sK1 @ sK2 @ X0 ) @ ( 'const/iterate/nsum' @ sK1 @ sK3 @ X0 ) )
= $true )
| ( ( 'const/sets/IN' @ sK1 @ ( sK0 @ sK1 @ X0 @ sK3 @ sK2 ) @ X1 )
= $true ) )
| ~ spl5_2 ),
inference(forward_demodulation,[],[f350,f64]) ).
thf(f64,plain,
( ( ( 'const/sets/FINITE' @ sK1 @ sK3 )
= $true )
| ~ spl5_2 ),
inference(avatar_component_clause,[],[f63]) ).
thf(f63,plain,
( spl5_2
<=> ( ( 'const/sets/FINITE' @ sK1 @ sK3 )
= $true ) ),
introduced(avatar_definition,[new_symbols(naming,[spl5_2])]) ).
thf(f350,plain,
! [X0: sK1 > 'type/nums/num',X1: sK1 > $o] :
( ( ( 'const/sets/FINITE' @ sK1 @ sK3 )
!= $true )
| ( ( 'const/sets/IN' @ sK1 @ ( sK0 @ sK1 @ X0 @ sK3 @ sK2 ) @ X1 )
= $true )
| ( $true
!= ( 'const/sets/FINITE' @ sK1 @ sK2 ) )
| ( ( 'const/arith/<=' @ ( 'const/iterate/nsum' @ sK1 @ sK2 @ X0 ) @ ( 'const/iterate/nsum' @ sK1 @ sK3 @ X0 ) )
= $true ) ),
inference(trivial_inequality_removal,[],[f332]) ).
thf(f332,plain,
! [X0: sK1 > 'type/nums/num',X1: sK1 > $o] :
( ( $true
!= ( 'const/sets/FINITE' @ sK1 @ sK2 ) )
| ( ( 'const/sets/FINITE' @ sK1 @ sK3 )
!= $true )
| ( ( 'const/sets/IN' @ sK1 @ ( sK0 @ sK1 @ X0 @ sK3 @ sK2 ) @ X1 )
= $true )
| ( ( 'const/arith/<=' @ ( 'const/iterate/nsum' @ sK1 @ sK2 @ X0 ) @ ( 'const/iterate/nsum' @ sK1 @ sK3 @ X0 ) )
= $true )
| ( $false = $true ) ),
inference(superposition,[],[f30,f287]) ).
thf(f287,plain,
! [X0: sK1 > $o,X1: sK1] :
( ( $false
= ( 'const/sets/IN' @ sK1 @ X1 @ ( 'const/sets/DIFF' @ sK1 @ sK2 @ sK3 ) ) )
| ( ( 'const/sets/IN' @ sK1 @ X1 @ X0 )
= $true ) ),
inference(trivial_inequality_removal,[],[f283]) ).
thf(f283,plain,
! [X0: sK1 > $o,X1: sK1] :
( ( ( 'const/sets/IN' @ sK1 @ X1 @ X0 )
= $true )
| ( $false
= ( 'const/sets/IN' @ sK1 @ X1 @ ( 'const/sets/DIFF' @ sK1 @ sK2 @ sK3 ) ) )
| ( $false = $true ) ),
inference(superposition,[],[f47,f279]) ).
thf(f279,plain,
! [X0: sK1 > $o] :
( $true
= ( 'const/sets/SUBSET' @ sK1 @ ( 'const/sets/DIFF' @ sK1 @ sK2 @ sK3 ) @ X0 ) ),
inference(trivial_inequality_removal,[],[f278]) ).
thf(f278,plain,
! [X0: sK1 > $o] :
( ( $true
= ( 'const/sets/SUBSET' @ sK1 @ ( 'const/sets/DIFF' @ sK1 @ sK2 @ sK3 ) @ X0 ) )
| ( $false = $true ) ),
inference(duplicate_literal_removal,[],[f273]) ).
thf(f273,plain,
! [X0: sK1 > $o] :
( ( $true
= ( 'const/sets/SUBSET' @ sK1 @ ( 'const/sets/DIFF' @ sK1 @ sK2 @ sK3 ) @ X0 ) )
| ( $true
= ( 'const/sets/SUBSET' @ sK1 @ ( 'const/sets/DIFF' @ sK1 @ sK2 @ sK3 ) @ X0 ) )
| ( $false = $true ) ),
inference(superposition,[],[f243,f141]) ).
thf(f141,plain,
! [X0: $tType,X2: X0 > $o,X3: X0 > $o,X1: X0 > $o] :
( ( ( 'const/sets/IN' @ X0 @ ( sK6 @ X0 @ ( 'const/sets/DIFF' @ X0 @ X1 @ X2 ) @ X3 ) @ X1 )
= $true )
| ( ( 'const/sets/SUBSET' @ X0 @ ( 'const/sets/DIFF' @ X0 @ X1 @ X2 ) @ X3 )
= $true ) ),
inference(trivial_inequality_removal,[],[f139]) ).
thf(f139,plain,
! [X0: $tType,X2: X0 > $o,X3: X0 > $o,X1: X0 > $o] :
( ( $false = $true )
| ( ( 'const/sets/IN' @ X0 @ ( sK6 @ X0 @ ( 'const/sets/DIFF' @ X0 @ X1 @ X2 ) @ X3 ) @ X1 )
= $true )
| ( ( 'const/sets/SUBSET' @ X0 @ ( 'const/sets/DIFF' @ X0 @ X1 @ X2 ) @ X3 )
= $true ) ),
inference(superposition,[],[f51,f38]) ).
thf(f38,plain,
! [X0: $tType,X2: X0 > $o,X3: X0,X1: X0 > $o] :
( ( ( 'const/sets/IN' @ X0 @ X3 @ ( 'const/sets/DIFF' @ X0 @ X1 @ X2 ) )
= $false )
| ( ( 'const/sets/IN' @ X0 @ X3 @ X1 )
= $true ) ),
inference(binary_proxy_clausification,[],[f37]) ).
thf(f51,plain,
! [X0: $tType,X2: X0 > $o,X1: X0 > $o] :
( ( $true
= ( 'const/sets/IN' @ X0 @ ( sK6 @ X0 @ X1 @ X2 ) @ X1 ) )
| ( ( 'const/sets/SUBSET' @ X0 @ X1 @ X2 )
= $true ) ),
inference(binary_proxy_clausification,[],[f49]) ).
thf(f49,plain,
! [X0: $tType,X2: X0 > $o,X1: X0 > $o] :
( ( ( ( 'const/sets/IN' @ X0 @ ( sK6 @ X0 @ X1 @ X2 ) @ X1 )
=> ( 'const/sets/IN' @ X0 @ ( sK6 @ X0 @ X1 @ X2 ) @ X2 ) )
= $false )
| ( ( 'const/sets/SUBSET' @ X0 @ X1 @ X2 )
= $true ) ),
inference(beta_eta_normalization,[],[f48]) ).
thf(f48,plain,
! [X0: $tType,X2: X0 > $o,X1: X0 > $o] :
( ( ( 'const/sets/SUBSET' @ X0 @ X1 @ X2 )
= $true )
| ( $false
= ( ^ [Y0: X0] :
( ( 'const/sets/IN' @ X0 @ Y0 @ X1 )
=> ( 'const/sets/IN' @ X0 @ Y0 @ X2 ) )
@ ( sK6 @ X0 @ X1 @ X2 ) ) ) ),
inference(sigma_clausification,[],[f43]) ).
thf(f43,plain,
! [X0: $tType,X2: X0 > $o,X1: X0 > $o] :
( ( ( 'const/sets/SUBSET' @ X0 @ X1 @ X2 )
= $true )
| ( $false
= ( !! @ X0
@ ^ [Y0: X0] :
( ( 'const/sets/IN' @ X0 @ Y0 @ X1 )
=> ( 'const/sets/IN' @ X0 @ Y0 @ X2 ) ) ) ) ),
inference(binary_proxy_clausification,[],[f28]) ).
thf(f28,plain,
! [X0: $tType,X2: X0 > $o,X1: X0 > $o] :
( ( 'const/sets/SUBSET' @ X0 @ X1 @ X2 )
= ( !! @ X0
@ ^ [Y0: X0] :
( ( 'const/sets/IN' @ X0 @ Y0 @ X1 )
=> ( 'const/sets/IN' @ X0 @ Y0 @ X2 ) ) ) ),
inference(cnf_transformation,[],[f11]) ).
thf(f11,plain,
! [X0: $tType,X1: X0 > $o,X2: X0 > $o] :
( ( 'const/sets/SUBSET' @ X0 @ X1 @ X2 )
= ( !! @ X0
@ ^ [Y0: X0] :
( ( 'const/sets/IN' @ X0 @ Y0 @ X1 )
=> ( 'const/sets/IN' @ X0 @ Y0 @ X2 ) ) ) ),
inference(fool_elimination,[],[f10]) ).
thf(f10,plain,
! [X0: $tType,X1: X0 > $o,X2: X0 > $o] :
( ( 'const/sets/SUBSET' @ X0 @ X1 @ X2 )
= ( ! [X3: X0] :
( ( 'const/sets/IN' @ X0 @ X3 @ X1 )
=> ( 'const/sets/IN' @ X0 @ X3 @ X2 ) ) ) ),
inference(rectify,[],[f3]) ).
thf(f3,axiom,
! [X0: $tType,X1: X0 > $o,X2: X0 > $o] :
( ( 'const/sets/SUBSET' @ X0 @ X1 @ X2 )
= ( ! [X3: X0] :
( ( 'const/sets/IN' @ X0 @ X3 @ X1 )
=> ( 'const/sets/IN' @ X0 @ X3 @ X2 ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p','thm/sets/SUBSET_') ).
thf(f243,plain,
! [X0: sK1 > $o,X1: sK1 > $o] :
( ( $false
= ( 'const/sets/IN' @ sK1 @ ( sK6 @ sK1 @ ( 'const/sets/DIFF' @ sK1 @ X0 @ sK3 ) @ X1 ) @ sK2 ) )
| ( $true
= ( 'const/sets/SUBSET' @ sK1 @ ( 'const/sets/DIFF' @ sK1 @ X0 @ sK3 ) @ X1 ) ) ),
inference(trivial_inequality_removal,[],[f230]) ).
thf(f230,plain,
! [X0: sK1 > $o,X1: sK1 > $o] :
( ( $false = $true )
| ( $true
= ( 'const/sets/SUBSET' @ sK1 @ ( 'const/sets/DIFF' @ sK1 @ X0 @ sK3 ) @ X1 ) )
| ( $false
= ( 'const/sets/IN' @ sK1 @ ( sK6 @ sK1 @ ( 'const/sets/DIFF' @ sK1 @ X0 @ sK3 ) @ X1 ) @ sK2 ) ) ),
inference(superposition,[],[f148,f113]) ).
thf(f113,plain,
! [X0: sK1] :
( ( $true
= ( 'const/sets/IN' @ sK1 @ X0 @ sK3 ) )
| ( $false
= ( 'const/sets/IN' @ sK1 @ X0 @ sK2 ) ) ),
inference(trivial_inequality_removal,[],[f107]) ).
thf(f107,plain,
! [X0: sK1] :
( ( $false = $true )
| ( $true
= ( 'const/sets/IN' @ sK1 @ X0 @ sK3 ) )
| ( $false
= ( 'const/sets/IN' @ sK1 @ X0 @ sK2 ) ) ),
inference(superposition,[],[f35,f47]) ).
thf(f35,plain,
( $true
= ( 'const/sets/SUBSET' @ sK1 @ sK2 @ sK3 ) ),
inference(cnf_transformation,[],[f27]) ).
thf(f148,plain,
! [X0: $tType,X2: X0 > $o,X3: X0 > $o,X1: X0 > $o] :
( ( ( 'const/sets/IN' @ X0 @ ( sK6 @ X0 @ ( 'const/sets/DIFF' @ X0 @ X1 @ X2 ) @ X3 ) @ X2 )
= $false )
| ( ( 'const/sets/SUBSET' @ X0 @ ( 'const/sets/DIFF' @ X0 @ X1 @ X2 ) @ X3 )
= $true ) ),
inference(trivial_inequality_removal,[],[f145]) ).
thf(f145,plain,
! [X0: $tType,X2: X0 > $o,X3: X0 > $o,X1: X0 > $o] :
( ( ( 'const/sets/IN' @ X0 @ ( sK6 @ X0 @ ( 'const/sets/DIFF' @ X0 @ X1 @ X2 ) @ X3 ) @ X2 )
= $false )
| ( $false = $true )
| ( ( 'const/sets/SUBSET' @ X0 @ ( 'const/sets/DIFF' @ X0 @ X1 @ X2 ) @ X3 )
= $true ) ),
inference(superposition,[],[f51,f40]) ).
thf(f47,plain,
! [X0: $tType,X2: X0 > $o,X3: X0,X1: X0 > $o] :
( ( ( 'const/sets/SUBSET' @ X0 @ X1 @ X2 )
= $false )
| ( ( 'const/sets/IN' @ X0 @ X3 @ X2 )
= $true )
| ( ( 'const/sets/IN' @ X0 @ X3 @ X1 )
= $false ) ),
inference(binary_proxy_clausification,[],[f46]) ).
thf(f46,plain,
! [X0: $tType,X2: X0 > $o,X3: X0,X1: X0 > $o] :
( ( ( 'const/sets/SUBSET' @ X0 @ X1 @ X2 )
= $false )
| ( ( ( 'const/sets/IN' @ X0 @ X3 @ X1 )
=> ( 'const/sets/IN' @ X0 @ X3 @ X2 ) )
= $true ) ),
inference(beta_eta_normalization,[],[f45]) ).
thf(f45,plain,
! [X0: $tType,X2: X0 > $o,X3: X0,X1: X0 > $o] :
( ( ( 'const/sets/SUBSET' @ X0 @ X1 @ X2 )
= $false )
| ( ( ^ [Y0: X0] :
( ( 'const/sets/IN' @ X0 @ Y0 @ X1 )
=> ( 'const/sets/IN' @ X0 @ Y0 @ X2 ) )
@ X3 )
= $true ) ),
inference(pi_clausification,[],[f44]) ).
thf(f44,plain,
! [X0: $tType,X2: X0 > $o,X1: X0 > $o] :
( ( $true
= ( !! @ X0
@ ^ [Y0: X0] :
( ( 'const/sets/IN' @ X0 @ Y0 @ X1 )
=> ( 'const/sets/IN' @ X0 @ Y0 @ X2 ) ) ) )
| ( ( 'const/sets/SUBSET' @ X0 @ X1 @ X2 )
= $false ) ),
inference(binary_proxy_clausification,[],[f28]) ).
thf(f30,plain,
! [X0: $tType,X2: X0 > $o,X3: X0 > 'type/nums/num',X1: X0 > $o] :
( ( $true
= ( 'const/sets/IN' @ X0 @ ( sK0 @ X0 @ X3 @ X2 @ X1 ) @ ( 'const/sets/DIFF' @ X0 @ X1 @ X2 ) ) )
| ( ( 'const/sets/FINITE' @ X0 @ X1 )
!= $true )
| ( ( 'const/sets/FINITE' @ X0 @ X2 )
!= $true )
| ( ( 'const/arith/<=' @ ( 'const/iterate/nsum' @ X0 @ X1 @ X3 ) @ ( 'const/iterate/nsum' @ X0 @ X2 @ X3 ) )
= $true ) ),
inference(cnf_transformation,[],[f25]) ).
thf(f25,plain,
! [X0: $tType,X1: X0 > $o,X2: X0 > $o,X3: X0 > 'type/nums/num'] :
( ( ( 'const/sets/FINITE' @ X0 @ X1 )
!= $true )
| ( ( ( 'const/nums/NUMERAL' @ 'const/nums/_0' )
!= ( X3 @ ( sK0 @ X0 @ X3 @ X2 @ X1 ) ) )
& ( $true
= ( 'const/sets/IN' @ X0 @ ( sK0 @ X0 @ X3 @ X2 @ X1 ) @ ( 'const/sets/DIFF' @ X0 @ X1 @ X2 ) ) ) )
| ( ( 'const/arith/<=' @ ( 'const/iterate/nsum' @ X0 @ X1 @ X3 ) @ ( 'const/iterate/nsum' @ X0 @ X2 @ X3 ) )
= $true )
| ( ( 'const/sets/FINITE' @ X0 @ X2 )
!= $true ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0])],[f23,f24]) ).
thf(f24,plain,
! [X0: $tType,X1: X0 > $o,X2: X0 > $o,X3: X0 > 'type/nums/num'] :
( ? [X4: X0] :
( ( ( X3 @ X4 )
!= ( 'const/nums/NUMERAL' @ 'const/nums/_0' ) )
& ( ( 'const/sets/IN' @ X0 @ X4 @ ( 'const/sets/DIFF' @ X0 @ X1 @ X2 ) )
= $true ) )
=> ( ( ( 'const/nums/NUMERAL' @ 'const/nums/_0' )
!= ( X3 @ ( sK0 @ X0 @ X3 @ X2 @ X1 ) ) )
& ( $true
= ( 'const/sets/IN' @ X0 @ ( sK0 @ X0 @ X3 @ X2 @ X1 ) @ ( 'const/sets/DIFF' @ X0 @ X1 @ X2 ) ) ) ) ),
introduced(choice_axiom,[]) ).
thf(f23,plain,
! [X0: $tType,X1: X0 > $o,X2: X0 > $o,X3: X0 > 'type/nums/num'] :
( ( ( 'const/sets/FINITE' @ X0 @ X1 )
!= $true )
| ? [X4: X0] :
( ( ( X3 @ X4 )
!= ( 'const/nums/NUMERAL' @ 'const/nums/_0' ) )
& ( ( 'const/sets/IN' @ X0 @ X4 @ ( 'const/sets/DIFF' @ X0 @ X1 @ X2 ) )
= $true ) )
| ( ( 'const/arith/<=' @ ( 'const/iterate/nsum' @ X0 @ X1 @ X3 ) @ ( 'const/iterate/nsum' @ X0 @ X2 @ X3 ) )
= $true )
| ( ( 'const/sets/FINITE' @ X0 @ X2 )
!= $true ) ),
inference(flattening,[],[f22]) ).
thf(f22,plain,
! [X0: $tType,X1: X0 > $o,X2: X0 > $o,X3: X0 > 'type/nums/num'] :
( ( ( 'const/arith/<=' @ ( 'const/iterate/nsum' @ X0 @ X1 @ X3 ) @ ( 'const/iterate/nsum' @ X0 @ X2 @ X3 ) )
= $true )
| ? [X4: X0] :
( ( ( X3 @ X4 )
!= ( 'const/nums/NUMERAL' @ 'const/nums/_0' ) )
& ( ( 'const/sets/IN' @ X0 @ X4 @ ( 'const/sets/DIFF' @ X0 @ X1 @ X2 ) )
= $true ) )
| ( ( 'const/sets/FINITE' @ X0 @ X1 )
!= $true )
| ( ( 'const/sets/FINITE' @ X0 @ X2 )
!= $true ) ),
inference(ennf_transformation,[],[f9]) ).
thf(f9,plain,
! [X0: $tType,X1: X0 > $o,X2: X0 > $o,X3: X0 > 'type/nums/num'] :
( ( ! [X4: X0] :
( ( ( 'const/sets/IN' @ X0 @ X4 @ ( 'const/sets/DIFF' @ X0 @ X1 @ X2 ) )
= $true )
=> ( ( X3 @ X4 )
= ( 'const/nums/NUMERAL' @ 'const/nums/_0' ) ) )
& ( ( 'const/sets/FINITE' @ X0 @ X1 )
= $true )
& ( ( 'const/sets/FINITE' @ X0 @ X2 )
= $true ) )
=> ( ( 'const/arith/<=' @ ( 'const/iterate/nsum' @ X0 @ X1 @ X3 ) @ ( 'const/iterate/nsum' @ X0 @ X2 @ X3 ) )
= $true ) ),
inference(fool_elimination,[],[f8]) ).
thf(f8,plain,
! [X0: $tType,X1: X0 > $o,X2: X0 > $o,X3: X0 > 'type/nums/num'] :
( ( ( 'const/sets/FINITE' @ X0 @ X1 )
& ! [X4: X0] :
( ( 'const/sets/IN' @ X0 @ X4 @ ( 'const/sets/DIFF' @ X0 @ X1 @ X2 ) )
=> ( ( X3 @ X4 )
= ( 'const/nums/NUMERAL' @ 'const/nums/_0' ) ) )
& ( 'const/sets/FINITE' @ X0 @ X2 ) )
=> ( 'const/arith/<=' @ ( 'const/iterate/nsum' @ X0 @ X1 @ X3 ) @ ( 'const/iterate/nsum' @ X0 @ X2 @ X3 ) ) ),
inference(rectify,[],[f1]) ).
thf(f1,axiom,
! [X0: $tType,X1: X0 > $o,X2: X0 > $o,X3: X0 > 'type/nums/num'] :
( ( ( 'const/sets/FINITE' @ X0 @ X1 )
& ! [X4: X0] :
( ( 'const/sets/IN' @ X0 @ X4 @ ( 'const/sets/DIFF' @ X0 @ X1 @ X2 ) )
=> ( ( X3 @ X4 )
= ( 'const/nums/NUMERAL' @ 'const/nums/_0' ) ) )
& ( 'const/sets/FINITE' @ X0 @ X2 ) )
=> ( 'const/arith/<=' @ ( 'const/iterate/nsum' @ X0 @ X1 @ X3 ) @ ( 'const/iterate/nsum' @ X0 @ X2 @ X3 ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p','thm/iterate/NSUM_SUBSET_') ).
thf(f75,plain,
spl5_2,
inference(avatar_contradiction_clause,[],[f74]) ).
thf(f74,plain,
( $false
| spl5_2 ),
inference(trivial_inequality_removal,[],[f73]) ).
thf(f73,plain,
( ( $false = $true )
| spl5_2 ),
inference(backward_demodulation,[],[f33,f71]) ).
thf(f71,plain,
( ( ( 'const/sets/FINITE' @ sK1 @ sK3 )
= $false )
| spl5_2 ),
inference(trivial_inequality_removal,[],[f67]) ).
thf(f67,plain,
( ( ( 'const/sets/FINITE' @ sK1 @ sK3 )
= $false )
| ( $true != $true )
| spl5_2 ),
inference(fool_paramodulation,[],[f65]) ).
thf(f65,plain,
( ( ( 'const/sets/FINITE' @ sK1 @ sK3 )
!= $true )
| spl5_2 ),
inference(avatar_component_clause,[],[f63]) ).
thf(f33,plain,
( ( 'const/sets/FINITE' @ sK1 @ sK3 )
= $true ),
inference(cnf_transformation,[],[f27]) ).
thf(f66,plain,
( spl5_1
| ~ spl5_2 ),
inference(avatar_split_clause,[],[f57,f63,f59]) ).
thf(f57,plain,
( ( ( 'const/sets/FINITE' @ sK1 @ sK3 )
!= $true )
| ( $true
= ( 'const/sets/FINITE' @ sK1 @ sK2 ) ) ),
inference(trivial_inequality_removal,[],[f55]) ).
thf(f55,plain,
( ( $true
= ( 'const/sets/FINITE' @ sK1 @ sK2 ) )
| ( $true != $true )
| ( ( 'const/sets/FINITE' @ sK1 @ sK3 )
!= $true ) ),
inference(superposition,[],[f32,f35]) ).
thf(f32,plain,
! [X0: $tType,X2: X0 > $o,X1: X0 > $o] :
( ( ( 'const/sets/SUBSET' @ X0 @ X1 @ X2 )
!= $true )
| ( ( 'const/sets/FINITE' @ X0 @ X1 )
= $true )
| ( ( 'const/sets/FINITE' @ X0 @ X2 )
!= $true ) ),
inference(cnf_transformation,[],[f21]) ).
thf(f21,plain,
! [X0: $tType,X1: X0 > $o,X2: X0 > $o] :
( ( ( 'const/sets/SUBSET' @ X0 @ X1 @ X2 )
!= $true )
| ( ( 'const/sets/FINITE' @ X0 @ X2 )
!= $true )
| ( ( 'const/sets/FINITE' @ X0 @ X1 )
= $true ) ),
inference(flattening,[],[f20]) ).
thf(f20,plain,
! [X0: $tType,X1: X0 > $o,X2: X0 > $o] :
( ( ( 'const/sets/FINITE' @ X0 @ X1 )
= $true )
| ( ( 'const/sets/SUBSET' @ X0 @ X1 @ X2 )
!= $true )
| ( ( 'const/sets/FINITE' @ X0 @ X2 )
!= $true ) ),
inference(ennf_transformation,[],[f17]) ).
thf(f17,plain,
! [X0: $tType,X1: X0 > $o,X2: X0 > $o] :
( ( ( ( 'const/sets/SUBSET' @ X0 @ X1 @ X2 )
= $true )
& ( ( 'const/sets/FINITE' @ X0 @ X2 )
= $true ) )
=> ( ( 'const/sets/FINITE' @ X0 @ X1 )
= $true ) ),
inference(fool_elimination,[],[f16]) ).
thf(f16,plain,
! [X0: $tType,X1: X0 > $o,X2: X0 > $o] :
( ( ( 'const/sets/SUBSET' @ X0 @ X1 @ X2 )
& ( 'const/sets/FINITE' @ X0 @ X2 ) )
=> ( 'const/sets/FINITE' @ X0 @ X1 ) ),
inference(rectify,[],[f2]) ).
thf(f2,axiom,
! [X0: $tType,X1: X0 > $o,X2: X0 > $o] :
( ( ( 'const/sets/SUBSET' @ X0 @ X1 @ X2 )
& ( 'const/sets/FINITE' @ X0 @ X2 ) )
=> ( 'const/sets/FINITE' @ X0 @ X1 ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p','thm/sets/FINITE_SUBSET_') ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.13 % Problem : SEV504^1 : TPTP v8.2.0. Released v7.0.0.
% 0.12/0.13 % Command : run_vampire %s %d THM
% 0.13/0.35 % Computer : n019.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Fri Jun 21 18:25:09 EDT 2024
% 0.13/0.35 % CPUTime :
% 0.13/0.37 This is a TH1_THM_EQU_NAR problem
% 0.13/0.37 Running higher-order theorem proving
% 0.13/0.37 Running /export/starexec/sandbox2/solver/bin/vampire_ho --cores 7 --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_hol /export/starexec/sandbox2/benchmark/theBenchmark.p -m 16384 -t 300
% 0.13/0.39 % (12870)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.39 % (12873)lrs+10_1:1_au=on:inj=on:i=2:si=on:rtra=on_0 on theBenchmark for (2999ds/2Mi)
% 0.13/0.39 % (12871)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 % (12872)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.39 % (12874)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 % (12875)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 % (12876)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.39 % Exception at run slice level
% 0.13/0.39 User error: Vampire does not support full TH1. This benchmark is either outside of the TH1 fragment, or outside of the fragment supported by Vampire
% 0.13/0.39 % (12873)Instruction limit reached!
% 0.13/0.39 % (12873)------------------------------
% 0.13/0.39 % (12873)Version: Vampire 4.8 (commit 11aac991b on 2023-10-04 16:26:07 +0200)
% 0.13/0.39 % (12873)Termination reason: Unknown
% 0.13/0.39 % (12873)Termination phase: Saturation
% 0.13/0.39
% 0.13/0.39 % (12873)Memory used [KB]: 5500
% 0.13/0.39 % (12873)Time elapsed: 0.004 s
% 0.13/0.39 % (12873)Instructions burned: 2 (million)
% 0.13/0.39 % (12873)------------------------------
% 0.13/0.39 % (12873)------------------------------
% 0.13/0.39 % (12871)Instruction limit reached!
% 0.13/0.39 % (12871)------------------------------
% 0.13/0.39 % (12871)Version: Vampire 4.8 (commit 11aac991b on 2023-10-04 16:26:07 +0200)
% 0.13/0.39 % (12871)Termination reason: Unknown
% 0.13/0.39 % (12871)Termination phase: Saturation
% 0.13/0.39
% 0.13/0.39 % (12871)Memory used [KB]: 5500
% 0.13/0.39 % (12871)Time elapsed: 0.005 s
% 0.13/0.39 % (12871)Instructions burned: 4 (million)
% 0.13/0.39 % (12871)------------------------------
% 0.13/0.39 % (12871)------------------------------
% 0.13/0.39 % (12875)Refutation not found, incomplete strategy
% 0.13/0.39 % (12875)------------------------------
% 0.13/0.39 % (12875)Version: Vampire 4.8 (commit 11aac991b on 2023-10-04 16:26:07 +0200)
% 0.13/0.39 % (12875)Termination reason: Refutation not found, incomplete strategy
% 0.13/0.39
% 0.13/0.39
% 0.13/0.39 % (12875)Memory used [KB]: 5500
% 0.13/0.39 % (12875)Time elapsed: 0.006 s
% 0.13/0.39 % (12875)Instructions burned: 3 (million)
% 0.13/0.39 % (12875)------------------------------
% 0.13/0.39 % (12875)------------------------------
% 0.13/0.40 % (12876)Instruction limit reached!
% 0.13/0.40 % (12876)------------------------------
% 0.13/0.40 % (12876)Version: Vampire 4.8 (commit 11aac991b on 2023-10-04 16:26:07 +0200)
% 0.13/0.40 % (12876)Termination reason: Unknown
% 0.13/0.40 % (12876)Termination phase: Saturation
% 0.13/0.40
% 0.13/0.40 % (12876)Memory used [KB]: 5628
% 0.13/0.40 % (12876)Time elapsed: 0.015 s
% 0.13/0.40 % (12876)Instructions burned: 18 (million)
% 0.13/0.40 % (12876)------------------------------
% 0.13/0.40 % (12876)------------------------------
% 0.13/0.41 % (12877)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.41 % (12878)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.13/0.41 % Exception at run slice level
% 0.13/0.41 User error: Vampire does not support full TH1. This benchmark is either outside of the TH1 fragment, or outside of the fragment supported by Vampire
% 0.13/0.41 % (12872)Instruction limit reached!
% 0.13/0.41 % (12872)------------------------------
% 0.13/0.41 % (12872)Version: Vampire 4.8 (commit 11aac991b on 2023-10-04 16:26:07 +0200)
% 0.13/0.41 % (12872)Termination reason: Unknown
% 0.13/0.41 % (12872)Termination phase: Saturation
% 0.13/0.41
% 0.13/0.41 % (12872)Memory used [KB]: 5628
% 0.13/0.41 % (12872)Time elapsed: 0.021 s
% 0.13/0.41 % (12872)Instructions burned: 28 (million)
% 0.13/0.41 % (12872)------------------------------
% 0.13/0.41 % (12872)------------------------------
% 0.13/0.41 % (12879)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.41 % (12877)Instruction limit reached!
% 0.13/0.41 % (12877)------------------------------
% 0.13/0.41 % (12877)Version: Vampire 4.8 (commit 11aac991b on 2023-10-04 16:26:07 +0200)
% 0.13/0.41 % (12877)Termination reason: Unknown
% 0.13/0.41 % (12877)Termination phase: Saturation
% 0.13/0.41
% 0.13/0.41 % (12877)Memory used [KB]: 5500
% 0.13/0.41 % (12877)Time elapsed: 0.004 s
% 0.13/0.41 % (12877)Instructions burned: 3 (million)
% 0.13/0.41 % (12877)------------------------------
% 0.13/0.41 % (12877)------------------------------
% 0.13/0.41 % (12880)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.41 % (12880)Instruction limit reached!
% 0.13/0.41 % (12880)------------------------------
% 0.13/0.41 % (12880)Version: Vampire 4.8 (commit 11aac991b on 2023-10-04 16:26:07 +0200)
% 0.13/0.41 % (12880)Termination reason: Unknown
% 0.13/0.41 % (12880)Termination phase: Saturation
% 0.13/0.41
% 0.13/0.41 % (12880)Memory used [KB]: 5500
% 0.13/0.41 % (12880)Time elapsed: 0.004 s
% 0.13/0.41 % (12880)Instructions burned: 3 (million)
% 0.13/0.41 % (12880)------------------------------
% 0.13/0.41 % (12880)------------------------------
% 0.13/0.42 % (12881)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.42 % Exception at run slice level
% 0.13/0.42 User error: Vampire does not support full TH1. This benchmark is either outside of the TH1 fragment, or outside of the fragment supported by Vampire
% 0.13/0.42 % (12879)Instruction limit reached!
% 0.13/0.42 % (12879)------------------------------
% 0.13/0.42 % (12879)Version: Vampire 4.8 (commit 11aac991b on 2023-10-04 16:26:07 +0200)
% 0.13/0.42 % (12879)Termination reason: Unknown
% 0.13/0.42 % (12879)Termination phase: Saturation
% 0.13/0.42
% 0.13/0.42 % (12879)Memory used [KB]: 5628
% 0.13/0.42 % (12879)Time elapsed: 0.037 s
% 0.13/0.42 % (12879)Instructions burned: 16 (million)
% 0.13/0.42 % (12879)------------------------------
% 0.13/0.42 % (12879)------------------------------
% 0.23/0.42 % (12884)lrs+21_1:1_au=on:cnfonf=off:fd=preordered:fe=off:fsr=off:hud=11:inj=on:kws=precedence:s2pl=no:sp=weighted_frequency:tgt=full:i=3:si=on:rtra=on_0 on theBenchmark for (2999ds/3Mi)
% 0.23/0.42 % (12882)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.23/0.42 % (12883)lrs+10_1:1_acc=on:amm=sco:cs=on:tgt=full:i=16:si=on:rtra=on_0 on theBenchmark for (2999ds/16Mi)
% 0.23/0.43 % (12884)Instruction limit reached!
% 0.23/0.43 % (12884)------------------------------
% 0.23/0.43 % (12884)Version: Vampire 4.8 (commit 11aac991b on 2023-10-04 16:26:07 +0200)
% 0.23/0.43 % (12884)Termination reason: Unknown
% 0.23/0.43 % (12884)Termination phase: Twee Goal Transformation
% 0.23/0.43
% 0.23/0.43 % (12884)Memory used [KB]: 1023
% 0.23/0.43 % (12884)Time elapsed: 0.003 s
% 0.23/0.43 % (12884)Instructions burned: 3 (million)
% 0.23/0.43 % (12884)------------------------------
% 0.23/0.43 % (12884)------------------------------
% 0.23/0.43 % (12885)lrs+2_1:1_apa=on:au=on:bd=preordered:cnfonf=off:cs=on:ixr=off:sos=on:i=3:si=on:rtra=on_0 on theBenchmark for (2999ds/3Mi)
% 0.23/0.43 % (12882)Instruction limit reached!
% 0.23/0.43 % (12882)------------------------------
% 0.23/0.43 % (12882)Version: Vampire 4.8 (commit 11aac991b on 2023-10-04 16:26:07 +0200)
% 0.23/0.43 % (12882)Termination reason: Unknown
% 0.23/0.43 % (12882)Termination phase: Saturation
% 0.23/0.43
% 0.23/0.43 % (12882)Memory used [KB]: 1023
% 0.23/0.43 % (12882)Time elapsed: 0.007 s
% 0.23/0.43 % (12882)Instructions burned: 7 (million)
% 0.23/0.43 % (12882)------------------------------
% 0.23/0.43 % (12882)------------------------------
% 0.23/0.43 % (12885)Instruction limit reached!
% 0.23/0.43 % (12885)------------------------------
% 0.23/0.43 % (12885)Version: Vampire 4.8 (commit 11aac991b on 2023-10-04 16:26:07 +0200)
% 0.23/0.43 % (12885)Termination reason: Unknown
% 0.23/0.43 % (12885)Termination phase: Saturation
% 0.23/0.43
% 0.23/0.43 % (12885)Memory used [KB]: 1023
% 0.23/0.43 % (12885)Time elapsed: 0.004 s
% 0.23/0.43 % (12885)Instructions burned: 3 (million)
% 0.23/0.43 % (12885)------------------------------
% 0.23/0.43 % (12885)------------------------------
% 0.23/0.44 % (12886)lrs+10_1:1_cnfonf=off:cs=on:hud=3:prag=on:sup=off:i=7:si=on:rtra=on_0 on theBenchmark for (2999ds/7Mi)
% 0.23/0.44 % (12888)dis+1002_1:1_add=large:cnfonf=lazy_pi_sigma_gen:fe=off:prag=on:i=3:si=on:rtra=on_0 on theBenchmark for (2999ds/3Mi)
% 0.23/0.44 % (12883)Instruction limit reached!
% 0.23/0.44 % (12883)------------------------------
% 0.23/0.44 % (12883)Version: Vampire 4.8 (commit 11aac991b on 2023-10-04 16:26:07 +0200)
% 0.23/0.44 % (12883)Termination reason: Unknown
% 0.23/0.44 % (12883)Termination phase: Saturation
% 0.23/0.44
% 0.23/0.44 % (12883)Memory used [KB]: 5756
% 0.23/0.44 % (12883)Time elapsed: 0.014 s
% 0.23/0.44 % (12883)Instructions burned: 16 (million)
% 0.23/0.44 % (12883)------------------------------
% 0.23/0.44 % (12883)------------------------------
% 0.23/0.44 % Exception at run slice level
% 0.23/0.44 User error: Vampire does not support full TH1. This benchmark is either outside of the TH1 fragment, or outside of the fragment supported by Vampire
% 0.23/0.44 % (12886)Instruction limit reached!
% 0.23/0.44 % (12886)------------------------------
% 0.23/0.44 % (12886)Version: Vampire 4.8 (commit 11aac991b on 2023-10-04 16:26:07 +0200)
% 0.23/0.44 % (12886)Termination reason: Unknown
% 0.23/0.44 % (12886)Termination phase: Saturation
% 0.23/0.44
% 0.23/0.44 % (12889)dis+1004_1:1_cha=on:cs=on:fe=off:hud=1:i=4:si=on:rtra=on_0 on theBenchmark for (2999ds/4Mi)
% 0.23/0.44 % (12886)Memory used [KB]: 5500
% 0.23/0.44 % (12886)Time elapsed: 0.007 s
% 0.23/0.44 % (12886)Instructions burned: 7 (million)
% 0.23/0.44 % (12886)------------------------------
% 0.23/0.44 % (12886)------------------------------
% 0.23/0.44 % (12889)Instruction limit reached!
% 0.23/0.44 % (12889)------------------------------
% 0.23/0.44 % (12889)Version: Vampire 4.8 (commit 11aac991b on 2023-10-04 16:26:07 +0200)
% 0.23/0.44 % (12889)Termination reason: Unknown
% 0.23/0.44 % (12889)Termination phase: Saturation
% 0.23/0.44
% 0.23/0.44 % (12889)Memory used [KB]: 5500
% 0.23/0.44 % (12889)Time elapsed: 0.005 s
% 0.23/0.44 % (12889)Instructions burned: 4 (million)
% 0.23/0.44 % (12889)------------------------------
% 0.23/0.44 % (12889)------------------------------
% 0.23/0.44 % (12890)lrs+1002_1:1_anc=all_dependent:au=on:cbe=off:fde=unused:ntd=on:i=18:si=on:rtra=on_0 on theBenchmark for (2999ds/18Mi)
% 0.23/0.45 % (12891)lrs+10_1:1_e2e=on:sd=1:sgt=8:ss=axioms:i=710:si=on:rtra=on_0 on theBenchmark for (2999ds/710Mi)
% 0.23/0.45 % (12892)lrs+1004_1:1_chr=on:prag=on:i=6:si=on:rtra=on_0 on theBenchmark for (2999ds/6Mi)
% 0.23/0.45 % (12893)dis+1002_5:1_au=on:bd=off:e2e=on:fde=none:fs=off:fsr=off:sos=on:i=902:si=on:rtra=on_0 on theBenchmark for (2999ds/902Mi)
% 0.23/0.46 % (12892)Instruction limit reached!
% 0.23/0.46 % (12892)------------------------------
% 0.23/0.46 % (12892)Version: Vampire 4.8 (commit 11aac991b on 2023-10-04 16:26:07 +0200)
% 0.23/0.46 % (12892)Termination reason: Unknown
% 0.23/0.46 % (12892)Termination phase: Saturation
% 0.23/0.46
% 0.23/0.46 % (12894)dis+21_1:8_apa=on:cnfonf=off:fd=off:fsr=off:hud=0:ins=1:kws=inv_frequency:nwc=10.0:ss=axioms:st=5.0:i=21:si=on:rtra=on_0 on theBenchmark for (2999ds/21Mi)
% 0.23/0.46 % (12892)Memory used [KB]: 5500
% 0.23/0.46 % (12892)Time elapsed: 0.006 s
% 0.23/0.46 % (12892)Instructions burned: 6 (million)
% 0.23/0.46 % (12892)------------------------------
% 0.23/0.46 % (12892)------------------------------
% 0.23/0.46 % (12890)Instruction limit reached!
% 0.23/0.46 % (12890)------------------------------
% 0.23/0.46 % (12890)Version: Vampire 4.8 (commit 11aac991b on 2023-10-04 16:26:07 +0200)
% 0.23/0.46 % (12890)Termination reason: Unknown
% 0.23/0.46 % (12890)Termination phase: Saturation
% 0.23/0.46
% 0.23/0.46 % (12890)Memory used [KB]: 5628
% 0.23/0.46 % (12890)Time elapsed: 0.014 s
% 0.23/0.46 % (12890)Instructions burned: 18 (million)
% 0.23/0.46 % (12890)------------------------------
% 0.23/0.46 % (12890)------------------------------
% 0.23/0.46 % (12895)dis+10_1:1_cnfonf=lazy_gen:fe=off:i=5:si=on:rtra=on_0 on theBenchmark for (2999ds/5Mi)
% 0.23/0.46 % Exception at run slice level
% 0.23/0.46 User error: Vampire does not support full TH1. This benchmark is either outside of the TH1 fragment, or outside of the fragment supported by Vampire
% 0.23/0.47 % (12894)Instruction limit reached!
% 0.23/0.47 % (12894)------------------------------
% 0.23/0.47 % (12894)Version: Vampire 4.8 (commit 11aac991b on 2023-10-04 16:26:07 +0200)
% 0.23/0.47 % (12894)Termination reason: Unknown
% 0.23/0.47 % (12894)Termination phase: Saturation
% 0.23/0.47
% 0.23/0.47 % (12894)Memory used [KB]: 5628
% 0.23/0.47 % (12894)Time elapsed: 0.017 s
% 0.23/0.47 % (12894)Instructions burned: 21 (million)
% 0.23/0.47 % (12894)------------------------------
% 0.23/0.47 % (12894)------------------------------
% 0.23/0.47 % (12896)lrs+2_1:1_cnfonf=lazy_not_gen_be_off:cs=on:fe=off:hud=10:inj=on:ins=3:plsq=on:plsqc=1:sd=10:ss=axioms:tnu=1:i=6:si=on:rtra=on_0 on theBenchmark for (2999ds/6Mi)
% 0.23/0.47 % (12897)lrs+1002_1:128_au=on:c=on:fsr=off:piset=equals:i=377:si=on:rtra=on_0 on theBenchmark for (2999ds/377Mi)
% 0.23/0.47 % Exception at run slice level
% 0.23/0.47 User error: Vampire does not support full TH1. This benchmark is either outside of the TH1 fragment, or outside of the fragment supported by Vampire
% 0.23/0.48 % (12898)dis+1010_1:4_atotf=0.2:c=on:cbe=off:cnfonf=lazy_simp:fe=off:ins=2:ntd=on:s2a=on:s2at=5.0:sgt=5:ss=axioms:st=1.5:i=779:si=on:rtra=on_0 on theBenchmark for (2999ds/779Mi)
% 0.23/0.48 % Exception at run slice level
% 0.23/0.48 User error: Vampire does not support full TH1. This benchmark is either outside of the TH1 fragment, or outside of the fragment supported by Vampire
% 0.23/0.49 % (12899)lrs+10_1:1_cnfonf=lazy_not_be_gen:ntd=on:sp=const_min:ss=axioms:sup=off:i=19:si=on:rtra=on_0 on theBenchmark for (2999ds/19Mi)
% 0.23/0.49 % Exception at run slice level
% 0.23/0.49 User error: Vampire does not support full TH1. This benchmark is either outside of the TH1 fragment, or outside of the fragment supported by Vampire
% 0.23/0.49 % (12900)lrs+1010_1:1_au=on:s2a=on:sd=1:sgt=50:ss=axioms:i=879:si=on:rtra=on_0 on theBenchmark for (2999ds/879Mi)
% 0.23/0.49 % (12901)dis+1002_1:128_acc=on:er=filter:i=17:si=on:rtra=on_0 on theBenchmark for (2999ds/17Mi)
% 0.23/0.50 % (12901)Instruction limit reached!
% 0.23/0.50 % (12901)------------------------------
% 0.23/0.50 % (12901)Version: Vampire 4.8 (commit 11aac991b on 2023-10-04 16:26:07 +0200)
% 0.23/0.50 % (12901)Termination reason: Unknown
% 0.23/0.50 % (12901)Termination phase: Saturation
% 0.23/0.50
% 0.23/0.50 % (12901)Memory used [KB]: 5628
% 0.23/0.50 % (12901)Time elapsed: 0.009 s
% 0.23/0.50 % (12901)Instructions burned: 17 (million)
% 0.23/0.50 % (12901)------------------------------
% 0.23/0.50 % (12901)------------------------------
% 0.23/0.50 % (12870)Instruction limit reached!
% 0.23/0.50 % (12870)------------------------------
% 0.23/0.50 % (12870)Version: Vampire 4.8 (commit 11aac991b on 2023-10-04 16:26:07 +0200)
% 0.23/0.50 % (12870)Termination reason: Unknown
% 0.23/0.50 % (12870)Termination phase: Saturation
% 0.23/0.50
% 0.23/0.50 % (12870)Memory used [KB]: 6268
% 0.23/0.50 % (12870)Time elapsed: 0.114 s
% 0.23/0.50 % (12870)Instructions burned: 183 (million)
% 0.23/0.50 % (12870)------------------------------
% 0.23/0.50 % (12870)------------------------------
% 0.23/0.50 % (12902)ott+21_1:1_apa=on:au=on:cnfonf=off:sos=on:i=3:si=on:rtra=on_0 on theBenchmark for (2998ds/3Mi)
% 0.23/0.51 % (12902)Instruction limit reached!
% 0.23/0.51 % (12902)------------------------------
% 0.23/0.51 % (12902)Version: Vampire 4.8 (commit 11aac991b on 2023-10-04 16:26:07 +0200)
% 0.23/0.51 % (12902)Termination reason: Unknown
% 0.23/0.51 % (12902)Termination phase: Saturation
% 0.23/0.51
% 0.23/0.51 % (12902)Memory used [KB]: 1023
% 0.23/0.51 % (12902)Time elapsed: 0.004 s
% 0.23/0.51 % (12902)Instructions burned: 3 (million)
% 0.23/0.51 % (12902)------------------------------
% 0.23/0.51 % (12902)------------------------------
% 0.23/0.51 % (12903)lrs+1010_1:8_cnfonf=off:hud=1:inj=on:tnu=5:i=30:si=on:rtra=on_0 on theBenchmark for (2998ds/30Mi)
% 0.23/0.51 % (12904)dis+10_1:1_ixr=off:plsq=on:plsqc=1:plsqr=32,1:s2a=on:i=127:si=on:rtra=on_0 on theBenchmark for (2998ds/127Mi)
% 0.23/0.52 % (12897)First to succeed.
% 0.23/0.52 % (12897)Refutation found. Thanks to Tanya!
% 0.23/0.52 % SZS status Theorem for theBenchmark
% 0.23/0.52 % SZS output start Proof for theBenchmark
% See solution above
% 0.23/0.52 % (12897)------------------------------
% 0.23/0.52 % (12897)Version: Vampire 4.8 (commit 11aac991b on 2023-10-04 16:26:07 +0200)
% 0.23/0.52 % (12897)Termination reason: Refutation
% 0.23/0.52
% 0.23/0.52 % (12897)Memory used [KB]: 5756
% 0.23/0.52 % (12897)Time elapsed: 0.046 s
% 0.23/0.52 % (12897)Instructions burned: 76 (million)
% 0.23/0.52 % (12897)------------------------------
% 0.23/0.52 % (12897)------------------------------
% 0.23/0.52 % (12869)Success in time 0.139 s
%------------------------------------------------------------------------------