TSTP Solution File: SEV476^1 by Vampire---4.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.9
% Problem : SEV476^1 : TPTP v8.2.0. Released v7.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire %s %d THM
% Computer : n023.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:02 EDT 2024
% Result : Theorem 0.21s 0.38s
% Output : Refutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 4
% Syntax : Number of formulae : 25 ( 7 unt; 0 typ; 0 def)
% Number of atoms : 148 ( 35 equ; 0 cnn)
% Maximal formula atoms : 4 ( 5 avg)
% Number of connectives : 197 ( 19 ~; 10 |; 7 &; 153 @)
% ( 0 <=>; 8 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 6 avg)
% Number of types : 2 ( 1 usr)
% Number of type conns : 38 ( 38 >; 0 *; 0 +; 0 <<)
% Number of symbols : 10 ( 7 usr; 2 con; 0-4 aty)
% Number of variables : 56 ( 0 ^ 50 !; 6 ?; 56 :)
% Comments :
%------------------------------------------------------------------------------
thf(type_def_6,type,
sK0: $tType ).
thf(func_def_0,type,
'const/sets/SUBSET':
!>[X0: $tType] : ( ( X0 > $o ) > ( X0 > $o ) > $o ) ).
thf(func_def_1,type,
'const/sets/FINITE':
!>[X0: $tType] : ( ( X0 > $o ) > $o ) ).
thf(func_def_2,type,
'const/sets/DIFF':
!>[X0: $tType] : ( ( X0 > $o ) > ( X0 > $o ) > X0 > $o ) ).
thf(func_def_4,type,
vEPSILON:
!>[X0: $tType] : ( ( X0 > $o ) > X0 ) ).
thf(func_def_7,type,
sK1: sK0 > $o ).
thf(func_def_8,type,
sK2: sK0 > $o ).
thf(func_def_10,type,
ph4:
!>[X0: $tType] : X0 ).
thf(f28,plain,
$false,
inference(trivial_inequality_removal,[],[f25]) ).
thf(f25,plain,
$true != $true,
inference(superposition,[],[f18,f24]) ).
thf(f24,plain,
! [X0: sK0 > $o] :
( ( 'const/sets/FINITE' @ sK0 @ ( 'const/sets/DIFF' @ sK0 @ sK1 @ X0 ) )
= $true ),
inference(trivial_inequality_removal,[],[f23]) ).
thf(f23,plain,
! [X0: sK0 > $o] :
( ( $true != $true )
| ( ( 'const/sets/FINITE' @ sK0 @ ( 'const/sets/DIFF' @ sK0 @ sK1 @ X0 ) )
= $true ) ),
inference(superposition,[],[f22,f19]) ).
thf(f19,plain,
( $true
= ( 'const/sets/FINITE' @ sK0 @ sK1 ) ),
inference(cnf_transformation,[],[f16]) ).
thf(f16,plain,
( ( $true
= ( 'const/sets/FINITE' @ sK0 @ sK1 ) )
& ( ( 'const/sets/FINITE' @ sK0 @ ( 'const/sets/DIFF' @ sK0 @ sK1 @ sK2 ) )
!= $true ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2])],[f12,f15]) ).
thf(f15,plain,
( ? [X0: $tType,X1: X0 > $o,X2: X0 > $o] :
( ( ( 'const/sets/FINITE' @ X0 @ X1 )
= $true )
& ( ( 'const/sets/FINITE' @ X0 @ ( 'const/sets/DIFF' @ X0 @ X1 @ X2 ) )
!= $true ) )
=> ( ( $true
= ( 'const/sets/FINITE' @ sK0 @ sK1 ) )
& ( ( 'const/sets/FINITE' @ sK0 @ ( 'const/sets/DIFF' @ sK0 @ sK1 @ sK2 ) )
!= $true ) ) ),
introduced(choice_axiom,[]) ).
thf(f12,plain,
? [X0: $tType,X1: X0 > $o,X2: X0 > $o] :
( ( ( 'const/sets/FINITE' @ X0 @ X1 )
= $true )
& ( ( 'const/sets/FINITE' @ X0 @ ( 'const/sets/DIFF' @ X0 @ X1 @ X2 ) )
!= $true ) ),
inference(ennf_transformation,[],[f9]) ).
thf(f9,plain,
~ ! [X0: $tType,X1: X0 > $o,X2: X0 > $o] :
( ( ( 'const/sets/FINITE' @ X0 @ X1 )
= $true )
=> ( ( 'const/sets/FINITE' @ X0 @ ( 'const/sets/DIFF' @ X0 @ X1 @ X2 ) )
= $true ) ),
inference(fool_elimination,[],[f8]) ).
thf(f8,plain,
~ ! [X0: $tType,X1: X0 > $o,X2: X0 > $o] :
( ( 'const/sets/FINITE' @ X0 @ X1 )
=> ( 'const/sets/FINITE' @ X0 @ ( 'const/sets/DIFF' @ X0 @ X1 @ X2 ) ) ),
inference(rectify,[],[f4]) ).
thf(f4,negated_conjecture,
~ ! [X0: $tType,X1: X0 > $o,X2: X0 > $o] :
( ( 'const/sets/FINITE' @ X0 @ X1 )
=> ( 'const/sets/FINITE' @ X0 @ ( 'const/sets/DIFF' @ X0 @ X1 @ X2 ) ) ),
inference(negated_conjecture,[],[f3]) ).
thf(f3,conjecture,
! [X0: $tType,X1: X0 > $o,X2: X0 > $o] :
( ( 'const/sets/FINITE' @ X0 @ X1 )
=> ( 'const/sets/FINITE' @ X0 @ ( 'const/sets/DIFF' @ X0 @ X1 @ X2 ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p','thm/sets/FINITE_DIFF_') ).
thf(f22,plain,
! [X0: $tType,X2: X0 > $o,X1: X0 > $o] :
( ( ( 'const/sets/FINITE' @ X0 @ X1 )
!= $true )
| ( ( 'const/sets/FINITE' @ X0 @ ( 'const/sets/DIFF' @ X0 @ X1 @ X2 ) )
= $true ) ),
inference(trivial_inequality_removal,[],[f21]) ).
thf(f21,plain,
! [X0: $tType,X2: X0 > $o,X1: X0 > $o] :
( ( ( 'const/sets/FINITE' @ X0 @ X1 )
!= $true )
| ( ( 'const/sets/FINITE' @ X0 @ ( 'const/sets/DIFF' @ X0 @ X1 @ X2 ) )
= $true )
| ( $true != $true ) ),
inference(superposition,[],[f17,f20]) ).
thf(f20,plain,
! [X0: $tType,X2: X0 > $o,X1: X0 > $o] :
( ( 'const/sets/SUBSET' @ X0 @ ( 'const/sets/DIFF' @ X0 @ X1 @ X2 ) @ X1 )
= $true ),
inference(cnf_transformation,[],[f11]) ).
thf(f11,plain,
! [X0: $tType,X1: X0 > $o,X2: X0 > $o] :
( ( 'const/sets/SUBSET' @ X0 @ ( 'const/sets/DIFF' @ X0 @ X1 @ X2 ) @ X1 )
= $true ),
inference(fool_elimination,[],[f10]) ).
thf(f10,plain,
! [X0: $tType,X1: X0 > $o,X2: X0 > $o] : ( 'const/sets/SUBSET' @ X0 @ ( 'const/sets/DIFF' @ X0 @ X1 @ X2 ) @ X1 ),
inference(rectify,[],[f1]) ).
thf(f1,axiom,
! [X0: $tType,X1: X0 > $o,X2: X0 > $o] : ( 'const/sets/SUBSET' @ X0 @ ( 'const/sets/DIFF' @ X0 @ X1 @ X2 ) @ X1 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p','thm/sets/SUBSET_DIFF_') ).
thf(f17,plain,
! [X0: $tType,X2: X0 > $o,X1: X0 > $o] :
( ( ( 'const/sets/SUBSET' @ X0 @ X1 @ X2 )
!= $true )
| ( ( 'const/sets/FINITE' @ X0 @ X1 )
= $true )
| ( ( 'const/sets/FINITE' @ X0 @ X2 )
!= $true ) ),
inference(cnf_transformation,[],[f14]) ).
thf(f14,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(flattening,[],[f13]) ).
thf(f13,plain,
! [X0: $tType,X1: X0 > $o,X2: X0 > $o] :
( ( ( 'const/sets/FINITE' @ X0 @ X1 )
= $true )
| ( ( 'const/sets/SUBSET' @ X0 @ X1 @ X2 )
!= $true )
| ( ( 'const/sets/FINITE' @ X0 @ X2 )
!= $true ) ),
inference(ennf_transformation,[],[f7]) ).
thf(f7,plain,
! [X0: $tType,X1: X0 > $o,X2: X0 > $o] :
( ( ( ( 'const/sets/SUBSET' @ X0 @ X1 @ X2 )
= $true )
& ( ( 'const/sets/FINITE' @ X0 @ X2 )
= $true ) )
=> ( ( 'const/sets/FINITE' @ X0 @ X1 )
= $true ) ),
inference(fool_elimination,[],[f6]) ).
thf(f6,plain,
! [X0: $tType,X1: X0 > $o,X2: X0 > $o] :
( ( ( 'const/sets/SUBSET' @ X0 @ X1 @ X2 )
& ( 'const/sets/FINITE' @ X0 @ X2 ) )
=> ( 'const/sets/FINITE' @ X0 @ X1 ) ),
inference(rectify,[],[f2]) ).
thf(f2,axiom,
! [X0: $tType,X1: X0 > $o,X2: X0 > $o] :
( ( ( 'const/sets/SUBSET' @ X0 @ X1 @ X2 )
& ( 'const/sets/FINITE' @ X0 @ X2 ) )
=> ( 'const/sets/FINITE' @ X0 @ X1 ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p','thm/sets/FINITE_SUBSET_') ).
thf(f18,plain,
( ( 'const/sets/FINITE' @ sK0 @ ( 'const/sets/DIFF' @ sK0 @ sK1 @ sK2 ) )
!= $true ),
inference(cnf_transformation,[],[f16]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SEV476^1 : TPTP v8.2.0. Released v7.0.0.
% 0.03/0.12 % Command : run_vampire %s %d THM
% 0.12/0.33 % Computer : n023.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 300
% 0.12/0.33 % DateTime : Fri Jun 21 18:58:39 EDT 2024
% 0.12/0.33 % CPUTime :
% 0.12/0.35 This is a TH1_THM_NEQ_NAR problem
% 0.12/0.35 Running higher-order theorem proving
% 0.12/0.35 Running /export/starexec/sandbox/solver/bin/vampire_ho --cores 7 --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_hol /export/starexec/sandbox/benchmark/theBenchmark.p -m 16384 -t 300
% 0.21/0.37 % (5859)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.21/0.37 % (5861)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.21/0.37 % (5858)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.21/0.37 % (5865)lrs+1004_1:128_cond=on:e2e=on:sp=weighted_frequency:i=18:si=on:rtra=on_0 on theBenchmark for (2999ds/18Mi)
% 0.21/0.37 % (5864)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.21/0.37 % (5863)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.21/0.37 % (5862)lrs+10_1:1_au=on:inj=on:i=2:si=on:rtra=on_0 on theBenchmark for (2999ds/2Mi)
% 0.21/0.37 % Exception at run slice level
% 0.21/0.37 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.38 % (5864)Refutation not found, incomplete strategy
% 0.21/0.38 % (5864)------------------------------
% 0.21/0.38 % (5864)Version: Vampire 4.8 (commit 11aac991b on 2023-10-04 16:26:07 +0200)
% 0.21/0.38 % (5864)Termination reason: Refutation not found, incomplete strategy
% 0.21/0.38
% 0.21/0.38
% 0.21/0.38 % (5864)Memory used [KB]: 5500
% 0.21/0.38 % (5864)Time elapsed: 0.004 s
% 0.21/0.38 % (5864)Instructions burned: 2 (million)
% 0.21/0.38 % (5864)------------------------------
% 0.21/0.38 % (5864)------------------------------
% 0.21/0.38 % (5862)Instruction limit reached!
% 0.21/0.38 % (5862)------------------------------
% 0.21/0.38 % (5862)Version: Vampire 4.8 (commit 11aac991b on 2023-10-04 16:26:07 +0200)
% 0.21/0.38 % (5862)Termination reason: Unknown
% 0.21/0.38 % (5862)Termination phase: Saturation
% 0.21/0.38
% 0.21/0.38 % (5862)Memory used [KB]: 5500
% 0.21/0.38 % (5861)First to succeed.
% 0.21/0.38 % (5862)Time elapsed: 0.004 s
% 0.21/0.38 % (5862)Instructions burned: 2 (million)
% 0.21/0.38 % (5862)------------------------------
% 0.21/0.38 % (5862)------------------------------
% 0.21/0.38 % (5859)Instruction limit reached!
% 0.21/0.38 % (5859)------------------------------
% 0.21/0.38 % (5859)Version: Vampire 4.8 (commit 11aac991b on 2023-10-04 16:26:07 +0200)
% 0.21/0.38 % (5859)Termination reason: Unknown
% 0.21/0.38 % (5859)Termination phase: Saturation
% 0.21/0.38
% 0.21/0.38 % (5859)Memory used [KB]: 5500
% 0.21/0.38 % (5859)Time elapsed: 0.006 s
% 0.21/0.38 % (5859)Instructions burned: 5 (million)
% 0.21/0.38 % (5859)------------------------------
% 0.21/0.38 % (5859)------------------------------
% 0.21/0.38 % (5861)Refutation found. Thanks to Tanya!
% 0.21/0.38 % SZS status Theorem for theBenchmark
% 0.21/0.38 % SZS output start Proof for theBenchmark
% See solution above
% 0.21/0.38 % (5861)------------------------------
% 0.21/0.38 % (5861)Version: Vampire 4.8 (commit 11aac991b on 2023-10-04 16:26:07 +0200)
% 0.21/0.38 % (5861)Termination reason: Refutation
% 0.21/0.38
% 0.21/0.38 % (5861)Memory used [KB]: 5500
% 0.21/0.38 % (5861)Time elapsed: 0.006 s
% 0.21/0.38 % (5861)Instructions burned: 3 (million)
% 0.21/0.38 % (5861)------------------------------
% 0.21/0.38 % (5861)------------------------------
% 0.21/0.38 % (5851)Success in time 0.021 s
%------------------------------------------------------------------------------