TSTP Solution File: SEV136^5 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SEV136^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/sandbox/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% Computer : n011.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:06 EDT 2024
% Result : Theorem 0.16s 0.36s
% Output : Refutation 0.16s
% Verified :
% SZS Type : Refutation
% Derivation depth : 16
% Number of leaves : 18
% Syntax : Number of formulae : 58 ( 5 unt; 10 typ; 0 def)
% Number of atoms : 495 ( 154 equ; 0 cnn)
% Maximal formula atoms : 24 ( 10 avg)
% Number of connectives : 736 ( 89 ~; 82 |; 62 &; 468 @)
% ( 4 <=>; 31 =>; 0 <=; 0 <~>)
% Maximal formula depth : 17 ( 6 avg)
% Number of types : 2 ( 1 usr)
% Number of type conns : 85 ( 85 >; 0 *; 0 +; 0 <<)
% Number of symbols : 15 ( 12 usr; 8 con; 0-3 aty)
% Number of variables : 146 ( 0 ^ 108 !; 36 ?; 146 :)
% ( 2 !>; 0 ?*; 0 @-; 0 @+)
% Comments :
%------------------------------------------------------------------------------
thf(type_def_5,type,
a: $tType ).
thf(func_def_0,type,
a: $tType ).
thf(func_def_2,type,
vEPSILON:
!>[X0: $tType] : ( ( X0 > $o ) > X0 ) ).
thf(func_def_5,type,
sK0: a > a > $o ).
thf(func_def_6,type,
sK1: ( a > a > $o ) > a > a > $o ).
thf(func_def_7,type,
sK2: a ).
thf(func_def_8,type,
sK3: a ).
thf(func_def_9,type,
sK4: ( a > $o ) > a ).
thf(func_def_10,type,
sK5: ( a > $o ) > a ).
thf(func_def_12,type,
ph7:
!>[X0: $tType] : X0 ).
thf(f66,plain,
$false,
inference(avatar_sat_refutation,[],[f31,f35,f43,f62,f65]) ).
thf(f65,plain,
spl6_4,
inference(avatar_contradiction_clause,[],[f64]) ).
thf(f64,plain,
( $false
| spl6_4 ),
inference(trivial_inequality_removal,[],[f63]) ).
thf(f63,plain,
( ( $true != $true )
| spl6_4 ),
inference(superposition,[],[f61,f13]) ).
thf(f13,plain,
! [X12: a] :
( ( sK1 @ sK0 @ X12 @ X12 )
= $true ),
inference(cnf_transformation,[],[f12]) ).
thf(f12,plain,
( ! [X2: a,X3: a,X4: a] :
( ( $true
!= ( sK1 @ sK0 @ X3 @ X2 ) )
| ( $true
!= ( sK1 @ sK0 @ X4 @ X3 ) )
| ( $true
= ( sK1 @ sK0 @ X4 @ X2 ) ) )
& ! [X5: a,X6: a] :
( ( $true
= ( sK1 @ sK0 @ X6 @ X5 ) )
| ( $true
!= ( sK0 @ X6 @ X5 ) ) )
& ! [X9: a > $o] :
( ( ( ( sK0 @ ( sK5 @ X9 ) @ ( sK4 @ X9 ) )
= $true )
& ( $true
= ( X9 @ ( sK5 @ X9 ) ) )
& ( $true
!= ( X9 @ ( sK4 @ X9 ) ) ) )
| ( ( X9 @ sK2 )
= $true )
| ( ( X9 @ sK3 )
!= $true ) )
& ( ( sK1 @ sK0 @ sK3 @ sK2 )
!= $true )
& ! [X12: a] :
( ( sK1 @ sK0 @ X12 @ X12 )
= $true ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3,sK4,sK5])],[f8,f11,f10,f9]) ).
thf(f9,plain,
( ? [X0: a > a > $o,X1: ( a > a > $o ) > a > a > $o] :
( ! [X2: a,X3: a,X4: a] :
( ( $true
!= ( X1 @ X0 @ X3 @ X2 ) )
| ( $true
!= ( X1 @ X0 @ X4 @ X3 ) )
| ( ( X1 @ X0 @ X4 @ X2 )
= $true ) )
& ! [X5: a,X6: a] :
( ( $true
= ( X1 @ X0 @ X6 @ X5 ) )
| ( ( X0 @ X6 @ X5 )
!= $true ) )
& ? [X7: a,X8: a] :
( ! [X9: a > $o] :
( ? [X10: a,X11: a] :
( ( $true
= ( X0 @ X11 @ X10 ) )
& ( $true
= ( X9 @ X11 ) )
& ( $true
!= ( X9 @ X10 ) ) )
| ( $true
= ( X9 @ X7 ) )
| ( $true
!= ( X9 @ X8 ) ) )
& ( ( X1 @ X0 @ X8 @ X7 )
!= $true ) )
& ! [X12: a] :
( ( X1 @ X0 @ X12 @ X12 )
= $true ) )
=> ( ! [X4: a,X3: a,X2: a] :
( ( $true
!= ( sK1 @ sK0 @ X3 @ X2 ) )
| ( $true
!= ( sK1 @ sK0 @ X4 @ X3 ) )
| ( $true
= ( sK1 @ sK0 @ X4 @ X2 ) ) )
& ! [X6: a,X5: a] :
( ( $true
= ( sK1 @ sK0 @ X6 @ X5 ) )
| ( $true
!= ( sK0 @ X6 @ X5 ) ) )
& ? [X8: a,X7: a] :
( ! [X9: a > $o] :
( ? [X11: a,X10: a] :
( ( ( sK0 @ X11 @ X10 )
= $true )
& ( $true
= ( X9 @ X11 ) )
& ( $true
!= ( X9 @ X10 ) ) )
| ( $true
= ( X9 @ X7 ) )
| ( $true
!= ( X9 @ X8 ) ) )
& ( $true
!= ( sK1 @ sK0 @ X8 @ X7 ) ) )
& ! [X12: a] :
( ( sK1 @ sK0 @ X12 @ X12 )
= $true ) ) ),
introduced(choice_axiom,[]) ).
thf(f10,plain,
( ? [X8: a,X7: a] :
( ! [X9: a > $o] :
( ? [X11: a,X10: a] :
( ( ( sK0 @ X11 @ X10 )
= $true )
& ( $true
= ( X9 @ X11 ) )
& ( $true
!= ( X9 @ X10 ) ) )
| ( $true
= ( X9 @ X7 ) )
| ( $true
!= ( X9 @ X8 ) ) )
& ( $true
!= ( sK1 @ sK0 @ X8 @ X7 ) ) )
=> ( ! [X9: a > $o] :
( ? [X11: a,X10: a] :
( ( ( sK0 @ X11 @ X10 )
= $true )
& ( $true
= ( X9 @ X11 ) )
& ( $true
!= ( X9 @ X10 ) ) )
| ( ( X9 @ sK2 )
= $true )
| ( ( X9 @ sK3 )
!= $true ) )
& ( ( sK1 @ sK0 @ sK3 @ sK2 )
!= $true ) ) ),
introduced(choice_axiom,[]) ).
thf(f11,plain,
! [X9: a > $o] :
( ? [X11: a,X10: a] :
( ( ( sK0 @ X11 @ X10 )
= $true )
& ( $true
= ( X9 @ X11 ) )
& ( $true
!= ( X9 @ X10 ) ) )
=> ( ( ( sK0 @ ( sK5 @ X9 ) @ ( sK4 @ X9 ) )
= $true )
& ( $true
= ( X9 @ ( sK5 @ X9 ) ) )
& ( $true
!= ( X9 @ ( sK4 @ X9 ) ) ) ) ),
introduced(choice_axiom,[]) ).
thf(f8,plain,
? [X0: a > a > $o,X1: ( a > a > $o ) > a > a > $o] :
( ! [X2: a,X3: a,X4: a] :
( ( $true
!= ( X1 @ X0 @ X3 @ X2 ) )
| ( $true
!= ( X1 @ X0 @ X4 @ X3 ) )
| ( ( X1 @ X0 @ X4 @ X2 )
= $true ) )
& ! [X5: a,X6: a] :
( ( $true
= ( X1 @ X0 @ X6 @ X5 ) )
| ( ( X0 @ X6 @ X5 )
!= $true ) )
& ? [X7: a,X8: a] :
( ! [X9: a > $o] :
( ? [X10: a,X11: a] :
( ( $true
= ( X0 @ X11 @ X10 ) )
& ( $true
= ( X9 @ X11 ) )
& ( $true
!= ( X9 @ X10 ) ) )
| ( $true
= ( X9 @ X7 ) )
| ( $true
!= ( X9 @ X8 ) ) )
& ( ( X1 @ X0 @ X8 @ X7 )
!= $true ) )
& ! [X12: a] :
( ( X1 @ X0 @ X12 @ X12 )
= $true ) ),
inference(rectify,[],[f7]) ).
thf(f7,plain,
? [X0: a > a > $o,X1: ( a > a > $o ) > a > a > $o] :
( ! [X5: a,X7: a,X6: a] :
( ( $true
!= ( X1 @ X0 @ X7 @ X5 ) )
| ( $true
!= ( X1 @ X0 @ X6 @ X7 ) )
| ( $true
= ( X1 @ X0 @ X6 @ X5 ) ) )
& ! [X3: a,X4: a] :
( ( $true
= ( X1 @ X0 @ X4 @ X3 ) )
| ( ( X0 @ X4 @ X3 )
!= $true ) )
& ? [X8: a,X9: a] :
( ! [X10: a > $o] :
( ? [X12: a,X11: a] :
( ( $true
= ( X0 @ X11 @ X12 ) )
& ( $true
= ( X10 @ X11 ) )
& ( $true
!= ( X10 @ X12 ) ) )
| ( ( X10 @ X8 )
= $true )
| ( $true
!= ( X10 @ X9 ) ) )
& ( $true
!= ( X1 @ X0 @ X9 @ X8 ) ) )
& ! [X2: a] :
( ( X1 @ X0 @ X2 @ X2 )
= $true ) ),
inference(flattening,[],[f6]) ).
thf(f6,plain,
? [X0: a > a > $o,X1: ( a > a > $o ) > a > a > $o] :
( ? [X9: a,X8: a] :
( ( $true
!= ( X1 @ X0 @ X9 @ X8 ) )
& ! [X10: a > $o] :
( ( ( X10 @ X8 )
= $true )
| ( $true
!= ( X10 @ X9 ) )
| ? [X12: a,X11: a] :
( ( $true
!= ( X10 @ X12 ) )
& ( $true
= ( X10 @ X11 ) )
& ( $true
= ( X0 @ X11 @ X12 ) ) ) ) )
& ! [X3: a,X4: a] :
( ( $true
= ( X1 @ X0 @ X4 @ X3 ) )
| ( ( X0 @ X4 @ X3 )
!= $true ) )
& ! [X7: a,X6: a,X5: a] :
( ( $true
= ( X1 @ X0 @ X6 @ X5 ) )
| ( $true
!= ( X1 @ X0 @ X7 @ X5 ) )
| ( $true
!= ( X1 @ X0 @ X6 @ X7 ) ) )
& ! [X2: a] :
( ( X1 @ X0 @ X2 @ X2 )
= $true ) ),
inference(ennf_transformation,[],[f5]) ).
thf(f5,plain,
~ ! [X0: a > a > $o,X1: ( a > a > $o ) > a > a > $o] :
( ( ! [X3: a,X4: a] :
( ( ( X0 @ X4 @ X3 )
= $true )
=> ( $true
= ( X1 @ X0 @ X4 @ X3 ) ) )
& ! [X7: a,X6: a,X5: a] :
( ( ( $true
= ( X1 @ X0 @ X7 @ X5 ) )
& ( $true
= ( X1 @ X0 @ X6 @ X7 ) ) )
=> ( $true
= ( X1 @ X0 @ X6 @ X5 ) ) )
& ! [X2: a] :
( ( X1 @ X0 @ X2 @ X2 )
= $true ) )
=> ! [X9: a,X8: a] :
( ! [X10: a > $o] :
( ! [X12: a,X11: a] :
( ( ( $true
= ( X10 @ X11 ) )
& ( $true
= ( X0 @ X11 @ X12 ) ) )
=> ( $true
= ( X10 @ X12 ) ) )
=> ( ( $true
= ( X10 @ X9 ) )
=> ( ( X10 @ X8 )
= $true ) ) )
=> ( $true
= ( X1 @ X0 @ X9 @ X8 ) ) ) ),
inference(fool_elimination,[],[f4]) ).
thf(f4,plain,
~ ! [X0: a > a > $o,X1: ( a > a > $o ) > a > a > $o] :
( ( ! [X2: a] : ( X1 @ X0 @ X2 @ X2 )
& ! [X3: a,X4: a] :
( ( X0 @ X4 @ X3 )
=> ( X1 @ X0 @ X4 @ X3 ) )
& ! [X5: a,X6: a,X7: a] :
( ( ( X1 @ X0 @ X7 @ X5 )
& ( X1 @ X0 @ X6 @ X7 ) )
=> ( X1 @ X0 @ X6 @ X5 ) ) )
=> ! [X8: a,X9: a] :
( ! [X10: a > $o] :
( ! [X11: a,X12: a] :
( ( ( X10 @ X11 )
& ( X0 @ X11 @ X12 ) )
=> ( X10 @ X12 ) )
=> ( ( X10 @ X9 )
=> ( X10 @ X8 ) ) )
=> ( X1 @ X0 @ X9 @ X8 ) ) ),
inference(rectify,[],[f2]) ).
thf(f2,negated_conjecture,
~ ! [X0: a > a > $o,X1: ( a > a > $o ) > a > a > $o] :
( ( ! [X2: a] : ( X1 @ X0 @ X2 @ X2 )
& ! [X3: a,X2: a] :
( ( X0 @ X2 @ X3 )
=> ( X1 @ X0 @ X2 @ X3 ) )
& ! [X4: a,X2: a,X3: a] :
( ( ( X1 @ X0 @ X3 @ X4 )
& ( X1 @ X0 @ X2 @ X3 ) )
=> ( X1 @ X0 @ X2 @ X4 ) ) )
=> ! [X3: a,X2: a] :
( ! [X5: a > $o] :
( ! [X6: a,X4: a] :
( ( ( X5 @ X6 )
& ( X0 @ X6 @ X4 ) )
=> ( X5 @ X4 ) )
=> ( ( X5 @ X2 )
=> ( X5 @ X3 ) ) )
=> ( X1 @ X0 @ X2 @ X3 ) ) ),
inference(negated_conjecture,[],[f1]) ).
thf(f1,conjecture,
! [X0: a > a > $o,X1: ( a > a > $o ) > a > a > $o] :
( ( ! [X2: a] : ( X1 @ X0 @ X2 @ X2 )
& ! [X3: a,X2: a] :
( ( X0 @ X2 @ X3 )
=> ( X1 @ X0 @ X2 @ X3 ) )
& ! [X4: a,X2: a,X3: a] :
( ( ( X1 @ X0 @ X3 @ X4 )
& ( X1 @ X0 @ X2 @ X3 ) )
=> ( X1 @ X0 @ X2 @ X4 ) ) )
=> ! [X3: a,X2: a] :
( ! [X5: a > $o] :
( ! [X6: a,X4: a] :
( ( ( X5 @ X6 )
& ( X0 @ X6 @ X4 ) )
=> ( X5 @ X4 ) )
=> ( ( X5 @ X2 )
=> ( X5 @ X3 ) ) )
=> ( X1 @ X0 @ X2 @ X3 ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cTHM203_pme) ).
thf(f61,plain,
( ( $true
!= ( sK1 @ sK0 @ sK3 @ sK3 ) )
| spl6_4 ),
inference(avatar_component_clause,[],[f59]) ).
thf(f59,plain,
( spl6_4
<=> ( $true
= ( sK1 @ sK0 @ sK3 @ sK3 ) ) ),
introduced(avatar_definition,[new_symbols(naming,[spl6_4])]) ).
thf(f62,plain,
( spl6_2
| ~ spl6_4
| ~ spl6_1
| ~ spl6_3 ),
inference(avatar_split_clause,[],[f56,f40,f24,f59,f28]) ).
thf(f28,plain,
( spl6_2
<=> ( ( sK1 @ sK0 @ sK3 @ sK2 )
= $true ) ),
introduced(avatar_definition,[new_symbols(naming,[spl6_2])]) ).
thf(f24,plain,
( spl6_1
<=> ( ( sK1 @ sK0 @ sK3 @ ( sK5 @ ( sK1 @ sK0 @ sK3 ) ) )
= $true ) ),
introduced(avatar_definition,[new_symbols(naming,[spl6_1])]) ).
thf(f40,plain,
( spl6_3
<=> ( $true
= ( sK0 @ ( sK5 @ ( sK1 @ sK0 @ sK3 ) ) @ ( sK4 @ ( sK1 @ sK0 @ sK3 ) ) ) ) ),
introduced(avatar_definition,[new_symbols(naming,[spl6_3])]) ).
thf(f56,plain,
( ( $true
!= ( sK1 @ sK0 @ sK3 @ sK3 ) )
| ( ( sK1 @ sK0 @ sK3 @ sK2 )
= $true )
| ~ spl6_1
| ~ spl6_3 ),
inference(trivial_inequality_removal,[],[f55]) ).
thf(f55,plain,
( ( $true != $true )
| ( ( sK1 @ sK0 @ sK3 @ sK2 )
= $true )
| ( $true
!= ( sK1 @ sK0 @ sK3 @ sK3 ) )
| ~ spl6_1
| ~ spl6_3 ),
inference(superposition,[],[f15,f52]) ).
thf(f52,plain,
( ( ( sK1 @ sK0 @ sK3 @ ( sK4 @ ( sK1 @ sK0 @ sK3 ) ) )
= $true )
| ~ spl6_1
| ~ spl6_3 ),
inference(trivial_inequality_removal,[],[f50]) ).
thf(f50,plain,
( ( ( sK1 @ sK0 @ sK3 @ ( sK4 @ ( sK1 @ sK0 @ sK3 ) ) )
= $true )
| ( $true != $true )
| ~ spl6_1
| ~ spl6_3 ),
inference(superposition,[],[f45,f47]) ).
thf(f47,plain,
( ( $true
= ( sK1 @ sK0 @ ( sK5 @ ( sK1 @ sK0 @ sK3 ) ) @ ( sK4 @ ( sK1 @ sK0 @ sK3 ) ) ) )
| ~ spl6_3 ),
inference(trivial_inequality_removal,[],[f46]) ).
thf(f46,plain,
( ( $true
= ( sK1 @ sK0 @ ( sK5 @ ( sK1 @ sK0 @ sK3 ) ) @ ( sK4 @ ( sK1 @ sK0 @ sK3 ) ) ) )
| ( $true != $true )
| ~ spl6_3 ),
inference(superposition,[],[f18,f42]) ).
thf(f42,plain,
( ( $true
= ( sK0 @ ( sK5 @ ( sK1 @ sK0 @ sK3 ) ) @ ( sK4 @ ( sK1 @ sK0 @ sK3 ) ) ) )
| ~ spl6_3 ),
inference(avatar_component_clause,[],[f40]) ).
thf(f18,plain,
! [X6: a,X5: a] :
( ( $true
!= ( sK0 @ X6 @ X5 ) )
| ( $true
= ( sK1 @ sK0 @ X6 @ X5 ) ) ),
inference(cnf_transformation,[],[f12]) ).
thf(f45,plain,
( ! [X0: a] :
( ( $true
!= ( sK1 @ sK0 @ ( sK5 @ ( sK1 @ sK0 @ sK3 ) ) @ X0 ) )
| ( $true
= ( sK1 @ sK0 @ sK3 @ X0 ) ) )
| ~ spl6_1 ),
inference(trivial_inequality_removal,[],[f44]) ).
thf(f44,plain,
( ! [X0: a] :
( ( $true
!= ( sK1 @ sK0 @ ( sK5 @ ( sK1 @ sK0 @ sK3 ) ) @ X0 ) )
| ( $true
= ( sK1 @ sK0 @ sK3 @ X0 ) )
| ( $true != $true ) )
| ~ spl6_1 ),
inference(superposition,[],[f19,f26]) ).
thf(f26,plain,
( ( ( sK1 @ sK0 @ sK3 @ ( sK5 @ ( sK1 @ sK0 @ sK3 ) ) )
= $true )
| ~ spl6_1 ),
inference(avatar_component_clause,[],[f24]) ).
thf(f19,plain,
! [X2: a,X3: a,X4: a] :
( ( $true
!= ( sK1 @ sK0 @ X4 @ X3 ) )
| ( $true
!= ( sK1 @ sK0 @ X3 @ X2 ) )
| ( $true
= ( sK1 @ sK0 @ X4 @ X2 ) ) ),
inference(cnf_transformation,[],[f12]) ).
thf(f15,plain,
! [X9: a > $o] :
( ( $true
!= ( X9 @ ( sK4 @ X9 ) ) )
| ( ( X9 @ sK3 )
!= $true )
| ( ( X9 @ sK2 )
= $true ) ),
inference(cnf_transformation,[],[f12]) ).
thf(f43,plain,
( spl6_2
| spl6_3 ),
inference(avatar_split_clause,[],[f38,f40,f28]) ).
thf(f38,plain,
( ( ( sK1 @ sK0 @ sK3 @ sK2 )
= $true )
| ( $true
= ( sK0 @ ( sK5 @ ( sK1 @ sK0 @ sK3 ) ) @ ( sK4 @ ( sK1 @ sK0 @ sK3 ) ) ) ) ),
inference(trivial_inequality_removal,[],[f37]) ).
thf(f37,plain,
( ( $true
= ( sK0 @ ( sK5 @ ( sK1 @ sK0 @ sK3 ) ) @ ( sK4 @ ( sK1 @ sK0 @ sK3 ) ) ) )
| ( ( sK1 @ sK0 @ sK3 @ sK2 )
= $true )
| ( $true != $true ) ),
inference(superposition,[],[f17,f13]) ).
thf(f17,plain,
! [X9: a > $o] :
( ( ( X9 @ sK3 )
!= $true )
| ( ( X9 @ sK2 )
= $true )
| ( ( sK0 @ ( sK5 @ X9 ) @ ( sK4 @ X9 ) )
= $true ) ),
inference(cnf_transformation,[],[f12]) ).
thf(f35,plain,
~ spl6_2,
inference(avatar_contradiction_clause,[],[f34]) ).
thf(f34,plain,
( $false
| ~ spl6_2 ),
inference(trivial_inequality_removal,[],[f32]) ).
thf(f32,plain,
( ( $true != $true )
| ~ spl6_2 ),
inference(superposition,[],[f14,f30]) ).
thf(f30,plain,
( ( ( sK1 @ sK0 @ sK3 @ sK2 )
= $true )
| ~ spl6_2 ),
inference(avatar_component_clause,[],[f28]) ).
thf(f14,plain,
( ( sK1 @ sK0 @ sK3 @ sK2 )
!= $true ),
inference(cnf_transformation,[],[f12]) ).
thf(f31,plain,
( spl6_1
| spl6_2 ),
inference(avatar_split_clause,[],[f22,f28,f24]) ).
thf(f22,plain,
( ( ( sK1 @ sK0 @ sK3 @ sK2 )
= $true )
| ( ( sK1 @ sK0 @ sK3 @ ( sK5 @ ( sK1 @ sK0 @ sK3 ) ) )
= $true ) ),
inference(trivial_inequality_removal,[],[f21]) ).
thf(f21,plain,
( ( $true != $true )
| ( ( sK1 @ sK0 @ sK3 @ ( sK5 @ ( sK1 @ sK0 @ sK3 ) ) )
= $true )
| ( ( sK1 @ sK0 @ sK3 @ sK2 )
= $true ) ),
inference(superposition,[],[f16,f13]) ).
thf(f16,plain,
! [X9: a > $o] :
( ( ( X9 @ sK3 )
!= $true )
| ( $true
= ( X9 @ ( sK5 @ X9 ) ) )
| ( ( X9 @ sK2 )
= $true ) ),
inference(cnf_transformation,[],[f12]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.10 % Problem : SEV136^5 : TPTP v8.2.0. Released v4.0.0.
% 0.10/0.11 % Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% 0.10/0.32 % Computer : n011.cluster.edu
% 0.10/0.32 % Model : x86_64 x86_64
% 0.10/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.32 % Memory : 8042.1875MB
% 0.10/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.32 % CPULimit : 300
% 0.10/0.32 % WCLimit : 300
% 0.10/0.32 % DateTime : Sun May 19 18:59:08 EDT 2024
% 0.10/0.32 % CPUTime :
% 0.10/0.32 This is a TH0_THM_NEQ_NAR problem
% 0.10/0.32 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/sandbox/benchmark/theBenchmark.p
% 0.16/0.33 % (4352)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.16/0.33 % (4351)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.16/0.33 % (4355)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.16/0.33 % (4355)Instruction limit reached!
% 0.16/0.33 % (4355)------------------------------
% 0.16/0.33 % (4355)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.16/0.33 % (4355)Termination reason: Unknown
% 0.16/0.33 % (4355)Termination phase: shuffling
% 0.16/0.33
% 0.16/0.33 % (4355)Memory used [KB]: 895
% 0.16/0.33 % (4355)Time elapsed: 0.002 s
% 0.16/0.33 % (4355)Instructions burned: 2 (million)
% 0.16/0.33 % (4355)------------------------------
% 0.16/0.33 % (4355)------------------------------
% 0.16/0.34 % (4354)lrs+10_1:1_au=on:inj=on:i=2:si=on:rtra=on_0 on theBenchmark for (3000ds/2Mi)
% 0.16/0.34 % (4354)Instruction limit reached!
% 0.16/0.34 % (4354)------------------------------
% 0.16/0.34 % (4354)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.16/0.34 % (4354)Termination reason: Unknown
% 0.16/0.34 % (4354)Termination phase: Saturation
% 0.16/0.34
% 0.16/0.34 % (4354)Memory used [KB]: 5500
% 0.16/0.34 % (4354)Time elapsed: 0.003 s
% 0.16/0.34 % (4354)Instructions burned: 3 (million)
% 0.16/0.34 % (4354)------------------------------
% 0.16/0.34 % (4354)------------------------------
% 0.16/0.34 % (4356)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.16/0.34 % (4357)lrs+1004_1:128_cond=on:e2e=on:sp=weighted_frequency:i=18:si=on:rtra=on_0 on theBenchmark for (3000ds/18Mi)
% 0.16/0.34 % (4358)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.16/0.34 % (4358)Instruction limit reached!
% 0.16/0.34 % (4358)------------------------------
% 0.16/0.34 % (4358)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.16/0.34 % (4358)Termination reason: Unknown
% 0.16/0.34 % (4358)Termination phase: Saturation
% 0.16/0.34
% 0.16/0.34 % (4358)Memory used [KB]: 5500
% 0.16/0.34 % (4358)Time elapsed: 0.003 s
% 0.16/0.34 % (4358)Instructions burned: 3 (million)
% 0.16/0.34 % (4358)------------------------------
% 0.16/0.34 % (4358)------------------------------
% 0.16/0.34 % (4352)Instruction limit reached!
% 0.16/0.34 % (4352)------------------------------
% 0.16/0.34 % (4352)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.16/0.34 % (4352)Termination reason: Unknown
% 0.16/0.34 % (4352)Termination phase: Saturation
% 0.16/0.34
% 0.16/0.34 % (4352)Memory used [KB]: 5500
% 0.16/0.34 % (4352)Time elapsed: 0.004 s
% 0.16/0.34 % (4352)Instructions burned: 5 (million)
% 0.16/0.34 % (4352)------------------------------
% 0.16/0.34 % (4352)------------------------------
% 0.16/0.35 % (4357)Instruction limit reached!
% 0.16/0.35 % (4357)------------------------------
% 0.16/0.35 % (4357)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.16/0.35 % (4357)Termination reason: Unknown
% 0.16/0.35 % (4357)Termination phase: Saturation
% 0.16/0.35
% 0.16/0.35 % (4357)Memory used [KB]: 5628
% 0.16/0.35 % (4357)Time elapsed: 0.008 s
% 0.16/0.35 % (4357)Instructions burned: 19 (million)
% 0.16/0.35 % (4357)------------------------------
% 0.16/0.35 % (4357)------------------------------
% 0.16/0.35 % (4359)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.16/0.35 % (4353)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.16/0.35 % (4360)lrs+2_16:1_acc=model:au=on:bd=off:c=on:e2e=on:nm=2:sos=all:i=15:si=on:rtra=on_0 on theBenchmark for (2999ds/15Mi)
% 0.16/0.35 % (4353)First to succeed.
% 0.16/0.35 % (4362)lrs+1002_1:1_aac=none:au=on:cnfonf=lazy_gen:plsq=on:plsqc=1:plsqr=4203469,65536:i=1041:si=on:rtra=on_0 on theBenchmark for (2999ds/1041Mi)
% 0.16/0.36 % (4353)Refutation found. Thanks to Tanya!
% 0.16/0.36 % SZS status Theorem for theBenchmark
% 0.16/0.36 % SZS output start Proof for theBenchmark
% See solution above
% 0.16/0.36 % (4353)------------------------------
% 0.16/0.36 % (4353)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.16/0.36 % (4353)Termination reason: Refutation
% 0.16/0.36
% 0.16/0.36 % (4353)Memory used [KB]: 5628
% 0.16/0.36 % (4353)Time elapsed: 0.031 s
% 0.16/0.36 % (4353)Instructions burned: 9 (million)
% 0.16/0.36 % (4353)------------------------------
% 0.16/0.36 % (4353)------------------------------
% 0.16/0.36 % (4350)Success in time 0.031 s
% 0.16/0.36 % Vampire---4.8 exiting
%------------------------------------------------------------------------------