TSTP Solution File: ANA102^1 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : ANA102^1 : TPTP v8.2.0. Released v7.0.0.
% Transfm : none
% Format : tptp:raw
% Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox2/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% Computer : n008.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:29 EDT 2024
% Result : Theorem 0.14s 0.39s
% Output : Refutation 0.14s
% Verified :
% SZS Type : Refutation
% Derivation depth : 17
% Number of leaves : 25
% Syntax : Number of formulae : 75 ( 18 unt; 18 typ; 0 def)
% Number of atoms : 418 ( 119 equ; 0 cnn)
% Maximal formula atoms : 10 ( 7 avg)
% Number of connectives : 745 ( 45 ~; 35 |; 32 &; 622 @)
% ( 0 <=>; 11 =>; 0 <=; 0 <~>)
% Maximal formula depth : 12 ( 6 avg)
% Number of types : 3 ( 2 usr)
% Number of type conns : 135 ( 135 >; 0 *; 0 +; 0 <<)
% Number of symbols : 18 ( 15 usr; 2 con; 0-4 aty)
% Number of variables : 144 ( 0 ^ 119 !; 15 ?; 144 :)
% ( 10 !>; 0 ?*; 0 @-; 0 @+)
% Comments :
%------------------------------------------------------------------------------
thf(type_def_6,type,
'type/realax/real': $tType ).
thf(type_def_7,type,
sK0: $tType ).
thf(func_def_0,type,
'type/realax/real': $tType ).
thf(func_def_1,type,
'const/sets/UNION':
!>[X0: $tType] : ( ( X0 > $o ) > ( X0 > $o ) > X0 > $o ) ).
thf(func_def_2,type,
'const/sets/SUBSET':
!>[X0: $tType] : ( ( X0 > $o ) > ( X0 > $o ) > $o ) ).
thf(func_def_3,type,
'const/sets/INTER':
!>[X0: $tType] : ( ( X0 > $o ) > ( X0 > $o ) > X0 > $o ) ).
thf(func_def_4,type,
'const/sets/FINITE':
!>[X0: $tType] : ( ( X0 > $o ) > $o ) ).
thf(func_def_5,type,
'const/sets/EMPTY':
!>[X0: $tType] : ( X0 > $o ) ).
thf(func_def_6,type,
'const/sets/DISJOINT':
!>[X0: $tType] : ( ( X0 > $o ) > ( X0 > $o ) > $o ) ).
thf(func_def_7,type,
'const/realax/real_add': 'type/realax/real' > 'type/realax/real' > 'type/realax/real' ).
thf(func_def_8,type,
'const/iterate/sum':
!>[X0: $tType] : ( ( X0 > $o ) > ( X0 > 'type/realax/real' ) > 'type/realax/real' ) ).
thf(func_def_10,type,
vEPSILON:
!>[X0: $tType] : ( ( X0 > $o ) > X0 ) ).
thf(func_def_14,type,
sK1: sK0 > 'type/realax/real' ).
thf(func_def_15,type,
sK2: sK0 > $o ).
thf(func_def_16,type,
sK3: sK0 > $o ).
thf(func_def_17,type,
sK4: sK0 > $o ).
thf(func_def_19,type,
ph6:
!>[X0: $tType] : X0 ).
thf(func_def_20,type,
sK7:
!>[X0: $tType] : ( ( X0 > $o ) > ( X0 > $o ) > X0 ) ).
thf(f101,plain,
$false,
inference(trivial_inequality_removal,[],[f100]) ).
thf(f100,plain,
( ( 'const/iterate/sum' @ sK0 @ ( 'const/sets/UNION' @ sK0 @ sK2 @ sK3 ) @ sK1 )
!= ( 'const/iterate/sum' @ sK0 @ ( 'const/sets/UNION' @ sK0 @ sK2 @ sK3 ) @ sK1 ) ),
inference(superposition,[],[f38,f74]) ).
thf(f74,plain,
! [X0: sK0 > 'type/realax/real'] :
( ( 'const/realax/real_add' @ ( 'const/iterate/sum' @ sK0 @ sK2 @ X0 ) @ ( 'const/iterate/sum' @ sK0 @ sK3 @ X0 ) )
= ( 'const/iterate/sum' @ sK0 @ ( 'const/sets/UNION' @ sK0 @ sK2 @ sK3 ) @ X0 ) ),
inference(trivial_inequality_removal,[],[f73]) ).
thf(f73,plain,
! [X0: sK0 > 'type/realax/real'] :
( ( ( 'const/realax/real_add' @ ( 'const/iterate/sum' @ sK0 @ sK2 @ X0 ) @ ( 'const/iterate/sum' @ sK0 @ sK3 @ X0 ) )
= ( 'const/iterate/sum' @ sK0 @ ( 'const/sets/UNION' @ sK0 @ sK2 @ sK3 ) @ X0 ) )
| ( $true != $true ) ),
inference(forward_demodulation,[],[f72,f58]) ).
thf(f58,plain,
( ( 'const/sets/FINITE' @ sK0 @ sK2 )
= $true ),
inference(trivial_inequality_removal,[],[f57]) ).
thf(f57,plain,
( ( ( 'const/sets/FINITE' @ sK0 @ sK2 )
= $true )
| ( $true != $true ) ),
inference(superposition,[],[f53,f37]) ).
thf(f37,plain,
( ( 'const/sets/FINITE' @ sK0 @ ( 'const/sets/UNION' @ sK0 @ sK2 @ sK3 ) )
= $true ),
inference(definition_unfolding,[],[f34,f32]) ).
thf(f32,plain,
( ( 'const/sets/UNION' @ sK0 @ sK2 @ sK3 )
= sK4 ),
inference(cnf_transformation,[],[f27]) ).
thf(f27,plain,
( ( 'const/sets/EMPTY'
@ ( sK0
= ( 'const/sets/INTER' @ sK0 @ sK2 @ sK3 ) ) )
& ( ( 'const/sets/FINITE' @ sK0 @ sK4 )
= $true )
& ( ( 'const/realax/real_add' @ ( 'const/iterate/sum' @ sK0 @ sK2 @ sK1 ) @ ( 'const/iterate/sum' @ sK0 @ sK3 @ sK1 ) )
!= ( 'const/iterate/sum' @ sK0 @ sK4 @ sK1 ) )
& ( ( 'const/sets/UNION' @ sK0 @ sK2 @ sK3 )
= sK4 ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3,sK4])],[f25,f26]) ).
thf(f26,plain,
( ? [X0: $tType,X1: X0 > 'type/realax/real',X2: X0 > $o,X3: X0 > $o,X4: X0 > $o] :
( ( 'const/sets/EMPTY'
@ ( X0
= ( 'const/sets/INTER' @ X0 @ X2 @ X3 ) ) )
& ( ( 'const/sets/FINITE' @ X0 @ X4 )
= $true )
& ( ( 'const/realax/real_add' @ ( 'const/iterate/sum' @ X0 @ X2 @ X1 ) @ ( 'const/iterate/sum' @ X0 @ X3 @ X1 ) )
!= ( 'const/iterate/sum' @ X0 @ X4 @ X1 ) )
& ( ( 'const/sets/UNION' @ X0 @ X2 @ X3 )
= X4 ) )
=> ( ( 'const/sets/EMPTY'
@ ( sK0
= ( 'const/sets/INTER' @ sK0 @ sK2 @ sK3 ) ) )
& ( ( 'const/sets/FINITE' @ sK0 @ sK4 )
= $true )
& ( ( 'const/realax/real_add' @ ( 'const/iterate/sum' @ sK0 @ sK2 @ sK1 ) @ ( 'const/iterate/sum' @ sK0 @ sK3 @ sK1 ) )
!= ( 'const/iterate/sum' @ sK0 @ sK4 @ sK1 ) )
& ( ( 'const/sets/UNION' @ sK0 @ sK2 @ sK3 )
= sK4 ) ) ),
introduced(choice_axiom,[]) ).
thf(f25,plain,
? [X0: $tType,X1: X0 > 'type/realax/real',X2: X0 > $o,X3: X0 > $o,X4: X0 > $o] :
( ( 'const/sets/EMPTY'
@ ( X0
= ( 'const/sets/INTER' @ X0 @ X2 @ X3 ) ) )
& ( ( 'const/sets/FINITE' @ X0 @ X4 )
= $true )
& ( ( 'const/realax/real_add' @ ( 'const/iterate/sum' @ X0 @ X2 @ X1 ) @ ( 'const/iterate/sum' @ X0 @ X3 @ X1 ) )
!= ( 'const/iterate/sum' @ X0 @ X4 @ X1 ) )
& ( ( 'const/sets/UNION' @ X0 @ X2 @ X3 )
= X4 ) ),
inference(flattening,[],[f24]) ).
thf(f24,plain,
? [X0: $tType,X1: X0 > 'type/realax/real',X2: X0 > $o,X3: X0 > $o,X4: X0 > $o] :
( ( ( 'const/realax/real_add' @ ( 'const/iterate/sum' @ X0 @ X2 @ X1 ) @ ( 'const/iterate/sum' @ X0 @ X3 @ X1 ) )
!= ( 'const/iterate/sum' @ X0 @ X4 @ X1 ) )
& ( ( 'const/sets/UNION' @ X0 @ X2 @ X3 )
= X4 )
& ( 'const/sets/EMPTY'
@ ( X0
= ( 'const/sets/INTER' @ X0 @ X2 @ X3 ) ) )
& ( ( 'const/sets/FINITE' @ X0 @ X4 )
= $true ) ),
inference(ennf_transformation,[],[f14]) ).
thf(f14,plain,
~ ! [X0: $tType,X1: X0 > 'type/realax/real',X2: X0 > $o,X3: X0 > $o,X4: X0 > $o] :
( ( ( ( 'const/sets/UNION' @ X0 @ X2 @ X3 )
= X4 )
& ( 'const/sets/EMPTY'
@ ( X0
= ( 'const/sets/INTER' @ X0 @ X2 @ X3 ) ) )
& ( ( 'const/sets/FINITE' @ X0 @ X4 )
= $true ) )
=> ( ( 'const/realax/real_add' @ ( 'const/iterate/sum' @ X0 @ X2 @ X1 ) @ ( 'const/iterate/sum' @ X0 @ X3 @ X1 ) )
= ( 'const/iterate/sum' @ X0 @ X4 @ X1 ) ) ),
inference(fool_elimination,[],[f13]) ).
thf(f13,plain,
~ ! [X0: $tType,X1: X0 > 'type/realax/real',X2: X0 > $o,X3: X0 > $o,X4: X0 > $o] :
( ( ( 'const/sets/EMPTY'
@ ( X0
= ( 'const/sets/INTER' @ X0 @ X2 @ X3 ) ) )
& ( 'const/sets/FINITE' @ X0 @ X4 )
& ( ( 'const/sets/UNION' @ X0 @ X2 @ X3 )
= X4 ) )
=> ( ( 'const/realax/real_add' @ ( 'const/iterate/sum' @ X0 @ X2 @ X1 ) @ ( 'const/iterate/sum' @ X0 @ X3 @ X1 ) )
= ( 'const/iterate/sum' @ X0 @ X4 @ X1 ) ) ),
inference(rectify,[],[f7]) ).
thf(f7,negated_conjecture,
~ ! [X0: $tType,X1: X0 > 'type/realax/real',X2: X0 > $o,X3: X0 > $o,X4: X0 > $o] :
( ( ( 'const/sets/EMPTY'
@ ( X0
= ( 'const/sets/INTER' @ X0 @ X2 @ X3 ) ) )
& ( 'const/sets/FINITE' @ X0 @ X4 )
& ( ( 'const/sets/UNION' @ X0 @ X2 @ X3 )
= X4 ) )
=> ( ( 'const/realax/real_add' @ ( 'const/iterate/sum' @ X0 @ X2 @ X1 ) @ ( 'const/iterate/sum' @ X0 @ X3 @ X1 ) )
= ( 'const/iterate/sum' @ X0 @ X4 @ X1 ) ) ),
inference(negated_conjecture,[],[f6]) ).
thf(f6,conjecture,
! [X0: $tType,X1: X0 > 'type/realax/real',X2: X0 > $o,X3: X0 > $o,X4: X0 > $o] :
( ( ( 'const/sets/EMPTY'
@ ( X0
= ( 'const/sets/INTER' @ X0 @ X2 @ X3 ) ) )
& ( 'const/sets/FINITE' @ X0 @ X4 )
& ( ( 'const/sets/UNION' @ X0 @ X2 @ X3 )
= X4 ) )
=> ( ( 'const/realax/real_add' @ ( 'const/iterate/sum' @ X0 @ X2 @ X1 ) @ ( 'const/iterate/sum' @ X0 @ X3 @ X1 ) )
= ( 'const/iterate/sum' @ X0 @ X4 @ X1 ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p','thm/iterate/SUM_UNION_EQ_') ).
thf(f34,plain,
( ( 'const/sets/FINITE' @ sK0 @ sK4 )
= $true ),
inference(cnf_transformation,[],[f27]) ).
thf(f53,plain,
! [X0: $tType,X2: X0 > $o,X1: X0 > $o] :
( ( $true
!= ( 'const/sets/FINITE' @ X0 @ ( 'const/sets/UNION' @ X0 @ X1 @ X2 ) ) )
| ( ( 'const/sets/FINITE' @ X0 @ X1 )
= $true ) ),
inference(trivial_inequality_removal,[],[f52]) ).
thf(f52,plain,
! [X0: $tType,X2: X0 > $o,X1: X0 > $o] :
( ( ( 'const/sets/FINITE' @ X0 @ X1 )
= $true )
| ( $true != $true )
| ( $true
!= ( 'const/sets/FINITE' @ X0 @ ( 'const/sets/UNION' @ X0 @ X1 @ X2 ) ) ) ),
inference(superposition,[],[f28,f36]) ).
thf(f36,plain,
! [X0: $tType,X2: X0 > $o,X1: X0 > $o] :
( ( 'const/sets/SUBSET' @ X0 @ X1 @ ( 'const/sets/UNION' @ X0 @ X1 @ X2 ) )
= $true ),
inference(cnf_transformation,[],[f10]) ).
thf(f10,plain,
! [X0: $tType,X1: X0 > $o,X2: X0 > $o] :
( ( 'const/sets/SUBSET' @ X0 @ X1 @ ( 'const/sets/UNION' @ X0 @ X1 @ X2 ) )
= $true ),
inference(fool_elimination,[],[f9]) ).
thf(f9,plain,
! [X0: $tType,X1: X0 > $o,X2: X0 > $o] : ( 'const/sets/SUBSET' @ X0 @ X1 @ ( 'const/sets/UNION' @ X0 @ X1 @ X2 ) ),
inference(rectify,[],[f2]) ).
thf(f2,axiom,
! [X0: $tType,X1: X0 > $o,X2: X0 > $o] : ( 'const/sets/SUBSET' @ X0 @ X1 @ ( 'const/sets/UNION' @ X0 @ X1 @ X2 ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p','thm/sets/SUBSET_UNION_0') ).
thf(f28,plain,
! [X0: $tType,X2: X0 > $o,X1: X0 > $o] :
( ( ( 'const/sets/SUBSET' @ X0 @ X1 @ X2 )
!= $true )
| ( ( 'const/sets/FINITE' @ X0 @ X2 )
!= $true )
| ( ( 'const/sets/FINITE' @ X0 @ X1 )
= $true ) ),
inference(cnf_transformation,[],[f23]) ).
thf(f23,plain,
! [X0: $tType,X1: X0 > $o,X2: X0 > $o] :
( ( ( 'const/sets/FINITE' @ X0 @ X2 )
!= $true )
| ( ( 'const/sets/SUBSET' @ X0 @ X1 @ X2 )
!= $true )
| ( ( 'const/sets/FINITE' @ X0 @ X1 )
= $true ) ),
inference(flattening,[],[f22]) ).
thf(f22,plain,
! [X0: $tType,X1: X0 > $o,X2: X0 > $o] :
( ( ( 'const/sets/FINITE' @ X0 @ X1 )
= $true )
| ( ( 'const/sets/FINITE' @ X0 @ X2 )
!= $true )
| ( ( 'const/sets/SUBSET' @ X0 @ X1 @ X2 )
!= $true ) ),
inference(ennf_transformation,[],[f19]) ).
thf(f19,plain,
! [X0: $tType,X1: X0 > $o,X2: X0 > $o] :
( ( ( ( 'const/sets/FINITE' @ X0 @ X2 )
= $true )
& ( ( 'const/sets/SUBSET' @ X0 @ X1 @ X2 )
= $true ) )
=> ( ( 'const/sets/FINITE' @ X0 @ X1 )
= $true ) ),
inference(fool_elimination,[],[f18]) ).
thf(f18,plain,
! [X0: $tType,X1: X0 > $o,X2: X0 > $o] :
( ( ( 'const/sets/SUBSET' @ X0 @ X1 @ X2 )
& ( 'const/sets/FINITE' @ X0 @ X2 ) )
=> ( 'const/sets/FINITE' @ X0 @ X1 ) ),
inference(rectify,[],[f3]) ).
thf(f3,axiom,
! [X0: $tType,X1: X0 > $o,X2: X0 > $o] :
( ( ( 'const/sets/SUBSET' @ X0 @ X1 @ X2 )
& ( 'const/sets/FINITE' @ X0 @ X2 ) )
=> ( 'const/sets/FINITE' @ X0 @ X1 ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p','thm/sets/FINITE_SUBSET_') ).
thf(f72,plain,
! [X0: sK0 > 'type/realax/real'] :
( ( ( 'const/realax/real_add' @ ( 'const/iterate/sum' @ sK0 @ sK2 @ X0 ) @ ( 'const/iterate/sum' @ sK0 @ sK3 @ X0 ) )
= ( 'const/iterate/sum' @ sK0 @ ( 'const/sets/UNION' @ sK0 @ sK2 @ sK3 ) @ X0 ) )
| ( ( 'const/sets/FINITE' @ sK0 @ sK2 )
!= $true ) ),
inference(trivial_inequality_removal,[],[f71]) ).
thf(f71,plain,
! [X0: sK0 > 'type/realax/real'] :
( ( ( 'const/realax/real_add' @ ( 'const/iterate/sum' @ sK0 @ sK2 @ X0 ) @ ( 'const/iterate/sum' @ sK0 @ sK3 @ X0 ) )
= ( 'const/iterate/sum' @ sK0 @ ( 'const/sets/UNION' @ sK0 @ sK2 @ sK3 ) @ X0 ) )
| ( $true != $true )
| ( ( 'const/sets/FINITE' @ sK0 @ sK2 )
!= $true ) ),
inference(forward_demodulation,[],[f70,f56]) ).
thf(f56,plain,
( ( 'const/sets/FINITE' @ sK0 @ sK3 )
= $true ),
inference(trivial_inequality_removal,[],[f55]) ).
thf(f55,plain,
( ( ( 'const/sets/FINITE' @ sK0 @ sK3 )
= $true )
| ( $true != $true ) ),
inference(superposition,[],[f47,f37]) ).
thf(f47,plain,
! [X0: $tType,X2: X0 > $o,X1: X0 > $o] :
( ( ( 'const/sets/FINITE' @ X0 @ ( 'const/sets/UNION' @ X0 @ X2 @ X1 ) )
!= $true )
| ( ( 'const/sets/FINITE' @ X0 @ X1 )
= $true ) ),
inference(trivial_inequality_removal,[],[f46]) ).
thf(f46,plain,
! [X0: $tType,X2: X0 > $o,X1: X0 > $o] :
( ( ( 'const/sets/FINITE' @ X0 @ X1 )
= $true )
| ( $true != $true )
| ( ( 'const/sets/FINITE' @ X0 @ ( 'const/sets/UNION' @ X0 @ X2 @ X1 ) )
!= $true ) ),
inference(superposition,[],[f28,f30]) ).
thf(f30,plain,
! [X0: $tType,X2: X0 > $o,X1: X0 > $o] :
( ( 'const/sets/SUBSET' @ X0 @ X1 @ ( 'const/sets/UNION' @ X0 @ X2 @ X1 ) )
= $true ),
inference(cnf_transformation,[],[f12]) ).
thf(f12,plain,
! [X0: $tType,X1: X0 > $o,X2: X0 > $o] :
( ( 'const/sets/SUBSET' @ X0 @ X1 @ ( 'const/sets/UNION' @ X0 @ X2 @ X1 ) )
= $true ),
inference(fool_elimination,[],[f11]) ).
thf(f11,plain,
! [X0: $tType,X1: X0 > $o,X2: X0 > $o] : ( 'const/sets/SUBSET' @ X0 @ X1 @ ( 'const/sets/UNION' @ X0 @ X2 @ X1 ) ),
inference(rectify,[],[f1]) ).
thf(f1,axiom,
! [X0: $tType,X1: X0 > $o,X2: X0 > $o] : ( 'const/sets/SUBSET' @ X0 @ X1 @ ( 'const/sets/UNION' @ X0 @ X2 @ X1 ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p','thm/sets/SUBSET_UNION_1') ).
thf(f70,plain,
! [X0: sK0 > 'type/realax/real'] :
( ( ( 'const/sets/FINITE' @ sK0 @ sK3 )
!= $true )
| ( ( 'const/realax/real_add' @ ( 'const/iterate/sum' @ sK0 @ sK2 @ X0 ) @ ( 'const/iterate/sum' @ sK0 @ sK3 @ X0 ) )
= ( 'const/iterate/sum' @ sK0 @ ( 'const/sets/UNION' @ sK0 @ sK2 @ sK3 ) @ X0 ) )
| ( ( 'const/sets/FINITE' @ sK0 @ sK2 )
!= $true ) ),
inference(trivial_inequality_removal,[],[f69]) ).
thf(f69,plain,
! [X0: sK0 > 'type/realax/real'] :
( ( ( 'const/realax/real_add' @ ( 'const/iterate/sum' @ sK0 @ sK2 @ X0 ) @ ( 'const/iterate/sum' @ sK0 @ sK3 @ X0 ) )
= ( 'const/iterate/sum' @ sK0 @ ( 'const/sets/UNION' @ sK0 @ sK2 @ sK3 ) @ X0 ) )
| ( ( 'const/sets/FINITE' @ sK0 @ sK3 )
!= $true )
| ( $true != $true )
| ( ( 'const/sets/FINITE' @ sK0 @ sK2 )
!= $true ) ),
inference(superposition,[],[f31,f67]) ).
thf(f67,plain,
( ( 'const/sets/DISJOINT' @ sK0 @ sK2 @ sK3 )
= $true ),
inference(trivial_inequality_removal,[],[f63]) ).
thf(f63,plain,
( ( 'const/sets/EMPTY' @ ( sK0 != 'const/sets/EMPTY' ) @ sK0 )
| ( ( 'const/sets/DISJOINT' @ sK0 @ sK2 @ sK3 )
= $true ) ),
inference(superposition,[],[f42,f35]) ).
thf(f35,plain,
( 'const/sets/EMPTY'
@ ( sK0
= ( 'const/sets/INTER' @ sK0 @ sK2 @ sK3 ) ) ),
inference(cnf_transformation,[],[f27]) ).
thf(f42,plain,
! [X0: $tType,X2: X0 > $o,X1: X0 > $o] :
( ( ( ( 'const/sets/INTER' @ X0 @ X1 @ X2 )
!= 'const/sets/EMPTY' )
@ X0 )
| ( ( 'const/sets/DISJOINT' @ X0 @ X1 @ X2 )
= $true ) ),
inference(equality_proxy_clausification,[],[f39]) ).
thf(f39,plain,
! [X0: $tType,X2: X0 > $o,X1: X0 > $o] :
( ( $false
= ( ( ( 'const/sets/INTER' @ X0 @ X1 @ X2 )
= 'const/sets/EMPTY' )
@ X0 ) )
| ( ( 'const/sets/DISJOINT' @ X0 @ X1 @ X2 )
= $true ) ),
inference(binary_proxy_clausification,[],[f29]) ).
thf(f29,plain,
! [X0: $tType,X2: X0 > $o,X1: X0 > $o] :
( ( 'const/sets/DISJOINT' @ X0 @ X1 @ X2 )
= ( ( ( 'const/sets/INTER' @ X0 @ X1 @ X2 )
= 'const/sets/EMPTY' )
@ X0 ) ),
inference(cnf_transformation,[],[f15]) ).
thf(f15,plain,
! [X0: $tType,X1: X0 > $o,X2: X0 > $o] :
( ( 'const/sets/DISJOINT' @ X0 @ X1 @ X2 )
= ( ( ( 'const/sets/INTER' @ X0 @ X1 @ X2 )
= 'const/sets/EMPTY' )
@ X0 ) ),
inference(fool_elimination,[],[f4]) ).
thf(f4,axiom,
! [X0: $tType,X1: X0 > $o,X2: X0 > $o] :
( ( 'const/sets/DISJOINT' @ X0 @ X1 @ X2 )
= ( ( ( 'const/sets/INTER' @ X0 @ X1 @ X2 )
= 'const/sets/EMPTY' )
@ X0 ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p','thm/sets/DISJOINT_') ).
thf(f31,plain,
! [X0: $tType,X2: X0 > $o,X3: X0 > $o,X1: X0 > 'type/realax/real'] :
( ( ( 'const/sets/DISJOINT' @ X0 @ X2 @ X3 )
!= $true )
| ( ( 'const/iterate/sum' @ X0 @ ( 'const/sets/UNION' @ X0 @ X2 @ X3 ) @ X1 )
= ( 'const/realax/real_add' @ ( 'const/iterate/sum' @ X0 @ X2 @ X1 ) @ ( 'const/iterate/sum' @ X0 @ X3 @ X1 ) ) )
| ( ( 'const/sets/FINITE' @ X0 @ X3 )
!= $true )
| ( ( 'const/sets/FINITE' @ X0 @ X2 )
!= $true ) ),
inference(cnf_transformation,[],[f21]) ).
thf(f21,plain,
! [X0: $tType,X1: X0 > 'type/realax/real',X2: X0 > $o,X3: X0 > $o] :
( ( ( 'const/sets/FINITE' @ X0 @ X2 )
!= $true )
| ( ( 'const/iterate/sum' @ X0 @ ( 'const/sets/UNION' @ X0 @ X2 @ X3 ) @ X1 )
= ( 'const/realax/real_add' @ ( 'const/iterate/sum' @ X0 @ X2 @ X1 ) @ ( 'const/iterate/sum' @ X0 @ X3 @ X1 ) ) )
| ( ( 'const/sets/DISJOINT' @ X0 @ X2 @ X3 )
!= $true )
| ( ( 'const/sets/FINITE' @ X0 @ X3 )
!= $true ) ),
inference(flattening,[],[f20]) ).
thf(f20,plain,
! [X0: $tType,X1: X0 > 'type/realax/real',X2: X0 > $o,X3: X0 > $o] :
( ( ( 'const/iterate/sum' @ X0 @ ( 'const/sets/UNION' @ X0 @ X2 @ X3 ) @ X1 )
= ( 'const/realax/real_add' @ ( 'const/iterate/sum' @ X0 @ X2 @ X1 ) @ ( 'const/iterate/sum' @ X0 @ X3 @ X1 ) ) )
| ( ( 'const/sets/DISJOINT' @ X0 @ X2 @ X3 )
!= $true )
| ( ( 'const/sets/FINITE' @ X0 @ X3 )
!= $true )
| ( ( 'const/sets/FINITE' @ X0 @ X2 )
!= $true ) ),
inference(ennf_transformation,[],[f17]) ).
thf(f17,plain,
! [X0: $tType,X1: X0 > 'type/realax/real',X2: X0 > $o,X3: X0 > $o] :
( ( ( ( 'const/sets/DISJOINT' @ X0 @ X2 @ X3 )
= $true )
& ( ( 'const/sets/FINITE' @ X0 @ X3 )
= $true )
& ( ( 'const/sets/FINITE' @ X0 @ X2 )
= $true ) )
=> ( ( 'const/iterate/sum' @ X0 @ ( 'const/sets/UNION' @ X0 @ X2 @ X3 ) @ X1 )
= ( 'const/realax/real_add' @ ( 'const/iterate/sum' @ X0 @ X2 @ X1 ) @ ( 'const/iterate/sum' @ X0 @ X3 @ X1 ) ) ) ),
inference(fool_elimination,[],[f16]) ).
thf(f16,plain,
! [X0: $tType,X1: X0 > 'type/realax/real',X2: X0 > $o,X3: X0 > $o] :
( ( ( 'const/sets/FINITE' @ X0 @ X2 )
& ( 'const/sets/FINITE' @ X0 @ X3 )
& ( 'const/sets/DISJOINT' @ X0 @ X2 @ X3 ) )
=> ( ( 'const/iterate/sum' @ X0 @ ( 'const/sets/UNION' @ X0 @ X2 @ X3 ) @ X1 )
= ( 'const/realax/real_add' @ ( 'const/iterate/sum' @ X0 @ X2 @ X1 ) @ ( 'const/iterate/sum' @ X0 @ X3 @ X1 ) ) ) ),
inference(rectify,[],[f5]) ).
thf(f5,axiom,
! [X0: $tType,X1: X0 > 'type/realax/real',X2: X0 > $o,X3: X0 > $o] :
( ( ( 'const/sets/FINITE' @ X0 @ X2 )
& ( 'const/sets/FINITE' @ X0 @ X3 )
& ( 'const/sets/DISJOINT' @ X0 @ X2 @ X3 ) )
=> ( ( 'const/iterate/sum' @ X0 @ ( 'const/sets/UNION' @ X0 @ X2 @ X3 ) @ X1 )
= ( 'const/realax/real_add' @ ( 'const/iterate/sum' @ X0 @ X2 @ X1 ) @ ( 'const/iterate/sum' @ X0 @ X3 @ X1 ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p','thm/iterate/SUM_UNION_') ).
thf(f38,plain,
( ( 'const/realax/real_add' @ ( 'const/iterate/sum' @ sK0 @ sK2 @ sK1 ) @ ( 'const/iterate/sum' @ sK0 @ sK3 @ sK1 ) )
!= ( 'const/iterate/sum' @ sK0 @ ( 'const/sets/UNION' @ sK0 @ sK2 @ sK3 ) @ sK1 ) ),
inference(definition_unfolding,[],[f33,f32]) ).
thf(f33,plain,
( ( 'const/realax/real_add' @ ( 'const/iterate/sum' @ sK0 @ sK2 @ sK1 ) @ ( 'const/iterate/sum' @ sK0 @ sK3 @ sK1 ) )
!= ( 'const/iterate/sum' @ sK0 @ sK4 @ sK1 ) ),
inference(cnf_transformation,[],[f27]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : ANA102^1 : TPTP v8.2.0. Released v7.0.0.
% 0.07/0.14 % Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox2/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% 0.14/0.35 % Computer : n008.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Mon May 20 07:52:53 EDT 2024
% 0.14/0.36 % CPUTime :
% 0.14/0.36 This is a TH1_THM_EQU_NAR problem
% 0.14/0.36 Running vampire_ho --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_hol --cores 8 -m 12000 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.14/0.38 % (23646)lrs+10_1:1_au=on:inj=on:i=2:si=on:rtra=on_0 on theBenchmark for (2999ds/2Mi)
% 0.14/0.38 % (23643)lrs+1002_1:8_bd=off:fd=off:hud=10:tnu=1:i=183:si=on:rtra=on_0 on theBenchmark for (2999ds/183Mi)
% 0.14/0.38 % (23647)lrs+1002_1:128_aac=none:au=on:cnfonf=lazy_not_gen_be_off:sos=all:i=2:si=on:rtra=on_0 on theBenchmark for (2999ds/2Mi)
% 0.14/0.38 % (23648)lrs+1002_1:1_au=on:bd=off:e2e=on:sd=2:sos=on:ss=axioms:i=275:si=on:rtra=on_0 on theBenchmark for (2999ds/275Mi)
% 0.14/0.38 % (23645)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.14/0.38 % (23644)lrs+10_1:1_c=on:cnfonf=conj_eager:fd=off:fe=off:kws=frequency:spb=intro:i=4:si=on:rtra=on_0 on theBenchmark for (2999ds/4Mi)
% 0.14/0.38 % (23649)lrs+1004_1:128_cond=on:e2e=on:sp=weighted_frequency:i=18:si=on:rtra=on_0 on theBenchmark for (2999ds/18Mi)
% 0.14/0.38 % (23650)lrs+10_1:1_bet=on:cnfonf=off:fd=off:hud=5:inj=on:i=3:si=on:rtra=on_0 on theBenchmark for (2999ds/3Mi)
% 0.14/0.38 % (23646)Instruction limit reached!
% 0.14/0.38 % (23646)------------------------------
% 0.14/0.38 % (23646)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.14/0.38 % (23646)Termination reason: Unknown
% 0.14/0.38 % (23646)Termination phase: Property scanning
% 0.14/0.38 % Exception at run slice level
% 0.14/0.38
% 0.14/0.38 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.14/0.38 % (23646)Memory used [KB]: 895
% 0.14/0.38 % (23646)Time elapsed: 0.003 s
% 0.14/0.38 % (23646)Instructions burned: 2 (million)
% 0.14/0.38 % (23646)------------------------------
% 0.14/0.38 % (23646)------------------------------
% 0.14/0.38 % (23650)Instruction limit reached!
% 0.14/0.38 % (23650)------------------------------
% 0.14/0.38 % (23650)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.14/0.38 % (23650)Termination reason: Unknown
% 0.14/0.38 % (23650)Termination phase: Saturation
% 0.14/0.38
% 0.14/0.38 % (23650)Memory used [KB]: 5500
% 0.14/0.38 % (23650)Time elapsed: 0.004 s
% 0.14/0.38 % (23650)Instructions burned: 3 (million)
% 0.14/0.38 % (23650)------------------------------
% 0.14/0.38 % (23650)------------------------------
% 0.14/0.38 % (23644)Instruction limit reached!
% 0.14/0.38 % (23644)------------------------------
% 0.14/0.38 % (23644)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.14/0.38 % (23644)Termination reason: Unknown
% 0.14/0.38 % (23644)Termination phase: Saturation
% 0.14/0.38
% 0.14/0.38 % (23644)Memory used [KB]: 5500
% 0.14/0.38 % (23644)Time elapsed: 0.004 s
% 0.14/0.38 % (23644)Instructions burned: 4 (million)
% 0.14/0.38 % (23644)------------------------------
% 0.14/0.38 % (23644)------------------------------
% 0.14/0.38 % (23648)Refutation not found, incomplete strategy
% 0.14/0.38 % (23648)------------------------------
% 0.14/0.38 % (23648)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.14/0.38 % (23648)Termination reason: Refutation not found, incomplete strategy
% 0.14/0.38
% 0.14/0.38
% 0.14/0.38 % (23648)Memory used [KB]: 5500
% 0.14/0.38 % (23648)Time elapsed: 0.006 s
% 0.14/0.38 % (23648)Instructions burned: 6 (million)
% 0.14/0.38 % (23648)------------------------------
% 0.14/0.38 % (23648)------------------------------
% 0.14/0.39 % (23645)First to succeed.
% 0.14/0.39 % (23649)Instruction limit reached!
% 0.14/0.39 % (23649)------------------------------
% 0.14/0.39 % (23649)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.14/0.39 % (23649)Termination reason: Unknown
% 0.14/0.39 % (23649)Termination phase: Saturation
% 0.14/0.39
% 0.14/0.39 % (23649)Memory used [KB]: 5628
% 0.14/0.39 % (23649)Time elapsed: 0.013 s
% 0.14/0.39 % (23649)Instructions burned: 18 (million)
% 0.14/0.39 % (23649)------------------------------
% 0.14/0.39 % (23649)------------------------------
% 0.14/0.39 % (23645)Refutation found. Thanks to Tanya!
% 0.14/0.39 % SZS status Theorem for theBenchmark
% 0.14/0.39 % SZS output start Proof for theBenchmark
% See solution above
% 0.14/0.39 % (23645)------------------------------
% 0.14/0.39 % (23645)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.14/0.39 % (23645)Termination reason: Refutation
% 0.14/0.39
% 0.14/0.39 % (23645)Memory used [KB]: 5628
% 0.14/0.39 % (23645)Time elapsed: 0.014 s
% 0.14/0.39 % (23645)Instructions burned: 16 (million)
% 0.14/0.39 % (23645)------------------------------
% 0.14/0.39 % (23645)------------------------------
% 0.14/0.39 % (23642)Success in time 0.016 s
% 0.14/0.39 % Vampire---4.8 exiting
%------------------------------------------------------------------------------