TSTP Solution File: SEV089^5 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SEV089^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 : n016.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:56 EDT 2024
% Result : Theorem 1.89s 0.60s
% Output : Refutation 1.89s
% Verified :
% SZS Type : Refutation
% Derivation depth : 40
% Number of leaves : 21
% Syntax : Number of formulae : 162 ( 2 unt; 11 typ; 0 def)
% Number of atoms : 1094 ( 544 equ; 13 cnn)
% Maximal formula atoms : 16 ( 7 avg)
% Number of connectives : 1701 ( 182 ~; 290 |; 107 &;1088 @)
% ( 4 <=>; 30 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 5 avg)
% Number of types : 2 ( 1 usr)
% Number of type conns : 104 ( 104 >; 0 *; 0 +; 0 <<)
% Number of symbols : 17 ( 13 usr; 7 con; 0-2 aty)
% Number of variables : 365 ( 107 ^ 209 !; 48 ?; 365 :)
% ( 1 !>; 0 ?*; 0 @-; 0 @+)
% Comments :
%------------------------------------------------------------------------------
thf(type_def_5,type,
a: $tType ).
thf(func_def_0,type,
a: $tType ).
thf(func_def_9,type,
sK0: a > $o ).
thf(func_def_10,type,
sK1: a > $o ).
thf(func_def_11,type,
sK2: a > a ).
thf(func_def_12,type,
sK3: a > a ).
thf(func_def_13,type,
sK4: ( a > a ) > a ).
thf(func_def_14,type,
sK5: ( a > a ) > a ).
thf(func_def_16,type,
ph7:
!>[X0: $tType] : X0 ).
thf(func_def_17,type,
sK8: a > ( a > a ) > a ).
thf(func_def_18,type,
sK9: a > ( a > a ) > a ).
thf(f1110,plain,
$false,
inference(avatar_sat_refutation,[],[f445,f899,f1043,f1045,f1109]) ).
thf(f1109,plain,
( spl6_3
| spl6_19 ),
inference(avatar_contradiction_clause,[],[f1108]) ).
thf(f1108,plain,
( $false
| spl6_3
| spl6_19 ),
inference(subsumption_resolution,[],[f1104,f111]) ).
thf(f111,plain,
( ( $true
!= ( sK1 @ ( sK4 @ sK3 ) ) )
| spl6_3 ),
inference(avatar_component_clause,[],[f110]) ).
thf(f110,plain,
( spl6_3
<=> ( $true
= ( sK1 @ ( sK4 @ sK3 ) ) ) ),
introduced(avatar_definition,[new_symbols(naming,[spl6_3])]) ).
thf(f1104,plain,
( ( $true
= ( sK1 @ ( sK4 @ sK3 ) ) )
| spl6_3
| spl6_19 ),
inference(trivial_inequality_removal,[],[f1101]) ).
thf(f1101,plain,
( ( $true
= ( sK1 @ ( sK4 @ sK3 ) ) )
| ( $false = $true )
| spl6_3
| spl6_19 ),
inference(superposition,[],[f1100,f16]) ).
thf(f16,plain,
! [X6: a > a] :
( ( $true
= ( sK0 @ ( sK5 @ X6 ) ) )
| ( ( sK1 @ ( sK4 @ X6 ) )
= $true ) ),
inference(cnf_transformation,[],[f14]) ).
thf(f14,plain,
( ! [X3: a] :
( ( $true
!= ( sK0 @ X3 ) )
| ( $true
= ( sK1 @ ( sK2 @ X3 ) ) ) )
& ! [X4: a] :
( ( ( ^ [Y0: a] :
( ( sK0 @ Y0 )
& ( ( sK2 @ Y0 )
= X4 ) ) )
= ( ^ [Y0: a,Y1: a] : ( Y0 = Y1 )
@ ( sK3 @ X4 ) ) )
| ( ( sK1 @ X4 )
!= $true ) )
& ! [X6: a > a] :
( ( ( ( sK0 @ ( X6 @ ( sK4 @ X6 ) ) )
!= $true )
& ( ( sK1 @ ( sK4 @ X6 ) )
= $true ) )
| ( ( $true
= ( sK0 @ ( sK5 @ X6 ) ) )
& ! [X9: a] :
( ( ^ [Y0: a,Y1: a] : ( Y0 = Y1 )
@ X9 )
!= ( ^ [Y0: a] :
( ( ( X6 @ Y0 )
= ( sK5 @ X6 ) )
& ( sK1 @ Y0 ) ) ) ) ) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3,sK4,sK5])],[f8,f13,f12,f11,f10,f9]) ).
thf(f9,plain,
( ? [X0: a > $o,X1: a > $o] :
( ? [X2: a > a] :
( ! [X3: a] :
( ( ( X0 @ X3 )
!= $true )
| ( ( X1 @ ( X2 @ X3 ) )
= $true ) )
& ! [X4: a] :
( ? [X5: a] :
( ( ^ [Y0: a] :
( ( X0 @ Y0 )
& ( ( X2 @ Y0 )
= X4 ) ) )
= ( ^ [Y0: a,Y1: a] : ( Y0 = Y1 )
@ X5 ) )
| ( ( X1 @ X4 )
!= $true ) ) )
& ! [X6: a > a] :
( ? [X7: a] :
( ( $true
!= ( X0 @ ( X6 @ X7 ) ) )
& ( ( X1 @ X7 )
= $true ) )
| ? [X8: a] :
( ( ( X0 @ X8 )
= $true )
& ! [X9: a] :
( ( ^ [Y0: a,Y1: a] : ( Y0 = Y1 )
@ X9 )
!= ( ^ [Y0: a] :
( ( ( X6 @ Y0 )
= X8 )
& ( X1 @ Y0 ) ) ) ) ) ) )
=> ( ? [X2: a > a] :
( ! [X3: a] :
( ( $true
!= ( sK0 @ X3 ) )
| ( $true
= ( sK1 @ ( X2 @ X3 ) ) ) )
& ! [X4: a] :
( ? [X5: a] :
( ( ^ [Y0: a] :
( ( sK0 @ Y0 )
& ( ( X2 @ Y0 )
= X4 ) ) )
= ( ^ [Y0: a,Y1: a] : ( Y0 = Y1 )
@ X5 ) )
| ( ( sK1 @ X4 )
!= $true ) ) )
& ! [X6: a > a] :
( ? [X7: a] :
( ( $true
!= ( sK0 @ ( X6 @ X7 ) ) )
& ( ( sK1 @ X7 )
= $true ) )
| ? [X8: a] :
( ( $true
= ( sK0 @ X8 ) )
& ! [X9: a] :
( ( ^ [Y0: a,Y1: a] : ( Y0 = Y1 )
@ X9 )
!= ( ^ [Y0: a] :
( ( ( X6 @ Y0 )
= X8 )
& ( sK1 @ Y0 ) ) ) ) ) ) ) ),
introduced(choice_axiom,[]) ).
thf(f10,plain,
( ? [X2: a > a] :
( ! [X3: a] :
( ( $true
!= ( sK0 @ X3 ) )
| ( $true
= ( sK1 @ ( X2 @ X3 ) ) ) )
& ! [X4: a] :
( ? [X5: a] :
( ( ^ [Y0: a] :
( ( sK0 @ Y0 )
& ( ( X2 @ Y0 )
= X4 ) ) )
= ( ^ [Y0: a,Y1: a] : ( Y0 = Y1 )
@ X5 ) )
| ( ( sK1 @ X4 )
!= $true ) ) )
=> ( ! [X3: a] :
( ( $true
!= ( sK0 @ X3 ) )
| ( $true
= ( sK1 @ ( sK2 @ X3 ) ) ) )
& ! [X4: a] :
( ? [X5: a] :
( ( ^ [Y0: a] :
( ( sK0 @ Y0 )
& ( ( sK2 @ Y0 )
= X4 ) ) )
= ( ^ [Y0: a,Y1: a] : ( Y0 = Y1 )
@ X5 ) )
| ( ( sK1 @ X4 )
!= $true ) ) ) ),
introduced(choice_axiom,[]) ).
thf(f11,plain,
! [X4: a] :
( ? [X5: a] :
( ( ^ [Y0: a] :
( ( sK0 @ Y0 )
& ( ( sK2 @ Y0 )
= X4 ) ) )
= ( ^ [Y0: a,Y1: a] : ( Y0 = Y1 )
@ X5 ) )
=> ( ( ^ [Y0: a] :
( ( sK0 @ Y0 )
& ( ( sK2 @ Y0 )
= X4 ) ) )
= ( ^ [Y0: a,Y1: a] : ( Y0 = Y1 )
@ ( sK3 @ X4 ) ) ) ),
introduced(choice_axiom,[]) ).
thf(f12,plain,
! [X6: a > a] :
( ? [X7: a] :
( ( $true
!= ( sK0 @ ( X6 @ X7 ) ) )
& ( ( sK1 @ X7 )
= $true ) )
=> ( ( ( sK0 @ ( X6 @ ( sK4 @ X6 ) ) )
!= $true )
& ( ( sK1 @ ( sK4 @ X6 ) )
= $true ) ) ),
introduced(choice_axiom,[]) ).
thf(f13,plain,
! [X6: a > a] :
( ? [X8: a] :
( ( $true
= ( sK0 @ X8 ) )
& ! [X9: a] :
( ( ^ [Y0: a,Y1: a] : ( Y0 = Y1 )
@ X9 )
!= ( ^ [Y0: a] :
( ( ( X6 @ Y0 )
= X8 )
& ( sK1 @ Y0 ) ) ) ) )
=> ( ( $true
= ( sK0 @ ( sK5 @ X6 ) ) )
& ! [X9: a] :
( ( ^ [Y0: a,Y1: a] : ( Y0 = Y1 )
@ X9 )
!= ( ^ [Y0: a] :
( ( ( X6 @ Y0 )
= ( sK5 @ X6 ) )
& ( sK1 @ Y0 ) ) ) ) ) ),
introduced(choice_axiom,[]) ).
thf(f8,plain,
? [X0: a > $o,X1: a > $o] :
( ? [X2: a > a] :
( ! [X3: a] :
( ( ( X0 @ X3 )
!= $true )
| ( ( X1 @ ( X2 @ X3 ) )
= $true ) )
& ! [X4: a] :
( ? [X5: a] :
( ( ^ [Y0: a] :
( ( X0 @ Y0 )
& ( ( X2 @ Y0 )
= X4 ) ) )
= ( ^ [Y0: a,Y1: a] : ( Y0 = Y1 )
@ X5 ) )
| ( ( X1 @ X4 )
!= $true ) ) )
& ! [X6: a > a] :
( ? [X7: a] :
( ( $true
!= ( X0 @ ( X6 @ X7 ) ) )
& ( ( X1 @ X7 )
= $true ) )
| ? [X8: a] :
( ( ( X0 @ X8 )
= $true )
& ! [X9: a] :
( ( ^ [Y0: a,Y1: a] : ( Y0 = Y1 )
@ X9 )
!= ( ^ [Y0: a] :
( ( ( X6 @ Y0 )
= X8 )
& ( X1 @ Y0 ) ) ) ) ) ) ),
inference(rectify,[],[f7]) ).
thf(f7,plain,
? [X0: a > $o,X1: a > $o] :
( ? [X2: a > a] :
( ! [X3: a] :
( ( ( X0 @ X3 )
!= $true )
| ( ( X1 @ ( X2 @ X3 ) )
= $true ) )
& ! [X4: a] :
( ? [X5: a] :
( ( ^ [Y0: a] :
( ( X0 @ Y0 )
& ( ( X2 @ Y0 )
= X4 ) ) )
= ( ^ [Y0: a,Y1: a] : ( Y0 = Y1 )
@ X5 ) )
| ( ( X1 @ X4 )
!= $true ) ) )
& ! [X6: a > a] :
( ? [X9: a] :
( ( ( X0 @ ( X6 @ X9 ) )
!= $true )
& ( $true
= ( X1 @ X9 ) ) )
| ? [X7: a] :
( ( ( X0 @ X7 )
= $true )
& ! [X8: a] :
( ( ^ [Y0: a] :
( ( ( X6 @ Y0 )
= X7 )
& ( X1 @ Y0 ) ) )
!= ( ^ [Y0: a,Y1: a] : ( Y0 = Y1 )
@ X8 ) ) ) ) ),
inference(ennf_transformation,[],[f6]) ).
thf(f6,plain,
~ ! [X0: a > $o,X1: a > $o] :
( ? [X2: a > a] :
( ! [X3: a] :
( ( ( X0 @ X3 )
= $true )
=> ( ( X1 @ ( X2 @ X3 ) )
= $true ) )
& ! [X4: a] :
( ( ( X1 @ X4 )
= $true )
=> ? [X5: a] :
( ( ^ [Y0: a] :
( ( X0 @ Y0 )
& ( ( X2 @ Y0 )
= X4 ) ) )
= ( ^ [Y0: a,Y1: a] : ( Y0 = Y1 )
@ X5 ) ) ) )
=> ? [X6: a > a] :
( ! [X9: a] :
( ( $true
= ( X1 @ X9 ) )
=> ( ( X0 @ ( X6 @ X9 ) )
= $true ) )
& ! [X7: a] :
( ( ( X0 @ X7 )
= $true )
=> ? [X8: a] :
( ( ^ [Y0: a] :
( ( ( X6 @ Y0 )
= X7 )
& ( X1 @ Y0 ) ) )
= ( ^ [Y0: a,Y1: a] : ( Y0 = Y1 )
@ X8 ) ) ) ) ),
inference(rectify,[],[f5]) ).
thf(f5,plain,
~ ! [X0: a > $o,X1: a > $o] :
( ? [X2: a > a] :
( ! [X3: a] :
( ( ( X0 @ X3 )
= $true )
=> ( ( X1 @ ( X2 @ X3 ) )
= $true ) )
& ! [X4: a] :
( ( ( X1 @ X4 )
= $true )
=> ? [X5: a] :
( ( ^ [Y0: a] :
( ( X0 @ Y0 )
& ( ( X2 @ Y0 )
= X4 ) ) )
= ( ^ [Y0: a,Y1: a] : ( Y0 = Y1 )
@ X5 ) ) ) )
=> ? [X9: a > a] :
( ! [X10: a] :
( ( $true
= ( X0 @ X10 ) )
=> ? [X11: a] :
( ( ^ [Y0: a] :
( ( ( X9 @ Y0 )
= X10 )
& ( X1 @ Y0 ) ) )
= ( ^ [Y0: a,Y1: a] : ( Y0 = Y1 )
@ X11 ) ) )
& ! [X15: a] :
( ( ( X1 @ X15 )
= $true )
=> ( ( X0 @ ( X9 @ X15 ) )
= $true ) ) ) ),
inference(fool_elimination,[],[f4]) ).
thf(f4,plain,
~ ! [X0: a > $o,X1: a > $o] :
( ? [X2: a > a] :
( ! [X3: a] :
( ( X0 @ X3 )
=> ( X1 @ ( X2 @ X3 ) ) )
& ! [X4: a] :
( ( X1 @ X4 )
=> ? [X5: a] :
( ( ^ [X6: a] :
( ( ( X2 @ X6 )
= X4 )
& ( X0 @ X6 ) ) )
= ( ^ [X7: a,X8: a] : ( X7 = X8 )
@ X5 ) ) ) )
=> ? [X9: a > a] :
( ! [X10: a] :
( ( X0 @ X10 )
=> ? [X11: a] :
( ( ^ [X12: a,X13: a] : ( X12 = X13 )
@ X11 )
= ( ^ [X14: a] :
( ( X1 @ X14 )
& ( ( X9 @ X14 )
= X10 ) ) ) ) )
& ! [X15: a] :
( ( X1 @ X15 )
=> ( X0 @ ( X9 @ X15 ) ) ) ) ),
inference(rectify,[],[f2]) ).
thf(f2,negated_conjecture,
~ ! [X0: a > $o,X1: a > $o] :
( ? [X2: a > a] :
( ! [X3: a] :
( ( X0 @ X3 )
=> ( X1 @ ( X2 @ X3 ) ) )
& ! [X4: a] :
( ( X1 @ X4 )
=> ? [X5: a] :
( ( ^ [X3: a] :
( ( ( X2 @ X3 )
= X4 )
& ( X0 @ X3 ) ) )
= ( ^ [X0: a,X1: a] : ( X0 = X1 )
@ X5 ) ) ) )
=> ? [X2: a > a] :
( ! [X4: a] :
( ( X0 @ X4 )
=> ? [X6: a] :
( ( ^ [X0: a,X1: a] : ( X0 = X1 )
@ X6 )
= ( ^ [X3: a] :
( ( X1 @ X3 )
& ( ( X2 @ X3 )
= X4 ) ) ) ) )
& ! [X3: a] :
( ( X1 @ X3 )
=> ( X0 @ ( X2 @ X3 ) ) ) ) ),
inference(negated_conjecture,[],[f1]) ).
thf(f1,conjecture,
! [X0: a > $o,X1: a > $o] :
( ? [X2: a > a] :
( ! [X3: a] :
( ( X0 @ X3 )
=> ( X1 @ ( X2 @ X3 ) ) )
& ! [X4: a] :
( ( X1 @ X4 )
=> ? [X5: a] :
( ( ^ [X3: a] :
( ( ( X2 @ X3 )
= X4 )
& ( X0 @ X3 ) ) )
= ( ^ [X0: a,X1: a] : ( X0 = X1 )
@ X5 ) ) ) )
=> ? [X2: a > a] :
( ! [X4: a] :
( ( X0 @ X4 )
=> ? [X6: a] :
( ( ^ [X0: a,X1: a] : ( X0 = X1 )
@ X6 )
= ( ^ [X3: a] :
( ( X1 @ X3 )
& ( ( X2 @ X3 )
= X4 ) ) ) ) )
& ! [X3: a] :
( ( X1 @ X3 )
=> ( X0 @ ( X2 @ X3 ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cEQP_1B_pme) ).
thf(f1100,plain,
( ( $false
= ( sK0 @ ( sK5 @ sK3 ) ) )
| spl6_3
| spl6_19 ),
inference(subsumption_resolution,[],[f1099,f111]) ).
thf(f1099,plain,
( ( $false
= ( sK0 @ ( sK5 @ sK3 ) ) )
| ( $true
= ( sK1 @ ( sK4 @ sK3 ) ) )
| spl6_19 ),
inference(trivial_inequality_removal,[],[f1098]) ).
thf(f1098,plain,
( ( $true
= ( sK1 @ ( sK4 @ sK3 ) ) )
| ( $false
= ( sK0 @ ( sK5 @ sK3 ) ) )
| ( ( sK5 @ sK3 )
!= ( sK5 @ sK3 ) )
| spl6_19 ),
inference(superposition,[],[f965,f70]) ).
thf(f70,plain,
! [X0: a > a] :
( ( ( sK3 @ ( sK2 @ ( sK5 @ X0 ) ) )
= ( sK5 @ X0 ) )
| ( $false
= ( sK0 @ ( sK5 @ X0 ) ) )
| ( $true
= ( sK1 @ ( sK4 @ X0 ) ) ) ),
inference(equality_resolution,[],[f65]) ).
thf(f65,plain,
! [X0: a > a,X1: a] :
( ( ( sK2 @ ( sK5 @ X0 ) )
!= ( sK2 @ X1 ) )
| ( ( sK3 @ ( sK2 @ ( sK5 @ X0 ) ) )
= X1 )
| ( $true
= ( sK1 @ ( sK4 @ X0 ) ) )
| ( ( sK0 @ X1 )
= $false ) ),
inference(equality_proxy_clausification,[],[f64]) ).
thf(f64,plain,
! [X0: a > a,X1: a] :
( ( ( sK0 @ X1 )
= $false )
| ( $true
= ( sK1 @ ( sK4 @ X0 ) ) )
| ( ( sK2 @ ( sK5 @ X0 ) )
!= ( sK2 @ X1 ) )
| ( $true
= ( ( sK3 @ ( sK2 @ ( sK5 @ X0 ) ) )
= X1 ) ) ),
inference(equality_proxy_clausification,[],[f63]) ).
thf(f63,plain,
! [X0: a > a,X1: a] :
( ( ( sK0 @ X1 )
= $false )
| ( $true
= ( sK1 @ ( sK4 @ X0 ) ) )
| ( $false
= ( ( sK2 @ X1 )
= ( sK2 @ ( sK5 @ X0 ) ) ) )
| ( $true
= ( ( sK3 @ ( sK2 @ ( sK5 @ X0 ) ) )
= X1 ) ) ),
inference(binary_proxy_clausification,[],[f57]) ).
thf(f57,plain,
! [X0: a > a,X1: a] :
( ( $true
= ( sK1 @ ( sK4 @ X0 ) ) )
| ( $false
= ( ( sK0 @ X1 )
& ( ( sK2 @ X1 )
= ( sK2 @ ( sK5 @ X0 ) ) ) ) )
| ( $true
= ( ( sK3 @ ( sK2 @ ( sK5 @ X0 ) ) )
= X1 ) ) ),
inference(binary_proxy_clausification,[],[f56]) ).
thf(f56,plain,
! [X0: a > a,X1: a] :
( ( ( ( sK3 @ ( sK2 @ ( sK5 @ X0 ) ) )
= X1 )
= ( ( sK0 @ X1 )
& ( ( sK2 @ X1 )
= ( sK2 @ ( sK5 @ X0 ) ) ) ) )
| ( $true
= ( sK1 @ ( sK4 @ X0 ) ) ) ),
inference(beta_eta_normalization,[],[f55]) ).
thf(f55,plain,
! [X0: a > a,X1: a] :
( ( ( ^ [Y0: a] :
( ( sK0 @ Y0 )
& ( ( sK2 @ Y0 )
= ( sK2 @ ( sK5 @ X0 ) ) ) )
@ X1 )
= ( ( sK3 @ ( sK2 @ ( sK5 @ X0 ) ) )
= X1 ) )
| ( $true
= ( sK1 @ ( sK4 @ X0 ) ) ) ),
inference(argument_congruence,[],[f27]) ).
thf(f27,plain,
! [X0: a > a] :
( ( ( ^ [Y0: a] :
( ( sK0 @ Y0 )
& ( ( sK2 @ Y0 )
= ( sK2 @ ( sK5 @ X0 ) ) ) ) )
= ( (=) @ ( sK3 @ ( sK2 @ ( sK5 @ X0 ) ) ) ) )
| ( $true
= ( sK1 @ ( sK4 @ X0 ) ) ) ),
inference(trivial_inequality_removal,[],[f26]) ).
thf(f26,plain,
! [X0: a > a] :
( ( ( ^ [Y0: a] :
( ( sK0 @ Y0 )
& ( ( sK2 @ Y0 )
= ( sK2 @ ( sK5 @ X0 ) ) ) ) )
= ( (=) @ ( sK3 @ ( sK2 @ ( sK5 @ X0 ) ) ) ) )
| ( $true != $true )
| ( $true
= ( sK1 @ ( sK4 @ X0 ) ) ) ),
inference(superposition,[],[f21,f25]) ).
thf(f25,plain,
! [X0: a > a] :
( ( ( sK1 @ ( sK2 @ ( sK5 @ X0 ) ) )
= $true )
| ( $true
= ( sK1 @ ( sK4 @ X0 ) ) ) ),
inference(trivial_inequality_removal,[],[f24]) ).
thf(f24,plain,
! [X0: a > a] :
( ( $true
= ( sK1 @ ( sK4 @ X0 ) ) )
| ( ( sK1 @ ( sK2 @ ( sK5 @ X0 ) ) )
= $true )
| ( $true != $true ) ),
inference(superposition,[],[f20,f16]) ).
thf(f20,plain,
! [X3: a] :
( ( $true
!= ( sK0 @ X3 ) )
| ( $true
= ( sK1 @ ( sK2 @ X3 ) ) ) ),
inference(cnf_transformation,[],[f14]) ).
thf(f21,plain,
! [X4: a] :
( ( ( sK1 @ X4 )
!= $true )
| ( ( (=) @ ( sK3 @ X4 ) )
= ( ^ [Y0: a] :
( ( sK0 @ Y0 )
& ( ( sK2 @ Y0 )
= X4 ) ) ) ) ),
inference(beta_eta_normalization,[],[f19]) ).
thf(f19,plain,
! [X4: a] :
( ( ( sK1 @ X4 )
!= $true )
| ( ( ^ [Y0: a] :
( ( sK0 @ Y0 )
& ( ( sK2 @ Y0 )
= X4 ) ) )
= ( ^ [Y0: a,Y1: a] : ( Y0 = Y1 )
@ ( sK3 @ X4 ) ) ) ),
inference(cnf_transformation,[],[f14]) ).
thf(f965,plain,
( ( ( sK5 @ sK3 )
!= ( sK3 @ ( sK2 @ ( sK5 @ sK3 ) ) ) )
| spl6_19 ),
inference(avatar_component_clause,[],[f964]) ).
thf(f964,plain,
( spl6_19
<=> ( ( sK5 @ sK3 )
= ( sK3 @ ( sK2 @ ( sK5 @ sK3 ) ) ) ) ),
introduced(avatar_definition,[new_symbols(naming,[spl6_19])]) ).
thf(f1045,plain,
( spl6_5
| spl6_3
| ~ spl6_19 ),
inference(avatar_split_clause,[],[f1044,f964,f110,f117]) ).
thf(f117,plain,
( spl6_5
<=> ! [X1: a] :
( ( ( sK5 @ sK3 )
!= X1 )
| ( ( sK0 @ X1 )
= $true ) ) ),
introduced(avatar_definition,[new_symbols(naming,[spl6_5])]) ).
thf(f1044,plain,
( ! [X0: a] :
( ( ( sK0 @ X0 )
= $true )
| ( ( sK5 @ sK3 )
!= X0 ) )
| spl6_3
| ~ spl6_19 ),
inference(subsumption_resolution,[],[f972,f111]) ).
thf(f972,plain,
( ! [X0: a] :
( ( ( sK0 @ X0 )
= $true )
| ( ( sK5 @ sK3 )
!= X0 )
| ( $true
= ( sK1 @ ( sK4 @ sK3 ) ) ) )
| ~ spl6_19 ),
inference(superposition,[],[f61,f966]) ).
thf(f966,plain,
( ( ( sK5 @ sK3 )
= ( sK3 @ ( sK2 @ ( sK5 @ sK3 ) ) ) )
| ~ spl6_19 ),
inference(avatar_component_clause,[],[f964]) ).
thf(f61,plain,
! [X0: a > a,X1: a] :
( ( ( sK3 @ ( sK2 @ ( sK5 @ X0 ) ) )
!= X1 )
| ( $true
= ( sK1 @ ( sK4 @ X0 ) ) )
| ( ( sK0 @ X1 )
= $true ) ),
inference(binary_proxy_clausification,[],[f59]) ).
thf(f59,plain,
! [X0: a > a,X1: a] :
( ( $true
= ( ( sK0 @ X1 )
& ( ( sK2 @ X1 )
= ( sK2 @ ( sK5 @ X0 ) ) ) ) )
| ( $true
= ( sK1 @ ( sK4 @ X0 ) ) )
| ( ( sK3 @ ( sK2 @ ( sK5 @ X0 ) ) )
!= X1 ) ),
inference(equality_proxy_clausification,[],[f58]) ).
thf(f58,plain,
! [X0: a > a,X1: a] :
( ( $true
= ( sK1 @ ( sK4 @ X0 ) ) )
| ( $false
= ( ( sK3 @ ( sK2 @ ( sK5 @ X0 ) ) )
= X1 ) )
| ( $true
= ( ( sK0 @ X1 )
& ( ( sK2 @ X1 )
= ( sK2 @ ( sK5 @ X0 ) ) ) ) ) ),
inference(binary_proxy_clausification,[],[f56]) ).
thf(f1043,plain,
( spl6_3
| ~ spl6_5
| ~ spl6_17
| ~ spl6_19 ),
inference(avatar_contradiction_clause,[],[f1042]) ).
thf(f1042,plain,
( $false
| spl6_3
| ~ spl6_5
| ~ spl6_17
| ~ spl6_19 ),
inference(trivial_inequality_removal,[],[f1041]) ).
thf(f1041,plain,
( ( $false = $true )
| spl6_3
| ~ spl6_5
| ~ spl6_17
| ~ spl6_19 ),
inference(backward_demodulation,[],[f902,f1040]) ).
thf(f1040,plain,
( ( $false
= ( sK1 @ ( sK2 @ ( sK5 @ sK3 ) ) ) )
| spl6_3
| ~ spl6_17
| ~ spl6_19 ),
inference(subsumption_resolution,[],[f1039,f111]) ).
thf(f1039,plain,
( ( $false
= ( sK1 @ ( sK2 @ ( sK5 @ sK3 ) ) ) )
| ( $true
= ( sK1 @ ( sK4 @ sK3 ) ) )
| ~ spl6_17
| ~ spl6_19 ),
inference(subsumption_resolution,[],[f1038,f966]) ).
thf(f1038,plain,
( ( ( sK5 @ sK3 )
!= ( sK3 @ ( sK2 @ ( sK5 @ sK3 ) ) ) )
| ( $true
= ( sK1 @ ( sK4 @ sK3 ) ) )
| ( $false
= ( sK1 @ ( sK2 @ ( sK5 @ sK3 ) ) ) )
| ~ spl6_17 ),
inference(trivial_inequality_removal,[],[f1002]) ).
thf(f1002,plain,
( ( $false
= ( sK1 @ ( sK2 @ ( sK5 @ sK3 ) ) ) )
| ( $true
= ( sK1 @ ( sK4 @ sK3 ) ) )
| ( ( sK2 @ ( sK5 @ sK3 ) )
!= ( sK2 @ ( sK5 @ sK3 ) ) )
| ( ( sK5 @ sK3 )
!= ( sK3 @ ( sK2 @ ( sK5 @ sK3 ) ) ) )
| ~ spl6_17 ),
inference(superposition,[],[f34,f1001]) ).
thf(f1001,plain,
( ( ( sK8 @ ( sK2 @ ( sK5 @ sK3 ) ) @ sK3 )
= ( sK2 @ ( sK5 @ sK3 ) ) )
| ~ spl6_17 ),
inference(equality_resolution,[],[f958]) ).
thf(f958,plain,
( ! [X0: a] :
( ( ( sK2 @ ( sK5 @ sK3 ) )
!= X0 )
| ( ( sK8 @ X0 @ sK3 )
= X0 ) )
| ~ spl6_17 ),
inference(equality_factoring,[],[f444]) ).
thf(f444,plain,
( ! [X0: a] :
( ( ( sK2 @ ( sK5 @ sK3 ) )
= ( sK8 @ X0 @ sK3 ) )
| ( ( sK8 @ X0 @ sK3 )
= X0 ) )
| ~ spl6_17 ),
inference(avatar_component_clause,[],[f443]) ).
thf(f443,plain,
( spl6_17
<=> ! [X0: a] :
( ( ( sK8 @ X0 @ sK3 )
= X0 )
| ( ( sK2 @ ( sK5 @ sK3 ) )
= ( sK8 @ X0 @ sK3 ) ) ) ),
introduced(avatar_definition,[new_symbols(naming,[spl6_17])]) ).
thf(f34,plain,
! [X6: a > a,X9: a] :
( ( ( X6 @ ( sK8 @ X9 @ X6 ) )
!= ( sK5 @ X6 ) )
| ( ( sK8 @ X9 @ X6 )
!= X9 )
| ( $false
= ( sK1 @ ( sK8 @ X9 @ X6 ) ) )
| ( ( sK1 @ ( sK4 @ X6 ) )
= $true ) ),
inference(equality_proxy_clausification,[],[f33]) ).
thf(f33,plain,
! [X6: a > a,X9: a] :
( ( ( sK1 @ ( sK4 @ X6 ) )
= $true )
| ( ( sK8 @ X9 @ X6 )
!= X9 )
| ( $false
= ( sK1 @ ( sK8 @ X9 @ X6 ) ) )
| ( $false
= ( ( X6 @ ( sK8 @ X9 @ X6 ) )
= ( sK5 @ X6 ) ) ) ),
inference(binary_proxy_clausification,[],[f32]) ).
thf(f32,plain,
! [X6: a > a,X9: a] :
( ( ( sK8 @ X9 @ X6 )
!= X9 )
| ( $false
= ( ( ( X6 @ ( sK8 @ X9 @ X6 ) )
= ( sK5 @ X6 ) )
& ( sK1 @ ( sK8 @ X9 @ X6 ) ) ) )
| ( ( sK1 @ ( sK4 @ X6 ) )
= $true ) ),
inference(equality_proxy_clausification,[],[f31]) ).
thf(f31,plain,
! [X6: a > a,X9: a] :
( ( ( sK1 @ ( sK4 @ X6 ) )
= $true )
| ( $false
= ( X9
= ( sK8 @ X9 @ X6 ) ) )
| ( $false
= ( ( ( X6 @ ( sK8 @ X9 @ X6 ) )
= ( sK5 @ X6 ) )
& ( sK1 @ ( sK8 @ X9 @ X6 ) ) ) ) ),
inference(binary_proxy_clausification,[],[f29]) ).
thf(f29,plain,
! [X6: a > a,X9: a] :
( ( ( ( ( X6 @ ( sK8 @ X9 @ X6 ) )
= ( sK5 @ X6 ) )
& ( sK1 @ ( sK8 @ X9 @ X6 ) ) )
!= ( X9
= ( sK8 @ X9 @ X6 ) ) )
| ( ( sK1 @ ( sK4 @ X6 ) )
= $true ) ),
inference(beta_eta_normalization,[],[f28]) ).
thf(f28,plain,
! [X6: a > a,X9: a] :
( ( ( sK1 @ ( sK4 @ X6 ) )
= $true )
| ( ( X9
= ( sK8 @ X9 @ X6 ) )
!= ( ^ [Y0: a] :
( ( ( X6 @ Y0 )
= ( sK5 @ X6 ) )
& ( sK1 @ Y0 ) )
@ ( sK8 @ X9 @ X6 ) ) ) ),
inference(negative_extensionality,[],[f23]) ).
thf(f23,plain,
! [X6: a > a,X9: a] :
( ( ( ^ [Y0: a] :
( ( ( X6 @ Y0 )
= ( sK5 @ X6 ) )
& ( sK1 @ Y0 ) ) )
!= ( (=) @ X9 ) )
| ( ( sK1 @ ( sK4 @ X6 ) )
= $true ) ),
inference(beta_eta_normalization,[],[f15]) ).
thf(f15,plain,
! [X6: a > a,X9: a] :
( ( ( ^ [Y0: a,Y1: a] : ( Y0 = Y1 )
@ X9 )
!= ( ^ [Y0: a] :
( ( ( X6 @ Y0 )
= ( sK5 @ X6 ) )
& ( sK1 @ Y0 ) ) ) )
| ( ( sK1 @ ( sK4 @ X6 ) )
= $true ) ),
inference(cnf_transformation,[],[f14]) ).
thf(f902,plain,
( ( ( sK1 @ ( sK2 @ ( sK5 @ sK3 ) ) )
= $true )
| ~ spl6_5 ),
inference(trivial_inequality_removal,[],[f901]) ).
thf(f901,plain,
( ( ( sK1 @ ( sK2 @ ( sK5 @ sK3 ) ) )
= $true )
| ( $true != $true )
| ~ spl6_5 ),
inference(superposition,[],[f20,f692]) ).
thf(f692,plain,
( ( ( sK0 @ ( sK5 @ sK3 ) )
= $true )
| ~ spl6_5 ),
inference(equality_resolution,[],[f118]) ).
thf(f118,plain,
( ! [X1: a] :
( ( ( sK5 @ sK3 )
!= X1 )
| ( ( sK0 @ X1 )
= $true ) )
| ~ spl6_5 ),
inference(avatar_component_clause,[],[f117]) ).
thf(f899,plain,
~ spl6_3,
inference(avatar_contradiction_clause,[],[f898]) ).
thf(f898,plain,
( $false
| ~ spl6_3 ),
inference(trivial_inequality_removal,[],[f897]) ).
thf(f897,plain,
( ( $false = $true )
| ~ spl6_3 ),
inference(backward_demodulation,[],[f500,f896]) ).
thf(f896,plain,
( ( $false
= ( sK1 @ ( sK2 @ ( sK5 @ sK3 ) ) ) )
| ~ spl6_3 ),
inference(subsumption_resolution,[],[f895,f657]) ).
thf(f657,plain,
( ( ( sK5 @ sK3 )
= ( sK3 @ ( sK2 @ ( sK5 @ sK3 ) ) ) )
| ~ spl6_3 ),
inference(trivial_inequality_removal,[],[f656]) ).
thf(f656,plain,
( ( $false = $true )
| ( ( sK5 @ sK3 )
= ( sK3 @ ( sK2 @ ( sK5 @ sK3 ) ) ) )
| ~ spl6_3 ),
inference(forward_demodulation,[],[f655,f496]) ).
thf(f496,plain,
( ( ( sK0 @ ( sK5 @ sK3 ) )
= $true )
| ~ spl6_3 ),
inference(trivial_inequality_removal,[],[f492]) ).
thf(f492,plain,
( ( $true != $true )
| ( ( sK0 @ ( sK5 @ sK3 ) )
= $true )
| ~ spl6_3 ),
inference(superposition,[],[f18,f488]) ).
thf(f488,plain,
( ( $true
= ( sK0 @ ( sK3 @ ( sK4 @ sK3 ) ) ) )
| ~ spl6_3 ),
inference(equality_resolution,[],[f478]) ).
thf(f478,plain,
( ! [X1: a] :
( ( ( sK3 @ ( sK4 @ sK3 ) )
!= X1 )
| ( ( sK0 @ X1 )
= $true ) )
| ~ spl6_3 ),
inference(binary_proxy_clausification,[],[f476]) ).
thf(f476,plain,
( ! [X1: a] :
( ( ( sK3 @ ( sK4 @ sK3 ) )
!= X1 )
| ( $true
= ( ( sK0 @ X1 )
& ( ( sK2 @ X1 )
= ( sK4 @ sK3 ) ) ) ) )
| ~ spl6_3 ),
inference(equality_proxy_clausification,[],[f475]) ).
thf(f475,plain,
( ! [X1: a] :
( ( $false
= ( ( sK3 @ ( sK4 @ sK3 ) )
= X1 ) )
| ( $true
= ( ( sK0 @ X1 )
& ( ( sK2 @ X1 )
= ( sK4 @ sK3 ) ) ) ) )
| ~ spl6_3 ),
inference(binary_proxy_clausification,[],[f473]) ).
thf(f473,plain,
( ! [X1: a] :
( ( ( sK3 @ ( sK4 @ sK3 ) )
= X1 )
= ( ( sK0 @ X1 )
& ( ( sK2 @ X1 )
= ( sK4 @ sK3 ) ) ) )
| ~ spl6_3 ),
inference(beta_eta_normalization,[],[f472]) ).
thf(f472,plain,
( ! [X1: a] :
( ( ^ [Y0: a] :
( ( sK0 @ Y0 )
& ( ( sK2 @ Y0 )
= ( sK4 @ sK3 ) ) )
@ X1 )
= ( ( sK3 @ ( sK4 @ sK3 ) )
= X1 ) )
| ~ spl6_3 ),
inference(argument_congruence,[],[f448]) ).
thf(f448,plain,
( ( ( ^ [Y0: a] :
( ( sK0 @ Y0 )
& ( ( sK2 @ Y0 )
= ( sK4 @ sK3 ) ) ) )
= ( (=) @ ( sK3 @ ( sK4 @ sK3 ) ) ) )
| ~ spl6_3 ),
inference(trivial_inequality_removal,[],[f447]) ).
thf(f447,plain,
( ( ( ^ [Y0: a] :
( ( sK0 @ Y0 )
& ( ( sK2 @ Y0 )
= ( sK4 @ sK3 ) ) ) )
= ( (=) @ ( sK3 @ ( sK4 @ sK3 ) ) ) )
| ( $true != $true )
| ~ spl6_3 ),
inference(superposition,[],[f21,f112]) ).
thf(f112,plain,
( ( $true
= ( sK1 @ ( sK4 @ sK3 ) ) )
| ~ spl6_3 ),
inference(avatar_component_clause,[],[f110]) ).
thf(f18,plain,
! [X6: a > a] :
( ( ( sK0 @ ( X6 @ ( sK4 @ X6 ) ) )
!= $true )
| ( $true
= ( sK0 @ ( sK5 @ X6 ) ) ) ),
inference(cnf_transformation,[],[f14]) ).
thf(f655,plain,
( ( ( sK5 @ sK3 )
= ( sK3 @ ( sK2 @ ( sK5 @ sK3 ) ) ) )
| ( $false
= ( sK0 @ ( sK5 @ sK3 ) ) )
| ~ spl6_3 ),
inference(equality_resolution,[],[f552]) ).
thf(f552,plain,
( ! [X1: a] :
( ( ( sK2 @ ( sK5 @ sK3 ) )
!= ( sK2 @ X1 ) )
| ( ( sK0 @ X1 )
= $false )
| ( ( sK3 @ ( sK2 @ ( sK5 @ sK3 ) ) )
= X1 ) )
| ~ spl6_3 ),
inference(equality_proxy_clausification,[],[f551]) ).
thf(f551,plain,
( ! [X1: a] :
( ( $true
= ( ( sK3 @ ( sK2 @ ( sK5 @ sK3 ) ) )
= X1 ) )
| ( ( sK0 @ X1 )
= $false )
| ( ( sK2 @ ( sK5 @ sK3 ) )
!= ( sK2 @ X1 ) ) )
| ~ spl6_3 ),
inference(equality_proxy_clausification,[],[f550]) ).
thf(f550,plain,
( ! [X1: a] :
( ( ( sK0 @ X1 )
= $false )
| ( $false
= ( ( sK2 @ X1 )
= ( sK2 @ ( sK5 @ sK3 ) ) ) )
| ( $true
= ( ( sK3 @ ( sK2 @ ( sK5 @ sK3 ) ) )
= X1 ) ) )
| ~ spl6_3 ),
inference(binary_proxy_clausification,[],[f549]) ).
thf(f549,plain,
( ! [X1: a] :
( ( $false
= ( ( sK0 @ X1 )
& ( ( sK2 @ X1 )
= ( sK2 @ ( sK5 @ sK3 ) ) ) ) )
| ( $true
= ( ( sK3 @ ( sK2 @ ( sK5 @ sK3 ) ) )
= X1 ) ) )
| ~ spl6_3 ),
inference(binary_proxy_clausification,[],[f547]) ).
thf(f547,plain,
( ! [X1: a] :
( ( ( sK0 @ X1 )
& ( ( sK2 @ X1 )
= ( sK2 @ ( sK5 @ sK3 ) ) ) )
= ( ( sK3 @ ( sK2 @ ( sK5 @ sK3 ) ) )
= X1 ) )
| ~ spl6_3 ),
inference(beta_eta_normalization,[],[f546]) ).
thf(f546,plain,
( ! [X1: a] :
( ( ( sK3 @ ( sK2 @ ( sK5 @ sK3 ) ) )
= X1 )
= ( ^ [Y0: a] :
( ( sK0 @ Y0 )
& ( ( sK2 @ Y0 )
= ( sK2 @ ( sK5 @ sK3 ) ) ) )
@ X1 ) )
| ~ spl6_3 ),
inference(argument_congruence,[],[f502]) ).
thf(f502,plain,
( ( ( ^ [Y0: a] :
( ( sK0 @ Y0 )
& ( ( sK2 @ Y0 )
= ( sK2 @ ( sK5 @ sK3 ) ) ) ) )
= ( (=) @ ( sK3 @ ( sK2 @ ( sK5 @ sK3 ) ) ) ) )
| ~ spl6_3 ),
inference(trivial_inequality_removal,[],[f501]) ).
thf(f501,plain,
( ( ( ^ [Y0: a] :
( ( sK0 @ Y0 )
& ( ( sK2 @ Y0 )
= ( sK2 @ ( sK5 @ sK3 ) ) ) ) )
= ( (=) @ ( sK3 @ ( sK2 @ ( sK5 @ sK3 ) ) ) ) )
| ( $true != $true )
| ~ spl6_3 ),
inference(superposition,[],[f21,f500]) ).
thf(f895,plain,
( ( $false
= ( sK1 @ ( sK2 @ ( sK5 @ sK3 ) ) ) )
| ( ( sK5 @ sK3 )
!= ( sK3 @ ( sK2 @ ( sK5 @ sK3 ) ) ) )
| ~ spl6_3 ),
inference(subsumption_resolution,[],[f894,f488]) ).
thf(f894,plain,
( ( $false
= ( sK1 @ ( sK2 @ ( sK5 @ sK3 ) ) ) )
| ( $true
!= ( sK0 @ ( sK3 @ ( sK4 @ sK3 ) ) ) )
| ( ( sK5 @ sK3 )
!= ( sK3 @ ( sK2 @ ( sK5 @ sK3 ) ) ) )
| ~ spl6_3 ),
inference(trivial_inequality_removal,[],[f886]) ).
thf(f886,plain,
( ( $true
!= ( sK0 @ ( sK3 @ ( sK4 @ sK3 ) ) ) )
| ( ( sK2 @ ( sK5 @ sK3 ) )
!= ( sK2 @ ( sK5 @ sK3 ) ) )
| ( ( sK5 @ sK3 )
!= ( sK3 @ ( sK2 @ ( sK5 @ sK3 ) ) ) )
| ( $false
= ( sK1 @ ( sK2 @ ( sK5 @ sK3 ) ) ) )
| ~ spl6_3 ),
inference(superposition,[],[f45,f872]) ).
thf(f872,plain,
( ( ( sK2 @ ( sK5 @ sK3 ) )
= ( sK9 @ ( sK2 @ ( sK5 @ sK3 ) ) @ sK3 ) )
| ~ spl6_3 ),
inference(equality_resolution,[],[f858]) ).
thf(f858,plain,
( ! [X0: a] :
( ( ( sK2 @ ( sK5 @ sK3 ) )
!= X0 )
| ( ( sK9 @ X0 @ sK3 )
= X0 ) )
| ~ spl6_3 ),
inference(equality_factoring,[],[f834]) ).
thf(f834,plain,
( ! [X0: a] :
( ( ( sK9 @ X0 @ sK3 )
= ( sK2 @ ( sK5 @ sK3 ) ) )
| ( ( sK9 @ X0 @ sK3 )
= X0 ) )
| ~ spl6_3 ),
inference(equality_resolution,[],[f823]) ).
thf(f823,plain,
( ! [X0: a,X1: a] :
( ( ( sK5 @ sK3 )
!= X1 )
| ( ( sK9 @ X0 @ sK3 )
= X0 )
| ( ( sK9 @ X0 @ sK3 )
= ( sK2 @ X1 ) ) )
| ~ spl6_3 ),
inference(duplicate_literal_removal,[],[f821]) ).
thf(f821,plain,
( ! [X0: a,X1: a] :
( ( ( sK5 @ sK3 )
!= X1 )
| ( ( sK9 @ X0 @ sK3 )
= X0 )
| ( ( sK9 @ X0 @ sK3 )
= X0 )
| ( ( sK9 @ X0 @ sK3 )
= ( sK2 @ X1 ) ) )
| ~ spl6_3 ),
inference(superposition,[],[f617,f495]) ).
thf(f495,plain,
( ! [X0: a] :
( ( ( sK3 @ ( sK9 @ X0 @ sK3 ) )
= ( sK5 @ sK3 ) )
| ( ( sK9 @ X0 @ sK3 )
= X0 ) )
| ~ spl6_3 ),
inference(trivial_inequality_removal,[],[f490]) ).
thf(f490,plain,
( ! [X0: a] :
( ( ( sK9 @ X0 @ sK3 )
= X0 )
| ( $true != $true )
| ( ( sK3 @ ( sK9 @ X0 @ sK3 ) )
= ( sK5 @ sK3 ) ) )
| ~ spl6_3 ),
inference(superposition,[],[f49,f488]) ).
thf(f49,plain,
! [X6: a > a,X9: a] :
( ( ( sK0 @ ( X6 @ ( sK4 @ X6 ) ) )
!= $true )
| ( ( sK9 @ X9 @ X6 )
= X9 )
| ( ( sK5 @ X6 )
= ( X6 @ ( sK9 @ X9 @ X6 ) ) ) ),
inference(equality_proxy_clausification,[],[f48]) ).
thf(f48,plain,
! [X6: a > a,X9: a] :
( ( $true
= ( ( X6 @ ( sK9 @ X9 @ X6 ) )
= ( sK5 @ X6 ) ) )
| ( ( sK0 @ ( X6 @ ( sK4 @ X6 ) ) )
!= $true )
| ( ( sK9 @ X9 @ X6 )
= X9 ) ),
inference(equality_proxy_clausification,[],[f47]) ).
thf(f47,plain,
! [X6: a > a,X9: a] :
( ( $true
= ( X9
= ( sK9 @ X9 @ X6 ) ) )
| ( ( sK0 @ ( X6 @ ( sK4 @ X6 ) ) )
!= $true )
| ( $true
= ( ( X6 @ ( sK9 @ X9 @ X6 ) )
= ( sK5 @ X6 ) ) ) ),
inference(binary_proxy_clausification,[],[f41]) ).
thf(f41,plain,
! [X6: a > a,X9: a] :
( ( ( ( ( X6 @ ( sK9 @ X9 @ X6 ) )
= ( sK5 @ X6 ) )
& ( sK1 @ ( sK9 @ X9 @ X6 ) ) )
= $true )
| ( $true
= ( X9
= ( sK9 @ X9 @ X6 ) ) )
| ( ( sK0 @ ( X6 @ ( sK4 @ X6 ) ) )
!= $true ) ),
inference(binary_proxy_clausification,[],[f40]) ).
thf(f40,plain,
! [X6: a > a,X9: a] :
( ( ( sK0 @ ( X6 @ ( sK4 @ X6 ) ) )
!= $true )
| ( ( ( ( X6 @ ( sK9 @ X9 @ X6 ) )
= ( sK5 @ X6 ) )
& ( sK1 @ ( sK9 @ X9 @ X6 ) ) )
!= ( X9
= ( sK9 @ X9 @ X6 ) ) ) ),
inference(beta_eta_normalization,[],[f39]) ).
thf(f39,plain,
! [X6: a > a,X9: a] :
( ( ( X9
= ( sK9 @ X9 @ X6 ) )
!= ( ^ [Y0: a] :
( ( ( X6 @ Y0 )
= ( sK5 @ X6 ) )
& ( sK1 @ Y0 ) )
@ ( sK9 @ X9 @ X6 ) ) )
| ( ( sK0 @ ( X6 @ ( sK4 @ X6 ) ) )
!= $true ) ),
inference(negative_extensionality,[],[f22]) ).
thf(f22,plain,
! [X6: a > a,X9: a] :
( ( ( ^ [Y0: a] :
( ( ( X6 @ Y0 )
= ( sK5 @ X6 ) )
& ( sK1 @ Y0 ) ) )
!= ( (=) @ X9 ) )
| ( ( sK0 @ ( X6 @ ( sK4 @ X6 ) ) )
!= $true ) ),
inference(beta_eta_normalization,[],[f17]) ).
thf(f17,plain,
! [X6: a > a,X9: a] :
( ( ( ^ [Y0: a,Y1: a] : ( Y0 = Y1 )
@ X9 )
!= ( ^ [Y0: a] :
( ( ( X6 @ Y0 )
= ( sK5 @ X6 ) )
& ( sK1 @ Y0 ) ) ) )
| ( ( sK0 @ ( X6 @ ( sK4 @ X6 ) ) )
!= $true ) ),
inference(cnf_transformation,[],[f14]) ).
thf(f617,plain,
( ! [X0: a,X1: a] :
( ( ( sK3 @ ( sK9 @ X0 @ sK3 ) )
!= X1 )
| ( ( sK9 @ X0 @ sK3 )
= ( sK2 @ X1 ) )
| ( ( sK9 @ X0 @ sK3 )
= X0 ) )
| ~ spl6_3 ),
inference(equality_proxy_clausification,[],[f616]) ).
thf(f616,plain,
( ! [X0: a,X1: a] :
( ( ( sK9 @ X0 @ sK3 )
= ( sK2 @ X1 ) )
| ( $false
= ( ( sK3 @ ( sK9 @ X0 @ sK3 ) )
= X1 ) )
| ( ( sK9 @ X0 @ sK3 )
= X0 ) )
| ~ spl6_3 ),
inference(equality_proxy_clausification,[],[f613]) ).
thf(f613,plain,
( ! [X0: a,X1: a] :
( ( ( ( sK2 @ X1 )
= ( sK9 @ X0 @ sK3 ) )
= $true )
| ( ( sK9 @ X0 @ sK3 )
= X0 )
| ( $false
= ( ( sK3 @ ( sK9 @ X0 @ sK3 ) )
= X1 ) ) )
| ~ spl6_3 ),
inference(binary_proxy_clausification,[],[f608]) ).
thf(f608,plain,
( ! [X0: a,X1: a] :
( ( ( ( sK0 @ X1 )
& ( ( sK2 @ X1 )
= ( sK9 @ X0 @ sK3 ) ) )
= $true )
| ( $false
= ( ( sK3 @ ( sK9 @ X0 @ sK3 ) )
= X1 ) )
| ( ( sK9 @ X0 @ sK3 )
= X0 ) )
| ~ spl6_3 ),
inference(binary_proxy_clausification,[],[f607]) ).
thf(f607,plain,
( ! [X0: a,X1: a] :
( ( ( ( sK0 @ X1 )
& ( ( sK2 @ X1 )
= ( sK9 @ X0 @ sK3 ) ) )
= ( ( sK3 @ ( sK9 @ X0 @ sK3 ) )
= X1 ) )
| ( ( sK9 @ X0 @ sK3 )
= X0 ) )
| ~ spl6_3 ),
inference(beta_eta_normalization,[],[f606]) ).
thf(f606,plain,
( ! [X0: a,X1: a] :
( ( ( sK9 @ X0 @ sK3 )
= X0 )
| ( ( ( sK3 @ ( sK9 @ X0 @ sK3 ) )
= X1 )
= ( ^ [Y0: a] :
( ( sK0 @ Y0 )
& ( ( sK2 @ Y0 )
= ( sK9 @ X0 @ sK3 ) ) )
@ X1 ) ) )
| ~ spl6_3 ),
inference(argument_congruence,[],[f514]) ).
thf(f514,plain,
( ! [X0: a] :
( ( ( ^ [Y0: a] :
( ( sK0 @ Y0 )
& ( ( sK2 @ Y0 )
= ( sK9 @ X0 @ sK3 ) ) ) )
= ( (=) @ ( sK3 @ ( sK9 @ X0 @ sK3 ) ) ) )
| ( ( sK9 @ X0 @ sK3 )
= X0 ) )
| ~ spl6_3 ),
inference(trivial_inequality_removal,[],[f513]) ).
thf(f513,plain,
( ! [X0: a] :
( ( $true != $true )
| ( ( sK9 @ X0 @ sK3 )
= X0 )
| ( ( ^ [Y0: a] :
( ( sK0 @ Y0 )
& ( ( sK2 @ Y0 )
= ( sK9 @ X0 @ sK3 ) ) ) )
= ( (=) @ ( sK3 @ ( sK9 @ X0 @ sK3 ) ) ) ) )
| ~ spl6_3 ),
inference(superposition,[],[f21,f494]) ).
thf(f494,plain,
( ! [X0: a] :
( ( ( sK1 @ ( sK9 @ X0 @ sK3 ) )
= $true )
| ( ( sK9 @ X0 @ sK3 )
= X0 ) )
| ~ spl6_3 ),
inference(trivial_inequality_removal,[],[f491]) ).
thf(f491,plain,
( ! [X0: a] :
( ( ( sK1 @ ( sK9 @ X0 @ sK3 ) )
= $true )
| ( ( sK9 @ X0 @ sK3 )
= X0 )
| ( $true != $true ) )
| ~ spl6_3 ),
inference(superposition,[],[f50,f488]) ).
thf(f50,plain,
! [X6: a > a,X9: a] :
( ( ( sK0 @ ( X6 @ ( sK4 @ X6 ) ) )
!= $true )
| ( ( sK9 @ X9 @ X6 )
= X9 )
| ( ( sK1 @ ( sK9 @ X9 @ X6 ) )
= $true ) ),
inference(equality_proxy_clausification,[],[f46]) ).
thf(f46,plain,
! [X6: a > a,X9: a] :
( ( $true
= ( X9
= ( sK9 @ X9 @ X6 ) ) )
| ( ( sK0 @ ( X6 @ ( sK4 @ X6 ) ) )
!= $true )
| ( ( sK1 @ ( sK9 @ X9 @ X6 ) )
= $true ) ),
inference(binary_proxy_clausification,[],[f41]) ).
thf(f45,plain,
! [X6: a > a,X9: a] :
( ( ( sK5 @ X6 )
!= ( X6 @ ( sK9 @ X9 @ X6 ) ) )
| ( ( sK9 @ X9 @ X6 )
!= X9 )
| ( ( sK1 @ ( sK9 @ X9 @ X6 ) )
= $false )
| ( ( sK0 @ ( X6 @ ( sK4 @ X6 ) ) )
!= $true ) ),
inference(equality_proxy_clausification,[],[f44]) ).
thf(f44,plain,
! [X6: a > a,X9: a] :
( ( ( sK1 @ ( sK9 @ X9 @ X6 ) )
= $false )
| ( ( sK9 @ X9 @ X6 )
!= X9 )
| ( $false
= ( ( X6 @ ( sK9 @ X9 @ X6 ) )
= ( sK5 @ X6 ) ) )
| ( ( sK0 @ ( X6 @ ( sK4 @ X6 ) ) )
!= $true ) ),
inference(equality_proxy_clausification,[],[f43]) ).
thf(f43,plain,
! [X6: a > a,X9: a] :
( ( $false
= ( X9
= ( sK9 @ X9 @ X6 ) ) )
| ( $false
= ( ( X6 @ ( sK9 @ X9 @ X6 ) )
= ( sK5 @ X6 ) ) )
| ( ( sK0 @ ( X6 @ ( sK4 @ X6 ) ) )
!= $true )
| ( ( sK1 @ ( sK9 @ X9 @ X6 ) )
= $false ) ),
inference(binary_proxy_clausification,[],[f42]) ).
thf(f42,plain,
! [X6: a > a,X9: a] :
( ( ( sK0 @ ( X6 @ ( sK4 @ X6 ) ) )
!= $true )
| ( $false
= ( ( ( X6 @ ( sK9 @ X9 @ X6 ) )
= ( sK5 @ X6 ) )
& ( sK1 @ ( sK9 @ X9 @ X6 ) ) ) )
| ( $false
= ( X9
= ( sK9 @ X9 @ X6 ) ) ) ),
inference(binary_proxy_clausification,[],[f40]) ).
thf(f500,plain,
( ( ( sK1 @ ( sK2 @ ( sK5 @ sK3 ) ) )
= $true )
| ~ spl6_3 ),
inference(trivial_inequality_removal,[],[f499]) ).
thf(f499,plain,
( ( $true != $true )
| ( ( sK1 @ ( sK2 @ ( sK5 @ sK3 ) ) )
= $true )
| ~ spl6_3 ),
inference(superposition,[],[f20,f496]) ).
thf(f445,plain,
( spl6_3
| spl6_17 ),
inference(avatar_split_clause,[],[f158,f443,f110]) ).
thf(f158,plain,
! [X0: a] :
( ( $true
= ( sK1 @ ( sK4 @ sK3 ) ) )
| ( ( sK8 @ X0 @ sK3 )
= X0 )
| ( ( sK2 @ ( sK5 @ sK3 ) )
= ( sK8 @ X0 @ sK3 ) ) ),
inference(duplicate_literal_removal,[],[f153]) ).
thf(f153,plain,
! [X0: a] :
( ( $true
= ( sK1 @ ( sK4 @ sK3 ) ) )
| ( ( sK8 @ X0 @ sK3 )
= X0 )
| ( ( sK2 @ ( sK5 @ sK3 ) )
= ( sK8 @ X0 @ sK3 ) )
| ( $true
= ( sK1 @ ( sK4 @ sK3 ) ) )
| ( ( sK8 @ X0 @ sK3 )
= X0 ) ),
inference(superposition,[],[f129,f38]) ).
thf(f38,plain,
! [X6: a > a,X9: a] :
( ( ( X6 @ ( sK8 @ X9 @ X6 ) )
= ( sK5 @ X6 ) )
| ( ( sK8 @ X9 @ X6 )
= X9 )
| ( ( sK1 @ ( sK4 @ X6 ) )
= $true ) ),
inference(equality_proxy_clausification,[],[f37]) ).
thf(f37,plain,
! [X6: a > a,X9: a] :
( ( $true
= ( ( X6 @ ( sK8 @ X9 @ X6 ) )
= ( sK5 @ X6 ) ) )
| ( ( sK8 @ X9 @ X6 )
= X9 )
| ( ( sK1 @ ( sK4 @ X6 ) )
= $true ) ),
inference(binary_proxy_clausification,[],[f35]) ).
thf(f35,plain,
! [X6: a > a,X9: a] :
( ( ( sK1 @ ( sK4 @ X6 ) )
= $true )
| ( ( ( ( X6 @ ( sK8 @ X9 @ X6 ) )
= ( sK5 @ X6 ) )
& ( sK1 @ ( sK8 @ X9 @ X6 ) ) )
= $true )
| ( ( sK8 @ X9 @ X6 )
= X9 ) ),
inference(equality_proxy_clausification,[],[f30]) ).
thf(f30,plain,
! [X6: a > a,X9: a] :
( ( ( sK1 @ ( sK4 @ X6 ) )
= $true )
| ( ( X9
= ( sK8 @ X9 @ X6 ) )
= $true )
| ( ( ( ( X6 @ ( sK8 @ X9 @ X6 ) )
= ( sK5 @ X6 ) )
& ( sK1 @ ( sK8 @ X9 @ X6 ) ) )
= $true ) ),
inference(binary_proxy_clausification,[],[f29]) ).
thf(f129,plain,
! [X0: a > a,X1: a] :
( ( ( sK8 @ X1 @ X0 )
= ( sK2 @ ( sK3 @ ( sK8 @ X1 @ X0 ) ) ) )
| ( ( sK8 @ X1 @ X0 )
= X1 )
| ( $true
= ( sK1 @ ( sK4 @ X0 ) ) ) ),
inference(equality_resolution,[],[f88]) ).
thf(f88,plain,
! [X2: a,X0: a,X1: a > a] :
( ( ( sK3 @ ( sK8 @ X0 @ X1 ) )
!= X2 )
| ( ( sK1 @ ( sK4 @ X1 ) )
= $true )
| ( ( sK8 @ X0 @ X1 )
= X0 )
| ( ( sK8 @ X0 @ X1 )
= ( sK2 @ X2 ) ) ),
inference(equality_proxy_clausification,[],[f86]) ).
thf(f86,plain,
! [X2: a,X0: a,X1: a > a] :
( ( ( ( sK2 @ X2 )
= ( sK8 @ X0 @ X1 ) )
= $true )
| ( ( sK1 @ ( sK4 @ X1 ) )
= $true )
| ( ( sK3 @ ( sK8 @ X0 @ X1 ) )
!= X2 )
| ( ( sK8 @ X0 @ X1 )
= X0 ) ),
inference(binary_proxy_clausification,[],[f85]) ).
thf(f85,plain,
! [X2: a,X0: a,X1: a > a] :
( ( ( sK1 @ ( sK4 @ X1 ) )
= $true )
| ( $true
= ( ( sK0 @ X2 )
& ( ( sK2 @ X2 )
= ( sK8 @ X0 @ X1 ) ) ) )
| ( ( sK3 @ ( sK8 @ X0 @ X1 ) )
!= X2 )
| ( ( sK8 @ X0 @ X1 )
= X0 ) ),
inference(equality_proxy_clausification,[],[f84]) ).
thf(f84,plain,
! [X2: a,X0: a,X1: a > a] :
( ( ( sK8 @ X0 @ X1 )
= X0 )
| ( ( sK1 @ ( sK4 @ X1 ) )
= $true )
| ( $false
= ( ( sK3 @ ( sK8 @ X0 @ X1 ) )
= X2 ) )
| ( $true
= ( ( sK0 @ X2 )
& ( ( sK2 @ X2 )
= ( sK8 @ X0 @ X1 ) ) ) ) ),
inference(binary_proxy_clausification,[],[f82]) ).
thf(f82,plain,
! [X2: a,X0: a,X1: a > a] :
( ( ( ( sK3 @ ( sK8 @ X0 @ X1 ) )
= X2 )
= ( ( sK0 @ X2 )
& ( ( sK2 @ X2 )
= ( sK8 @ X0 @ X1 ) ) ) )
| ( ( sK8 @ X0 @ X1 )
= X0 )
| ( ( sK1 @ ( sK4 @ X1 ) )
= $true ) ),
inference(beta_eta_normalization,[],[f81]) ).
thf(f81,plain,
! [X2: a,X0: a,X1: a > a] :
( ( ( sK8 @ X0 @ X1 )
= X0 )
| ( ( ^ [Y0: a] :
( ( sK0 @ Y0 )
& ( ( sK2 @ Y0 )
= ( sK8 @ X0 @ X1 ) ) )
@ X2 )
= ( ( sK3 @ ( sK8 @ X0 @ X1 ) )
= X2 ) )
| ( ( sK1 @ ( sK4 @ X1 ) )
= $true ) ),
inference(argument_congruence,[],[f52]) ).
thf(f52,plain,
! [X0: a,X1: a > a] :
( ( ( ^ [Y0: a] :
( ( sK0 @ Y0 )
& ( ( sK2 @ Y0 )
= ( sK8 @ X0 @ X1 ) ) ) )
= ( (=) @ ( sK3 @ ( sK8 @ X0 @ X1 ) ) ) )
| ( ( sK1 @ ( sK4 @ X1 ) )
= $true )
| ( ( sK8 @ X0 @ X1 )
= X0 ) ),
inference(trivial_inequality_removal,[],[f51]) ).
thf(f51,plain,
! [X0: a,X1: a > a] :
( ( ( sK8 @ X0 @ X1 )
= X0 )
| ( ( sK1 @ ( sK4 @ X1 ) )
= $true )
| ( $true != $true )
| ( ( ^ [Y0: a] :
( ( sK0 @ Y0 )
& ( ( sK2 @ Y0 )
= ( sK8 @ X0 @ X1 ) ) ) )
= ( (=) @ ( sK3 @ ( sK8 @ X0 @ X1 ) ) ) ) ),
inference(superposition,[],[f21,f36]) ).
thf(f36,plain,
! [X6: a > a,X9: a] :
( ( $true
= ( sK1 @ ( sK8 @ X9 @ X6 ) ) )
| ( ( sK1 @ ( sK4 @ X6 ) )
= $true )
| ( ( sK8 @ X9 @ X6 )
= X9 ) ),
inference(binary_proxy_clausification,[],[f35]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : SEV089^5 : TPTP v8.2.0. Released v4.0.0.
% 0.06/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.15/0.35 % Computer : n016.cluster.edu
% 0.15/0.35 % Model : x86_64 x86_64
% 0.15/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.35 % Memory : 8042.1875MB
% 0.15/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.35 % CPULimit : 300
% 0.15/0.35 % WCLimit : 300
% 0.15/0.35 % DateTime : Sun May 19 18:42:38 EDT 2024
% 0.15/0.36 % CPUTime :
% 0.15/0.36 This is a TH0_THM_EQU_NAR problem
% 0.15/0.36 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.15/0.37 % (3115)lrs+10_1:1_au=on:inj=on:i=2:si=on:rtra=on_0 on theBenchmark for (2999ds/2Mi)
% 0.15/0.37 % (3115)Instruction limit reached!
% 0.15/0.37 % (3115)------------------------------
% 0.15/0.37 % (3115)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.15/0.37 % (3115)Termination reason: Unknown
% 0.15/0.37 % (3115)Termination phase: Saturation
% 0.15/0.37
% 0.15/0.37 % (3115)Memory used [KB]: 5500
% 0.15/0.37 % (3115)Time elapsed: 0.002 s
% 0.15/0.37 % (3115)Instructions burned: 3 (million)
% 0.15/0.37 % (3115)------------------------------
% 0.15/0.37 % (3115)------------------------------
% 0.15/0.38 % (3112)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.15/0.38 % (3113)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.15/0.38 % (3114)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.15/0.38 % (3116)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.15/0.38 % (3117)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.15/0.38 % (3118)lrs+1004_1:128_cond=on:e2e=on:sp=weighted_frequency:i=18:si=on:rtra=on_0 on theBenchmark for (2999ds/18Mi)
% 0.15/0.38 % (3119)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.15/0.38 % (3116)Instruction limit reached!
% 0.15/0.38 % (3116)------------------------------
% 0.15/0.38 % (3116)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.15/0.38 % (3116)Termination reason: Unknown
% 0.15/0.38 % (3116)Termination phase: Property scanning
% 0.15/0.38
% 0.15/0.38 % (3116)Memory used [KB]: 895
% 0.15/0.38 % (3116)Time elapsed: 0.003 s
% 0.15/0.38 % (3116)Instructions burned: 2 (million)
% 0.15/0.38 % (3116)------------------------------
% 0.15/0.38 % (3116)------------------------------
% 0.15/0.38 % (3119)Instruction limit reached!
% 0.15/0.38 % (3119)------------------------------
% 0.15/0.38 % (3119)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.15/0.38 % (3119)Termination reason: Unknown
% 0.15/0.38 % (3119)Termination phase: Saturation
% 0.15/0.38
% 0.15/0.38 % (3119)Memory used [KB]: 5500
% 0.15/0.38 % (3119)Time elapsed: 0.004 s
% 0.15/0.38 % (3119)Instructions burned: 3 (million)
% 0.15/0.38 % (3119)------------------------------
% 0.15/0.38 % (3119)------------------------------
% 0.15/0.38 % (3113)Instruction limit reached!
% 0.15/0.38 % (3113)------------------------------
% 0.15/0.38 % (3113)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.15/0.38 % (3113)Termination reason: Unknown
% 0.15/0.38 % (3113)Termination phase: Saturation
% 0.15/0.38
% 0.15/0.38 % (3113)Memory used [KB]: 5500
% 0.15/0.38 % (3113)Time elapsed: 0.005 s
% 0.15/0.38 % (3113)Instructions burned: 4 (million)
% 0.15/0.38 % (3120)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.15/0.38 % (3113)------------------------------
% 0.15/0.38 % (3113)------------------------------
% 0.15/0.39 % (3118)Instruction limit reached!
% 0.15/0.39 % (3118)------------------------------
% 0.15/0.39 % (3118)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.15/0.39 % (3118)Termination reason: Unknown
% 0.15/0.39 % (3118)Termination phase: Saturation
% 0.15/0.39
% 0.15/0.39 % (3118)Memory used [KB]: 5628
% 0.15/0.39 % (3118)Time elapsed: 0.014 s
% 0.15/0.39 % (3118)Instructions burned: 18 (million)
% 0.15/0.39 % (3118)------------------------------
% 0.15/0.39 % (3118)------------------------------
% 0.15/0.39 % (3120)Instruction limit reached!
% 0.15/0.39 % (3120)------------------------------
% 0.15/0.39 % (3120)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.15/0.39 % (3120)Termination reason: Unknown
% 0.15/0.39 % (3120)Termination phase: Saturation
% 0.15/0.39
% 0.15/0.39 % (3120)Memory used [KB]: 6012
% 0.15/0.39 % (3120)Time elapsed: 0.012 s
% 0.15/0.39 % (3120)Instructions burned: 39 (million)
% 0.15/0.39 % (3120)------------------------------
% 0.15/0.39 % (3120)------------------------------
% 0.15/0.39 % (3121)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.15/0.39 % (3122)dis+21_1:1_cbe=off:cnfonf=off:fs=off:fsr=off:hud=1:inj=on:i=3:si=on:rtra=on_0 on theBenchmark for (2999ds/3Mi)
% 0.15/0.39 % (3123)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.15/0.40 % (3122)Instruction limit reached!
% 0.15/0.40 % (3122)------------------------------
% 0.15/0.40 % (3122)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.15/0.40 % (3122)Termination reason: Unknown
% 0.15/0.40 % (3122)Termination phase: Saturation
% 0.15/0.40
% 0.15/0.40 % (3122)Memory used [KB]: 5500
% 0.15/0.40 % (3122)Time elapsed: 0.004 s
% 0.15/0.40 % (3122)Instructions burned: 3 (million)
% 0.15/0.40 % (3122)------------------------------
% 0.15/0.40 % (3122)------------------------------
% 0.21/0.40 % (3114)Instruction limit reached!
% 0.21/0.40 % (3114)------------------------------
% 0.21/0.40 % (3114)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.21/0.40 % (3114)Termination reason: Unknown
% 0.21/0.40 % (3114)Termination phase: Saturation
% 0.21/0.40
% 0.21/0.40 % (3114)Memory used [KB]: 5628
% 0.21/0.40 % (3114)Time elapsed: 0.022 s
% 0.21/0.40 % (3114)Instructions burned: 28 (million)
% 0.21/0.40 % (3114)------------------------------
% 0.21/0.40 % (3114)------------------------------
% 0.21/0.40 % (3129)lrs+10_1:1_acc=on:amm=sco:cs=on:tgt=full:i=16:si=on:rtra=on_0 on theBenchmark for (2999ds/16Mi)
% 0.21/0.40 % (3121)Instruction limit reached!
% 0.21/0.40 % (3121)------------------------------
% 0.21/0.40 % (3121)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.21/0.40 % (3121)Termination reason: Unknown
% 0.21/0.40 % (3121)Termination phase: Saturation
% 0.21/0.40
% 0.21/0.40 % (3121)Memory used [KB]: 5628
% 0.21/0.40 % (3121)Time elapsed: 0.013 s
% 0.21/0.40 % (3121)Instructions burned: 16 (million)
% 0.21/0.40 % (3121)------------------------------
% 0.21/0.40 % (3121)------------------------------
% 0.21/0.40 % (3129)Instruction limit reached!
% 0.21/0.40 % (3129)------------------------------
% 0.21/0.40 % (3129)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.21/0.40 % (3129)Termination reason: Unknown
% 0.21/0.40 % (3129)Termination phase: Saturation
% 0.21/0.40 % (3127)lrs+10_1:1_av=off:chr=on:plsq=on:slsq=on:i=7:si=on:rtra=on_0 on theBenchmark for (2999ds/7Mi)
% 0.21/0.40
% 0.21/0.40 % (3129)Memory used [KB]: 5628
% 0.21/0.40 % (3129)Time elapsed: 0.007 s
% 0.21/0.40 % (3129)Instructions burned: 16 (million)
% 0.21/0.40 % (3129)------------------------------
% 0.21/0.40 % (3129)------------------------------
% 0.21/0.41 % (3127)Instruction limit reached!
% 0.21/0.41 % (3127)------------------------------
% 0.21/0.41 % (3127)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.21/0.41 % (3127)Termination reason: Unknown
% 0.21/0.41 % (3127)Termination phase: Saturation
% 0.21/0.41
% 0.21/0.41 % (3127)Memory used [KB]: 1023
% 0.21/0.41 % (3127)Time elapsed: 0.007 s
% 0.21/0.41 % (3127)Instructions burned: 8 (million)
% 0.21/0.41 % (3127)------------------------------
% 0.21/0.41 % (3127)------------------------------
% 0.21/0.41 % (3132)lrs+21_1:1_au=on:cnfonf=off:fd=preordered:fe=off:fsr=off:hud=11:inj=on:kws=precedence:s2pl=no:sp=weighted_frequency:tgt=full:i=3:si=on:rtra=on_0 on theBenchmark for (2999ds/3Mi)
% 0.21/0.41 % (3138)lrs+10_1:1_cnfonf=off:cs=on:hud=3:prag=on:sup=off:i=7:si=on:rtra=on_0 on theBenchmark for (2999ds/7Mi)
% 0.21/0.41 % (3134)lrs+2_1:1_apa=on:au=on:bd=preordered:cnfonf=off:cs=on:ixr=off:sos=on:i=3:si=on:rtra=on_0 on theBenchmark for (2999ds/3Mi)
% 0.21/0.41 % (3132)Instruction limit reached!
% 0.21/0.41 % (3132)------------------------------
% 0.21/0.41 % (3132)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.21/0.41 % (3132)Termination reason: Unknown
% 0.21/0.41 % (3132)Termination phase: Saturation
% 0.21/0.41
% 0.21/0.41 % (3132)Memory used [KB]: 1023
% 0.21/0.41 % (3132)Time elapsed: 0.004 s
% 0.21/0.41 % (3132)Instructions burned: 4 (million)
% 0.21/0.41 % (3132)------------------------------
% 0.21/0.41 % (3132)------------------------------
% 0.21/0.41 % (3134)Instruction limit reached!
% 0.21/0.41 % (3134)------------------------------
% 0.21/0.41 % (3134)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.21/0.41 % (3134)Termination reason: Unknown
% 0.21/0.41 % (3134)Termination phase: Saturation
% 0.21/0.41
% 0.21/0.41 % (3134)Memory used [KB]: 1023
% 0.21/0.41 % (3134)Time elapsed: 0.004 s
% 0.21/0.41 % (3134)Instructions burned: 3 (million)
% 0.21/0.41 % (3134)------------------------------
% 0.21/0.41 % (3134)------------------------------
% 0.21/0.41 % (3138)Refutation not found, incomplete strategy
% 0.21/0.41 % (3138)------------------------------
% 0.21/0.41 % (3138)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.21/0.41 % (3138)Termination reason: Refutation not found, incomplete strategy
% 0.21/0.41
% 0.21/0.41
% 0.21/0.41 % (3138)Memory used [KB]: 5500
% 0.21/0.41 % (3138)Time elapsed: 0.003 s
% 0.21/0.41 % (3138)Instructions burned: 5 (million)
% 0.21/0.41 % (3138)------------------------------
% 0.21/0.41 % (3138)------------------------------
% 0.21/0.42 % (3139)dis+1002_1:1_add=large:cnfonf=lazy_pi_sigma_gen:fe=off:prag=on:i=3:si=on:rtra=on_0 on theBenchmark for (2999ds/3Mi)
% 0.21/0.42 % (3139)Instruction limit reached!
% 0.21/0.42 % (3139)------------------------------
% 0.21/0.42 % (3139)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.21/0.42 % (3139)Termination reason: Unknown
% 0.21/0.42 % (3139)Termination phase: Saturation
% 0.21/0.42
% 0.21/0.42 % (3139)Memory used [KB]: 5500
% 0.21/0.42 % (3139)Time elapsed: 0.004 s
% 0.21/0.42 % (3139)Instructions burned: 3 (million)
% 0.21/0.42 % (3139)------------------------------
% 0.21/0.42 % (3139)------------------------------
% 0.21/0.42 % (3147)lrs+1004_1:1_chr=on:prag=on:i=6:si=on:rtra=on_0 on theBenchmark for (2999ds/6Mi)
% 0.21/0.42 % (3142)dis+1004_1:1_cha=on:cs=on:fe=off:hud=1:i=4:si=on:rtra=on_0 on theBenchmark for (2999ds/4Mi)
% 0.21/0.42 % (3147)Instruction limit reached!
% 0.21/0.42 % (3147)------------------------------
% 0.21/0.42 % (3147)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.21/0.42 % (3147)Termination reason: Unknown
% 0.21/0.42 % (3147)Termination phase: Saturation
% 0.21/0.42
% 0.21/0.42 % (3147)Memory used [KB]: 5500
% 0.21/0.42 % (3147)Time elapsed: 0.004 s
% 0.21/0.42 % (3147)Instructions burned: 7 (million)
% 0.21/0.42 % (3147)------------------------------
% 0.21/0.42 % (3147)------------------------------
% 0.21/0.43 % (3142)Instruction limit reached!
% 0.21/0.43 % (3142)------------------------------
% 0.21/0.43 % (3142)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.21/0.43 % (3142)Termination reason: Unknown
% 0.21/0.43 % (3142)Termination phase: Saturation
% 0.21/0.43
% 0.21/0.43 % (3142)Memory used [KB]: 5500
% 0.21/0.43 % (3142)Time elapsed: 0.005 s
% 0.21/0.43 % (3142)Instructions burned: 4 (million)
% 0.21/0.43 % (3142)------------------------------
% 0.21/0.43 % (3142)------------------------------
% 0.21/0.43 % (3144)lrs+1002_1:1_anc=all_dependent:au=on:cbe=off:fde=unused:ntd=on:i=18:si=on:rtra=on_0 on theBenchmark for (2999ds/18Mi)
% 0.21/0.43 % (3146)lrs+10_1:1_e2e=on:sd=1:sgt=8:ss=axioms:i=710:si=on:rtra=on_0 on theBenchmark for (2999ds/710Mi)
% 0.21/0.43 % (3153)dis+21_1:8_apa=on:cnfonf=off:fd=off:fsr=off:hud=0:ins=1:kws=inv_frequency:nwc=10.0:ss=axioms:st=5.0:i=21:si=on:rtra=on_0 on theBenchmark for (2999ds/21Mi)
% 0.21/0.44 % (3151)dis+1002_5:1_au=on:bd=off:e2e=on:fde=none:fs=off:fsr=off:sos=on:i=902:si=on:rtra=on_0 on theBenchmark for (2999ds/902Mi)
% 0.21/0.44 % (3144)Instruction limit reached!
% 0.21/0.44 % (3144)------------------------------
% 0.21/0.44 % (3144)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.21/0.44 % (3144)Termination reason: Unknown
% 0.21/0.44 % (3144)Termination phase: Saturation
% 0.21/0.44
% 0.21/0.44 % (3144)Memory used [KB]: 5628
% 0.21/0.44 % (3144)Time elapsed: 0.014 s
% 0.21/0.44 % (3144)Instructions burned: 18 (million)
% 0.21/0.44 % (3144)------------------------------
% 0.21/0.44 % (3144)------------------------------
% 0.21/0.44 % (3153)Instruction limit reached!
% 0.21/0.44 % (3153)------------------------------
% 0.21/0.44 % (3153)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.21/0.44 % (3153)Termination reason: Unknown
% 0.21/0.44 % (3153)Termination phase: Saturation
% 0.21/0.44
% 0.21/0.44 % (3153)Memory used [KB]: 5628
% 0.21/0.44 % (3153)Time elapsed: 0.030 s
% 0.21/0.44 % (3153)Instructions burned: 21 (million)
% 0.21/0.44 % (3153)------------------------------
% 0.21/0.44 % (3153)------------------------------
% 0.21/0.44 % (3156)dis+10_1:1_cnfonf=lazy_gen:fe=off:i=5:si=on:rtra=on_0 on theBenchmark for (2999ds/5Mi)
% 0.21/0.44 % (3156)Instruction limit reached!
% 0.21/0.44 % (3156)------------------------------
% 0.21/0.44 % (3156)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.21/0.44 % (3156)Termination reason: Unknown
% 0.21/0.44 % (3156)Termination phase: Saturation
% 0.21/0.44
% 0.21/0.44 % (3156)Memory used [KB]: 5500
% 0.21/0.44 % (3156)Time elapsed: 0.005 s
% 0.21/0.44 % (3156)Instructions burned: 5 (million)
% 0.21/0.44 % (3156)------------------------------
% 0.21/0.44 % (3156)------------------------------
% 0.21/0.45 % (3163)lrs+1002_1:128_au=on:c=on:fsr=off:piset=equals:i=377:si=on:rtra=on_0 on theBenchmark for (2999ds/377Mi)
% 0.21/0.45 % (3161)lrs+2_1:1_cnfonf=lazy_not_gen_be_off:cs=on:fe=off:hud=10:inj=on:ins=3:plsq=on:plsqc=1:sd=10:ss=axioms:tnu=1:i=6:si=on:rtra=on_0 on theBenchmark for (2999ds/6Mi)
% 0.21/0.46 % (3161)Instruction limit reached!
% 0.21/0.46 % (3161)------------------------------
% 0.21/0.46 % (3161)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.21/0.46 % (3161)Termination reason: Unknown
% 0.21/0.46 % (3161)Termination phase: Saturation
% 0.21/0.46
% 0.21/0.46 % (3161)Memory used [KB]: 5500
% 0.21/0.46 % (3161)Time elapsed: 0.005 s
% 0.21/0.46 % (3161)Instructions burned: 6 (million)
% 0.21/0.46 % (3161)------------------------------
% 0.21/0.46 % (3161)------------------------------
% 0.21/0.46 % (3166)dis+1010_1:4_atotf=0.2:c=on:cbe=off:cnfonf=lazy_simp:fe=off:ins=2:ntd=on:s2a=on:s2at=5.0:sgt=5:ss=axioms:st=1.5:i=779:si=on:rtra=on_0 on theBenchmark for (2999ds/779Mi)
% 0.21/0.47 % (3174)lrs+10_1:1_cnfonf=lazy_not_be_gen:ntd=on:sp=const_min:ss=axioms:sup=off:i=19:si=on:rtra=on_0 on theBenchmark for (2999ds/19Mi)
% 0.21/0.48 % (3112)Instruction limit reached!
% 0.21/0.48 % (3112)------------------------------
% 0.21/0.48 % (3112)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.21/0.48 % (3112)Termination reason: Unknown
% 0.21/0.48 % (3112)Termination phase: Saturation
% 0.21/0.48
% 0.21/0.48 % (3112)Memory used [KB]: 5884
% 0.21/0.48 % (3112)Time elapsed: 0.104 s
% 0.21/0.48 % (3112)Instructions burned: 185 (million)
% 0.21/0.48 % (3112)------------------------------
% 0.21/0.48 % (3112)------------------------------
% 0.21/0.48 % (3174)Instruction limit reached!
% 0.21/0.48 % (3174)------------------------------
% 0.21/0.48 % (3174)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.21/0.48 % (3174)Termination reason: Unknown
% 0.21/0.48 % (3174)Termination phase: Saturation
% 0.21/0.48
% 0.21/0.48 % (3174)Memory used [KB]: 5628
% 0.21/0.48 % (3174)Time elapsed: 0.033 s
% 0.21/0.48 % (3174)Instructions burned: 19 (million)
% 0.21/0.48 % (3174)------------------------------
% 0.21/0.48 % (3174)------------------------------
% 0.21/0.49 % (3183)dis+1002_1:128_acc=on:er=filter:i=17:si=on:rtra=on_0 on theBenchmark for (2998ds/17Mi)
% 0.21/0.49 % (3182)lrs+1010_1:1_au=on:s2a=on:sd=1:sgt=50:ss=axioms:i=879:si=on:rtra=on_0 on theBenchmark for (2998ds/879Mi)
% 0.21/0.50 % (3183)Instruction limit reached!
% 0.21/0.50 % (3183)------------------------------
% 0.21/0.50 % (3183)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.21/0.50 % (3183)Termination reason: Unknown
% 0.21/0.50 % (3183)Termination phase: Saturation
% 0.21/0.50
% 0.21/0.50 % (3183)Memory used [KB]: 5628
% 0.21/0.50 % (3183)Time elapsed: 0.008 s
% 0.21/0.50 % (3183)Instructions burned: 18 (million)
% 0.21/0.50 % (3183)------------------------------
% 0.21/0.50 % (3183)------------------------------
% 0.21/0.50 % (3191)ott+21_1:1_apa=on:au=on:cnfonf=off:sos=on:i=3:si=on:rtra=on_0 on theBenchmark for (2998ds/3Mi)
% 0.21/0.50 % (3191)Instruction limit reached!
% 0.21/0.50 % (3191)------------------------------
% 0.21/0.50 % (3191)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.21/0.50 % (3191)Termination reason: Unknown
% 0.21/0.50 % (3191)Termination phase: Property scanning
% 0.21/0.50
% 0.21/0.50 % (3191)Memory used [KB]: 1023
% 0.21/0.50 % (3191)Time elapsed: 0.002 s
% 0.21/0.50 % (3191)Instructions burned: 3 (million)
% 0.21/0.50 % (3191)------------------------------
% 0.21/0.50 % (3191)------------------------------
% 0.21/0.51 % (3196)lrs+1010_1:8_cnfonf=off:hud=1:inj=on:tnu=5:i=30:si=on:rtra=on_0 on theBenchmark for (2998ds/30Mi)
% 0.21/0.52 % (3196)Instruction limit reached!
% 0.21/0.52 % (3196)------------------------------
% 0.21/0.52 % (3196)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.21/0.52 % (3196)Termination reason: Unknown
% 0.21/0.52 % (3196)Termination phase: Saturation
% 0.21/0.52
% 0.21/0.52 % (3196)Memory used [KB]: 5628
% 0.21/0.52 % (3196)Time elapsed: 0.012 s
% 0.21/0.52 % (3196)Instructions burned: 30 (million)
% 0.21/0.52 % (3196)------------------------------
% 0.21/0.52 % (3196)------------------------------
% 0.21/0.53 % (3117)Instruction limit reached!
% 0.21/0.53 % (3117)------------------------------
% 0.21/0.53 % (3117)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.21/0.53 % (3117)Termination reason: Unknown
% 0.21/0.53 % (3117)Termination phase: Saturation
% 0.21/0.53
% 0.21/0.53 % (3117)Memory used [KB]: 6140
% 0.21/0.53 % (3117)Time elapsed: 0.152 s
% 0.21/0.53 % (3117)Instructions burned: 277 (million)
% 0.21/0.53 % (3117)------------------------------
% 0.21/0.53 % (3117)------------------------------
% 0.21/0.53 % (3202)dis+10_1:1_ixr=off:plsq=on:plsqc=1:plsqr=32,1:s2a=on:i=127:si=on:rtra=on_0 on theBenchmark for (2998ds/127Mi)
% 0.21/0.54 % (3206)lrs+1002_1:1_au=on:cbe=off:cnfonf=conj_eager:cond=on:hi=on:i=100:si=on:rtra=on_0 on theBenchmark for (2998ds/100Mi)
% 0.21/0.57 % (3202)Instruction limit reached!
% 0.21/0.57 % (3202)------------------------------
% 0.21/0.57 % (3202)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.21/0.57 % (3202)Termination reason: Unknown
% 0.21/0.57 % (3202)Termination phase: Saturation
% 0.21/0.57
% 0.21/0.57 % (3202)Memory used [KB]: 6652
% 0.21/0.57 % (3202)Time elapsed: 0.037 s
% 0.21/0.57 % (3202)Instructions burned: 127 (million)
% 0.21/0.57 % (3202)------------------------------
% 0.21/0.57 % (3202)------------------------------
% 0.21/0.58 % (3230)dis+10_1:1_anc=none:cnfonf=lazy_gen:fd=preordered:fe=off:hud=10:ins=3:ixr=off:nwc=5.0:plsq=on:plsqc=1:plsqr=32,1:sp=const_frequency:uhcvi=on:i=3:si=on:rtra=on_0 on theBenchmark for (2997ds/3Mi)
% 0.21/0.58 % (3230)Instruction limit reached!
% 0.21/0.58 % (3230)------------------------------
% 0.21/0.58 % (3230)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.21/0.58 % (3230)Termination reason: Unknown
% 0.21/0.58 % (3230)Termination phase: Saturation
% 0.21/0.58
% 0.21/0.58 % (3230)Memory used [KB]: 5500
% 0.21/0.58 % (3230)Time elapsed: 0.002 s
% 0.21/0.58 % (3230)Instructions burned: 3 (million)
% 0.21/0.58 % (3230)------------------------------
% 0.21/0.58 % (3230)------------------------------
% 0.21/0.58 % (3206)Instruction limit reached!
% 0.21/0.58 % (3206)------------------------------
% 0.21/0.58 % (3206)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.21/0.58 % (3206)Termination reason: Unknown
% 0.21/0.58 % (3206)Termination phase: Saturation
% 0.21/0.58
% 0.21/0.58 % (3206)Memory used [KB]: 5884
% 0.21/0.58 % (3206)Time elapsed: 0.041 s
% 0.21/0.58 % (3206)Instructions burned: 101 (million)
% 0.21/0.58 % (3206)------------------------------
% 0.21/0.58 % (3206)------------------------------
% 0.21/0.59 % (3163)Refutation not found, non-redundant clauses discarded% (3163)------------------------------
% 0.21/0.59 % (3163)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.21/0.59 % (3163)Termination reason: Refutation not found, non-redundant clauses discarded
% 0.21/0.59
% 0.21/0.59 % (3163)Memory used [KB]: 6268
% 0.21/0.59 % (3163)Time elapsed: 0.162 s
% 0.21/0.59 % (3163)Instructions burned: 345 (million)
% 0.21/0.59 % (3163)------------------------------
% 0.21/0.59 % (3163)------------------------------
% 0.21/0.59 % (3241)lrs+10_8:1_au=on:avsq=on:e2e=on:ins=3:s2a=on:s2at=3.0:ss=axioms:i=20:si=on:rtra=on_0 on theBenchmark for (2997ds/20Mi)
% 1.89/0.60 % (3241)Instruction limit reached!
% 1.89/0.60 % (3241)------------------------------
% 1.89/0.60 % (3241)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 1.89/0.60 % (3241)Termination reason: Unknown
% 1.89/0.60 % (3241)Termination phase: Saturation
% 1.89/0.60
% 1.89/0.60 % (3241)Memory used [KB]: 5628
% 1.89/0.60 % (3241)Time elapsed: 0.009 s
% 1.89/0.60 % (3241)Instructions burned: 20 (million)
% 1.89/0.60 % (3241)------------------------------
% 1.89/0.60 % (3241)------------------------------
% 1.89/0.60 % (3248)lrs+1010_1:1_au=on:cbe=off:nm=2:ntd=on:sd=2:ss=axioms:st=5.0:i=107:si=on:rtra=on_0 on theBenchmark for (2997ds/107Mi)
% 1.89/0.60 % (3182)First to succeed.
% 1.89/0.60 % (3242)dis+1002_1:1_cbe=off:hud=5:nm=4:plsq=on:plsqr=7,1:prag=on:sp=const_max:tnu=1:i=86:si=on:rtra=on_0 on theBenchmark for (2997ds/86Mi)
% 1.89/0.60 % (3182)Refutation found. Thanks to Tanya!
% 1.89/0.60 % SZS status Theorem for theBenchmark
% 1.89/0.60 % SZS output start Proof for theBenchmark
% See solution above
% 1.89/0.60 % (3182)------------------------------
% 1.89/0.60 % (3182)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 1.89/0.60 % (3182)Termination reason: Refutation
% 1.89/0.60
% 1.89/0.60 % (3182)Memory used [KB]: 6140
% 1.89/0.60 % (3182)Time elapsed: 0.112 s
% 1.89/0.60 % (3182)Instructions burned: 297 (million)
% 1.89/0.60 % (3182)------------------------------
% 1.89/0.60 % (3182)------------------------------
% 1.89/0.60 % (3111)Success in time 0.236 s
% 1.89/0.60 % Vampire---4.8 exiting
%------------------------------------------------------------------------------