TSTP Solution File: SET011^5 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SET011^5 : TPTP v8.2.0. Released v4.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 : n014.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 : Tue May 21 03:07:38 EDT 2024
% Result : Theorem 0.19s 0.35s
% Output : Refutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 18
% Number of leaves : 12
% Syntax : Number of formulae : 52 ( 12 unt; 6 typ; 0 def)
% Number of atoms : 243 ( 65 equ; 0 cnn)
% Maximal formula atoms : 4 ( 5 avg)
% Number of connectives : 287 ( 64 ~; 42 |; 50 &; 126 @)
% ( 4 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 5 ( 3 avg)
% Number of types : 2 ( 1 usr)
% Number of type conns : 14 ( 14 >; 0 *; 0 +; 0 <<)
% Number of symbols : 11 ( 8 usr; 7 con; 0-2 aty)
% Number of variables : 33 ( 20 ^ 8 !; 4 ?; 33 :)
% ( 1 !>; 0 ?*; 0 @-; 0 @+)
% Comments :
%------------------------------------------------------------------------------
thf(type_def_5,type,
a: $tType ).
thf(func_def_0,type,
a: $tType ).
thf(func_def_8,type,
sK0: a > $o ).
thf(func_def_9,type,
sK1: a > $o ).
thf(func_def_11,type,
ph3:
!>[X0: $tType] : X0 ).
thf(func_def_12,type,
sK4: a ).
thf(f70,plain,
$false,
inference(avatar_sat_refutation,[],[f45,f50,f56,f63,f69]) ).
thf(f69,plain,
( ~ spl2_2
| ~ spl2_4 ),
inference(avatar_contradiction_clause,[],[f68]) ).
thf(f68,plain,
( $false
| ~ spl2_2
| ~ spl2_4 ),
inference(trivial_inequality_removal,[],[f65]) ).
thf(f65,plain,
( ( $false = $true )
| ~ spl2_2
| ~ spl2_4 ),
inference(superposition,[],[f55,f43]) ).
thf(f43,plain,
( ( $true
= ( sK0 @ sK4 ) )
| ~ spl2_2 ),
inference(avatar_component_clause,[],[f41]) ).
thf(f41,plain,
( spl2_2
<=> ( $true
= ( sK0 @ sK4 ) ) ),
introduced(avatar_definition,[new_symbols(naming,[spl2_2])]) ).
thf(f55,plain,
( ( $false
= ( sK0 @ sK4 ) )
| ~ spl2_4 ),
inference(avatar_component_clause,[],[f53]) ).
thf(f53,plain,
( spl2_4
<=> ( $false
= ( sK0 @ sK4 ) ) ),
introduced(avatar_definition,[new_symbols(naming,[spl2_4])]) ).
thf(f63,plain,
( ~ spl2_1
| ~ spl2_3 ),
inference(avatar_contradiction_clause,[],[f62]) ).
thf(f62,plain,
( $false
| ~ spl2_1
| ~ spl2_3 ),
inference(trivial_inequality_removal,[],[f59]) ).
thf(f59,plain,
( ( $false = $true )
| ~ spl2_1
| ~ spl2_3 ),
inference(superposition,[],[f39,f49]) ).
thf(f49,plain,
( ( ( sK1 @ sK4 )
= $false )
| ~ spl2_3 ),
inference(avatar_component_clause,[],[f47]) ).
thf(f47,plain,
( spl2_3
<=> ( ( sK1 @ sK4 )
= $false ) ),
introduced(avatar_definition,[new_symbols(naming,[spl2_3])]) ).
thf(f39,plain,
( ( ( sK1 @ sK4 )
= $true )
| ~ spl2_1 ),
inference(avatar_component_clause,[],[f37]) ).
thf(f37,plain,
( spl2_1
<=> ( ( sK1 @ sK4 )
= $true ) ),
introduced(avatar_definition,[new_symbols(naming,[spl2_1])]) ).
thf(f56,plain,
( spl2_3
| spl2_4 ),
inference(avatar_split_clause,[],[f21,f53,f47]) ).
thf(f21,plain,
( ( ( sK1 @ sK4 )
= $false )
| ( $false
= ( sK0 @ sK4 ) ) ),
inference(duplicate_literal_removal,[],[f20]) ).
thf(f20,plain,
( ( $false
= ( sK0 @ sK4 ) )
| ( $false
= ( sK0 @ sK4 ) )
| ( ( sK1 @ sK4 )
= $false ) ),
inference(not_proxy_clausification,[],[f18]) ).
thf(f18,plain,
( ( $false
= ( sK0 @ sK4 ) )
| ( ( ~ ( sK0 @ sK4 ) )
= $true )
| ( ( sK1 @ sK4 )
= $false ) ),
inference(binary_proxy_clausification,[],[f17]) ).
thf(f17,plain,
( ( ( ( sK1 @ sK4 )
& ~ ( sK0 @ sK4 ) )
= $true )
| ( ( sK1 @ sK4 )
= $false )
| ( $false
= ( sK0 @ sK4 ) ) ),
inference(duplicate_literal_removal,[],[f16]) ).
thf(f16,plain,
( ( ( sK1 @ sK4 )
= $false )
| ( ( sK1 @ sK4 )
= $false )
| ( ( ( sK1 @ sK4 )
& ~ ( sK0 @ sK4 ) )
= $true )
| ( $false
= ( sK0 @ sK4 ) ) ),
inference(binary_proxy_clausification,[],[f15]) ).
thf(f15,plain,
( ( ( sK1 @ sK4 )
= $false )
| ( $false
= ( ( sK1 @ sK4 )
& ( sK0 @ sK4 ) ) )
| ( ( ( sK1 @ sK4 )
& ~ ( sK0 @ sK4 ) )
= $true ) ),
inference(not_proxy_clausification,[],[f14]) ).
thf(f14,plain,
( ( ( sK1 @ sK4 )
= $false )
| ( $false
= ( ~ ( ( sK1 @ sK4 )
& ~ ( sK0 @ sK4 ) ) ) )
| ( $false
= ( ( sK1 @ sK4 )
& ( sK0 @ sK4 ) ) ) ),
inference(binary_proxy_clausification,[],[f13]) ).
thf(f13,plain,
( ( $false
= ( ~ ( ( sK1 @ sK4 )
& ~ ( sK0 @ sK4 ) )
& ( sK1 @ sK4 ) ) )
| ( $false
= ( ( sK1 @ sK4 )
& ( sK0 @ sK4 ) ) ) ),
inference(binary_proxy_clausification,[],[f11]) ).
thf(f11,plain,
( ( ( sK1 @ sK4 )
& ( sK0 @ sK4 ) )
!= ( ~ ( ( sK1 @ sK4 )
& ~ ( sK0 @ sK4 ) )
& ( sK1 @ sK4 ) ) ),
inference(beta_eta_normalization,[],[f10]) ).
thf(f10,plain,
( ( ^ [Y0: a] :
( ~ ( ( sK1 @ Y0 )
& ~ ( sK0 @ Y0 ) )
& ( sK1 @ Y0 ) )
@ sK4 )
!= ( ^ [Y0: a] :
( ( sK1 @ Y0 )
& ( sK0 @ Y0 ) )
@ sK4 ) ),
inference(negative_extensionality,[],[f9]) ).
thf(f9,plain,
( ( ^ [Y0: a] :
( ~ ( ( sK1 @ Y0 )
& ~ ( sK0 @ Y0 ) )
& ( sK1 @ Y0 ) ) )
!= ( ^ [Y0: a] :
( ( sK1 @ Y0 )
& ( sK0 @ Y0 ) ) ) ),
inference(cnf_transformation,[],[f8]) ).
thf(f8,plain,
( ( ^ [Y0: a] :
( ~ ( ( sK1 @ Y0 )
& ~ ( sK0 @ Y0 ) )
& ( sK1 @ Y0 ) ) )
!= ( ^ [Y0: a] :
( ( sK1 @ Y0 )
& ( sK0 @ Y0 ) ) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1])],[f6,f7]) ).
thf(f7,plain,
( ? [X0: a > $o,X1: a > $o] :
( ( ^ [Y0: a] :
( ( X1 @ Y0 )
& ( X0 @ Y0 ) ) )
!= ( ^ [Y0: a] :
( ~ ( ( X1 @ Y0 )
& ~ ( X0 @ Y0 ) )
& ( X1 @ Y0 ) ) ) )
=> ( ( ^ [Y0: a] :
( ~ ( ( sK1 @ Y0 )
& ~ ( sK0 @ Y0 ) )
& ( sK1 @ Y0 ) ) )
!= ( ^ [Y0: a] :
( ( sK1 @ Y0 )
& ( sK0 @ Y0 ) ) ) ) ),
introduced(choice_axiom,[]) ).
thf(f6,plain,
? [X0: a > $o,X1: a > $o] :
( ( ^ [Y0: a] :
( ( X1 @ Y0 )
& ( X0 @ Y0 ) ) )
!= ( ^ [Y0: a] :
( ~ ( ( X1 @ Y0 )
& ~ ( X0 @ Y0 ) )
& ( X1 @ Y0 ) ) ) ),
inference(ennf_transformation,[],[f5]) ).
thf(f5,plain,
~ ! [X0: a > $o,X1: a > $o] :
( ( ^ [Y0: a] :
( ( X1 @ Y0 )
& ( X0 @ Y0 ) ) )
= ( ^ [Y0: a] :
( ~ ( ( X1 @ Y0 )
& ~ ( X0 @ Y0 ) )
& ( X1 @ Y0 ) ) ) ),
inference(fool_elimination,[],[f4]) ).
thf(f4,plain,
~ ! [X0: a > $o,X1: a > $o] :
( ( ^ [X2: a] :
( ( X0 @ X2 )
& ( X1 @ X2 ) ) )
= ( ^ [X3: a] :
( ( X1 @ X3 )
& ~ ( ~ ( X0 @ X3 )
& ( X1 @ X3 ) ) ) ) ),
inference(rectify,[],[f2]) ).
thf(f2,negated_conjecture,
~ ! [X1: a > $o,X0: a > $o] :
( ( ^ [X2: a] :
( ( X1 @ X2 )
& ( X0 @ X2 ) ) )
= ( ^ [X2: a] :
( ( X0 @ X2 )
& ~ ( ~ ( X1 @ X2 )
& ( X0 @ X2 ) ) ) ) ),
inference(negated_conjecture,[],[f1]) ).
thf(f1,conjecture,
! [X1: a > $o,X0: a > $o] :
( ( ^ [X2: a] :
( ( X1 @ X2 )
& ( X0 @ X2 ) ) )
= ( ^ [X2: a] :
( ( X0 @ X2 )
& ~ ( ~ ( X1 @ X2 )
& ( X0 @ X2 ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cBOOL_PROP_82_pme) ).
thf(f50,plain,
( spl2_2
| spl2_3 ),
inference(avatar_split_clause,[],[f32,f47,f41]) ).
thf(f32,plain,
( ( ( sK1 @ sK4 )
= $false )
| ( $true
= ( sK0 @ sK4 ) ) ),
inference(duplicate_literal_removal,[],[f31]) ).
thf(f31,plain,
( ( ( sK1 @ sK4 )
= $false )
| ( $true
= ( sK0 @ sK4 ) )
| ( $true
= ( sK0 @ sK4 ) ) ),
inference(not_proxy_clausification,[],[f30]) ).
thf(f30,plain,
( ( ( ~ ( sK0 @ sK4 ) )
= $false )
| ( $true
= ( sK0 @ sK4 ) )
| ( ( sK1 @ sK4 )
= $false ) ),
inference(binary_proxy_clausification,[],[f29]) ).
thf(f29,plain,
( ( $false
= ( ( sK1 @ sK4 )
& ~ ( sK0 @ sK4 ) ) )
| ( $true
= ( sK0 @ sK4 ) ) ),
inference(not_proxy_clausification,[],[f24]) ).
thf(f24,plain,
( ( $true
= ( sK0 @ sK4 ) )
| ( ( ~ ( ( sK1 @ sK4 )
& ~ ( sK0 @ sK4 ) ) )
= $true ) ),
inference(binary_proxy_clausification,[],[f23]) ).
thf(f23,plain,
( ( ( ( sK1 @ sK4 )
& ( sK0 @ sK4 ) )
= $true )
| ( ( ~ ( ( sK1 @ sK4 )
& ~ ( sK0 @ sK4 ) ) )
= $true ) ),
inference(binary_proxy_clausification,[],[f12]) ).
thf(f12,plain,
( ( ( ~ ( ( sK1 @ sK4 )
& ~ ( sK0 @ sK4 ) )
& ( sK1 @ sK4 ) )
= $true )
| ( ( ( sK1 @ sK4 )
& ( sK0 @ sK4 ) )
= $true ) ),
inference(binary_proxy_clausification,[],[f11]) ).
thf(f45,plain,
spl2_1,
inference(avatar_split_clause,[],[f35,f37]) ).
thf(f35,plain,
( ( sK1 @ sK4 )
= $true ),
inference(duplicate_literal_removal,[],[f34]) ).
thf(f34,plain,
( ( ( sK1 @ sK4 )
= $true )
| ( ( sK1 @ sK4 )
= $true ) ),
inference(binary_proxy_clausification,[],[f22]) ).
thf(f22,plain,
( ( ( ( sK1 @ sK4 )
& ( sK0 @ sK4 ) )
= $true )
| ( ( sK1 @ sK4 )
= $true ) ),
inference(binary_proxy_clausification,[],[f12]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.02/0.10 % Problem : SET011^5 : TPTP v8.2.0. Released v4.0.0.
% 0.02/0.11 % 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.11/0.32 % Computer : n014.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 : Mon May 20 12:30:23 EDT 2024
% 0.11/0.32 % CPUTime :
% 0.11/0.32 This is a TH0_THM_EQU_NAR problem
% 0.11/0.32 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.11/0.34 % (14156)lrs+10_1:1_bet=on:cnfonf=off:fd=off:hud=5:inj=on:i=3:si=on:rtra=on_0 on theBenchmark for (3000ds/3Mi)
% 0.11/0.34 % (14152)lrs+10_1:1_au=on:inj=on:i=2:si=on:rtra=on_0 on theBenchmark for (3000ds/2Mi)
% 0.11/0.34 % (14153)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 (3000ds/2Mi)
% 0.11/0.34 % (14152)Instruction limit reached!
% 0.11/0.34 % (14152)------------------------------
% 0.11/0.34 % (14152)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.11/0.34 % (14152)Termination reason: Unknown
% 0.11/0.34 % (14156)Refutation not found, incomplete strategy
% 0.11/0.34 % (14156)------------------------------
% 0.11/0.34 % (14156)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.11/0.34 % (14156)Termination reason: Refutation not found, incomplete strategy
% 0.11/0.34
% 0.11/0.34
% 0.11/0.34 % (14156)Memory used [KB]: 5500
% 0.11/0.34 % (14156)Time elapsed: 0.002 s
% 0.11/0.34 % (14156)Instructions burned: 1 (million)
% 0.11/0.34 % (14156)------------------------------
% 0.11/0.34 % (14156)------------------------------
% 0.11/0.34 % (14153)Instruction limit reached!
% 0.11/0.34 % (14153)------------------------------
% 0.11/0.34 % (14153)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.11/0.34 % (14153)Termination reason: Unknown
% 0.11/0.34 % (14153)Termination phase: Saturation
% 0.11/0.34
% 0.11/0.34 % (14153)Memory used [KB]: 895
% 0.11/0.34 % (14153)Time elapsed: 0.002 s
% 0.11/0.34 % (14153)Instructions burned: 2 (million)
% 0.11/0.34 % (14153)------------------------------
% 0.11/0.34 % (14153)------------------------------
% 0.11/0.34 % (14152)Termination phase: Saturation
% 0.11/0.34
% 0.11/0.34 % (14152)Memory used [KB]: 5500
% 0.11/0.34 % (14152)Time elapsed: 0.003 s
% 0.11/0.34 % (14152)Instructions burned: 2 (million)
% 0.11/0.34 % (14152)------------------------------
% 0.11/0.34 % (14152)------------------------------
% 0.11/0.34 % (14149)lrs+1002_1:8_bd=off:fd=off:hud=10:tnu=1:i=183:si=on:rtra=on_0 on theBenchmark for (3000ds/183Mi)
% 0.11/0.34 % (14149)First to succeed.
% 0.11/0.34 % (14150)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 (3000ds/4Mi)
% 0.19/0.35 % (14149)Refutation found. Thanks to Tanya!
% 0.19/0.35 % SZS status Theorem for theBenchmark
% 0.19/0.35 % SZS output start Proof for theBenchmark
% See solution above
% 0.19/0.35 % (14149)------------------------------
% 0.19/0.35 % (14149)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.19/0.35 % (14149)Termination reason: Refutation
% 0.19/0.35
% 0.19/0.35 % (14149)Memory used [KB]: 5500
% 0.19/0.35 % (14149)Time elapsed: 0.005 s
% 0.19/0.35 % (14149)Instructions burned: 3 (million)
% 0.19/0.35 % (14149)------------------------------
% 0.19/0.35 % (14149)------------------------------
% 0.19/0.35 % (14148)Success in time 0.017 s
% 0.19/0.35 % Vampire---4.8 exiting
%------------------------------------------------------------------------------