TSTP Solution File: SEV019^5 by Vampire---4.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.9
% Problem : SEV019^5 : TPTP v8.2.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire %s %d THM
% Computer : n032.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:27 EDT 2024
% Result : Theorem 0.13s 0.31s
% Output : Refutation 0.13s
% Verified :
% SZS Type : Refutation
% Derivation depth : 24
% Number of leaves : 12
% Syntax : Number of formulae : 70 ( 3 unt; 0 typ; 0 def)
% Number of atoms : 563 ( 162 equ; 0 cnn)
% Maximal formula atoms : 10 ( 8 avg)
% Number of connectives : 665 ( 110 ~; 117 |; 54 &; 354 @)
% ( 9 <=>; 21 =>; 0 <=; 0 <~>)
% Maximal formula depth : 12 ( 5 avg)
% Number of types : 2 ( 1 usr)
% Number of type conns : 8 ( 8 >; 0 *; 0 +; 0 <<)
% Number of symbols : 18 ( 15 usr; 14 con; 0-2 aty)
% Number of variables : 128 ( 0 ^ 86 !; 42 ?; 128 :)
% Comments :
%------------------------------------------------------------------------------
thf(type_def_5,type,
a: $tType ).
thf(func_def_0,type,
a: $tType ).
thf(func_def_1,type,
cQ: a > a > $o ).
thf(func_def_5,type,
sK0: a > a > $o ).
thf(func_def_6,type,
sK1: a > a ).
thf(func_def_7,type,
sK2: a ).
thf(func_def_8,type,
sK3: a ).
thf(func_def_9,type,
sK4: a ).
thf(func_def_10,type,
sK5: a ).
thf(func_def_11,type,
sK6: a ).
thf(func_def_12,type,
sK7: a ).
thf(f275,plain,
$false,
inference(avatar_sat_refutation,[],[f38,f43,f48,f53,f54,f55,f67,f88,f274]) ).
thf(f274,plain,
( ~ spl8_2
| ~ spl8_4
| spl8_6 ),
inference(avatar_contradiction_clause,[],[f273]) ).
thf(f273,plain,
( $false
| ~ spl8_2
| ~ spl8_4
| spl8_6 ),
inference(subsumption_resolution,[],[f268,f21]) ).
thf(f21,plain,
! [X0: a] :
( ( sK0 @ X0 @ X0 )
= $true ),
inference(cnf_transformation,[],[f14]) ).
thf(f14,plain,
( ! [X0: a] :
( ! [X2: a] :
( ( $true
!= ( sK0 @ X0 @ X2 ) )
| ! [X3: a] :
( ( cQ @ X2 @ X3 )
= ( sK0 @ X0 @ X3 ) ) )
& ( ( sK0 @ X0 @ ( sK1 @ X0 ) )
= $true )
& ( ( sK0 @ X0 @ X0 )
= $true ) )
& ( ( ( $true
= ( cQ @ sK3 @ sK2 ) )
& ( ( cQ @ sK2 @ sK3 )
!= $true ) )
| ( $true
!= ( cQ @ sK4 @ sK4 ) )
| ( ( ( cQ @ sK5 @ sK6 )
= $true )
& ( ( cQ @ sK7 @ sK5 )
= $true )
& ( ( cQ @ sK7 @ sK6 )
!= $true ) ) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3,sK4,sK5,sK6,sK7])],[f8,f13,f12,f11,f10,f9]) ).
thf(f9,plain,
! [X0: a] :
( ? [X1: a > $o] :
( ! [X2: a] :
( ( ( X1 @ X2 )
!= $true )
| ! [X3: a] :
( ( X1 @ X3 )
= ( cQ @ X2 @ X3 ) ) )
& ? [X4: a] :
( ( X1 @ X4 )
= $true )
& ( ( X1 @ X0 )
= $true ) )
=> ( ! [X2: a] :
( ( $true
!= ( sK0 @ X0 @ X2 ) )
| ! [X3: a] :
( ( cQ @ X2 @ X3 )
= ( sK0 @ X0 @ X3 ) ) )
& ? [X4: a] :
( ( sK0 @ X0 @ X4 )
= $true )
& ( ( sK0 @ X0 @ X0 )
= $true ) ) ),
introduced(choice_axiom,[]) ).
thf(f10,plain,
! [X0: a] :
( ? [X4: a] :
( ( sK0 @ X0 @ X4 )
= $true )
=> ( ( sK0 @ X0 @ ( sK1 @ X0 ) )
= $true ) ),
introduced(choice_axiom,[]) ).
thf(f11,plain,
( ? [X5: a,X6: a] :
( ( ( cQ @ X6 @ X5 )
= $true )
& ( $true
!= ( cQ @ X5 @ X6 ) ) )
=> ( ( $true
= ( cQ @ sK3 @ sK2 ) )
& ( ( cQ @ sK2 @ sK3 )
!= $true ) ) ),
introduced(choice_axiom,[]) ).
thf(f12,plain,
( ? [X7: a] :
( ( cQ @ X7 @ X7 )
!= $true )
=> ( $true
!= ( cQ @ sK4 @ sK4 ) ) ),
introduced(choice_axiom,[]) ).
thf(f13,plain,
( ? [X8: a,X9: a,X10: a] :
( ( $true
= ( cQ @ X8 @ X9 ) )
& ( $true
= ( cQ @ X10 @ X8 ) )
& ( ( cQ @ X10 @ X9 )
!= $true ) )
=> ( ( ( cQ @ sK5 @ sK6 )
= $true )
& ( ( cQ @ sK7 @ sK5 )
= $true )
& ( ( cQ @ sK7 @ sK6 )
!= $true ) ) ),
introduced(choice_axiom,[]) ).
thf(f8,plain,
( ! [X0: a] :
? [X1: a > $o] :
( ! [X2: a] :
( ( ( X1 @ X2 )
!= $true )
| ! [X3: a] :
( ( X1 @ X3 )
= ( cQ @ X2 @ X3 ) ) )
& ? [X4: a] :
( ( X1 @ X4 )
= $true )
& ( ( X1 @ X0 )
= $true ) )
& ( ? [X5: a,X6: a] :
( ( ( cQ @ X6 @ X5 )
= $true )
& ( $true
!= ( cQ @ X5 @ X6 ) ) )
| ? [X7: a] :
( ( cQ @ X7 @ X7 )
!= $true )
| ? [X8: a,X9: a,X10: a] :
( ( $true
= ( cQ @ X8 @ X9 ) )
& ( $true
= ( cQ @ X10 @ X8 ) )
& ( ( cQ @ X10 @ X9 )
!= $true ) ) ) ),
inference(rectify,[],[f7]) ).
thf(f7,plain,
( ! [X0: a] :
? [X1: a > $o] :
( ! [X2: a] :
( ( ( X1 @ X2 )
!= $true )
| ! [X3: a] :
( ( X1 @ X3 )
= ( cQ @ X2 @ X3 ) ) )
& ? [X4: a] :
( ( X1 @ X4 )
= $true )
& ( ( X1 @ X0 )
= $true ) )
& ( ? [X5: a,X6: a] :
( ( ( cQ @ X6 @ X5 )
= $true )
& ( $true
!= ( cQ @ X5 @ X6 ) ) )
| ? [X7: a] :
( ( cQ @ X7 @ X7 )
!= $true )
| ? [X10: a,X8: a,X9: a] :
( ( $true
= ( cQ @ X10 @ X8 ) )
& ( ( cQ @ X9 @ X10 )
= $true )
& ( $true
!= ( cQ @ X9 @ X8 ) ) ) ) ),
inference(flattening,[],[f6]) ).
thf(f6,plain,
( ( ? [X7: a] :
( ( cQ @ X7 @ X7 )
!= $true )
| ? [X5: a,X6: a] :
( ( ( cQ @ X6 @ X5 )
= $true )
& ( $true
!= ( cQ @ X5 @ X6 ) ) )
| ? [X8: a,X9: a,X10: a] :
( ( $true
!= ( cQ @ X9 @ X8 ) )
& ( ( cQ @ X9 @ X10 )
= $true )
& ( $true
= ( cQ @ X10 @ X8 ) ) ) )
& ! [X0: a] :
? [X1: a > $o] :
( ! [X2: a] :
( ( ( X1 @ X2 )
!= $true )
| ! [X3: a] :
( ( X1 @ X3 )
= ( cQ @ X2 @ X3 ) ) )
& ? [X4: a] :
( ( X1 @ X4 )
= $true )
& ( ( X1 @ X0 )
= $true ) ) ),
inference(ennf_transformation,[],[f5]) ).
thf(f5,plain,
~ ( ! [X0: a] :
? [X1: a > $o] :
( ? [X4: a] :
( ( X1 @ X4 )
= $true )
& ! [X2: a] :
( ( ( X1 @ X2 )
= $true )
=> ! [X3: a] :
( ( X1 @ X3 )
= ( cQ @ X2 @ X3 ) ) )
& ( ( X1 @ X0 )
= $true ) )
=> ( ! [X7: a] :
( ( cQ @ X7 @ X7 )
= $true )
& ! [X5: a,X6: a] :
( ( ( cQ @ X6 @ X5 )
= $true )
=> ( $true
= ( cQ @ X5 @ X6 ) ) )
& ! [X8: a,X9: a,X10: a] :
( ( ( ( cQ @ X9 @ X10 )
= $true )
& ( $true
= ( cQ @ X10 @ X8 ) ) )
=> ( $true
= ( cQ @ X9 @ X8 ) ) ) ) ),
inference(fool_elimination,[],[f4]) ).
thf(f4,plain,
~ ( ! [X0: a] :
? [X1: a > $o] :
( ! [X2: a] :
( ( X1 @ X2 )
=> ! [X3: a] :
( ( X1 @ X3 )
<=> ( cQ @ X2 @ X3 ) ) )
& ( X1 @ X0 )
& ? [X4: a] : ( X1 @ X4 ) )
=> ( ! [X5: a,X6: a] :
( ( cQ @ X6 @ X5 )
=> ( cQ @ X5 @ X6 ) )
& ! [X7: a] : ( cQ @ X7 @ X7 )
& ! [X8: a,X9: a,X10: a] :
( ( ( cQ @ X10 @ X8 )
& ( cQ @ X9 @ X10 ) )
=> ( cQ @ X9 @ X8 ) ) ) ),
inference(rectify,[],[f2]) ).
thf(f2,negated_conjecture,
~ ( ! [X0: a] :
? [X1: a > $o] :
( ! [X3: a] :
( ( X1 @ X3 )
=> ! [X4: a] :
( ( X1 @ X4 )
<=> ( cQ @ X3 @ X4 ) ) )
& ( X1 @ X0 )
& ? [X2: a] : ( X1 @ X2 ) )
=> ( ! [X4: a,X0: a] :
( ( cQ @ X0 @ X4 )
=> ( cQ @ X4 @ X0 ) )
& ! [X0: a] : ( cQ @ X0 @ X0 )
& ! [X2: a,X0: a,X4: a] :
( ( ( cQ @ X4 @ X2 )
& ( cQ @ X0 @ X4 ) )
=> ( cQ @ X0 @ X2 ) ) ) ),
inference(negated_conjecture,[],[f1]) ).
thf(f1,conjecture,
( ! [X0: a] :
? [X1: a > $o] :
( ! [X3: a] :
( ( X1 @ X3 )
=> ! [X4: a] :
( ( X1 @ X4 )
<=> ( cQ @ X3 @ X4 ) ) )
& ( X1 @ X0 )
& ? [X2: a] : ( X1 @ X2 ) )
=> ( ! [X4: a,X0: a] :
( ( cQ @ X0 @ X4 )
=> ( cQ @ X4 @ X0 ) )
& ! [X0: a] : ( cQ @ X0 @ X0 )
& ! [X2: a,X0: a,X4: a] :
( ( ( cQ @ X4 @ X2 )
& ( cQ @ X0 @ X4 ) )
=> ( cQ @ X0 @ X2 ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cTHM559_pme) ).
thf(f268,plain,
( ( ( sK0 @ sK7 @ sK7 )
!= $true )
| ~ spl8_2
| ~ spl8_4
| spl8_6 ),
inference(trivial_inequality_removal,[],[f264]) ).
thf(f264,plain,
( ( $true = $false )
| ( ( sK0 @ sK7 @ sK7 )
!= $true )
| ~ spl8_2
| ~ spl8_4
| spl8_6 ),
inference(superposition,[],[f33,f258]) ).
thf(f258,plain,
( ! [X0: a] :
( ( $false
= ( cQ @ X0 @ sK5 ) )
| ( $true
!= ( sK0 @ sK7 @ X0 ) ) )
| ~ spl8_4
| spl8_6 ),
inference(trivial_inequality_removal,[],[f256]) ).
thf(f256,plain,
( ! [X0: a] :
( ( $true
!= ( sK0 @ sK7 @ X0 ) )
| ( $false
= ( cQ @ X0 @ sK5 ) )
| ( $true != $true ) )
| ~ spl8_4
| spl8_6 ),
inference(superposition,[],[f254,f25]) ).
thf(f25,plain,
! [X2: a,X3: a,X0: a] :
( ( $true
= ( sK0 @ X0 @ X3 ) )
| ( ( cQ @ X2 @ X3 )
= $false )
| ( $true
!= ( sK0 @ X0 @ X2 ) ) ),
inference(binary_proxy_clausification,[],[f23]) ).
thf(f23,plain,
! [X2: a,X3: a,X0: a] :
( ( ( cQ @ X2 @ X3 )
= ( sK0 @ X0 @ X3 ) )
| ( $true
!= ( sK0 @ X0 @ X2 ) ) ),
inference(cnf_transformation,[],[f14]) ).
thf(f254,plain,
( ( $true
!= ( sK0 @ sK7 @ sK5 ) )
| ~ spl8_4
| spl8_6 ),
inference(trivial_inequality_removal,[],[f251]) ).
thf(f251,plain,
( ( $true != $true )
| ( $true
!= ( sK0 @ sK7 @ sK5 ) )
| ~ spl8_4
| spl8_6 ),
inference(superposition,[],[f246,f21]) ).
thf(f246,plain,
( ! [X0: a] :
( ( $true
!= ( sK0 @ X0 @ sK7 ) )
| ( ( sK0 @ X0 @ sK5 )
!= $true ) )
| ~ spl8_4
| spl8_6 ),
inference(trivial_inequality_removal,[],[f239]) ).
thf(f239,plain,
( ! [X0: a] :
( ( $true
!= ( sK0 @ X0 @ sK7 ) )
| ( ( sK0 @ X0 @ sK5 )
!= $true )
| ( $true = $false ) )
| ~ spl8_4
| spl8_6 ),
inference(superposition,[],[f42,f167]) ).
thf(f167,plain,
( ! [X0: a,X1: a] :
( ( ( cQ @ X1 @ sK6 )
= $false )
| ( ( sK0 @ X0 @ X1 )
!= $true )
| ( $true
!= ( sK0 @ X0 @ sK7 ) ) )
| spl8_6 ),
inference(trivial_inequality_removal,[],[f164]) ).
thf(f164,plain,
( ! [X0: a,X1: a] :
( ( $true
!= ( sK0 @ X0 @ sK7 ) )
| ( ( cQ @ X1 @ sK6 )
= $false )
| ( $true != $true )
| ( ( sK0 @ X0 @ X1 )
!= $true ) )
| spl8_6 ),
inference(superposition,[],[f52,f75]) ).
thf(f75,plain,
! [X2: a,X3: a,X0: a,X1: a] :
( ( $true
= ( cQ @ X2 @ X1 ) )
| ( $true
!= ( sK0 @ X0 @ X2 ) )
| ( ( cQ @ X3 @ X1 )
= $false )
| ( $true
!= ( sK0 @ X0 @ X3 ) ) ),
inference(trivial_inequality_removal,[],[f72]) ).
thf(f72,plain,
! [X2: a,X3: a,X0: a,X1: a] :
( ( $true
!= ( sK0 @ X0 @ X2 ) )
| ( $true = $false )
| ( ( cQ @ X3 @ X1 )
= $false )
| ( $true
= ( cQ @ X2 @ X1 ) )
| ( $true
!= ( sK0 @ X0 @ X3 ) ) ),
inference(superposition,[],[f24,f25]) ).
thf(f24,plain,
! [X2: a,X3: a,X0: a] :
( ( ( sK0 @ X0 @ X3 )
= $false )
| ( $true
!= ( sK0 @ X0 @ X2 ) )
| ( ( cQ @ X2 @ X3 )
= $true ) ),
inference(binary_proxy_clausification,[],[f23]) ).
thf(f52,plain,
( ( ( cQ @ sK7 @ sK6 )
!= $true )
| spl8_6 ),
inference(avatar_component_clause,[],[f50]) ).
thf(f50,plain,
( spl8_6
<=> ( ( cQ @ sK7 @ sK6 )
= $true ) ),
introduced(avatar_definition,[new_symbols(naming,[spl8_6])]) ).
thf(f42,plain,
( ( ( cQ @ sK5 @ sK6 )
= $true )
| ~ spl8_4 ),
inference(avatar_component_clause,[],[f40]) ).
thf(f40,plain,
( spl8_4
<=> ( ( cQ @ sK5 @ sK6 )
= $true ) ),
introduced(avatar_definition,[new_symbols(naming,[spl8_4])]) ).
thf(f33,plain,
( ( ( cQ @ sK7 @ sK5 )
= $true )
| ~ spl8_2 ),
inference(avatar_component_clause,[],[f31]) ).
thf(f31,plain,
( spl8_2
<=> ( ( cQ @ sK7 @ sK5 )
= $true ) ),
introduced(avatar_definition,[new_symbols(naming,[spl8_2])]) ).
thf(f88,plain,
( ~ spl8_1
| spl8_5 ),
inference(avatar_contradiction_clause,[],[f87]) ).
thf(f87,plain,
( $false
| ~ spl8_1
| spl8_5 ),
inference(subsumption_resolution,[],[f81,f21]) ).
thf(f81,plain,
( ( ( sK0 @ sK3 @ sK3 )
!= $true )
| ~ spl8_1
| spl8_5 ),
inference(trivial_inequality_removal,[],[f80]) ).
thf(f80,plain,
( ( ( sK0 @ sK3 @ sK3 )
!= $true )
| ( $true = $false )
| ~ spl8_1
| spl8_5 ),
inference(superposition,[],[f29,f76]) ).
thf(f76,plain,
( ! [X0: a] :
( ( ( cQ @ X0 @ sK2 )
= $false )
| ( $true
!= ( sK0 @ sK3 @ X0 ) ) )
| spl8_5 ),
inference(trivial_inequality_removal,[],[f73]) ).
thf(f73,plain,
( ! [X0: a] :
( ( $true
!= ( sK0 @ sK3 @ X0 ) )
| ( $true != $true )
| ( ( cQ @ X0 @ sK2 )
= $false ) )
| spl8_5 ),
inference(superposition,[],[f69,f25]) ).
thf(f69,plain,
( ( $true
!= ( sK0 @ sK3 @ sK2 ) )
| spl8_5 ),
inference(trivial_inequality_removal,[],[f68]) ).
thf(f68,plain,
( ( $true
!= ( sK0 @ sK3 @ sK2 ) )
| ( $true != $true )
| spl8_5 ),
inference(superposition,[],[f47,f61]) ).
thf(f61,plain,
! [X0: a,X1: a] :
( ( ( cQ @ X1 @ X0 )
= $true )
| ( ( sK0 @ X0 @ X1 )
!= $true ) ),
inference(trivial_inequality_removal,[],[f56]) ).
thf(f56,plain,
! [X0: a,X1: a] :
( ( $true = $false )
| ( ( cQ @ X1 @ X0 )
= $true )
| ( ( sK0 @ X0 @ X1 )
!= $true ) ),
inference(superposition,[],[f24,f21]) ).
thf(f47,plain,
( ( ( cQ @ sK2 @ sK3 )
!= $true )
| spl8_5 ),
inference(avatar_component_clause,[],[f45]) ).
thf(f45,plain,
( spl8_5
<=> ( ( cQ @ sK2 @ sK3 )
= $true ) ),
introduced(avatar_definition,[new_symbols(naming,[spl8_5])]) ).
thf(f29,plain,
( ( $true
= ( cQ @ sK3 @ sK2 ) )
| ~ spl8_1 ),
inference(avatar_component_clause,[],[f27]) ).
thf(f27,plain,
( spl8_1
<=> ( $true
= ( cQ @ sK3 @ sK2 ) ) ),
introduced(avatar_definition,[new_symbols(naming,[spl8_1])]) ).
thf(f67,plain,
spl8_3,
inference(avatar_contradiction_clause,[],[f66]) ).
thf(f66,plain,
( $false
| spl8_3 ),
inference(subsumption_resolution,[],[f65,f21]) ).
thf(f65,plain,
( ( ( sK0 @ sK4 @ sK4 )
!= $true )
| spl8_3 ),
inference(trivial_inequality_removal,[],[f64]) ).
thf(f64,plain,
( ( $true != $true )
| ( ( sK0 @ sK4 @ sK4 )
!= $true )
| spl8_3 ),
inference(superposition,[],[f37,f61]) ).
thf(f37,plain,
( ( $true
!= ( cQ @ sK4 @ sK4 ) )
| spl8_3 ),
inference(avatar_component_clause,[],[f35]) ).
thf(f35,plain,
( spl8_3
<=> ( $true
= ( cQ @ sK4 @ sK4 ) ) ),
introduced(avatar_definition,[new_symbols(naming,[spl8_3])]) ).
thf(f55,plain,
( spl8_1
| ~ spl8_6
| ~ spl8_3 ),
inference(avatar_split_clause,[],[f18,f35,f50,f27]) ).
thf(f18,plain,
( ( $true
!= ( cQ @ sK4 @ sK4 ) )
| ( $true
= ( cQ @ sK3 @ sK2 ) )
| ( ( cQ @ sK7 @ sK6 )
!= $true ) ),
inference(cnf_transformation,[],[f14]) ).
thf(f54,plain,
( ~ spl8_5
| spl8_2
| ~ spl8_3 ),
inference(avatar_split_clause,[],[f16,f35,f31,f45]) ).
thf(f16,plain,
( ( $true
!= ( cQ @ sK4 @ sK4 ) )
| ( ( cQ @ sK2 @ sK3 )
!= $true )
| ( ( cQ @ sK7 @ sK5 )
= $true ) ),
inference(cnf_transformation,[],[f14]) ).
thf(f53,plain,
( ~ spl8_5
| ~ spl8_3
| ~ spl8_6 ),
inference(avatar_split_clause,[],[f15,f50,f35,f45]) ).
thf(f15,plain,
( ( ( cQ @ sK7 @ sK6 )
!= $true )
| ( ( cQ @ sK2 @ sK3 )
!= $true )
| ( $true
!= ( cQ @ sK4 @ sK4 ) ) ),
inference(cnf_transformation,[],[f14]) ).
thf(f48,plain,
( ~ spl8_3
| spl8_4
| ~ spl8_5 ),
inference(avatar_split_clause,[],[f17,f45,f40,f35]) ).
thf(f17,plain,
( ( ( cQ @ sK2 @ sK3 )
!= $true )
| ( $true
!= ( cQ @ sK4 @ sK4 ) )
| ( ( cQ @ sK5 @ sK6 )
= $true ) ),
inference(cnf_transformation,[],[f14]) ).
thf(f43,plain,
( ~ spl8_3
| spl8_4
| spl8_1 ),
inference(avatar_split_clause,[],[f20,f27,f40,f35]) ).
thf(f20,plain,
( ( ( cQ @ sK5 @ sK6 )
= $true )
| ( $true
= ( cQ @ sK3 @ sK2 ) )
| ( $true
!= ( cQ @ sK4 @ sK4 ) ) ),
inference(cnf_transformation,[],[f14]) ).
thf(f38,plain,
( spl8_1
| spl8_2
| ~ spl8_3 ),
inference(avatar_split_clause,[],[f19,f35,f31,f27]) ).
thf(f19,plain,
( ( $true
= ( cQ @ sK3 @ sK2 ) )
| ( ( cQ @ sK7 @ sK5 )
= $true )
| ( $true
!= ( cQ @ sK4 @ sK4 ) ) ),
inference(cnf_transformation,[],[f14]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.08 % Problem : SEV019^5 : TPTP v8.2.0. Released v4.0.0.
% 0.00/0.08 % Command : run_vampire %s %d THM
% 0.07/0.27 % Computer : n032.cluster.edu
% 0.07/0.27 % Model : x86_64 x86_64
% 0.07/0.27 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.07/0.27 % Memory : 8042.1875MB
% 0.07/0.27 % OS : Linux 3.10.0-693.el7.x86_64
% 0.07/0.27 % CPULimit : 300
% 0.07/0.27 % WCLimit : 300
% 0.07/0.27 % DateTime : Fri Jun 21 19:19:08 EDT 2024
% 0.07/0.27 % CPUTime :
% 0.11/0.28 This is a TH0_THM_NEQ_NAR problem
% 0.11/0.28 Running higher-order theorem proving
% 0.11/0.28 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.30 % (15070)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.13/0.30 % (15071)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.13/0.30 % (15073)lrs+10_1:1_au=on:inj=on:i=2:si=on:rtra=on_0 on theBenchmark for (3000ds/2Mi)
% 0.13/0.30 % (15072)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.13/0.30 % (15076)lrs+1004_1:128_cond=on:e2e=on:sp=weighted_frequency:i=18:si=on:rtra=on_0 on theBenchmark for (3000ds/18Mi)
% 0.13/0.30 % (15075)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.13/0.30 % (15074)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.13/0.30 % (15073)Instruction limit reached!
% 0.13/0.30 % (15073)------------------------------
% 0.13/0.30 % (15073)Version: Vampire 4.8 (commit 11aac991b on 2023-10-04 16:26:07 +0200)
% 0.13/0.30 % (15073)Termination reason: Unknown
% 0.13/0.30 % (15073)Termination phase: Saturation
% 0.13/0.30
% 0.13/0.30 % (15073)Memory used [KB]: 5500
% 0.13/0.30 % (15073)Time elapsed: 0.002 s
% 0.13/0.30 % (15073)Instructions burned: 2 (million)
% 0.13/0.30 % (15073)------------------------------
% 0.13/0.30 % (15073)------------------------------
% 0.13/0.30 % (15074)Instruction limit reached!
% 0.13/0.30 % (15074)------------------------------
% 0.13/0.30 % (15074)Version: Vampire 4.8 (commit 11aac991b on 2023-10-04 16:26:07 +0200)
% 0.13/0.30 % (15074)Termination reason: Unknown
% 0.13/0.30 % (15074)Termination phase: Saturation
% 0.13/0.30
% 0.13/0.30 % (15074)Memory used [KB]: 895
% 0.13/0.30 % (15074)Time elapsed: 0.002 s
% 0.13/0.30 % (15074)Instructions burned: 2 (million)
% 0.13/0.30 % (15074)------------------------------
% 0.13/0.30 % (15074)------------------------------
% 0.13/0.30 % (15071)Instruction limit reached!
% 0.13/0.30 % (15071)------------------------------
% 0.13/0.30 % (15071)Version: Vampire 4.8 (commit 11aac991b on 2023-10-04 16:26:07 +0200)
% 0.13/0.30 % (15071)Termination reason: Unknown
% 0.13/0.30 % (15071)Termination phase: Saturation
% 0.13/0.30
% 0.13/0.30 % (15071)Memory used [KB]: 5500
% 0.13/0.30 % (15071)Time elapsed: 0.004 s
% 0.13/0.30 % (15071)Instructions burned: 5 (million)
% 0.13/0.30 % (15071)------------------------------
% 0.13/0.30 % (15071)------------------------------
% 0.13/0.30 % (15076)Instruction limit reached!
% 0.13/0.30 % (15076)------------------------------
% 0.13/0.30 % (15076)Version: Vampire 4.8 (commit 11aac991b on 2023-10-04 16:26:07 +0200)
% 0.13/0.30 % (15076)Termination reason: Unknown
% 0.13/0.30 % (15076)Termination phase: Saturation
% 0.13/0.30
% 0.13/0.30 % (15076)Memory used [KB]: 5628
% 0.13/0.30 % (15076)Time elapsed: 0.009 s
% 0.13/0.30 % (15076)Instructions burned: 18 (million)
% 0.13/0.30 % (15076)------------------------------
% 0.13/0.30 % (15076)------------------------------
% 0.13/0.31 % (15077)lrs+10_1:1_bet=on:cnfonf=off:fd=off:hud=5:inj=on:i=3:si=on:rtra=on_0 on theBenchmark for (2999ds/3Mi)
% 0.13/0.31 % (15078)lrs+1002_1:1_cnfonf=lazy_not_be_gen:hud=14:prag=on:sp=weighted_frequency:tnu=1:i=37:si=on:rtra=on_0 on theBenchmark for (2999ds/37Mi)
% 0.13/0.31 % (15072)Instruction limit reached!
% 0.13/0.31 % (15072)------------------------------
% 0.13/0.31 % (15072)Version: Vampire 4.8 (commit 11aac991b on 2023-10-04 16:26:07 +0200)
% 0.13/0.31 % (15072)Termination reason: Unknown
% 0.13/0.31 % (15072)Termination phase: Saturation
% 0.13/0.31
% 0.13/0.31 % (15072)Memory used [KB]: 5628
% 0.13/0.31 % (15072)Time elapsed: 0.012 s
% 0.13/0.31 % (15072)Instructions burned: 27 (million)
% 0.13/0.31 % (15072)------------------------------
% 0.13/0.31 % (15072)------------------------------
% 0.13/0.31 % (15077)Instruction limit reached!
% 0.13/0.31 % (15077)------------------------------
% 0.13/0.31 % (15077)Version: Vampire 4.8 (commit 11aac991b on 2023-10-04 16:26:07 +0200)
% 0.13/0.31 % (15077)Termination reason: Unknown
% 0.13/0.31 % (15077)Termination phase: Saturation
% 0.13/0.31
% 0.13/0.31 % (15077)Memory used [KB]: 5500
% 0.13/0.31 % (15077)Time elapsed: 0.003 s
% 0.13/0.31 % (15077)Instructions burned: 3 (million)
% 0.13/0.31 % (15077)------------------------------
% 0.13/0.31 % (15077)------------------------------
% 0.13/0.31 % (15079)lrs+2_16:1_acc=model:au=on:bd=off:c=on:e2e=on:nm=2:sos=all:i=15:si=on:rtra=on_0 on theBenchmark for (2999ds/15Mi)
% 0.13/0.31 % (15070)First to succeed.
% 0.13/0.31 % (15070)Refutation found. Thanks to Tanya!
% 0.13/0.31 % SZS status Theorem for theBenchmark
% 0.13/0.31 % SZS output start Proof for theBenchmark
% See solution above
% 0.13/0.31 % (15070)------------------------------
% 0.13/0.31 % (15070)Version: Vampire 4.8 (commit 11aac991b on 2023-10-04 16:26:07 +0200)
% 0.13/0.31 % (15070)Termination reason: Refutation
% 0.13/0.31
% 0.13/0.31 % (15070)Memory used [KB]: 5756
% 0.13/0.31 % (15070)Time elapsed: 0.015 s
% 0.13/0.31 % (15070)Instructions burned: 31 (million)
% 0.13/0.31 % (15070)------------------------------
% 0.13/0.31 % (15070)------------------------------
% 0.13/0.31 % (15069)Success in time 0.021 s
%------------------------------------------------------------------------------