TSTP Solution File: SEV019^5 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SEV019^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 : n020.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:11:42 EDT 2024
% Result : Theorem 0.14s 0.39s
% Output : Refutation 0.14s
% Verified :
% SZS Type : Refutation
% Derivation depth : 20
% Number of leaves : 23
% Syntax : Number of formulae : 79 ( 3 unt; 11 typ; 0 def)
% Number of atoms : 535 ( 154 equ; 0 cnn)
% Maximal formula atoms : 10 ( 7 avg)
% Number of connectives : 639 ( 108 ~; 107 |; 54 &; 340 @)
% ( 9 <=>; 21 =>; 0 <=; 0 <~>)
% Maximal formula depth : 13 ( 5 avg)
% Number of types : 2 ( 1 usr)
% Number of type conns : 13 ( 13 >; 0 *; 0 +; 0 <<)
% Number of symbols : 18 ( 15 usr; 14 con; 0-2 aty)
% Number of variables : 123 ( 0 ^ 81 !; 42 ?; 123 :)
% 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(f188,plain,
$false,
inference(avatar_sat_refutation,[],[f38,f43,f48,f53,f54,f55,f67,f151,f187]) ).
thf(f187,plain,
( ~ spl8_1
| spl8_6 ),
inference(avatar_contradiction_clause,[],[f186]) ).
thf(f186,plain,
( $false
| ~ spl8_1
| spl8_6 ),
inference(subsumption_resolution,[],[f185,f15]) ).
thf(f15,plain,
! [X6: a] :
( ( sK6 @ X6 @ X6 )
= $true ),
inference(cnf_transformation,[],[f14]) ).
thf(f14,plain,
( ( ( ( cQ @ sK0 @ sK0 )
!= $true )
| ( ( ( cQ @ sK2 @ sK1 )
!= $true )
& ( ( cQ @ sK1 @ sK2 )
= $true ) )
| ( ( ( cQ @ sK5 @ sK3 )
!= $true )
& ( ( cQ @ sK5 @ sK4 )
= $true )
& ( ( cQ @ sK4 @ sK3 )
= $true ) ) )
& ! [X6: a] :
( ( ( sK6 @ X6 @ ( sK7 @ X6 ) )
= $true )
& ! [X9: a] :
( ! [X10: a] :
( ( cQ @ X9 @ X10 )
= ( sK6 @ X6 @ X10 ) )
| ( ( sK6 @ X6 @ X9 )
!= $true ) )
& ( ( sK6 @ X6 @ X6 )
= $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] :
( ( cQ @ X0 @ X0 )
!= $true )
=> ( ( cQ @ sK0 @ sK0 )
!= $true ) ),
introduced(choice_axiom,[]) ).
thf(f10,plain,
( ? [X1: a,X2: a] :
( ( ( cQ @ X2 @ X1 )
!= $true )
& ( ( cQ @ X1 @ X2 )
= $true ) )
=> ( ( ( cQ @ sK2 @ sK1 )
!= $true )
& ( ( cQ @ sK1 @ sK2 )
= $true ) ) ),
introduced(choice_axiom,[]) ).
thf(f11,plain,
( ? [X3: a,X4: a,X5: a] :
( ( ( cQ @ X5 @ X3 )
!= $true )
& ( ( cQ @ X5 @ X4 )
= $true )
& ( ( cQ @ X4 @ X3 )
= $true ) )
=> ( ( ( cQ @ sK5 @ sK3 )
!= $true )
& ( ( cQ @ sK5 @ sK4 )
= $true )
& ( ( cQ @ sK4 @ sK3 )
= $true ) ) ),
introduced(choice_axiom,[]) ).
thf(f12,plain,
! [X6: a] :
( ? [X7: a > $o] :
( ? [X8: a] :
( ( X7 @ X8 )
= $true )
& ! [X9: a] :
( ! [X10: a] :
( ( cQ @ X9 @ X10 )
= ( X7 @ X10 ) )
| ( ( X7 @ X9 )
!= $true ) )
& ( ( X7 @ X6 )
= $true ) )
=> ( ? [X8: a] :
( ( sK6 @ X6 @ X8 )
= $true )
& ! [X9: a] :
( ! [X10: a] :
( ( cQ @ X9 @ X10 )
= ( sK6 @ X6 @ X10 ) )
| ( ( sK6 @ X6 @ X9 )
!= $true ) )
& ( ( sK6 @ X6 @ X6 )
= $true ) ) ),
introduced(choice_axiom,[]) ).
thf(f13,plain,
! [X6: a] :
( ? [X8: a] :
( ( sK6 @ X6 @ X8 )
= $true )
=> ( ( sK6 @ X6 @ ( sK7 @ X6 ) )
= $true ) ),
introduced(choice_axiom,[]) ).
thf(f8,plain,
( ( ? [X0: a] :
( ( cQ @ X0 @ X0 )
!= $true )
| ? [X1: a,X2: a] :
( ( ( cQ @ X2 @ X1 )
!= $true )
& ( ( cQ @ X1 @ X2 )
= $true ) )
| ? [X3: a,X4: a,X5: a] :
( ( ( cQ @ X5 @ X3 )
!= $true )
& ( ( cQ @ X5 @ X4 )
= $true )
& ( ( cQ @ X4 @ X3 )
= $true ) ) )
& ! [X6: a] :
? [X7: a > $o] :
( ? [X8: a] :
( ( X7 @ X8 )
= $true )
& ! [X9: a] :
( ! [X10: a] :
( ( cQ @ X9 @ X10 )
= ( X7 @ X10 ) )
| ( ( X7 @ X9 )
!= $true ) )
& ( ( X7 @ X6 )
= $true ) ) ),
inference(rectify,[],[f7]) ).
thf(f7,plain,
( ( ? [X5: a] :
( ( cQ @ X5 @ X5 )
!= $true )
| ? [X9: a,X10: a] :
( ( ( cQ @ X10 @ X9 )
!= $true )
& ( ( cQ @ X9 @ X10 )
= $true ) )
| ? [X7: a,X6: a,X8: a] :
( ( ( cQ @ X8 @ X7 )
!= $true )
& ( ( cQ @ X8 @ X6 )
= $true )
& ( ( cQ @ X6 @ X7 )
= $true ) ) )
& ! [X0: a] :
? [X1: a > $o] :
( ? [X2: a] :
( ( X1 @ X2 )
= $true )
& ! [X3: a] :
( ! [X4: a] :
( ( X1 @ X4 )
= ( cQ @ X3 @ X4 ) )
| ( ( X1 @ X3 )
!= $true ) )
& ( ( X1 @ X0 )
= $true ) ) ),
inference(flattening,[],[f6]) ).
thf(f6,plain,
( ( ? [X9: a,X10: a] :
( ( ( cQ @ X10 @ X9 )
!= $true )
& ( ( cQ @ X9 @ X10 )
= $true ) )
| ? [X7: a,X6: a,X8: a] :
( ( ( cQ @ X8 @ X7 )
!= $true )
& ( ( cQ @ X8 @ X6 )
= $true )
& ( ( cQ @ X6 @ X7 )
= $true ) )
| ? [X5: a] :
( ( cQ @ X5 @ X5 )
!= $true ) )
& ! [X0: a] :
? [X1: a > $o] :
( ? [X2: a] :
( ( X1 @ X2 )
= $true )
& ! [X3: a] :
( ! [X4: a] :
( ( X1 @ X4 )
= ( cQ @ X3 @ X4 ) )
| ( ( X1 @ X3 )
!= $true ) )
& ( ( X1 @ X0 )
= $true ) ) ),
inference(ennf_transformation,[],[f5]) ).
thf(f5,plain,
~ ( ! [X0: a] :
? [X1: a > $o] :
( ! [X3: a] :
( ( ( X1 @ X3 )
= $true )
=> ! [X4: a] :
( ( X1 @ X4 )
= ( cQ @ X3 @ X4 ) ) )
& ? [X2: a] :
( ( X1 @ X2 )
= $true )
& ( ( X1 @ X0 )
= $true ) )
=> ( ! [X9: a,X10: a] :
( ( ( cQ @ X9 @ X10 )
= $true )
=> ( ( cQ @ X10 @ X9 )
= $true ) )
& ! [X7: a,X6: a,X8: a] :
( ( ( ( cQ @ X8 @ X6 )
= $true )
& ( ( cQ @ X6 @ X7 )
= $true ) )
=> ( ( cQ @ X8 @ X7 )
= $true ) )
& ! [X5: a] :
( ( cQ @ X5 @ X5 )
= $true ) ) ),
inference(fool_elimination,[],[f4]) ).
thf(f4,plain,
~ ( ! [X0: a] :
? [X1: a > $o] :
( ( X1 @ X0 )
& ? [X2: a] : ( X1 @ X2 )
& ! [X3: a] :
( ( X1 @ X3 )
=> ! [X4: a] :
( ( cQ @ X3 @ X4 )
<=> ( X1 @ X4 ) ) ) )
=> ( ! [X5: a] : ( cQ @ X5 @ X5 )
& ! [X6: a,X7: a,X8: a] :
( ( ( cQ @ X6 @ X7 )
& ( cQ @ X8 @ X6 ) )
=> ( cQ @ X8 @ X7 ) )
& ! [X9: a,X10: a] :
( ( cQ @ X9 @ X10 )
=> ( cQ @ X10 @ X9 ) ) ) ),
inference(rectify,[],[f2]) ).
thf(f2,negated_conjecture,
~ ( ! [X0: a] :
? [X1: a > $o] :
( ( X1 @ X0 )
& ? [X2: a] : ( X1 @ X2 )
& ! [X3: a] :
( ( X1 @ X3 )
=> ! [X4: a] :
( ( cQ @ X3 @ X4 )
<=> ( X1 @ X4 ) ) ) )
=> ( ! [X0: a] : ( cQ @ X0 @ X0 )
& ! [X4: a,X2: a,X0: a] :
( ( ( cQ @ X4 @ X2 )
& ( cQ @ X0 @ X4 ) )
=> ( cQ @ X0 @ X2 ) )
& ! [X0: a,X4: a] :
( ( cQ @ X0 @ X4 )
=> ( cQ @ X4 @ X0 ) ) ) ),
inference(negated_conjecture,[],[f1]) ).
thf(f1,conjecture,
( ! [X0: a] :
? [X1: a > $o] :
( ( X1 @ X0 )
& ? [X2: a] : ( X1 @ X2 )
& ! [X3: a] :
( ( X1 @ X3 )
=> ! [X4: a] :
( ( cQ @ X3 @ X4 )
<=> ( X1 @ X4 ) ) ) )
=> ( ! [X0: a] : ( cQ @ X0 @ X0 )
& ! [X4: a,X2: a,X0: a] :
( ( ( cQ @ X4 @ X2 )
& ( cQ @ X0 @ X4 ) )
=> ( cQ @ X0 @ X2 ) )
& ! [X0: a,X4: a] :
( ( cQ @ X0 @ X4 )
=> ( cQ @ X4 @ X0 ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cTHM559_pme) ).
thf(f185,plain,
( ( ( sK6 @ sK1 @ sK1 )
!= $true )
| ~ spl8_1
| spl8_6 ),
inference(trivial_inequality_removal,[],[f180]) ).
thf(f180,plain,
( ( $true != $true )
| ( ( sK6 @ sK1 @ sK1 )
!= $true )
| ~ spl8_1
| spl8_6 ),
inference(superposition,[],[f71,f155]) ).
thf(f155,plain,
( ! [X0: a] :
( ( ( sK6 @ X0 @ sK2 )
= $true )
| ( ( sK6 @ X0 @ sK1 )
!= $true ) )
| ~ spl8_1 ),
inference(trivial_inequality_removal,[],[f153]) ).
thf(f153,plain,
( ! [X0: a] :
( ( ( sK6 @ X0 @ sK2 )
= $true )
| ( $false = $true )
| ( ( sK6 @ X0 @ sK1 )
!= $true ) )
| ~ spl8_1 ),
inference(superposition,[],[f25,f29]) ).
thf(f29,plain,
( ( ( cQ @ sK1 @ sK2 )
= $true )
| ~ spl8_1 ),
inference(avatar_component_clause,[],[f27]) ).
thf(f27,plain,
( spl8_1
<=> ( ( cQ @ sK1 @ sK2 )
= $true ) ),
introduced(avatar_definition,[new_symbols(naming,[spl8_1])]) ).
thf(f25,plain,
! [X10: a,X6: a,X9: a] :
( ( $false
= ( cQ @ X9 @ X10 ) )
| ( ( sK6 @ X6 @ X9 )
!= $true )
| ( ( sK6 @ X6 @ X10 )
= $true ) ),
inference(binary_proxy_clausification,[],[f16]) ).
thf(f16,plain,
! [X10: a,X6: a,X9: a] :
( ( ( cQ @ X9 @ X10 )
= ( sK6 @ X6 @ X10 ) )
| ( ( sK6 @ X6 @ X9 )
!= $true ) ),
inference(cnf_transformation,[],[f14]) ).
thf(f71,plain,
( ( ( sK6 @ sK1 @ sK2 )
!= $true )
| spl8_6 ),
inference(trivial_inequality_removal,[],[f70]) ).
thf(f70,plain,
( ( ( sK6 @ sK1 @ sK2 )
!= $true )
| ( $true != $true )
| spl8_6 ),
inference(superposition,[],[f52,f63]) ).
thf(f63,plain,
! [X0: a,X1: a] :
( ( ( cQ @ X1 @ X0 )
= $true )
| ( ( sK6 @ X0 @ X1 )
!= $true ) ),
inference(trivial_inequality_removal,[],[f58]) ).
thf(f58,plain,
! [X0: a,X1: a] :
( ( ( cQ @ X1 @ X0 )
= $true )
| ( $false = $true )
| ( ( sK6 @ X0 @ X1 )
!= $true ) ),
inference(superposition,[],[f15,f24]) ).
thf(f24,plain,
! [X10: a,X6: a,X9: a] :
( ( $false
= ( sK6 @ X6 @ X10 ) )
| ( ( sK6 @ X6 @ X9 )
!= $true )
| ( ( cQ @ X9 @ X10 )
= $true ) ),
inference(binary_proxy_clausification,[],[f16]) ).
thf(f52,plain,
( ( ( cQ @ sK2 @ sK1 )
!= $true )
| spl8_6 ),
inference(avatar_component_clause,[],[f50]) ).
thf(f50,plain,
( spl8_6
<=> ( ( cQ @ sK2 @ sK1 )
= $true ) ),
introduced(avatar_definition,[new_symbols(naming,[spl8_6])]) ).
thf(f151,plain,
( spl8_2
| ~ spl8_4
| ~ spl8_5 ),
inference(avatar_contradiction_clause,[],[f150]) ).
thf(f150,plain,
( $false
| spl8_2
| ~ spl8_4
| ~ spl8_5 ),
inference(trivial_inequality_removal,[],[f146]) ).
thf(f146,plain,
( ( $true != $true )
| spl8_2
| ~ spl8_4
| ~ spl8_5 ),
inference(superposition,[],[f145,f15]) ).
thf(f145,plain,
( ! [X0: a] :
( ( sK6 @ X0 @ sK5 )
!= $true )
| spl8_2
| ~ spl8_4
| ~ spl8_5 ),
inference(subsumption_resolution,[],[f144,f93]) ).
thf(f93,plain,
( ! [X0: a] :
( ( ( sK6 @ X0 @ sK4 )
= $true )
| ( ( sK6 @ X0 @ sK5 )
!= $true ) )
| ~ spl8_5 ),
inference(trivial_inequality_removal,[],[f85]) ).
thf(f85,plain,
( ! [X0: a] :
( ( ( sK6 @ X0 @ sK5 )
!= $true )
| ( ( sK6 @ X0 @ sK4 )
= $true )
| ( $false = $true ) )
| ~ spl8_5 ),
inference(superposition,[],[f47,f25]) ).
thf(f47,plain,
( ( ( cQ @ sK5 @ sK4 )
= $true )
| ~ spl8_5 ),
inference(avatar_component_clause,[],[f45]) ).
thf(f45,plain,
( spl8_5
<=> ( ( cQ @ sK5 @ sK4 )
= $true ) ),
introduced(avatar_definition,[new_symbols(naming,[spl8_5])]) ).
thf(f144,plain,
( ! [X0: a] :
( ( ( sK6 @ X0 @ sK4 )
!= $true )
| ( ( sK6 @ X0 @ sK5 )
!= $true ) )
| spl8_2
| ~ spl8_4 ),
inference(trivial_inequality_removal,[],[f141]) ).
thf(f141,plain,
( ! [X0: a] :
( ( $true != $true )
| ( ( sK6 @ X0 @ sK5 )
!= $true )
| ( ( sK6 @ X0 @ sK4 )
!= $true ) )
| spl8_2
| ~ spl8_4 ),
inference(superposition,[],[f33,f97]) ).
thf(f97,plain,
( ! [X0: a,X1: a] :
( ( ( cQ @ X1 @ sK3 )
= $true )
| ( ( sK6 @ X0 @ sK4 )
!= $true )
| ( ( sK6 @ X0 @ X1 )
!= $true ) )
| ~ spl8_4 ),
inference(trivial_inequality_removal,[],[f94]) ).
thf(f94,plain,
( ! [X0: a,X1: a] :
( ( ( cQ @ X1 @ sK3 )
= $true )
| ( $false = $true )
| ( ( sK6 @ X0 @ sK4 )
!= $true )
| ( ( sK6 @ X0 @ X1 )
!= $true ) )
| ~ spl8_4 ),
inference(superposition,[],[f88,f24]) ).
thf(f88,plain,
( ! [X0: a] :
( ( ( sK6 @ X0 @ sK3 )
= $true )
| ( ( sK6 @ X0 @ sK4 )
!= $true ) )
| ~ spl8_4 ),
inference(trivial_inequality_removal,[],[f77]) ).
thf(f77,plain,
( ! [X0: a] :
( ( ( sK6 @ X0 @ sK4 )
!= $true )
| ( $false = $true )
| ( ( sK6 @ X0 @ sK3 )
= $true ) )
| ~ spl8_4 ),
inference(superposition,[],[f25,f42]) ).
thf(f42,plain,
( ( ( cQ @ sK4 @ sK3 )
= $true )
| ~ spl8_4 ),
inference(avatar_component_clause,[],[f40]) ).
thf(f40,plain,
( spl8_4
<=> ( ( cQ @ sK4 @ sK3 )
= $true ) ),
introduced(avatar_definition,[new_symbols(naming,[spl8_4])]) ).
thf(f33,plain,
( ( ( cQ @ sK5 @ sK3 )
!= $true )
| spl8_2 ),
inference(avatar_component_clause,[],[f31]) ).
thf(f31,plain,
( spl8_2
<=> ( ( cQ @ sK5 @ sK3 )
= $true ) ),
introduced(avatar_definition,[new_symbols(naming,[spl8_2])]) ).
thf(f67,plain,
spl8_3,
inference(avatar_contradiction_clause,[],[f66]) ).
thf(f66,plain,
( $false
| spl8_3 ),
inference(subsumption_resolution,[],[f65,f15]) ).
thf(f65,plain,
( ( ( sK6 @ sK0 @ sK0 )
!= $true )
| spl8_3 ),
inference(trivial_inequality_removal,[],[f64]) ).
thf(f64,plain,
( ( ( sK6 @ sK0 @ sK0 )
!= $true )
| ( $true != $true )
| spl8_3 ),
inference(superposition,[],[f37,f63]) ).
thf(f37,plain,
( ( ( cQ @ sK0 @ sK0 )
!= $true )
| spl8_3 ),
inference(avatar_component_clause,[],[f35]) ).
thf(f35,plain,
( spl8_3
<=> ( ( cQ @ sK0 @ sK0 )
= $true ) ),
introduced(avatar_definition,[new_symbols(naming,[spl8_3])]) ).
thf(f55,plain,
( spl8_4
| ~ spl8_6
| ~ spl8_3 ),
inference(avatar_split_clause,[],[f21,f35,f50,f40]) ).
thf(f21,plain,
( ( ( cQ @ sK0 @ sK0 )
!= $true )
| ( ( cQ @ sK2 @ sK1 )
!= $true )
| ( ( cQ @ sK4 @ sK3 )
= $true ) ),
inference(cnf_transformation,[],[f14]) ).
thf(f54,plain,
( ~ spl8_2
| ~ spl8_3
| ~ spl8_6 ),
inference(avatar_split_clause,[],[f23,f50,f35,f31]) ).
thf(f23,plain,
( ( ( cQ @ sK2 @ sK1 )
!= $true )
| ( ( cQ @ sK5 @ sK3 )
!= $true )
| ( ( cQ @ sK0 @ sK0 )
!= $true ) ),
inference(cnf_transformation,[],[f14]) ).
thf(f53,plain,
( ~ spl8_6
| ~ spl8_3
| spl8_5 ),
inference(avatar_split_clause,[],[f22,f45,f35,f50]) ).
thf(f22,plain,
( ( ( cQ @ sK2 @ sK1 )
!= $true )
| ( ( cQ @ sK5 @ sK4 )
= $true )
| ( ( cQ @ sK0 @ sK0 )
!= $true ) ),
inference(cnf_transformation,[],[f14]) ).
thf(f48,plain,
( ~ spl8_3
| spl8_1
| spl8_5 ),
inference(avatar_split_clause,[],[f19,f45,f27,f35]) ).
thf(f19,plain,
( ( ( cQ @ sK1 @ sK2 )
= $true )
| ( ( cQ @ sK5 @ sK4 )
= $true )
| ( ( cQ @ sK0 @ sK0 )
!= $true ) ),
inference(cnf_transformation,[],[f14]) ).
thf(f43,plain,
( spl8_4
| spl8_1
| ~ spl8_3 ),
inference(avatar_split_clause,[],[f18,f35,f27,f40]) ).
thf(f18,plain,
( ( ( cQ @ sK0 @ sK0 )
!= $true )
| ( ( cQ @ sK1 @ sK2 )
= $true )
| ( ( cQ @ sK4 @ sK3 )
= $true ) ),
inference(cnf_transformation,[],[f14]) ).
thf(f38,plain,
( spl8_1
| ~ spl8_2
| ~ spl8_3 ),
inference(avatar_split_clause,[],[f20,f35,f31,f27]) ).
thf(f20,plain,
( ( ( cQ @ sK5 @ sK3 )
!= $true )
| ( ( cQ @ sK1 @ sK2 )
= $true )
| ( ( cQ @ sK0 @ sK0 )
!= $true ) ),
inference(cnf_transformation,[],[f14]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12 % Problem : SEV019^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.35 % Computer : n020.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Sun May 19 19:03:38 EDT 2024
% 0.14/0.35 % CPUTime :
% 0.14/0.35 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.37 % (1897)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.14/0.37 % (1893)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.14/0.37 % (1892)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.14/0.37 % (1898)lrs+1004_1:128_cond=on:e2e=on:sp=weighted_frequency:i=18:si=on:rtra=on_0 on theBenchmark for (2999ds/18Mi)
% 0.14/0.37 % (1896)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.14/0.38 % (1894)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.14/0.38 % (1899)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.14/0.38 % (1896)Instruction limit reached!
% 0.14/0.38 % (1896)------------------------------
% 0.14/0.38 % (1896)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.14/0.38 % (1896)Termination reason: Unknown
% 0.14/0.38 % (1896)Termination phase: shuffling
% 0.14/0.38
% 0.14/0.38 % (1896)Memory used [KB]: 895
% 0.14/0.38 % (1895)lrs+10_1:1_au=on:inj=on:i=2:si=on:rtra=on_0 on theBenchmark for (2999ds/2Mi)
% 0.14/0.38 % (1896)Time elapsed: 0.003 s
% 0.14/0.38 % (1896)Instructions burned: 2 (million)
% 0.14/0.38 % (1896)------------------------------
% 0.14/0.38 % (1896)------------------------------
% 0.14/0.38 % (1895)Instruction limit reached!
% 0.14/0.38 % (1895)------------------------------
% 0.14/0.38 % (1895)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.14/0.38 % (1895)Termination reason: Unknown
% 0.14/0.38 % (1895)Termination phase: Preprocessing 3
% 0.14/0.38
% 0.14/0.38 % (1895)Memory used [KB]: 895
% 0.14/0.38 % (1895)Time elapsed: 0.003 s
% 0.14/0.38 % (1895)Instructions burned: 2 (million)
% 0.14/0.38 % (1895)------------------------------
% 0.14/0.38 % (1895)------------------------------
% 0.14/0.38 % (1893)Instruction limit reached!
% 0.14/0.38 % (1893)------------------------------
% 0.14/0.38 % (1893)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.14/0.38 % (1893)Termination reason: Unknown
% 0.14/0.38 % (1893)Termination phase: Saturation
% 0.14/0.38
% 0.14/0.38 % (1893)Memory used [KB]: 5500
% 0.14/0.38 % (1893)Time elapsed: 0.005 s
% 0.14/0.38 % (1893)Instructions burned: 4 (million)
% 0.14/0.38 % (1893)------------------------------
% 0.14/0.38 % (1893)------------------------------
% 0.14/0.38 % (1899)Instruction limit reached!
% 0.14/0.38 % (1899)------------------------------
% 0.14/0.38 % (1899)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.14/0.38 % (1899)Termination reason: Unknown
% 0.14/0.38 % (1899)Termination phase: Saturation
% 0.14/0.38
% 0.14/0.38 % (1899)Memory used [KB]: 5500
% 0.14/0.38 % (1899)Time elapsed: 0.005 s
% 0.14/0.38 % (1899)Instructions burned: 3 (million)
% 0.14/0.38 % (1899)------------------------------
% 0.14/0.38 % (1899)------------------------------
% 0.14/0.39 % (1892)First to succeed.
% 0.14/0.39 % (1898)Instruction limit reached!
% 0.14/0.39 % (1898)------------------------------
% 0.14/0.39 % (1898)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.14/0.39 % (1898)Termination reason: Unknown
% 0.14/0.39 % (1898)Termination phase: Saturation
% 0.14/0.39
% 0.14/0.39 % (1898)Memory used [KB]: 5628
% 0.14/0.39 % (1898)Time elapsed: 0.015 s
% 0.14/0.39 % (1898)Instructions burned: 19 (million)
% 0.14/0.39 % (1898)------------------------------
% 0.14/0.39 % (1898)------------------------------
% 0.14/0.39 % (1892)Refutation found. Thanks to Tanya!
% 0.14/0.39 % SZS status Theorem for theBenchmark
% 0.14/0.39 % SZS output start Proof for theBenchmark
% See solution above
% 0.14/0.39 % (1892)------------------------------
% 0.14/0.39 % (1892)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.14/0.39 % (1892)Termination reason: Refutation
% 0.14/0.39
% 0.14/0.39 % (1892)Memory used [KB]: 5628
% 0.14/0.39 % (1892)Time elapsed: 0.017 s
% 0.14/0.39 % (1892)Instructions burned: 18 (million)
% 0.14/0.39 % (1892)------------------------------
% 0.14/0.39 % (1892)------------------------------
% 0.14/0.39 % (1884)Success in time 0.028 s
% 0.14/0.39 % Vampire---4.8 exiting
%------------------------------------------------------------------------------