TSTP Solution File: SEV053^5 by Vampire---4.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.9
% Problem : SEV053^5 : TPTP v8.2.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire %s %d THM
% Computer : n019.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:01:38 EDT 2024
% Result : Theorem 0.21s 0.39s
% Output : Refutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 2
% Syntax : Number of formulae : 17 ( 4 unt; 0 typ; 0 def)
% Number of atoms : 136 ( 40 equ; 0 cnn)
% Maximal formula atoms : 5 ( 8 avg)
% Number of connectives : 258 ( 28 ~; 14 |; 16 &; 191 @)
% ( 0 <=>; 9 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 6 avg)
% Number of types : 3 ( 2 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of symbols : 7 ( 4 usr; 3 con; 0-2 aty)
% Number of variables : 46 ( 0 ^ 42 !; 4 ?; 46 :)
% Comments :
%------------------------------------------------------------------------------
thf(type_def_5,type,
b: $tType ).
thf(type_def_7,type,
a: $tType ).
thf(func_def_0,type,
b: $tType ).
thf(func_def_1,type,
a: $tType ).
thf(func_def_2,type,
cF: b > b ).
thf(func_def_3,type,
cA: b > a ).
thf(func_def_4,type,
cL: a > a > $o ).
thf(func_def_8,type,
sK0: b ).
thf(f20,plain,
$false,
inference(subsumption_resolution,[],[f19,f12]) ).
thf(f12,plain,
! [X3: b] :
( ( cL @ ( cA @ X3 ) @ ( cA @ ( cF @ X3 ) ) )
= $true ),
inference(cnf_transformation,[],[f10]) ).
thf(f10,plain,
( ! [X0: a,X1: a,X2: a] :
( ( $true
!= ( cL @ X2 @ X0 ) )
| ( ( cL @ X1 @ X0 )
= $true )
| ( ( cL @ X1 @ X2 )
!= $true ) )
& ! [X3: b] :
( ( cL @ ( cA @ X3 ) @ ( cA @ ( cF @ X3 ) ) )
= $true )
& ( $true
!= ( cL @ ( cA @ sK0 ) @ ( cA @ ( cF @ ( cF @ sK0 ) ) ) ) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0])],[f8,f9]) ).
thf(f9,plain,
( ? [X4: b] :
( ( cL @ ( cA @ X4 ) @ ( cA @ ( cF @ ( cF @ X4 ) ) ) )
!= $true )
=> ( $true
!= ( cL @ ( cA @ sK0 ) @ ( cA @ ( cF @ ( cF @ sK0 ) ) ) ) ) ),
introduced(choice_axiom,[]) ).
thf(f8,plain,
( ! [X0: a,X1: a,X2: a] :
( ( $true
!= ( cL @ X2 @ X0 ) )
| ( ( cL @ X1 @ X0 )
= $true )
| ( ( cL @ X1 @ X2 )
!= $true ) )
& ! [X3: b] :
( ( cL @ ( cA @ X3 ) @ ( cA @ ( cF @ X3 ) ) )
= $true )
& ? [X4: b] :
( ( cL @ ( cA @ X4 ) @ ( cA @ ( cF @ ( cF @ X4 ) ) ) )
!= $true ) ),
inference(rectify,[],[f7]) ).
thf(f7,plain,
( ! [X3: a,X2: a,X1: a] :
( ( $true
!= ( cL @ X1 @ X3 ) )
| ( $true
= ( cL @ X2 @ X3 ) )
| ( $true
!= ( cL @ X2 @ X1 ) ) )
& ! [X0: b] :
( $true
= ( cL @ ( cA @ X0 ) @ ( cA @ ( cF @ X0 ) ) ) )
& ? [X4: b] :
( ( cL @ ( cA @ X4 ) @ ( cA @ ( cF @ ( cF @ X4 ) ) ) )
!= $true ) ),
inference(flattening,[],[f6]) ).
thf(f6,plain,
( ? [X4: b] :
( ( cL @ ( cA @ X4 ) @ ( cA @ ( cF @ ( cF @ X4 ) ) ) )
!= $true )
& ! [X2: a,X1: a,X3: a] :
( ( $true
= ( cL @ X2 @ X3 ) )
| ( $true
!= ( cL @ X2 @ X1 ) )
| ( $true
!= ( cL @ X1 @ X3 ) ) )
& ! [X0: b] :
( $true
= ( cL @ ( cA @ X0 ) @ ( cA @ ( cF @ X0 ) ) ) ) ),
inference(ennf_transformation,[],[f5]) ).
thf(f5,plain,
~ ( ( ! [X2: a,X1: a,X3: a] :
( ( ( $true
= ( cL @ X2 @ X1 ) )
& ( $true
= ( cL @ X1 @ X3 ) ) )
=> ( $true
= ( cL @ X2 @ X3 ) ) )
& ! [X0: b] :
( $true
= ( cL @ ( cA @ X0 ) @ ( cA @ ( cF @ X0 ) ) ) ) )
=> ! [X4: b] :
( ( cL @ ( cA @ X4 ) @ ( cA @ ( cF @ ( cF @ X4 ) ) ) )
= $true ) ),
inference(fool_elimination,[],[f4]) ).
thf(f4,plain,
~ ( ( ! [X0: b] : ( cL @ ( cA @ X0 ) @ ( cA @ ( cF @ X0 ) ) )
& ! [X1: a,X2: a,X3: a] :
( ( ( cL @ X2 @ X1 )
& ( cL @ X1 @ X3 ) )
=> ( cL @ X2 @ X3 ) ) )
=> ! [X4: b] : ( cL @ ( cA @ X4 ) @ ( cA @ ( cF @ ( cF @ X4 ) ) ) ) ),
inference(rectify,[],[f2]) ).
thf(f2,negated_conjecture,
~ ( ( ! [X3: b] : ( cL @ ( cA @ X3 ) @ ( cA @ ( cF @ X3 ) ) )
& ! [X1: a,X0: a,X2: a] :
( ( ( cL @ X0 @ X1 )
& ( cL @ X1 @ X2 ) )
=> ( cL @ X0 @ X2 ) ) )
=> ! [X4: b] : ( cL @ ( cA @ X4 ) @ ( cA @ ( cF @ ( cF @ X4 ) ) ) ) ),
inference(negated_conjecture,[],[f1]) ).
thf(f1,conjecture,
( ( ! [X3: b] : ( cL @ ( cA @ X3 ) @ ( cA @ ( cF @ X3 ) ) )
& ! [X1: a,X0: a,X2: a] :
( ( ( cL @ X0 @ X1 )
& ( cL @ X1 @ X2 ) )
=> ( cL @ X0 @ X2 ) ) )
=> ! [X4: b] : ( cL @ ( cA @ X4 ) @ ( cA @ ( cF @ ( cF @ X4 ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cTHM89B_pme) ).
thf(f19,plain,
( $true
!= ( cL @ ( cA @ sK0 ) @ ( cA @ ( cF @ sK0 ) ) ) ),
inference(trivial_inequality_removal,[],[f16]) ).
thf(f16,plain,
( ( $true
!= ( cL @ ( cA @ sK0 ) @ ( cA @ ( cF @ sK0 ) ) ) )
| ( $true != $true ) ),
inference(superposition,[],[f15,f12]) ).
thf(f15,plain,
! [X0: a] :
( ( $true
!= ( cL @ X0 @ ( cA @ ( cF @ ( cF @ sK0 ) ) ) ) )
| ( $true
!= ( cL @ ( cA @ sK0 ) @ X0 ) ) ),
inference(trivial_inequality_removal,[],[f14]) ).
thf(f14,plain,
! [X0: a] :
( ( $true != $true )
| ( $true
!= ( cL @ ( cA @ sK0 ) @ X0 ) )
| ( $true
!= ( cL @ X0 @ ( cA @ ( cF @ ( cF @ sK0 ) ) ) ) ) ),
inference(superposition,[],[f11,f13]) ).
thf(f13,plain,
! [X2: a,X0: a,X1: a] :
( ( ( cL @ X1 @ X0 )
= $true )
| ( $true
!= ( cL @ X2 @ X0 ) )
| ( ( cL @ X1 @ X2 )
!= $true ) ),
inference(cnf_transformation,[],[f10]) ).
thf(f11,plain,
( $true
!= ( cL @ ( cA @ sK0 ) @ ( cA @ ( cF @ ( cF @ sK0 ) ) ) ) ),
inference(cnf_transformation,[],[f10]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : SEV053^5 : TPTP v8.2.0. Released v4.0.0.
% 0.07/0.13 % Command : run_vampire %s %d THM
% 0.13/0.34 % Computer : n019.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 19:34:24 EDT 2024
% 0.13/0.34 % CPUTime :
% 0.13/0.36 This is a TH0_THM_NEQ_NAR problem
% 0.13/0.36 Running higher-order theorem proving
% 0.13/0.36 Running /export/starexec/sandbox2/solver/bin/vampire_ho --cores 7 --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_hol /export/starexec/sandbox2/benchmark/theBenchmark.p -m 16384 -t 300
% 0.13/0.39 % (4188)lrs+10_1:1_au=on:inj=on:i=2:si=on:rtra=on_0 on theBenchmark for (2999ds/2Mi)
% 0.13/0.39 % (4186)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.13/0.39 % (4189)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.13/0.39 % (4190)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.13/0.39 % (4187)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.13/0.39 % (4185)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.13/0.39 % (4191)lrs+1004_1:128_cond=on:e2e=on:sp=weighted_frequency:i=18:si=on:rtra=on_0 on theBenchmark for (2999ds/18Mi)
% 0.13/0.39 % (4188)Instruction limit reached!
% 0.13/0.39 % (4188)------------------------------
% 0.13/0.39 % (4188)Version: Vampire 4.8 (commit 11aac991b on 2023-10-04 16:26:07 +0200)
% 0.13/0.39 % (4188)Termination reason: Unknown
% 0.13/0.39 % (4188)Termination phase: Saturation
% 0.13/0.39 % (4189)Instruction limit reached!
% 0.13/0.39 % (4189)------------------------------
% 0.13/0.39 % (4189)Version: Vampire 4.8 (commit 11aac991b on 2023-10-04 16:26:07 +0200)
% 0.13/0.39
% 0.13/0.39 % (4188)Memory used [KB]: 5500
% 0.13/0.39 % (4188)Time elapsed: 0.004 s
% 0.13/0.39 % (4188)Instructions burned: 2 (million)
% 0.13/0.39 % (4188)------------------------------
% 0.13/0.39 % (4188)------------------------------
% 0.13/0.39 % (4189)Termination reason: Unknown
% 0.13/0.39 % (4189)Termination phase: Saturation
% 0.13/0.39
% 0.13/0.39 % (4189)Memory used [KB]: 5500
% 0.13/0.39 % (4189)Time elapsed: 0.004 s
% 0.13/0.39 % (4189)Instructions burned: 2 (million)
% 0.13/0.39 % (4189)------------------------------
% 0.13/0.39 % (4189)------------------------------
% 0.21/0.39 % (4190)First to succeed.
% 0.21/0.39 % (4186)Instruction limit reached!
% 0.21/0.39 % (4186)------------------------------
% 0.21/0.39 % (4186)Version: Vampire 4.8 (commit 11aac991b on 2023-10-04 16:26:07 +0200)
% 0.21/0.39 % (4186)Termination reason: Unknown
% 0.21/0.39 % (4186)Termination phase: Saturation
% 0.21/0.39
% 0.21/0.39 % (4186)Memory used [KB]: 5500
% 0.21/0.39 % (4186)Time elapsed: 0.006 s
% 0.21/0.39 % (4186)Instructions burned: 4 (million)
% 0.21/0.39 % (4186)------------------------------
% 0.21/0.39 % (4186)------------------------------
% 0.21/0.39 % (4185)Also succeeded, but the first one will report.
% 0.21/0.39 % (4190)Refutation found. Thanks to Tanya!
% 0.21/0.39 % SZS status Theorem for theBenchmark
% 0.21/0.39 % SZS output start Proof for theBenchmark
% See solution above
% 0.21/0.39 % (4190)------------------------------
% 0.21/0.39 % (4190)Version: Vampire 4.8 (commit 11aac991b on 2023-10-04 16:26:07 +0200)
% 0.21/0.39 % (4190)Termination reason: Refutation
% 0.21/0.39
% 0.21/0.39 % (4190)Memory used [KB]: 5500
% 0.21/0.39 % (4190)Time elapsed: 0.005 s
% 0.21/0.39 % (4190)Instructions burned: 2 (million)
% 0.21/0.39 % (4190)------------------------------
% 0.21/0.39 % (4190)------------------------------
% 0.21/0.39 % (4184)Success in time 0.008 s
%------------------------------------------------------------------------------