TSTP Solution File: SYO351^5 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SYO351^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 : n006.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 09:04:06 EDT 2024
% Result : Theorem 0.14s 0.38s
% Output : Refutation 0.14s
% Verified :
% SZS Type : Refutation
% Derivation depth : 15
% Number of leaves : 10
% Syntax : Number of formulae : 45 ( 10 unt; 6 typ; 0 def)
% Number of atoms : 177 ( 52 equ; 0 cnn)
% Maximal formula atoms : 3 ( 4 avg)
% Number of connectives : 142 ( 41 ~; 29 |; 0 &; 53 @)
% ( 3 <=>; 6 =>; 0 <=; 0 <~>)
% Maximal formula depth : 4 ( 3 avg)
% Number of types : 2 ( 1 usr)
% Number of type conns : 17 ( 17 >; 0 *; 0 +; 0 <<)
% Number of symbols : 11 ( 7 usr; 8 con; 0-2 aty)
% ( 10 !!; 0 ??; 0 @@+; 0 @@-)
% Number of variables : 63 ( 52 ^ 10 !; 0 ?; 63 :)
% ( 1 !>; 0 ?*; 0 @-; 0 @+)
% Comments :
%------------------------------------------------------------------------------
thf(type_def_5,type,
a: $tType ).
thf(func_def_0,type,
a: $tType ).
thf(func_def_12,type,
ph1:
!>[X0: $tType] : X0 ).
thf(func_def_13,type,
sK2: a > $o ).
thf(func_def_14,type,
sK3: a ).
thf(func_def_15,type,
sK4: a ).
thf(f48,plain,
$false,
inference(avatar_sat_refutation,[],[f28,f33,f36,f42,f47]) ).
thf(f47,plain,
( ~ spl0_1
| spl0_2 ),
inference(avatar_contradiction_clause,[],[f46]) ).
thf(f46,plain,
( $false
| ~ spl0_1
| spl0_2 ),
inference(subsumption_resolution,[],[f45,f23]) ).
thf(f23,plain,
( ! [X1: a] :
( $false
= ( sK2 @ X1 ) )
| ~ spl0_1 ),
inference(avatar_component_clause,[],[f22]) ).
thf(f22,plain,
( spl0_1
<=> ! [X1: a] :
( $false
= ( sK2 @ X1 ) ) ),
introduced(avatar_definition,[new_symbols(naming,[spl0_1])]) ).
thf(f45,plain,
( ( ( sK2 @ sK4 )
!= $false )
| spl0_2 ),
inference(beta_eta_normalization,[],[f44]) ).
thf(f44,plain,
( ( ( sK2 @ sK4 )
!= ( ^ [Y0: a] : $false
@ sK4 ) )
| spl0_2 ),
inference(negative_extensionality,[],[f26]) ).
thf(f26,plain,
( ( sK2
!= ( ^ [Y0: a] : $false ) )
| spl0_2 ),
inference(avatar_component_clause,[],[f25]) ).
thf(f25,plain,
( spl0_2
<=> ( sK2
= ( ^ [Y0: a] : $false ) ) ),
introduced(avatar_definition,[new_symbols(naming,[spl0_2])]) ).
thf(f42,plain,
( ~ spl0_1
| ~ spl0_3 ),
inference(avatar_contradiction_clause,[],[f41]) ).
thf(f41,plain,
( $false
| ~ spl0_1
| ~ spl0_3 ),
inference(trivial_inequality_removal,[],[f37]) ).
thf(f37,plain,
( ( $false = $true )
| ~ spl0_1
| ~ spl0_3 ),
inference(superposition,[],[f23,f32]) ).
thf(f32,plain,
( ( $true
= ( sK2 @ sK3 ) )
| ~ spl0_3 ),
inference(avatar_component_clause,[],[f30]) ).
thf(f30,plain,
( spl0_3
<=> ( $true
= ( sK2 @ sK3 ) ) ),
introduced(avatar_definition,[new_symbols(naming,[spl0_3])]) ).
thf(f36,plain,
( spl0_1
| ~ spl0_2 ),
inference(avatar_split_clause,[],[f35,f25,f22]) ).
thf(f35,plain,
( ! [X1: a] :
( $false
= ( sK2 @ X1 ) )
| ~ spl0_2 ),
inference(beta_eta_normalization,[],[f34]) ).
thf(f34,plain,
( ! [X1: a] :
( ( ^ [Y0: a] : $false
@ X1 )
= ( sK2 @ X1 ) )
| ~ spl0_2 ),
inference(argument_congruence,[],[f27]) ).
thf(f27,plain,
( ( sK2
= ( ^ [Y0: a] : $false ) )
| ~ spl0_2 ),
inference(avatar_component_clause,[],[f25]) ).
thf(f33,plain,
( ~ spl0_2
| spl0_3 ),
inference(avatar_split_clause,[],[f16,f30,f25]) ).
thf(f16,plain,
( ( $true
= ( sK2 @ sK3 ) )
| ( sK2
!= ( ^ [Y0: a] : $false ) ) ),
inference(not_proxy_clausification,[],[f15]) ).
thf(f15,plain,
( ( $false
= ( ~ ( sK2 @ sK3 ) ) )
| ( sK2
!= ( ^ [Y0: a] : $false ) ) ),
inference(beta_eta_normalization,[],[f14]) ).
thf(f14,plain,
( ( sK2
!= ( ^ [Y0: a] : $false ) )
| ( $false
= ( ^ [Y0: a] :
~ ( sK2 @ Y0 )
@ sK3 ) ) ),
inference(sigma_clausification,[],[f13]) ).
thf(f13,plain,
( ( $false
= ( !! @ a
@ ^ [Y0: a] :
~ ( sK2 @ Y0 ) ) )
| ( sK2
!= ( ^ [Y0: a] : $false ) ) ),
inference(equality_proxy_clausification,[],[f12]) ).
thf(f12,plain,
( ( $false
= ( sK2
= ( ^ [Y0: a] : $false ) ) )
| ( $false
= ( !! @ a
@ ^ [Y0: a] :
~ ( sK2 @ Y0 ) ) ) ),
inference(binary_proxy_clausification,[],[f10]) ).
thf(f10,plain,
( ( sK2
= ( ^ [Y0: a] : $false ) )
!= ( !! @ a
@ ^ [Y0: a] :
~ ( sK2 @ Y0 ) ) ),
inference(beta_eta_normalization,[],[f9]) ).
thf(f9,plain,
( ( ^ [Y0: a > $o] :
( !! @ a
@ ^ [Y1: a] :
~ ( Y0 @ Y1 ) )
@ sK2 )
!= ( ^ [Y0: a > $o] :
( Y0
= ( ^ [Y1: a] : $false ) )
@ sK2 ) ),
inference(negative_extensionality,[],[f8]) ).
thf(f8,plain,
( ( ^ [Y0: a > $o] :
( !! @ a
@ ^ [Y1: a] :
~ ( Y0 @ Y1 ) ) )
!= ( ^ [Y0: a > $o] :
( Y0
= ( ^ [Y1: a] : $false ) ) ) ),
inference(boolean_simplification,[],[f7]) ).
thf(f7,plain,
( ( ^ [Y0: a > $o] :
( !! @ a
@ ^ [Y1: a] :
( ( Y0 @ Y1 )
=> $false ) ) )
!= ( ^ [Y0: a > $o] :
( Y0
= ( ^ [Y1: a] : $false ) ) ) ),
inference(cnf_transformation,[],[f6]) ).
thf(f6,plain,
( ( ^ [Y0: a > $o] :
( !! @ a
@ ^ [Y1: a] :
( ( Y0 @ Y1 )
=> $false ) ) )
!= ( ^ [Y0: a > $o] :
( Y0
= ( ^ [Y1: a] : $false ) ) ) ),
inference(flattening,[],[f5]) ).
thf(f5,plain,
( ( ^ [Y0: a > $o] :
( !! @ a
@ ^ [Y1: a] :
( ( Y0 @ Y1 )
=> $false ) ) )
!= ( ^ [Y0: a > $o] :
( Y0
= ( ^ [Y1: a] : $false ) ) ) ),
inference(fool_elimination,[],[f4]) ).
thf(f4,plain,
( ( ^ [X0: a > $o] :
! [X1: a] :
( ( X0 @ X1 )
=> $false ) )
!= ( ^ [X2: a > $o] :
( X2
= ( ^ [X3: a] : $false ) ) ) ),
inference(rectify,[],[f2]) ).
thf(f2,negated_conjecture,
( ( ^ [X0: a > $o] :
! [X1: a] :
( ( X0 @ X1 )
=> $false ) )
!= ( ^ [X2: a > $o] :
( X2
= ( ^ [X1: a] : $false ) ) ) ),
inference(negated_conjecture,[],[f1]) ).
thf(f1,conjecture,
( ( ^ [X0: a > $o] :
! [X1: a] :
( ( X0 @ X1 )
=> $false ) )
= ( ^ [X2: a > $o] :
( X2
= ( ^ [X1: a] : $false ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cE6EXT_pme) ).
thf(f28,plain,
( spl0_1
| spl0_2 ),
inference(avatar_split_clause,[],[f20,f25,f22]) ).
thf(f20,plain,
! [X1: a] :
( ( $false
= ( sK2 @ X1 ) )
| ( sK2
= ( ^ [Y0: a] : $false ) ) ),
inference(not_proxy_clausification,[],[f19]) ).
thf(f19,plain,
! [X1: a] :
( ( sK2
= ( ^ [Y0: a] : $false ) )
| ( ( ~ ( sK2 @ X1 ) )
= $true ) ),
inference(beta_eta_normalization,[],[f18]) ).
thf(f18,plain,
! [X1: a] :
( ( sK2
= ( ^ [Y0: a] : $false ) )
| ( $true
= ( ^ [Y0: a] :
~ ( sK2 @ Y0 )
@ X1 ) ) ),
inference(pi_clausification,[],[f17]) ).
thf(f17,plain,
( ( $true
= ( !! @ a
@ ^ [Y0: a] :
~ ( sK2 @ Y0 ) ) )
| ( sK2
= ( ^ [Y0: a] : $false ) ) ),
inference(equality_proxy_clausification,[],[f11]) ).
thf(f11,plain,
( ( $true
= ( sK2
= ( ^ [Y0: a] : $false ) ) )
| ( $true
= ( !! @ a
@ ^ [Y0: a] :
~ ( sK2 @ Y0 ) ) ) ),
inference(binary_proxy_clausification,[],[f10]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12 % Problem : SYO351^5 : TPTP v8.2.0. Released v4.0.0.
% 0.12/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 : n006.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 09:44:23 EDT 2024
% 0.14/0.35 % CPUTime :
% 0.14/0.35 This is a TH0_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 % (32490)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.14/0.38 % (32491)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.14/0.38 % (32492)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 (3000ds/27Mi)
% 0.14/0.38 % (32494)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.14/0.38 % (32493)lrs+10_1:1_au=on:inj=on:i=2:si=on:rtra=on_0 on theBenchmark for (3000ds/2Mi)
% 0.14/0.38 % (32495)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 (3000ds/275Mi)
% 0.14/0.38 % (32497)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.14/0.38 % (32496)lrs+1004_1:128_cond=on:e2e=on:sp=weighted_frequency:i=18:si=on:rtra=on_0 on theBenchmark for (3000ds/18Mi)
% 0.14/0.38 % (32497)Refutation not found, incomplete strategy
% 0.14/0.38 % (32497)------------------------------
% 0.14/0.38 % (32497)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.14/0.38 % (32493)Instruction limit reached!
% 0.14/0.38 % (32493)------------------------------
% 0.14/0.38 % (32493)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.14/0.38 % (32493)Termination reason: Unknown
% 0.14/0.38 % (32493)Termination phase: Saturation
% 0.14/0.38
% 0.14/0.38 % (32493)Memory used [KB]: 5500
% 0.14/0.38 % (32493)Time elapsed: 0.004 s
% 0.14/0.38 % (32493)Instructions burned: 2 (million)
% 0.14/0.38 % (32493)------------------------------
% 0.14/0.38 % (32493)------------------------------
% 0.14/0.38 % (32497)Termination reason: Refutation not found, incomplete strategy
% 0.14/0.38
% 0.14/0.38 % (32494)Refutation not found, incomplete strategy
% 0.14/0.38 % (32494)------------------------------
% 0.14/0.38 % (32494)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.14/0.38 % (32494)Termination reason: Refutation not found, incomplete strategy
% 0.14/0.38
% 0.14/0.38
% 0.14/0.38 % (32494)Memory used [KB]: 5500
% 0.14/0.38 % (32494)Time elapsed: 0.004 s
% 0.14/0.38 % (32494)Instructions burned: 1 (million)
% 0.14/0.38 % (32494)------------------------------
% 0.14/0.38 % (32494)------------------------------
% 0.14/0.38
% 0.14/0.38 % (32497)Memory used [KB]: 5373
% 0.14/0.38 % (32497)Time elapsed: 0.003 s
% 0.14/0.38 % (32497)Instructions burned: 1 (million)
% 0.14/0.38 % (32497)------------------------------
% 0.14/0.38 % (32497)------------------------------
% 0.14/0.38 % (32490)First to succeed.
% 0.14/0.38 % (32492)Also succeeded, but the first one will report.
% 0.14/0.38 % (32491)Instruction limit reached!
% 0.14/0.38 % (32491)------------------------------
% 0.14/0.38 % (32491)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.14/0.38 % (32491)Termination reason: Unknown
% 0.14/0.38 % (32491)Termination phase: Saturation
% 0.14/0.38
% 0.14/0.38 % (32491)Memory used [KB]: 5500
% 0.14/0.38 % (32491)Time elapsed: 0.006 s
% 0.14/0.38 % (32491)Instructions burned: 4 (million)
% 0.14/0.38 % (32491)------------------------------
% 0.14/0.38 % (32491)------------------------------
% 0.14/0.38 % (32490)Refutation found. Thanks to Tanya!
% 0.14/0.38 % SZS status Theorem for theBenchmark
% 0.14/0.38 % SZS output start Proof for theBenchmark
% See solution above
% 0.14/0.38 % (32490)------------------------------
% 0.14/0.38 % (32490)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.14/0.38 % (32490)Termination reason: Refutation
% 0.14/0.38
% 0.14/0.38 % (32490)Memory used [KB]: 5500
% 0.14/0.38 % (32490)Time elapsed: 0.005 s
% 0.14/0.38 % (32490)Instructions burned: 2 (million)
% 0.14/0.38 % (32490)------------------------------
% 0.14/0.38 % (32490)------------------------------
% 0.14/0.38 % (32489)Success in time 0.003 s
% 0.14/0.38 % Vampire---4.8 exiting
%------------------------------------------------------------------------------