TSTP Solution File: SEV489^1 by Vampire---4.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.9
% Problem : SEV489^1 : TPTP v8.2.0. Released v7.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire %s %d THM
% Computer : n028.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:05 EDT 2024
% Result : Theorem 0.11s 0.37s
% Output : Refutation 0.11s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 3
% Syntax : Number of formulae : 16 ( 8 unt; 0 typ; 0 def)
% Number of atoms : 78 ( 21 equ; 0 cnn)
% Maximal formula atoms : 4 ( 4 avg)
% Number of connectives : 100 ( 14 ~; 0 |; 4 &; 74 @)
% ( 1 <=>; 7 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 5 avg)
% Number of types : 2 ( 1 usr)
% Number of type conns : 8 ( 8 >; 0 *; 0 +; 0 <<)
% Number of symbols : 8 ( 5 usr; 3 con; 0-4 aty)
% Number of variables : 34 ( 0 ^ 28 !; 6 ?; 34 :)
% Comments :
%------------------------------------------------------------------------------
thf(type_def_6,type,
sK0: $tType ).
thf(func_def_0,type,
'const/sets/INSERT':
!>[X0: $tType] : ( X0 > ( X0 > $o ) > X0 > $o ) ).
thf(func_def_1,type,
'const/sets/IN':
!>[X0: $tType] : ( X0 > ( X0 > $o ) > $o ) ).
thf(func_def_2,type,
'const/sets/EMPTY':
!>[X0: $tType] : ( X0 > $o ) ).
thf(func_def_6,type,
sK1: sK0 > $o ).
thf(func_def_7,type,
sK2: sK0 ).
thf(f27,plain,
$false,
inference(subsumption_resolution,[],[f25,f23]) ).
thf(f23,plain,
! [X0: $tType,X1: X0] :
( ( 'const/sets/IN' @ X0 @ X1 @ 'const/sets/EMPTY' @ X0 )
!= $true ),
inference(cnf_transformation,[],[f14]) ).
thf(f14,plain,
! [X0: $tType,X1: X0] :
( ( 'const/sets/IN' @ X0 @ X1 @ 'const/sets/EMPTY' @ X0 )
!= $true ),
inference(flattening,[],[f11]) ).
thf(f11,plain,
! [X0: $tType,X1: X0] :
( ( 'const/sets/IN' @ X0 @ X1 @ 'const/sets/EMPTY' @ X0 )
!= $true ),
inference(fool_elimination,[],[f10]) ).
thf(f10,plain,
! [X0: $tType,X1: X0] :
~ ( 'const/sets/IN' @ X0 @ X1 @ 'const/sets/EMPTY' @ X0 ),
inference(rectify,[],[f2]) ).
thf(f2,axiom,
! [X0: $tType,X1: X0] :
~ ( 'const/sets/IN' @ X0 @ X1 @ 'const/sets/EMPTY' @ X0 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p','thm/sets/NOT_IN_EMPTY_') ).
thf(f25,plain,
( ( 'const/sets/IN' @ sK0 @ sK2 @ 'const/sets/EMPTY' @ sK0 )
= $true ),
inference(cnf_transformation,[],[f19]) ).
thf(f19,plain,
( ( ( 'const/sets/IN' @ sK0 @ sK2 @ 'const/sets/EMPTY' @ sK0 )
= $true )
& ( ( sK1 @ sK2 )
!= $true ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2])],[f15,f18]) ).
thf(f18,plain,
( ? [X0: $tType,X1: X0 > $o,X2: X0] :
( ( ( 'const/sets/IN' @ X0 @ X2 @ 'const/sets/EMPTY' @ X0 )
= $true )
& ( ( X1 @ X2 )
!= $true ) )
=> ( ( ( 'const/sets/IN' @ sK0 @ sK2 @ 'const/sets/EMPTY' @ sK0 )
= $true )
& ( ( sK1 @ sK2 )
!= $true ) ) ),
introduced(choice_axiom,[]) ).
thf(f15,plain,
? [X0: $tType,X1: X0 > $o,X2: X0] :
( ( ( 'const/sets/IN' @ X0 @ X2 @ 'const/sets/EMPTY' @ X0 )
= $true )
& ( ( X1 @ X2 )
!= $true ) ),
inference(ennf_transformation,[],[f13]) ).
thf(f13,plain,
~ ! [X0: $tType,X1: X0 > $o,X2: X0] :
( ( ( 'const/sets/IN' @ X0 @ X2 @ 'const/sets/EMPTY' @ X0 )
= $true )
=> ( ( X1 @ X2 )
= $true ) ),
inference(flattening,[],[f12]) ).
thf(f12,plain,
~ ! [X0: $tType,X1: X0 > $o,X2: X0] :
( ( ( 'const/sets/IN' @ X0 @ X2 @ 'const/sets/EMPTY' @ X0 )
= $true )
=> ( ( X1 @ X2 )
= $true ) ),
inference(true_and_false_elimination,[],[f7]) ).
thf(f7,plain,
~ ! [X0: $tType,X1: X0 > $o] :
( $true
<=> ! [X2: X0] :
( ( ( 'const/sets/IN' @ X0 @ X2 @ 'const/sets/EMPTY' @ X0 )
= $true )
=> ( ( X1 @ X2 )
= $true ) ) ),
inference(fool_elimination,[],[f6]) ).
thf(f6,plain,
~ ! [X0: $tType,X1: X0 > $o] :
( $true
= ( ! [X2: X0] :
( ( 'const/sets/IN' @ X0 @ X2 @ 'const/sets/EMPTY' @ X0 )
=> ( X1 @ X2 ) ) ) ),
inference(rectify,[],[f4]) ).
thf(f4,negated_conjecture,
~ ! [X0: $tType,X4: X0 > $o] :
( $true
= ( ! [X1: X0] :
( ( 'const/sets/IN' @ X0 @ X1 @ 'const/sets/EMPTY' @ X0 )
=> ( X4 @ X1 ) ) ) ),
inference(negated_conjecture,[],[f3]) ).
thf(f3,conjecture,
! [X0: $tType,X4: X0 > $o] :
( $true
= ( ! [X1: X0] :
( ( 'const/sets/IN' @ X0 @ X1 @ 'const/sets/EMPTY' @ X0 )
=> ( X4 @ X1 ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p','thm/sets/FORALL_IN_CLAUSES_0') ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : SEV489^1 : TPTP v8.2.0. Released v7.0.0.
% 0.06/0.12 % Command : run_vampire %s %d THM
% 0.11/0.32 % Computer : n028.cluster.edu
% 0.11/0.32 % Model : x86_64 x86_64
% 0.11/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.32 % Memory : 8042.1875MB
% 0.11/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.32 % CPULimit : 300
% 0.11/0.32 % WCLimit : 300
% 0.11/0.32 % DateTime : Fri Jun 21 19:36:24 EDT 2024
% 0.11/0.32 % CPUTime :
% 0.11/0.34 This is a TH1_THM_EQU_NAR problem
% 0.11/0.34 Running higher-order theorem proving
% 0.11/0.34 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.11/0.36 % (22935)lrs+1004_1:128_cond=on:e2e=on:sp=weighted_frequency:i=18:si=on:rtra=on_0 on theBenchmark for (2999ds/18Mi)
% 0.11/0.36 % (22929)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.11/0.36 % (22931)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.11/0.36 % (22930)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.11/0.36 % (22932)lrs+10_1:1_au=on:inj=on:i=2:si=on:rtra=on_0 on theBenchmark for (2999ds/2Mi)
% 0.11/0.36 % (22933)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.11/0.36 % (22934)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.11/0.36 % (22935)First to succeed.
% 0.11/0.36 % Exception at run slice level
% 0.11/0.36 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.11/0.37 % (22934)Also succeeded, but the first one will report.
% 0.11/0.37 % (22932)Instruction limit reached!
% 0.11/0.37 % (22932)------------------------------
% 0.11/0.37 % (22932)Version: Vampire 4.8 (commit 11aac991b on 2023-10-04 16:26:07 +0200)
% 0.11/0.37 % (22932)Termination reason: Unknown
% 0.11/0.37 % (22932)Termination phase: Saturation
% 0.11/0.37
% 0.11/0.37 % (22932)Memory used [KB]: 5500
% 0.11/0.37 % (22932)Time elapsed: 0.004 s
% 0.11/0.37 % (22932)Instructions burned: 2 (million)
% 0.11/0.37 % (22932)------------------------------
% 0.11/0.37 % (22932)------------------------------
% 0.11/0.37 % (22935)Refutation found. Thanks to Tanya!
% 0.11/0.37 % SZS status Theorem for theBenchmark
% 0.11/0.37 % SZS output start Proof for theBenchmark
% See solution above
% 0.11/0.37 % (22935)------------------------------
% 0.11/0.37 % (22935)Version: Vampire 4.8 (commit 11aac991b on 2023-10-04 16:26:07 +0200)
% 0.11/0.37 % (22935)Termination reason: Refutation
% 0.11/0.37
% 0.11/0.37 % (22935)Memory used [KB]: 5500
% 0.11/0.37 % (22935)Time elapsed: 0.004 s
% 0.11/0.37 % (22935)Instructions burned: 2 (million)
% 0.11/0.37 % (22935)------------------------------
% 0.11/0.37 % (22935)------------------------------
% 0.11/0.37 % (22928)Success in time 0.017 s
%------------------------------------------------------------------------------