TSTP Solution File: SEV218^5 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SEV218^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 : n008.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.38s
% Output : Refutation 0.14s
% Verified :
% SZS Type : Refutation
% Derivation depth : 18
% Number of leaves : 23
% Syntax : Number of formulae : 81 ( 3 unt; 11 typ; 0 def)
% Number of atoms : 548 ( 157 equ; 0 cnn)
% Maximal formula atoms : 10 ( 7 avg)
% Number of connectives : 678 ( 106 ~; 112 |; 54 &; 376 @)
% ( 9 <=>; 21 =>; 0 <=; 0 <~>)
% Maximal formula depth : 13 ( 5 avg)
% Number of types : 2 ( 1 usr)
% Number of type conns : 21 ( 21 >; 0 *; 0 +; 0 <<)
% Number of symbols : 18 ( 15 usr; 14 con; 0-2 aty)
% Number of variables : 122 ( 0 ^ 80 !; 42 ?; 122 :)
% 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 ).
thf(func_def_6,type,
sK1: 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 > a > $o ).
thf(func_def_12,type,
sK7: a > a ).
thf(f117,plain,
$false,
inference(avatar_sat_refutation,[],[f38,f43,f48,f53,f54,f55,f69,f101,f116]) ).
thf(f116,plain,
( spl8_2
| ~ spl8_6 ),
inference(avatar_contradiction_clause,[],[f115]) ).
thf(f115,plain,
( $false
| spl8_2
| ~ spl8_6 ),
inference(subsumption_resolution,[],[f114,f17]) ).
thf(f17,plain,
! [X7: a] :
( ( sK6 @ X7 @ X7 )
= $true ),
inference(cnf_transformation,[],[f14]) ).
thf(f14,plain,
( ( ( ( $true
!= ( cQ @ sK2 @ sK1 ) )
& ( $true
= ( cQ @ sK2 @ sK0 ) )
& ( $true
= ( cQ @ sK0 @ sK1 ) ) )
| ( ( ( cQ @ sK4 @ sK3 )
= $true )
& ( $true
!= ( cQ @ sK3 @ sK4 ) ) )
| ( $true
!= ( cQ @ sK5 @ sK5 ) ) )
& ! [X7: a] :
( ( ( sK6 @ X7 @ X7 )
= $true )
& ( $true
= ( sK6 @ X7 @ ( sK7 @ X7 ) ) )
& ! [X9: a] :
( ! [X10: a] :
( ( sK6 @ X7 @ X10 )
= ( cQ @ X9 @ X10 ) )
| ( $true
!= ( sK6 @ X7 @ X9 ) ) ) ) ),
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,X2: a] :
( ( $true
!= ( cQ @ X2 @ X1 ) )
& ( ( cQ @ X2 @ X0 )
= $true )
& ( $true
= ( cQ @ X0 @ X1 ) ) )
=> ( ( $true
!= ( cQ @ sK2 @ sK1 ) )
& ( $true
= ( cQ @ sK2 @ sK0 ) )
& ( $true
= ( cQ @ sK0 @ sK1 ) ) ) ),
introduced(choice_axiom,[]) ).
thf(f10,plain,
( ? [X3: a,X4: a] :
( ( $true
= ( cQ @ X4 @ X3 ) )
& ( ( cQ @ X3 @ X4 )
!= $true ) )
=> ( ( ( cQ @ sK4 @ sK3 )
= $true )
& ( $true
!= ( cQ @ sK3 @ sK4 ) ) ) ),
introduced(choice_axiom,[]) ).
thf(f11,plain,
( ? [X5: a] :
( ( cQ @ X5 @ X5 )
!= $true )
=> ( $true
!= ( cQ @ sK5 @ sK5 ) ) ),
introduced(choice_axiom,[]) ).
thf(f12,plain,
( ? [X6: a > a > $o] :
! [X7: a] :
( ( $true
= ( X6 @ X7 @ X7 ) )
& ? [X8: a] :
( ( X6 @ X7 @ X8 )
= $true )
& ! [X9: a] :
( ! [X10: a] :
( ( X6 @ X7 @ X10 )
= ( cQ @ X9 @ X10 ) )
| ( ( X6 @ X7 @ X9 )
!= $true ) ) )
=> ! [X7: a] :
( ( ( sK6 @ X7 @ X7 )
= $true )
& ? [X8: a] :
( $true
= ( sK6 @ X7 @ X8 ) )
& ! [X9: a] :
( ! [X10: a] :
( ( sK6 @ X7 @ X10 )
= ( cQ @ X9 @ X10 ) )
| ( $true
!= ( sK6 @ X7 @ X9 ) ) ) ) ),
introduced(choice_axiom,[]) ).
thf(f13,plain,
! [X7: a] :
( ? [X8: a] :
( $true
= ( sK6 @ X7 @ X8 ) )
=> ( $true
= ( sK6 @ X7 @ ( sK7 @ X7 ) ) ) ),
introduced(choice_axiom,[]) ).
thf(f8,plain,
( ( ? [X0: a,X1: a,X2: a] :
( ( $true
!= ( cQ @ X2 @ X1 ) )
& ( ( cQ @ X2 @ X0 )
= $true )
& ( $true
= ( cQ @ X0 @ X1 ) ) )
| ? [X3: a,X4: a] :
( ( $true
= ( cQ @ X4 @ X3 ) )
& ( ( cQ @ X3 @ X4 )
!= $true ) )
| ? [X5: a] :
( ( cQ @ X5 @ X5 )
!= $true ) )
& ? [X6: a > a > $o] :
! [X7: a] :
( ( $true
= ( X6 @ X7 @ X7 ) )
& ? [X8: a] :
( ( X6 @ X7 @ X8 )
= $true )
& ! [X9: a] :
( ! [X10: a] :
( ( X6 @ X7 @ X10 )
= ( cQ @ X9 @ X10 ) )
| ( ( X6 @ X7 @ X9 )
!= $true ) ) ) ),
inference(rectify,[],[f7]) ).
thf(f7,plain,
( ( ? [X7: a,X8: a,X6: a] :
( ( $true
!= ( cQ @ X6 @ X8 ) )
& ( $true
= ( cQ @ X6 @ X7 ) )
& ( $true
= ( cQ @ X7 @ X8 ) ) )
| ? [X9: a,X10: a] :
( ( $true
= ( cQ @ X10 @ X9 ) )
& ( $true
!= ( cQ @ X9 @ X10 ) ) )
| ? [X5: a] :
( ( cQ @ X5 @ X5 )
!= $true ) )
& ? [X0: a > a > $o] :
! [X1: a] :
( ( ( X0 @ X1 @ X1 )
= $true )
& ? [X2: a] :
( ( X0 @ X1 @ X2 )
= $true )
& ! [X3: a] :
( ! [X4: a] :
( ( X0 @ X1 @ X4 )
= ( cQ @ X3 @ X4 ) )
| ( ( X0 @ X1 @ X3 )
!= $true ) ) ) ),
inference(flattening,[],[f6]) ).
thf(f6,plain,
( ( ? [X6: a,X7: a,X8: a] :
( ( $true
!= ( cQ @ X6 @ X8 ) )
& ( $true
= ( cQ @ X6 @ X7 ) )
& ( $true
= ( cQ @ X7 @ X8 ) ) )
| ? [X5: a] :
( ( cQ @ X5 @ X5 )
!= $true )
| ? [X9: a,X10: a] :
( ( $true
= ( cQ @ X10 @ X9 ) )
& ( $true
!= ( cQ @ X9 @ X10 ) ) ) )
& ? [X0: a > a > $o] :
! [X1: a] :
( ( ( X0 @ X1 @ X1 )
= $true )
& ? [X2: a] :
( ( X0 @ X1 @ X2 )
= $true )
& ! [X3: a] :
( ! [X4: a] :
( ( X0 @ X1 @ X4 )
= ( cQ @ X3 @ X4 ) )
| ( ( X0 @ X1 @ X3 )
!= $true ) ) ) ),
inference(ennf_transformation,[],[f5]) ).
thf(f5,plain,
~ ( ? [X0: a > a > $o] :
! [X1: a] :
( ? [X2: a] :
( ( X0 @ X1 @ X2 )
= $true )
& ( ( X0 @ X1 @ X1 )
= $true )
& ! [X3: a] :
( ( ( X0 @ X1 @ X3 )
= $true )
=> ! [X4: a] :
( ( X0 @ X1 @ X4 )
= ( cQ @ X3 @ X4 ) ) ) )
=> ( ! [X6: a,X7: a,X8: a] :
( ( ( $true
= ( cQ @ X6 @ X7 ) )
& ( $true
= ( cQ @ X7 @ X8 ) ) )
=> ( $true
= ( cQ @ X6 @ X8 ) ) )
& ! [X5: a] :
( ( cQ @ X5 @ X5 )
= $true )
& ! [X9: a,X10: a] :
( ( $true
= ( cQ @ X10 @ X9 ) )
=> ( $true
= ( cQ @ X9 @ X10 ) ) ) ) ),
inference(fool_elimination,[],[f4]) ).
thf(f4,plain,
~ ( ? [X0: a > a > $o] :
! [X1: a] :
( ( X0 @ X1 @ X1 )
& ? [X2: a] : ( X0 @ X1 @ X2 )
& ! [X3: a] :
( ( X0 @ X1 @ X3 )
=> ! [X4: a] :
( ( cQ @ X3 @ X4 )
<=> ( X0 @ X1 @ X4 ) ) ) )
=> ( ! [X5: a] : ( cQ @ X5 @ X5 )
& ! [X6: a,X7: a,X8: a] :
( ( ( cQ @ X6 @ X7 )
& ( cQ @ X7 @ X8 ) )
=> ( cQ @ X6 @ X8 ) )
& ! [X9: a,X10: a] :
( ( cQ @ X10 @ X9 )
=> ( cQ @ X9 @ X10 ) ) ) ),
inference(rectify,[],[f2]) ).
thf(f2,negated_conjecture,
~ ( ? [X0: a > a > $o] :
! [X1: a] :
( ( X0 @ X1 @ X1 )
& ? [X2: a] : ( X0 @ X1 @ X2 )
& ! [X3: a] :
( ( X0 @ X1 @ X3 )
=> ! [X4: a] :
( ( cQ @ X3 @ X4 )
<=> ( X0 @ X1 @ X4 ) ) ) )
=> ( ! [X1: a] : ( cQ @ X1 @ X1 )
& ! [X1: a,X4: a,X2: a] :
( ( ( cQ @ X1 @ X4 )
& ( cQ @ X4 @ X2 ) )
=> ( cQ @ X1 @ X2 ) )
& ! [X4: a,X1: a] :
( ( cQ @ X1 @ X4 )
=> ( cQ @ X4 @ X1 ) ) ) ),
inference(negated_conjecture,[],[f1]) ).
thf(f1,conjecture,
( ? [X0: a > a > $o] :
! [X1: a] :
( ( X0 @ X1 @ X1 )
& ? [X2: a] : ( X0 @ X1 @ X2 )
& ! [X3: a] :
( ( X0 @ X1 @ X3 )
=> ! [X4: a] :
( ( cQ @ X3 @ X4 )
<=> ( X0 @ X1 @ X4 ) ) ) )
=> ( ! [X1: a] : ( cQ @ X1 @ X1 )
& ! [X1: a,X4: a,X2: a] :
( ( ( cQ @ X1 @ X4 )
& ( cQ @ X4 @ X2 ) )
=> ( cQ @ X1 @ X2 ) )
& ! [X4: a,X1: a] :
( ( cQ @ X1 @ X4 )
=> ( cQ @ X4 @ X1 ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cTHM559A_pme) ).
thf(f114,plain,
( ( $true
!= ( sK6 @ sK4 @ sK4 ) )
| spl8_2
| ~ spl8_6 ),
inference(trivial_inequality_removal,[],[f113]) ).
thf(f113,plain,
( ( $true
!= ( sK6 @ sK4 @ sK4 ) )
| ( $true != $true )
| spl8_2
| ~ spl8_6 ),
inference(superposition,[],[f89,f108]) ).
thf(f108,plain,
( ! [X0: a] :
( ( $true
= ( sK6 @ X0 @ sK3 ) )
| ( $true
!= ( sK6 @ X0 @ sK4 ) ) )
| ~ spl8_6 ),
inference(trivial_inequality_removal,[],[f106]) ).
thf(f106,plain,
( ! [X0: a] :
( ( $true
!= ( sK6 @ X0 @ sK4 ) )
| ( $false = $true )
| ( $true
= ( sK6 @ X0 @ sK3 ) ) )
| ~ spl8_6 ),
inference(superposition,[],[f24,f52]) ).
thf(f52,plain,
( ( ( cQ @ sK4 @ sK3 )
= $true )
| ~ spl8_6 ),
inference(avatar_component_clause,[],[f50]) ).
thf(f50,plain,
( spl8_6
<=> ( ( cQ @ sK4 @ sK3 )
= $true ) ),
introduced(avatar_definition,[new_symbols(naming,[spl8_6])]) ).
thf(f24,plain,
! [X10: a,X9: a,X7: a] :
( ( $false
= ( cQ @ X9 @ X10 ) )
| ( ( sK6 @ X7 @ X10 )
= $true )
| ( $true
!= ( sK6 @ X7 @ X9 ) ) ),
inference(binary_proxy_clausification,[],[f15]) ).
thf(f15,plain,
! [X10: a,X9: a,X7: a] :
( ( ( sK6 @ X7 @ X10 )
= ( cQ @ X9 @ X10 ) )
| ( $true
!= ( sK6 @ X7 @ X9 ) ) ),
inference(cnf_transformation,[],[f14]) ).
thf(f89,plain,
( ( $true
!= ( sK6 @ sK4 @ sK3 ) )
| spl8_2 ),
inference(trivial_inequality_removal,[],[f86]) ).
thf(f86,plain,
( ( $true
!= ( sK6 @ sK4 @ sK3 ) )
| ( $false = $true )
| spl8_2 ),
inference(superposition,[],[f74,f17]) ).
thf(f74,plain,
( ! [X0: a] :
( ( $false
= ( sK6 @ X0 @ sK4 ) )
| ( $true
!= ( sK6 @ X0 @ sK3 ) ) )
| spl8_2 ),
inference(trivial_inequality_removal,[],[f72]) ).
thf(f72,plain,
( ! [X0: a] :
( ( $true
!= ( sK6 @ X0 @ sK3 ) )
| ( $false
= ( sK6 @ X0 @ sK4 ) )
| ( $true != $true ) )
| spl8_2 ),
inference(superposition,[],[f33,f25]) ).
thf(f25,plain,
! [X10: a,X9: a,X7: a] :
( ( $true
= ( cQ @ X9 @ X10 ) )
| ( $false
= ( sK6 @ X7 @ X10 ) )
| ( $true
!= ( sK6 @ X7 @ X9 ) ) ),
inference(binary_proxy_clausification,[],[f15]) ).
thf(f33,plain,
( ( $true
!= ( cQ @ sK3 @ sK4 ) )
| spl8_2 ),
inference(avatar_component_clause,[],[f31]) ).
thf(f31,plain,
( spl8_2
<=> ( $true
= ( cQ @ sK3 @ sK4 ) ) ),
introduced(avatar_definition,[new_symbols(naming,[spl8_2])]) ).
thf(f101,plain,
( ~ spl8_3
| spl8_4
| ~ spl8_5 ),
inference(avatar_contradiction_clause,[],[f100]) ).
thf(f100,plain,
( $false
| ~ spl8_3
| spl8_4
| ~ spl8_5 ),
inference(trivial_inequality_removal,[],[f99]) ).
thf(f99,plain,
( ( $true != $true )
| ~ spl8_3
| spl8_4
| ~ spl8_5 ),
inference(superposition,[],[f98,f17]) ).
thf(f98,plain,
( ! [X0: a] :
( $true
!= ( sK6 @ X0 @ sK2 ) )
| ~ spl8_3
| spl8_4
| ~ spl8_5 ),
inference(subsumption_resolution,[],[f97,f78]) ).
thf(f78,plain,
( ! [X0: a] :
( ( $true
= ( sK6 @ X0 @ sK0 ) )
| ( $true
!= ( sK6 @ X0 @ sK2 ) ) )
| ~ spl8_3 ),
inference(trivial_inequality_removal,[],[f76]) ).
thf(f76,plain,
( ! [X0: a] :
( ( $true
!= ( sK6 @ X0 @ sK2 ) )
| ( $true
= ( sK6 @ X0 @ sK0 ) )
| ( $false = $true ) )
| ~ spl8_3 ),
inference(superposition,[],[f24,f37]) ).
thf(f37,plain,
( ( $true
= ( cQ @ sK2 @ sK0 ) )
| ~ spl8_3 ),
inference(avatar_component_clause,[],[f35]) ).
thf(f35,plain,
( spl8_3
<=> ( $true
= ( cQ @ sK2 @ sK0 ) ) ),
introduced(avatar_definition,[new_symbols(naming,[spl8_3])]) ).
thf(f97,plain,
( ! [X0: a] :
( ( $true
!= ( sK6 @ X0 @ sK0 ) )
| ( $true
!= ( sK6 @ X0 @ sK2 ) ) )
| spl8_4
| ~ spl8_5 ),
inference(trivial_inequality_removal,[],[f95]) ).
thf(f95,plain,
( ! [X0: a] :
( ( $true
!= ( sK6 @ X0 @ sK2 ) )
| ( $false = $true )
| ( $true
!= ( sK6 @ X0 @ sK0 ) ) )
| spl8_4
| ~ spl8_5 ),
inference(superposition,[],[f81,f85]) ).
thf(f85,plain,
( ! [X0: a] :
( ( ( sK6 @ X0 @ sK1 )
= $true )
| ( $true
!= ( sK6 @ X0 @ sK0 ) ) )
| ~ spl8_5 ),
inference(trivial_inequality_removal,[],[f82]) ).
thf(f82,plain,
( ! [X0: a] :
( ( $false = $true )
| ( ( sK6 @ X0 @ sK1 )
= $true )
| ( $true
!= ( sK6 @ X0 @ sK0 ) ) )
| ~ spl8_5 ),
inference(superposition,[],[f47,f24]) ).
thf(f47,plain,
( ( $true
= ( cQ @ sK0 @ sK1 ) )
| ~ spl8_5 ),
inference(avatar_component_clause,[],[f45]) ).
thf(f45,plain,
( spl8_5
<=> ( $true
= ( cQ @ sK0 @ sK1 ) ) ),
introduced(avatar_definition,[new_symbols(naming,[spl8_5])]) ).
thf(f81,plain,
( ! [X0: a] :
( ( $false
= ( sK6 @ X0 @ sK1 ) )
| ( $true
!= ( sK6 @ X0 @ sK2 ) ) )
| spl8_4 ),
inference(trivial_inequality_removal,[],[f79]) ).
thf(f79,plain,
( ! [X0: a] :
( ( $false
= ( sK6 @ X0 @ sK1 ) )
| ( $true
!= ( sK6 @ X0 @ sK2 ) )
| ( $true != $true ) )
| spl8_4 ),
inference(superposition,[],[f42,f25]) ).
thf(f42,plain,
( ( $true
!= ( cQ @ sK2 @ sK1 ) )
| spl8_4 ),
inference(avatar_component_clause,[],[f40]) ).
thf(f40,plain,
( spl8_4
<=> ( $true
= ( cQ @ sK2 @ sK1 ) ) ),
introduced(avatar_definition,[new_symbols(naming,[spl8_4])]) ).
thf(f69,plain,
spl8_1,
inference(avatar_contradiction_clause,[],[f68]) ).
thf(f68,plain,
( $false
| spl8_1 ),
inference(subsumption_resolution,[],[f65,f17]) ).
thf(f65,plain,
( ( ( sK6 @ sK5 @ sK5 )
!= $true )
| spl8_1 ),
inference(trivial_inequality_removal,[],[f64]) ).
thf(f64,plain,
( ( $false = $true )
| ( ( sK6 @ sK5 @ sK5 )
!= $true )
| spl8_1 ),
inference(superposition,[],[f17,f61]) ).
thf(f61,plain,
( ! [X0: a] :
( ( $false
= ( sK6 @ X0 @ sK5 ) )
| ( $true
!= ( sK6 @ X0 @ sK5 ) ) )
| spl8_1 ),
inference(trivial_inequality_removal,[],[f58]) ).
thf(f58,plain,
( ! [X0: a] :
( ( $true != $true )
| ( $true
!= ( sK6 @ X0 @ sK5 ) )
| ( $false
= ( sK6 @ X0 @ sK5 ) ) )
| spl8_1 ),
inference(superposition,[],[f29,f25]) ).
thf(f29,plain,
( ( $true
!= ( cQ @ sK5 @ sK5 ) )
| spl8_1 ),
inference(avatar_component_clause,[],[f27]) ).
thf(f27,plain,
( spl8_1
<=> ( $true
= ( cQ @ sK5 @ sK5 ) ) ),
introduced(avatar_definition,[new_symbols(naming,[spl8_1])]) ).
thf(f55,plain,
( spl8_6
| spl8_5
| ~ spl8_1 ),
inference(avatar_split_clause,[],[f19,f27,f45,f50]) ).
thf(f19,plain,
( ( $true
!= ( cQ @ sK5 @ sK5 ) )
| ( ( cQ @ sK4 @ sK3 )
= $true )
| ( $true
= ( cQ @ sK0 @ sK1 ) ) ),
inference(cnf_transformation,[],[f14]) ).
thf(f54,plain,
( ~ spl8_1
| spl8_6
| ~ spl8_4 ),
inference(avatar_split_clause,[],[f23,f40,f50,f27]) ).
thf(f23,plain,
( ( ( cQ @ sK4 @ sK3 )
= $true )
| ( $true
!= ( cQ @ sK2 @ sK1 ) )
| ( $true
!= ( cQ @ sK5 @ sK5 ) ) ),
inference(cnf_transformation,[],[f14]) ).
thf(f53,plain,
( spl8_3
| spl8_6
| ~ spl8_1 ),
inference(avatar_split_clause,[],[f21,f27,f50,f35]) ).
thf(f21,plain,
( ( ( cQ @ sK4 @ sK3 )
= $true )
| ( $true
!= ( cQ @ sK5 @ sK5 ) )
| ( $true
= ( cQ @ sK2 @ sK0 ) ) ),
inference(cnf_transformation,[],[f14]) ).
thf(f48,plain,
( spl8_5
| ~ spl8_2
| ~ spl8_1 ),
inference(avatar_split_clause,[],[f18,f27,f31,f45]) ).
thf(f18,plain,
( ( $true
!= ( cQ @ sK3 @ sK4 ) )
| ( $true
= ( cQ @ sK0 @ sK1 ) )
| ( $true
!= ( cQ @ sK5 @ sK5 ) ) ),
inference(cnf_transformation,[],[f14]) ).
thf(f43,plain,
( ~ spl8_1
| ~ spl8_2
| ~ spl8_4 ),
inference(avatar_split_clause,[],[f22,f40,f31,f27]) ).
thf(f22,plain,
( ( $true
!= ( cQ @ sK2 @ sK1 ) )
| ( $true
!= ( cQ @ sK3 @ sK4 ) )
| ( $true
!= ( cQ @ sK5 @ sK5 ) ) ),
inference(cnf_transformation,[],[f14]) ).
thf(f38,plain,
( ~ spl8_1
| ~ spl8_2
| spl8_3 ),
inference(avatar_split_clause,[],[f20,f35,f31,f27]) ).
thf(f20,plain,
( ( $true
!= ( cQ @ sK5 @ sK5 ) )
| ( $true
!= ( cQ @ sK3 @ sK4 ) )
| ( $true
= ( cQ @ sK2 @ sK0 ) ) ),
inference(cnf_transformation,[],[f14]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12 % Problem : SEV218^5 : TPTP v8.2.0. Released v4.0.0.
% 0.10/0.14 % 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.14/0.34 % Computer : n008.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 300
% 0.14/0.34 % DateTime : Sun May 19 18:51:07 EDT 2024
% 0.14/0.34 % CPUTime :
% 0.14/0.34 This is a TH0_THM_NEQ_NAR problem
% 0.14/0.35 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.36 % (26654)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.36 % (26655)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.37 % (26660)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.37 % (26655)Instruction limit reached!
% 0.14/0.37 % (26655)------------------------------
% 0.14/0.37 % (26655)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.14/0.37 % (26655)Termination reason: Unknown
% 0.14/0.37 % (26655)Termination phase: Saturation
% 0.14/0.37
% 0.14/0.37 % (26655)Memory used [KB]: 5500
% 0.14/0.37 % (26655)Time elapsed: 0.005 s
% 0.14/0.37 % (26655)Instructions burned: 4 (million)
% 0.14/0.37 % (26655)------------------------------
% 0.14/0.37 % (26655)------------------------------
% 0.14/0.37 % (26654)First to succeed.
% 0.14/0.37 % (26657)lrs+10_1:1_au=on:inj=on:i=2:si=on:rtra=on_0 on theBenchmark for (3000ds/2Mi)
% 0.14/0.37 % (26657)Instruction limit reached!
% 0.14/0.37 % (26657)------------------------------
% 0.14/0.37 % (26657)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.14/0.37 % (26657)Termination reason: Unknown
% 0.14/0.37 % (26657)Termination phase: Saturation
% 0.14/0.37
% 0.14/0.37 % (26657)Memory used [KB]: 895
% 0.14/0.37 % (26657)Time elapsed: 0.003 s
% 0.14/0.37 % (26657)Instructions burned: 2 (million)
% 0.14/0.37 % (26657)------------------------------
% 0.14/0.37 % (26657)------------------------------
% 0.14/0.38 % (26654)Refutation found. Thanks to Tanya!
% 0.14/0.38 % SZS status Theorem for theBenchmark
% 0.14/0.38 % SZS output start Proof for theBenchmark
% See solution above
% 0.14/0.38 % (26654)------------------------------
% 0.14/0.38 % (26654)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.14/0.38 % (26654)Termination reason: Refutation
% 0.14/0.38
% 0.14/0.38 % (26654)Memory used [KB]: 5628
% 0.14/0.38 % (26654)Time elapsed: 0.011 s
% 0.14/0.38 % (26654)Instructions burned: 10 (million)
% 0.14/0.38 % (26654)------------------------------
% 0.14/0.38 % (26654)------------------------------
% 0.14/0.38 % (26653)Success in time 0.023 s
% 0.14/0.38 % Vampire---4.8 exiting
%------------------------------------------------------------------------------