TSTP Solution File: SEV290^5 by Vampire---4.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.9
% Problem : SEV290^5 : TPTP v8.2.0. Bugfixed v5.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire %s %d THM
% Computer : n020.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 : Mon Jun 24 16:02:39 EDT 2024
% Result : Theorem 0.21s 0.38s
% Output : Refutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 2
% Syntax : Number of formulae : 11 ( 4 unt; 0 typ; 0 def)
% Number of atoms : 52 ( 13 equ; 0 cnn)
% Maximal formula atoms : 4 ( 4 avg)
% Number of connectives : 48 ( 7 ~; 0 |; 4 &; 32 @)
% ( 0 <=>; 5 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 4 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 40 ( 40 >; 0 *; 0 +; 0 <<)
% Number of symbols : 8 ( 5 usr; 2 con; 0-2 aty)
% Number of variables : 16 ( 2 ^ 8 !; 6 ?; 16 :)
% Comments :
%------------------------------------------------------------------------------
thf(func_def_0,type,
c0: ( $i > $o ) > $o ).
thf(func_def_1,type,
cSUCC: ( ( $i > $o ) > $o ) > ( $i > $o ) > $o ).
thf(func_def_2,type,
c_less__eq_: ( ( $i > $o ) > $o ) > ( ( $i > $o ) > $o ) > $o ).
thf(func_def_16,type,
sK0: ( ( ( $i > $o ) > $o ) > $o ) > ( $i > $o ) > $o ).
thf(func_def_18,type,
ph2:
!>[X0: $tType] : X0 ).
thf(f22,plain,
$false,
inference(trivial_inequality_removal,[],[f21]) ).
thf(f21,plain,
$false = $true,
inference(beta_eta_normalization,[],[f18]) ).
thf(f18,plain,
( ( ^ [Y0: ( $i > $o ) > $o] : $false
@ ( sK0
@ ^ [Y0: ( $i > $o ) > $o] : $false ) )
= $true ),
inference(primitive_instantiation,[],[f16]) ).
thf(f16,plain,
! [X0: ( ( $i > $o ) > $o ) > $o] :
( $true
= ( X0 @ ( sK0 @ X0 ) ) ),
inference(cnf_transformation,[],[f14]) ).
thf(f14,plain,
! [X0: ( ( $i > $o ) > $o ) > $o] :
( ( $true
= ( X0 @ ( sK0 @ X0 ) ) )
& ( ( c_less__eq_ @ ( sK0 @ X0 ) @ c0 )
!= $true ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0])],[f12,f13]) ).
thf(f13,plain,
! [X0: ( ( $i > $o ) > $o ) > $o] :
( ? [X1: ( $i > $o ) > $o] :
( ( ( X0 @ X1 )
= $true )
& ( ( c_less__eq_ @ X1 @ c0 )
!= $true ) )
=> ( ( $true
= ( X0 @ ( sK0 @ X0 ) ) )
& ( ( c_less__eq_ @ ( sK0 @ X0 ) @ c0 )
!= $true ) ) ),
introduced(choice_axiom,[]) ).
thf(f12,plain,
! [X0: ( ( $i > $o ) > $o ) > $o] :
? [X1: ( $i > $o ) > $o] :
( ( ( X0 @ X1 )
= $true )
& ( ( c_less__eq_ @ X1 @ c0 )
!= $true ) ),
inference(ennf_transformation,[],[f9]) ).
thf(f9,plain,
~ ? [X0: ( ( $i > $o ) > $o ) > $o] :
! [X1: ( $i > $o ) > $o] :
( ( ( X0 @ X1 )
= $true )
=> ( ( c_less__eq_ @ X1 @ c0 )
= $true ) ),
inference(fool_elimination,[],[f8]) ).
thf(f8,plain,
~ ? [X0: ( ( $i > $o ) > $o ) > $o] :
! [X1: ( $i > $o ) > $o] :
( ( X0 @ X1 )
=> ( c_less__eq_ @ X1 @ c0 ) ),
inference(rectify,[],[f4]) ).
thf(f4,negated_conjecture,
~ ? [X6: ( ( $i > $o ) > $o ) > $o] :
! [X2: ( $i > $o ) > $o] :
( ( X6 @ X2 )
=> ( c_less__eq_ @ X2 @ c0 ) ),
inference(negated_conjecture,[],[f3]) ).
thf(f3,conjecture,
? [X6: ( ( $i > $o ) > $o ) > $o] :
! [X2: ( $i > $o ) > $o] :
( ( X6 @ X2 )
=> ( c_less__eq_ @ X2 @ c0 ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cBLEDSOE1) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.13 % Problem : SEV290^5 : TPTP v8.2.0. Bugfixed v5.2.0.
% 0.04/0.13 % Command : run_vampire %s %d THM
% 0.13/0.34 % Computer : n020.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Fri Jun 21 18:15:09 EDT 2024
% 0.13/0.34 % CPUTime :
% 0.21/0.35 This is a TH0_THM_EQU_NAR problem
% 0.21/0.35 Running higher-order theorem proving
% 0.21/0.35 Running /export/starexec/sandbox/solver/bin/vampire_ho --cores 7 --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_hol /export/starexec/sandbox/benchmark/theBenchmark.p -m 16384 -t 300
% 0.21/0.37 % (11612)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.21/0.37 % (11610)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.21/0.37 % (11614)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.21/0.37 % (11613)lrs+10_1:1_au=on:inj=on:i=2:si=on:rtra=on_0 on theBenchmark for (3000ds/2Mi)
% 0.21/0.37 % (11615)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.21/0.37 % (11611)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.21/0.37 % (11616)lrs+1004_1:128_cond=on:e2e=on:sp=weighted_frequency:i=18:si=on:rtra=on_0 on theBenchmark for (3000ds/18Mi)
% 0.21/0.37 % (11613)Instruction limit reached!
% 0.21/0.37 % (11613)------------------------------
% 0.21/0.37 % (11613)Version: Vampire 4.8 (commit 11aac991b on 2023-10-04 16:26:07 +0200)
% 0.21/0.37 % (11613)Termination reason: Unknown
% 0.21/0.37 % (11613)Termination phase: Saturation
% 0.21/0.37
% 0.21/0.37 % (11613)Memory used [KB]: 5500
% 0.21/0.37 % (11613)Time elapsed: 0.004 s
% 0.21/0.37 % (11613)Instructions burned: 2 (million)
% 0.21/0.37 % (11613)------------------------------
% 0.21/0.37 % (11613)------------------------------
% 0.21/0.37 % (11614)Instruction limit reached!
% 0.21/0.37 % (11614)------------------------------
% 0.21/0.37 % (11614)Version: Vampire 4.8 (commit 11aac991b on 2023-10-04 16:26:07 +0200)
% 0.21/0.37 % (11614)Termination reason: Unknown
% 0.21/0.37 % (11614)Termination phase: Saturation
% 0.21/0.37
% 0.21/0.37 % (11614)Memory used [KB]: 5500
% 0.21/0.37 % (11614)Time elapsed: 0.004 s
% 0.21/0.37 % (11614)Instructions burned: 2 (million)
% 0.21/0.37 % (11614)------------------------------
% 0.21/0.37 % (11614)------------------------------
% 0.21/0.37 % (11615)First to succeed.
% 0.21/0.38 % (11610)Also succeeded, but the first one will report.
% 0.21/0.38 % (11612)Refutation not found, incomplete strategy
% 0.21/0.38 % (11612)------------------------------
% 0.21/0.38 % (11612)Version: Vampire 4.8 (commit 11aac991b on 2023-10-04 16:26:07 +0200)
% 0.21/0.38 % (11612)Termination reason: Refutation not found, incomplete strategy
% 0.21/0.38
% 0.21/0.38
% 0.21/0.38 % (11612)Memory used [KB]: 5500
% 0.21/0.38 % (11612)Time elapsed: 0.005 s
% 0.21/0.38 % (11612)Instructions burned: 3 (million)
% 0.21/0.38 % (11612)------------------------------
% 0.21/0.38 % (11612)------------------------------
% 0.21/0.38 % (11615)Refutation found. Thanks to Tanya!
% 0.21/0.38 % SZS status Theorem for theBenchmark
% 0.21/0.38 % SZS output start Proof for theBenchmark
% See solution above
% 0.21/0.38 % (11615)------------------------------
% 0.21/0.38 % (11615)Version: Vampire 4.8 (commit 11aac991b on 2023-10-04 16:26:07 +0200)
% 0.21/0.38 % (11615)Termination reason: Refutation
% 0.21/0.38
% 0.21/0.38 % (11615)Memory used [KB]: 5500
% 0.21/0.38 % (11615)Time elapsed: 0.005 s
% 0.21/0.38 % (11615)Instructions burned: 2 (million)
% 0.21/0.38 % (11615)------------------------------
% 0.21/0.38 % (11615)------------------------------
% 0.21/0.38 % (11609)Success in time 0.018 s
%------------------------------------------------------------------------------