TSTP Solution File: SEV220^5 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SEV220^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/sandbox/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% Computer : n004.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 04:12:26 EDT 2024
% Result : Theorem 0.14s 0.38s
% Output : Refutation 0.14s
% Verified :
% SZS Type : Refutation
% Derivation depth : 16
% Number of leaves : 16
% Syntax : Number of formulae : 38 ( 12 unt; 11 typ; 0 def)
% Number of atoms : 211 ( 96 equ; 0 cnn)
% Maximal formula atoms : 12 ( 7 avg)
% Number of connectives : 256 ( 23 ~; 11 |; 54 &; 139 @)
% ( 0 <=>; 16 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 4 avg)
% Number of types : 3 ( 2 usr)
% Number of type conns : 37 ( 37 >; 0 *; 0 +; 0 <<)
% Number of symbols : 11 ( 7 usr; 5 con; 0-2 aty)
% ( 0 !!; 13 ??; 0 @@+; 0 @@-)
% Number of variables : 85 ( 29 ^ 24 !; 31 ?; 85 :)
% ( 1 !>; 0 ?*; 0 @-; 0 @+)
% Comments :
%------------------------------------------------------------------------------
thf(type_def_5,type,
b: $tType ).
thf(type_def_6,type,
a: $tType ).
thf(func_def_0,type,
b: $tType ).
thf(func_def_1,type,
a: $tType ).
thf(func_def_2,type,
f: b > a ).
thf(func_def_3,type,
w: ( b > $o ) > $o ).
thf(func_def_13,type,
sK0: a ).
thf(func_def_14,type,
sK1: a > $o ).
thf(func_def_15,type,
sK2: b > $o ).
thf(func_def_16,type,
sK3: b ).
thf(func_def_19,type,
ph5:
!>[X0: $tType] : X0 ).
thf(f29,plain,
$false,
inference(trivial_inequality_removal,[],[f28]) ).
thf(f28,plain,
$false = $true,
inference(superposition,[],[f25,f26]) ).
thf(f26,plain,
( $false
= ( sK2 @ sK3 ) ),
inference(equality_resolution,[],[f23]) ).
thf(f23,plain,
! [X1: b] :
( ( ( f @ X1 )
!= ( f @ sK3 ) )
| ( ( sK2 @ X1 )
= $false ) ),
inference(equality_proxy_clausification,[],[f22]) ).
thf(f22,plain,
! [X1: b] :
( ( ( sK2 @ X1 )
= $false )
| ( ( ( f @ X1 )
= ( f @ sK3 ) )
= $false ) ),
inference(binary_proxy_clausification,[],[f21]) ).
thf(f21,plain,
! [X1: b] :
( ( ( sK2 @ X1 )
& ( ( f @ X1 )
= ( f @ sK3 ) ) )
= $false ),
inference(beta_eta_normalization,[],[f20]) ).
thf(f20,plain,
! [X1: b] :
( ( ^ [Y0: b] :
( ( sK2 @ Y0 )
& ( ( f @ Y0 )
= ( f @ sK3 ) ) )
@ X1 )
= $false ),
inference(pi_clausification,[],[f19]) ).
thf(f19,plain,
( ( ?? @ b
@ ^ [Y0: b] :
( ( sK2 @ Y0 )
& ( ( f @ Y0 )
= ( f @ sK3 ) ) ) )
!= $true ),
inference(beta_eta_normalization,[],[f18]) ).
thf(f18,plain,
( ( ^ [Y0: a] :
( ?? @ b
@ ^ [Y1: b] :
( ( sK2 @ Y1 )
& ( ( f @ Y1 )
= Y0 ) ) )
@ ( f @ sK3 ) )
!= $true ),
inference(definition_unfolding,[],[f15,f17,f14]) ).
thf(f14,plain,
( ( f @ sK3 )
= sK0 ),
inference(cnf_transformation,[],[f12]) ).
thf(f12,plain,
( ( ( ^ [Y0: a] :
( ?? @ b
@ ^ [Y1: b] :
( ( sK2 @ Y1 )
& ( ( f @ Y1 )
= Y0 ) ) ) )
= sK1 )
& ( ( w @ sK2 )
= $true )
& ( ( sK1 @ sK0 )
!= $true )
& ( ( f @ sK3 )
= sK0 )
& ! [X4: b > $o] :
( ( ( w @ X4 )
!= $true )
| ( ( X4 @ sK3 )
= $true ) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3])],[f7,f11,f10,f9,f8]) ).
thf(f8,plain,
( ? [X0: a] :
( ? [X1: a > $o] :
( ? [X2: b > $o] :
( ( ( ^ [Y0: a] :
( ?? @ b
@ ^ [Y1: b] :
( ( X2 @ Y1 )
& ( ( f @ Y1 )
= Y0 ) ) ) )
= X1 )
& ( ( w @ X2 )
= $true ) )
& ( ( X1 @ X0 )
!= $true ) )
& ? [X3: b] :
( ( ( f @ X3 )
= X0 )
& ! [X4: b > $o] :
( ( ( w @ X4 )
!= $true )
| ( ( X4 @ X3 )
= $true ) ) ) )
=> ( ? [X1: a > $o] :
( ? [X2: b > $o] :
( ( ( ^ [Y0: a] :
( ?? @ b
@ ^ [Y1: b] :
( ( X2 @ Y1 )
& ( ( f @ Y1 )
= Y0 ) ) ) )
= X1 )
& ( ( w @ X2 )
= $true ) )
& ( ( X1 @ sK0 )
!= $true ) )
& ? [X3: b] :
( ( sK0
= ( f @ X3 ) )
& ! [X4: b > $o] :
( ( ( w @ X4 )
!= $true )
| ( ( X4 @ X3 )
= $true ) ) ) ) ),
introduced(choice_axiom,[]) ).
thf(f9,plain,
( ? [X1: a > $o] :
( ? [X2: b > $o] :
( ( ( ^ [Y0: a] :
( ?? @ b
@ ^ [Y1: b] :
( ( X2 @ Y1 )
& ( ( f @ Y1 )
= Y0 ) ) ) )
= X1 )
& ( ( w @ X2 )
= $true ) )
& ( ( X1 @ sK0 )
!= $true ) )
=> ( ? [X2: b > $o] :
( ( ( ^ [Y0: a] :
( ?? @ b
@ ^ [Y1: b] :
( ( X2 @ Y1 )
& ( ( f @ Y1 )
= Y0 ) ) ) )
= sK1 )
& ( ( w @ X2 )
= $true ) )
& ( ( sK1 @ sK0 )
!= $true ) ) ),
introduced(choice_axiom,[]) ).
thf(f10,plain,
( ? [X2: b > $o] :
( ( ( ^ [Y0: a] :
( ?? @ b
@ ^ [Y1: b] :
( ( X2 @ Y1 )
& ( ( f @ Y1 )
= Y0 ) ) ) )
= sK1 )
& ( ( w @ X2 )
= $true ) )
=> ( ( ( ^ [Y0: a] :
( ?? @ b
@ ^ [Y1: b] :
( ( sK2 @ Y1 )
& ( ( f @ Y1 )
= Y0 ) ) ) )
= sK1 )
& ( ( w @ sK2 )
= $true ) ) ),
introduced(choice_axiom,[]) ).
thf(f11,plain,
( ? [X3: b] :
( ( sK0
= ( f @ X3 ) )
& ! [X4: b > $o] :
( ( ( w @ X4 )
!= $true )
| ( ( X4 @ X3 )
= $true ) ) )
=> ( ( ( f @ sK3 )
= sK0 )
& ! [X4: b > $o] :
( ( ( w @ X4 )
!= $true )
| ( ( X4 @ sK3 )
= $true ) ) ) ),
introduced(choice_axiom,[]) ).
thf(f7,plain,
? [X0: a] :
( ? [X1: a > $o] :
( ? [X2: b > $o] :
( ( ( ^ [Y0: a] :
( ?? @ b
@ ^ [Y1: b] :
( ( X2 @ Y1 )
& ( ( f @ Y1 )
= Y0 ) ) ) )
= X1 )
& ( ( w @ X2 )
= $true ) )
& ( ( X1 @ X0 )
!= $true ) )
& ? [X3: b] :
( ( ( f @ X3 )
= X0 )
& ! [X4: b > $o] :
( ( ( w @ X4 )
!= $true )
| ( ( X4 @ X3 )
= $true ) ) ) ),
inference(rectify,[],[f6]) ).
thf(f6,plain,
? [X0: a] :
( ? [X3: a > $o] :
( ? [X4: b > $o] :
( ( ( ^ [Y0: a] :
( ?? @ b
@ ^ [Y1: b] :
( ( X4 @ Y1 )
& ( ( f @ Y1 )
= Y0 ) ) ) )
= X3 )
& ( ( w @ X4 )
= $true ) )
& ( $true
!= ( X3 @ X0 ) ) )
& ? [X1: b] :
( ( ( f @ X1 )
= X0 )
& ! [X2: b > $o] :
( ( ( w @ X2 )
!= $true )
| ( ( X2 @ X1 )
= $true ) ) ) ),
inference(ennf_transformation,[],[f5]) ).
thf(f5,plain,
~ ! [X0: a] :
( ? [X1: b] :
( ! [X2: b > $o] :
( ( ( w @ X2 )
= $true )
=> ( ( X2 @ X1 )
= $true ) )
& ( ( f @ X1 )
= X0 ) )
=> ! [X3: a > $o] :
( ? [X4: b > $o] :
( ( ( ^ [Y0: a] :
( ?? @ b
@ ^ [Y1: b] :
( ( X4 @ Y1 )
& ( ( f @ Y1 )
= Y0 ) ) ) )
= X3 )
& ( ( w @ X4 )
= $true ) )
=> ( $true
= ( X3 @ X0 ) ) ) ),
inference(fool_elimination,[],[f4]) ).
thf(f4,plain,
~ ! [X0: a] :
( ? [X1: b] :
( ! [X2: b > $o] :
( ( w @ X2 )
=> ( X2 @ X1 ) )
& ( ( f @ X1 )
= X0 ) )
=> ! [X3: a > $o] :
( ? [X4: b > $o] :
( ( w @ X4 )
& ( X3
= ( ^ [X5: a] :
? [X6: b] :
( ( ( f @ X6 )
= X5 )
& ( X4 @ X6 ) ) ) ) )
=> ( X3 @ X0 ) ) ),
inference(rectify,[],[f2]) ).
thf(f2,negated_conjecture,
~ ! [X0: a] :
( ? [X1: b] :
( ! [X2: b > $o] :
( ( w @ X2 )
=> ( X2 @ X1 ) )
& ( ( f @ X1 )
= X0 ) )
=> ! [X2: a > $o] :
( ? [X1: b > $o] :
( ( w @ X1 )
& ( X2
= ( ^ [X3: a] :
? [X4: b] :
( ( ( f @ X4 )
= X3 )
& ( X1 @ X4 ) ) ) ) )
=> ( X2 @ X0 ) ) ),
inference(negated_conjecture,[],[f1]) ).
thf(f1,conjecture,
! [X0: a] :
( ? [X1: b] :
( ! [X2: b > $o] :
( ( w @ X2 )
=> ( X2 @ X1 ) )
& ( ( f @ X1 )
= X0 ) )
=> ! [X2: a > $o] :
( ? [X1: b > $o] :
( ( w @ X1 )
& ( X2
= ( ^ [X3: a] :
? [X4: b] :
( ( ( f @ X4 )
= X3 )
& ( X1 @ X4 ) ) ) ) )
=> ( X2 @ X0 ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cX5205_pme) ).
thf(f17,plain,
( ( ^ [Y0: a] :
( ?? @ b
@ ^ [Y1: b] :
( ( sK2 @ Y1 )
& ( ( f @ Y1 )
= Y0 ) ) ) )
= sK1 ),
inference(cnf_transformation,[],[f12]) ).
thf(f15,plain,
( ( sK1 @ sK0 )
!= $true ),
inference(cnf_transformation,[],[f12]) ).
thf(f25,plain,
( ( sK2 @ sK3 )
= $true ),
inference(trivial_inequality_removal,[],[f24]) ).
thf(f24,plain,
( ( ( sK2 @ sK3 )
= $true )
| ( $true != $true ) ),
inference(superposition,[],[f13,f16]) ).
thf(f16,plain,
( ( w @ sK2 )
= $true ),
inference(cnf_transformation,[],[f12]) ).
thf(f13,plain,
! [X4: b > $o] :
( ( ( w @ X4 )
!= $true )
| ( ( X4 @ sK3 )
= $true ) ),
inference(cnf_transformation,[],[f12]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.14 % Problem : SEV220^5 : TPTP v8.2.0. Released v4.0.0.
% 0.07/0.15 % Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% 0.14/0.36 % Computer : n004.cluster.edu
% 0.14/0.36 % Model : x86_64 x86_64
% 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36 % Memory : 8042.1875MB
% 0.14/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36 % CPULimit : 300
% 0.14/0.36 % WCLimit : 300
% 0.14/0.36 % DateTime : Sun May 19 19:19:08 EDT 2024
% 0.14/0.36 % CPUTime :
% 0.14/0.36 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/sandbox/benchmark/theBenchmark.p
% 0.14/0.38 % (12130)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 % (12133)lrs+10_1:1_au=on:inj=on:i=2:si=on:rtra=on_0 on theBenchmark for (3000ds/2Mi)
% 0.14/0.38 % (12135)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 % (12137)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 % (12134)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 % (12130)First to succeed.
% 0.14/0.38 % (12133)Instruction limit reached!
% 0.14/0.38 % (12133)------------------------------
% 0.14/0.38 % (12133)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.14/0.38 % (12133)Termination reason: Unknown
% 0.14/0.38 % (12133)Termination phase: Saturation
% 0.14/0.38
% 0.14/0.38 % (12133)Memory used [KB]: 5500
% 0.14/0.38 % (12133)Time elapsed: 0.003 s
% 0.14/0.38 % (12133)Instructions burned: 2 (million)
% 0.14/0.38 % (12133)------------------------------
% 0.14/0.38 % (12133)------------------------------
% 0.14/0.38 % (12136)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 % (12132)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 % (12134)Instruction limit reached!
% 0.14/0.38 % (12134)------------------------------
% 0.14/0.38 % (12134)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.14/0.38 % (12134)Termination reason: Unknown
% 0.14/0.38 % (12134)Termination phase: Saturation
% 0.14/0.38
% 0.14/0.38 % (12134)Memory used [KB]: 5500
% 0.14/0.38 % (12137)Refutation not found, incomplete strategy
% 0.14/0.38 % (12137)------------------------------
% 0.14/0.38 % (12137)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.14/0.38 % (12134)Time elapsed: 0.003 s
% 0.14/0.38 % (12134)Instructions burned: 2 (million)
% 0.14/0.38 % (12134)------------------------------
% 0.14/0.38 % (12134)------------------------------
% 0.14/0.38 % (12137)Termination reason: Refutation not found, incomplete strategy
% 0.14/0.38
% 0.14/0.38
% 0.14/0.38 % (12137)Memory used [KB]: 5500
% 0.14/0.38 % (12137)Time elapsed: 0.002 s
% 0.14/0.38 % (12137)Instructions burned: 2 (million)
% 0.14/0.38 % (12137)------------------------------
% 0.14/0.38 % (12137)------------------------------
% 0.14/0.38 % (12135)Also succeeded, but the first one will report.
% 0.14/0.38 % (12136)Also succeeded, but the first one will report.
% 0.14/0.38 % (12130)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 % (12130)------------------------------
% 0.14/0.38 % (12130)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.14/0.38 % (12130)Termination reason: Refutation
% 0.14/0.38
% 0.14/0.38 % (12130)Memory used [KB]: 5500
% 0.14/0.38 % (12130)Time elapsed: 0.005 s
% 0.14/0.38 % (12130)Instructions burned: 2 (million)
% 0.14/0.38 % (12130)------------------------------
% 0.14/0.38 % (12130)------------------------------
% 0.14/0.38 % (12129)Success in time 0.014 s
% 0.14/0.38 % Vampire---4.8 exiting
%------------------------------------------------------------------------------