TSTP Solution File: SEV491^1 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SEV491^1 : TPTP v8.2.0. Released v7.0.0.
% Transfm : none
% Format : tptp:raw
% Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% Computer : n017.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 04:13:58 EDT 2024
% Result : Theorem 0.92s 0.62s
% Output : Refutation 0.92s
% Verified :
% SZS Type : Refutation
% Derivation depth : 19
% Number of leaves : 29
% Syntax : Number of formulae : 141 ( 2 unt; 15 typ; 0 def)
% Number of atoms : 1526 ( 389 equ; 0 cnn)
% Maximal formula atoms : 18 ( 12 avg)
% Number of connectives : 2747 ( 199 ~; 309 |; 69 &;2137 @)
% ( 9 <=>; 24 =>; 0 <=; 0 <~>)
% Maximal formula depth : 17 ( 6 avg)
% Number of types : 4 ( 3 usr)
% Number of type conns : 138 ( 138 >; 0 *; 0 +; 0 <<)
% Number of symbols : 22 ( 19 usr; 10 con; 0-6 aty)
% Number of variables : 280 ( 0 ^ 245 !; 26 ?; 280 :)
% ( 9 !>; 0 ?*; 0 @-; 0 @+)
% Comments :
%------------------------------------------------------------------------------
thf(type_def_6,type,
'type/nums/num': $tType ).
thf(type_def_7,type,
sK0: $tType ).
thf(type_def_8,type,
sK1: $tType ).
thf(func_def_0,type,
'type/nums/num': $tType ).
thf(func_def_1,type,
'const/sets/IN':
!>[X0: $tType] : ( X0 > ( X0 > $o ) > $o ) ).
thf(func_def_2,type,
'const/sets/HAS_SIZE':
!>[X0: $tType] : ( ( X0 > $o ) > 'type/nums/num' > $o ) ).
thf(func_def_3,type,
'const/sets/FINITE':
!>[X0: $tType] : ( ( X0 > $o ) > $o ) ).
thf(func_def_4,type,
'const/sets/CARD':
!>[X0: $tType] : ( ( X0 > $o ) > 'type/nums/num' ) ).
thf(func_def_8,type,
sK2: sK0 > $o ).
thf(func_def_9,type,
sK3: sK1 > $o ).
thf(func_def_10,type,
sK4: sK0 > sK1 ).
thf(func_def_11,type,
sK5: sK1 > sK0 ).
thf(func_def_12,type,
sK6:
!>[X0: $tType,X1: $tType] : ( ( X1 > X0 ) > ( X0 > X1 ) > ( X1 > $o ) > ( X0 > $o ) > X0 ) ).
thf(func_def_13,type,
sK7:
!>[X0: $tType,X1: $tType] : ( ( X1 > X0 ) > ( X0 > X1 ) > ( X1 > $o ) > ( X0 > $o ) > X1 ) ).
thf(func_def_15,type,
ph9:
!>[X0: $tType] : X0 ).
thf(f477,plain,
$false,
inference(avatar_sat_refutation,[],[f46,f204,f249,f341,f350,f368,f384,f405,f409,f412,f414,f474,f476]) ).
thf(f476,plain,
( ~ spl8_13
| spl8_4
| spl8_4
| spl8_14 ),
inference(avatar_split_clause,[],[f475,f338,f91,f91,f334]) ).
thf(f334,plain,
( spl8_13
<=> ( ( 'const/sets/IN' @ sK1 @ ( sK7 @ sK0 @ sK1 @ sK5 @ sK4 @ sK3 @ sK2 ) @ sK3 )
= $true ) ),
introduced(avatar_definition,[new_symbols(naming,[spl8_13])]) ).
thf(f91,plain,
( spl8_4
<=> ! [X0: 'type/nums/num'] :
( ( ( 'const/sets/HAS_SIZE' @ sK1 @ sK3 @ X0 )
= $false )
| ( ( 'const/sets/HAS_SIZE' @ sK0 @ sK2 @ X0 )
= $true ) ) ),
introduced(avatar_definition,[new_symbols(naming,[spl8_4])]) ).
thf(f338,plain,
( spl8_14
<=> ( ( 'const/sets/IN' @ sK0 @ ( sK6 @ sK0 @ sK1 @ sK5 @ sK4 @ sK3 @ sK2 ) @ sK2 )
= $true ) ),
introduced(avatar_definition,[new_symbols(naming,[spl8_14])]) ).
thf(f475,plain,
( ! [X0: 'type/nums/num',X1: 'type/nums/num'] :
( ( ( 'const/sets/HAS_SIZE' @ sK1 @ sK3 @ X1 )
= $false )
| ( ( 'const/sets/HAS_SIZE' @ sK1 @ sK3 @ X0 )
= $false )
| ( ( 'const/sets/HAS_SIZE' @ sK0 @ sK2 @ X1 )
= $true )
| ( ( 'const/sets/HAS_SIZE' @ sK0 @ sK2 @ X0 )
= $true )
| ( ( 'const/sets/IN' @ sK1 @ ( sK7 @ sK0 @ sK1 @ sK5 @ sK4 @ sK3 @ sK2 ) @ sK3 )
!= $true ) )
| spl8_14 ),
inference(subsumption_resolution,[],[f326,f339]) ).
thf(f339,plain,
( ( ( 'const/sets/IN' @ sK0 @ ( sK6 @ sK0 @ sK1 @ sK5 @ sK4 @ sK3 @ sK2 ) @ sK2 )
!= $true )
| spl8_14 ),
inference(avatar_component_clause,[],[f338]) ).
thf(f326,plain,
! [X0: 'type/nums/num',X1: 'type/nums/num'] :
( ( ( 'const/sets/HAS_SIZE' @ sK0 @ sK2 @ X1 )
= $true )
| ( ( 'const/sets/HAS_SIZE' @ sK1 @ sK3 @ X1 )
= $false )
| ( ( 'const/sets/HAS_SIZE' @ sK0 @ sK2 @ X0 )
= $true )
| ( ( 'const/sets/IN' @ sK1 @ ( sK7 @ sK0 @ sK1 @ sK5 @ sK4 @ sK3 @ sK2 ) @ sK3 )
!= $true )
| ( ( 'const/sets/IN' @ sK0 @ ( sK6 @ sK0 @ sK1 @ sK5 @ sK4 @ sK3 @ sK2 ) @ sK2 )
= $true )
| ( ( 'const/sets/HAS_SIZE' @ sK1 @ sK3 @ X0 )
= $false ) ),
inference(trivial_inequality_removal,[],[f325]) ).
thf(f325,plain,
! [X0: 'type/nums/num',X1: 'type/nums/num'] :
( ( ( 'const/sets/HAS_SIZE' @ sK0 @ sK2 @ X0 )
= $true )
| ( ( 'const/sets/IN' @ sK1 @ ( sK7 @ sK0 @ sK1 @ sK5 @ sK4 @ sK3 @ sK2 ) @ sK3 )
!= $true )
| ( ( 'const/sets/HAS_SIZE' @ sK1 @ sK3 @ X1 )
= $false )
| ( ( 'const/sets/IN' @ sK0 @ ( sK6 @ sK0 @ sK1 @ sK5 @ sK4 @ sK3 @ sK2 ) @ sK2 )
= $true )
| ( $true != $true )
| ( ( 'const/sets/HAS_SIZE' @ sK0 @ sK2 @ X1 )
= $true )
| ( ( 'const/sets/HAS_SIZE' @ sK1 @ sK3 @ X0 )
= $false ) ),
inference(superposition,[],[f112,f29]) ).
thf(f29,plain,
! [X6: sK1] :
( ( ( 'const/sets/IN' @ sK0 @ ( sK5 @ X6 ) @ sK2 )
= $true )
| ( ( 'const/sets/IN' @ sK1 @ X6 @ sK3 )
!= $true ) ),
inference(cnf_transformation,[],[f17]) ).
thf(f17,plain,
( ! [X6: sK1] :
( ( ( ( 'const/sets/IN' @ sK0 @ ( sK5 @ X6 ) @ sK2 )
= $true )
& ( ( sK4 @ ( sK5 @ X6 ) )
= X6 ) )
| ( ( 'const/sets/IN' @ sK1 @ X6 @ sK3 )
!= $true ) )
& ( ( $true
= ( 'const/sets/FINITE' @ sK0 @ sK2 ) )
| ( ( 'const/sets/FINITE' @ sK1 @ sK3 )
= $true ) )
& ( ( 'const/sets/CARD' @ sK1 @ sK3 )
!= ( 'const/sets/CARD' @ sK0 @ sK2 ) )
& ! [X7: sK0] :
( ( ( 'const/sets/IN' @ sK0 @ X7 @ sK2 )
!= $true )
| ( ( ( sK5 @ ( sK4 @ X7 ) )
= X7 )
& ( $true
= ( 'const/sets/IN' @ sK1 @ ( sK4 @ X7 ) @ sK3 ) ) ) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3,sK4,sK5])],[f15,f16]) ).
thf(f16,plain,
( ? [X0: $tType,X1: $tType,X2: X0 > $o,X3: X1 > $o,X4: X0 > X1,X5: X1 > X0] :
( ! [X6: X1] :
( ( ( ( 'const/sets/IN' @ X0 @ ( X5 @ X6 ) @ X2 )
= $true )
& ( ( X4 @ ( X5 @ X6 ) )
= X6 ) )
| ( ( 'const/sets/IN' @ X1 @ X6 @ X3 )
!= $true ) )
& ( ( ( 'const/sets/FINITE' @ X0 @ X2 )
= $true )
| ( $true
= ( 'const/sets/FINITE' @ X1 @ X3 ) ) )
& ( ( 'const/sets/CARD' @ X0 @ X2 )
!= ( 'const/sets/CARD' @ X1 @ X3 ) )
& ! [X7: X0] :
( ( ( 'const/sets/IN' @ X0 @ X7 @ X2 )
!= $true )
| ( ( ( X5 @ ( X4 @ X7 ) )
= X7 )
& ( ( 'const/sets/IN' @ X1 @ ( X4 @ X7 ) @ X3 )
= $true ) ) ) )
=> ( ! [X6: sK1] :
( ( ( ( 'const/sets/IN' @ sK0 @ ( sK5 @ X6 ) @ sK2 )
= $true )
& ( ( sK4 @ ( sK5 @ X6 ) )
= X6 ) )
| ( ( 'const/sets/IN' @ sK1 @ X6 @ sK3 )
!= $true ) )
& ( ( $true
= ( 'const/sets/FINITE' @ sK0 @ sK2 ) )
| ( ( 'const/sets/FINITE' @ sK1 @ sK3 )
= $true ) )
& ( ( 'const/sets/CARD' @ sK1 @ sK3 )
!= ( 'const/sets/CARD' @ sK0 @ sK2 ) )
& ! [X7: sK0] :
( ( ( 'const/sets/IN' @ sK0 @ X7 @ sK2 )
!= $true )
| ( ( ( sK5 @ ( sK4 @ X7 ) )
= X7 )
& ( $true
= ( 'const/sets/IN' @ sK1 @ ( sK4 @ X7 ) @ sK3 ) ) ) ) ) ),
introduced(choice_axiom,[]) ).
thf(f15,plain,
? [X0: $tType,X1: $tType,X2: X0 > $o,X3: X1 > $o,X4: X0 > X1,X5: X1 > X0] :
( ! [X6: X1] :
( ( ( ( 'const/sets/IN' @ X0 @ ( X5 @ X6 ) @ X2 )
= $true )
& ( ( X4 @ ( X5 @ X6 ) )
= X6 ) )
| ( ( 'const/sets/IN' @ X1 @ X6 @ X3 )
!= $true ) )
& ( ( ( 'const/sets/FINITE' @ X0 @ X2 )
= $true )
| ( $true
= ( 'const/sets/FINITE' @ X1 @ X3 ) ) )
& ( ( 'const/sets/CARD' @ X0 @ X2 )
!= ( 'const/sets/CARD' @ X1 @ X3 ) )
& ! [X7: X0] :
( ( ( 'const/sets/IN' @ X0 @ X7 @ X2 )
!= $true )
| ( ( ( X5 @ ( X4 @ X7 ) )
= X7 )
& ( ( 'const/sets/IN' @ X1 @ ( X4 @ X7 ) @ X3 )
= $true ) ) ) ),
inference(flattening,[],[f14]) ).
thf(f14,plain,
? [X0: $tType,X1: $tType,X2: X0 > $o,X3: X1 > $o,X4: X0 > X1,X5: X1 > X0] :
( ( ( 'const/sets/CARD' @ X0 @ X2 )
!= ( 'const/sets/CARD' @ X1 @ X3 ) )
& ! [X6: X1] :
( ( ( ( 'const/sets/IN' @ X0 @ ( X5 @ X6 ) @ X2 )
= $true )
& ( ( X4 @ ( X5 @ X6 ) )
= X6 ) )
| ( ( 'const/sets/IN' @ X1 @ X6 @ X3 )
!= $true ) )
& ! [X7: X0] :
( ( ( 'const/sets/IN' @ X0 @ X7 @ X2 )
!= $true )
| ( ( ( X5 @ ( X4 @ X7 ) )
= X7 )
& ( ( 'const/sets/IN' @ X1 @ ( X4 @ X7 ) @ X3 )
= $true ) ) )
& ( ( ( 'const/sets/FINITE' @ X0 @ X2 )
= $true )
| ( $true
= ( 'const/sets/FINITE' @ X1 @ X3 ) ) ) ),
inference(ennf_transformation,[],[f11]) ).
thf(f11,plain,
~ ! [X0: $tType,X1: $tType,X2: X0 > $o,X3: X1 > $o,X4: X0 > X1,X5: X1 > X0] :
( ( ! [X6: X1] :
( ( ( 'const/sets/IN' @ X1 @ X6 @ X3 )
= $true )
=> ( ( ( 'const/sets/IN' @ X0 @ ( X5 @ X6 ) @ X2 )
= $true )
& ( ( X4 @ ( X5 @ X6 ) )
= X6 ) ) )
& ! [X7: X0] :
( ( ( 'const/sets/IN' @ X0 @ X7 @ X2 )
= $true )
=> ( ( ( X5 @ ( X4 @ X7 ) )
= X7 )
& ( ( 'const/sets/IN' @ X1 @ ( X4 @ X7 ) @ X3 )
= $true ) ) )
& ( ( ( 'const/sets/FINITE' @ X0 @ X2 )
= $true )
| ( $true
= ( 'const/sets/FINITE' @ X1 @ X3 ) ) ) )
=> ( ( 'const/sets/CARD' @ X0 @ X2 )
= ( 'const/sets/CARD' @ X1 @ X3 ) ) ),
inference(fool_elimination,[],[f10]) ).
thf(f10,plain,
~ ! [X0: $tType,X1: $tType,X2: X0 > $o,X3: X1 > $o,X4: X0 > X1,X5: X1 > X0] :
( ( ! [X6: X1] :
( ( 'const/sets/IN' @ X1 @ X6 @ X3 )
=> ( ( ( X4 @ ( X5 @ X6 ) )
= X6 )
& ( 'const/sets/IN' @ X0 @ ( X5 @ X6 ) @ X2 ) ) )
& ! [X7: X0] :
( ( 'const/sets/IN' @ X0 @ X7 @ X2 )
=> ( ( 'const/sets/IN' @ X1 @ ( X4 @ X7 ) @ X3 )
& ( ( X5 @ ( X4 @ X7 ) )
= X7 ) ) )
& ( ( 'const/sets/FINITE' @ X0 @ X2 )
| ( 'const/sets/FINITE' @ X1 @ X3 ) ) )
=> ( ( 'const/sets/CARD' @ X0 @ X2 )
= ( 'const/sets/CARD' @ X1 @ X3 ) ) ),
inference(rectify,[],[f4]) ).
thf(f4,negated_conjecture,
~ ! [X0: $tType,X3: $tType,X1: X0 > $o,X2: X3 > $o,X4: X0 > X3,X5: X3 > X0] :
( ( ! [X6: X3] :
( ( 'const/sets/IN' @ X3 @ X6 @ X2 )
=> ( ( ( X4 @ ( X5 @ X6 ) )
= X6 )
& ( 'const/sets/IN' @ X0 @ ( X5 @ X6 ) @ X1 ) ) )
& ! [X6: X0] :
( ( 'const/sets/IN' @ X0 @ X6 @ X1 )
=> ( ( 'const/sets/IN' @ X3 @ ( X4 @ X6 ) @ X2 )
& ( ( X5 @ ( X4 @ X6 ) )
= X6 ) ) )
& ( ( 'const/sets/FINITE' @ X0 @ X1 )
| ( 'const/sets/FINITE' @ X3 @ X2 ) ) )
=> ( ( 'const/sets/CARD' @ X0 @ X1 )
= ( 'const/sets/CARD' @ X3 @ X2 ) ) ),
inference(negated_conjecture,[],[f3]) ).
thf(f3,conjecture,
! [X0: $tType,X3: $tType,X1: X0 > $o,X2: X3 > $o,X4: X0 > X3,X5: X3 > X0] :
( ( ! [X6: X3] :
( ( 'const/sets/IN' @ X3 @ X6 @ X2 )
=> ( ( ( X4 @ ( X5 @ X6 ) )
= X6 )
& ( 'const/sets/IN' @ X0 @ ( X5 @ X6 ) @ X1 ) ) )
& ! [X6: X0] :
( ( 'const/sets/IN' @ X0 @ X6 @ X1 )
=> ( ( 'const/sets/IN' @ X3 @ ( X4 @ X6 ) @ X2 )
& ( ( X5 @ ( X4 @ X6 ) )
= X6 ) ) )
& ( ( 'const/sets/FINITE' @ X0 @ X1 )
| ( 'const/sets/FINITE' @ X3 @ X2 ) ) )
=> ( ( 'const/sets/CARD' @ X0 @ X1 )
= ( 'const/sets/CARD' @ X3 @ X2 ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p','thm/sets/BIJECTIONS_CARD_EQ_') ).
thf(f112,plain,
! [X2: 'type/nums/num',X0: sK0 > $o,X1: 'type/nums/num'] :
( ( ( 'const/sets/IN' @ sK0 @ ( sK5 @ ( sK7 @ sK0 @ sK1 @ sK5 @ sK4 @ sK3 @ X0 ) ) @ X0 )
!= $true )
| ( ( 'const/sets/HAS_SIZE' @ sK1 @ sK3 @ X2 )
= $false )
| ( ( 'const/sets/HAS_SIZE' @ sK1 @ sK3 @ X1 )
= $false )
| ( $true
= ( 'const/sets/HAS_SIZE' @ sK0 @ X0 @ X2 ) )
| ( $true
= ( 'const/sets/HAS_SIZE' @ sK0 @ X0 @ X1 ) )
| ( ( 'const/sets/IN' @ sK0 @ ( sK6 @ sK0 @ sK1 @ sK5 @ sK4 @ sK3 @ X0 ) @ X0 )
= $true ) ),
inference(binary_proxy_clausification,[],[f110]) ).
thf(f110,plain,
! [X2: 'type/nums/num',X0: sK0 > $o,X1: 'type/nums/num'] :
( ( ( 'const/sets/HAS_SIZE' @ sK1 @ sK3 @ X2 )
= $false )
| ( ( 'const/sets/HAS_SIZE' @ sK1 @ sK3 @ X1 )
= ( 'const/sets/HAS_SIZE' @ sK0 @ X0 @ X1 ) )
| ( ( 'const/sets/IN' @ sK0 @ ( sK5 @ ( sK7 @ sK0 @ sK1 @ sK5 @ sK4 @ sK3 @ X0 ) ) @ X0 )
!= $true )
| ( ( 'const/sets/IN' @ sK0 @ ( sK6 @ sK0 @ sK1 @ sK5 @ sK4 @ sK3 @ X0 ) @ X0 )
= $true )
| ( $true
= ( 'const/sets/HAS_SIZE' @ sK0 @ X0 @ X2 ) ) ),
inference(trivial_inequality_removal,[],[f109]) ).
thf(f109,plain,
! [X2: 'type/nums/num',X0: sK0 > $o,X1: 'type/nums/num'] :
( ( $true
= ( 'const/sets/HAS_SIZE' @ sK0 @ X0 @ X2 ) )
| ( ( 'const/sets/HAS_SIZE' @ sK1 @ sK3 @ X2 )
= $false )
| ( ( 'const/sets/IN' @ sK0 @ ( sK5 @ ( sK7 @ sK0 @ sK1 @ sK5 @ sK4 @ sK3 @ X0 ) ) @ X0 )
!= $true )
| ( ( sK7 @ sK0 @ sK1 @ sK5 @ sK4 @ sK3 @ X0 )
!= ( sK7 @ sK0 @ sK1 @ sK5 @ sK4 @ sK3 @ X0 ) )
| ( ( 'const/sets/IN' @ sK0 @ ( sK6 @ sK0 @ sK1 @ sK5 @ sK4 @ sK3 @ X0 ) @ X0 )
= $true )
| ( ( 'const/sets/HAS_SIZE' @ sK1 @ sK3 @ X1 )
= ( 'const/sets/HAS_SIZE' @ sK0 @ X0 @ X1 ) ) ),
inference(duplicate_literal_removal,[],[f105]) ).
thf(f105,plain,
! [X2: 'type/nums/num',X0: sK0 > $o,X1: 'type/nums/num'] :
( ( ( 'const/sets/IN' @ sK0 @ ( sK6 @ sK0 @ sK1 @ sK5 @ sK4 @ sK3 @ X0 ) @ X0 )
= $true )
| ( $true
= ( 'const/sets/HAS_SIZE' @ sK0 @ X0 @ X2 ) )
| ( ( sK7 @ sK0 @ sK1 @ sK5 @ sK4 @ sK3 @ X0 )
!= ( sK7 @ sK0 @ sK1 @ sK5 @ sK4 @ sK3 @ X0 ) )
| ( ( 'const/sets/HAS_SIZE' @ sK1 @ sK3 @ X2 )
= $false )
| ( ( 'const/sets/IN' @ sK0 @ ( sK5 @ ( sK7 @ sK0 @ sK1 @ sK5 @ sK4 @ sK3 @ X0 ) ) @ X0 )
!= $true )
| ( ( 'const/sets/IN' @ sK0 @ ( sK6 @ sK0 @ sK1 @ sK5 @ sK4 @ sK3 @ X0 ) @ X0 )
= $true )
| ( ( 'const/sets/HAS_SIZE' @ sK1 @ sK3 @ X1 )
= ( 'const/sets/HAS_SIZE' @ sK0 @ X0 @ X1 ) ) ),
inference(superposition,[],[f36,f53]) ).
thf(f53,plain,
! [X0: $tType,X2: X0 > sK1,X3: X0 > $o,X1: sK1 > X0,X4: 'type/nums/num'] :
( ( ( sK7 @ X0 @ sK1 @ X1 @ X2 @ sK3 @ X3 )
= ( sK4 @ ( sK5 @ ( sK7 @ X0 @ sK1 @ X1 @ X2 @ sK3 @ X3 ) ) ) )
| ( ( 'const/sets/IN' @ X0 @ ( sK6 @ X0 @ sK1 @ X1 @ X2 @ sK3 @ X3 ) @ X3 )
= $true )
| ( ( 'const/sets/HAS_SIZE' @ sK1 @ sK3 @ X4 )
= $false )
| ( ( 'const/sets/HAS_SIZE' @ X0 @ X3 @ X4 )
= $true ) ),
inference(binary_proxy_clausification,[],[f52]) ).
thf(f52,plain,
! [X0: $tType,X2: X0 > sK1,X3: X0 > $o,X1: sK1 > X0,X4: 'type/nums/num'] :
( ( ( 'const/sets/HAS_SIZE' @ X0 @ X3 @ X4 )
= ( 'const/sets/HAS_SIZE' @ sK1 @ sK3 @ X4 ) )
| ( ( sK7 @ X0 @ sK1 @ X1 @ X2 @ sK3 @ X3 )
= ( sK4 @ ( sK5 @ ( sK7 @ X0 @ sK1 @ X1 @ X2 @ sK3 @ X3 ) ) ) )
| ( ( 'const/sets/IN' @ X0 @ ( sK6 @ X0 @ sK1 @ X1 @ X2 @ sK3 @ X3 ) @ X3 )
= $true ) ),
inference(trivial_inequality_removal,[],[f51]) ).
thf(f51,plain,
! [X0: $tType,X2: X0 > sK1,X3: X0 > $o,X1: sK1 > X0,X4: 'type/nums/num'] :
( ( ( 'const/sets/IN' @ X0 @ ( sK6 @ X0 @ sK1 @ X1 @ X2 @ sK3 @ X3 ) @ X3 )
= $true )
| ( $true != $true )
| ( ( sK7 @ X0 @ sK1 @ X1 @ X2 @ sK3 @ X3 )
= ( sK4 @ ( sK5 @ ( sK7 @ X0 @ sK1 @ X1 @ X2 @ sK3 @ X3 ) ) ) )
| ( ( 'const/sets/HAS_SIZE' @ X0 @ X3 @ X4 )
= ( 'const/sets/HAS_SIZE' @ sK1 @ sK3 @ X4 ) ) ),
inference(superposition,[],[f28,f35]) ).
thf(f35,plain,
! [X1: $tType,X0: $tType,X2: X0 > $o,X3: X1 > $o,X7: 'type/nums/num',X4: X0 > X1,X5: X1 > X0] :
( ( ( 'const/sets/IN' @ X1 @ ( sK7 @ X0 @ X1 @ X5 @ X4 @ X3 @ X2 ) @ X3 )
= $true )
| ( ( 'const/sets/HAS_SIZE' @ X1 @ X3 @ X7 )
= ( 'const/sets/HAS_SIZE' @ X0 @ X2 @ X7 ) )
| ( ( 'const/sets/IN' @ X0 @ ( sK6 @ X0 @ X1 @ X5 @ X4 @ X3 @ X2 ) @ X2 )
= $true ) ),
inference(cnf_transformation,[],[f23]) ).
thf(f23,plain,
! [X0: $tType,X1: $tType,X2: X0 > $o,X3: X1 > $o,X4: X0 > X1,X5: X1 > X0] :
( ( ( ( 'const/sets/IN' @ X0 @ ( sK6 @ X0 @ X1 @ X5 @ X4 @ X3 @ X2 ) @ X2 )
= $true )
& ( ( ( X5 @ ( X4 @ ( sK6 @ X0 @ X1 @ X5 @ X4 @ X3 @ X2 ) ) )
!= ( sK6 @ X0 @ X1 @ X5 @ X4 @ X3 @ X2 ) )
| ( ( 'const/sets/IN' @ X1 @ ( X4 @ ( sK6 @ X0 @ X1 @ X5 @ X4 @ X3 @ X2 ) ) @ X3 )
!= $true ) ) )
| ! [X7: 'type/nums/num'] :
( ( 'const/sets/HAS_SIZE' @ X1 @ X3 @ X7 )
= ( 'const/sets/HAS_SIZE' @ X0 @ X2 @ X7 ) )
| ( ( ( ( 'const/sets/IN' @ X0 @ ( X5 @ ( sK7 @ X0 @ X1 @ X5 @ X4 @ X3 @ X2 ) ) @ X2 )
!= $true )
| ( ( sK7 @ X0 @ X1 @ X5 @ X4 @ X3 @ X2 )
!= ( X4 @ ( X5 @ ( sK7 @ X0 @ X1 @ X5 @ X4 @ X3 @ X2 ) ) ) ) )
& ( ( 'const/sets/IN' @ X1 @ ( sK7 @ X0 @ X1 @ X5 @ X4 @ X3 @ X2 ) @ X3 )
= $true ) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK6,sK7])],[f20,f22,f21]) ).
thf(f21,plain,
! [X1: $tType,X0: $tType,X2: X0 > $o,X3: X1 > $o,X4: X0 > X1,X5: X1 > X0] :
( ? [X6: X0] :
( ( ( 'const/sets/IN' @ X0 @ X6 @ X2 )
= $true )
& ( ( ( X5 @ ( X4 @ X6 ) )
!= X6 )
| ( $true
!= ( 'const/sets/IN' @ X1 @ ( X4 @ X6 ) @ X3 ) ) ) )
=> ( ( ( 'const/sets/IN' @ X0 @ ( sK6 @ X0 @ X1 @ X5 @ X4 @ X3 @ X2 ) @ X2 )
= $true )
& ( ( ( X5 @ ( X4 @ ( sK6 @ X0 @ X1 @ X5 @ X4 @ X3 @ X2 ) ) )
!= ( sK6 @ X0 @ X1 @ X5 @ X4 @ X3 @ X2 ) )
| ( ( 'const/sets/IN' @ X1 @ ( X4 @ ( sK6 @ X0 @ X1 @ X5 @ X4 @ X3 @ X2 ) ) @ X3 )
!= $true ) ) ) ),
introduced(choice_axiom,[]) ).
thf(f22,plain,
! [X1: $tType,X0: $tType,X2: X0 > $o,X3: X1 > $o,X4: X0 > X1,X5: X1 > X0] :
( ? [X8: X1] :
( ( ( $true
!= ( 'const/sets/IN' @ X0 @ ( X5 @ X8 ) @ X2 ) )
| ( ( X4 @ ( X5 @ X8 ) )
!= X8 ) )
& ( ( 'const/sets/IN' @ X1 @ X8 @ X3 )
= $true ) )
=> ( ( ( ( 'const/sets/IN' @ X0 @ ( X5 @ ( sK7 @ X0 @ X1 @ X5 @ X4 @ X3 @ X2 ) ) @ X2 )
!= $true )
| ( ( sK7 @ X0 @ X1 @ X5 @ X4 @ X3 @ X2 )
!= ( X4 @ ( X5 @ ( sK7 @ X0 @ X1 @ X5 @ X4 @ X3 @ X2 ) ) ) ) )
& ( ( 'const/sets/IN' @ X1 @ ( sK7 @ X0 @ X1 @ X5 @ X4 @ X3 @ X2 ) @ X3 )
= $true ) ) ),
introduced(choice_axiom,[]) ).
thf(f20,plain,
! [X0: $tType,X1: $tType,X2: X0 > $o,X3: X1 > $o,X4: X0 > X1,X5: X1 > X0] :
( ? [X6: X0] :
( ( ( 'const/sets/IN' @ X0 @ X6 @ X2 )
= $true )
& ( ( ( X5 @ ( X4 @ X6 ) )
!= X6 )
| ( $true
!= ( 'const/sets/IN' @ X1 @ ( X4 @ X6 ) @ X3 ) ) ) )
| ! [X7: 'type/nums/num'] :
( ( 'const/sets/HAS_SIZE' @ X1 @ X3 @ X7 )
= ( 'const/sets/HAS_SIZE' @ X0 @ X2 @ X7 ) )
| ? [X8: X1] :
( ( ( $true
!= ( 'const/sets/IN' @ X0 @ ( X5 @ X8 ) @ X2 ) )
| ( ( X4 @ ( X5 @ X8 ) )
!= X8 ) )
& ( ( 'const/sets/IN' @ X1 @ X8 @ X3 )
= $true ) ) ),
inference(rectify,[],[f13]) ).
thf(f13,plain,
! [X0: $tType,X1: $tType,X2: X0 > $o,X3: X1 > $o,X4: X0 > X1,X5: X1 > X0] :
( ? [X7: X0] :
( ( ( 'const/sets/IN' @ X0 @ X7 @ X2 )
= $true )
& ( ( ( X5 @ ( X4 @ X7 ) )
!= X7 )
| ( ( 'const/sets/IN' @ X1 @ ( X4 @ X7 ) @ X3 )
!= $true ) ) )
| ! [X8: 'type/nums/num'] :
( ( 'const/sets/HAS_SIZE' @ X1 @ X3 @ X8 )
= ( 'const/sets/HAS_SIZE' @ X0 @ X2 @ X8 ) )
| ? [X6: X1] :
( ( ( ( 'const/sets/IN' @ X0 @ ( X5 @ X6 ) @ X2 )
!= $true )
| ( ( X4 @ ( X5 @ X6 ) )
!= X6 ) )
& ( ( 'const/sets/IN' @ X1 @ X6 @ X3 )
= $true ) ) ),
inference(flattening,[],[f12]) ).
thf(f12,plain,
! [X0: $tType,X1: $tType,X2: X0 > $o,X3: X1 > $o,X4: X0 > X1,X5: X1 > X0] :
( ! [X8: 'type/nums/num'] :
( ( 'const/sets/HAS_SIZE' @ X1 @ X3 @ X8 )
= ( 'const/sets/HAS_SIZE' @ X0 @ X2 @ X8 ) )
| ? [X6: X1] :
( ( ( ( 'const/sets/IN' @ X0 @ ( X5 @ X6 ) @ X2 )
!= $true )
| ( ( X4 @ ( X5 @ X6 ) )
!= X6 ) )
& ( ( 'const/sets/IN' @ X1 @ X6 @ X3 )
= $true ) )
| ? [X7: X0] :
( ( ( 'const/sets/IN' @ X0 @ X7 @ X2 )
= $true )
& ( ( ( X5 @ ( X4 @ X7 ) )
!= X7 )
| ( ( 'const/sets/IN' @ X1 @ ( X4 @ X7 ) @ X3 )
!= $true ) ) ) ),
inference(ennf_transformation,[],[f7]) ).
thf(f7,plain,
! [X0: $tType,X1: $tType,X2: X0 > $o,X3: X1 > $o,X4: X0 > X1,X5: X1 > X0] :
( ( ! [X6: X1] :
( ( ( 'const/sets/IN' @ X1 @ X6 @ X3 )
= $true )
=> ( ( ( 'const/sets/IN' @ X0 @ ( X5 @ X6 ) @ X2 )
= $true )
& ( ( X4 @ ( X5 @ X6 ) )
= X6 ) ) )
& ! [X7: X0] :
( ( ( 'const/sets/IN' @ X0 @ X7 @ X2 )
= $true )
=> ( ( ( X5 @ ( X4 @ X7 ) )
= X7 )
& ( ( 'const/sets/IN' @ X1 @ ( X4 @ X7 ) @ X3 )
= $true ) ) ) )
=> ! [X8: 'type/nums/num'] :
( ( 'const/sets/HAS_SIZE' @ X1 @ X3 @ X8 )
= ( 'const/sets/HAS_SIZE' @ X0 @ X2 @ X8 ) ) ),
inference(fool_elimination,[],[f6]) ).
thf(f6,plain,
! [X0: $tType,X1: $tType,X2: X0 > $o,X3: X1 > $o,X4: X0 > X1,X5: X1 > X0] :
( ( ! [X6: X1] :
( ( 'const/sets/IN' @ X1 @ X6 @ X3 )
=> ( ( ( X4 @ ( X5 @ X6 ) )
= X6 )
& ( 'const/sets/IN' @ X0 @ ( X5 @ X6 ) @ X2 ) ) )
& ! [X7: X0] :
( ( 'const/sets/IN' @ X0 @ X7 @ X2 )
=> ( ( ( X5 @ ( X4 @ X7 ) )
= X7 )
& ( 'const/sets/IN' @ X1 @ ( X4 @ X7 ) @ X3 ) ) ) )
=> ! [X8: 'type/nums/num'] :
( ( 'const/sets/HAS_SIZE' @ X1 @ X3 @ X8 )
= ( 'const/sets/HAS_SIZE' @ X0 @ X2 @ X8 ) ) ),
inference(rectify,[],[f2]) ).
thf(f2,axiom,
! [X0: $tType,X3: $tType,X1: X0 > $o,X2: X3 > $o,X4: X0 > X3,X5: X3 > X0] :
( ( ! [X6: X3] :
( ( 'const/sets/IN' @ X3 @ X6 @ X2 )
=> ( ( ( X4 @ ( X5 @ X6 ) )
= X6 )
& ( 'const/sets/IN' @ X0 @ ( X5 @ X6 ) @ X1 ) ) )
& ! [X6: X0] :
( ( 'const/sets/IN' @ X0 @ X6 @ X1 )
=> ( ( ( X5 @ ( X4 @ X6 ) )
= X6 )
& ( 'const/sets/IN' @ X3 @ ( X4 @ X6 ) @ X2 ) ) ) )
=> ! [X6: 'type/nums/num'] :
( ( 'const/sets/HAS_SIZE' @ X0 @ X1 @ X6 )
= ( 'const/sets/HAS_SIZE' @ X3 @ X2 @ X6 ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p','thm/sets/BIJECTIONS_HAS_SIZE_EQ_') ).
thf(f28,plain,
! [X6: sK1] :
( ( ( 'const/sets/IN' @ sK1 @ X6 @ sK3 )
!= $true )
| ( ( sK4 @ ( sK5 @ X6 ) )
= X6 ) ),
inference(cnf_transformation,[],[f17]) ).
thf(f36,plain,
! [X1: $tType,X0: $tType,X2: X0 > $o,X3: X1 > $o,X7: 'type/nums/num',X4: X0 > X1,X5: X1 > X0] :
( ( ( sK7 @ X0 @ X1 @ X5 @ X4 @ X3 @ X2 )
!= ( X4 @ ( X5 @ ( sK7 @ X0 @ X1 @ X5 @ X4 @ X3 @ X2 ) ) ) )
| ( ( 'const/sets/HAS_SIZE' @ X1 @ X3 @ X7 )
= ( 'const/sets/HAS_SIZE' @ X0 @ X2 @ X7 ) )
| ( ( 'const/sets/IN' @ X0 @ ( X5 @ ( sK7 @ X0 @ X1 @ X5 @ X4 @ X3 @ X2 ) ) @ X2 )
!= $true )
| ( ( 'const/sets/IN' @ X0 @ ( sK6 @ X0 @ X1 @ X5 @ X4 @ X3 @ X2 ) @ X2 )
= $true ) ),
inference(cnf_transformation,[],[f23]) ).
thf(f474,plain,
( spl8_4
| spl8_13
| spl8_14 ),
inference(avatar_split_clause,[],[f473,f338,f334,f91]) ).
thf(f473,plain,
( ! [X0: 'type/nums/num'] :
( ( ( 'const/sets/HAS_SIZE' @ sK1 @ sK3 @ X0 )
= $false )
| ( ( 'const/sets/HAS_SIZE' @ sK0 @ sK2 @ X0 )
= $true ) )
| spl8_13
| spl8_14 ),
inference(subsumption_resolution,[],[f471,f339]) ).
thf(f471,plain,
( ! [X0: 'type/nums/num'] :
( ( ( 'const/sets/IN' @ sK0 @ ( sK6 @ sK0 @ sK1 @ sK5 @ sK4 @ sK3 @ sK2 ) @ sK2 )
= $true )
| ( ( 'const/sets/HAS_SIZE' @ sK0 @ sK2 @ X0 )
= $true )
| ( ( 'const/sets/HAS_SIZE' @ sK1 @ sK3 @ X0 )
= $false ) )
| spl8_13 ),
inference(binary_proxy_clausification,[],[f470]) ).
thf(f470,plain,
( ! [X0: 'type/nums/num'] :
( ( ( 'const/sets/IN' @ sK0 @ ( sK6 @ sK0 @ sK1 @ sK5 @ sK4 @ sK3 @ sK2 ) @ sK2 )
= $true )
| ( ( 'const/sets/HAS_SIZE' @ sK0 @ sK2 @ X0 )
= ( 'const/sets/HAS_SIZE' @ sK1 @ sK3 @ X0 ) ) )
| spl8_13 ),
inference(trivial_inequality_removal,[],[f469]) ).
thf(f469,plain,
( ! [X0: 'type/nums/num'] :
( ( ( 'const/sets/HAS_SIZE' @ sK0 @ sK2 @ X0 )
= ( 'const/sets/HAS_SIZE' @ sK1 @ sK3 @ X0 ) )
| ( $true != $true )
| ( ( 'const/sets/IN' @ sK0 @ ( sK6 @ sK0 @ sK1 @ sK5 @ sK4 @ sK3 @ sK2 ) @ sK2 )
= $true ) )
| spl8_13 ),
inference(superposition,[],[f336,f35]) ).
thf(f336,plain,
( ( ( 'const/sets/IN' @ sK1 @ ( sK7 @ sK0 @ sK1 @ sK5 @ sK4 @ sK3 @ sK2 ) @ sK3 )
!= $true )
| spl8_13 ),
inference(avatar_component_clause,[],[f334]) ).
thf(f414,plain,
( spl8_4
| spl8_13
| ~ spl8_14
| ~ spl8_15 ),
inference(avatar_split_clause,[],[f413,f365,f338,f334,f91]) ).
thf(f365,plain,
( spl8_15
<=> ( ( 'const/sets/IN' @ sK1 @ ( sK4 @ ( sK6 @ sK0 @ sK1 @ sK5 @ sK4 @ sK3 @ sK2 ) ) @ sK3 )
= $true ) ),
introduced(avatar_definition,[new_symbols(naming,[spl8_15])]) ).
thf(f413,plain,
( ! [X0: 'type/nums/num'] :
( ( ( 'const/sets/IN' @ sK1 @ ( sK7 @ sK0 @ sK1 @ sK5 @ sK4 @ sK3 @ sK2 ) @ sK3 )
= $true )
| ( ( 'const/sets/HAS_SIZE' @ sK0 @ sK2 @ X0 )
= $true )
| ( ( 'const/sets/HAS_SIZE' @ sK1 @ sK3 @ X0 )
= $false ) )
| ~ spl8_14
| ~ spl8_15 ),
inference(subsumption_resolution,[],[f361,f366]) ).
thf(f366,plain,
( ( ( 'const/sets/IN' @ sK1 @ ( sK4 @ ( sK6 @ sK0 @ sK1 @ sK5 @ sK4 @ sK3 @ sK2 ) ) @ sK3 )
= $true )
| ~ spl8_15 ),
inference(avatar_component_clause,[],[f365]) ).
thf(f361,plain,
( ! [X0: 'type/nums/num'] :
( ( ( 'const/sets/HAS_SIZE' @ sK0 @ sK2 @ X0 )
= $true )
| ( ( 'const/sets/IN' @ sK1 @ ( sK7 @ sK0 @ sK1 @ sK5 @ sK4 @ sK3 @ sK2 ) @ sK3 )
= $true )
| ( ( 'const/sets/IN' @ sK1 @ ( sK4 @ ( sK6 @ sK0 @ sK1 @ sK5 @ sK4 @ sK3 @ sK2 ) ) @ sK3 )
!= $true )
| ( ( 'const/sets/HAS_SIZE' @ sK1 @ sK3 @ X0 )
= $false ) )
| ~ spl8_14 ),
inference(binary_proxy_clausification,[],[f360]) ).
thf(f360,plain,
( ! [X0: 'type/nums/num'] :
( ( ( 'const/sets/IN' @ sK1 @ ( sK7 @ sK0 @ sK1 @ sK5 @ sK4 @ sK3 @ sK2 ) @ sK3 )
= $true )
| ( ( 'const/sets/IN' @ sK1 @ ( sK4 @ ( sK6 @ sK0 @ sK1 @ sK5 @ sK4 @ sK3 @ sK2 ) ) @ sK3 )
!= $true )
| ( ( 'const/sets/HAS_SIZE' @ sK0 @ sK2 @ X0 )
= ( 'const/sets/HAS_SIZE' @ sK1 @ sK3 @ X0 ) ) )
| ~ spl8_14 ),
inference(trivial_inequality_removal,[],[f358]) ).
thf(f358,plain,
( ! [X0: 'type/nums/num'] :
( ( ( 'const/sets/IN' @ sK1 @ ( sK7 @ sK0 @ sK1 @ sK5 @ sK4 @ sK3 @ sK2 ) @ sK3 )
= $true )
| ( ( sK6 @ sK0 @ sK1 @ sK5 @ sK4 @ sK3 @ sK2 )
!= ( sK6 @ sK0 @ sK1 @ sK5 @ sK4 @ sK3 @ sK2 ) )
| ( ( 'const/sets/HAS_SIZE' @ sK0 @ sK2 @ X0 )
= ( 'const/sets/HAS_SIZE' @ sK1 @ sK3 @ X0 ) )
| ( ( 'const/sets/IN' @ sK1 @ ( sK4 @ ( sK6 @ sK0 @ sK1 @ sK5 @ sK4 @ sK3 @ sK2 ) ) @ sK3 )
!= $true ) )
| ~ spl8_14 ),
inference(superposition,[],[f33,f352]) ).
thf(f352,plain,
( ( ( sK6 @ sK0 @ sK1 @ sK5 @ sK4 @ sK3 @ sK2 )
= ( sK5 @ ( sK4 @ ( sK6 @ sK0 @ sK1 @ sK5 @ sK4 @ sK3 @ sK2 ) ) ) )
| ~ spl8_14 ),
inference(trivial_inequality_removal,[],[f351]) ).
thf(f351,plain,
( ( ( sK6 @ sK0 @ sK1 @ sK5 @ sK4 @ sK3 @ sK2 )
= ( sK5 @ ( sK4 @ ( sK6 @ sK0 @ sK1 @ sK5 @ sK4 @ sK3 @ sK2 ) ) ) )
| ( $true != $true )
| ~ spl8_14 ),
inference(superposition,[],[f25,f340]) ).
thf(f340,plain,
( ( ( 'const/sets/IN' @ sK0 @ ( sK6 @ sK0 @ sK1 @ sK5 @ sK4 @ sK3 @ sK2 ) @ sK2 )
= $true )
| ~ spl8_14 ),
inference(avatar_component_clause,[],[f338]) ).
thf(f25,plain,
! [X7: sK0] :
( ( ( 'const/sets/IN' @ sK0 @ X7 @ sK2 )
!= $true )
| ( ( sK5 @ ( sK4 @ X7 ) )
= X7 ) ),
inference(cnf_transformation,[],[f17]) ).
thf(f33,plain,
! [X1: $tType,X0: $tType,X2: X0 > $o,X3: X1 > $o,X7: 'type/nums/num',X4: X0 > X1,X5: X1 > X0] :
( ( ( X5 @ ( X4 @ ( sK6 @ X0 @ X1 @ X5 @ X4 @ X3 @ X2 ) ) )
!= ( sK6 @ X0 @ X1 @ X5 @ X4 @ X3 @ X2 ) )
| ( ( 'const/sets/IN' @ X1 @ ( sK7 @ X0 @ X1 @ X5 @ X4 @ X3 @ X2 ) @ X3 )
= $true )
| ( ( 'const/sets/IN' @ X1 @ ( X4 @ ( sK6 @ X0 @ X1 @ X5 @ X4 @ X3 @ X2 ) ) @ X3 )
!= $true )
| ( ( 'const/sets/HAS_SIZE' @ X1 @ X3 @ X7 )
= ( 'const/sets/HAS_SIZE' @ X0 @ X2 @ X7 ) ) ),
inference(cnf_transformation,[],[f23]) ).
thf(f412,plain,
( spl8_4
| ~ spl8_16
| ~ spl8_13
| ~ spl8_14
| ~ spl8_15 ),
inference(avatar_split_clause,[],[f411,f365,f338,f334,f402,f91]) ).
thf(f402,plain,
( spl8_16
<=> ( $true
= ( 'const/sets/IN' @ sK0 @ ( sK5 @ ( sK7 @ sK0 @ sK1 @ sK5 @ sK4 @ sK3 @ sK2 ) ) @ sK2 ) ) ),
introduced(avatar_definition,[new_symbols(naming,[spl8_16])]) ).
thf(f411,plain,
( ! [X0: 'type/nums/num'] :
( ( ( 'const/sets/HAS_SIZE' @ sK0 @ sK2 @ X0 )
= $true )
| ( $true
!= ( 'const/sets/IN' @ sK0 @ ( sK5 @ ( sK7 @ sK0 @ sK1 @ sK5 @ sK4 @ sK3 @ sK2 ) ) @ sK2 ) )
| ( ( 'const/sets/HAS_SIZE' @ sK1 @ sK3 @ X0 )
= $false ) )
| ~ spl8_13
| ~ spl8_14
| ~ spl8_15 ),
inference(subsumption_resolution,[],[f410,f352]) ).
thf(f410,plain,
( ! [X0: 'type/nums/num'] :
( ( $true
!= ( 'const/sets/IN' @ sK0 @ ( sK5 @ ( sK7 @ sK0 @ sK1 @ sK5 @ sK4 @ sK3 @ sK2 ) ) @ sK2 ) )
| ( ( 'const/sets/HAS_SIZE' @ sK1 @ sK3 @ X0 )
= $false )
| ( ( sK6 @ sK0 @ sK1 @ sK5 @ sK4 @ sK3 @ sK2 )
!= ( sK5 @ ( sK4 @ ( sK6 @ sK0 @ sK1 @ sK5 @ sK4 @ sK3 @ sK2 ) ) ) )
| ( ( 'const/sets/HAS_SIZE' @ sK0 @ sK2 @ X0 )
= $true ) )
| ~ spl8_13
| ~ spl8_15 ),
inference(subsumption_resolution,[],[f397,f366]) ).
thf(f397,plain,
( ! [X0: 'type/nums/num'] :
( ( $true
!= ( 'const/sets/IN' @ sK0 @ ( sK5 @ ( sK7 @ sK0 @ sK1 @ sK5 @ sK4 @ sK3 @ sK2 ) ) @ sK2 ) )
| ( ( 'const/sets/HAS_SIZE' @ sK1 @ sK3 @ X0 )
= $false )
| ( ( 'const/sets/IN' @ sK1 @ ( sK4 @ ( sK6 @ sK0 @ sK1 @ sK5 @ sK4 @ sK3 @ sK2 ) ) @ sK3 )
!= $true )
| ( ( 'const/sets/HAS_SIZE' @ sK0 @ sK2 @ X0 )
= $true )
| ( ( sK6 @ sK0 @ sK1 @ sK5 @ sK4 @ sK3 @ sK2 )
!= ( sK5 @ ( sK4 @ ( sK6 @ sK0 @ sK1 @ sK5 @ sK4 @ sK3 @ sK2 ) ) ) ) )
| ~ spl8_13 ),
inference(binary_proxy_clausification,[],[f396]) ).
thf(f396,plain,
( ! [X0: 'type/nums/num'] :
( ( $true
!= ( 'const/sets/IN' @ sK0 @ ( sK5 @ ( sK7 @ sK0 @ sK1 @ sK5 @ sK4 @ sK3 @ sK2 ) ) @ sK2 ) )
| ( ( 'const/sets/HAS_SIZE' @ sK0 @ sK2 @ X0 )
= ( 'const/sets/HAS_SIZE' @ sK1 @ sK3 @ X0 ) )
| ( ( sK6 @ sK0 @ sK1 @ sK5 @ sK4 @ sK3 @ sK2 )
!= ( sK5 @ ( sK4 @ ( sK6 @ sK0 @ sK1 @ sK5 @ sK4 @ sK3 @ sK2 ) ) ) )
| ( ( 'const/sets/IN' @ sK1 @ ( sK4 @ ( sK6 @ sK0 @ sK1 @ sK5 @ sK4 @ sK3 @ sK2 ) ) @ sK3 )
!= $true ) )
| ~ spl8_13 ),
inference(trivial_inequality_removal,[],[f391]) ).
thf(f391,plain,
( ! [X0: 'type/nums/num'] :
( ( ( sK7 @ sK0 @ sK1 @ sK5 @ sK4 @ sK3 @ sK2 )
!= ( sK7 @ sK0 @ sK1 @ sK5 @ sK4 @ sK3 @ sK2 ) )
| ( ( 'const/sets/IN' @ sK1 @ ( sK4 @ ( sK6 @ sK0 @ sK1 @ sK5 @ sK4 @ sK3 @ sK2 ) ) @ sK3 )
!= $true )
| ( ( 'const/sets/HAS_SIZE' @ sK0 @ sK2 @ X0 )
= ( 'const/sets/HAS_SIZE' @ sK1 @ sK3 @ X0 ) )
| ( $true
!= ( 'const/sets/IN' @ sK0 @ ( sK5 @ ( sK7 @ sK0 @ sK1 @ sK5 @ sK4 @ sK3 @ sK2 ) ) @ sK2 ) )
| ( ( sK6 @ sK0 @ sK1 @ sK5 @ sK4 @ sK3 @ sK2 )
!= ( sK5 @ ( sK4 @ ( sK6 @ sK0 @ sK1 @ sK5 @ sK4 @ sK3 @ sK2 ) ) ) ) )
| ~ spl8_13 ),
inference(superposition,[],[f34,f386]) ).
thf(f386,plain,
( ( ( sK4 @ ( sK5 @ ( sK7 @ sK0 @ sK1 @ sK5 @ sK4 @ sK3 @ sK2 ) ) )
= ( sK7 @ sK0 @ sK1 @ sK5 @ sK4 @ sK3 @ sK2 ) )
| ~ spl8_13 ),
inference(trivial_inequality_removal,[],[f385]) ).
thf(f385,plain,
( ( $true != $true )
| ( ( sK4 @ ( sK5 @ ( sK7 @ sK0 @ sK1 @ sK5 @ sK4 @ sK3 @ sK2 ) ) )
= ( sK7 @ sK0 @ sK1 @ sK5 @ sK4 @ sK3 @ sK2 ) )
| ~ spl8_13 ),
inference(superposition,[],[f28,f335]) ).
thf(f335,plain,
( ( ( 'const/sets/IN' @ sK1 @ ( sK7 @ sK0 @ sK1 @ sK5 @ sK4 @ sK3 @ sK2 ) @ sK3 )
= $true )
| ~ spl8_13 ),
inference(avatar_component_clause,[],[f334]) ).
thf(f34,plain,
! [X1: $tType,X0: $tType,X2: X0 > $o,X3: X1 > $o,X7: 'type/nums/num',X4: X0 > X1,X5: X1 > X0] :
( ( ( sK7 @ X0 @ X1 @ X5 @ X4 @ X3 @ X2 )
!= ( X4 @ ( X5 @ ( sK7 @ X0 @ X1 @ X5 @ X4 @ X3 @ X2 ) ) ) )
| ( ( 'const/sets/IN' @ X0 @ ( X5 @ ( sK7 @ X0 @ X1 @ X5 @ X4 @ X3 @ X2 ) ) @ X2 )
!= $true )
| ( ( 'const/sets/HAS_SIZE' @ X1 @ X3 @ X7 )
= ( 'const/sets/HAS_SIZE' @ X0 @ X2 @ X7 ) )
| ( ( 'const/sets/IN' @ X1 @ ( X4 @ ( sK6 @ X0 @ X1 @ X5 @ X4 @ X3 @ X2 ) ) @ X3 )
!= $true )
| ( ( X5 @ ( X4 @ ( sK6 @ X0 @ X1 @ X5 @ X4 @ X3 @ X2 ) ) )
!= ( sK6 @ X0 @ X1 @ X5 @ X4 @ X3 @ X2 ) ) ),
inference(cnf_transformation,[],[f23]) ).
thf(f409,plain,
( ~ spl8_13
| spl8_16 ),
inference(avatar_contradiction_clause,[],[f408]) ).
thf(f408,plain,
( $false
| ~ spl8_13
| spl8_16 ),
inference(subsumption_resolution,[],[f407,f335]) ).
thf(f407,plain,
( ( ( 'const/sets/IN' @ sK1 @ ( sK7 @ sK0 @ sK1 @ sK5 @ sK4 @ sK3 @ sK2 ) @ sK3 )
!= $true )
| spl8_16 ),
inference(trivial_inequality_removal,[],[f406]) ).
thf(f406,plain,
( ( $true != $true )
| ( ( 'const/sets/IN' @ sK1 @ ( sK7 @ sK0 @ sK1 @ sK5 @ sK4 @ sK3 @ sK2 ) @ sK3 )
!= $true )
| spl8_16 ),
inference(superposition,[],[f404,f29]) ).
thf(f404,plain,
( ( $true
!= ( 'const/sets/IN' @ sK0 @ ( sK5 @ ( sK7 @ sK0 @ sK1 @ sK5 @ sK4 @ sK3 @ sK2 ) ) @ sK2 ) )
| spl8_16 ),
inference(avatar_component_clause,[],[f402]) ).
thf(f405,plain,
( spl8_3
| ~ spl8_16
| ~ spl8_13
| ~ spl8_14
| ~ spl8_15 ),
inference(avatar_split_clause,[],[f400,f365,f338,f334,f402,f88]) ).
thf(f88,plain,
( spl8_3
<=> ! [X1: 'type/nums/num'] :
( ( ( 'const/sets/HAS_SIZE' @ sK1 @ sK3 @ X1 )
= $true )
| ( ( 'const/sets/HAS_SIZE' @ sK0 @ sK2 @ X1 )
= $false ) ) ),
introduced(avatar_definition,[new_symbols(naming,[spl8_3])]) ).
thf(f400,plain,
( ! [X0: 'type/nums/num'] :
( ( ( 'const/sets/HAS_SIZE' @ sK0 @ sK2 @ X0 )
= $false )
| ( ( 'const/sets/HAS_SIZE' @ sK1 @ sK3 @ X0 )
= $true )
| ( $true
!= ( 'const/sets/IN' @ sK0 @ ( sK5 @ ( sK7 @ sK0 @ sK1 @ sK5 @ sK4 @ sK3 @ sK2 ) ) @ sK2 ) ) )
| ~ spl8_13
| ~ spl8_14
| ~ spl8_15 ),
inference(subsumption_resolution,[],[f399,f366]) ).
thf(f399,plain,
( ! [X0: 'type/nums/num'] :
( ( ( 'const/sets/IN' @ sK1 @ ( sK4 @ ( sK6 @ sK0 @ sK1 @ sK5 @ sK4 @ sK3 @ sK2 ) ) @ sK3 )
!= $true )
| ( ( 'const/sets/HAS_SIZE' @ sK0 @ sK2 @ X0 )
= $false )
| ( ( 'const/sets/HAS_SIZE' @ sK1 @ sK3 @ X0 )
= $true )
| ( $true
!= ( 'const/sets/IN' @ sK0 @ ( sK5 @ ( sK7 @ sK0 @ sK1 @ sK5 @ sK4 @ sK3 @ sK2 ) ) @ sK2 ) ) )
| ~ spl8_13
| ~ spl8_14 ),
inference(subsumption_resolution,[],[f398,f352]) ).
thf(f398,plain,
( ! [X0: 'type/nums/num'] :
( ( ( 'const/sets/HAS_SIZE' @ sK1 @ sK3 @ X0 )
= $true )
| ( ( sK6 @ sK0 @ sK1 @ sK5 @ sK4 @ sK3 @ sK2 )
!= ( sK5 @ ( sK4 @ ( sK6 @ sK0 @ sK1 @ sK5 @ sK4 @ sK3 @ sK2 ) ) ) )
| ( ( 'const/sets/HAS_SIZE' @ sK0 @ sK2 @ X0 )
= $false )
| ( $true
!= ( 'const/sets/IN' @ sK0 @ ( sK5 @ ( sK7 @ sK0 @ sK1 @ sK5 @ sK4 @ sK3 @ sK2 ) ) @ sK2 ) )
| ( ( 'const/sets/IN' @ sK1 @ ( sK4 @ ( sK6 @ sK0 @ sK1 @ sK5 @ sK4 @ sK3 @ sK2 ) ) @ sK3 )
!= $true ) )
| ~ spl8_13 ),
inference(binary_proxy_clausification,[],[f396]) ).
thf(f384,plain,
( ~ spl8_14
| spl8_15 ),
inference(avatar_contradiction_clause,[],[f383]) ).
thf(f383,plain,
( $false
| ~ spl8_14
| spl8_15 ),
inference(subsumption_resolution,[],[f382,f340]) ).
thf(f382,plain,
( ( ( 'const/sets/IN' @ sK0 @ ( sK6 @ sK0 @ sK1 @ sK5 @ sK4 @ sK3 @ sK2 ) @ sK2 )
!= $true )
| spl8_15 ),
inference(trivial_inequality_removal,[],[f381]) ).
thf(f381,plain,
( ( ( 'const/sets/IN' @ sK0 @ ( sK6 @ sK0 @ sK1 @ sK5 @ sK4 @ sK3 @ sK2 ) @ sK2 )
!= $true )
| ( $true != $true )
| spl8_15 ),
inference(superposition,[],[f367,f24]) ).
thf(f24,plain,
! [X7: sK0] :
( ( $true
= ( 'const/sets/IN' @ sK1 @ ( sK4 @ X7 ) @ sK3 ) )
| ( ( 'const/sets/IN' @ sK0 @ X7 @ sK2 )
!= $true ) ),
inference(cnf_transformation,[],[f17]) ).
thf(f367,plain,
( ( ( 'const/sets/IN' @ sK1 @ ( sK4 @ ( sK6 @ sK0 @ sK1 @ sK5 @ sK4 @ sK3 @ sK2 ) ) @ sK3 )
!= $true )
| spl8_15 ),
inference(avatar_component_clause,[],[f365]) ).
thf(f368,plain,
( ~ spl8_15
| spl8_3
| spl8_13
| ~ spl8_14 ),
inference(avatar_split_clause,[],[f363,f338,f334,f88,f365]) ).
thf(f363,plain,
( ! [X0: 'type/nums/num'] :
( ( ( 'const/sets/HAS_SIZE' @ sK1 @ sK3 @ X0 )
= $true )
| ( ( 'const/sets/HAS_SIZE' @ sK0 @ sK2 @ X0 )
= $false )
| ( ( 'const/sets/IN' @ sK1 @ ( sK4 @ ( sK6 @ sK0 @ sK1 @ sK5 @ sK4 @ sK3 @ sK2 ) ) @ sK3 )
!= $true ) )
| spl8_13
| ~ spl8_14 ),
inference(subsumption_resolution,[],[f362,f336]) ).
thf(f362,plain,
( ! [X0: 'type/nums/num'] :
( ( ( 'const/sets/HAS_SIZE' @ sK0 @ sK2 @ X0 )
= $false )
| ( ( 'const/sets/HAS_SIZE' @ sK1 @ sK3 @ X0 )
= $true )
| ( ( 'const/sets/IN' @ sK1 @ ( sK4 @ ( sK6 @ sK0 @ sK1 @ sK5 @ sK4 @ sK3 @ sK2 ) ) @ sK3 )
!= $true )
| ( ( 'const/sets/IN' @ sK1 @ ( sK7 @ sK0 @ sK1 @ sK5 @ sK4 @ sK3 @ sK2 ) @ sK3 )
= $true ) )
| ~ spl8_14 ),
inference(binary_proxy_clausification,[],[f360]) ).
thf(f350,plain,
( spl8_14
| spl8_3
| spl8_13 ),
inference(avatar_split_clause,[],[f349,f334,f88,f338]) ).
thf(f349,plain,
( ! [X0: 'type/nums/num'] :
( ( ( 'const/sets/HAS_SIZE' @ sK0 @ sK2 @ X0 )
= $false )
| ( ( 'const/sets/HAS_SIZE' @ sK1 @ sK3 @ X0 )
= $true )
| ( ( 'const/sets/IN' @ sK0 @ ( sK6 @ sK0 @ sK1 @ sK5 @ sK4 @ sK3 @ sK2 ) @ sK2 )
= $true ) )
| spl8_13 ),
inference(binary_proxy_clausification,[],[f347]) ).
thf(f347,plain,
( ! [X0: 'type/nums/num'] :
( ( ( 'const/sets/HAS_SIZE' @ sK0 @ sK2 @ X0 )
= ( 'const/sets/HAS_SIZE' @ sK1 @ sK3 @ X0 ) )
| ( ( 'const/sets/IN' @ sK0 @ ( sK6 @ sK0 @ sK1 @ sK5 @ sK4 @ sK3 @ sK2 ) @ sK2 )
= $true ) )
| spl8_13 ),
inference(trivial_inequality_removal,[],[f346]) ).
thf(f346,plain,
( ! [X0: 'type/nums/num'] :
( ( $true != $true )
| ( ( 'const/sets/IN' @ sK0 @ ( sK6 @ sK0 @ sK1 @ sK5 @ sK4 @ sK3 @ sK2 ) @ sK2 )
= $true )
| ( ( 'const/sets/HAS_SIZE' @ sK0 @ sK2 @ X0 )
= ( 'const/sets/HAS_SIZE' @ sK1 @ sK3 @ X0 ) ) )
| spl8_13 ),
inference(superposition,[],[f336,f35]) ).
thf(f341,plain,
( ~ spl8_13
| spl8_14
| spl8_3
| spl8_3 ),
inference(avatar_split_clause,[],[f332,f88,f88,f338,f334]) ).
thf(f332,plain,
! [X0: 'type/nums/num',X1: 'type/nums/num'] :
( ( ( 'const/sets/IN' @ sK1 @ ( sK7 @ sK0 @ sK1 @ sK5 @ sK4 @ sK3 @ sK2 ) @ sK3 )
!= $true )
| ( ( 'const/sets/HAS_SIZE' @ sK1 @ sK3 @ X0 )
= $true )
| ( ( 'const/sets/HAS_SIZE' @ sK1 @ sK3 @ X1 )
= $true )
| ( ( 'const/sets/IN' @ sK0 @ ( sK6 @ sK0 @ sK1 @ sK5 @ sK4 @ sK3 @ sK2 ) @ sK2 )
= $true )
| ( ( 'const/sets/HAS_SIZE' @ sK0 @ sK2 @ X0 )
= $false )
| ( ( 'const/sets/HAS_SIZE' @ sK0 @ sK2 @ X1 )
= $false ) ),
inference(trivial_inequality_removal,[],[f331]) ).
thf(f331,plain,
! [X0: 'type/nums/num',X1: 'type/nums/num'] :
( ( ( 'const/sets/HAS_SIZE' @ sK1 @ sK3 @ X1 )
= $true )
| ( ( 'const/sets/HAS_SIZE' @ sK0 @ sK2 @ X0 )
= $false )
| ( ( 'const/sets/HAS_SIZE' @ sK0 @ sK2 @ X1 )
= $false )
| ( ( 'const/sets/IN' @ sK1 @ ( sK7 @ sK0 @ sK1 @ sK5 @ sK4 @ sK3 @ sK2 ) @ sK3 )
!= $true )
| ( ( 'const/sets/IN' @ sK0 @ ( sK6 @ sK0 @ sK1 @ sK5 @ sK4 @ sK3 @ sK2 ) @ sK2 )
= $true )
| ( ( 'const/sets/HAS_SIZE' @ sK1 @ sK3 @ X0 )
= $true )
| ( $true != $true ) ),
inference(superposition,[],[f125,f29]) ).
thf(f125,plain,
! [X2: 'type/nums/num',X0: sK0 > $o,X1: 'type/nums/num'] :
( ( ( 'const/sets/IN' @ sK0 @ ( sK5 @ ( sK7 @ sK0 @ sK1 @ sK5 @ sK4 @ sK3 @ X0 ) ) @ X0 )
!= $true )
| ( ( 'const/sets/HAS_SIZE' @ sK0 @ X0 @ X2 )
= $false )
| ( ( 'const/sets/HAS_SIZE' @ sK0 @ X0 @ X1 )
= $false )
| ( ( 'const/sets/HAS_SIZE' @ sK1 @ sK3 @ X2 )
= $true )
| ( ( 'const/sets/HAS_SIZE' @ sK1 @ sK3 @ X1 )
= $true )
| ( ( 'const/sets/IN' @ sK0 @ ( sK6 @ sK0 @ sK1 @ sK5 @ sK4 @ sK3 @ X0 ) @ X0 )
= $true ) ),
inference(binary_proxy_clausification,[],[f124]) ).
thf(f124,plain,
! [X2: 'type/nums/num',X0: sK0 > $o,X1: 'type/nums/num'] :
( ( ( 'const/sets/HAS_SIZE' @ sK1 @ sK3 @ X2 )
= $true )
| ( ( 'const/sets/IN' @ sK0 @ ( sK5 @ ( sK7 @ sK0 @ sK1 @ sK5 @ sK4 @ sK3 @ X0 ) ) @ X0 )
!= $true )
| ( ( 'const/sets/HAS_SIZE' @ sK1 @ sK3 @ X1 )
= ( 'const/sets/HAS_SIZE' @ sK0 @ X0 @ X1 ) )
| ( ( 'const/sets/IN' @ sK0 @ ( sK6 @ sK0 @ sK1 @ sK5 @ sK4 @ sK3 @ X0 ) @ X0 )
= $true )
| ( ( 'const/sets/HAS_SIZE' @ sK0 @ X0 @ X2 )
= $false ) ),
inference(trivial_inequality_removal,[],[f123]) ).
thf(f123,plain,
! [X2: 'type/nums/num',X0: sK0 > $o,X1: 'type/nums/num'] :
( ( ( 'const/sets/IN' @ sK0 @ ( sK5 @ ( sK7 @ sK0 @ sK1 @ sK5 @ sK4 @ sK3 @ X0 ) ) @ X0 )
!= $true )
| ( ( 'const/sets/HAS_SIZE' @ sK1 @ sK3 @ X2 )
= $true )
| ( ( 'const/sets/HAS_SIZE' @ sK0 @ X0 @ X2 )
= $false )
| ( ( sK7 @ sK0 @ sK1 @ sK5 @ sK4 @ sK3 @ X0 )
!= ( sK7 @ sK0 @ sK1 @ sK5 @ sK4 @ sK3 @ X0 ) )
| ( ( 'const/sets/IN' @ sK0 @ ( sK6 @ sK0 @ sK1 @ sK5 @ sK4 @ sK3 @ X0 ) @ X0 )
= $true )
| ( ( 'const/sets/HAS_SIZE' @ sK1 @ sK3 @ X1 )
= ( 'const/sets/HAS_SIZE' @ sK0 @ X0 @ X1 ) ) ),
inference(duplicate_literal_removal,[],[f122]) ).
thf(f122,plain,
! [X2: 'type/nums/num',X0: sK0 > $o,X1: 'type/nums/num'] :
( ( ( 'const/sets/IN' @ sK0 @ ( sK5 @ ( sK7 @ sK0 @ sK1 @ sK5 @ sK4 @ sK3 @ X0 ) ) @ X0 )
!= $true )
| ( ( 'const/sets/IN' @ sK0 @ ( sK6 @ sK0 @ sK1 @ sK5 @ sK4 @ sK3 @ X0 ) @ X0 )
= $true )
| ( ( 'const/sets/HAS_SIZE' @ sK1 @ sK3 @ X1 )
= ( 'const/sets/HAS_SIZE' @ sK0 @ X0 @ X1 ) )
| ( ( sK7 @ sK0 @ sK1 @ sK5 @ sK4 @ sK3 @ X0 )
!= ( sK7 @ sK0 @ sK1 @ sK5 @ sK4 @ sK3 @ X0 ) )
| ( ( 'const/sets/HAS_SIZE' @ sK1 @ sK3 @ X2 )
= $true )
| ( ( 'const/sets/HAS_SIZE' @ sK0 @ X0 @ X2 )
= $false )
| ( ( 'const/sets/IN' @ sK0 @ ( sK6 @ sK0 @ sK1 @ sK5 @ sK4 @ sK3 @ X0 ) @ X0 )
= $true ) ),
inference(superposition,[],[f36,f54]) ).
thf(f54,plain,
! [X0: $tType,X2: X0 > sK1,X3: X0 > $o,X1: sK1 > X0,X4: 'type/nums/num'] :
( ( ( sK7 @ X0 @ sK1 @ X1 @ X2 @ sK3 @ X3 )
= ( sK4 @ ( sK5 @ ( sK7 @ X0 @ sK1 @ X1 @ X2 @ sK3 @ X3 ) ) ) )
| ( ( 'const/sets/HAS_SIZE' @ sK1 @ sK3 @ X4 )
= $true )
| ( ( 'const/sets/IN' @ X0 @ ( sK6 @ X0 @ sK1 @ X1 @ X2 @ sK3 @ X3 ) @ X3 )
= $true )
| ( ( 'const/sets/HAS_SIZE' @ X0 @ X3 @ X4 )
= $false ) ),
inference(binary_proxy_clausification,[],[f52]) ).
thf(f249,plain,
( ~ spl8_1
| ~ spl8_4 ),
inference(avatar_contradiction_clause,[],[f248]) ).
thf(f248,plain,
( $false
| ~ spl8_1
| ~ spl8_4 ),
inference(subsumption_resolution,[],[f244,f26]) ).
thf(f26,plain,
( ( 'const/sets/CARD' @ sK1 @ sK3 )
!= ( 'const/sets/CARD' @ sK0 @ sK2 ) ),
inference(cnf_transformation,[],[f17]) ).
thf(f244,plain,
( ( ( 'const/sets/CARD' @ sK1 @ sK3 )
= ( 'const/sets/CARD' @ sK0 @ sK2 ) )
| ~ spl8_1
| ~ spl8_4 ),
inference(trivial_inequality_removal,[],[f242]) ).
thf(f242,plain,
( ( ( 'const/sets/CARD' @ sK1 @ sK3 )
= ( 'const/sets/CARD' @ sK0 @ sK2 ) )
| ( $true != $true )
| ~ spl8_1
| ~ spl8_4 ),
inference(superposition,[],[f32,f238]) ).
thf(f238,plain,
( ( ( 'const/sets/HAS_SIZE' @ sK0 @ sK2 @ ( 'const/sets/CARD' @ sK1 @ sK3 ) )
= $true )
| ~ spl8_1
| ~ spl8_4 ),
inference(subsumption_resolution,[],[f220,f41]) ).
thf(f41,plain,
( ( ( 'const/sets/FINITE' @ sK1 @ sK3 )
= $true )
| ~ spl8_1 ),
inference(avatar_component_clause,[],[f39]) ).
thf(f39,plain,
( spl8_1
<=> ( ( 'const/sets/FINITE' @ sK1 @ sK3 )
= $true ) ),
introduced(avatar_definition,[new_symbols(naming,[spl8_1])]) ).
thf(f220,plain,
( ( ( 'const/sets/HAS_SIZE' @ sK0 @ sK2 @ ( 'const/sets/CARD' @ sK1 @ sK3 ) )
= $true )
| ( ( 'const/sets/FINITE' @ sK1 @ sK3 )
!= $true )
| ~ spl8_4 ),
inference(trivial_inequality_removal,[],[f210]) ).
thf(f210,plain,
( ( $true = $false )
| ( ( 'const/sets/HAS_SIZE' @ sK0 @ sK2 @ ( 'const/sets/CARD' @ sK1 @ sK3 ) )
= $true )
| ( ( 'const/sets/FINITE' @ sK1 @ sK3 )
!= $true )
| ~ spl8_4 ),
inference(superposition,[],[f37,f92]) ).
thf(f92,plain,
( ! [X0: 'type/nums/num'] :
( ( ( 'const/sets/HAS_SIZE' @ sK1 @ sK3 @ X0 )
= $false )
| ( ( 'const/sets/HAS_SIZE' @ sK0 @ sK2 @ X0 )
= $true ) )
| ~ spl8_4 ),
inference(avatar_component_clause,[],[f91]) ).
thf(f37,plain,
! [X0: $tType,X1: X0 > $o] :
( ( ( 'const/sets/HAS_SIZE' @ X0 @ X1 @ ( 'const/sets/CARD' @ X0 @ X1 ) )
= $true )
| ( ( 'const/sets/FINITE' @ X0 @ X1 )
!= $true ) ),
inference(equality_resolution,[],[f30]) ).
thf(f30,plain,
! [X0: $tType,X2: 'type/nums/num',X1: X0 > $o] :
( ( ( 'const/sets/HAS_SIZE' @ X0 @ X1 @ X2 )
= $true )
| ( ( 'const/sets/CARD' @ X0 @ X1 )
!= X2 )
| ( ( 'const/sets/FINITE' @ X0 @ X1 )
!= $true ) ),
inference(cnf_transformation,[],[f19]) ).
thf(f19,plain,
! [X0: $tType,X1: X0 > $o,X2: 'type/nums/num'] :
( ( ( ( ( 'const/sets/CARD' @ X0 @ X1 )
= X2 )
& ( ( 'const/sets/FINITE' @ X0 @ X1 )
= $true ) )
| ( ( 'const/sets/HAS_SIZE' @ X0 @ X1 @ X2 )
!= $true ) )
& ( ( ( 'const/sets/HAS_SIZE' @ X0 @ X1 @ X2 )
= $true )
| ( ( 'const/sets/CARD' @ X0 @ X1 )
!= X2 )
| ( ( 'const/sets/FINITE' @ X0 @ X1 )
!= $true ) ) ),
inference(flattening,[],[f18]) ).
thf(f18,plain,
! [X0: $tType,X1: X0 > $o,X2: 'type/nums/num'] :
( ( ( ( ( 'const/sets/CARD' @ X0 @ X1 )
= X2 )
& ( ( 'const/sets/FINITE' @ X0 @ X1 )
= $true ) )
| ( ( 'const/sets/HAS_SIZE' @ X0 @ X1 @ X2 )
!= $true ) )
& ( ( ( 'const/sets/HAS_SIZE' @ X0 @ X1 @ X2 )
= $true )
| ( ( 'const/sets/CARD' @ X0 @ X1 )
!= X2 )
| ( ( 'const/sets/FINITE' @ X0 @ X1 )
!= $true ) ) ),
inference(nnf_transformation,[],[f9]) ).
thf(f9,plain,
! [X0: $tType,X1: X0 > $o,X2: 'type/nums/num'] :
( ( ( ( 'const/sets/CARD' @ X0 @ X1 )
= X2 )
& ( ( 'const/sets/FINITE' @ X0 @ X1 )
= $true ) )
<=> ( ( 'const/sets/HAS_SIZE' @ X0 @ X1 @ X2 )
= $true ) ),
inference(fool_elimination,[],[f8]) ).
thf(f8,plain,
! [X0: $tType,X1: X0 > $o,X2: 'type/nums/num'] :
( ( ( 'const/sets/HAS_SIZE' @ X0 @ X1 @ X2 )
= ( 'const/sets/FINITE' @ X0 @ X1 ) )
& ( ( 'const/sets/CARD' @ X0 @ X1 )
= X2 ) ),
inference(rectify,[],[f1]) ).
thf(f1,axiom,
! [X0: $tType,X1: X0 > $o,X2: 'type/nums/num'] :
( ( ( 'const/sets/HAS_SIZE' @ X0 @ X1 @ X2 )
= ( 'const/sets/FINITE' @ X0 @ X1 ) )
& ( ( 'const/sets/CARD' @ X0 @ X1 )
= X2 ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p','thm/sets/HAS_SIZE_') ).
thf(f32,plain,
! [X0: $tType,X2: 'type/nums/num',X1: X0 > $o] :
( ( ( 'const/sets/HAS_SIZE' @ X0 @ X1 @ X2 )
!= $true )
| ( ( 'const/sets/CARD' @ X0 @ X1 )
= X2 ) ),
inference(cnf_transformation,[],[f19]) ).
thf(f204,plain,
( ~ spl8_2
| ~ spl8_3 ),
inference(avatar_split_clause,[],[f188,f88,f43]) ).
thf(f43,plain,
( spl8_2
<=> ( $true
= ( 'const/sets/FINITE' @ sK0 @ sK2 ) ) ),
introduced(avatar_definition,[new_symbols(naming,[spl8_2])]) ).
thf(f188,plain,
( ( $true
!= ( 'const/sets/FINITE' @ sK0 @ sK2 ) )
| ~ spl8_3 ),
inference(subsumption_resolution,[],[f179,f26]) ).
thf(f179,plain,
( ( ( 'const/sets/CARD' @ sK1 @ sK3 )
= ( 'const/sets/CARD' @ sK0 @ sK2 ) )
| ( $true
!= ( 'const/sets/FINITE' @ sK0 @ sK2 ) )
| ~ spl8_3 ),
inference(trivial_inequality_removal,[],[f163]) ).
thf(f163,plain,
( ( $true = $false )
| ( ( 'const/sets/CARD' @ sK1 @ sK3 )
= ( 'const/sets/CARD' @ sK0 @ sK2 ) )
| ( $true
!= ( 'const/sets/FINITE' @ sK0 @ sK2 ) )
| ~ spl8_3 ),
inference(superposition,[],[f37,f148]) ).
thf(f148,plain,
( ! [X0: 'type/nums/num'] :
( ( ( 'const/sets/HAS_SIZE' @ sK0 @ sK2 @ X0 )
= $false )
| ( ( 'const/sets/CARD' @ sK1 @ sK3 )
= X0 ) )
| ~ spl8_3 ),
inference(trivial_inequality_removal,[],[f131]) ).
thf(f131,plain,
( ! [X0: 'type/nums/num'] :
( ( $true != $true )
| ( ( 'const/sets/HAS_SIZE' @ sK0 @ sK2 @ X0 )
= $false )
| ( ( 'const/sets/CARD' @ sK1 @ sK3 )
= X0 ) )
| ~ spl8_3 ),
inference(superposition,[],[f32,f89]) ).
thf(f89,plain,
( ! [X1: 'type/nums/num'] :
( ( ( 'const/sets/HAS_SIZE' @ sK1 @ sK3 @ X1 )
= $true )
| ( ( 'const/sets/HAS_SIZE' @ sK0 @ sK2 @ X1 )
= $false ) )
| ~ spl8_3 ),
inference(avatar_component_clause,[],[f88]) ).
thf(f46,plain,
( spl8_1
| spl8_2 ),
inference(avatar_split_clause,[],[f27,f43,f39]) ).
thf(f27,plain,
( ( ( 'const/sets/FINITE' @ sK1 @ sK3 )
= $true )
| ( $true
= ( 'const/sets/FINITE' @ sK0 @ sK2 ) ) ),
inference(cnf_transformation,[],[f17]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : SEV491^1 : TPTP v8.2.0. Released v7.0.0.
% 0.11/0.13 % 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 : n017.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 : Sun May 19 18:45:37 EDT 2024
% 0.13/0.34 % CPUTime :
% 0.13/0.34 This is a TH1_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.36 ipcrm: permission denied for id (1470169090)
% 0.13/0.36 ipcrm: permission denied for id (1472692227)
% 0.13/0.37 ipcrm: permission denied for id (1473183751)
% 0.13/0.37 ipcrm: permission denied for id (1470300170)
% 0.13/0.37 ipcrm: permission denied for id (1470332940)
% 0.13/0.37 ipcrm: permission denied for id (1473806349)
% 0.13/0.38 ipcrm: permission denied for id (1473904655)
% 0.13/0.38 ipcrm: permission denied for id (1470464016)
% 0.13/0.38 ipcrm: permission denied for id (1473937425)
% 0.13/0.38 ipcrm: permission denied for id (1474068499)
% 0.13/0.38 ipcrm: permission denied for id (1470529557)
% 0.13/0.39 ipcrm: permission denied for id (1470595096)
% 0.13/0.39 ipcrm: permission denied for id (1474232346)
% 0.13/0.39 ipcrm: permission denied for id (1474265115)
% 0.13/0.39 ipcrm: permission denied for id (1470660636)
% 0.13/0.39 ipcrm: permission denied for id (1470693406)
% 0.13/0.39 ipcrm: permission denied for id (1474330655)
% 0.13/0.39 ipcrm: permission denied for id (1470758944)
% 0.13/0.40 ipcrm: permission denied for id (1470824481)
% 0.13/0.40 ipcrm: permission denied for id (1474363426)
% 0.13/0.40 ipcrm: permission denied for id (1474396195)
% 0.13/0.40 ipcrm: permission denied for id (1474461733)
% 0.13/0.40 ipcrm: permission denied for id (1470890022)
% 0.13/0.40 ipcrm: permission denied for id (1474494503)
% 0.13/0.41 ipcrm: permission denied for id (1474625579)
% 0.13/0.41 ipcrm: permission denied for id (1474691117)
% 0.13/0.41 ipcrm: permission denied for id (1471021102)
% 0.13/0.41 ipcrm: permission denied for id (1471086641)
% 0.21/0.42 ipcrm: permission denied for id (1474854964)
% 0.21/0.42 ipcrm: permission denied for id (1474887733)
% 0.21/0.42 ipcrm: permission denied for id (1474920502)
% 0.21/0.42 ipcrm: permission denied for id (1475018809)
% 0.21/0.42 ipcrm: permission denied for id (1475051578)
% 0.21/0.43 ipcrm: permission denied for id (1475215421)
% 0.21/0.43 ipcrm: permission denied for id (1475248190)
% 0.21/0.43 ipcrm: permission denied for id (1471414336)
% 0.21/0.43 ipcrm: permission denied for id (1475313729)
% 0.21/0.43 ipcrm: permission denied for id (1475412034)
% 0.21/0.44 ipcrm: permission denied for id (1475510340)
% 0.21/0.44 ipcrm: permission denied for id (1471512645)
% 0.21/0.44 ipcrm: permission denied for id (1475543110)
% 0.21/0.44 ipcrm: permission denied for id (1475674185)
% 0.21/0.44 ipcrm: permission denied for id (1471578188)
% 0.21/0.45 ipcrm: permission denied for id (1471610957)
% 0.21/0.45 ipcrm: permission denied for id (1475805262)
% 0.21/0.45 ipcrm: permission denied for id (1475838031)
% 0.21/0.45 ipcrm: permission denied for id (1475870800)
% 0.21/0.45 ipcrm: permission denied for id (1475969107)
% 0.21/0.45 ipcrm: permission denied for id (1476001876)
% 0.21/0.46 ipcrm: permission denied for id (1476100182)
% 0.21/0.46 ipcrm: permission denied for id (1476132951)
% 0.21/0.46 ipcrm: permission denied for id (1476231258)
% 0.21/0.46 ipcrm: permission denied for id (1471905883)
% 0.21/0.46 ipcrm: permission denied for id (1476264028)
% 0.21/0.46 ipcrm: permission denied for id (1476296797)
% 0.21/0.47 ipcrm: permission denied for id (1476395104)
% 0.21/0.47 ipcrm: permission denied for id (1472036961)
% 0.21/0.47 ipcrm: permission denied for id (1476427874)
% 0.21/0.48 ipcrm: permission denied for id (1476755562)
% 0.21/0.48 ipcrm: permission denied for id (1476788331)
% 0.21/0.48 ipcrm: permission denied for id (1476821100)
% 0.21/0.48 ipcrm: permission denied for id (1476886638)
% 0.21/0.48 ipcrm: permission denied for id (1472299119)
% 0.21/0.49 ipcrm: permission denied for id (1476919408)
% 0.21/0.49 ipcrm: permission denied for id (1476984946)
% 0.21/0.49 ipcrm: permission denied for id (1472364659)
% 0.21/0.49 ipcrm: permission denied for id (1472397428)
% 0.21/0.50 ipcrm: permission denied for id (1477148793)
% 0.21/0.50 ipcrm: permission denied for id (1472528508)
% 0.21/0.50 ipcrm: permission denied for id (1477279870)
% 0.21/0.50 ipcrm: permission denied for id (1477312639)
% 0.21/0.52 % (1975)lrs+10_1:1_bet=on:cnfonf=off:fd=off:hud=5:inj=on:i=3:si=on:rtra=on_0 on theBenchmark for (2998ds/3Mi)
% 0.21/0.52 % (1973)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 (2998ds/275Mi)
% 0.21/0.52 % (1974)lrs+1004_1:128_cond=on:e2e=on:sp=weighted_frequency:i=18:si=on:rtra=on_0 on theBenchmark for (2998ds/18Mi)
% 0.21/0.52 % (1969)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 (2998ds/4Mi)
% 0.21/0.52 % (1970)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 (2998ds/27Mi)
% 0.21/0.52 % (1975)Instruction limit reached!
% 0.21/0.52 % (1975)------------------------------
% 0.21/0.52 % (1975)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.21/0.52 % (1975)Termination reason: Unknown
% 0.21/0.52 % (1975)Termination phase: Preprocessing 3
% 0.21/0.52
% 0.21/0.52 % (1975)Memory used [KB]: 1023
% 0.21/0.52 % (1975)Time elapsed: 0.003 s
% 0.21/0.52 % (1975)Instructions burned: 3 (million)
% 0.21/0.52 % (1975)------------------------------
% 0.21/0.52 % (1975)------------------------------
% 0.21/0.52 % (1969)Instruction limit reached!
% 0.21/0.52 % (1969)------------------------------
% 0.21/0.52 % (1969)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.21/0.52 % (1969)Termination reason: Unknown
% 0.21/0.52 % (1969)Termination phase: Saturation
% 0.21/0.52
% 0.21/0.52 % (1969)Memory used [KB]: 1023
% 0.21/0.52 % (1969)Time elapsed: 0.004 s
% 0.21/0.52 % (1969)Instructions burned: 4 (million)
% 0.21/0.52 % (1969)------------------------------
% 0.21/0.52 % (1969)------------------------------
% 0.21/0.52 % (1972)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 (2998ds/2Mi)
% 0.21/0.52 % (1971)lrs+10_1:1_au=on:inj=on:i=2:si=on:rtra=on_0 on theBenchmark for (2998ds/2Mi)
% 0.21/0.52 % Exception at run slice level
% 0.21/0.52 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.21/0.52 % (1971)Instruction limit reached!
% 0.21/0.52 % (1971)------------------------------
% 0.21/0.52 % (1971)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.21/0.52 % (1971)Termination reason: Unknown
% 0.21/0.52 % (1971)Termination phase: Preprocessing 3
% 0.21/0.52
% 0.21/0.52 % (1971)Memory used [KB]: 895
% 0.21/0.52 % (1971)Time elapsed: 0.003 s
% 0.21/0.52 % (1971)Instructions burned: 2 (million)
% 0.21/0.52 % (1971)------------------------------
% 0.21/0.52 % (1971)------------------------------
% 0.21/0.53 % (1968)lrs+1002_1:8_bd=off:fd=off:hud=10:tnu=1:i=183:si=on:rtra=on_0 on theBenchmark for (2998ds/183Mi)
% 0.21/0.53 % (1974)Instruction limit reached!
% 0.21/0.53 % (1974)------------------------------
% 0.21/0.53 % (1974)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.21/0.53 % (1974)Termination reason: Unknown
% 0.21/0.53 % (1974)Termination phase: Saturation
% 0.21/0.53
% 0.21/0.53 % (1974)Memory used [KB]: 5628
% 0.21/0.53 % (1974)Time elapsed: 0.011 s
% 0.21/0.53 % (1974)Instructions burned: 18 (million)
% 0.21/0.53 % (1974)------------------------------
% 0.21/0.53 % (1974)------------------------------
% 0.21/0.54 % (1976)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 (2998ds/37Mi)
% 0.21/0.54 % Exception at run slice level
% 0.21/0.54 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.21/0.54 % (1978)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 (2998ds/3Mi)
% 0.21/0.54 % (1977)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 (2998ds/15Mi)
% 0.21/0.54 % (1970)Instruction limit reached!
% 0.21/0.54 % (1970)------------------------------
% 0.21/0.54 % (1970)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.21/0.54 % (1970)Termination reason: Unknown
% 0.21/0.54 % (1970)Termination phase: Saturation
% 0.21/0.54
% 0.21/0.54 % (1970)Memory used [KB]: 5628
% 0.21/0.54 % (1970)Time elapsed: 0.022 s
% 0.21/0.54 % (1970)Instructions burned: 27 (million)
% 0.21/0.54 % (1970)------------------------------
% 0.21/0.54 % (1970)------------------------------
% 0.21/0.54 % (1978)Instruction limit reached!
% 0.21/0.54 % (1978)------------------------------
% 0.21/0.54 % (1978)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.21/0.54 % (1978)Termination reason: Unknown
% 0.21/0.54 % (1978)Termination phase: Saturation
% 0.21/0.54
% 0.21/0.54 % (1978)Memory used [KB]: 5500
% 0.21/0.54 % (1978)Time elapsed: 0.004 s
% 0.21/0.54 % (1978)Instructions burned: 3 (million)
% 0.21/0.54 % (1978)------------------------------
% 0.21/0.54 % (1978)------------------------------
% 0.21/0.54 % (1979)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 (2998ds/1041Mi)
% 0.21/0.54 % Exception at run slice level
% 0.21/0.54 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.21/0.55 % (1977)Instruction limit reached!
% 0.21/0.55 % (1977)------------------------------
% 0.21/0.55 % (1977)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.21/0.55 % (1977)Termination reason: Unknown
% 0.21/0.55 % (1977)Termination phase: Saturation
% 0.21/0.55
% 0.21/0.55 % (1977)Memory used [KB]: 5628
% 0.21/0.55 % (1977)Time elapsed: 0.012 s
% 0.21/0.55 % (1977)Instructions burned: 16 (million)
% 0.21/0.55 % (1977)------------------------------
% 0.21/0.55 % (1977)------------------------------
% 0.21/0.55 % (1981)lrs+10_1:1_acc=on:amm=sco:cs=on:tgt=full:i=16:si=on:rtra=on_0 on theBenchmark for (2998ds/16Mi)
% 0.21/0.55 % (1982)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 (2998ds/3Mi)
% 0.21/0.55 % (1982)Instruction limit reached!
% 0.21/0.55 % (1982)------------------------------
% 0.21/0.55 % (1982)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.21/0.55 % (1982)Termination reason: Unknown
% 0.21/0.55 % (1982)Termination phase: Property scanning
% 0.21/0.55
% 0.21/0.55 % (1982)Memory used [KB]: 1023
% 0.21/0.55 % (1982)Time elapsed: 0.003 s
% 0.21/0.55 % (1982)Instructions burned: 3 (million)
% 0.21/0.55 % (1982)------------------------------
% 0.21/0.55 % (1982)------------------------------
% 0.21/0.56 % (1984)lrs+10_1:1_cnfonf=off:cs=on:hud=3:prag=on:sup=off:i=7:si=on:rtra=on_0 on theBenchmark for (2998ds/7Mi)
% 0.21/0.56 % (1983)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 (2998ds/3Mi)
% 0.21/0.56 % (1981)Instruction limit reached!
% 0.21/0.56 % (1981)------------------------------
% 0.21/0.56 % (1981)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.21/0.56 % (1984)Instruction limit reached!
% 0.21/0.56 % (1984)------------------------------
% 0.21/0.56 % (1984)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.21/0.56 % (1984)Termination reason: Unknown
% 0.21/0.56 % (1984)Termination phase: Saturation
% 0.21/0.56
% 0.21/0.56 % (1984)Memory used [KB]: 5500
% 0.21/0.56 % (1984)Time elapsed: 0.006 s
% 0.21/0.56 % (1984)Instructions burned: 7 (million)
% 0.21/0.56 % (1984)------------------------------
% 0.21/0.56 % (1984)------------------------------
% 0.21/0.56 % (1981)Termination reason: Unknown
% 0.21/0.56 % (1981)Termination phase: Saturation
% 0.21/0.56
% 0.21/0.56 % (1981)Memory used [KB]: 5628
% 0.21/0.56 % (1981)Time elapsed: 0.011 s
% 0.21/0.56 % (1981)Instructions burned: 16 (million)
% 0.21/0.56 % (1981)------------------------------
% 0.21/0.56 % (1981)------------------------------
% 0.21/0.56 % (1980)lrs+10_1:1_av=off:chr=on:plsq=on:slsq=on:i=7:si=on:rtra=on_0 on theBenchmark for (2998ds/7Mi)
% 0.21/0.56 % (1983)Instruction limit reached!
% 0.21/0.56 % (1983)------------------------------
% 0.21/0.56 % (1983)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.21/0.56 % (1983)Termination reason: Unknown
% 0.21/0.56 % (1983)Termination phase: Property scanning
% 0.21/0.56
% 0.21/0.56 % (1983)Memory used [KB]: 1023
% 0.21/0.56 % (1983)Time elapsed: 0.003 s
% 0.21/0.56 % (1983)Instructions burned: 5 (million)
% 0.21/0.56 % (1983)------------------------------
% 0.21/0.56 % (1983)------------------------------
% 0.21/0.56 % (1980)Instruction limit reached!
% 0.21/0.56 % (1980)------------------------------
% 0.21/0.56 % (1980)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.21/0.56 % (1980)Termination reason: Unknown
% 0.21/0.56 % (1980)Termination phase: Saturation
% 0.21/0.56
% 0.21/0.56 % (1980)Memory used [KB]: 1023
% 0.21/0.56 % (1980)Time elapsed: 0.005 s
% 0.21/0.56 % (1980)Instructions burned: 7 (million)
% 0.21/0.56 % (1980)------------------------------
% 0.21/0.56 % (1980)------------------------------
% 0.21/0.57 % (1986)dis+1004_1:1_cha=on:cs=on:fe=off:hud=1:i=4:si=on:rtra=on_0 on theBenchmark for (2998ds/4Mi)
% 0.21/0.57 % (1986)Instruction limit reached!
% 0.21/0.57 % (1986)------------------------------
% 0.21/0.57 % (1986)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.21/0.57 % (1986)Termination reason: Unknown
% 0.21/0.57 % (1986)Termination phase: Saturation
% 0.21/0.57
% 0.21/0.57 % (1986)Memory used [KB]: 5500
% 0.21/0.57 % (1986)Time elapsed: 0.004 s
% 0.21/0.57 % (1986)Instructions burned: 5 (million)
% 0.21/0.57 % (1986)------------------------------
% 0.21/0.57 % (1986)------------------------------
% 0.21/0.57 % (1989)lrs+1004_1:1_chr=on:prag=on:i=6:si=on:rtra=on_0 on theBenchmark for (2997ds/6Mi)
% 0.21/0.57 % (1989)Instruction limit reached!
% 0.21/0.57 % (1989)------------------------------
% 0.21/0.57 % (1989)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.21/0.57 % (1989)Termination reason: Unknown
% 0.21/0.57 % (1989)Termination phase: Saturation
% 0.21/0.57
% 0.21/0.57 % (1989)Memory used [KB]: 5500
% 0.21/0.57 % (1989)Time elapsed: 0.004 s
% 0.21/0.57 % (1989)Instructions burned: 7 (million)
% 0.21/0.57 % (1989)------------------------------
% 0.21/0.57 % (1989)------------------------------
% 0.21/0.57 % (1988)lrs+10_1:1_e2e=on:sd=1:sgt=8:ss=axioms:i=710:si=on:rtra=on_0 on theBenchmark for (2997ds/710Mi)
% 0.21/0.58 % (1987)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 (2997ds/18Mi)
% 0.21/0.58 % (1990)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 (2997ds/902Mi)
% 0.21/0.58 % (1991)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 (2997ds/21Mi)
% 0.77/0.58 % (1992)dis+10_1:1_cnfonf=lazy_gen:fe=off:i=5:si=on:rtra=on_0 on theBenchmark for (2997ds/5Mi)
% 0.77/0.58 % Exception at run slice level
% 0.77/0.58 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.77/0.59 % (1987)Instruction limit reached!
% 0.77/0.59 % (1987)------------------------------
% 0.77/0.59 % (1987)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.77/0.59 % (1987)Termination reason: Unknown
% 0.77/0.59 % (1987)Termination phase: Saturation
% 0.77/0.59
% 0.77/0.59 % (1987)Memory used [KB]: 5628
% 0.77/0.59 % (1987)Time elapsed: 0.012 s
% 0.77/0.59 % (1987)Instructions burned: 18 (million)
% 0.77/0.59 % (1987)------------------------------
% 0.77/0.59 % (1987)------------------------------
% 0.77/0.59 % (1985)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 (2998ds/3Mi)
% 0.77/0.59 % Exception at run slice level
% 0.77/0.59 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.77/0.59 % (1991)Instruction limit reached!
% 0.77/0.59 % (1991)------------------------------
% 0.77/0.59 % (1991)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.77/0.59 % (1991)Termination reason: Unknown
% 0.77/0.59 % (1991)Termination phase: Saturation
% 0.77/0.59
% 0.77/0.59 % (1991)Memory used [KB]: 5628
% 0.77/0.59 % (1991)Time elapsed: 0.009 s
% 0.77/0.59 % (1991)Instructions burned: 23 (million)
% 0.77/0.59 % (1991)------------------------------
% 0.77/0.59 % (1991)------------------------------
% 0.77/0.59 % (1993)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 (2997ds/6Mi)
% 0.77/0.59 % Exception at run slice level
% 0.77/0.59 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.77/0.60 % (1994)lrs+1002_1:128_au=on:c=on:fsr=off:piset=equals:i=377:si=on:rtra=on_0 on theBenchmark for (2997ds/377Mi)
% 0.77/0.60 % (1996)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 (2997ds/19Mi)
% 0.77/0.60 % Exception at run slice level
% 0.77/0.60 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.92/0.60 % (1997)lrs+1010_1:1_au=on:s2a=on:sd=1:sgt=50:ss=axioms:i=879:si=on:rtra=on_0 on theBenchmark for (2997ds/879Mi)
% 0.92/0.60 % (1995)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 (2997ds/779Mi)
% 0.92/0.60 % Exception at run slice level
% 0.92/0.60 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.92/0.60 % (1968)Instruction limit reached!
% 0.92/0.60 % (1968)------------------------------
% 0.92/0.60 % (1968)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.92/0.60 % (1968)Termination reason: Unknown
% 0.92/0.60 % (1968)Termination phase: Saturation
% 0.92/0.60
% 0.92/0.60 % (1968)Memory used [KB]: 6652
% 0.92/0.60 % (1968)Time elapsed: 0.079 s
% 0.92/0.60 % (1968)Instructions burned: 184 (million)
% 0.92/0.60 % (1968)------------------------------
% 0.92/0.60 % (1968)------------------------------
% 0.92/0.61 % (1998)dis+1002_1:128_acc=on:er=filter:i=17:si=on:rtra=on_0 on theBenchmark for (2997ds/17Mi)
% 0.92/0.61 % (1973)First to succeed.
% 0.92/0.61 % (1998)Instruction limit reached!
% 0.92/0.61 % (1998)------------------------------
% 0.92/0.61 % (1998)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.92/0.61 % (1998)Termination reason: Unknown
% 0.92/0.61 % (1998)Termination phase: Saturation
% 0.92/0.61
% 0.92/0.61 % (1998)Memory used [KB]: 5628
% 0.92/0.61 % (1998)Time elapsed: 0.007 s
% 0.92/0.61 % (1998)Instructions burned: 17 (million)
% 0.92/0.61 % (1998)------------------------------
% 0.92/0.61 % (1998)------------------------------
% 0.92/0.61 % (1999)ott+21_1:1_apa=on:au=on:cnfonf=off:sos=on:i=3:si=on:rtra=on_0 on theBenchmark for (2997ds/3Mi)
% 0.92/0.61 % (1999)Instruction limit reached!
% 0.92/0.61 % (1999)------------------------------
% 0.92/0.61 % (1999)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.92/0.61 % (1999)Termination reason: Unknown
% 0.92/0.61 % (1999)Termination phase: Property scanning
% 0.92/0.61
% 0.92/0.61 % (1999)Memory used [KB]: 1023
% 0.92/0.61 % (1999)Time elapsed: 0.003 s
% 0.92/0.61 % (1999)Instructions burned: 4 (million)
% 0.92/0.61 % (1999)------------------------------
% 0.92/0.61 % (1999)------------------------------
% 0.92/0.62 % (1973)Refutation found. Thanks to Tanya!
% 0.92/0.62 % SZS status Theorem for theBenchmark
% 0.92/0.62 % SZS output start Proof for theBenchmark
% See solution above
% 0.92/0.62 % (1973)------------------------------
% 0.92/0.62 % (1973)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.92/0.62 % (1973)Termination reason: Refutation
% 0.92/0.62
% 0.92/0.62 % (1973)Memory used [KB]: 6012
% 0.92/0.62 % (1973)Time elapsed: 0.099 s
% 0.92/0.62 % (1973)Instructions burned: 191 (million)
% 0.92/0.62 % (1973)------------------------------
% 0.92/0.62 % (1973)------------------------------
% 0.92/0.62 % (1832)Success in time 0.251 s
% 0.92/0.62 % Vampire---4.8 exiting
%------------------------------------------------------------------------------