TSTP Solution File: SEV256^5 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SEV256^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 : n012.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.14s 0.38s
% Output : Refutation 0.14s
% Verified :
% SZS Type : Refutation
% Derivation depth : 17
% Number of leaves : 9
% Syntax : Number of formulae : 27 ( 3 unt; 7 typ; 0 def)
% Number of atoms : 142 ( 39 equ; 0 cnn)
% Maximal formula atoms : 4 ( 7 avg)
% Number of connectives : 177 ( 15 ~; 13 |; 19 &; 109 @)
% ( 0 <=>; 13 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 5 avg)
% Number of types : 2 ( 1 usr)
% Number of type conns : 73 ( 73 >; 0 *; 0 +; 0 <<)
% Number of symbols : 9 ( 5 usr; 3 con; 0-2 aty)
% ( 0 !!; 8 ??; 0 @@+; 0 @@-)
% Number of variables : 58 ( 33 ^ 19 !; 5 ?; 58 :)
% ( 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 > $o ) > $o ) > a ).
thf(func_def_15,type,
sK4: ( ( a > $o ) > $o ) > a > $o ).
thf(f43,plain,
$false,
inference(trivial_inequality_removal,[],[f42]) ).
thf(f42,plain,
$false = $true,
inference(duplicate_literal_removal,[],[f41]) ).
thf(f41,plain,
( ( $false = $true )
| ( $false = $true ) ),
inference(beta_eta_normalization,[],[f26]) ).
thf(f26,plain,
( ( $true
= ( ^ [Y0: a > $o] : $false
@ ( sK0
@ ^ [Y0: a > $o] : $false ) ) )
| ( ( ^ [Y0: a > $o] : $false
@ ( sK4
@ ^ [Y0: a > $o] : $false ) )
= $true ) ),
inference(primitive_instantiation,[],[f23]) ).
thf(f23,plain,
! [X0: ( a > $o ) > $o] :
( ( ( X0 @ ( sK4 @ X0 ) )
= $true )
| ( ( X0 @ ( sK0 @ X0 ) )
= $true ) ),
inference(binary_proxy_clausification,[],[f22]) ).
thf(f22,plain,
! [X0: ( a > $o ) > $o] :
( ( $true
= ( ( sK4 @ X0 @ ( sK3 @ X0 ) )
& ( X0 @ ( sK4 @ X0 ) ) ) )
| ( ( X0 @ ( sK0 @ X0 ) )
= $true ) ),
inference(beta_eta_normalization,[],[f21]) ).
thf(f21,plain,
! [X0: ( a > $o ) > $o] :
( ( ( X0 @ ( sK0 @ X0 ) )
= $true )
| ( ( ^ [Y0: a > $o] :
( ( Y0 @ ( sK3 @ X0 ) )
& ( X0 @ Y0 ) )
@ ( sK4 @ X0 ) )
= $true ) ),
inference(sigma_clausification,[],[f20]) ).
thf(f20,plain,
! [X0: ( a > $o ) > $o] :
( ( $false
!= ( ?? @ ( a > $o )
@ ^ [Y0: a > $o] :
( ( Y0 @ ( sK3 @ X0 ) )
& ( X0 @ Y0 ) ) ) )
| ( ( X0 @ ( sK0 @ X0 ) )
= $true ) ),
inference(beta_eta_normalization,[],[f19]) ).
thf(f19,plain,
! [X0: ( a > $o ) > $o] :
( ( ( ^ [Y0: a] : $false
@ ( sK3 @ X0 ) )
!= ( ^ [Y0: a] :
( ?? @ ( a > $o )
@ ^ [Y1: a > $o] :
( ( Y1 @ Y0 )
& ( X0 @ Y1 ) ) )
@ ( sK3 @ X0 ) ) )
| ( ( X0 @ ( sK0 @ X0 ) )
= $true ) ),
inference(negative_extensionality,[],[f14]) ).
thf(f14,plain,
! [X0: ( a > $o ) > $o] :
( ( ( ^ [Y0: a] :
( ?? @ ( a > $o )
@ ^ [Y1: a > $o] :
( ( Y1 @ Y0 )
& ( X0 @ Y1 ) ) ) )
!= ( ^ [Y0: a] : $false ) )
| ( ( X0 @ ( sK0 @ X0 ) )
= $true ) ),
inference(trivial_inequality_removal,[],[f12]) ).
thf(f12,plain,
! [X0: ( a > $o ) > $o] :
( ( ( X0 @ ( sK0 @ X0 ) )
= $true )
| ( ( ^ [Y0: a] :
( ?? @ ( a > $o )
@ ^ [Y1: a > $o] :
( ( Y1 @ Y0 )
& ( X0 @ Y1 ) ) ) )
!= ( ^ [Y0: a] : $false ) )
| ( $true != $true ) ),
inference(constrained_superposition,[],[f9,f10]) ).
thf(f10,plain,
! [X0: ( a > $o ) > $o] :
( ( $true
= ( cOPEN
@ ^ [Y0: a] :
( ?? @ ( a > $o )
@ ^ [Y1: a > $o] :
( ( Y1 @ Y0 )
& ( X0 @ Y1 ) ) ) ) )
| ( ( X0 @ ( sK0 @ X0 ) )
= $true ) ),
inference(cnf_transformation,[],[f8]) ).
thf(f8,plain,
( ! [X0: ( a > $o ) > $o] :
( ( $true
= ( cOPEN
@ ^ [Y0: a] :
( ?? @ ( a > $o )
@ ^ [Y1: a > $o] :
( ( Y1 @ Y0 )
& ( X0 @ Y1 ) ) ) ) )
| ( ( $true
!= ( cOPEN @ ( sK0 @ X0 ) ) )
& ( ( X0 @ ( sK0 @ X0 ) )
= $true ) ) )
& ( $true
!= ( cOPEN
@ ^ [Y0: a] : $false ) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0])],[f6,f7]) ).
thf(f7,plain,
! [X0: ( a > $o ) > $o] :
( ? [X1: a > $o] :
( ( ( cOPEN @ X1 )
!= $true )
& ( ( X0 @ X1 )
= $true ) )
=> ( ( $true
!= ( cOPEN @ ( sK0 @ X0 ) ) )
& ( ( X0 @ ( sK0 @ X0 ) )
= $true ) ) ),
introduced(choice_axiom,[]) ).
thf(f6,plain,
( ! [X0: ( a > $o ) > $o] :
( ( $true
= ( cOPEN
@ ^ [Y0: a] :
( ?? @ ( a > $o )
@ ^ [Y1: a > $o] :
( ( Y1 @ Y0 )
& ( X0 @ Y1 ) ) ) ) )
| ? [X1: a > $o] :
( ( ( cOPEN @ X1 )
!= $true )
& ( ( X0 @ X1 )
= $true ) ) )
& ( $true
!= ( cOPEN
@ ^ [Y0: a] : $false ) ) ),
inference(ennf_transformation,[],[f5]) ).
thf(f5,plain,
~ ( ! [X0: ( a > $o ) > $o] :
( ! [X1: a > $o] :
( ( ( X0 @ X1 )
= $true )
=> ( ( cOPEN @ X1 )
= $true ) )
=> ( $true
= ( cOPEN
@ ^ [Y0: a] :
( ?? @ ( a > $o )
@ ^ [Y1: a > $o] :
( ( Y1 @ Y0 )
& ( X0 @ Y1 ) ) ) ) ) )
=> ( $true
= ( cOPEN
@ ^ [Y0: a] : $false ) ) ),
inference(fool_elimination,[],[f4]) ).
thf(f4,plain,
~ ( ! [X0: ( a > $o ) > $o] :
( ! [X1: a > $o] :
( ( X0 @ X1 )
=> ( cOPEN @ X1 ) )
=> ( cOPEN
@ ^ [X2: a] :
? [X3: a > $o] :
( ( X0 @ X3 )
& ( X3 @ X2 ) ) ) )
=> ( cOPEN
@ ^ [X4: a] : $false ) ),
inference(rectify,[],[f2]) ).
thf(f2,negated_conjecture,
~ ( ! [X0: ( a > $o ) > $o] :
( ! [X1: a > $o] :
( ( X0 @ X1 )
=> ( cOPEN @ X1 ) )
=> ( cOPEN
@ ^ [X1: a] :
? [X2: a > $o] :
( ( X0 @ X2 )
& ( X2 @ X1 ) ) ) )
=> ( cOPEN
@ ^ [X1: a] : $false ) ),
inference(negated_conjecture,[],[f1]) ).
thf(f1,conjecture,
( ! [X0: ( a > $o ) > $o] :
( ! [X1: a > $o] :
( ( X0 @ X1 )
=> ( cOPEN @ X1 ) )
=> ( cOPEN
@ ^ [X1: a] :
? [X2: a > $o] :
( ( X0 @ X2 )
& ( X2 @ X1 ) ) ) )
=> ( cOPEN
@ ^ [X1: a] : $false ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cTHM625A_pme) ).
thf(f9,plain,
( $true
!= ( cOPEN
@ ^ [Y0: a] : $false ) ),
inference(cnf_transformation,[],[f8]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SEV256^5 : TPTP v8.2.0. Released v4.0.0.
% 0.07/0.14 % 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.35 % Computer : n012.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 : Sun May 19 18:41:53 EDT 2024
% 0.14/0.35 % CPUTime :
% 0.14/0.35 This is a TH0_THM_NEQ_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.37 % (9858)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.37 % (9857)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.37 % (9859)lrs+10_1:1_au=on:inj=on:i=2:si=on:rtra=on_0 on theBenchmark for (3000ds/2Mi)
% 0.14/0.37 % (9860)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 % (9856)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 % (9862)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 % (9863)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 % (9861)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 % (9860)Instruction limit reached!
% 0.14/0.38 % (9860)------------------------------
% 0.14/0.38 % (9860)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.14/0.38 % (9860)Termination reason: Unknown
% 0.14/0.38 % (9860)Termination phase: Saturation
% 0.14/0.38
% 0.14/0.38 % (9860)Memory used [KB]: 895
% 0.14/0.38 % (9860)Time elapsed: 0.003 s
% 0.14/0.38 % (9860)Instructions burned: 2 (million)
% 0.14/0.38 % (9860)------------------------------
% 0.14/0.38 % (9860)------------------------------
% 0.14/0.38 % (9859)Instruction limit reached!
% 0.14/0.38 % (9859)------------------------------
% 0.14/0.38 % (9859)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.14/0.38 % (9859)Termination reason: Unknown
% 0.14/0.38 % (9859)Termination phase: Saturation
% 0.14/0.38
% 0.14/0.38 % (9859)Memory used [KB]: 5500
% 0.14/0.38 % (9859)Time elapsed: 0.004 s
% 0.14/0.38 % (9859)Instructions burned: 2 (million)
% 0.14/0.38 % (9859)------------------------------
% 0.14/0.38 % (9859)------------------------------
% 0.14/0.38 % (9858)Refutation not found, incomplete strategy
% 0.14/0.38 % (9858)------------------------------
% 0.14/0.38 % (9858)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.14/0.38 % (9858)Termination reason: Refutation not found, incomplete strategy
% 0.14/0.38
% 0.14/0.38
% 0.14/0.38 % (9858)Memory used [KB]: 5500
% 0.14/0.38 % (9858)Time elapsed: 0.004 s
% 0.14/0.38 % (9858)Instructions burned: 2 (million)
% 0.14/0.38 % (9858)------------------------------
% 0.14/0.38 % (9858)------------------------------
% 0.14/0.38 % (9861)Refutation not found, incomplete strategy
% 0.14/0.38 % (9861)------------------------------
% 0.14/0.38 % (9861)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.14/0.38 % (9861)Termination reason: Refutation not found, incomplete strategy
% 0.14/0.38
% 0.14/0.38
% 0.14/0.38 % (9861)Memory used [KB]: 5500
% 0.14/0.38 % (9861)Time elapsed: 0.003 s
% 0.14/0.38 % (9861)Instructions burned: 2 (million)
% 0.14/0.38 % (9861)------------------------------
% 0.14/0.38 % (9861)------------------------------
% 0.14/0.38 % (9863)Instruction limit reached!
% 0.14/0.38 % (9863)------------------------------
% 0.14/0.38 % (9863)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.14/0.38 % (9863)Termination reason: Unknown
% 0.14/0.38 % (9863)Termination phase: Saturation
% 0.14/0.38
% 0.14/0.38 % (9863)Memory used [KB]: 5500
% 0.14/0.38 % (9863)Time elapsed: 0.005 s
% 0.14/0.38 % (9863)Instructions burned: 4 (million)
% 0.14/0.38 % (9863)------------------------------
% 0.14/0.38 % (9863)------------------------------
% 0.14/0.38 % (9857)Instruction limit reached!
% 0.14/0.38 % (9857)------------------------------
% 0.14/0.38 % (9857)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.14/0.38 % (9857)Termination reason: Unknown
% 0.14/0.38 % (9857)Termination phase: Saturation
% 0.14/0.38
% 0.14/0.38 % (9857)Memory used [KB]: 5500
% 0.14/0.38 % (9857)Time elapsed: 0.006 s
% 0.14/0.38 % (9857)Instructions burned: 5 (million)
% 0.14/0.38 % (9857)------------------------------
% 0.14/0.38 % (9857)------------------------------
% 0.14/0.38 % (9862)First to succeed.
% 0.14/0.38 % (9862)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 % (9862)------------------------------
% 0.14/0.38 % (9862)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.14/0.38 % (9862)Termination reason: Refutation
% 0.14/0.38
% 0.14/0.38 % (9862)Memory used [KB]: 5500
% 0.14/0.38 % (9862)Time elapsed: 0.008 s
% 0.14/0.38 % (9862)Instructions burned: 7 (million)
% 0.14/0.38 % (9862)------------------------------
% 0.14/0.38 % (9862)------------------------------
% 0.14/0.38 % (9855)Success in time 0.007 s
% 0.14/0.38 % Vampire---4.8 exiting
%------------------------------------------------------------------------------