TSTP Solution File: ANA069^1 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : ANA069^1 : TPTP v8.2.0. Released v7.0.0.
% Transfm : none
% Format : tptp:raw
% Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% Computer : n010.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Mon May 20 18:40:21 EDT 2024
% Result : Theorem 0.20s 0.37s
% Output : Refutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 21
% Syntax : Number of formulae : 72 ( 2 unt; 12 typ; 0 def)
% Number of atoms : 571 ( 161 equ; 0 cnn)
% Maximal formula atoms : 18 ( 9 avg)
% Number of connectives : 692 ( 109 ~; 94 |; 51 &; 416 @)
% ( 5 <=>; 15 =>; 0 <=; 2 <~>)
% Maximal formula depth : 9 ( 5 avg)
% Number of types : 2 ( 1 usr)
% Number of type conns : 28 ( 28 >; 0 *; 0 +; 0 <<)
% Number of symbols : 17 ( 14 usr; 9 con; 0-3 aty)
% Number of variables : 82 ( 0 ^ 54 !; 24 ?; 82 :)
% ( 4 !>; 0 ?*; 0 @-; 0 @+)
% Comments :
%------------------------------------------------------------------------------
thf(type_def_5,type,
'type/realax/real': $tType ).
thf(func_def_0,type,
'type/realax/real': $tType ).
thf(func_def_1,type,
'const/sets/sup': ( 'type/realax/real' > $o ) > 'type/realax/real' ).
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/EMPTY':
!>[X0: $tType] : ( X0 > $o ) ).
thf(func_def_5,type,
'const/realax/real_le': 'type/realax/real' > 'type/realax/real' > $o ).
thf(func_def_9,type,
sK0: 'type/realax/real' > $o ).
thf(func_def_10,type,
sK1: 'type/realax/real' ).
thf(func_def_11,type,
sK2: 'type/realax/real' ).
thf(func_def_13,type,
ph4:
!>[X0: $tType] : X0 ).
thf(func_def_14,type,
sK5: 'type/realax/real' ).
thf(f98,plain,
$false,
inference(avatar_sat_refutation,[],[f40,f45,f49,f80,f84,f97]) ).
thf(f97,plain,
( spl3_4
| spl3_2 ),
inference(avatar_split_clause,[],[f96,f37,f47]) ).
thf(f47,plain,
( spl3_4
<=> ! [X2: 'type/realax/real'] :
( ( ( 'const/sets/IN' @ 'type/realax/real' @ X2 @ sK0 )
!= $true )
| ( $true
!= ( 'const/realax/real_le' @ sK1 @ X2 ) ) ) ),
introduced(avatar_definition,[new_symbols(naming,[spl3_4])]) ).
thf(f37,plain,
( spl3_2
<=> ( ( 'const/realax/real_le' @ sK1 @ ( 'const/sets/sup' @ sK0 ) )
= $true ) ),
introduced(avatar_definition,[new_symbols(naming,[spl3_2])]) ).
thf(f96,plain,
( ! [X0: 'type/realax/real'] :
( ( $true
!= ( 'const/realax/real_le' @ sK1 @ X0 ) )
| ( $true
!= ( 'const/sets/IN' @ 'type/realax/real' @ X0 @ sK0 ) ) )
| spl3_2 ),
inference(subsumption_resolution,[],[f95,f27]) ).
thf(f27,plain,
( $true
= ( 'const/sets/FINITE' @ 'type/realax/real' @ sK0 ) ),
inference(cnf_transformation,[],[f23]) ).
thf(f23,plain,
( ( ! [X2: 'type/realax/real'] :
( ( $true
!= ( 'const/realax/real_le' @ sK1 @ X2 ) )
| ( ( 'const/sets/IN' @ 'type/realax/real' @ X2 @ sK0 )
!= $true ) )
| ( ( 'const/realax/real_le' @ sK1 @ ( 'const/sets/sup' @ sK0 ) )
!= $true ) )
& ( ( ( ( 'const/realax/real_le' @ sK1 @ sK2 )
= $true )
& ( ( 'const/sets/IN' @ 'type/realax/real' @ sK2 @ sK0 )
= $true ) )
| ( ( 'const/realax/real_le' @ sK1 @ ( 'const/sets/sup' @ sK0 ) )
= $true ) )
& ( $true
= ( 'const/sets/FINITE' @ 'type/realax/real' @ sK0 ) )
& ( 'const/sets/EMPTY' @ ( 'type/realax/real' != sK0 ) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2])],[f20,f22,f21]) ).
thf(f21,plain,
( ? [X0: 'type/realax/real' > $o,X1: 'type/realax/real'] :
( ( ! [X2: 'type/realax/real'] :
( ( ( 'const/realax/real_le' @ X1 @ X2 )
!= $true )
| ( ( 'const/sets/IN' @ 'type/realax/real' @ X2 @ X0 )
!= $true ) )
| ( ( 'const/realax/real_le' @ X1 @ ( 'const/sets/sup' @ X0 ) )
!= $true ) )
& ( ? [X3: 'type/realax/real'] :
( ( $true
= ( 'const/realax/real_le' @ X1 @ X3 ) )
& ( $true
= ( 'const/sets/IN' @ 'type/realax/real' @ X3 @ X0 ) ) )
| ( ( 'const/realax/real_le' @ X1 @ ( 'const/sets/sup' @ X0 ) )
= $true ) )
& ( ( 'const/sets/FINITE' @ 'type/realax/real' @ X0 )
= $true )
& ( 'const/sets/EMPTY' @ ( 'type/realax/real' != X0 ) ) )
=> ( ( ! [X2: 'type/realax/real'] :
( ( $true
!= ( 'const/realax/real_le' @ sK1 @ X2 ) )
| ( ( 'const/sets/IN' @ 'type/realax/real' @ X2 @ sK0 )
!= $true ) )
| ( ( 'const/realax/real_le' @ sK1 @ ( 'const/sets/sup' @ sK0 ) )
!= $true ) )
& ( ? [X3: 'type/realax/real'] :
( ( $true
= ( 'const/realax/real_le' @ sK1 @ X3 ) )
& ( $true
= ( 'const/sets/IN' @ 'type/realax/real' @ X3 @ sK0 ) ) )
| ( ( 'const/realax/real_le' @ sK1 @ ( 'const/sets/sup' @ sK0 ) )
= $true ) )
& ( $true
= ( 'const/sets/FINITE' @ 'type/realax/real' @ sK0 ) )
& ( 'const/sets/EMPTY' @ ( 'type/realax/real' != sK0 ) ) ) ),
introduced(choice_axiom,[]) ).
thf(f22,plain,
( ? [X3: 'type/realax/real'] :
( ( $true
= ( 'const/realax/real_le' @ sK1 @ X3 ) )
& ( $true
= ( 'const/sets/IN' @ 'type/realax/real' @ X3 @ sK0 ) ) )
=> ( ( ( 'const/realax/real_le' @ sK1 @ sK2 )
= $true )
& ( ( 'const/sets/IN' @ 'type/realax/real' @ sK2 @ sK0 )
= $true ) ) ),
introduced(choice_axiom,[]) ).
thf(f20,plain,
? [X0: 'type/realax/real' > $o,X1: 'type/realax/real'] :
( ( ! [X2: 'type/realax/real'] :
( ( ( 'const/realax/real_le' @ X1 @ X2 )
!= $true )
| ( ( 'const/sets/IN' @ 'type/realax/real' @ X2 @ X0 )
!= $true ) )
| ( ( 'const/realax/real_le' @ X1 @ ( 'const/sets/sup' @ X0 ) )
!= $true ) )
& ( ? [X3: 'type/realax/real'] :
( ( $true
= ( 'const/realax/real_le' @ X1 @ X3 ) )
& ( $true
= ( 'const/sets/IN' @ 'type/realax/real' @ X3 @ X0 ) ) )
| ( ( 'const/realax/real_le' @ X1 @ ( 'const/sets/sup' @ X0 ) )
= $true ) )
& ( ( 'const/sets/FINITE' @ 'type/realax/real' @ X0 )
= $true )
& ( 'const/sets/EMPTY' @ ( 'type/realax/real' != X0 ) ) ),
inference(rectify,[],[f19]) ).
thf(f19,plain,
? [X0: 'type/realax/real' > $o,X1: 'type/realax/real'] :
( ( ! [X2: 'type/realax/real'] :
( ( ( 'const/realax/real_le' @ X1 @ X2 )
!= $true )
| ( ( 'const/sets/IN' @ 'type/realax/real' @ X2 @ X0 )
!= $true ) )
| ( ( 'const/realax/real_le' @ X1 @ ( 'const/sets/sup' @ X0 ) )
!= $true ) )
& ( ? [X2: 'type/realax/real'] :
( ( ( 'const/realax/real_le' @ X1 @ X2 )
= $true )
& ( ( 'const/sets/IN' @ 'type/realax/real' @ X2 @ X0 )
= $true ) )
| ( ( 'const/realax/real_le' @ X1 @ ( 'const/sets/sup' @ X0 ) )
= $true ) )
& ( ( 'const/sets/FINITE' @ 'type/realax/real' @ X0 )
= $true )
& ( 'const/sets/EMPTY' @ ( 'type/realax/real' != X0 ) ) ),
inference(flattening,[],[f18]) ).
thf(f18,plain,
? [X0: 'type/realax/real' > $o,X1: 'type/realax/real'] :
( ( ! [X2: 'type/realax/real'] :
( ( ( 'const/realax/real_le' @ X1 @ X2 )
!= $true )
| ( ( 'const/sets/IN' @ 'type/realax/real' @ X2 @ X0 )
!= $true ) )
| ( ( 'const/realax/real_le' @ X1 @ ( 'const/sets/sup' @ X0 ) )
!= $true ) )
& ( ? [X2: 'type/realax/real'] :
( ( ( 'const/realax/real_le' @ X1 @ X2 )
= $true )
& ( ( 'const/sets/IN' @ 'type/realax/real' @ X2 @ X0 )
= $true ) )
| ( ( 'const/realax/real_le' @ X1 @ ( 'const/sets/sup' @ X0 ) )
= $true ) )
& ( ( 'const/sets/FINITE' @ 'type/realax/real' @ X0 )
= $true )
& ( 'const/sets/EMPTY' @ ( 'type/realax/real' != X0 ) ) ),
inference(nnf_transformation,[],[f15]) ).
thf(f15,plain,
? [X0: 'type/realax/real' > $o,X1: 'type/realax/real'] :
( ( ( ( 'const/realax/real_le' @ X1 @ ( 'const/sets/sup' @ X0 ) )
= $true )
<~> ? [X2: 'type/realax/real'] :
( ( ( 'const/realax/real_le' @ X1 @ X2 )
= $true )
& ( ( 'const/sets/IN' @ 'type/realax/real' @ X2 @ X0 )
= $true ) ) )
& ( ( 'const/sets/FINITE' @ 'type/realax/real' @ X0 )
= $true )
& ( 'const/sets/EMPTY' @ ( 'type/realax/real' != X0 ) ) ),
inference(flattening,[],[f14]) ).
thf(f14,plain,
? [X0: 'type/realax/real' > $o,X1: 'type/realax/real'] :
( ( ( ( 'const/realax/real_le' @ X1 @ ( 'const/sets/sup' @ X0 ) )
= $true )
<~> ? [X2: 'type/realax/real'] :
( ( ( 'const/realax/real_le' @ X1 @ X2 )
= $true )
& ( ( 'const/sets/IN' @ 'type/realax/real' @ X2 @ X0 )
= $true ) ) )
& ( 'const/sets/EMPTY' @ ( 'type/realax/real' != X0 ) )
& ( ( 'const/sets/FINITE' @ 'type/realax/real' @ X0 )
= $true ) ),
inference(ennf_transformation,[],[f7]) ).
thf(f7,plain,
~ ! [X0: 'type/realax/real' > $o,X1: 'type/realax/real'] :
( ( ( 'const/sets/EMPTY' @ ( 'type/realax/real' != X0 ) )
& ( ( 'const/sets/FINITE' @ 'type/realax/real' @ X0 )
= $true ) )
=> ( ( ( 'const/realax/real_le' @ X1 @ ( 'const/sets/sup' @ X0 ) )
= $true )
<=> ? [X2: 'type/realax/real'] :
( ( ( 'const/realax/real_le' @ X1 @ X2 )
= $true )
& ( ( 'const/sets/IN' @ 'type/realax/real' @ X2 @ X0 )
= $true ) ) ) ),
inference(fool_elimination,[],[f6]) ).
thf(f6,plain,
~ ! [X0: 'type/realax/real' > $o,X1: 'type/realax/real'] :
( ( ( 'const/sets/EMPTY' @ ( 'type/realax/real' != X0 ) )
& ( 'const/sets/FINITE' @ 'type/realax/real' @ X0 ) )
=> ? [X2: 'type/realax/real'] :
( ( ( 'const/sets/IN' @ 'type/realax/real' @ X2 @ X0 )
& ( 'const/realax/real_le' @ X1 @ X2 ) )
= ( 'const/realax/real_le' @ X1 @ ( 'const/sets/sup' @ X0 ) ) ) ),
inference(rectify,[],[f4]) ).
thf(f4,negated_conjecture,
~ ! [X0: 'type/realax/real' > $o,X1: 'type/realax/real'] :
( ( ( 'const/sets/EMPTY' @ ( 'type/realax/real' != X0 ) )
& ( 'const/sets/FINITE' @ 'type/realax/real' @ X0 ) )
=> ? [X2: 'type/realax/real'] :
( ( ( 'const/sets/IN' @ 'type/realax/real' @ X2 @ X0 )
& ( 'const/realax/real_le' @ X1 @ X2 ) )
= ( 'const/realax/real_le' @ X1 @ ( 'const/sets/sup' @ X0 ) ) ) ),
inference(negated_conjecture,[],[f3]) ).
thf(f3,conjecture,
! [X0: 'type/realax/real' > $o,X1: 'type/realax/real'] :
( ( ( 'const/sets/EMPTY' @ ( 'type/realax/real' != X0 ) )
& ( 'const/sets/FINITE' @ 'type/realax/real' @ X0 ) )
=> ? [X2: 'type/realax/real'] :
( ( ( 'const/sets/IN' @ 'type/realax/real' @ X2 @ X0 )
& ( 'const/realax/real_le' @ X1 @ X2 ) )
= ( 'const/realax/real_le' @ X1 @ ( 'const/sets/sup' @ X0 ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p','thm/sets/REAL_LE_SUP_FINITE_') ).
thf(f95,plain,
( ! [X0: 'type/realax/real'] :
( ( $true
!= ( 'const/realax/real_le' @ sK1 @ X0 ) )
| ( $true
!= ( 'const/sets/IN' @ 'type/realax/real' @ X0 @ sK0 ) )
| ( $true
!= ( 'const/sets/FINITE' @ 'type/realax/real' @ sK0 ) ) )
| spl3_2 ),
inference(subsumption_resolution,[],[f93,f26]) ).
thf(f26,plain,
'const/sets/EMPTY' @ ( 'type/realax/real' != sK0 ),
inference(cnf_transformation,[],[f23]) ).
thf(f93,plain,
( ! [X0: 'type/realax/real'] :
( ( $true
!= ( 'const/sets/IN' @ 'type/realax/real' @ X0 @ sK0 ) )
| ( 'const/sets/EMPTY' @ ( 'type/realax/real' = sK0 ) )
| ( $true
!= ( 'const/sets/FINITE' @ 'type/realax/real' @ sK0 ) )
| ( $true
!= ( 'const/realax/real_le' @ sK1 @ X0 ) ) )
| spl3_2 ),
inference(trivial_inequality_removal,[],[f91]) ).
thf(f91,plain,
( ! [X0: 'type/realax/real'] :
( ( $true
!= ( 'const/sets/IN' @ 'type/realax/real' @ X0 @ sK0 ) )
| ( 'const/sets/EMPTY' @ ( 'type/realax/real' = sK0 ) )
| ( $true
!= ( 'const/realax/real_le' @ sK1 @ X0 ) )
| ( $true != $true )
| ( $true
!= ( 'const/sets/FINITE' @ 'type/realax/real' @ sK0 ) ) )
| spl3_2 ),
inference(superposition,[],[f87,f24]) ).
thf(f24,plain,
! [X0: 'type/realax/real' > $o,X1: 'type/realax/real'] :
( ( ( 'const/realax/real_le' @ X1 @ ( 'const/sets/sup' @ X0 ) )
= $true )
| ( ( 'const/sets/FINITE' @ 'type/realax/real' @ X0 )
!= $true )
| ( ( 'const/sets/IN' @ 'type/realax/real' @ X1 @ X0 )
!= $true )
| ( 'const/sets/EMPTY' @ ( 'type/realax/real' = X0 ) ) ),
inference(cnf_transformation,[],[f13]) ).
thf(f13,plain,
! [X0: 'type/realax/real' > $o] :
( ( 'const/sets/EMPTY' @ ( 'type/realax/real' = X0 ) )
| ( ( ( 'const/sets/IN' @ 'type/realax/real' @ ( 'const/sets/sup' @ X0 ) @ X0 )
= $true )
& ! [X1: 'type/realax/real'] :
( ( ( 'const/sets/IN' @ 'type/realax/real' @ X1 @ X0 )
!= $true )
| ( ( 'const/realax/real_le' @ X1 @ ( 'const/sets/sup' @ X0 ) )
= $true ) ) )
| ( ( 'const/sets/FINITE' @ 'type/realax/real' @ X0 )
!= $true ) ),
inference(flattening,[],[f12]) ).
thf(f12,plain,
! [X0: 'type/realax/real' > $o] :
( ( ( ( 'const/sets/IN' @ 'type/realax/real' @ ( 'const/sets/sup' @ X0 ) @ X0 )
= $true )
& ! [X1: 'type/realax/real'] :
( ( ( 'const/sets/IN' @ 'type/realax/real' @ X1 @ X0 )
!= $true )
| ( ( 'const/realax/real_le' @ X1 @ ( 'const/sets/sup' @ X0 ) )
= $true ) ) )
| ( 'const/sets/EMPTY' @ ( 'type/realax/real' = X0 ) )
| ( ( 'const/sets/FINITE' @ 'type/realax/real' @ X0 )
!= $true ) ),
inference(ennf_transformation,[],[f9]) ).
thf(f9,plain,
! [X0: 'type/realax/real' > $o] :
( ( ( 'const/sets/EMPTY' @ ( 'type/realax/real' != X0 ) )
& ( ( 'const/sets/FINITE' @ 'type/realax/real' @ X0 )
= $true ) )
=> ( ! [X1: 'type/realax/real'] :
( ( ( 'const/sets/IN' @ 'type/realax/real' @ X1 @ X0 )
= $true )
=> ( ( 'const/realax/real_le' @ X1 @ ( 'const/sets/sup' @ X0 ) )
= $true ) )
& ( ( 'const/sets/IN' @ 'type/realax/real' @ ( 'const/sets/sup' @ X0 ) @ X0 )
= $true ) ) ),
inference(fool_elimination,[],[f8]) ).
thf(f8,plain,
! [X0: 'type/realax/real' > $o] :
( ( ( 'const/sets/FINITE' @ 'type/realax/real' @ X0 )
& ( 'const/sets/EMPTY' @ ( 'type/realax/real' != X0 ) ) )
=> ( ( 'const/sets/IN' @ 'type/realax/real' @ ( 'const/sets/sup' @ X0 ) @ X0 )
& ! [X1: 'type/realax/real'] :
( ( 'const/sets/IN' @ 'type/realax/real' @ X1 @ X0 )
=> ( 'const/realax/real_le' @ X1 @ ( 'const/sets/sup' @ X0 ) ) ) ) ),
inference(rectify,[],[f2]) ).
thf(f2,axiom,
! [X0: 'type/realax/real' > $o] :
( ( ( 'const/sets/FINITE' @ 'type/realax/real' @ X0 )
& ( 'const/sets/EMPTY' @ ( 'type/realax/real' != X0 ) ) )
=> ( ( 'const/sets/IN' @ 'type/realax/real' @ ( 'const/sets/sup' @ X0 ) @ X0 )
& ! [X1: 'type/realax/real'] :
( ( 'const/sets/IN' @ 'type/realax/real' @ X1 @ X0 )
=> ( 'const/realax/real_le' @ X1 @ ( 'const/sets/sup' @ X0 ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p','thm/sets/SUP_FINITE_') ).
thf(f87,plain,
( ! [X0: 'type/realax/real'] :
( ( $true
!= ( 'const/realax/real_le' @ X0 @ ( 'const/sets/sup' @ sK0 ) ) )
| ( $true
!= ( 'const/realax/real_le' @ sK1 @ X0 ) ) )
| spl3_2 ),
inference(trivial_inequality_removal,[],[f86]) ).
thf(f86,plain,
( ! [X0: 'type/realax/real'] :
( ( $true
!= ( 'const/realax/real_le' @ sK1 @ X0 ) )
| ( $true != $true )
| ( $true
!= ( 'const/realax/real_le' @ X0 @ ( 'const/sets/sup' @ sK0 ) ) ) )
| spl3_2 ),
inference(superposition,[],[f38,f31]) ).
thf(f31,plain,
! [X2: 'type/realax/real',X0: 'type/realax/real',X1: 'type/realax/real'] :
( ( ( 'const/realax/real_le' @ X0 @ X2 )
= $true )
| ( ( 'const/realax/real_le' @ X0 @ X1 )
!= $true )
| ( ( 'const/realax/real_le' @ X1 @ X2 )
!= $true ) ),
inference(cnf_transformation,[],[f17]) ).
thf(f17,plain,
! [X0: 'type/realax/real',X1: 'type/realax/real',X2: 'type/realax/real'] :
( ( ( 'const/realax/real_le' @ X0 @ X2 )
= $true )
| ( ( 'const/realax/real_le' @ X0 @ X1 )
!= $true )
| ( ( 'const/realax/real_le' @ X1 @ X2 )
!= $true ) ),
inference(flattening,[],[f16]) ).
thf(f16,plain,
! [X0: 'type/realax/real',X1: 'type/realax/real',X2: 'type/realax/real'] :
( ( ( 'const/realax/real_le' @ X0 @ X2 )
= $true )
| ( ( 'const/realax/real_le' @ X0 @ X1 )
!= $true )
| ( ( 'const/realax/real_le' @ X1 @ X2 )
!= $true ) ),
inference(ennf_transformation,[],[f11]) ).
thf(f11,plain,
! [X0: 'type/realax/real',X1: 'type/realax/real',X2: 'type/realax/real'] :
( ( ( ( 'const/realax/real_le' @ X0 @ X1 )
= $true )
& ( ( 'const/realax/real_le' @ X1 @ X2 )
= $true ) )
=> ( ( 'const/realax/real_le' @ X0 @ X2 )
= $true ) ),
inference(fool_elimination,[],[f10]) ).
thf(f10,plain,
! [X0: 'type/realax/real',X1: 'type/realax/real',X2: 'type/realax/real'] :
( ( ( 'const/realax/real_le' @ X1 @ X2 )
& ( 'const/realax/real_le' @ X0 @ X1 ) )
=> ( 'const/realax/real_le' @ X0 @ X2 ) ),
inference(rectify,[],[f1]) ).
thf(f1,axiom,
! [X0: 'type/realax/real',X1: 'type/realax/real',X2: 'type/realax/real'] :
( ( ( 'const/realax/real_le' @ X1 @ X2 )
& ( 'const/realax/real_le' @ X0 @ X1 ) )
=> ( 'const/realax/real_le' @ X0 @ X2 ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p','thm/realax/REAL_LE_TRANS_') ).
thf(f38,plain,
( ( ( 'const/realax/real_le' @ sK1 @ ( 'const/sets/sup' @ sK0 ) )
!= $true )
| spl3_2 ),
inference(avatar_component_clause,[],[f37]) ).
thf(f84,plain,
( ~ spl3_1
| ~ spl3_3
| ~ spl3_4 ),
inference(avatar_contradiction_clause,[],[f83]) ).
thf(f83,plain,
( $false
| ~ spl3_1
| ~ spl3_3
| ~ spl3_4 ),
inference(subsumption_resolution,[],[f82,f44]) ).
thf(f44,plain,
( ( ( 'const/realax/real_le' @ sK1 @ sK2 )
= $true )
| ~ spl3_3 ),
inference(avatar_component_clause,[],[f42]) ).
thf(f42,plain,
( spl3_3
<=> ( ( 'const/realax/real_le' @ sK1 @ sK2 )
= $true ) ),
introduced(avatar_definition,[new_symbols(naming,[spl3_3])]) ).
thf(f82,plain,
( ( ( 'const/realax/real_le' @ sK1 @ sK2 )
!= $true )
| ~ spl3_1
| ~ spl3_4 ),
inference(trivial_inequality_removal,[],[f81]) ).
thf(f81,plain,
( ( ( 'const/realax/real_le' @ sK1 @ sK2 )
!= $true )
| ( $true != $true )
| ~ spl3_1
| ~ spl3_4 ),
inference(superposition,[],[f48,f35]) ).
thf(f35,plain,
( ( ( 'const/sets/IN' @ 'type/realax/real' @ sK2 @ sK0 )
= $true )
| ~ spl3_1 ),
inference(avatar_component_clause,[],[f33]) ).
thf(f33,plain,
( spl3_1
<=> ( ( 'const/sets/IN' @ 'type/realax/real' @ sK2 @ sK0 )
= $true ) ),
introduced(avatar_definition,[new_symbols(naming,[spl3_1])]) ).
thf(f48,plain,
( ! [X2: 'type/realax/real'] :
( ( ( 'const/sets/IN' @ 'type/realax/real' @ X2 @ sK0 )
!= $true )
| ( $true
!= ( 'const/realax/real_le' @ sK1 @ X2 ) ) )
| ~ spl3_4 ),
inference(avatar_component_clause,[],[f47]) ).
thf(f80,plain,
( ~ spl3_2
| ~ spl3_4 ),
inference(avatar_contradiction_clause,[],[f79]) ).
thf(f79,plain,
( $false
| ~ spl3_2
| ~ spl3_4 ),
inference(subsumption_resolution,[],[f78,f26]) ).
thf(f78,plain,
( ( 'const/sets/EMPTY' @ ( 'type/realax/real' = sK0 ) )
| ~ spl3_2
| ~ spl3_4 ),
inference(subsumption_resolution,[],[f77,f27]) ).
thf(f77,plain,
( ( $true
!= ( 'const/sets/FINITE' @ 'type/realax/real' @ sK0 ) )
| ( 'const/sets/EMPTY' @ ( 'type/realax/real' = sK0 ) )
| ~ spl3_2
| ~ spl3_4 ),
inference(subsumption_resolution,[],[f76,f39]) ).
thf(f39,plain,
( ( ( 'const/realax/real_le' @ sK1 @ ( 'const/sets/sup' @ sK0 ) )
= $true )
| ~ spl3_2 ),
inference(avatar_component_clause,[],[f37]) ).
thf(f76,plain,
( ( $true
!= ( 'const/sets/FINITE' @ 'type/realax/real' @ sK0 ) )
| ( 'const/sets/EMPTY' @ ( 'type/realax/real' = sK0 ) )
| ( ( 'const/realax/real_le' @ sK1 @ ( 'const/sets/sup' @ sK0 ) )
!= $true )
| ~ spl3_4 ),
inference(trivial_inequality_removal,[],[f75]) ).
thf(f75,plain,
( ( $true != $true )
| ( $true
!= ( 'const/sets/FINITE' @ 'type/realax/real' @ sK0 ) )
| ( ( 'const/realax/real_le' @ sK1 @ ( 'const/sets/sup' @ sK0 ) )
!= $true )
| ( 'const/sets/EMPTY' @ ( 'type/realax/real' = sK0 ) )
| ~ spl3_4 ),
inference(superposition,[],[f48,f25]) ).
thf(f25,plain,
! [X0: 'type/realax/real' > $o] :
( ( ( 'const/sets/IN' @ 'type/realax/real' @ ( 'const/sets/sup' @ X0 ) @ X0 )
= $true )
| ( ( 'const/sets/FINITE' @ 'type/realax/real' @ X0 )
!= $true )
| ( 'const/sets/EMPTY' @ ( 'type/realax/real' = X0 ) ) ),
inference(cnf_transformation,[],[f13]) ).
thf(f49,plain,
( spl3_4
| ~ spl3_2 ),
inference(avatar_split_clause,[],[f30,f37,f47]) ).
thf(f30,plain,
! [X2: 'type/realax/real'] :
( ( ( 'const/realax/real_le' @ sK1 @ ( 'const/sets/sup' @ sK0 ) )
!= $true )
| ( ( 'const/sets/IN' @ 'type/realax/real' @ X2 @ sK0 )
!= $true )
| ( $true
!= ( 'const/realax/real_le' @ sK1 @ X2 ) ) ),
inference(cnf_transformation,[],[f23]) ).
thf(f45,plain,
( spl3_3
| spl3_2 ),
inference(avatar_split_clause,[],[f29,f37,f42]) ).
thf(f29,plain,
( ( ( 'const/realax/real_le' @ sK1 @ ( 'const/sets/sup' @ sK0 ) )
= $true )
| ( ( 'const/realax/real_le' @ sK1 @ sK2 )
= $true ) ),
inference(cnf_transformation,[],[f23]) ).
thf(f40,plain,
( spl3_1
| spl3_2 ),
inference(avatar_split_clause,[],[f28,f37,f33]) ).
thf(f28,plain,
( ( ( 'const/sets/IN' @ 'type/realax/real' @ sK2 @ sK0 )
= $true )
| ( ( 'const/realax/real_le' @ sK1 @ ( 'const/sets/sup' @ sK0 ) )
= $true ) ),
inference(cnf_transformation,[],[f23]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : ANA069^1 : TPTP v8.2.0. Released v7.0.0.
% 0.03/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.12/0.34 % Computer : n010.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 300
% 0.12/0.34 % DateTime : Mon May 20 07:42:07 EDT 2024
% 0.12/0.34 % CPUTime :
% 0.12/0.34 This is a TH1_THM_EQU_NAR problem
% 0.12/0.34 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.20/0.36 % (28471)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.20/0.36 % (28472)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.20/0.36 % (28473)lrs+10_1:1_au=on:inj=on:i=2:si=on:rtra=on_0 on theBenchmark for (2999ds/2Mi)
% 0.20/0.36 % (28475)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.20/0.36 % (28474)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.20/0.36 % (28470)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.20/0.36 % (28476)lrs+1004_1:128_cond=on:e2e=on:sp=weighted_frequency:i=18:si=on:rtra=on_0 on theBenchmark for (2999ds/18Mi)
% 0.20/0.36 % (28477)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.20/0.36 % (28471)Instruction limit reached!
% 0.20/0.36 % (28471)------------------------------
% 0.20/0.36 % (28471)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.20/0.36 % (28471)Termination reason: Unknown
% 0.20/0.36 % (28471)Termination phase: Saturation
% 0.20/0.36
% 0.20/0.36 % (28471)Memory used [KB]: 5500
% 0.20/0.36 % (28471)Time elapsed: 0.004 s
% 0.20/0.36 % (28471)Instructions burned: 4 (million)
% 0.20/0.36 % (28471)------------------------------
% 0.20/0.36 % (28471)------------------------------
% 0.20/0.36 % (28473)Instruction limit reached!
% 0.20/0.36 % (28473)------------------------------
% 0.20/0.36 % (28473)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.20/0.36 % (28473)Termination reason: Unknown
% 0.20/0.36 % (28473)Termination phase: Preprocessing 3
% 0.20/0.36 % (28474)Instruction limit reached!
% 0.20/0.36 % (28474)------------------------------
% 0.20/0.36 % (28474)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.20/0.36
% 0.20/0.36 % (28473)Memory used [KB]: 895
% 0.20/0.36 % (28473)Time elapsed: 0.002 s
% 0.20/0.36 % (28473)Instructions burned: 2 (million)
% 0.20/0.36 % (28473)------------------------------
% 0.20/0.36 % (28473)------------------------------
% 0.20/0.36 % (28474)Termination reason: Unknown
% 0.20/0.36 % (28474)Termination phase: Property scanning
% 0.20/0.36
% 0.20/0.36 % (28474)Memory used [KB]: 895
% 0.20/0.36 % (28474)Time elapsed: 0.002 s
% 0.20/0.36 % (28474)Instructions burned: 2 (million)
% 0.20/0.36 % (28474)------------------------------
% 0.20/0.36 % (28474)------------------------------
% 0.20/0.37 % (28477)Instruction limit reached!
% 0.20/0.37 % (28477)------------------------------
% 0.20/0.37 % (28477)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.20/0.37 % (28477)Termination reason: Unknown
% 0.20/0.37 % (28477)Termination phase: Saturation
% 0.20/0.37
% 0.20/0.37 % (28477)Memory used [KB]: 5500
% 0.20/0.37 % (28477)Time elapsed: 0.004 s
% 0.20/0.37 % (28477)Instructions burned: 3 (million)
% 0.20/0.37 % (28477)------------------------------
% 0.20/0.37 % (28477)------------------------------
% 0.20/0.37 % (28475)First to succeed.
% 0.20/0.37 % (28476)Also succeeded, but the first one will report.
% 0.20/0.37 % (28470)Also succeeded, but the first one will report.
% 0.20/0.37 % (28475)Refutation found. Thanks to Tanya!
% 0.20/0.37 % SZS status Theorem for theBenchmark
% 0.20/0.37 % SZS output start Proof for theBenchmark
% See solution above
% 0.20/0.37 % (28475)------------------------------
% 0.20/0.37 % (28475)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.20/0.37 % (28475)Termination reason: Refutation
% 0.20/0.37
% 0.20/0.37 % (28475)Memory used [KB]: 5628
% 0.20/0.37 % (28475)Time elapsed: 0.009 s
% 0.20/0.37 % (28475)Instructions burned: 7 (million)
% 0.20/0.37 % (28475)------------------------------
% 0.20/0.37 % (28475)------------------------------
% 0.20/0.37 % (28469)Success in time 0.011 s
% 0.20/0.37 % Vampire---4.8 exiting
%------------------------------------------------------------------------------