TSTP Solution File: SEV257^5 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SEV257^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 04:12:33 EDT 2024
% Result : Theorem 0.15s 0.39s
% Output : Refutation 0.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 19
% Number of leaves : 11
% Syntax : Number of formulae : 31 ( 3 unt; 9 typ; 0 def)
% Number of atoms : 248 ( 67 equ; 0 cnn)
% Maximal formula atoms : 9 ( 11 avg)
% Number of connectives : 300 ( 24 ~; 20 |; 52 &; 173 @)
% ( 0 <=>; 21 =>; 0 <=; 0 <~>)
% Maximal formula depth : 12 ( 6 avg)
% Number of types : 2 ( 1 usr)
% Number of type conns : 102 ( 102 >; 0 *; 0 +; 0 <<)
% Number of symbols : 11 ( 7 usr; 4 con; 0-2 aty)
% ( 0 !!; 10 ??; 0 @@+; 0 @@-)
% Number of variables : 100 ( 55 ^ 38 !; 6 ?; 100 :)
% ( 1 !>; 0 ?*; 0 @-; 0 @+)
% Comments :
%------------------------------------------------------------------------------
thf(type_def_5,type,
a: $tType ).
thf(func_def_0,type,
a: $tType ).
thf(func_def_1,type,
cOPEN: ( a > $o ) > $o ).
thf(func_def_10,type,
sK0: ( ( a > $o ) > $o ) > a > $o ).
thf(func_def_13,type,
ph2:
!>[X0: $tType] : X0 ).
thf(func_def_14,type,
sK3: a ).
thf(func_def_15,type,
sK4: ( ( a > $o ) > $o ) > a ).
thf(func_def_16,type,
sK5: ( ( a > $o ) > $o ) > a ).
thf(func_def_17,type,
sK6: ( ( a > $o ) > $o ) > a > $o ).
thf(f70,plain,
$false,
inference(trivial_inequality_removal,[],[f69]) ).
thf(f69,plain,
$false = $true,
inference(duplicate_literal_removal,[],[f68]) ).
thf(f68,plain,
( ( $false = $true )
| ( $false = $true ) ),
inference(beta_eta_normalization,[],[f46]) ).
thf(f46,plain,
( ( ( ^ [Y0: a > $o] : $false
@ ( sK0
@ ^ [Y0: a > $o] : $false ) )
= $true )
| ( ( ^ [Y0: a > $o] : $false
@ ( sK6
@ ^ [Y0: a > $o] : $false ) )
= $true ) ),
inference(primitive_instantiation,[],[f44]) ).
thf(f44,plain,
! [X0: ( a > $o ) > $o] :
( ( $true
= ( X0 @ ( sK6 @ X0 ) ) )
| ( ( X0 @ ( sK0 @ X0 ) )
= $true ) ),
inference(binary_proxy_clausification,[],[f42]) ).
thf(f42,plain,
! [X0: ( a > $o ) > $o] :
( ( $true
= ( ( X0 @ ( sK6 @ X0 ) )
& ( sK6 @ X0 @ ( sK5 @ X0 ) ) ) )
| ( ( X0 @ ( sK0 @ X0 ) )
= $true ) ),
inference(beta_eta_normalization,[],[f41]) ).
thf(f41,plain,
! [X0: ( a > $o ) > $o] :
( ( ( ^ [Y0: a > $o] :
( ( X0 @ Y0 )
& ( Y0 @ ( sK5 @ X0 ) ) )
@ ( sK6 @ X0 ) )
= $true )
| ( ( X0 @ ( sK0 @ X0 ) )
= $true ) ),
inference(sigma_clausification,[],[f40]) ).
thf(f40,plain,
! [X0: ( a > $o ) > $o] :
( ( ( ?? @ ( a > $o )
@ ^ [Y0: a > $o] :
( ( X0 @ Y0 )
& ( Y0 @ ( sK5 @ X0 ) ) ) )
!= $false )
| ( ( X0 @ ( sK0 @ X0 ) )
= $true ) ),
inference(beta_eta_normalization,[],[f39]) ).
thf(f39,plain,
! [X0: ( a > $o ) > $o] :
( ( ( X0 @ ( sK0 @ X0 ) )
= $true )
| ( ( ^ [Y0: a] : $false
@ ( sK5 @ X0 ) )
!= ( ^ [Y0: a] :
( ?? @ ( a > $o )
@ ^ [Y1: a > $o] :
( ( X0 @ Y1 )
& ( Y1 @ Y0 ) ) )
@ ( sK5 @ X0 ) ) ) ),
inference(negative_extensionality,[],[f31]) ).
thf(f31,plain,
! [X0: ( a > $o ) > $o] :
( ( ( ^ [Y0: a] : $false )
!= ( ^ [Y0: a] :
( ?? @ ( a > $o )
@ ^ [Y1: a > $o] :
( ( X0 @ Y1 )
& ( Y1 @ Y0 ) ) ) ) )
| ( ( X0 @ ( sK0 @ X0 ) )
= $true ) ),
inference(trivial_inequality_removal,[],[f28]) ).
thf(f28,plain,
! [X0: ( a > $o ) > $o] :
( ( ( ^ [Y0: a] : $false )
!= ( ^ [Y0: a] :
( ?? @ ( a > $o )
@ ^ [Y1: a > $o] :
( ( X0 @ Y1 )
& ( Y1 @ Y0 ) ) ) ) )
| ( ( X0 @ ( sK0 @ X0 ) )
= $true )
| ( $true != $true ) ),
inference(constrained_superposition,[],[f15,f14]) ).
thf(f14,plain,
! [X0: ( a > $o ) > $o] :
( ( ( cOPEN
@ ^ [Y0: a] :
( ?? @ ( a > $o )
@ ^ [Y1: a > $o] :
( ( X0 @ Y1 )
& ( Y1 @ Y0 ) ) ) )
= $true )
| ( ( X0 @ ( sK0 @ X0 ) )
= $true ) ),
inference(cnf_transformation,[],[f10]) ).
thf(f10,plain,
( ( ( cOPEN
@ ^ [Y0: a] : $false )
!= $true )
& ! [X0: ( a > $o ) > $o] :
( ( ( cOPEN
@ ^ [Y0: a] :
( ?? @ ( a > $o )
@ ^ [Y1: a > $o] :
( ( X0 @ Y1 )
& ( Y1 @ Y0 ) ) ) )
= $true )
| ( ( ( X0 @ ( sK0 @ X0 ) )
= $true )
& ( ( cOPEN @ ( sK0 @ X0 ) )
!= $true ) ) )
& ! [X2: a > $o,X3: a > $o] :
( ( ( cOPEN @ X3 )
!= $true )
| ( ( cOPEN @ X2 )
!= $true )
| ( ( cOPEN
@ ^ [Y0: a] :
( ( X2 @ Y0 )
& ( X3 @ Y0 ) ) )
= $true ) )
& ( ( cOPEN
@ ^ [Y0: a] : $true )
= $true ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0])],[f8,f9]) ).
thf(f9,plain,
! [X0: ( a > $o ) > $o] :
( ? [X1: a > $o] :
( ( ( X0 @ X1 )
= $true )
& ( ( cOPEN @ X1 )
!= $true ) )
=> ( ( ( X0 @ ( sK0 @ X0 ) )
= $true )
& ( ( cOPEN @ ( sK0 @ X0 ) )
!= $true ) ) ),
introduced(choice_axiom,[]) ).
thf(f8,plain,
( ( ( cOPEN
@ ^ [Y0: a] : $false )
!= $true )
& ! [X0: ( a > $o ) > $o] :
( ( ( cOPEN
@ ^ [Y0: a] :
( ?? @ ( a > $o )
@ ^ [Y1: a > $o] :
( ( X0 @ Y1 )
& ( Y1 @ Y0 ) ) ) )
= $true )
| ? [X1: a > $o] :
( ( ( X0 @ X1 )
= $true )
& ( ( cOPEN @ X1 )
!= $true ) ) )
& ! [X2: a > $o,X3: a > $o] :
( ( ( cOPEN @ X3 )
!= $true )
| ( ( cOPEN @ X2 )
!= $true )
| ( ( cOPEN
@ ^ [Y0: a] :
( ( X2 @ Y0 )
& ( X3 @ Y0 ) ) )
= $true ) )
& ( ( cOPEN
@ ^ [Y0: a] : $true )
= $true ) ),
inference(flattening,[],[f7]) ).
thf(f7,plain,
( ( ( cOPEN
@ ^ [Y0: a] : $false )
!= $true )
& ( ( cOPEN
@ ^ [Y0: a] : $true )
= $true )
& ! [X2: a > $o,X3: a > $o] :
( ( ( cOPEN
@ ^ [Y0: a] :
( ( X2 @ Y0 )
& ( X3 @ Y0 ) ) )
= $true )
| ( ( cOPEN @ X3 )
!= $true )
| ( ( cOPEN @ X2 )
!= $true ) )
& ! [X0: ( a > $o ) > $o] :
( ( ( cOPEN
@ ^ [Y0: a] :
( ?? @ ( a > $o )
@ ^ [Y1: a > $o] :
( ( X0 @ Y1 )
& ( Y1 @ Y0 ) ) ) )
= $true )
| ? [X1: a > $o] :
( ( ( X0 @ X1 )
= $true )
& ( ( cOPEN @ X1 )
!= $true ) ) ) ),
inference(ennf_transformation,[],[f6]) ).
thf(f6,plain,
~ ( ( ( ( cOPEN
@ ^ [Y0: a] : $true )
= $true )
& ! [X2: a > $o,X3: a > $o] :
( ( ( ( cOPEN @ X3 )
= $true )
& ( ( cOPEN @ X2 )
= $true ) )
=> ( ( cOPEN
@ ^ [Y0: a] :
( ( X2 @ Y0 )
& ( X3 @ Y0 ) ) )
= $true ) )
& ! [X0: ( a > $o ) > $o] :
( ! [X1: a > $o] :
( ( ( X0 @ X1 )
= $true )
=> ( ( cOPEN @ X1 )
= $true ) )
=> ( ( cOPEN
@ ^ [Y0: a] :
( ?? @ ( a > $o )
@ ^ [Y1: a > $o] :
( ( X0 @ Y1 )
& ( Y1 @ Y0 ) ) ) )
= $true ) ) )
=> ( ( cOPEN
@ ^ [Y0: a] : $false )
= $true ) ),
inference(rectify,[],[f5]) ).
thf(f5,plain,
~ ( ( ! [X0: ( a > $o ) > $o] :
( ! [X1: a > $o] :
( ( ( X0 @ X1 )
= $true )
=> ( ( cOPEN @ X1 )
= $true ) )
=> ( ( cOPEN
@ ^ [Y0: a] :
( ?? @ ( a > $o )
@ ^ [Y1: a > $o] :
( ( X0 @ Y1 )
& ( Y1 @ Y0 ) ) ) )
= $true ) )
& ( ( cOPEN
@ ^ [Y0: a] : $true )
= $true )
& ! [X5: a > $o,X6: a > $o] :
( ( ( ( cOPEN @ X6 )
= $true )
& ( ( cOPEN @ X5 )
= $true ) )
=> ( ( cOPEN
@ ^ [Y0: a] :
( ( X5 @ Y0 )
& ( X6 @ Y0 ) ) )
= $true ) ) )
=> ( ( cOPEN
@ ^ [Y0: a] : $false )
= $true ) ),
inference(fool_elimination,[],[f4]) ).
thf(f4,plain,
~ ( ( ! [X0: ( a > $o ) > $o] :
( ! [X1: a > $o] :
( ( X0 @ X1 )
=> ( cOPEN @ X1 ) )
=> ( cOPEN
@ ^ [X2: a] :
? [X3: a > $o] :
( ( X3 @ X2 )
& ( X0 @ X3 ) ) ) )
& ( cOPEN
@ ^ [X4: a] : $true )
& ! [X5: a > $o,X6: a > $o] :
( ( ( cOPEN @ X6 )
& ( cOPEN @ X5 ) )
=> ( cOPEN
@ ^ [X7: a] :
( ( X6 @ X7 )
& ( X5 @ X7 ) ) ) ) )
=> ( cOPEN
@ ^ [X8: a] : $false ) ),
inference(rectify,[],[f2]) ).
thf(f2,negated_conjecture,
~ ( ( ! [X1: ( a > $o ) > $o] :
( ! [X2: a > $o] :
( ( X1 @ X2 )
=> ( cOPEN @ X2 ) )
=> ( cOPEN
@ ^ [X2: a] :
? [X3: a > $o] :
( ( X3 @ X2 )
& ( X1 @ X3 ) ) ) )
& ( cOPEN
@ ^ [X0: a] : $true )
& ! [X5: a > $o,X4: a > $o] :
( ( ( cOPEN @ X4 )
& ( cOPEN @ X5 ) )
=> ( cOPEN
@ ^ [X2: a] :
( ( X4 @ X2 )
& ( X5 @ X2 ) ) ) ) )
=> ( cOPEN
@ ^ [X0: a] : $false ) ),
inference(negated_conjecture,[],[f1]) ).
thf(f1,conjecture,
( ( ! [X1: ( a > $o ) > $o] :
( ! [X2: a > $o] :
( ( X1 @ X2 )
=> ( cOPEN @ X2 ) )
=> ( cOPEN
@ ^ [X2: a] :
? [X3: a > $o] :
( ( X3 @ X2 )
& ( X1 @ X3 ) ) ) )
& ( cOPEN
@ ^ [X0: a] : $true )
& ! [X5: a > $o,X4: a > $o] :
( ( ( cOPEN @ X4 )
& ( cOPEN @ X5 ) )
=> ( cOPEN
@ ^ [X2: a] :
( ( X4 @ X2 )
& ( X5 @ X2 ) ) ) ) )
=> ( cOPEN
@ ^ [X0: a] : $false ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cTHM625_pme) ).
thf(f15,plain,
( ( cOPEN
@ ^ [Y0: a] : $false )
!= $true ),
inference(cnf_transformation,[],[f10]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.12 % Problem : SEV257^5 : TPTP v8.2.0. Released v4.0.0.
% 0.08/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.15/0.35 % Computer : n006.cluster.edu
% 0.15/0.35 % Model : x86_64 x86_64
% 0.15/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.35 % Memory : 8042.1875MB
% 0.15/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.35 % CPULimit : 300
% 0.15/0.35 % WCLimit : 300
% 0.15/0.35 % DateTime : Sun May 19 19:02:53 EDT 2024
% 0.15/0.35 % CPUTime :
% 0.15/0.35 This is a TH0_THM_NEQ_NAR problem
% 0.15/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.15/0.37 % (8834)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.15/0.38 % (8833)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.15/0.38 % (8835)lrs+10_1:1_au=on:inj=on:i=2:si=on:rtra=on_0 on theBenchmark for (2999ds/2Mi)
% 0.15/0.38 % (8836)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.15/0.38 % (8832)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.15/0.38 % (8836)Instruction limit reached!
% 0.15/0.38 % (8836)------------------------------
% 0.15/0.38 % (8836)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.15/0.38 % (8837)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.15/0.38 % (8836)Termination reason: Unknown
% 0.15/0.38 % (8836)Termination phase: Property scanning
% 0.15/0.38
% 0.15/0.38 % (8836)Memory used [KB]: 895
% 0.15/0.38 % (8836)Time elapsed: 0.003 s
% 0.15/0.38 % (8836)Instructions burned: 2 (million)
% 0.15/0.38 % (8836)------------------------------
% 0.15/0.38 % (8836)------------------------------
% 0.15/0.38 % (8838)lrs+1004_1:128_cond=on:e2e=on:sp=weighted_frequency:i=18:si=on:rtra=on_0 on theBenchmark for (2999ds/18Mi)
% 0.15/0.38 % (8835)Instruction limit reached!
% 0.15/0.38 % (8835)------------------------------
% 0.15/0.38 % (8835)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.15/0.38 % (8835)Termination reason: Unknown
% 0.15/0.38 % (8835)Termination phase: Saturation
% 0.15/0.38
% 0.15/0.38 % (8835)Memory used [KB]: 5500
% 0.15/0.38 % (8835)Time elapsed: 0.004 s
% 0.15/0.38 % (8835)Instructions burned: 2 (million)
% 0.15/0.38 % (8835)------------------------------
% 0.15/0.38 % (8835)------------------------------
% 0.15/0.38 % (8837)Refutation not found, incomplete strategy
% 0.15/0.38 % (8837)------------------------------
% 0.15/0.38 % (8837)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.15/0.38 % (8837)Termination reason: Refutation not found, incomplete strategy
% 0.15/0.38
% 0.15/0.38
% 0.15/0.38 % (8837)Memory used [KB]: 5500
% 0.15/0.38 % (8837)Time elapsed: 0.004 s
% 0.15/0.38 % (8837)Instructions burned: 3 (million)
% 0.15/0.38 % (8833)Instruction limit reached!
% 0.15/0.38 % (8833)------------------------------
% 0.15/0.38 % (8833)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.15/0.38 % (8837)------------------------------
% 0.15/0.38 % (8837)------------------------------
% 0.15/0.38 % (8833)Termination reason: Unknown
% 0.15/0.38 % (8833)Termination phase: Saturation
% 0.15/0.38
% 0.15/0.38 % (8833)Memory used [KB]: 5500
% 0.15/0.38 % (8833)Time elapsed: 0.006 s
% 0.15/0.38 % (8833)Instructions burned: 5 (million)
% 0.15/0.38 % (8833)------------------------------
% 0.15/0.38 % (8833)------------------------------
% 0.15/0.38 % (8834)Instruction limit reached!
% 0.15/0.38 % (8834)------------------------------
% 0.15/0.38 % (8834)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.15/0.38 % (8834)Termination reason: Unknown
% 0.15/0.38 % (8834)Termination phase: Saturation
% 0.15/0.38
% 0.15/0.38 % (8834)Memory used [KB]: 5628
% 0.15/0.38 % (8834)Time elapsed: 0.012 s
% 0.15/0.38 % (8834)Instructions burned: 28 (million)
% 0.15/0.38 % (8834)------------------------------
% 0.15/0.38 % (8834)------------------------------
% 0.15/0.39 % (8838)First to succeed.
% 0.15/0.39 % (8838)Refutation found. Thanks to Tanya!
% 0.15/0.39 % SZS status Theorem for theBenchmark
% 0.15/0.39 % SZS output start Proof for theBenchmark
% See solution above
% 0.15/0.39 % (8838)------------------------------
% 0.15/0.39 % (8838)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.15/0.39 % (8838)Termination reason: Refutation
% 0.15/0.39
% 0.15/0.39 % (8838)Memory used [KB]: 5500
% 0.15/0.39 % (8838)Time elapsed: 0.012 s
% 0.15/0.39 % (8838)Instructions burned: 10 (million)
% 0.15/0.39 % (8838)------------------------------
% 0.15/0.39 % (8838)------------------------------
% 0.15/0.39 % (8831)Success in time 0.014 s
% 0.15/0.39 % Vampire---4.8 exiting
%------------------------------------------------------------------------------