TSTP Solution File: SEV222^5 by Vampire---4.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.9
% Problem : SEV222^5 : TPTP v8.2.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire %s %d THM
% Computer : n028.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:20 EDT 2024
% Result : Theorem 0.19s 0.38s
% Output : Refutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 15
% Number of leaves : 12
% Syntax : Number of formulae : 71 ( 1 unt; 0 typ; 0 def)
% Number of atoms : 607 ( 182 equ; 0 cnn)
% Maximal formula atoms : 24 ( 8 avg)
% Number of connectives : 592 ( 122 ~; 177 |; 42 &; 227 @)
% ( 11 <=>; 12 =>; 0 <=; 1 <~>)
% Maximal formula depth : 10 ( 5 avg)
% Number of types : 2 ( 1 usr)
% Number of type conns : 66 ( 66 >; 0 *; 0 +; 0 <<)
% Number of symbols : 17 ( 14 usr; 10 con; 0-2 aty)
% Number of variables : 109 ( 29 ^ 51 !; 29 ?; 109 :)
% Comments :
%------------------------------------------------------------------------------
thf(type_def_5,type,
a: $tType ).
thf(func_def_0,type,
a: $tType ).
thf(func_def_1,type,
cZ: a > $o ).
thf(func_def_2,type,
cW: ( a > $o ) > $o ).
thf(func_def_9,type,
sK0: a ).
thf(func_def_10,type,
sK1: a > $o ).
thf(func_def_11,type,
sK2: a > $o ).
thf(func_def_12,type,
sK3: a > $o ).
thf(func_def_15,type,
ph5:
!>[X0: $tType] : X0 ).
thf(f100,plain,
$false,
inference(avatar_sat_refutation,[],[f37,f46,f51,f57,f58,f59,f63,f64,f65,f69,f93,f99]) ).
thf(f99,plain,
( spl4_3
| ~ spl4_5
| ~ spl4_6 ),
inference(avatar_contradiction_clause,[],[f98]) ).
thf(f98,plain,
( $false
| spl4_3
| ~ spl4_5
| ~ spl4_6 ),
inference(trivial_inequality_removal,[],[f97]) ).
thf(f97,plain,
( ( $true = $false )
| spl4_3
| ~ spl4_5
| ~ spl4_6 ),
inference(forward_demodulation,[],[f54,f80]) ).
thf(f80,plain,
( ( ( cZ @ sK0 )
= $false )
| spl4_3
| ~ spl4_5 ),
inference(trivial_inequality_removal,[],[f79]) ).
thf(f79,plain,
( ( ( cZ @ sK0 )
= $false )
| ( $true != $true )
| spl4_3
| ~ spl4_5 ),
inference(superposition,[],[f41,f76]) ).
thf(f76,plain,
( ! [X1: a] :
( ( $true
= ( sK1 @ X1 ) )
| ( ( cZ @ X1 )
= $false ) )
| ~ spl4_5 ),
inference(binary_proxy_clausification,[],[f75]) ).
thf(f75,plain,
( ! [X1: a] :
( ( $true
= ( sK1 @ X1 ) )
| ( ( ( sK2 @ X1 )
| ( cZ @ X1 ) )
= $false ) )
| ~ spl4_5 ),
inference(binary_proxy_clausification,[],[f73]) ).
thf(f73,plain,
( ! [X1: a] :
( ( ( sK2 @ X1 )
| ( cZ @ X1 ) )
= ( sK1 @ X1 ) )
| ~ spl4_5 ),
inference(beta_eta_normalization,[],[f72]) ).
thf(f72,plain,
( ! [X1: a] :
( ( ^ [Y0: a] :
( ( sK2 @ Y0 )
| ( cZ @ Y0 ) )
@ X1 )
= ( sK1 @ X1 ) )
| ~ spl4_5 ),
inference(argument_congruence,[],[f50]) ).
thf(f50,plain,
( ( ( ^ [Y0: a] :
( ( sK2 @ Y0 )
| ( cZ @ Y0 ) ) )
= sK1 )
| ~ spl4_5 ),
inference(avatar_component_clause,[],[f48]) ).
thf(f48,plain,
( spl4_5
<=> ( ( ^ [Y0: a] :
( ( sK2 @ Y0 )
| ( cZ @ Y0 ) ) )
= sK1 ) ),
introduced(avatar_definition,[new_symbols(naming,[spl4_5])]) ).
thf(f41,plain,
( ( ( sK1 @ sK0 )
!= $true )
| spl4_3 ),
inference(avatar_component_clause,[],[f39]) ).
thf(f39,plain,
( spl4_3
<=> ( ( sK1 @ sK0 )
= $true ) ),
introduced(avatar_definition,[new_symbols(naming,[spl4_3])]) ).
thf(f54,plain,
( ( ( cZ @ sK0 )
= $true )
| ~ spl4_6 ),
inference(avatar_component_clause,[],[f53]) ).
thf(f53,plain,
( spl4_6
<=> ( ( cZ @ sK0 )
= $true ) ),
introduced(avatar_definition,[new_symbols(naming,[spl4_6])]) ).
thf(f93,plain,
( ~ spl4_1
| spl4_3
| ~ spl4_5
| ~ spl4_7 ),
inference(avatar_contradiction_clause,[],[f92]) ).
thf(f92,plain,
( $false
| ~ spl4_1
| spl4_3
| ~ spl4_5
| ~ spl4_7 ),
inference(trivial_inequality_removal,[],[f84]) ).
thf(f84,plain,
( ( $true = $false )
| ~ spl4_1
| spl4_3
| ~ spl4_5
| ~ spl4_7 ),
inference(superposition,[],[f82,f71]) ).
thf(f71,plain,
( ( $true
= ( sK2 @ sK0 ) )
| ~ spl4_1
| ~ spl4_7 ),
inference(trivial_inequality_removal,[],[f70]) ).
thf(f70,plain,
( ( $true
= ( sK2 @ sK0 ) )
| ( $true != $true )
| ~ spl4_1
| ~ spl4_7 ),
inference(superposition,[],[f62,f32]) ).
thf(f32,plain,
( ( ( cW @ sK2 )
= $true )
| ~ spl4_1 ),
inference(avatar_component_clause,[],[f30]) ).
thf(f30,plain,
( spl4_1
<=> ( ( cW @ sK2 )
= $true ) ),
introduced(avatar_definition,[new_symbols(naming,[spl4_1])]) ).
thf(f62,plain,
( ! [X6: a > $o] :
( ( $true
!= ( cW @ X6 ) )
| ( ( X6 @ sK0 )
= $true ) )
| ~ spl4_7 ),
inference(avatar_component_clause,[],[f61]) ).
thf(f61,plain,
( spl4_7
<=> ! [X6: a > $o] :
( ( ( X6 @ sK0 )
= $true )
| ( $true
!= ( cW @ X6 ) ) ) ),
introduced(avatar_definition,[new_symbols(naming,[spl4_7])]) ).
thf(f82,plain,
( ( ( sK2 @ sK0 )
= $false )
| spl4_3
| ~ spl4_5 ),
inference(trivial_inequality_removal,[],[f81]) ).
thf(f81,plain,
( ( $true != $true )
| ( ( sK2 @ sK0 )
= $false )
| spl4_3
| ~ spl4_5 ),
inference(superposition,[],[f41,f77]) ).
thf(f77,plain,
( ! [X1: a] :
( ( $true
= ( sK1 @ X1 ) )
| ( ( sK2 @ X1 )
= $false ) )
| ~ spl4_5 ),
inference(binary_proxy_clausification,[],[f75]) ).
thf(f69,plain,
( ~ spl4_2
| spl4_4
| ~ spl4_7 ),
inference(avatar_contradiction_clause,[],[f68]) ).
thf(f68,plain,
( $false
| ~ spl4_2
| spl4_4
| ~ spl4_7 ),
inference(subsumption_resolution,[],[f67,f45]) ).
thf(f45,plain,
( ( ( sK3 @ sK0 )
!= $true )
| spl4_4 ),
inference(avatar_component_clause,[],[f43]) ).
thf(f43,plain,
( spl4_4
<=> ( ( sK3 @ sK0 )
= $true ) ),
introduced(avatar_definition,[new_symbols(naming,[spl4_4])]) ).
thf(f67,plain,
( ( ( sK3 @ sK0 )
= $true )
| ~ spl4_2
| ~ spl4_7 ),
inference(trivial_inequality_removal,[],[f66]) ).
thf(f66,plain,
( ( $true != $true )
| ( ( sK3 @ sK0 )
= $true )
| ~ spl4_2
| ~ spl4_7 ),
inference(superposition,[],[f62,f36]) ).
thf(f36,plain,
( ( ( cW @ sK3 )
= $true )
| ~ spl4_2 ),
inference(avatar_component_clause,[],[f34]) ).
thf(f34,plain,
( spl4_2
<=> ( ( cW @ sK3 )
= $true ) ),
introduced(avatar_definition,[new_symbols(naming,[spl4_2])]) ).
thf(f65,plain,
( ~ spl4_3
| ~ spl4_6 ),
inference(avatar_split_clause,[],[f18,f53,f39]) ).
thf(f18,plain,
( ( ( cZ @ sK0 )
!= $true )
| ( ( sK1 @ sK0 )
!= $true ) ),
inference(cnf_transformation,[],[f14]) ).
thf(f14,plain,
( ( ( ( ( cW @ sK2 )
= $true )
& ( ( ^ [Y0: a] :
( ( sK2 @ Y0 )
| ( cZ @ Y0 ) ) )
= sK1 )
& ( ( sK1 @ sK0 )
!= $true ) )
| ( ( ( cZ @ sK0 )
!= $true )
& ( ( cW @ sK3 )
= $true )
& ( ( sK3 @ sK0 )
!= $true ) ) )
& ( ! [X4: a > $o] :
( ! [X5: a > $o] :
( ( $true
!= ( cW @ X5 ) )
| ( ( ^ [Y0: a] :
( ( X5 @ Y0 )
| ( cZ @ Y0 ) ) )
!= X4 ) )
| ( $true
= ( X4 @ sK0 ) ) )
| ( ( cZ @ sK0 )
= $true )
| ! [X6: a > $o] :
( ( $true
!= ( cW @ X6 ) )
| ( ( X6 @ sK0 )
= $true ) ) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3])],[f9,f13,f12,f11,f10]) ).
thf(f10,plain,
( ? [X0: a] :
( ( ? [X1: a > $o] :
( ? [X2: a > $o] :
( ( ( cW @ X2 )
= $true )
& ( ( ^ [Y0: a] :
( ( X2 @ Y0 )
| ( cZ @ Y0 ) ) )
= X1 ) )
& ( ( X1 @ X0 )
!= $true ) )
| ( ( ( cZ @ X0 )
!= $true )
& ? [X3: a > $o] :
( ( ( cW @ X3 )
= $true )
& ( $true
!= ( X3 @ X0 ) ) ) ) )
& ( ! [X4: a > $o] :
( ! [X5: a > $o] :
( ( $true
!= ( cW @ X5 ) )
| ( ( ^ [Y0: a] :
( ( X5 @ Y0 )
| ( cZ @ Y0 ) ) )
!= X4 ) )
| ( ( X4 @ X0 )
= $true ) )
| ( ( cZ @ X0 )
= $true )
| ! [X6: a > $o] :
( ( $true
!= ( cW @ X6 ) )
| ( ( X6 @ X0 )
= $true ) ) ) )
=> ( ( ? [X1: a > $o] :
( ? [X2: a > $o] :
( ( ( cW @ X2 )
= $true )
& ( ( ^ [Y0: a] :
( ( X2 @ Y0 )
| ( cZ @ Y0 ) ) )
= X1 ) )
& ( ( X1 @ sK0 )
!= $true ) )
| ( ( ( cZ @ sK0 )
!= $true )
& ? [X3: a > $o] :
( ( ( cW @ X3 )
= $true )
& ( ( X3 @ sK0 )
!= $true ) ) ) )
& ( ! [X4: a > $o] :
( ! [X5: a > $o] :
( ( $true
!= ( cW @ X5 ) )
| ( ( ^ [Y0: a] :
( ( X5 @ Y0 )
| ( cZ @ Y0 ) ) )
!= X4 ) )
| ( $true
= ( X4 @ sK0 ) ) )
| ( ( cZ @ sK0 )
= $true )
| ! [X6: a > $o] :
( ( $true
!= ( cW @ X6 ) )
| ( ( X6 @ sK0 )
= $true ) ) ) ) ),
introduced(choice_axiom,[]) ).
thf(f11,plain,
( ? [X1: a > $o] :
( ? [X2: a > $o] :
( ( ( cW @ X2 )
= $true )
& ( ( ^ [Y0: a] :
( ( X2 @ Y0 )
| ( cZ @ Y0 ) ) )
= X1 ) )
& ( ( X1 @ sK0 )
!= $true ) )
=> ( ? [X2: a > $o] :
( ( ( cW @ X2 )
= $true )
& ( ( ^ [Y0: a] :
( ( X2 @ Y0 )
| ( cZ @ Y0 ) ) )
= sK1 ) )
& ( ( sK1 @ sK0 )
!= $true ) ) ),
introduced(choice_axiom,[]) ).
thf(f12,plain,
( ? [X2: a > $o] :
( ( ( cW @ X2 )
= $true )
& ( ( ^ [Y0: a] :
( ( X2 @ Y0 )
| ( cZ @ Y0 ) ) )
= sK1 ) )
=> ( ( ( cW @ sK2 )
= $true )
& ( ( ^ [Y0: a] :
( ( sK2 @ Y0 )
| ( cZ @ Y0 ) ) )
= sK1 ) ) ),
introduced(choice_axiom,[]) ).
thf(f13,plain,
( ? [X3: a > $o] :
( ( ( cW @ X3 )
= $true )
& ( ( X3 @ sK0 )
!= $true ) )
=> ( ( ( cW @ sK3 )
= $true )
& ( ( sK3 @ sK0 )
!= $true ) ) ),
introduced(choice_axiom,[]) ).
thf(f9,plain,
? [X0: a] :
( ( ? [X1: a > $o] :
( ? [X2: a > $o] :
( ( ( cW @ X2 )
= $true )
& ( ( ^ [Y0: a] :
( ( X2 @ Y0 )
| ( cZ @ Y0 ) ) )
= X1 ) )
& ( ( X1 @ X0 )
!= $true ) )
| ( ( ( cZ @ X0 )
!= $true )
& ? [X3: a > $o] :
( ( ( cW @ X3 )
= $true )
& ( $true
!= ( X3 @ X0 ) ) ) ) )
& ( ! [X4: a > $o] :
( ! [X5: a > $o] :
( ( $true
!= ( cW @ X5 ) )
| ( ( ^ [Y0: a] :
( ( X5 @ Y0 )
| ( cZ @ Y0 ) ) )
!= X4 ) )
| ( ( X4 @ X0 )
= $true ) )
| ( ( cZ @ X0 )
= $true )
| ! [X6: a > $o] :
( ( $true
!= ( cW @ X6 ) )
| ( ( X6 @ X0 )
= $true ) ) ) ),
inference(rectify,[],[f8]) ).
thf(f8,plain,
? [X0: a] :
( ( ? [X2: a > $o] :
( ? [X3: a > $o] :
( ( ( cW @ X3 )
= $true )
& ( ( ^ [Y0: a] :
( ( X3 @ Y0 )
| ( cZ @ Y0 ) ) )
= X2 ) )
& ( $true
!= ( X2 @ X0 ) ) )
| ( ( ( cZ @ X0 )
!= $true )
& ? [X1: a > $o] :
( ( ( cW @ X1 )
= $true )
& ( ( X1 @ X0 )
!= $true ) ) ) )
& ( ! [X2: a > $o] :
( ! [X3: a > $o] :
( ( ( cW @ X3 )
!= $true )
| ( ( ^ [Y0: a] :
( ( X3 @ Y0 )
| ( cZ @ Y0 ) ) )
!= X2 ) )
| ( $true
= ( X2 @ X0 ) ) )
| ( ( cZ @ X0 )
= $true )
| ! [X1: a > $o] :
( ( ( cW @ X1 )
!= $true )
| ( ( X1 @ X0 )
= $true ) ) ) ),
inference(flattening,[],[f7]) ).
thf(f7,plain,
? [X0: a] :
( ( ? [X2: a > $o] :
( ? [X3: a > $o] :
( ( ( cW @ X3 )
= $true )
& ( ( ^ [Y0: a] :
( ( X3 @ Y0 )
| ( cZ @ Y0 ) ) )
= X2 ) )
& ( $true
!= ( X2 @ X0 ) ) )
| ( ( ( cZ @ X0 )
!= $true )
& ? [X1: a > $o] :
( ( ( cW @ X1 )
= $true )
& ( ( X1 @ X0 )
!= $true ) ) ) )
& ( ! [X2: a > $o] :
( ! [X3: a > $o] :
( ( ( cW @ X3 )
!= $true )
| ( ( ^ [Y0: a] :
( ( X3 @ Y0 )
| ( cZ @ Y0 ) ) )
!= X2 ) )
| ( $true
= ( X2 @ X0 ) ) )
| ( ( cZ @ X0 )
= $true )
| ! [X1: a > $o] :
( ( ( cW @ X1 )
!= $true )
| ( ( X1 @ X0 )
= $true ) ) ) ),
inference(nnf_transformation,[],[f6]) ).
thf(f6,plain,
? [X0: a] :
( ( ( ( cZ @ X0 )
= $true )
| ! [X1: a > $o] :
( ( ( cW @ X1 )
!= $true )
| ( ( X1 @ X0 )
= $true ) ) )
<~> ! [X2: a > $o] :
( ! [X3: a > $o] :
( ( ( cW @ X3 )
!= $true )
| ( ( ^ [Y0: a] :
( ( X3 @ Y0 )
| ( cZ @ Y0 ) ) )
!= X2 ) )
| ( $true
= ( X2 @ X0 ) ) ) ),
inference(ennf_transformation,[],[f5]) ).
thf(f5,plain,
~ ! [X0: a] :
( ! [X2: a > $o] :
( ? [X3: a > $o] :
( ( ( ^ [Y0: a] :
( ( X3 @ Y0 )
| ( cZ @ Y0 ) ) )
= X2 )
& ( ( cW @ X3 )
= $true ) )
=> ( $true
= ( X2 @ X0 ) ) )
<=> ( ( ( cZ @ X0 )
= $true )
| ! [X1: a > $o] :
( ( ( cW @ X1 )
= $true )
=> ( ( X1 @ X0 )
= $true ) ) ) ),
inference(fool_elimination,[],[f4]) ).
thf(f4,plain,
~ ! [X0: a] :
( ( ! [X1: a > $o] :
( ( cW @ X1 )
=> ( X1 @ X0 ) )
| ( cZ @ X0 ) )
<=> ! [X2: a > $o] :
( ? [X3: a > $o] :
( ( ( ^ [X4: a] :
( ( cZ @ X4 )
| ( X3 @ X4 ) ) )
= X2 )
& ( cW @ X3 ) )
=> ( X2 @ X0 ) ) ),
inference(rectify,[],[f2]) ).
thf(f2,negated_conjecture,
~ ! [X0: a] :
( ( ! [X1: a > $o] :
( ( cW @ X1 )
=> ( X1 @ X0 ) )
| ( cZ @ X0 ) )
<=> ! [X1: a > $o] :
( ? [X2: a > $o] :
( ( ( ^ [X3: a] :
( ( cZ @ X3 )
| ( X2 @ X3 ) ) )
= X1 )
& ( cW @ X2 ) )
=> ( X1 @ X0 ) ) ),
inference(negated_conjecture,[],[f1]) ).
thf(f1,conjecture,
! [X0: a] :
( ( ! [X1: a > $o] :
( ( cW @ X1 )
=> ( X1 @ X0 ) )
| ( cZ @ X0 ) )
<=> ! [X1: a > $o] :
( ? [X2: a > $o] :
( ( ( ^ [X3: a] :
( ( cZ @ X3 )
| ( X2 @ X3 ) ) )
= X1 )
& ( cW @ X2 ) )
=> ( X1 @ X0 ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cTHM60_pme) ).
thf(f64,plain,
( spl4_2
| spl4_5 ),
inference(avatar_split_clause,[],[f20,f48,f34]) ).
thf(f20,plain,
( ( ( ^ [Y0: a] :
( ( sK2 @ Y0 )
| ( cZ @ Y0 ) ) )
= sK1 )
| ( ( cW @ sK3 )
= $true ) ),
inference(cnf_transformation,[],[f14]) ).
thf(f63,plain,
( spl4_7
| spl4_6
| spl4_7 ),
inference(avatar_split_clause,[],[f28,f61,f53,f61]) ).
thf(f28,plain,
! [X6: a > $o,X5: a > $o] :
( ( ( cZ @ sK0 )
= $true )
| ( $true
!= ( cW @ X5 ) )
| ( ( X6 @ sK0 )
= $true )
| ( $true
!= ( cW @ X6 ) )
| ( ( X5 @ sK0 )
= $true ) ),
inference(duplicate_literal_removal,[],[f27]) ).
thf(f27,plain,
! [X6: a > $o,X5: a > $o] :
( ( ( cZ @ sK0 )
= $true )
| ( ( X6 @ sK0 )
= $true )
| ( $true
!= ( cW @ X5 ) )
| ( ( cZ @ sK0 )
= $true )
| ( ( X5 @ sK0 )
= $true )
| ( $true
!= ( cW @ X6 ) ) ),
inference(binary_proxy_clausification,[],[f26]) ).
thf(f26,plain,
! [X6: a > $o,X5: a > $o] :
( ( $true
!= ( cW @ X6 ) )
| ( ( ( X5 @ sK0 )
| ( cZ @ sK0 ) )
= $true )
| ( ( X6 @ sK0 )
= $true )
| ( $true
!= ( cW @ X5 ) )
| ( ( cZ @ sK0 )
= $true ) ),
inference(beta_eta_normalization,[],[f25]) ).
thf(f25,plain,
! [X6: a > $o,X5: a > $o] :
( ( $true
!= ( cW @ X6 ) )
| ( ( X6 @ sK0 )
= $true )
| ( ( cZ @ sK0 )
= $true )
| ( $true
!= ( cW @ X5 ) )
| ( ( ^ [Y0: a] :
( ( X5 @ Y0 )
| ( cZ @ Y0 ) )
@ sK0 )
= $true ) ),
inference(equality_resolution,[],[f15]) ).
thf(f15,plain,
! [X6: a > $o,X4: a > $o,X5: a > $o] :
( ( $true
!= ( cW @ X5 ) )
| ( ( ^ [Y0: a] :
( ( X5 @ Y0 )
| ( cZ @ Y0 ) ) )
!= X4 )
| ( $true
= ( X4 @ sK0 ) )
| ( ( cZ @ sK0 )
= $true )
| ( $true
!= ( cW @ X6 ) )
| ( ( X6 @ sK0 )
= $true ) ),
inference(cnf_transformation,[],[f14]) ).
thf(f59,plain,
( spl4_2
| ~ spl4_3 ),
inference(avatar_split_clause,[],[f17,f39,f34]) ).
thf(f17,plain,
( ( ( cW @ sK3 )
= $true )
| ( ( sK1 @ sK0 )
!= $true ) ),
inference(cnf_transformation,[],[f14]) ).
thf(f58,plain,
( ~ spl4_4
| spl4_1 ),
inference(avatar_split_clause,[],[f22,f30,f43]) ).
thf(f22,plain,
( ( ( sK3 @ sK0 )
!= $true )
| ( ( cW @ sK2 )
= $true ) ),
inference(cnf_transformation,[],[f14]) ).
thf(f57,plain,
( ~ spl4_6
| spl4_5 ),
inference(avatar_split_clause,[],[f21,f48,f53]) ).
thf(f21,plain,
( ( ( cZ @ sK0 )
!= $true )
| ( ( ^ [Y0: a] :
( ( sK2 @ Y0 )
| ( cZ @ Y0 ) ) )
= sK1 ) ),
inference(cnf_transformation,[],[f14]) ).
thf(f51,plain,
( spl4_5
| ~ spl4_4 ),
inference(avatar_split_clause,[],[f19,f43,f48]) ).
thf(f19,plain,
( ( ( sK3 @ sK0 )
!= $true )
| ( ( ^ [Y0: a] :
( ( sK2 @ Y0 )
| ( cZ @ Y0 ) ) )
= sK1 ) ),
inference(cnf_transformation,[],[f14]) ).
thf(f46,plain,
( ~ spl4_3
| ~ spl4_4 ),
inference(avatar_split_clause,[],[f16,f43,f39]) ).
thf(f16,plain,
( ( ( sK1 @ sK0 )
!= $true )
| ( ( sK3 @ sK0 )
!= $true ) ),
inference(cnf_transformation,[],[f14]) ).
thf(f37,plain,
( spl4_1
| spl4_2 ),
inference(avatar_split_clause,[],[f23,f34,f30]) ).
thf(f23,plain,
( ( ( cW @ sK2 )
= $true )
| ( ( cW @ sK3 )
= $true ) ),
inference(cnf_transformation,[],[f14]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : SEV222^5 : TPTP v8.2.0. Released v4.0.0.
% 0.11/0.12 % Command : run_vampire %s %d THM
% 0.11/0.33 % Computer : n028.cluster.edu
% 0.11/0.33 % Model : x86_64 x86_64
% 0.11/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.33 % Memory : 8042.1875MB
% 0.11/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.33 % CPULimit : 300
% 0.11/0.33 % WCLimit : 300
% 0.11/0.33 % DateTime : Fri Jun 21 18:41:54 EDT 2024
% 0.11/0.33 % CPUTime :
% 0.19/0.35 This is a TH0_THM_EQU_NAR problem
% 0.19/0.35 Running higher-order theorem proving
% 0.19/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.19/0.37 % (2208)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.19/0.37 % (2210)lrs+10_1:1_au=on:inj=on:i=2:si=on:rtra=on_0 on theBenchmark for (2999ds/2Mi)
% 0.19/0.37 % (2207)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.19/0.37 % (2209)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.19/0.37 % (2211)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.19/0.37 % (2213)lrs+1004_1:128_cond=on:e2e=on:sp=weighted_frequency:i=18:si=on:rtra=on_0 on theBenchmark for (2999ds/18Mi)
% 0.19/0.37 % (2212)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.19/0.37 % (2210)Instruction limit reached!
% 0.19/0.37 % (2210)------------------------------
% 0.19/0.37 % (2210)Version: Vampire 4.8 (commit 11aac991b on 2023-10-04 16:26:07 +0200)
% 0.19/0.37 % (2210)Termination reason: Unknown
% 0.19/0.37 % (2211)Instruction limit reached!
% 0.19/0.37 % (2211)------------------------------
% 0.19/0.37 % (2211)Version: Vampire 4.8 (commit 11aac991b on 2023-10-04 16:26:07 +0200)
% 0.19/0.37 % (2210)Termination phase: Saturation
% 0.19/0.37
% 0.19/0.37 % (2210)Memory used [KB]: 5500
% 0.19/0.37 % (2210)Time elapsed: 0.004 s
% 0.19/0.37 % (2210)Instructions burned: 2 (million)
% 0.19/0.37 % (2210)------------------------------
% 0.19/0.37 % (2210)------------------------------
% 0.19/0.37 % (2211)Termination reason: Unknown
% 0.19/0.37 % (2211)Termination phase: Saturation
% 0.19/0.37
% 0.19/0.37 % (2211)Memory used [KB]: 5500
% 0.19/0.37 % (2211)Time elapsed: 0.004 s
% 0.19/0.37 % (2211)Instructions burned: 2 (million)
% 0.19/0.37 % (2211)------------------------------
% 0.19/0.37 % (2211)------------------------------
% 0.19/0.37 % (2208)Instruction limit reached!
% 0.19/0.37 % (2208)------------------------------
% 0.19/0.37 % (2208)Version: Vampire 4.8 (commit 11aac991b on 2023-10-04 16:26:07 +0200)
% 0.19/0.37 % (2208)Termination reason: Unknown
% 0.19/0.37 % (2208)Termination phase: Saturation
% 0.19/0.37
% 0.19/0.37 % (2208)Memory used [KB]: 5500
% 0.19/0.37 % (2208)Time elapsed: 0.006 s
% 0.19/0.37 % (2208)Instructions burned: 4 (million)
% 0.19/0.37 % (2208)------------------------------
% 0.19/0.37 % (2208)------------------------------
% 0.19/0.37 % (2212)First to succeed.
% 0.19/0.38 % (2209)Also succeeded, but the first one will report.
% 0.19/0.38 % (2212)Refutation found. Thanks to Tanya!
% 0.19/0.38 % SZS status Theorem for theBenchmark
% 0.19/0.38 % SZS output start Proof for theBenchmark
% See solution above
% 0.19/0.38 % (2212)------------------------------
% 0.19/0.38 % (2212)Version: Vampire 4.8 (commit 11aac991b on 2023-10-04 16:26:07 +0200)
% 0.19/0.38 % (2212)Termination reason: Refutation
% 0.19/0.38
% 0.19/0.38 % (2212)Memory used [KB]: 5500
% 0.19/0.38 % (2212)Time elapsed: 0.008 s
% 0.19/0.38 % (2212)Instructions burned: 4 (million)
% 0.19/0.38 % (2212)------------------------------
% 0.19/0.38 % (2212)------------------------------
% 0.19/0.38 % (2206)Success in time 0.01 s
%------------------------------------------------------------------------------