TSTP Solution File: SEV186^5 by Vampire---4.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.9
% Problem : SEV186^5 : TPTP v8.2.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire %s %d THM
% Computer : n022.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:10 EDT 2024
% Result : Theorem 0.21s 0.38s
% Output : Refutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 20
% Number of leaves : 8
% Syntax : Number of formulae : 46 ( 6 unt; 0 typ; 0 def)
% Number of atoms : 521 ( 191 equ; 0 cnn)
% Maximal formula atoms : 26 ( 11 avg)
% Number of connectives : 599 ( 114 ~; 100 |; 60 &; 278 @)
% ( 2 <=>; 45 =>; 0 <=; 0 <~>)
% Maximal formula depth : 14 ( 7 avg)
% Number of types : 2 ( 1 usr)
% Number of type conns : 139 ( 139 >; 0 *; 0 +; 0 <<)
% Number of symbols : 14 ( 11 usr; 5 con; 0-2 aty)
% Number of variables : 168 ( 0 ^ 124 !; 44 ?; 168 :)
% Comments :
%------------------------------------------------------------------------------
thf(type_def_5,type,
b: $tType ).
thf(func_def_0,type,
b: $tType ).
thf(func_def_2,type,
vEPSILON:
!>[X0: $tType] : ( ( X0 > $o ) > X0 ) ).
thf(func_def_5,type,
sK0: ( b > $o ) > $o ).
thf(func_def_6,type,
sK1: ( b > $o ) > ( b > $o ) > $o ).
thf(func_def_7,type,
sK2: ( b > $o ) > ( b > $o ) > b ).
thf(func_def_8,type,
sK3: b > $o ).
thf(func_def_9,type,
sK4: b > $o ).
thf(func_def_10,type,
sK5: b ).
thf(func_def_11,type,
sK6: b > $o ).
thf(func_def_13,type,
ph8:
!>[X0: $tType] : X0 ).
thf(f50,plain,
$false,
inference(avatar_sat_refutation,[],[f35,f40,f49]) ).
thf(f49,plain,
( spl7_2
| ~ spl7_1 ),
inference(avatar_split_clause,[],[f48,f29,f33]) ).
thf(f33,plain,
( spl7_2
<=> ! [X0: b] :
( ( ( sK6 @ X0 )
= $true )
| ( ( sK3 @ X0 )
!= $true ) ) ),
introduced(avatar_definition,[new_symbols(naming,[spl7_2])]) ).
thf(f29,plain,
( spl7_1
<=> ( ( sK4 @ ( sK2 @ sK4 @ sK6 ) )
= $true ) ),
introduced(avatar_definition,[new_symbols(naming,[spl7_1])]) ).
thf(f48,plain,
( ! [X0: b] :
( ( ( sK3 @ X0 )
!= $true )
| ( ( sK6 @ X0 )
= $true ) )
| ~ spl7_1 ),
inference(trivial_inequality_removal,[],[f47]) ).
thf(f47,plain,
( ! [X0: b] :
( ( ( sK3 @ X0 )
!= $true )
| ( ( sK6 @ X0 )
= $true )
| ( $true != $true ) )
| ~ spl7_1 ),
inference(superposition,[],[f46,f19]) ).
thf(f19,plain,
( ( sK1 @ sK4 @ sK3 )
= $true ),
inference(cnf_transformation,[],[f14]) ).
thf(f14,plain,
( ! [X2: b > $o] :
( ( ( sK0 @ X2 )
!= $true )
| ! [X3: b > $o,X4: b > $o] :
( ( ( sK1 @ X4 @ X3 )
!= $true )
| ( ( $true
!= ( X2 @ ( sK2 @ X4 @ X2 ) ) )
& ( ( X4 @ ( sK2 @ X4 @ X2 ) )
= $true ) )
| ! [X6: b] :
( ( $true
= ( X2 @ X6 ) )
| ( ( X3 @ X6 )
!= $true ) ) ) )
& ( ( sK1 @ sK4 @ sK3 )
= $true )
& ! [X9: b] :
( ( ( sK4 @ X9 )
!= $true )
| ! [X10: b > $o] :
( ( ( sK0 @ X10 )
!= $true )
| ( ( X10 @ X9 )
= $true ) ) )
& ( ( sK3 @ sK5 )
= $true )
& ( ( sK0 @ sK6 )
= $true )
& ( ( sK6 @ sK5 )
!= $true ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3,sK4,sK5,sK6])],[f8,f13,f12,f11,f10,f9]) ).
thf(f9,plain,
( ? [X0: ( b > $o ) > $o,X1: ( b > $o ) > ( b > $o ) > $o] :
( ! [X2: b > $o] :
( ( ( X0 @ X2 )
!= $true )
| ! [X3: b > $o,X4: b > $o] :
( ( ( X1 @ X4 @ X3 )
!= $true )
| ? [X5: b] :
( ( ( X2 @ X5 )
!= $true )
& ( ( X4 @ X5 )
= $true ) )
| ! [X6: b] :
( ( $true
= ( X2 @ X6 ) )
| ( ( X3 @ X6 )
!= $true ) ) ) )
& ? [X7: b > $o,X8: b > $o] :
( ( ( X1 @ X8 @ X7 )
= $true )
& ! [X9: b] :
( ( ( X8 @ X9 )
!= $true )
| ! [X10: b > $o] :
( ( $true
!= ( X0 @ X10 ) )
| ( ( X10 @ X9 )
= $true ) ) )
& ? [X11: b] :
( ( ( X7 @ X11 )
= $true )
& ? [X12: b > $o] :
( ( ( X0 @ X12 )
= $true )
& ( $true
!= ( X12 @ X11 ) ) ) ) ) )
=> ( ! [X2: b > $o] :
( ( ( sK0 @ X2 )
!= $true )
| ! [X4: b > $o,X3: b > $o] :
( ( ( sK1 @ X4 @ X3 )
!= $true )
| ? [X5: b] :
( ( ( X2 @ X5 )
!= $true )
& ( ( X4 @ X5 )
= $true ) )
| ! [X6: b] :
( ( $true
= ( X2 @ X6 ) )
| ( ( X3 @ X6 )
!= $true ) ) ) )
& ? [X8: b > $o,X7: b > $o] :
( ( ( sK1 @ X8 @ X7 )
= $true )
& ! [X9: b] :
( ( ( X8 @ X9 )
!= $true )
| ! [X10: b > $o] :
( ( ( sK0 @ X10 )
!= $true )
| ( ( X10 @ X9 )
= $true ) ) )
& ? [X11: b] :
( ( ( X7 @ X11 )
= $true )
& ? [X12: b > $o] :
( ( ( sK0 @ X12 )
= $true )
& ( $true
!= ( X12 @ X11 ) ) ) ) ) ) ),
introduced(choice_axiom,[]) ).
thf(f10,plain,
! [X2: b > $o,X4: b > $o] :
( ? [X5: b] :
( ( ( X2 @ X5 )
!= $true )
& ( ( X4 @ X5 )
= $true ) )
=> ( ( $true
!= ( X2 @ ( sK2 @ X4 @ X2 ) ) )
& ( ( X4 @ ( sK2 @ X4 @ X2 ) )
= $true ) ) ),
introduced(choice_axiom,[]) ).
thf(f11,plain,
( ? [X8: b > $o,X7: b > $o] :
( ( ( sK1 @ X8 @ X7 )
= $true )
& ! [X9: b] :
( ( ( X8 @ X9 )
!= $true )
| ! [X10: b > $o] :
( ( ( sK0 @ X10 )
!= $true )
| ( ( X10 @ X9 )
= $true ) ) )
& ? [X11: b] :
( ( ( X7 @ X11 )
= $true )
& ? [X12: b > $o] :
( ( ( sK0 @ X12 )
= $true )
& ( $true
!= ( X12 @ X11 ) ) ) ) )
=> ( ( ( sK1 @ sK4 @ sK3 )
= $true )
& ! [X9: b] :
( ( ( sK4 @ X9 )
!= $true )
| ! [X10: b > $o] :
( ( ( sK0 @ X10 )
!= $true )
| ( ( X10 @ X9 )
= $true ) ) )
& ? [X11: b] :
( ( ( sK3 @ X11 )
= $true )
& ? [X12: b > $o] :
( ( ( sK0 @ X12 )
= $true )
& ( $true
!= ( X12 @ X11 ) ) ) ) ) ),
introduced(choice_axiom,[]) ).
thf(f12,plain,
( ? [X11: b] :
( ( ( sK3 @ X11 )
= $true )
& ? [X12: b > $o] :
( ( ( sK0 @ X12 )
= $true )
& ( $true
!= ( X12 @ X11 ) ) ) )
=> ( ( ( sK3 @ sK5 )
= $true )
& ? [X12: b > $o] :
( ( ( sK0 @ X12 )
= $true )
& ( ( X12 @ sK5 )
!= $true ) ) ) ),
introduced(choice_axiom,[]) ).
thf(f13,plain,
( ? [X12: b > $o] :
( ( ( sK0 @ X12 )
= $true )
& ( ( X12 @ sK5 )
!= $true ) )
=> ( ( ( sK0 @ sK6 )
= $true )
& ( ( sK6 @ sK5 )
!= $true ) ) ),
introduced(choice_axiom,[]) ).
thf(f8,plain,
? [X0: ( b > $o ) > $o,X1: ( b > $o ) > ( b > $o ) > $o] :
( ! [X2: b > $o] :
( ( ( X0 @ X2 )
!= $true )
| ! [X3: b > $o,X4: b > $o] :
( ( ( X1 @ X4 @ X3 )
!= $true )
| ? [X5: b] :
( ( ( X2 @ X5 )
!= $true )
& ( ( X4 @ X5 )
= $true ) )
| ! [X6: b] :
( ( $true
= ( X2 @ X6 ) )
| ( ( X3 @ X6 )
!= $true ) ) ) )
& ? [X7: b > $o,X8: b > $o] :
( ( ( X1 @ X8 @ X7 )
= $true )
& ! [X9: b] :
( ( ( X8 @ X9 )
!= $true )
| ! [X10: b > $o] :
( ( $true
!= ( X0 @ X10 ) )
| ( ( X10 @ X9 )
= $true ) ) )
& ? [X11: b] :
( ( ( X7 @ X11 )
= $true )
& ? [X12: b > $o] :
( ( ( X0 @ X12 )
= $true )
& ( $true
!= ( X12 @ X11 ) ) ) ) ) ),
inference(rectify,[],[f7]) ).
thf(f7,plain,
? [X1: ( b > $o ) > $o,X0: ( b > $o ) > ( b > $o ) > $o] :
( ! [X2: b > $o] :
( ( ( X1 @ X2 )
!= $true )
| ! [X3: b > $o,X4: b > $o] :
( ( ( X0 @ X4 @ X3 )
!= $true )
| ? [X5: b] :
( ( ( X2 @ X5 )
!= $true )
& ( ( X4 @ X5 )
= $true ) )
| ! [X6: b] :
( ( $true
= ( X2 @ X6 ) )
| ( ( X3 @ X6 )
!= $true ) ) ) )
& ? [X8: b > $o,X7: b > $o] :
( ( ( X0 @ X7 @ X8 )
= $true )
& ! [X9: b] :
( ( ( X7 @ X9 )
!= $true )
| ! [X10: b > $o] :
( ( ( X1 @ X10 )
!= $true )
| ( ( X10 @ X9 )
= $true ) ) )
& ? [X11: b] :
( ( ( X8 @ X11 )
= $true )
& ? [X12: b > $o] :
( ( ( X1 @ X12 )
= $true )
& ( $true
!= ( X12 @ X11 ) ) ) ) ) ),
inference(flattening,[],[f6]) ).
thf(f6,plain,
? [X1: ( b > $o ) > $o,X0: ( b > $o ) > ( b > $o ) > $o] :
( ? [X7: b > $o,X8: b > $o] :
( ? [X11: b] :
( ( ( X8 @ X11 )
= $true )
& ? [X12: b > $o] :
( ( ( X1 @ X12 )
= $true )
& ( $true
!= ( X12 @ X11 ) ) ) )
& ! [X9: b] :
( ( ( X7 @ X9 )
!= $true )
| ! [X10: b > $o] :
( ( ( X1 @ X10 )
!= $true )
| ( ( X10 @ X9 )
= $true ) ) )
& ( ( X0 @ X7 @ X8 )
= $true ) )
& ! [X2: b > $o] :
( ! [X3: b > $o,X4: b > $o] :
( ! [X6: b] :
( ( $true
= ( X2 @ X6 ) )
| ( ( X3 @ X6 )
!= $true ) )
| ? [X5: b] :
( ( ( X2 @ X5 )
!= $true )
& ( ( X4 @ X5 )
= $true ) )
| ( ( X0 @ X4 @ X3 )
!= $true ) )
| ( ( X1 @ X2 )
!= $true ) ) ),
inference(ennf_transformation,[],[f5]) ).
thf(f5,plain,
~ ! [X1: ( b > $o ) > $o,X0: ( b > $o ) > ( b > $o ) > $o] :
( ! [X2: b > $o] :
( ( ( X1 @ X2 )
= $true )
=> ! [X3: b > $o,X4: b > $o] :
( ( ! [X5: b] :
( ( ( X4 @ X5 )
= $true )
=> ( ( X2 @ X5 )
= $true ) )
& ( ( X0 @ X4 @ X3 )
= $true ) )
=> ! [X6: b] :
( ( ( X3 @ X6 )
= $true )
=> ( $true
= ( X2 @ X6 ) ) ) ) )
=> ! [X7: b > $o,X8: b > $o] :
( ( ! [X9: b] :
( ( ( X7 @ X9 )
= $true )
=> ! [X10: b > $o] :
( ( ( X1 @ X10 )
= $true )
=> ( ( X10 @ X9 )
= $true ) ) )
& ( ( X0 @ X7 @ X8 )
= $true ) )
=> ! [X11: b] :
( ( ( X8 @ X11 )
= $true )
=> ! [X12: b > $o] :
( ( ( X1 @ X12 )
= $true )
=> ( $true
= ( X12 @ X11 ) ) ) ) ) ),
inference(fool_elimination,[],[f4]) ).
thf(f4,plain,
~ ! [X0: ( b > $o ) > ( b > $o ) > $o,X1: ( b > $o ) > $o] :
( ! [X2: b > $o] :
( ( X1 @ X2 )
=> ! [X3: b > $o,X4: b > $o] :
( ( ( X0 @ X4 @ X3 )
& ! [X5: b] :
( ( X4 @ X5 )
=> ( X2 @ X5 ) ) )
=> ! [X6: b] :
( ( X3 @ X6 )
=> ( X2 @ X6 ) ) ) )
=> ! [X7: b > $o,X8: b > $o] :
( ( ( X0 @ X7 @ X8 )
& ! [X9: b] :
( ( X7 @ X9 )
=> ! [X10: b > $o] :
( ( X1 @ X10 )
=> ( X10 @ X9 ) ) ) )
=> ! [X11: b] :
( ( X8 @ X11 )
=> ! [X12: b > $o] :
( ( X1 @ X12 )
=> ( X12 @ X11 ) ) ) ) ),
inference(rectify,[],[f2]) ).
thf(f2,negated_conjecture,
~ ! [X0: ( b > $o ) > ( b > $o ) > $o,X1: ( b > $o ) > $o] :
( ! [X2: b > $o] :
( ( X1 @ X2 )
=> ! [X4: b > $o,X3: b > $o] :
( ( ( X0 @ X3 @ X4 )
& ! [X5: b] :
( ( X3 @ X5 )
=> ( X2 @ X5 ) ) )
=> ! [X5: b] :
( ( X4 @ X5 )
=> ( X2 @ X5 ) ) ) )
=> ! [X3: b > $o,X4: b > $o] :
( ( ( X0 @ X3 @ X4 )
& ! [X2: b] :
( ( X3 @ X2 )
=> ! [X6: b > $o] :
( ( X1 @ X6 )
=> ( X6 @ X2 ) ) ) )
=> ! [X2: b] :
( ( X4 @ X2 )
=> ! [X6: b > $o] :
( ( X1 @ X6 )
=> ( X6 @ X2 ) ) ) ) ),
inference(negated_conjecture,[],[f1]) ).
thf(f1,conjecture,
! [X0: ( b > $o ) > ( b > $o ) > $o,X1: ( b > $o ) > $o] :
( ! [X2: b > $o] :
( ( X1 @ X2 )
=> ! [X4: b > $o,X3: b > $o] :
( ( ( X0 @ X3 @ X4 )
& ! [X5: b] :
( ( X3 @ X5 )
=> ( X2 @ X5 ) ) )
=> ! [X5: b] :
( ( X4 @ X5 )
=> ( X2 @ X5 ) ) ) )
=> ! [X3: b > $o,X4: b > $o] :
( ( ( X0 @ X3 @ X4 )
& ! [X2: b] :
( ( X3 @ X2 )
=> ! [X6: b > $o] :
( ( X1 @ X6 )
=> ( X6 @ X2 ) ) ) )
=> ! [X2: b] :
( ( X4 @ X2 )
=> ! [X6: b > $o] :
( ( X1 @ X6 )
=> ( X6 @ X2 ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cTHM565_pme) ).
thf(f46,plain,
( ! [X0: b > $o,X1: b] :
( ( ( sK1 @ sK4 @ X0 )
!= $true )
| ( ( sK6 @ X1 )
= $true )
| ( ( X0 @ X1 )
!= $true ) )
| ~ spl7_1 ),
inference(trivial_inequality_removal,[],[f45]) ).
thf(f45,plain,
( ! [X0: b > $o,X1: b] :
( ( ( sK6 @ X1 )
= $true )
| ( ( sK1 @ sK4 @ X0 )
!= $true )
| ( ( X0 @ X1 )
!= $true )
| ( $true != $true ) )
| ~ spl7_1 ),
inference(forward_demodulation,[],[f44,f16]) ).
thf(f16,plain,
( ( sK0 @ sK6 )
= $true ),
inference(cnf_transformation,[],[f14]) ).
thf(f44,plain,
( ! [X0: b > $o,X1: b] :
( ( ( sK1 @ sK4 @ X0 )
!= $true )
| ( ( X0 @ X1 )
!= $true )
| ( ( sK6 @ X1 )
= $true )
| ( ( sK0 @ sK6 )
!= $true ) )
| ~ spl7_1 ),
inference(trivial_inequality_removal,[],[f43]) ).
thf(f43,plain,
( ! [X0: b > $o,X1: b] :
( ( ( sK0 @ sK6 )
!= $true )
| ( ( sK6 @ X1 )
= $true )
| ( ( X0 @ X1 )
!= $true )
| ( ( sK1 @ sK4 @ X0 )
!= $true )
| ( $true != $true ) )
| ~ spl7_1 ),
inference(superposition,[],[f21,f42]) ).
thf(f42,plain,
( ( ( sK6 @ ( sK2 @ sK4 @ sK6 ) )
= $true )
| ~ spl7_1 ),
inference(trivial_inequality_removal,[],[f41]) ).
thf(f41,plain,
( ( $true != $true )
| ( ( sK6 @ ( sK2 @ sK4 @ sK6 ) )
= $true )
| ~ spl7_1 ),
inference(superposition,[],[f23,f31]) ).
thf(f31,plain,
( ( ( sK4 @ ( sK2 @ sK4 @ sK6 ) )
= $true )
| ~ spl7_1 ),
inference(avatar_component_clause,[],[f29]) ).
thf(f23,plain,
! [X0: b] :
( ( $true
!= ( sK4 @ X0 ) )
| ( ( sK6 @ X0 )
= $true ) ),
inference(trivial_inequality_removal,[],[f22]) ).
thf(f22,plain,
! [X0: b] :
( ( ( sK6 @ X0 )
= $true )
| ( $true
!= ( sK4 @ X0 ) )
| ( $true != $true ) ),
inference(superposition,[],[f18,f16]) ).
thf(f18,plain,
! [X10: b > $o,X9: b] :
( ( ( sK0 @ X10 )
!= $true )
| ( ( X10 @ X9 )
= $true )
| ( ( sK4 @ X9 )
!= $true ) ),
inference(cnf_transformation,[],[f14]) ).
thf(f21,plain,
! [X2: b > $o,X3: b > $o,X6: b,X4: b > $o] :
( ( $true
!= ( X2 @ ( sK2 @ X4 @ X2 ) ) )
| ( ( X3 @ X6 )
!= $true )
| ( ( sK1 @ X4 @ X3 )
!= $true )
| ( $true
= ( X2 @ X6 ) )
| ( ( sK0 @ X2 )
!= $true ) ),
inference(cnf_transformation,[],[f14]) ).
thf(f40,plain,
~ spl7_2,
inference(avatar_contradiction_clause,[],[f39]) ).
thf(f39,plain,
( $false
| ~ spl7_2 ),
inference(trivial_inequality_removal,[],[f38]) ).
thf(f38,plain,
( ( $true != $true )
| ~ spl7_2 ),
inference(superposition,[],[f15,f37]) ).
thf(f37,plain,
( ( ( sK6 @ sK5 )
= $true )
| ~ spl7_2 ),
inference(trivial_inequality_removal,[],[f36]) ).
thf(f36,plain,
( ( ( sK6 @ sK5 )
= $true )
| ( $true != $true )
| ~ spl7_2 ),
inference(superposition,[],[f34,f17]) ).
thf(f17,plain,
( ( sK3 @ sK5 )
= $true ),
inference(cnf_transformation,[],[f14]) ).
thf(f34,plain,
( ! [X0: b] :
( ( ( sK3 @ X0 )
!= $true )
| ( ( sK6 @ X0 )
= $true ) )
| ~ spl7_2 ),
inference(avatar_component_clause,[],[f33]) ).
thf(f15,plain,
( ( sK6 @ sK5 )
!= $true ),
inference(cnf_transformation,[],[f14]) ).
thf(f35,plain,
( spl7_1
| spl7_2 ),
inference(avatar_split_clause,[],[f27,f33,f29]) ).
thf(f27,plain,
! [X0: b] :
( ( ( sK6 @ X0 )
= $true )
| ( ( sK4 @ ( sK2 @ sK4 @ sK6 ) )
= $true )
| ( ( sK3 @ X0 )
!= $true ) ),
inference(trivial_inequality_removal,[],[f26]) ).
thf(f26,plain,
! [X0: b] :
( ( ( sK3 @ X0 )
!= $true )
| ( ( sK4 @ ( sK2 @ sK4 @ sK6 ) )
= $true )
| ( $true != $true )
| ( ( sK6 @ X0 )
= $true ) ),
inference(superposition,[],[f25,f16]) ).
thf(f25,plain,
! [X0: b,X1: b > $o] :
( ( ( sK0 @ X1 )
!= $true )
| ( ( sK4 @ ( sK2 @ sK4 @ X1 ) )
= $true )
| ( ( X1 @ X0 )
= $true )
| ( ( sK3 @ X0 )
!= $true ) ),
inference(trivial_inequality_removal,[],[f24]) ).
thf(f24,plain,
! [X0: b,X1: b > $o] :
( ( ( sK3 @ X0 )
!= $true )
| ( ( sK0 @ X1 )
!= $true )
| ( $true != $true )
| ( ( sK4 @ ( sK2 @ sK4 @ X1 ) )
= $true )
| ( ( X1 @ X0 )
= $true ) ),
inference(superposition,[],[f20,f19]) ).
thf(f20,plain,
! [X2: b > $o,X3: b > $o,X6: b,X4: b > $o] :
( ( ( sK1 @ X4 @ X3 )
!= $true )
| ( ( X3 @ X6 )
!= $true )
| ( $true
= ( X2 @ X6 ) )
| ( ( sK0 @ X2 )
!= $true )
| ( ( X4 @ ( sK2 @ X4 @ X2 ) )
= $true ) ),
inference(cnf_transformation,[],[f14]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SEV186^5 : TPTP v8.2.0. Released v4.0.0.
% 0.03/0.12 % Command : run_vampire %s %d THM
% 0.12/0.33 % Computer : n022.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 300
% 0.12/0.33 % DateTime : Fri Jun 21 19:04:09 EDT 2024
% 0.12/0.33 % CPUTime :
% 0.12/0.35 This is a TH0_THM_NEQ_NAR problem
% 0.12/0.35 Running higher-order theorem proving
% 0.12/0.35 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.21/0.37 % (1994)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.21/0.37 % (1995)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.21/0.37 % (1998)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.21/0.37 % (1997)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.21/0.37 % (1996)lrs+10_1:1_au=on:inj=on:i=2:si=on:rtra=on_0 on theBenchmark for (2999ds/2Mi)
% 0.21/0.37 % (1999)lrs+1004_1:128_cond=on:e2e=on:sp=weighted_frequency:i=18:si=on:rtra=on_0 on theBenchmark for (2999ds/18Mi)
% 0.21/0.37 % (1993)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.21/0.37 % (1997)Instruction limit reached!
% 0.21/0.37 % (1997)------------------------------
% 0.21/0.37 % (1997)Version: Vampire 4.8 (commit 11aac991b on 2023-10-04 16:26:07 +0200)
% 0.21/0.37 % (1997)Termination reason: Unknown
% 0.21/0.37 % (1997)Termination phase: Property scanning
% 0.21/0.37
% 0.21/0.37 % (1997)Memory used [KB]: 895
% 0.21/0.37 % (1997)Time elapsed: 0.003 s
% 0.21/0.37 % (1997)Instructions burned: 2 (million)
% 0.21/0.37 % (1997)------------------------------
% 0.21/0.37 % (1997)------------------------------
% 0.21/0.38 % (1996)Instruction limit reached!
% 0.21/0.38 % (1996)------------------------------
% 0.21/0.38 % (1996)Version: Vampire 4.8 (commit 11aac991b on 2023-10-04 16:26:07 +0200)
% 0.21/0.38 % (1996)Termination reason: Unknown
% 0.21/0.38 % (1996)Termination phase: Saturation
% 0.21/0.38
% 0.21/0.38 % (1996)Memory used [KB]: 5500
% 0.21/0.38 % (1996)Time elapsed: 0.004 s
% 0.21/0.38 % (1996)Instructions burned: 2 (million)
% 0.21/0.38 % (1996)------------------------------
% 0.21/0.38 % (1996)------------------------------
% 0.21/0.38 % (1994)Instruction limit reached!
% 0.21/0.38 % (1994)------------------------------
% 0.21/0.38 % (1994)Version: Vampire 4.8 (commit 11aac991b on 2023-10-04 16:26:07 +0200)
% 0.21/0.38 % (1994)Termination reason: Unknown
% 0.21/0.38 % (1994)Termination phase: Saturation
% 0.21/0.38
% 0.21/0.38 % (1994)Memory used [KB]: 5500
% 0.21/0.38 % (1994)Time elapsed: 0.006 s
% 0.21/0.38 % (1994)Instructions burned: 4 (million)
% 0.21/0.38 % (1994)------------------------------
% 0.21/0.38 % (1994)------------------------------
% 0.21/0.38 % (1995)First to succeed.
% 0.21/0.38 % (1999)Also succeeded, but the first one will report.
% 0.21/0.38 % (1995)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 % (1995)------------------------------
% 0.21/0.38 % (1995)Version: Vampire 4.8 (commit 11aac991b on 2023-10-04 16:26:07 +0200)
% 0.21/0.38 % (1995)Termination reason: Refutation
% 0.21/0.38
% 0.21/0.38 % (1995)Memory used [KB]: 5628
% 0.21/0.38 % (1995)Time elapsed: 0.009 s
% 0.21/0.38 % (1995)Instructions burned: 5 (million)
% 0.21/0.38 % (1995)------------------------------
% 0.21/0.38 % (1995)------------------------------
% 0.21/0.38 % (1992)Success in time 0.01 s
%------------------------------------------------------------------------------