TSTP Solution File: SEV221^5 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SEV221^5 : TPTP v8.2.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox2/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% Computer : n023.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 : Tue May 21 04:12:26 EDT 2024
% Result : Theorem 0.14s 0.32s
% Output : Refutation 0.14s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 24
% Syntax : Number of formulae : 100 ( 1 unt; 10 typ; 0 def)
% Number of atoms : 701 ( 196 equ; 0 cnn)
% Maximal formula atoms : 24 ( 7 avg)
% Number of connectives : 697 ( 172 ~; 182 |; 90 &; 235 @)
% ( 13 <=>; 4 =>; 0 <=; 1 <~>)
% Maximal formula depth : 10 ( 4 avg)
% Number of types : 2 ( 1 usr)
% Number of type conns : 72 ( 72 >; 0 *; 0 +; 0 <<)
% Number of symbols : 20 ( 17 usr; 13 con; 0-2 aty)
% Number of variables : 110 ( 29 ^ 40 !; 40 ?; 110 :)
% ( 1 !>; 0 ?*; 0 @-; 0 @+)
% 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(func_def_16,type,
sK6: a ).
thf(f184,plain,
$false,
inference(avatar_sat_refutation,[],[f42,f51,f52,f57,f58,f68,f69,f70,f71,f96,f106,f118,f153,f173,f181]) ).
thf(f181,plain,
( ~ spl4_2
| ~ spl4_4 ),
inference(avatar_contradiction_clause,[],[f180]) ).
thf(f180,plain,
( $false
| ~ spl4_2
| ~ spl4_4 ),
inference(trivial_inequality_removal,[],[f176]) ).
thf(f176,plain,
( ( $true = $false )
| ~ spl4_2
| ~ spl4_4 ),
inference(superposition,[],[f33,f41]) ).
thf(f41,plain,
( ( $false
= ( cZ @ sK0 ) )
| ~ spl4_4 ),
inference(avatar_component_clause,[],[f39]) ).
thf(f39,plain,
( spl4_4
<=> ( $false
= ( cZ @ sK0 ) ) ),
introduced(avatar_definition,[new_symbols(naming,[spl4_4])]) ).
thf(f33,plain,
( ( $true
= ( cZ @ sK0 ) )
| ~ spl4_2 ),
inference(avatar_component_clause,[],[f32]) ).
thf(f32,plain,
( spl4_2
<=> ( $true
= ( cZ @ sK0 ) ) ),
introduced(avatar_definition,[new_symbols(naming,[spl4_2])]) ).
thf(f173,plain,
( ~ spl4_3
| ~ spl4_6
| ~ spl4_9 ),
inference(avatar_contradiction_clause,[],[f172]) ).
thf(f172,plain,
( $false
| ~ spl4_3
| ~ spl4_6
| ~ spl4_9 ),
inference(trivial_inequality_removal,[],[f169]) ).
thf(f169,plain,
( ( $true = $false )
| ~ spl4_3
| ~ spl4_6
| ~ spl4_9 ),
inference(superposition,[],[f67,f167]) ).
thf(f167,plain,
( ( ( sK3 @ sK0 )
= $false )
| ~ spl4_3
| ~ spl4_6 ),
inference(trivial_inequality_removal,[],[f166]) ).
thf(f166,plain,
( ( $true != $true )
| ( ( sK3 @ sK0 )
= $false )
| ~ spl4_3
| ~ spl4_6 ),
inference(superposition,[],[f37,f50]) ).
thf(f50,plain,
( ( $true
= ( cW @ sK3 ) )
| ~ spl4_6 ),
inference(avatar_component_clause,[],[f48]) ).
thf(f48,plain,
( spl4_6
<=> ( $true
= ( cW @ sK3 ) ) ),
introduced(avatar_definition,[new_symbols(naming,[spl4_6])]) ).
thf(f37,plain,
( ! [X2: a > $o] :
( ( ( cW @ X2 )
!= $true )
| ( ( X2 @ sK0 )
= $false ) )
| ~ spl4_3 ),
inference(avatar_component_clause,[],[f36]) ).
thf(f36,plain,
( spl4_3
<=> ! [X2: a > $o] :
( ( ( X2 @ sK0 )
= $false )
| ( ( cW @ X2 )
!= $true ) ) ),
introduced(avatar_definition,[new_symbols(naming,[spl4_3])]) ).
thf(f67,plain,
( ( $true
= ( sK3 @ sK0 ) )
| ~ spl4_9 ),
inference(avatar_component_clause,[],[f65]) ).
thf(f65,plain,
( spl4_9
<=> ( $true
= ( sK3 @ sK0 ) ) ),
introduced(avatar_definition,[new_symbols(naming,[spl4_9])]) ).
thf(f153,plain,
( ~ spl4_1
| ~ spl4_6
| ~ spl4_9 ),
inference(avatar_contradiction_clause,[],[f152]) ).
thf(f152,plain,
( $false
| ~ spl4_1
| ~ spl4_6
| ~ spl4_9 ),
inference(subsumption_resolution,[],[f151,f67]) ).
thf(f151,plain,
( ( $true
!= ( sK3 @ sK0 ) )
| ~ spl4_1
| ~ spl4_6 ),
inference(trivial_inequality_removal,[],[f150]) ).
thf(f150,plain,
( ( $true
!= ( sK3 @ sK0 ) )
| ( $true != $true )
| ~ spl4_1
| ~ spl4_6 ),
inference(superposition,[],[f30,f50]) ).
thf(f30,plain,
( ! [X3: a > $o] :
( ( $true
!= ( cW @ X3 ) )
| ( $true
!= ( X3 @ sK0 ) ) )
| ~ spl4_1 ),
inference(avatar_component_clause,[],[f29]) ).
thf(f29,plain,
( spl4_1
<=> ! [X3: a > $o] :
( ( $true
!= ( cW @ X3 ) )
| ( $true
!= ( X3 @ sK0 ) ) ) ),
introduced(avatar_definition,[new_symbols(naming,[spl4_1])]) ).
thf(f118,plain,
( ~ spl4_3
| ~ spl4_5
| ~ spl4_7
| ~ spl4_8 ),
inference(avatar_contradiction_clause,[],[f117]) ).
thf(f117,plain,
( $false
| ~ spl4_3
| ~ spl4_5
| ~ spl4_7
| ~ spl4_8 ),
inference(trivial_inequality_removal,[],[f114]) ).
thf(f114,plain,
( ( $true = $false )
| ~ spl4_3
| ~ spl4_5
| ~ spl4_7
| ~ spl4_8 ),
inference(superposition,[],[f46,f112]) ).
thf(f112,plain,
( ( ( sK1 @ sK0 )
= $false )
| ~ spl4_3
| ~ spl4_7
| ~ spl4_8 ),
inference(trivial_inequality_removal,[],[f110]) ).
thf(f110,plain,
( ( $true = $false )
| ( ( sK1 @ sK0 )
= $false )
| ~ spl4_3
| ~ spl4_7
| ~ spl4_8 ),
inference(superposition,[],[f77,f108]) ).
thf(f108,plain,
( ( ( sK2 @ sK0 )
= $false )
| ~ spl4_3
| ~ spl4_8 ),
inference(trivial_inequality_removal,[],[f107]) ).
thf(f107,plain,
( ( $true != $true )
| ( ( sK2 @ sK0 )
= $false )
| ~ spl4_3
| ~ spl4_8 ),
inference(superposition,[],[f37,f62]) ).
thf(f62,plain,
( ( $true
= ( cW @ sK2 ) )
| ~ spl4_8 ),
inference(avatar_component_clause,[],[f60]) ).
thf(f60,plain,
( spl4_8
<=> ( $true
= ( cW @ sK2 ) ) ),
introduced(avatar_definition,[new_symbols(naming,[spl4_8])]) ).
thf(f77,plain,
( ! [X1: a] :
( ( ( sK2 @ X1 )
= $true )
| ( ( sK1 @ X1 )
= $false ) )
| ~ spl4_7 ),
inference(binary_proxy_clausification,[],[f76]) ).
thf(f76,plain,
( ! [X1: a] :
( ( $true
= ( ( cZ @ X1 )
& ( sK2 @ X1 ) ) )
| ( ( sK1 @ X1 )
= $false ) )
| ~ spl4_7 ),
inference(binary_proxy_clausification,[],[f74]) ).
thf(f74,plain,
( ! [X1: a] :
( ( sK1 @ X1 )
= ( ( cZ @ X1 )
& ( sK2 @ X1 ) ) )
| ~ spl4_7 ),
inference(beta_eta_normalization,[],[f72]) ).
thf(f72,plain,
( ! [X1: a] :
( ( sK1 @ X1 )
= ( ^ [Y0: a] :
( ( cZ @ Y0 )
& ( sK2 @ Y0 ) )
@ X1 ) )
| ~ spl4_7 ),
inference(argument_congruence,[],[f56]) ).
thf(f56,plain,
( ( ( ^ [Y0: a] :
( ( cZ @ Y0 )
& ( sK2 @ Y0 ) ) )
= sK1 )
| ~ spl4_7 ),
inference(avatar_component_clause,[],[f54]) ).
thf(f54,plain,
( spl4_7
<=> ( ( ^ [Y0: a] :
( ( cZ @ Y0 )
& ( sK2 @ Y0 ) ) )
= sK1 ) ),
introduced(avatar_definition,[new_symbols(naming,[spl4_7])]) ).
thf(f46,plain,
( ( ( sK1 @ sK0 )
= $true )
| ~ spl4_5 ),
inference(avatar_component_clause,[],[f44]) ).
thf(f44,plain,
( spl4_5
<=> ( ( sK1 @ sK0 )
= $true ) ),
introduced(avatar_definition,[new_symbols(naming,[spl4_5])]) ).
thf(f106,plain,
( ~ spl4_1
| ~ spl4_5
| ~ spl4_7
| ~ spl4_8 ),
inference(avatar_contradiction_clause,[],[f105]) ).
thf(f105,plain,
( $false
| ~ spl4_1
| ~ spl4_5
| ~ spl4_7
| ~ spl4_8 ),
inference(trivial_inequality_removal,[],[f101]) ).
thf(f101,plain,
( ( $true = $false )
| ~ spl4_1
| ~ spl4_5
| ~ spl4_7
| ~ spl4_8 ),
inference(superposition,[],[f100,f46]) ).
thf(f100,plain,
( ( ( sK1 @ sK0 )
= $false )
| ~ spl4_1
| ~ spl4_7
| ~ spl4_8 ),
inference(trivial_inequality_removal,[],[f99]) ).
thf(f99,plain,
( ( ( sK1 @ sK0 )
= $false )
| ( $true != $true )
| ~ spl4_1
| ~ spl4_7
| ~ spl4_8 ),
inference(superposition,[],[f98,f77]) ).
thf(f98,plain,
( ( ( sK2 @ sK0 )
!= $true )
| ~ spl4_1
| ~ spl4_8 ),
inference(trivial_inequality_removal,[],[f97]) ).
thf(f97,plain,
( ( ( sK2 @ sK0 )
!= $true )
| ( $true != $true )
| ~ spl4_1
| ~ spl4_8 ),
inference(superposition,[],[f30,f62]) ).
thf(f96,plain,
( spl4_2
| ~ spl4_5
| ~ spl4_7 ),
inference(avatar_contradiction_clause,[],[f95]) ).
thf(f95,plain,
( $false
| spl4_2
| ~ spl4_5
| ~ spl4_7 ),
inference(trivial_inequality_removal,[],[f91]) ).
thf(f91,plain,
( ( $true = $false )
| spl4_2
| ~ spl4_5
| ~ spl4_7 ),
inference(superposition,[],[f90,f46]) ).
thf(f90,plain,
( ( ( sK1 @ sK0 )
= $false )
| spl4_2
| ~ spl4_7 ),
inference(trivial_inequality_removal,[],[f89]) ).
thf(f89,plain,
( ( ( sK1 @ sK0 )
= $false )
| ( $true != $true )
| spl4_2
| ~ spl4_7 ),
inference(superposition,[],[f34,f78]) ).
thf(f78,plain,
( ! [X1: a] :
( ( $true
= ( cZ @ X1 ) )
| ( ( sK1 @ X1 )
= $false ) )
| ~ spl4_7 ),
inference(binary_proxy_clausification,[],[f76]) ).
thf(f34,plain,
( ( $true
!= ( cZ @ sK0 ) )
| spl4_2 ),
inference(avatar_component_clause,[],[f32]) ).
thf(f71,plain,
( spl4_9
| spl4_5 ),
inference(avatar_split_clause,[],[f22,f44,f65]) ).
thf(f22,plain,
( ( ( sK1 @ sK0 )
= $true )
| ( $true
= ( sK3 @ sK0 ) ) ),
inference(cnf_transformation,[],[f14]) ).
thf(f14,plain,
( ( ! [X1: a > $o] :
( ( $true
!= ( X1 @ sK0 ) )
| ! [X2: a > $o] :
( ( ( ^ [Y0: a] :
( ( cZ @ Y0 )
& ( X2 @ Y0 ) ) )
!= X1 )
| ( ( cW @ X2 )
!= $true ) ) )
| ! [X3: a > $o] :
( ( $true
!= ( cW @ X3 ) )
| ( $true
!= ( X3 @ sK0 ) ) )
| ( $true
!= ( cZ @ sK0 ) ) )
& ( ( ( ( sK1 @ sK0 )
= $true )
& ( ( ^ [Y0: a] :
( ( cZ @ Y0 )
& ( sK2 @ Y0 ) ) )
= sK1 )
& ( $true
= ( cW @ sK2 ) ) )
| ( ( $true
= ( cW @ sK3 ) )
& ( $true
= ( sK3 @ sK0 ) )
& ( $true
= ( cZ @ sK0 ) ) ) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3])],[f9,f13,f12,f11,f10]) ).
thf(f10,plain,
( ? [X0: a] :
( ( ! [X1: a > $o] :
( ( ( X1 @ X0 )
!= $true )
| ! [X2: a > $o] :
( ( ( ^ [Y0: a] :
( ( cZ @ Y0 )
& ( X2 @ Y0 ) ) )
!= X1 )
| ( ( cW @ X2 )
!= $true ) ) )
| ! [X3: a > $o] :
( ( $true
!= ( cW @ X3 ) )
| ( $true
!= ( X3 @ X0 ) ) )
| ( ( cZ @ X0 )
!= $true ) )
& ( ? [X4: a > $o] :
( ( $true
= ( X4 @ X0 ) )
& ? [X5: a > $o] :
( ( ( ^ [Y0: a] :
( ( cZ @ Y0 )
& ( X5 @ Y0 ) ) )
= X4 )
& ( $true
= ( cW @ X5 ) ) ) )
| ( ? [X6: a > $o] :
( ( $true
= ( cW @ X6 ) )
& ( $true
= ( X6 @ X0 ) ) )
& ( ( cZ @ X0 )
= $true ) ) ) )
=> ( ( ! [X1: a > $o] :
( ( $true
!= ( X1 @ sK0 ) )
| ! [X2: a > $o] :
( ( ( ^ [Y0: a] :
( ( cZ @ Y0 )
& ( X2 @ Y0 ) ) )
!= X1 )
| ( ( cW @ X2 )
!= $true ) ) )
| ! [X3: a > $o] :
( ( $true
!= ( cW @ X3 ) )
| ( $true
!= ( X3 @ sK0 ) ) )
| ( $true
!= ( cZ @ sK0 ) ) )
& ( ? [X4: a > $o] :
( ( $true
= ( X4 @ sK0 ) )
& ? [X5: a > $o] :
( ( ( ^ [Y0: a] :
( ( cZ @ Y0 )
& ( X5 @ Y0 ) ) )
= X4 )
& ( $true
= ( cW @ X5 ) ) ) )
| ( ? [X6: a > $o] :
( ( $true
= ( cW @ X6 ) )
& ( $true
= ( X6 @ sK0 ) ) )
& ( $true
= ( cZ @ sK0 ) ) ) ) ) ),
introduced(choice_axiom,[]) ).
thf(f11,plain,
( ? [X4: a > $o] :
( ( $true
= ( X4 @ sK0 ) )
& ? [X5: a > $o] :
( ( ( ^ [Y0: a] :
( ( cZ @ Y0 )
& ( X5 @ Y0 ) ) )
= X4 )
& ( $true
= ( cW @ X5 ) ) ) )
=> ( ( ( sK1 @ sK0 )
= $true )
& ? [X5: a > $o] :
( ( ( ^ [Y0: a] :
( ( cZ @ Y0 )
& ( X5 @ Y0 ) ) )
= sK1 )
& ( $true
= ( cW @ X5 ) ) ) ) ),
introduced(choice_axiom,[]) ).
thf(f12,plain,
( ? [X5: a > $o] :
( ( ( ^ [Y0: a] :
( ( cZ @ Y0 )
& ( X5 @ Y0 ) ) )
= sK1 )
& ( $true
= ( cW @ X5 ) ) )
=> ( ( ( ^ [Y0: a] :
( ( cZ @ Y0 )
& ( sK2 @ Y0 ) ) )
= sK1 )
& ( $true
= ( cW @ sK2 ) ) ) ),
introduced(choice_axiom,[]) ).
thf(f13,plain,
( ? [X6: a > $o] :
( ( $true
= ( cW @ X6 ) )
& ( $true
= ( X6 @ sK0 ) ) )
=> ( ( $true
= ( cW @ sK3 ) )
& ( $true
= ( sK3 @ sK0 ) ) ) ),
introduced(choice_axiom,[]) ).
thf(f9,plain,
? [X0: a] :
( ( ! [X1: a > $o] :
( ( ( X1 @ X0 )
!= $true )
| ! [X2: a > $o] :
( ( ( ^ [Y0: a] :
( ( cZ @ Y0 )
& ( X2 @ Y0 ) ) )
!= X1 )
| ( ( cW @ X2 )
!= $true ) ) )
| ! [X3: a > $o] :
( ( $true
!= ( cW @ X3 ) )
| ( $true
!= ( X3 @ X0 ) ) )
| ( ( cZ @ X0 )
!= $true ) )
& ( ? [X4: a > $o] :
( ( $true
= ( X4 @ X0 ) )
& ? [X5: a > $o] :
( ( ( ^ [Y0: a] :
( ( cZ @ Y0 )
& ( X5 @ Y0 ) ) )
= X4 )
& ( $true
= ( cW @ X5 ) ) ) )
| ( ? [X6: a > $o] :
( ( $true
= ( cW @ X6 ) )
& ( $true
= ( X6 @ X0 ) ) )
& ( ( cZ @ X0 )
= $true ) ) ) ),
inference(rectify,[],[f8]) ).
thf(f8,plain,
? [X0: a] :
( ( ! [X2: a > $o] :
( ( $true
!= ( X2 @ X0 ) )
| ! [X3: a > $o] :
( ( ( ^ [Y0: a] :
( ( cZ @ Y0 )
& ( X3 @ Y0 ) ) )
!= X2 )
| ( $true
!= ( cW @ X3 ) ) ) )
| ! [X1: a > $o] :
( ( ( cW @ X1 )
!= $true )
| ( ( X1 @ X0 )
!= $true ) )
| ( ( cZ @ X0 )
!= $true ) )
& ( ? [X2: a > $o] :
( ( $true
= ( X2 @ X0 ) )
& ? [X3: a > $o] :
( ( ( ^ [Y0: a] :
( ( cZ @ Y0 )
& ( X3 @ Y0 ) ) )
= X2 )
& ( $true
= ( cW @ X3 ) ) ) )
| ( ? [X1: a > $o] :
( ( ( cW @ X1 )
= $true )
& ( ( X1 @ X0 )
= $true ) )
& ( ( cZ @ X0 )
= $true ) ) ) ),
inference(flattening,[],[f7]) ).
thf(f7,plain,
? [X0: a] :
( ( ! [X2: a > $o] :
( ( $true
!= ( X2 @ X0 ) )
| ! [X3: a > $o] :
( ( ( ^ [Y0: a] :
( ( cZ @ Y0 )
& ( X3 @ Y0 ) ) )
!= X2 )
| ( $true
!= ( cW @ X3 ) ) ) )
| ! [X1: a > $o] :
( ( ( cW @ X1 )
!= $true )
| ( ( X1 @ X0 )
!= $true ) )
| ( ( cZ @ X0 )
!= $true ) )
& ( ? [X2: a > $o] :
( ( $true
= ( X2 @ X0 ) )
& ? [X3: a > $o] :
( ( ( ^ [Y0: a] :
( ( cZ @ Y0 )
& ( X3 @ Y0 ) ) )
= X2 )
& ( $true
= ( cW @ X3 ) ) ) )
| ( ? [X1: a > $o] :
( ( ( cW @ X1 )
= $true )
& ( ( X1 @ X0 )
= $true ) )
& ( ( cZ @ X0 )
= $true ) ) ) ),
inference(nnf_transformation,[],[f6]) ).
thf(f6,plain,
? [X0: a] :
( ( ? [X1: a > $o] :
( ( ( cW @ X1 )
= $true )
& ( ( X1 @ X0 )
= $true ) )
& ( ( cZ @ X0 )
= $true ) )
<~> ? [X2: a > $o] :
( ( $true
= ( X2 @ X0 ) )
& ? [X3: a > $o] :
( ( ( ^ [Y0: a] :
( ( cZ @ Y0 )
& ( X3 @ Y0 ) ) )
= X2 )
& ( $true
= ( cW @ X3 ) ) ) ) ),
inference(ennf_transformation,[],[f5]) ).
thf(f5,plain,
~ ! [X0: a] :
( ? [X2: a > $o] :
( ( $true
= ( X2 @ X0 ) )
& ? [X3: a > $o] :
( ( ( ^ [Y0: a] :
( ( cZ @ Y0 )
& ( X3 @ Y0 ) ) )
= X2 )
& ( $true
= ( cW @ X3 ) ) ) )
<=> ( ? [X1: a > $o] :
( ( ( cW @ X1 )
= $true )
& ( ( X1 @ X0 )
= $true ) )
& ( ( cZ @ X0 )
= $true ) ) ),
inference(fool_elimination,[],[f4]) ).
thf(f4,plain,
~ ! [X0: a] :
( ( ? [X1: a > $o] :
( ( cW @ X1 )
& ( X1 @ X0 ) )
& ( cZ @ X0 ) )
<=> ? [X2: a > $o] :
( ( X2 @ X0 )
& ? [X3: a > $o] :
( ( cW @ X3 )
& ( X2
= ( ^ [X4: a] :
( ( X3 @ X4 )
& ( cZ @ X4 ) ) ) ) ) ) ),
inference(rectify,[],[f2]) ).
thf(f2,negated_conjecture,
~ ! [X0: a] :
( ( ? [X1: a > $o] :
( ( cW @ X1 )
& ( X1 @ X0 ) )
& ( cZ @ X0 ) )
<=> ? [X1: a > $o] :
( ( X1 @ X0 )
& ? [X2: a > $o] :
( ( cW @ X2 )
& ( X1
= ( ^ [X3: a] :
( ( X2 @ X3 )
& ( cZ @ X3 ) ) ) ) ) ) ),
inference(negated_conjecture,[],[f1]) ).
thf(f1,conjecture,
! [X0: a] :
( ( ? [X1: a > $o] :
( ( cW @ X1 )
& ( X1 @ X0 ) )
& ( cZ @ X0 ) )
<=> ? [X1: a > $o] :
( ( X1 @ X0 )
& ? [X2: a > $o] :
( ( cW @ X2 )
& ( X1
= ( ^ [X3: a] :
( ( X2 @ X3 )
& ( cZ @ X3 ) ) ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cTHM61_pme) ).
thf(f70,plain,
( spl4_8
| spl4_6 ),
inference(avatar_split_clause,[],[f17,f48,f60]) ).
thf(f17,plain,
( ( $true
= ( cW @ sK3 ) )
| ( $true
= ( cW @ sK2 ) ) ),
inference(cnf_transformation,[],[f14]) ).
thf(f69,plain,
( spl4_9
| spl4_7 ),
inference(avatar_split_clause,[],[f19,f54,f65]) ).
thf(f19,plain,
( ( ( ^ [Y0: a] :
( ( cZ @ Y0 )
& ( sK2 @ Y0 ) ) )
= sK1 )
| ( $true
= ( sK3 @ sK0 ) ) ),
inference(cnf_transformation,[],[f14]) ).
thf(f68,plain,
( spl4_9
| spl4_8 ),
inference(avatar_split_clause,[],[f16,f60,f65]) ).
thf(f16,plain,
( ( $true
= ( sK3 @ sK0 ) )
| ( $true
= ( cW @ sK2 ) ) ),
inference(cnf_transformation,[],[f14]) ).
thf(f58,plain,
( spl4_7
| spl4_2 ),
inference(avatar_split_clause,[],[f18,f32,f54]) ).
thf(f18,plain,
( ( ( ^ [Y0: a] :
( ( cZ @ Y0 )
& ( sK2 @ Y0 ) ) )
= sK1 )
| ( $true
= ( cZ @ sK0 ) ) ),
inference(cnf_transformation,[],[f14]) ).
thf(f57,plain,
( spl4_7
| spl4_6 ),
inference(avatar_split_clause,[],[f20,f48,f54]) ).
thf(f20,plain,
( ( ( ^ [Y0: a] :
( ( cZ @ Y0 )
& ( sK2 @ Y0 ) ) )
= sK1 )
| ( $true
= ( cW @ sK3 ) ) ),
inference(cnf_transformation,[],[f14]) ).
thf(f52,plain,
( spl4_2
| spl4_5 ),
inference(avatar_split_clause,[],[f21,f44,f32]) ).
thf(f21,plain,
( ( $true
= ( cZ @ sK0 ) )
| ( ( sK1 @ sK0 )
= $true ) ),
inference(cnf_transformation,[],[f14]) ).
thf(f51,plain,
( spl4_5
| spl4_6 ),
inference(avatar_split_clause,[],[f23,f48,f44]) ).
thf(f23,plain,
( ( ( sK1 @ sK0 )
= $true )
| ( $true
= ( cW @ sK3 ) ) ),
inference(cnf_transformation,[],[f14]) ).
thf(f42,plain,
( spl4_1
| ~ spl4_2
| spl4_3
| spl4_4 ),
inference(avatar_split_clause,[],[f27,f39,f36,f32,f29]) ).
thf(f27,plain,
! [X2: a > $o,X3: a > $o] :
( ( $true
!= ( cZ @ sK0 ) )
| ( ( X2 @ sK0 )
= $false )
| ( ( cW @ X2 )
!= $true )
| ( $true
!= ( cW @ X3 ) )
| ( $true
!= ( X3 @ sK0 ) )
| ( $false
= ( cZ @ sK0 ) ) ),
inference(binary_proxy_clausification,[],[f26]) ).
thf(f26,plain,
! [X2: a > $o,X3: a > $o] :
( ( $true
!= ( X3 @ sK0 ) )
| ( $true
!= ( cZ @ sK0 ) )
| ( $true
!= ( ( cZ @ sK0 )
& ( X2 @ sK0 ) ) )
| ( ( cW @ X2 )
!= $true )
| ( $true
!= ( cW @ X3 ) ) ),
inference(beta_eta_normalization,[],[f25]) ).
thf(f25,plain,
! [X2: a > $o,X3: a > $o] :
( ( $true
!= ( cW @ X3 ) )
| ( ( cW @ X2 )
!= $true )
| ( $true
!= ( ^ [Y0: a] :
( ( cZ @ Y0 )
& ( X2 @ Y0 ) )
@ sK0 ) )
| ( $true
!= ( X3 @ sK0 ) )
| ( $true
!= ( cZ @ sK0 ) ) ),
inference(equality_resolution,[],[f24]) ).
thf(f24,plain,
! [X2: a > $o,X3: a > $o,X1: a > $o] :
( ( $true
!= ( X1 @ sK0 ) )
| ( ( ^ [Y0: a] :
( ( cZ @ Y0 )
& ( X2 @ Y0 ) ) )
!= X1 )
| ( ( cW @ X2 )
!= $true )
| ( $true
!= ( cW @ X3 ) )
| ( $true
!= ( X3 @ sK0 ) )
| ( $true
!= ( cZ @ sK0 ) ) ),
inference(cnf_transformation,[],[f14]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.08 % Problem : SEV221^5 : TPTP v8.2.0. Released v4.0.0.
% 0.07/0.10 % Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox2/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% 0.09/0.30 % Computer : n023.cluster.edu
% 0.09/0.30 % Model : x86_64 x86_64
% 0.09/0.30 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.30 % Memory : 8042.1875MB
% 0.09/0.30 % OS : Linux 3.10.0-693.el7.x86_64
% 0.09/0.30 % CPULimit : 300
% 0.09/0.30 % WCLimit : 300
% 0.09/0.30 % DateTime : Sun May 19 18:56:38 EDT 2024
% 0.09/0.30 % CPUTime :
% 0.09/0.30 This is a TH0_THM_EQU_NAR problem
% 0.09/0.30 Running vampire_ho --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_hol --cores 8 -m 12000 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.14/0.31 % (5182)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.14/0.31 % (5183)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.14/0.31 % (5180)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.14/0.32 % (5179)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.14/0.32 % (5178)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.14/0.32 % (5181)lrs+10_1:1_au=on:inj=on:i=2:si=on:rtra=on_0 on theBenchmark for (3000ds/2Mi)
% 0.14/0.32 % (5182)Instruction limit reached!
% 0.14/0.32 % (5182)------------------------------
% 0.14/0.32 % (5182)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.14/0.32 % (5182)Termination reason: Unknown
% 0.14/0.32 % (5182)Termination phase: Saturation
% 0.14/0.32
% 0.14/0.32 % (5184)lrs+1004_1:128_cond=on:e2e=on:sp=weighted_frequency:i=18:si=on:rtra=on_0 on theBenchmark for (3000ds/18Mi)
% 0.14/0.32 % (5182)Memory used [KB]: 5500
% 0.14/0.32 % (5182)Time elapsed: 0.003 s
% 0.14/0.32 % (5182)Instructions burned: 2 (million)
% 0.14/0.32 % (5182)------------------------------
% 0.14/0.32 % (5182)------------------------------
% 0.14/0.32 % (5181)Instruction limit reached!
% 0.14/0.32 % (5181)------------------------------
% 0.14/0.32 % (5181)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.14/0.32 % (5181)Termination reason: Unknown
% 0.14/0.32 % (5181)Termination phase: Saturation
% 0.14/0.32
% 0.14/0.32 % (5181)Memory used [KB]: 5500
% 0.14/0.32 % (5181)Time elapsed: 0.003 s
% 0.14/0.32 % (5181)Instructions burned: 3 (million)
% 0.14/0.32 % (5181)------------------------------
% 0.14/0.32 % (5181)------------------------------
% 0.14/0.32 % (5185)lrs+10_1:1_bet=on:cnfonf=off:fd=off:hud=5:inj=on:i=3:si=on:rtra=on_0 on theBenchmark for (3000ds/3Mi)
% 0.14/0.32 % (5179)Instruction limit reached!
% 0.14/0.32 % (5179)------------------------------
% 0.14/0.32 % (5179)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.14/0.32 % (5179)Termination reason: Unknown
% 0.14/0.32 % (5179)Termination phase: Saturation
% 0.14/0.32
% 0.14/0.32 % (5179)Memory used [KB]: 5500
% 0.14/0.32 % (5179)Time elapsed: 0.004 s
% 0.14/0.32 % (5179)Instructions burned: 4 (million)
% 0.14/0.32 % (5179)------------------------------
% 0.14/0.32 % (5179)------------------------------
% 0.14/0.32 % (5185)Instruction limit reached!
% 0.14/0.32 % (5185)------------------------------
% 0.14/0.32 % (5185)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.14/0.32 % (5185)Termination reason: Unknown
% 0.14/0.32 % (5185)Termination phase: Saturation
% 0.14/0.32
% 0.14/0.32 % (5185)Memory used [KB]: 5500
% 0.14/0.32 % (5185)Time elapsed: 0.003 s
% 0.14/0.32 % (5185)Instructions burned: 3 (million)
% 0.14/0.32 % (5185)------------------------------
% 0.14/0.32 % (5185)------------------------------
% 0.14/0.32 % (5178)First to succeed.
% 0.14/0.32 % (5180)Also succeeded, but the first one will report.
% 0.14/0.32 % (5178)Refutation found. Thanks to Tanya!
% 0.14/0.32 % SZS status Theorem for theBenchmark
% 0.14/0.32 % SZS output start Proof for theBenchmark
% See solution above
% 0.14/0.32 % (5178)------------------------------
% 0.14/0.32 % (5178)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.14/0.32 % (5178)Termination reason: Refutation
% 0.14/0.32
% 0.14/0.32 % (5178)Memory used [KB]: 5628
% 0.14/0.32 % (5178)Time elapsed: 0.008 s
% 0.14/0.32 % (5178)Instructions burned: 7 (million)
% 0.14/0.32 % (5178)------------------------------
% 0.14/0.32 % (5178)------------------------------
% 0.14/0.32 % (5177)Success in time 0.006 s
% 0.14/0.32 % Vampire---4.8 exiting
%------------------------------------------------------------------------------