TSTP Solution File: SYO541^1 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SYO541^1 : TPTP v8.2.0. Released v5.2.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 : n016.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:06:09 EDT 2024
% Result : Theorem 0.16s 0.41s
% Output : Refutation 0.16s
% Verified :
% SZS Type : Refutation
% Derivation depth : 20
% Number of leaves : 15
% Syntax : Number of formulae : 50 ( 7 unt; 6 typ; 0 def)
% Number of atoms : 193 ( 123 equ; 14 cnn)
% Maximal formula atoms : 4 ( 4 avg)
% Number of connectives : 265 ( 62 ~; 49 |; 39 &; 110 @)
% ( 4 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 3 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 70 ( 70 >; 0 *; 0 +; 0 <<)
% Number of symbols : 14 ( 10 usr; 7 con; 0-4 aty)
% Number of variables : 64 ( 40 ^ 18 !; 4 ?; 64 :)
% ( 2 !>; 0 ?*; 0 @-; 0 @+)
% Comments :
%------------------------------------------------------------------------------
thf(func_def_0,type,
epsii: ( ( $i > $i ) > $o ) > $i > $i ).
thf(func_def_2,type,
if: $o > ( $i > $i ) > ( $i > $i ) > $i > $i ).
thf(func_def_3,type,
vEPSILON:
!>[X0: $tType] : ( ( X0 > $o ) > X0 ) ).
thf(func_def_15,type,
sK0: $i > $i ).
thf(func_def_16,type,
sK1: $i > $i ).
thf(func_def_18,type,
ph3:
!>[X0: $tType] : X0 ).
thf(f65,plain,
$false,
inference(avatar_sat_refutation,[],[f39,f59,f61,f62,f64]) ).
thf(f64,plain,
~ spl2_3,
inference(avatar_contradiction_clause,[],[f63]) ).
thf(f63,plain,
( $false
| ~ spl2_3 ),
inference(equality_resolution,[],[f46]) ).
thf(f46,plain,
( ! [X1: $i > $i] : ( sK1 != X1 )
| ~ spl2_3 ),
inference(avatar_component_clause,[],[f45]) ).
thf(f45,plain,
( spl2_3
<=> ! [X1: $i > $i] : ( sK1 != X1 ) ),
introduced(avatar_definition,[new_symbols(naming,[spl2_3])]) ).
thf(f62,plain,
( spl2_3
| spl2_1 ),
inference(avatar_split_clause,[],[f51,f32,f45]) ).
thf(f32,plain,
( spl2_1
<=> ( ( epsii @ ( (=) @ sK1 ) )
= sK1 ) ),
introduced(avatar_definition,[new_symbols(naming,[spl2_1])]) ).
thf(f51,plain,
! [X1: $i > $i] :
( ( sK1 != X1 )
| ( ( epsii @ ( (=) @ sK1 ) )
= sK1 ) ),
inference(equality_proxy_clausification,[],[f50]) ).
thf(f50,plain,
! [X1: $i > $i] :
( ( sK1 != X1 )
| ( $true
= ( sK1
= ( epsii @ ( (=) @ sK1 ) ) ) ) ),
inference(equality_proxy_clausification,[],[f48]) ).
thf(f48,plain,
! [X1: $i > $i] :
( ( $false
= ( sK1 = X1 ) )
| ( $true
= ( sK1
= ( epsii @ ( (=) @ sK1 ) ) ) ) ),
introduced(choice_axiom,[]) ).
thf(f61,plain,
~ spl2_4,
inference(avatar_contradiction_clause,[],[f60]) ).
thf(f60,plain,
( $false
| ~ spl2_4 ),
inference(equality_resolution,[],[f58]) ).
thf(f58,plain,
( ! [X1: $i > $i] : ( sK0 != X1 )
| ~ spl2_4 ),
inference(avatar_component_clause,[],[f57]) ).
thf(f57,plain,
( spl2_4
<=> ! [X1: $i > $i] : ( sK0 != X1 ) ),
introduced(avatar_definition,[new_symbols(naming,[spl2_4])]) ).
thf(f59,plain,
( spl2_2
| spl2_4 ),
inference(avatar_split_clause,[],[f55,f57,f36]) ).
thf(f36,plain,
( spl2_2
<=> ( sK0
= ( epsii @ ( (=) @ sK0 ) ) ) ),
introduced(avatar_definition,[new_symbols(naming,[spl2_2])]) ).
thf(f55,plain,
! [X1: $i > $i] :
( ( sK0 != X1 )
| ( sK0
= ( epsii @ ( (=) @ sK0 ) ) ) ),
inference(equality_proxy_clausification,[],[f54]) ).
thf(f54,plain,
! [X1: $i > $i] :
( ( ( sK0
= ( epsii @ ( (=) @ sK0 ) ) )
= $true )
| ( sK0 != X1 ) ),
inference(equality_proxy_clausification,[],[f52]) ).
thf(f52,plain,
! [X1: $i > $i] :
( ( $false
= ( sK0 = X1 ) )
| ( ( sK0
= ( epsii @ ( (=) @ sK0 ) ) )
= $true ) ),
introduced(choice_axiom,[]) ).
thf(f39,plain,
( ~ spl2_1
| ~ spl2_2 ),
inference(avatar_split_clause,[],[f30,f36,f32]) ).
thf(f30,plain,
( ( ( epsii @ ( (=) @ sK1 ) )
!= sK1 )
| ( sK0
!= ( epsii @ ( (=) @ sK0 ) ) ) ),
inference(beta_eta_normalization,[],[f29]) ).
thf(f29,plain,
( ( ( epsii
@ ^ [Y0: $i > $i] : ( sK1 = Y0 ) )
!= sK1 )
| ( sK0
!= ( epsii @ ( (=) @ sK0 ) ) ) ),
inference(boolean_simplification,[],[f28]) ).
thf(f28,plain,
( ( sK0
!= ( epsii @ ( (=) @ sK0 ) ) )
| ( sK1
!= ( epsii
@ ^ [Y0: $i > $i] :
( $false
| ( sK1 = Y0 ) ) ) ) ),
inference(boolean_simplification,[],[f27]) ).
thf(f27,plain,
( ( ( epsii
@ ^ [Y0: $i > $i] :
( ( ( sK0 = Y0 )
& $false )
| ( sK1 = Y0 ) ) )
!= sK1 )
| ( sK0
!= ( epsii @ ( (=) @ sK0 ) ) ) ),
inference(boolean_simplification,[],[f26]) ).
thf(f26,plain,
( ( sK0
!= ( epsii @ ( (=) @ sK0 ) ) )
| ( ( epsii
@ ^ [Y0: $i > $i] :
( ( ( sK0 = Y0 )
& $false )
| ( $true
& ( sK1 = Y0 ) ) ) )
!= sK1 ) ),
inference(beta_eta_normalization,[],[f25]) ).
thf(f25,plain,
( ( ( epsii
@ ^ [Y0: $i > $i] : ( sK0 = Y0 ) )
!= sK0 )
| ( ( epsii
@ ^ [Y0: $i > $i] :
( ( ( sK0 = Y0 )
& $false )
| ( $true
& ( sK1 = Y0 ) ) ) )
!= sK1 ) ),
inference(boolean_simplification,[],[f24]) ).
thf(f24,plain,
( ( sK0
!= ( epsii
@ ^ [Y0: $i > $i] :
( ( sK0 = Y0 )
& $true ) ) )
| ( ( epsii
@ ^ [Y0: $i > $i] :
( ( ( sK0 = Y0 )
& $false )
| ( $true
& ( sK1 = Y0 ) ) ) )
!= sK1 ) ),
inference(boolean_simplification,[],[f23]) ).
thf(f23,plain,
( ( sK0
!= ( epsii
@ ^ [Y0: $i > $i] :
( ( ( sK0 = Y0 )
& $true )
| $false ) ) )
| ( ( epsii
@ ^ [Y0: $i > $i] :
( ( ( sK0 = Y0 )
& $false )
| ( $true
& ( sK1 = Y0 ) ) ) )
!= sK1 ) ),
inference(boolean_simplification,[],[f22]) ).
thf(f22,plain,
( ( sK0
!= ( epsii
@ ^ [Y0: $i > $i] :
( ( ( sK0 = Y0 )
& $true )
| ( $false
& ( sK1 = Y0 ) ) ) ) )
| ( ( epsii
@ ^ [Y0: $i > $i] :
( ( ( sK0 = Y0 )
& $false )
| ( $true
& ( sK1 = Y0 ) ) ) )
!= sK1 ) ),
inference(boolean_simplification,[],[f21]) ).
thf(f21,plain,
( ( ( epsii
@ ^ [Y0: $i > $i] :
( ( ( sK0 = Y0 )
& $false )
| ( ~ $false
& ( sK1 = Y0 ) ) ) )
!= sK1 )
| ( sK0
!= ( epsii
@ ^ [Y0: $i > $i] :
( ( ( sK0 = Y0 )
& $true )
| ( $false
& ( sK1 = Y0 ) ) ) ) ) ),
inference(boolean_simplification,[],[f20]) ).
thf(f20,plain,
( ( sK0
!= ( epsii
@ ^ [Y0: $i > $i] :
( ( ( sK0 = Y0 )
& $true )
| ( ~ $true
& ( sK1 = Y0 ) ) ) ) )
| ( ( epsii
@ ^ [Y0: $i > $i] :
( ( ( sK0 = Y0 )
& $false )
| ( ~ $false
& ( sK1 = Y0 ) ) ) )
!= sK1 ) ),
inference(beta_eta_normalization,[],[f19]) ).
thf(f19,plain,
( ( sK0
!= ( ^ [Y0: $o,Y1: $i > $i,Y2: $i > $i] :
( epsii
@ ^ [Y3: $i > $i] :
( ( ( Y1 = Y3 )
& Y0 )
| ( ~ Y0
& ( Y2 = Y3 ) ) ) )
@ $true
@ sK0
@ sK1 ) )
| ( ( ^ [Y0: $o,Y1: $i > $i,Y2: $i > $i] :
( epsii
@ ^ [Y3: $i > $i] :
( ( ( Y1 = Y3 )
& Y0 )
| ( ~ Y0
& ( Y2 = Y3 ) ) ) )
@ $false
@ sK0
@ sK1 )
!= sK1 ) ),
inference(definition_unfolding,[],[f17,f16,f16]) ).
thf(f16,plain,
( if
= ( ^ [Y0: $o,Y1: $i > $i,Y2: $i > $i] :
( epsii
@ ^ [Y3: $i > $i] :
( ( ( Y1 = Y3 )
& Y0 )
| ( ~ Y0
& ( Y2 = Y3 ) ) ) ) ) ),
inference(cnf_transformation,[],[f7]) ).
thf(f7,plain,
( if
= ( ^ [Y0: $o,Y1: $i > $i,Y2: $i > $i] :
( epsii
@ ^ [Y3: $i > $i] :
( ( ( Y1 = Y3 )
& Y0 )
| ( ~ Y0
& ( Y2 = Y3 ) ) ) ) ) ),
inference(fool_elimination,[],[f6]) ).
thf(f6,plain,
( ( ^ [X0: $o,X1: $i > $i,X2: $i > $i] :
( epsii
@ ^ [X3: $i > $i] :
( ( ( X2 = X3 )
& ~ X0 )
| ( X0
& ( X1 = X3 ) ) ) ) )
= if ),
inference(rectify,[],[f2]) ).
thf(f2,axiom,
( ( ^ [X2: $o,X1: $i > $i,X3: $i > $i] :
( epsii
@ ^ [X4: $i > $i] :
( ( ( X3 = X4 )
& ~ X2 )
| ( X2
& ( X1 = X4 ) ) ) ) )
= if ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ifd) ).
thf(f17,plain,
( ( sK0
!= ( if @ $true @ sK0 @ sK1 ) )
| ( ( if @ $false @ sK0 @ sK1 )
!= sK1 ) ),
inference(cnf_transformation,[],[f15]) ).
thf(f15,plain,
( ( sK0
!= ( if @ $true @ sK0 @ sK1 ) )
| ( ( if @ $false @ sK0 @ sK1 )
!= sK1 ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1])],[f12,f14]) ).
thf(f14,plain,
( ? [X0: $i > $i,X1: $i > $i] :
( ( ( if @ $true @ X0 @ X1 )
!= X0 )
| ( ( if @ $false @ X0 @ X1 )
!= X1 ) )
=> ( ( sK0
!= ( if @ $true @ sK0 @ sK1 ) )
| ( ( if @ $false @ sK0 @ sK1 )
!= sK1 ) ) ),
introduced(choice_axiom,[]) ).
thf(f12,plain,
? [X0: $i > $i,X1: $i > $i] :
( ( ( if @ $true @ X0 @ X1 )
!= X0 )
| ( ( if @ $false @ X0 @ X1 )
!= X1 ) ),
inference(ennf_transformation,[],[f11]) ).
thf(f11,plain,
~ ! [X0: $i > $i,X1: $i > $i] :
( ( ( if @ $false @ X0 @ X1 )
= X1 )
& ( ( if @ $true @ X0 @ X1 )
= X0 ) ),
inference(fool_elimination,[],[f10]) ).
thf(f10,plain,
~ ! [X0: $i > $i,X1: $i > $i] :
( ( X1
= ( if @ $false @ X0 @ X1 ) )
& ( X0
= ( if @ $true @ X0 @ X1 ) ) ),
inference(rectify,[],[f4]) ).
thf(f4,negated_conjecture,
~ ! [X1: $i > $i,X3: $i > $i] :
( ( X3
= ( if @ $false @ X1 @ X3 ) )
& ( X1
= ( if @ $true @ X1 @ X3 ) ) ),
inference(negated_conjecture,[],[f3]) ).
thf(f3,conjecture,
! [X1: $i > $i,X3: $i > $i] :
( ( X3
= ( if @ $false @ X1 @ X3 ) )
& ( X1
= ( if @ $true @ X1 @ X3 ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',conj) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.13 % Problem : SYO541^1 : TPTP v8.2.0. Released v5.2.0.
% 0.12/0.15 % 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.16/0.38 % Computer : n016.cluster.edu
% 0.16/0.38 % Model : x86_64 x86_64
% 0.16/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.38 % Memory : 8042.1875MB
% 0.16/0.38 % OS : Linux 3.10.0-693.el7.x86_64
% 0.16/0.39 % CPULimit : 300
% 0.16/0.39 % WCLimit : 300
% 0.16/0.39 % DateTime : Mon May 20 09:13:53 EDT 2024
% 0.16/0.39 % CPUTime :
% 0.16/0.39 This is a TH0_THM_EQU_NAR problem
% 0.16/0.39 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.16/0.41 % (9833)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.16/0.41 % (9834)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.16/0.41 % (9835)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.16/0.41 % (9836)lrs+10_1:1_au=on:inj=on:i=2:si=on:rtra=on_0 on theBenchmark for (3000ds/2Mi)
% 0.16/0.41 % (9837)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.16/0.41 % (9838)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.16/0.41 % (9839)lrs+1004_1:128_cond=on:e2e=on:sp=weighted_frequency:i=18:si=on:rtra=on_0 on theBenchmark for (3000ds/18Mi)
% 0.16/0.41 % (9840)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.16/0.41 % (9836)Instruction limit reached!
% 0.16/0.41 % (9836)------------------------------
% 0.16/0.41 % (9836)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.16/0.41 % (9836)Termination reason: Unknown
% 0.16/0.41 % (9836)Termination phase: Property scanning
% 0.16/0.41
% 0.16/0.41 % (9837)Instruction limit reached!
% 0.16/0.41 % (9837)------------------------------
% 0.16/0.41 % (9837)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.16/0.41 % (9837)Termination reason: Unknown
% 0.16/0.41 % (9837)Termination phase: Property scanning
% 0.16/0.41
% 0.16/0.41 % (9837)Memory used [KB]: 895
% 0.16/0.41 % (9837)Time elapsed: 0.003 s
% 0.16/0.41 % (9837)Instructions burned: 2 (million)
% 0.16/0.41 % (9837)------------------------------
% 0.16/0.41 % (9837)------------------------------
% 0.16/0.41 % (9836)Memory used [KB]: 895
% 0.16/0.41 % (9836)Time elapsed: 0.003 s
% 0.16/0.41 % (9836)Instructions burned: 2 (million)
% 0.16/0.41 % (9836)------------------------------
% 0.16/0.41 % (9836)------------------------------
% 0.16/0.41 % (9838)Refutation not found, incomplete strategy
% 0.16/0.41 % (9838)------------------------------
% 0.16/0.41 % (9838)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.16/0.41 % (9838)Termination reason: Refutation not found, incomplete strategy
% 0.16/0.41
% 0.16/0.41
% 0.16/0.41 % (9838)Memory used [KB]: 5500
% 0.16/0.41 % (9838)Time elapsed: 0.003 s
% 0.16/0.41 % (9838)Instructions burned: 2 (million)
% 0.16/0.41 % (9838)------------------------------
% 0.16/0.41 % (9838)------------------------------
% 0.16/0.41 % (9840)Instruction limit reached!
% 0.16/0.41 % (9840)------------------------------
% 0.16/0.41 % (9840)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.16/0.41 % (9840)Termination reason: Unknown
% 0.16/0.41 % (9840)Termination phase: Saturation
% 0.16/0.41
% 0.16/0.41 % (9840)Memory used [KB]: 5500
% 0.16/0.41 % (9840)Time elapsed: 0.004 s
% 0.16/0.41 % (9840)Instructions burned: 3 (million)
% 0.16/0.41 % (9840)------------------------------
% 0.16/0.41 % (9840)------------------------------
% 0.16/0.41 % (9835)First to succeed.
% 0.16/0.41 % (9834)Instruction limit reached!
% 0.16/0.41 % (9834)------------------------------
% 0.16/0.41 % (9834)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.16/0.41 % (9834)Termination reason: Unknown
% 0.16/0.41 % (9834)Termination phase: Saturation
% 0.16/0.41
% 0.16/0.41 % (9834)Memory used [KB]: 5500
% 0.16/0.41 % (9834)Time elapsed: 0.005 s
% 0.16/0.41 % (9834)Instructions burned: 5 (million)
% 0.16/0.41 % (9834)------------------------------
% 0.16/0.41 % (9834)------------------------------
% 0.16/0.41 % (9833)Also succeeded, but the first one will report.
% 0.16/0.41 % (9835)Refutation found. Thanks to Tanya!
% 0.16/0.41 % SZS status Theorem for theBenchmark
% 0.16/0.41 % SZS output start Proof for theBenchmark
% See solution above
% 0.16/0.41 % (9835)------------------------------
% 0.16/0.41 % (9835)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.16/0.41 % (9835)Termination reason: Refutation
% 0.16/0.41
% 0.16/0.41 % (9835)Memory used [KB]: 5500
% 0.16/0.41 % (9835)Time elapsed: 0.006 s
% 0.16/0.41 % (9835)Instructions burned: 3 (million)
% 0.16/0.41 % (9835)------------------------------
% 0.16/0.41 % (9835)------------------------------
% 0.16/0.41 % (9832)Success in time 0.005 s
% 0.16/0.41 % Vampire---4.8 exiting
%------------------------------------------------------------------------------