TSTP Solution File: SEV485^1 by Vampire---4.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.9
% Problem : SEV485^1 : TPTP v8.2.0. Released v7.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire %s %d THM
% Computer : n020.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Mon Jun 24 16:04:04 EDT 2024
% Result : Theorem 0.15s 0.31s
% Output : Refutation 0.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 3
% Syntax : Number of formulae : 19 ( 9 unt; 0 typ; 0 def)
% Number of atoms : 71 ( 21 equ; 0 cnn)
% Maximal formula atoms : 2 ( 3 avg)
% Number of connectives : 105 ( 5 ~; 3 |; 5 &; 92 @)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 5 ( 3 avg)
% Number of types : 2 ( 1 usr)
% Number of type conns : 6 ( 6 >; 0 *; 0 +; 0 <<)
% Number of symbols : 12 ( 9 usr; 3 con; 0-3 aty)
% Number of variables : 18 ( 0 ^ 18 !; 0 ?; 18 :)
% Comments :
%------------------------------------------------------------------------------
thf(type_def_6,type,
'type/nums/num': $tType ).
thf(func_def_0,type,
'type/nums/num': $tType ).
thf(func_def_1,type,
'const/sets/UNIV':
!>[X0: $tType] : ( X0 > $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_5,type,
'const/nums/NUMERAL': 'type/nums/num' > 'type/nums/num' ).
thf(func_def_6,type,
'const/nums/BIT1': 'type/nums/num' > 'type/nums/num' ).
thf(func_def_7,type,
'const/nums/BIT0': 'type/nums/num' > 'type/nums/num' ).
thf(func_def_8,type,
'const/nums/_0': 'type/nums/num' ).
thf(func_def_15,type,
ph1:
!>[X0: $tType] : X0 ).
thf(f27,plain,
$false,
inference(subsumption_resolution,[],[f26,f13]) ).
thf(f13,plain,
( ( 'const/sets/FINITE' @ $o @ 'const/sets/UNIV' @ $o )
!= $true ),
inference(cnf_transformation,[],[f12]) ).
thf(f12,plain,
( ( 'const/sets/FINITE' @ $o @ 'const/sets/UNIV' @ $o )
!= $true ),
inference(flattening,[],[f9]) ).
thf(f9,plain,
( ( 'const/sets/FINITE' @ $o @ 'const/sets/UNIV' @ $o )
!= $true ),
inference(fool_elimination,[],[f8]) ).
thf(f8,plain,
~ ( 'const/sets/FINITE' @ $o @ 'const/sets/UNIV' @ $o ),
inference(rectify,[],[f4]) ).
thf(f4,negated_conjecture,
~ ( 'const/sets/FINITE' @ $o @ 'const/sets/UNIV' @ $o ),
inference(negated_conjecture,[],[f3]) ).
thf(f3,conjecture,
'const/sets/FINITE' @ $o @ 'const/sets/UNIV' @ $o,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p','thm/sets/FINITE_BOOL_') ).
thf(f26,plain,
( ( 'const/sets/FINITE' @ $o @ 'const/sets/UNIV' @ $o )
= $true ),
inference(trivial_inequality_removal,[],[f24]) ).
thf(f24,plain,
( ( ( 'const/sets/FINITE' @ $o @ 'const/sets/UNIV' @ $o )
= $true )
| ( $true = $false ) ),
inference(superposition,[],[f18,f14]) ).
thf(f14,plain,
( ( 'const/sets/HAS_SIZE' @ $o @ 'const/sets/UNIV' @ $o @ ( 'const/nums/NUMERAL' @ ( 'const/nums/BIT0' @ ( 'const/nums/BIT1' @ 'const/nums/_0' ) ) ) )
= $true ),
inference(cnf_transformation,[],[f11]) ).
thf(f11,plain,
( ( 'const/sets/HAS_SIZE' @ $o @ 'const/sets/UNIV' @ $o @ ( 'const/nums/NUMERAL' @ ( 'const/nums/BIT0' @ ( 'const/nums/BIT1' @ 'const/nums/_0' ) ) ) )
= $true ),
inference(fool_elimination,[],[f10]) ).
thf(f10,plain,
'const/sets/HAS_SIZE' @ $o @ 'const/sets/UNIV' @ $o @ ( 'const/nums/NUMERAL' @ ( 'const/nums/BIT0' @ ( 'const/nums/BIT1' @ 'const/nums/_0' ) ) ),
inference(rectify,[],[f2]) ).
thf(f2,axiom,
'const/sets/HAS_SIZE' @ $o @ 'const/sets/UNIV' @ $o @ ( 'const/nums/NUMERAL' @ ( 'const/nums/BIT0' @ ( 'const/nums/BIT1' @ 'const/nums/_0' ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p','thm/sets/HAS_SIZE_BOOL_') ).
thf(f18,plain,
! [X0: $tType,X2: 'type/nums/num',X1: X0 > $o] :
( ( ( 'const/sets/HAS_SIZE' @ X0 @ X1 @ X2 )
= $false )
| ( ( 'const/sets/FINITE' @ X0 @ X1 )
= $true ) ),
inference(binary_proxy_clausification,[],[f17]) ).
thf(f17,plain,
! [X0: $tType,X2: 'type/nums/num',X1: X0 > $o] :
( ( $true
= ( ( ( 'const/sets/CARD' @ X0 @ X1 )
= X2 )
& ( 'const/sets/FINITE' @ X0 @ X1 ) ) )
| ( ( 'const/sets/HAS_SIZE' @ X0 @ X1 @ X2 )
= $false ) ),
inference(binary_proxy_clausification,[],[f15]) ).
thf(f15,plain,
! [X0: $tType,X2: 'type/nums/num',X1: X0 > $o] :
( ( 'const/sets/HAS_SIZE' @ X0 @ X1 @ X2 )
= ( ( ( 'const/sets/CARD' @ X0 @ X1 )
= X2 )
& ( 'const/sets/FINITE' @ X0 @ X1 ) ) ),
inference(cnf_transformation,[],[f7]) ).
thf(f7,plain,
! [X0: $tType,X1: X0 > $o,X2: 'type/nums/num'] :
( ( 'const/sets/HAS_SIZE' @ X0 @ X1 @ X2 )
= ( ( ( 'const/sets/CARD' @ X0 @ X1 )
= X2 )
& ( 'const/sets/FINITE' @ X0 @ X1 ) ) ),
inference(fool_elimination,[],[f6]) ).
thf(f6,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/sandbox2/benchmark/theBenchmark.p','thm/sets/HAS_SIZE_') ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.08 % Problem : SEV485^1 : TPTP v8.2.0. Released v7.0.0.
% 0.00/0.08 % Command : run_vampire %s %d THM
% 0.08/0.28 % Computer : n020.cluster.edu
% 0.08/0.28 % Model : x86_64 x86_64
% 0.08/0.28 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.28 % Memory : 8042.1875MB
% 0.08/0.28 % OS : Linux 3.10.0-693.el7.x86_64
% 0.08/0.28 % CPULimit : 300
% 0.08/0.28 % WCLimit : 300
% 0.08/0.28 % DateTime : Fri Jun 21 19:23:39 EDT 2024
% 0.08/0.28 % CPUTime :
% 0.14/0.30 This is a TH1_THM_EQU_NAR problem
% 0.14/0.30 Running higher-order theorem proving
% 0.14/0.30 Running /export/starexec/sandbox2/solver/bin/vampire_ho --cores 7 --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_hol /export/starexec/sandbox2/benchmark/theBenchmark.p -m 16384 -t 300
% 0.14/0.31 % (4663)lrs+10_1:1_au=on:inj=on:i=2:si=on:rtra=on_0 on theBenchmark for (2999ds/2Mi)
% 0.14/0.31 % (4661)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.31 % (4663)First to succeed.
% 0.15/0.31 % (4661)Also succeeded, but the first one will report.
% 0.15/0.31 % (4666)lrs+1004_1:128_cond=on:e2e=on:sp=weighted_frequency:i=18:si=on:rtra=on_0 on theBenchmark for (2999ds/18Mi)
% 0.15/0.31 % (4663)Refutation found. Thanks to Tanya!
% 0.15/0.31 % SZS status Theorem for theBenchmark
% 0.15/0.31 % SZS output start Proof for theBenchmark
% See solution above
% 0.15/0.31 % (4663)------------------------------
% 0.15/0.31 % (4663)Version: Vampire 4.8 (commit 11aac991b on 2023-10-04 16:26:07 +0200)
% 0.15/0.31 % (4663)Termination reason: Refutation
% 0.15/0.31
% 0.15/0.31 % (4663)Memory used [KB]: 5500
% 0.15/0.31 % (4663)Time elapsed: 0.003 s
% 0.15/0.31 % (4663)Instructions burned: 1 (million)
% 0.15/0.31 % (4663)------------------------------
% 0.15/0.31 % (4663)------------------------------
% 0.15/0.31 % (4655)Success in time 0.012 s
%------------------------------------------------------------------------------