TSTP Solution File: SEV186^5 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SEV186^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 : n009.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:18 EDT 2024
% Result : Theorem 0.21s 0.39s
% Output : Refutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 20
% Number of leaves : 19
% Syntax : Number of formulae : 57 ( 6 unt; 11 typ; 0 def)
% Number of atoms : 521 ( 191 equ; 0 cnn)
% Maximal formula atoms : 26 ( 11 avg)
% Number of connectives : 599 ( 114 ~; 100 |; 60 &; 278 @)
% ( 2 <=>; 45 =>; 0 <=; 0 <~>)
% Maximal formula depth : 14 ( 6 avg)
% Number of types : 2 ( 1 usr)
% Number of type conns : 154 ( 154 >; 0 *; 0 +; 0 <<)
% Number of symbols : 14 ( 11 usr; 5 con; 0-2 aty)
% Number of variables : 170 ( 0 ^ 124 !; 44 ?; 170 :)
% ( 2 !>; 0 ?*; 0 @-; 0 @+)
% Comments :
%------------------------------------------------------------------------------
thf(type_def_5,type,
b: $tType ).
thf(func_def_0,type,
b: $tType ).
thf(func_def_2,type,
vEPSILON:
!>[X0: $tType] : ( ( X0 > $o ) > X0 ) ).
thf(func_def_5,type,
sK0: ( b > $o ) > $o ).
thf(func_def_6,type,
sK1: ( b > $o ) > ( b > $o ) > $o ).
thf(func_def_7,type,
sK2: ( b > $o ) > ( b > $o ) > b ).
thf(func_def_8,type,
sK3: b > $o ).
thf(func_def_9,type,
sK4: b > $o ).
thf(func_def_10,type,
sK5: b ).
thf(func_def_11,type,
sK6: b > $o ).
thf(func_def_13,type,
ph8:
!>[X0: $tType] : X0 ).
thf(f50,plain,
$false,
inference(avatar_sat_refutation,[],[f35,f40,f49]) ).
thf(f49,plain,
( spl7_2
| ~ spl7_1 ),
inference(avatar_split_clause,[],[f48,f29,f33]) ).
thf(f33,plain,
( spl7_2
<=> ! [X0: b] :
( ( $true
= ( sK6 @ X0 ) )
| ( $true
!= ( sK4 @ X0 ) ) ) ),
introduced(avatar_definition,[new_symbols(naming,[spl7_2])]) ).
thf(f29,plain,
( spl7_1
<=> ( $true
= ( sK3 @ ( sK2 @ sK3 @ sK6 ) ) ) ),
introduced(avatar_definition,[new_symbols(naming,[spl7_1])]) ).
thf(f48,plain,
( ! [X0: b] :
( ( $true
= ( sK6 @ X0 ) )
| ( $true
!= ( sK4 @ X0 ) ) )
| ~ spl7_1 ),
inference(trivial_inequality_removal,[],[f47]) ).
thf(f47,plain,
( ! [X0: b] :
( ( $true
!= ( sK4 @ X0 ) )
| ( $true
= ( sK6 @ X0 ) )
| ( $true != $true ) )
| ~ spl7_1 ),
inference(superposition,[],[f46,f19]) ).
thf(f19,plain,
( $true
= ( sK1 @ sK3 @ sK4 ) ),
inference(cnf_transformation,[],[f14]) ).
thf(f14,plain,
( ! [X2: b > $o] :
( ( $true
!= ( sK0 @ X2 ) )
| ! [X3: b > $o,X4: b > $o] :
( ( ( ( X4 @ ( sK2 @ X4 @ X2 ) )
= $true )
& ( $true
!= ( X2 @ ( sK2 @ X4 @ X2 ) ) ) )
| ! [X6: b] :
( ( $true
!= ( X3 @ X6 ) )
| ( $true
= ( X2 @ X6 ) ) )
| ( $true
!= ( sK1 @ X4 @ X3 ) ) ) )
& ( $true
= ( sK1 @ sK3 @ sK4 ) )
& ! [X9: b] :
( ! [X10: b > $o] :
( ( $true
!= ( sK0 @ X10 ) )
| ( $true
= ( X10 @ X9 ) ) )
| ( ( sK3 @ X9 )
!= $true ) )
& ( $true
= ( sK4 @ sK5 ) )
& ( $true
!= ( sK6 @ sK5 ) )
& ( $true
= ( sK0 @ sK6 ) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3,sK4,sK5,sK6])],[f8,f13,f12,f11,f10,f9]) ).
thf(f9,plain,
( ? [X0: ( b > $o ) > $o,X1: ( b > $o ) > ( b > $o ) > $o] :
( ! [X2: b > $o] :
( ( $true
!= ( X0 @ X2 ) )
| ! [X3: b > $o,X4: b > $o] :
( ? [X5: b] :
( ( ( X4 @ X5 )
= $true )
& ( ( X2 @ X5 )
!= $true ) )
| ! [X6: b] :
( ( $true
!= ( X3 @ X6 ) )
| ( $true
= ( X2 @ X6 ) ) )
| ( $true
!= ( X1 @ X4 @ X3 ) ) ) )
& ? [X7: b > $o,X8: b > $o] :
( ( $true
= ( X1 @ X7 @ X8 ) )
& ! [X9: b] :
( ! [X10: b > $o] :
( ( $true
!= ( X0 @ X10 ) )
| ( $true
= ( X10 @ X9 ) ) )
| ( $true
!= ( X7 @ X9 ) ) )
& ? [X11: b] :
( ( $true
= ( X8 @ X11 ) )
& ? [X12: b > $o] :
( ( $true
!= ( X12 @ X11 ) )
& ( $true
= ( X0 @ X12 ) ) ) ) ) )
=> ( ! [X2: b > $o] :
( ( $true
!= ( sK0 @ X2 ) )
| ! [X4: b > $o,X3: b > $o] :
( ? [X5: b] :
( ( ( X4 @ X5 )
= $true )
& ( ( X2 @ X5 )
!= $true ) )
| ! [X6: b] :
( ( $true
!= ( X3 @ X6 ) )
| ( $true
= ( X2 @ X6 ) ) )
| ( $true
!= ( sK1 @ X4 @ X3 ) ) ) )
& ? [X8: b > $o,X7: b > $o] :
( ( $true
= ( sK1 @ X7 @ X8 ) )
& ! [X9: b] :
( ! [X10: b > $o] :
( ( $true
!= ( sK0 @ X10 ) )
| ( $true
= ( X10 @ X9 ) ) )
| ( $true
!= ( X7 @ X9 ) ) )
& ? [X11: b] :
( ( $true
= ( X8 @ X11 ) )
& ? [X12: b > $o] :
( ( $true
!= ( X12 @ X11 ) )
& ( $true
= ( sK0 @ X12 ) ) ) ) ) ) ),
introduced(choice_axiom,[]) ).
thf(f10,plain,
! [X2: b > $o,X4: b > $o] :
( ? [X5: b] :
( ( ( X4 @ X5 )
= $true )
& ( ( X2 @ X5 )
!= $true ) )
=> ( ( ( X4 @ ( sK2 @ X4 @ X2 ) )
= $true )
& ( $true
!= ( X2 @ ( sK2 @ X4 @ X2 ) ) ) ) ),
introduced(choice_axiom,[]) ).
thf(f11,plain,
( ? [X8: b > $o,X7: b > $o] :
( ( $true
= ( sK1 @ X7 @ X8 ) )
& ! [X9: b] :
( ! [X10: b > $o] :
( ( $true
!= ( sK0 @ X10 ) )
| ( $true
= ( X10 @ X9 ) ) )
| ( $true
!= ( X7 @ X9 ) ) )
& ? [X11: b] :
( ( $true
= ( X8 @ X11 ) )
& ? [X12: b > $o] :
( ( $true
!= ( X12 @ X11 ) )
& ( $true
= ( sK0 @ X12 ) ) ) ) )
=> ( ( $true
= ( sK1 @ sK3 @ sK4 ) )
& ! [X9: b] :
( ! [X10: b > $o] :
( ( $true
!= ( sK0 @ X10 ) )
| ( $true
= ( X10 @ X9 ) ) )
| ( ( sK3 @ X9 )
!= $true ) )
& ? [X11: b] :
( ( $true
= ( sK4 @ X11 ) )
& ? [X12: b > $o] :
( ( $true
!= ( X12 @ X11 ) )
& ( $true
= ( sK0 @ X12 ) ) ) ) ) ),
introduced(choice_axiom,[]) ).
thf(f12,plain,
( ? [X11: b] :
( ( $true
= ( sK4 @ X11 ) )
& ? [X12: b > $o] :
( ( $true
!= ( X12 @ X11 ) )
& ( $true
= ( sK0 @ X12 ) ) ) )
=> ( ( $true
= ( sK4 @ sK5 ) )
& ? [X12: b > $o] :
( ( $true
!= ( X12 @ sK5 ) )
& ( $true
= ( sK0 @ X12 ) ) ) ) ),
introduced(choice_axiom,[]) ).
thf(f13,plain,
( ? [X12: b > $o] :
( ( $true
!= ( X12 @ sK5 ) )
& ( $true
= ( sK0 @ X12 ) ) )
=> ( ( $true
!= ( sK6 @ sK5 ) )
& ( $true
= ( sK0 @ sK6 ) ) ) ),
introduced(choice_axiom,[]) ).
thf(f8,plain,
? [X0: ( b > $o ) > $o,X1: ( b > $o ) > ( b > $o ) > $o] :
( ! [X2: b > $o] :
( ( $true
!= ( X0 @ X2 ) )
| ! [X3: b > $o,X4: b > $o] :
( ? [X5: b] :
( ( ( X4 @ X5 )
= $true )
& ( ( X2 @ X5 )
!= $true ) )
| ! [X6: b] :
( ( $true
!= ( X3 @ X6 ) )
| ( $true
= ( X2 @ X6 ) ) )
| ( $true
!= ( X1 @ X4 @ X3 ) ) ) )
& ? [X7: b > $o,X8: b > $o] :
( ( $true
= ( X1 @ X7 @ X8 ) )
& ! [X9: b] :
( ! [X10: b > $o] :
( ( $true
!= ( X0 @ X10 ) )
| ( $true
= ( X10 @ X9 ) ) )
| ( $true
!= ( X7 @ X9 ) ) )
& ? [X11: b] :
( ( $true
= ( X8 @ X11 ) )
& ? [X12: b > $o] :
( ( $true
!= ( X12 @ X11 ) )
& ( $true
= ( X0 @ X12 ) ) ) ) ) ),
inference(rectify,[],[f7]) ).
thf(f7,plain,
? [X0: ( b > $o ) > $o,X1: ( b > $o ) > ( b > $o ) > $o] :
( ! [X2: b > $o] :
( ( $true
!= ( X0 @ X2 ) )
| ! [X4: b > $o,X3: b > $o] :
( ? [X5: b] :
( ( ( X3 @ X5 )
= $true )
& ( ( X2 @ X5 )
!= $true ) )
| ! [X6: b] :
( ( $true
!= ( X4 @ X6 ) )
| ( $true
= ( X2 @ X6 ) ) )
| ( $true
!= ( X1 @ X3 @ X4 ) ) ) )
& ? [X7: b > $o,X8: b > $o] :
( ( $true
= ( X1 @ X7 @ X8 ) )
& ! [X9: b] :
( ! [X10: b > $o] :
( ( $true
!= ( X0 @ X10 ) )
| ( $true
= ( X10 @ X9 ) ) )
| ( $true
!= ( X7 @ X9 ) ) )
& ? [X11: b] :
( ( $true
= ( X8 @ X11 ) )
& ? [X12: b > $o] :
( ( $true
!= ( X12 @ X11 ) )
& ( $true
= ( X0 @ X12 ) ) ) ) ) ),
inference(flattening,[],[f6]) ).
thf(f6,plain,
? [X1: ( b > $o ) > ( b > $o ) > $o,X0: ( b > $o ) > $o] :
( ? [X8: b > $o,X7: b > $o] :
( ? [X11: b] :
( ( $true
= ( X8 @ X11 ) )
& ? [X12: b > $o] :
( ( $true
!= ( X12 @ X11 ) )
& ( $true
= ( X0 @ X12 ) ) ) )
& ( $true
= ( X1 @ X7 @ X8 ) )
& ! [X9: b] :
( ! [X10: b > $o] :
( ( $true
!= ( X0 @ X10 ) )
| ( $true
= ( X10 @ X9 ) ) )
| ( $true
!= ( X7 @ X9 ) ) ) )
& ! [X2: b > $o] :
( ! [X3: b > $o,X4: b > $o] :
( ! [X6: b] :
( ( $true
!= ( X4 @ X6 ) )
| ( $true
= ( X2 @ X6 ) ) )
| ( $true
!= ( X1 @ X3 @ X4 ) )
| ? [X5: b] :
( ( ( X3 @ X5 )
= $true )
& ( ( X2 @ X5 )
!= $true ) ) )
| ( $true
!= ( X0 @ X2 ) ) ) ),
inference(ennf_transformation,[],[f5]) ).
thf(f5,plain,
~ ! [X1: ( b > $o ) > ( b > $o ) > $o,X0: ( b > $o ) > $o] :
( ! [X2: b > $o] :
( ( $true
= ( X0 @ X2 ) )
=> ! [X3: b > $o,X4: b > $o] :
( ( ( $true
= ( X1 @ X3 @ X4 ) )
& ! [X5: b] :
( ( ( X3 @ X5 )
= $true )
=> ( ( X2 @ X5 )
= $true ) ) )
=> ! [X6: b] :
( ( $true
= ( X4 @ X6 ) )
=> ( $true
= ( X2 @ X6 ) ) ) ) )
=> ! [X8: b > $o,X7: b > $o] :
( ( ( $true
= ( X1 @ X7 @ X8 ) )
& ! [X9: b] :
( ( $true
= ( X7 @ X9 ) )
=> ! [X10: b > $o] :
( ( $true
= ( X0 @ X10 ) )
=> ( $true
= ( X10 @ X9 ) ) ) ) )
=> ! [X11: b] :
( ( $true
= ( X8 @ X11 ) )
=> ! [X12: b > $o] :
( ( $true
= ( X0 @ X12 ) )
=> ( $true
= ( X12 @ X11 ) ) ) ) ) ),
inference(fool_elimination,[],[f4]) ).
thf(f4,plain,
~ ! [X0: ( b > $o ) > $o,X1: ( b > $o ) > ( b > $o ) > $o] :
( ! [X2: b > $o] :
( ( X0 @ X2 )
=> ! [X3: b > $o,X4: b > $o] :
( ( ( X1 @ X3 @ X4 )
& ! [X5: b] :
( ( X3 @ X5 )
=> ( X2 @ X5 ) ) )
=> ! [X6: b] :
( ( X4 @ X6 )
=> ( X2 @ X6 ) ) ) )
=> ! [X7: b > $o,X8: b > $o] :
( ( ! [X9: b] :
( ( X7 @ X9 )
=> ! [X10: b > $o] :
( ( X0 @ X10 )
=> ( X10 @ X9 ) ) )
& ( X1 @ X7 @ X8 ) )
=> ! [X11: b] :
( ( X8 @ X11 )
=> ! [X12: b > $o] :
( ( X0 @ X12 )
=> ( X12 @ X11 ) ) ) ) ),
inference(rectify,[],[f2]) ).
thf(f2,negated_conjecture,
~ ! [X1: ( b > $o ) > $o,X0: ( b > $o ) > ( b > $o ) > $o] :
( ! [X2: b > $o] :
( ( X1 @ X2 )
=> ! [X3: b > $o,X4: b > $o] :
( ( ( X0 @ X3 @ X4 )
& ! [X5: b] :
( ( X3 @ X5 )
=> ( X2 @ X5 ) ) )
=> ! [X5: b] :
( ( X4 @ X5 )
=> ( X2 @ X5 ) ) ) )
=> ! [X3: b > $o,X4: b > $o] :
( ( ! [X2: b] :
( ( X3 @ X2 )
=> ! [X6: b > $o] :
( ( X1 @ X6 )
=> ( X6 @ X2 ) ) )
& ( X0 @ X3 @ X4 ) )
=> ! [X2: b] :
( ( X4 @ X2 )
=> ! [X6: b > $o] :
( ( X1 @ X6 )
=> ( X6 @ X2 ) ) ) ) ),
inference(negated_conjecture,[],[f1]) ).
thf(f1,conjecture,
! [X1: ( b > $o ) > $o,X0: ( b > $o ) > ( b > $o ) > $o] :
( ! [X2: b > $o] :
( ( X1 @ X2 )
=> ! [X3: b > $o,X4: b > $o] :
( ( ( X0 @ X3 @ X4 )
& ! [X5: b] :
( ( X3 @ X5 )
=> ( X2 @ X5 ) ) )
=> ! [X5: b] :
( ( X4 @ X5 )
=> ( X2 @ X5 ) ) ) )
=> ! [X3: b > $o,X4: b > $o] :
( ( ! [X2: b] :
( ( X3 @ X2 )
=> ! [X6: b > $o] :
( ( X1 @ X6 )
=> ( X6 @ X2 ) ) )
& ( X0 @ X3 @ X4 ) )
=> ! [X2: b] :
( ( X4 @ X2 )
=> ! [X6: b > $o] :
( ( X1 @ X6 )
=> ( X6 @ X2 ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cTHM565_pme) ).
thf(f46,plain,
( ! [X0: b,X1: b > $o] :
( ( $true
!= ( sK1 @ sK3 @ X1 ) )
| ( $true
= ( sK6 @ X0 ) )
| ( $true
!= ( X1 @ X0 ) ) )
| ~ spl7_1 ),
inference(trivial_inequality_removal,[],[f45]) ).
thf(f45,plain,
( ! [X0: b,X1: b > $o] :
( ( $true
= ( sK6 @ X0 ) )
| ( $true
!= ( sK1 @ sK3 @ X1 ) )
| ( $true != $true )
| ( $true
!= ( X1 @ X0 ) ) )
| ~ spl7_1 ),
inference(forward_demodulation,[],[f44,f15]) ).
thf(f15,plain,
( $true
= ( sK0 @ sK6 ) ),
inference(cnf_transformation,[],[f14]) ).
thf(f44,plain,
( ! [X0: b,X1: b > $o] :
( ( $true
= ( sK6 @ X0 ) )
| ( $true
!= ( sK1 @ sK3 @ X1 ) )
| ( $true
!= ( sK0 @ sK6 ) )
| ( $true
!= ( X1 @ X0 ) ) )
| ~ spl7_1 ),
inference(trivial_inequality_removal,[],[f43]) ).
thf(f43,plain,
( ! [X0: b,X1: b > $o] :
( ( $true
!= ( sK0 @ sK6 ) )
| ( $true
!= ( sK1 @ sK3 @ X1 ) )
| ( $true
= ( sK6 @ X0 ) )
| ( $true
!= ( X1 @ X0 ) )
| ( $true != $true ) )
| ~ spl7_1 ),
inference(superposition,[],[f20,f42]) ).
thf(f42,plain,
( ( $true
= ( sK6 @ ( sK2 @ sK3 @ sK6 ) ) )
| ~ spl7_1 ),
inference(trivial_inequality_removal,[],[f41]) ).
thf(f41,plain,
( ( $true != $true )
| ( $true
= ( sK6 @ ( sK2 @ sK3 @ sK6 ) ) )
| ~ spl7_1 ),
inference(superposition,[],[f23,f31]) ).
thf(f31,plain,
( ( $true
= ( sK3 @ ( sK2 @ sK3 @ sK6 ) ) )
| ~ spl7_1 ),
inference(avatar_component_clause,[],[f29]) ).
thf(f23,plain,
! [X0: b] :
( ( $true
!= ( sK3 @ X0 ) )
| ( $true
= ( sK6 @ X0 ) ) ),
inference(trivial_inequality_removal,[],[f22]) ).
thf(f22,plain,
! [X0: b] :
( ( $true != $true )
| ( $true
= ( sK6 @ X0 ) )
| ( $true
!= ( sK3 @ X0 ) ) ),
inference(superposition,[],[f18,f15]) ).
thf(f18,plain,
! [X10: b > $o,X9: b] :
( ( $true
!= ( sK0 @ X10 ) )
| ( ( sK3 @ X9 )
!= $true )
| ( $true
= ( X10 @ X9 ) ) ),
inference(cnf_transformation,[],[f14]) ).
thf(f20,plain,
! [X2: b > $o,X3: b > $o,X6: b,X4: b > $o] :
( ( $true
!= ( X2 @ ( sK2 @ X4 @ X2 ) ) )
| ( $true
= ( X2 @ X6 ) )
| ( $true
!= ( X3 @ X6 ) )
| ( $true
!= ( sK0 @ X2 ) )
| ( $true
!= ( sK1 @ X4 @ X3 ) ) ),
inference(cnf_transformation,[],[f14]) ).
thf(f40,plain,
~ spl7_2,
inference(avatar_contradiction_clause,[],[f39]) ).
thf(f39,plain,
( $false
| ~ spl7_2 ),
inference(trivial_inequality_removal,[],[f38]) ).
thf(f38,plain,
( ( $true != $true )
| ~ spl7_2 ),
inference(superposition,[],[f16,f37]) ).
thf(f37,plain,
( ( $true
= ( sK6 @ sK5 ) )
| ~ spl7_2 ),
inference(trivial_inequality_removal,[],[f36]) ).
thf(f36,plain,
( ( $true
= ( sK6 @ sK5 ) )
| ( $true != $true )
| ~ spl7_2 ),
inference(superposition,[],[f34,f17]) ).
thf(f17,plain,
( $true
= ( sK4 @ sK5 ) ),
inference(cnf_transformation,[],[f14]) ).
thf(f34,plain,
( ! [X0: b] :
( ( $true
!= ( sK4 @ X0 ) )
| ( $true
= ( sK6 @ X0 ) ) )
| ~ spl7_2 ),
inference(avatar_component_clause,[],[f33]) ).
thf(f16,plain,
( $true
!= ( sK6 @ sK5 ) ),
inference(cnf_transformation,[],[f14]) ).
thf(f35,plain,
( spl7_1
| spl7_2 ),
inference(avatar_split_clause,[],[f27,f33,f29]) ).
thf(f27,plain,
! [X0: b] :
( ( $true
= ( sK3 @ ( sK2 @ sK3 @ sK6 ) ) )
| ( $true
= ( sK6 @ X0 ) )
| ( $true
!= ( sK4 @ X0 ) ) ),
inference(trivial_inequality_removal,[],[f26]) ).
thf(f26,plain,
! [X0: b] :
( ( $true
= ( sK6 @ X0 ) )
| ( $true
= ( sK3 @ ( sK2 @ sK3 @ sK6 ) ) )
| ( $true
!= ( sK4 @ X0 ) )
| ( $true != $true ) ),
inference(superposition,[],[f25,f15]) ).
thf(f25,plain,
! [X0: b,X1: b > $o] :
( ( $true
!= ( sK0 @ X1 ) )
| ( $true
!= ( sK4 @ X0 ) )
| ( $true
= ( sK3 @ ( sK2 @ sK3 @ X1 ) ) )
| ( $true
= ( X1 @ X0 ) ) ),
inference(trivial_inequality_removal,[],[f24]) ).
thf(f24,plain,
! [X0: b,X1: b > $o] :
( ( $true
= ( sK3 @ ( sK2 @ sK3 @ X1 ) ) )
| ( $true
!= ( sK0 @ X1 ) )
| ( $true != $true )
| ( $true
!= ( sK4 @ X0 ) )
| ( $true
= ( X1 @ X0 ) ) ),
inference(superposition,[],[f21,f19]) ).
thf(f21,plain,
! [X2: b > $o,X3: b > $o,X6: b,X4: b > $o] :
( ( $true
!= ( sK1 @ X4 @ X3 ) )
| ( $true
!= ( X3 @ X6 ) )
| ( $true
!= ( sK0 @ X2 ) )
| ( ( X4 @ ( sK2 @ X4 @ X2 ) )
= $true )
| ( $true
= ( X2 @ X6 ) ) ),
inference(cnf_transformation,[],[f14]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SEV186^5 : TPTP v8.2.0. Released v4.0.0.
% 0.03/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 : n009.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.35 % DateTime : Sun May 19 18:54:23 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 % (15161)lrs+10_1:1_au=on:inj=on:i=2:si=on:rtra=on_0 on theBenchmark for (2999ds/2Mi)
% 0.21/0.37 % (15161)Instruction limit reached!
% 0.21/0.37 % (15161)------------------------------
% 0.21/0.37 % (15161)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.21/0.37 % (15161)Termination reason: Unknown
% 0.21/0.37 % (15161)Termination phase: Preprocessing 3
% 0.21/0.37
% 0.21/0.37 % (15161)Memory used [KB]: 1023
% 0.21/0.37 % (15161)Time elapsed: 0.003 s
% 0.21/0.37 % (15161)Instructions burned: 2 (million)
% 0.21/0.37 % (15161)------------------------------
% 0.21/0.37 % (15161)------------------------------
% 0.21/0.38 % (15158)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.21/0.38 % (15159)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.21/0.38 % (15164)lrs+1004_1:128_cond=on:e2e=on:sp=weighted_frequency:i=18:si=on:rtra=on_0 on theBenchmark for (2999ds/18Mi)
% 0.21/0.38 % (15163)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.21/0.38 % (15162)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.21/0.38 % (15160)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.21/0.38 % (15165)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.21/0.38 % (15162)Instruction limit reached!
% 0.21/0.38 % (15162)------------------------------
% 0.21/0.38 % (15162)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.21/0.38 % (15162)Termination reason: Unknown
% 0.21/0.38 % (15162)Termination phase: Saturation
% 0.21/0.38
% 0.21/0.38 % (15162)Memory used [KB]: 895
% 0.21/0.38 % (15162)Time elapsed: 0.004 s
% 0.21/0.38 % (15162)Instructions burned: 2 (million)
% 0.21/0.38 % (15162)------------------------------
% 0.21/0.38 % (15162)------------------------------
% 0.21/0.38 % (15170)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.21/0.38 % (15165)Instruction limit reached!
% 0.21/0.38 % (15165)------------------------------
% 0.21/0.38 % (15165)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.21/0.38 % (15165)Termination reason: Unknown
% 0.21/0.38 % (15165)Termination phase: Saturation
% 0.21/0.38
% 0.21/0.38 % (15165)Memory used [KB]: 5500
% 0.21/0.38 % (15165)Time elapsed: 0.006 s
% 0.21/0.38 % (15165)Instructions burned: 3 (million)
% 0.21/0.38 % (15159)Instruction limit reached!
% 0.21/0.38 % (15159)------------------------------
% 0.21/0.38 % (15159)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.21/0.38 % (15159)Termination reason: Unknown
% 0.21/0.38 % (15159)Termination phase: Saturation
% 0.21/0.38
% 0.21/0.38 % (15159)Memory used [KB]: 5500
% 0.21/0.38 % (15159)Time elapsed: 0.007 s
% 0.21/0.38 % (15159)Instructions burned: 4 (million)
% 0.21/0.38 % (15159)------------------------------
% 0.21/0.38 % (15159)------------------------------
% 0.21/0.38 % (15165)------------------------------
% 0.21/0.38 % (15165)------------------------------
% 0.21/0.39 % (15160)First to succeed.
% 0.21/0.39 % (15164)Also succeeded, but the first one will report.
% 0.21/0.39 % (15160)Refutation found. Thanks to Tanya!
% 0.21/0.39 % SZS status Theorem for theBenchmark
% 0.21/0.39 % SZS output start Proof for theBenchmark
% See solution above
% 0.21/0.39 % (15160)------------------------------
% 0.21/0.39 % (15160)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.21/0.39 % (15160)Termination reason: Refutation
% 0.21/0.39
% 0.21/0.39 % (15160)Memory used [KB]: 5628
% 0.21/0.39 % (15160)Time elapsed: 0.013 s
% 0.21/0.39 % (15160)Instructions burned: 6 (million)
% 0.21/0.39 % (15160)------------------------------
% 0.21/0.39 % (15160)------------------------------
% 0.21/0.39 % (15157)Success in time 0.025 s
% 0.21/0.39 % Vampire---4.8 exiting
%------------------------------------------------------------------------------