TSTP Solution File: GRA028^1 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : GRA028^1 : TPTP v8.2.0. Released v3.6.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 : n020.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Mon May 20 20:42:27 EDT 2024
% Result : Theorem 1.83s 0.60s
% Output : Refutation 1.83s
% Verified :
% SZS Type : Refutation
% Derivation depth : 57
% Number of leaves : 11
% Syntax : Number of formulae : 99 ( 4 unt; 3 typ; 0 def)
% Number of atoms : 1468 ( 752 equ; 9 cnn)
% Maximal formula atoms : 46 ( 15 avg)
% Number of connectives : 1640 ( 174 ~; 621 |; 107 &; 722 @)
% ( 5 <=>; 11 =>; 0 <=; 0 <~>)
% Maximal formula depth : 31 ( 12 avg)
% Number of types : 1 ( 0 usr)
% Number of type conns : 427 ( 427 >; 0 *; 0 +; 0 <<)
% Number of symbols : 12 ( 8 usr; 8 con; 0-2 aty)
% Number of variables : 456 ( 38 ^ 363 !; 54 ?; 456 :)
% ( 1 !>; 0 ?*; 0 @-; 0 @+)
% Comments :
%------------------------------------------------------------------------------
thf(func_def_3,type,
sK0: ( $o > $o ) > ( $o > $o ) > $o ).
thf(func_def_9,type,
ph2:
!>[X0: $tType] : X0 ).
thf(func_def_10,type,
sK3: $o > $o ).
thf(f736,plain,
$false,
inference(avatar_sat_refutation,[],[f508,f594,f598,f629,f716,f735]) ).
thf(f735,plain,
( spl1_2
| spl1_2
| ~ spl1_16 ),
inference(avatar_split_clause,[],[f732,f714,f506,f506]) ).
thf(f506,plain,
( spl1_2
<=> ! [X0: $o] : ( $true = X0 ) ),
introduced(avatar_definition,[new_symbols(naming,[spl1_2])]) ).
thf(f714,plain,
( spl1_16
<=> ! [X1: $o] :
( ( $true = X1 )
| ( ( (=) @ X1 )
= ( ^ [Y0: $o] : $false ) ) ) ),
introduced(avatar_definition,[new_symbols(naming,[spl1_16])]) ).
thf(f732,plain,
( ! [X2: $o,X1: $o] :
( ( $true = X2 )
| ( $true = X1 ) )
| ~ spl1_16 ),
inference(duplicate_literal_removal,[],[f730]) ).
thf(f730,plain,
( ! [X2: $o,X1: $o] :
( ( $true = X1 )
| ( $true = X2 )
| ( $true = X1 ) )
| ~ spl1_16 ),
inference(binary_proxy_clausification,[],[f729]) ).
thf(f729,plain,
( ! [X2: $o,X1: $o] :
( ( X1 != X2 )
| ( $true = X1 ) )
| ~ spl1_16 ),
inference(equality_proxy_clausification,[],[f728]) ).
thf(f728,plain,
( ! [X2: $o,X1: $o] :
( ( $true = X1 )
| ( $false
= ( X1 = X2 ) ) )
| ~ spl1_16 ),
inference(beta_eta_normalization,[],[f721]) ).
thf(f721,plain,
( ! [X2: $o,X1: $o] :
( ( ( ^ [Y0: $o] : $false
@ X2 )
= ( X1 = X2 ) )
| ( $true = X1 ) )
| ~ spl1_16 ),
inference(argument_congruence,[],[f715]) ).
thf(f715,plain,
( ! [X1: $o] :
( ( ( (=) @ X1 )
= ( ^ [Y0: $o] : $false ) )
| ( $true = X1 ) )
| ~ spl1_16 ),
inference(avatar_component_clause,[],[f714]) ).
thf(f716,plain,
( spl1_16
| spl1_3
| ~ spl1_9 ),
inference(avatar_split_clause,[],[f711,f627,f510,f714]) ).
thf(f510,plain,
( spl1_3
<=> ! [X0: $o] : ( $false = X0 ) ),
introduced(avatar_definition,[new_symbols(naming,[spl1_3])]) ).
thf(f627,plain,
( spl1_9
<=> ! [X2: $o > $o,X3: $o,X4: $o] :
( ( ( ^ [Y0: $o] : $false )
= X2 )
| ( $false
= ( X2 @ X4 ) )
| ( ( X2 @ X3 )
= $true )
| ( $true = X4 ) ) ),
introduced(avatar_definition,[new_symbols(naming,[spl1_9])]) ).
thf(f711,plain,
( ! [X0: $o,X1: $o] :
( ( $true = X1 )
| ( $false = X0 )
| ( ( (=) @ X1 )
= ( ^ [Y0: $o] : $false ) ) )
| ~ spl1_9 ),
inference(duplicate_literal_removal,[],[f710]) ).
thf(f710,plain,
( ! [X0: $o,X1: $o] :
( ( ( (=) @ X1 )
= ( ^ [Y0: $o] : $false ) )
| ( $true = X1 )
| ( $true = X1 )
| ( $false = X0 ) )
| ~ spl1_9 ),
inference(binary_proxy_clausification,[],[f700]) ).
thf(f700,plain,
( ! [X0: $o,X1: $o] :
( ( ( (=) @ X1 )
= ( ^ [Y0: $o] : $false ) )
| ( $true = X1 )
| ( X0 = X1 ) )
| ~ spl1_9 ),
inference(leibniz_equality_elimination,[],[f628]) ).
thf(f628,plain,
( ! [X2: $o > $o,X3: $o,X4: $o] :
( ( ( ^ [Y0: $o] : $false )
= X2 )
| ( ( X2 @ X3 )
= $true )
| ( $false
= ( X2 @ X4 ) )
| ( $true = X4 ) )
| ~ spl1_9 ),
inference(avatar_component_clause,[],[f627]) ).
thf(f629,plain,
( spl1_3
| spl1_9
| ~ spl1_1 ),
inference(avatar_split_clause,[],[f617,f503,f627,f510]) ).
thf(f503,plain,
( spl1_1
<=> ! [X2: $o > $o,X1: $o,X3: $o] :
( ( ( X2 @ X3 )
= $true )
| ( $false = X1 )
| ( ( ^ [Y0: $o] : $false )
= X2 )
| ( ( (=) @ X1 )
= X2 ) ) ),
introduced(avatar_definition,[new_symbols(naming,[spl1_1])]) ).
thf(f617,plain,
( ! [X2: $o > $o,X3: $o,X1: $o,X4: $o] :
( ( ( ^ [Y0: $o] : $false )
= X2 )
| ( $true = X4 )
| ( ( X2 @ X3 )
= $true )
| ( $false = X1 )
| ( $false
= ( X2 @ X4 ) ) )
| ~ spl1_1 ),
inference(duplicate_literal_removal,[],[f616]) ).
thf(f616,plain,
( ! [X2: $o > $o,X3: $o,X1: $o,X4: $o] :
( ( $false = X1 )
| ( ( ^ [Y0: $o] : $false )
= X2 )
| ( $false
= ( X2 @ X4 ) )
| ( ( X2 @ X3 )
= $true )
| ( $true = X4 )
| ( $false = X1 ) )
| ~ spl1_1 ),
inference(binary_proxy_clausification,[],[f614]) ).
thf(f614,plain,
( ! [X2: $o > $o,X3: $o,X1: $o,X4: $o] :
( ( X1 = X4 )
| ( ( ^ [Y0: $o] : $false )
= X2 )
| ( $false = X1 )
| ( $false
= ( X2 @ X4 ) )
| ( ( X2 @ X3 )
= $true ) )
| ~ spl1_1 ),
inference(equality_proxy_clausification,[],[f608]) ).
thf(f608,plain,
( ! [X2: $o > $o,X3: $o,X1: $o,X4: $o] :
( ( $false
= ( X2 @ X4 ) )
| ( ( X1 = X4 )
= $true )
| ( $false = X1 )
| ( ( ^ [Y0: $o] : $false )
= X2 )
| ( ( X2 @ X3 )
= $true ) )
| ~ spl1_1 ),
inference(binary_proxy_clausification,[],[f603]) ).
thf(f603,plain,
( ! [X2: $o > $o,X3: $o,X1: $o,X4: $o] :
( ( $false = X1 )
| ( ( X2 @ X3 )
= $true )
| ( ( ^ [Y0: $o] : $false )
= X2 )
| ( ( X1 = X4 )
= ( X2 @ X4 ) ) )
| ~ spl1_1 ),
inference(argument_congruence,[],[f504]) ).
thf(f504,plain,
( ! [X2: $o > $o,X3: $o,X1: $o] :
( ( ( (=) @ X1 )
= X2 )
| ( ( X2 @ X3 )
= $true )
| ( $false = X1 )
| ( ( ^ [Y0: $o] : $false )
= X2 ) )
| ~ spl1_1 ),
inference(avatar_component_clause,[],[f503]) ).
thf(f598,plain,
~ spl1_2,
inference(avatar_contradiction_clause,[],[f597]) ).
thf(f597,plain,
( $false
| ~ spl1_2 ),
inference(equality_resolution,[],[f585]) ).
thf(f585,plain,
( ! [X0: $o] : ( $false != X0 )
| ~ spl1_2 ),
inference(superposition,[],[f3,f507]) ).
thf(f507,plain,
( ! [X0: $o] : ( $true = X0 )
| ~ spl1_2 ),
inference(avatar_component_clause,[],[f506]) ).
thf(f3,plain,
$false != $true,
introduced(fool_axiom,[]) ).
thf(f594,plain,
~ spl1_3,
inference(avatar_contradiction_clause,[],[f593]) ).
thf(f593,plain,
( $false
| ~ spl1_3 ),
inference(trivial_inequality_removal,[],[f592]) ).
thf(f592,plain,
( ( $false != $false )
| ~ spl1_3 ),
inference(superposition,[],[f3,f511]) ).
thf(f511,plain,
( ! [X0: $o] : ( $false = X0 )
| ~ spl1_3 ),
inference(avatar_component_clause,[],[f510]) ).
thf(f508,plain,
( spl1_1
| spl1_2 ),
inference(avatar_split_clause,[],[f500,f506,f503]) ).
thf(f500,plain,
! [X2: $o > $o,X3: $o,X0: $o,X1: $o] :
( ( ( X2 @ X3 )
= $true )
| ( ( (=) @ X1 )
= X2 )
| ( $true = X0 )
| ( ( ^ [Y0: $o] : $false )
= X2 )
| ( $false = X1 ) ),
inference(binary_proxy_clausification,[],[f485]) ).
thf(f485,plain,
! [X2: $o > $o,X3: $o,X0: $o,X1: $o] :
( ( ( ^ [Y0: $o] : $false )
= X2 )
| ( ( (=) @ X1 )
= X2 )
| ( X0 = X1 )
| ( ( X2 @ X3 )
= $true ) ),
inference(leibniz_equality_elimination,[],[f484]) ).
thf(f484,plain,
! [X0: $o > $o,X1: $o > $o,X6: $o,X7: $o,X5: $o] :
( ( ( ^ [Y0: $o] : $false )
= X0 )
| ( $false
= ( X1 @ X7 ) )
| ( X0 = X1 )
| ( ( X0 @ X6 )
= $true )
| ( ( X1 @ X5 )
= $true ) ),
inference(beta_eta_normalization,[],[f476]) ).
thf(f476,plain,
! [X0: $o > $o,X1: $o > $o,X6: $o,X7: $o,X5: $o] :
( ( ( X1 @ X5 )
= $true )
| ( ( X0 @ X6 )
= $true )
| ( ( X1 @ X7 )
= ( ^ [Y0: $o] : $false
@ X7 ) )
| ( X0 = X1 )
| ( ( ^ [Y0: $o] : $false )
= X0 ) ),
inference(argument_congruence,[],[f474]) ).
thf(f474,plain,
! [X0: $o > $o,X1: $o > $o,X6: $o,X5: $o] :
( ( ( ^ [Y0: $o] : $false )
= X1 )
| ( ( X0 @ X6 )
= $true )
| ( X0 = X1 )
| ( ( X1 @ X5 )
= $true )
| ( ( ^ [Y0: $o] : $false )
= X0 ) ),
inference(trivial_inequality_removal,[],[f473]) ).
thf(f473,plain,
! [X0: $o > $o,X1: $o > $o,X6: $o,X5: $o] :
( ( X0 = X1 )
| ( ( ^ [Y0: $o] : $false )
= X1 )
| ( ( ^ [Y0: $o] : $false )
= X0 )
| ( $false = $true )
| ( ( X0 @ X6 )
= $true )
| ( ( X1 @ X5 )
= $true ) ),
inference(beta_eta_normalization,[],[f461]) ).
thf(f461,plain,
! [X0: $o > $o,X1: $o > $o,X6: $o,X4: $o,X5: $o] :
( ( ( ^ [Y0: $o] : $false )
= X1 )
| ( X0 = X1 )
| ( ( X1 @ X5 )
= $true )
| ( ( ^ [Y0: $o] : $false
@ X4 )
= $true )
| ( ( X0 @ X6 )
= $true )
| ( ( ^ [Y0: $o] : $false )
= X0 ) ),
inference(primitive_instantiation,[],[f455]) ).
thf(f455,plain,
! [X3: $o > $o,X0: $o > $o,X1: $o > $o,X6: $o,X4: $o,X5: $o] :
( ( ( X3 @ X4 )
= $true )
| ( X1 = X3 )
| ( X0 = X1 )
| ( ( X1 @ X5 )
= $true )
| ( X0 = X3 )
| ( ( X0 @ X6 )
= $true ) ),
inference(beta_eta_normalization,[],[f438]) ).
thf(f438,plain,
! [X3: $o > $o,X0: $o > $o,X1: $o > $o,X6: $o,X4: $o,X5: $o] :
( ( ( X1 @ X5 )
= $true )
| ( X0 = X1 )
| ( X0 = X3 )
| ( ( X3 @ X4 )
= $true )
| ( ( X0 @ X6 )
= ( ^ [Y0: $o] : $true
@ X6 ) )
| ( X1 = X3 ) ),
inference(argument_congruence,[],[f430]) ).
thf(f430,plain,
! [X3: $o > $o,X0: $o > $o,X1: $o > $o,X4: $o,X5: $o] :
( ( ( ^ [Y0: $o] : $true )
= X0 )
| ( X0 = X3 )
| ( X0 = X1 )
| ( ( X3 @ X4 )
= $true )
| ( X1 = X3 )
| ( ( X1 @ X5 )
= $true ) ),
inference(beta_eta_normalization,[],[f416]) ).
thf(f416,plain,
! [X3: $o > $o,X0: $o > $o,X1: $o > $o,X4: $o,X5: $o] :
( ( ( X3 @ X4 )
= $true )
| ( X0 = X1 )
| ( ( X1 @ X5 )
= ( ^ [Y0: $o] : $true
@ X5 ) )
| ( X1 = X3 )
| ( X0 = X3 )
| ( ( ^ [Y0: $o] : $true )
= X0 ) ),
inference(argument_congruence,[],[f412]) ).
thf(f412,plain,
! [X3: $o > $o,X0: $o > $o,X1: $o > $o,X4: $o] :
( ( ( ^ [Y0: $o] : $true )
= X1 )
| ( ( X3 @ X4 )
= $true )
| ( X0 = X3 )
| ( ( ^ [Y0: $o] : $true )
= X0 )
| ( X1 = X3 )
| ( X0 = X1 ) ),
inference(trivial_inequality_removal,[],[f411]) ).
thf(f411,plain,
! [X3: $o > $o,X0: $o > $o,X1: $o > $o,X4: $o] :
( ( $false = $true )
| ( X0 = X1 )
| ( ( ^ [Y0: $o] : $true )
= X0 )
| ( ( ^ [Y0: $o] : $true )
= X1 )
| ( X0 = X3 )
| ( ( X3 @ X4 )
= $true )
| ( X1 = X3 ) ),
inference(beta_eta_normalization,[],[f405]) ).
thf(f405,plain,
! [X3: $o > $o,X0: $o > $o,X1: $o > $o,X4: $o] :
( ( X0 = X3 )
| ( $false
= ( ^ [Y0: $o] : $true
@ X4 ) )
| ( ( ^ [Y0: $o] : $true )
= X1 )
| ( X1 = X3 )
| ( ( X3 @ X4 )
= $true )
| ( X0 = X1 )
| ( ( ^ [Y0: $o] : $true )
= X0 ) ),
inference(primitive_instantiation,[],[f401]) ).
thf(f401,plain,
! [X2: $o > $o,X3: $o > $o,X0: $o > $o,X1: $o > $o,X4: $o] :
( ( $false
= ( X2 @ X4 ) )
| ( X0 = X3 )
| ( X1 = X2 )
| ( X0 = X1 )
| ( X1 = X3 )
| ( ( X3 @ X4 )
= $true )
| ( X0 = X2 ) ),
inference(binary_proxy_clausification,[],[f381]) ).
thf(f381,plain,
! [X2: $o > $o,X3: $o > $o,X0: $o > $o,X1: $o > $o,X4: $o] :
( ( ( X3 @ X4 )
= ( X2 @ X4 ) )
| ( X1 = X3 )
| ( X0 = X2 )
| ( X0 = X3 )
| ( X0 = X1 )
| ( X1 = X2 ) ),
inference(argument_congruence,[],[f379]) ).
thf(f379,plain,
! [X2: $o > $o,X3: $o > $o,X0: $o > $o,X1: $o > $o] :
( ( X2 = X3 )
| ( X1 = X3 )
| ( X0 = X1 )
| ( X0 = X3 )
| ( X0 = X2 )
| ( X1 = X2 ) ),
inference(trivial_inequality_removal,[],[f378]) ).
thf(f378,plain,
! [X2: $o > $o,X3: $o > $o,X0: $o > $o,X1: $o > $o] :
( ( X0 = X3 )
| ( X1 = X3 )
| ( X2 = X3 )
| ( X0 = X1 )
| ( X0 = X2 )
| ( $true != $true )
| ( X1 = X2 ) ),
inference(duplicate_literal_removal,[],[f364]) ).
thf(f364,plain,
! [X2: $o > $o,X3: $o > $o,X0: $o > $o,X1: $o > $o] :
( ( X0 = X2 )
| ( X2 = X3 )
| ( X0 = X1 )
| ( X0 = X1 )
| ( X0 = X3 )
| ( $true != $true )
| ( X1 = X2 )
| ( X1 = X3 ) ),
inference(superposition,[],[f16,f353]) ).
thf(f353,plain,
! [X2: $o > $o,X3: $o > $o,X0: $o > $o,X1: $o > $o] :
( ( $true
= ( sK0 @ X3 @ X2 ) )
| ( X0 = X3 )
| ( X0 = X1 )
| ( X1 = X3 )
| ( X1 = X2 )
| ( X2 = X3 )
| ( X0 = X2 ) ),
inference(trivial_inequality_removal,[],[f352]) ).
thf(f352,plain,
! [X2: $o > $o,X3: $o > $o,X0: $o > $o,X1: $o > $o] :
( ( X1 = X2 )
| ( X2 = X3 )
| ( X0 = X1 )
| ( X0 = X2 )
| ( $true
= ( sK0 @ X3 @ X2 ) )
| ( $true != $true )
| ( X0 = X3 )
| ( X1 = X3 ) ),
inference(duplicate_literal_removal,[],[f340]) ).
thf(f340,plain,
! [X2: $o > $o,X3: $o > $o,X0: $o > $o,X1: $o > $o] :
( ( X1 = X3 )
| ( $true != $true )
| ( X0 = X3 )
| ( X2 = X3 )
| ( $true
= ( sK0 @ X3 @ X2 ) )
| ( X0 = X2 )
| ( X0 = X1 )
| ( X1 = X2 )
| ( X0 = X1 ) ),
inference(superposition,[],[f16,f328]) ).
thf(f328,plain,
! [X2: $o > $o,X3: $o > $o,X0: $o > $o,X1: $o > $o] :
( ( ( sK0 @ X3 @ X1 )
= $true )
| ( X0 = X2 )
| ( X0 = X1 )
| ( X2 = X3 )
| ( X1 = X2 )
| ( ( sK0 @ X0 @ X2 )
= $true )
| ( X0 = X3 )
| ( X1 = X3 ) ),
inference(trivial_inequality_removal,[],[f327]) ).
thf(f327,plain,
! [X2: $o > $o,X3: $o > $o,X0: $o > $o,X1: $o > $o] :
( ( ( sK0 @ X3 @ X1 )
= $true )
| ( ( sK0 @ X0 @ X2 )
= $true )
| ( X0 = X1 )
| ( X2 = X3 )
| ( X0 = X3 )
| ( $false = $true )
| ( X1 = X2 )
| ( X0 = X2 )
| ( X1 = X3 ) ),
inference(duplicate_literal_removal,[],[f311]) ).
thf(f311,plain,
! [X2: $o > $o,X3: $o > $o,X0: $o > $o,X1: $o > $o] :
( ( X1 = X2 )
| ( ( sK0 @ X3 @ X1 )
= $true )
| ( X0 = X1 )
| ( X0 = X1 )
| ( X0 = X3 )
| ( X1 = X3 )
| ( $false = $true )
| ( ( sK0 @ X0 @ X2 )
= $true )
| ( X0 = X2 )
| ( X2 = X3 ) ),
inference(superposition,[],[f308,f20]) ).
thf(f20,plain,
! [X0: $o > $o,X1: $o > $o] :
( ( $false
= ( sK0 @ X0 @ X1 ) )
| ( X0 = X1 ) ),
inference(trivial_inequality_removal,[],[f19]) ).
thf(f19,plain,
! [X0: $o > $o,X1: $o > $o] :
( ( X0 = X1 )
| ( $true != $true )
| ( $false
= ( sK0 @ X0 @ X1 ) ) ),
inference(fool_paramodulation,[],[f16]) ).
thf(f308,plain,
! [X2: $o > $o,X3: $o > $o,X0: $o > $o,X1: $o > $o] :
( ( $true
= ( sK0 @ X2 @ X3 ) )
| ( X1 = X2 )
| ( ( sK0 @ X2 @ X0 )
= $true )
| ( X2 = X3 )
| ( X0 = X2 )
| ( X1 = X3 )
| ( X0 = X1 )
| ( ( sK0 @ X1 @ X3 )
= $true )
| ( X0 = X3 ) ),
inference(trivial_inequality_removal,[],[f307]) ).
thf(f307,plain,
! [X2: $o > $o,X3: $o > $o,X0: $o > $o,X1: $o > $o] :
( ( ( sK0 @ X2 @ X0 )
= $true )
| ( ( sK0 @ X1 @ X3 )
= $true )
| ( X0 = X1 )
| ( X2 = X3 )
| ( X1 = X3 )
| ( $true
= ( sK0 @ X2 @ X3 ) )
| ( X1 = X2 )
| ( X0 = X2 )
| ( X0 = X3 )
| ( $false = $true ) ),
inference(duplicate_literal_removal,[],[f288]) ).
thf(f288,plain,
! [X2: $o > $o,X3: $o > $o,X0: $o > $o,X1: $o > $o] :
( ( ( sK0 @ X2 @ X0 )
= $true )
| ( $false = $true )
| ( X1 = X2 )
| ( X0 = X3 )
| ( X0 = X2 )
| ( ( sK0 @ X1 @ X3 )
= $true )
| ( X2 = X3 )
| ( X0 = X1 )
| ( X0 = X1 )
| ( X1 = X3 )
| ( $true
= ( sK0 @ X2 @ X3 ) ) ),
inference(superposition,[],[f20,f279]) ).
thf(f279,plain,
! [X2: $o > $o,X3: $o > $o,X0: $o > $o,X1: $o > $o] :
( ( ( sK0 @ X2 @ X1 )
= $true )
| ( X0 = X3 )
| ( X0 = X1 )
| ( X2 = X3 )
| ( X1 = X3 )
| ( ( sK0 @ X0 @ X2 )
= $true )
| ( ( sK0 @ X0 @ X3 )
= $true )
| ( X0 = X2 )
| ( ( sK0 @ X1 @ X3 )
= $true )
| ( X1 = X2 ) ),
inference(trivial_inequality_removal,[],[f278]) ).
thf(f278,plain,
! [X2: $o > $o,X3: $o > $o,X0: $o > $o,X1: $o > $o] :
( ( ( sK0 @ X2 @ X1 )
= $true )
| ( X0 = X3 )
| ( ( sK0 @ X1 @ X3 )
= $true )
| ( X0 = X1 )
| ( $false = $true )
| ( X0 = X2 )
| ( ( sK0 @ X0 @ X3 )
= $true )
| ( X1 = X3 )
| ( ( sK0 @ X0 @ X2 )
= $true )
| ( X1 = X2 )
| ( X2 = X3 ) ),
inference(duplicate_literal_removal,[],[f253]) ).
thf(f253,plain,
! [X2: $o > $o,X3: $o > $o,X0: $o > $o,X1: $o > $o] :
( ( X1 = X3 )
| ( X1 = X2 )
| ( X2 = X3 )
| ( X0 = X2 )
| ( $false = $true )
| ( ( sK0 @ X0 @ X2 )
= $true )
| ( ( sK0 @ X1 @ X3 )
= $true )
| ( ( sK0 @ X0 @ X3 )
= $true )
| ( X0 = X3 )
| ( ( sK0 @ X2 @ X1 )
= $true )
| ( X0 = X1 )
| ( X0 = X1 ) ),
inference(superposition,[],[f244,f20]) ).
thf(f244,plain,
! [X2: $o > $o,X3: $o > $o,X0: $o > $o,X1: $o > $o] :
( ( $true
= ( sK0 @ X3 @ X2 ) )
| ( X0 = X3 )
| ( ( sK0 @ X3 @ X0 )
= $true )
| ( X0 = X1 )
| ( ( sK0 @ X0 @ X2 )
= $true )
| ( X0 = X2 )
| ( X1 = X2 )
| ( ( sK0 @ X2 @ X1 )
= $true )
| ( X2 = X3 )
| ( X1 = X3 )
| ( ( sK0 @ X3 @ X1 )
= $true ) ),
inference(trivial_inequality_removal,[],[f243]) ).
thf(f243,plain,
! [X2: $o > $o,X3: $o > $o,X0: $o > $o,X1: $o > $o] :
( ( ( sK0 @ X0 @ X2 )
= $true )
| ( $true
= ( sK0 @ X3 @ X2 ) )
| ( ( sK0 @ X2 @ X1 )
= $true )
| ( $true != $true )
| ( X1 = X3 )
| ( X0 = X3 )
| ( X0 = X1 )
| ( X0 = X2 )
| ( X2 = X3 )
| ( X1 = X2 )
| ( ( sK0 @ X3 @ X0 )
= $true )
| ( ( sK0 @ X3 @ X1 )
= $true ) ),
inference(duplicate_literal_removal,[],[f224]) ).
thf(f224,plain,
! [X2: $o > $o,X3: $o > $o,X0: $o > $o,X1: $o > $o] :
( ( ( sK0 @ X2 @ X1 )
= $true )
| ( $true != $true )
| ( ( sK0 @ X3 @ X1 )
= $true )
| ( X2 = X3 )
| ( X0 = X2 )
| ( ( sK0 @ X3 @ X0 )
= $true )
| ( X1 = X2 )
| ( X0 = X1 )
| ( X0 = X1 )
| ( X1 = X3 )
| ( X0 = X3 )
| ( $true
= ( sK0 @ X3 @ X2 ) )
| ( ( sK0 @ X0 @ X2 )
= $true ) ),
inference(superposition,[],[f16,f206]) ).
thf(f206,plain,
! [X2: $o > $o,X3: $o > $o,X0: $o > $o,X1: $o > $o] :
( ( $true
= ( sK0 @ X2 @ X3 ) )
| ( ( sK0 @ X2 @ X0 )
= $true )
| ( X0 = X3 )
| ( ( sK0 @ X1 @ X0 )
= $true )
| ( ( sK0 @ X0 @ X3 )
= $true )
| ( X0 = X1 )
| ( ( sK0 @ X1 @ X3 )
= $true )
| ( X1 = X2 )
| ( X2 = X3 )
| ( X1 = X3 )
| ( ( sK0 @ X1 @ X2 )
= $true )
| ( X0 = X2 ) ),
inference(duplicate_literal_removal,[],[f205]) ).
thf(f205,plain,
! [X2: $o > $o,X3: $o > $o,X0: $o > $o,X1: $o > $o] :
( ( ( sK0 @ X1 @ X0 )
= $true )
| ( X1 = X2 )
| ( X2 = X3 )
| ( X0 = X3 )
| ( ( sK0 @ X1 @ X2 )
= $true )
| ( X0 = X1 )
| ( X0 = X2 )
| ( ( sK0 @ X0 @ X3 )
= $true )
| ( X1 = X3 )
| ( $true
= ( sK0 @ X2 @ X3 ) )
| ( ( sK0 @ X1 @ X3 )
= $true )
| ( ( sK0 @ X2 @ X0 )
= $true )
| ( X0 = X3 ) ),
inference(equality_proxy_clausification,[],[f204]) ).
thf(f204,plain,
! [X2: $o > $o,X3: $o > $o,X0: $o > $o,X1: $o > $o] :
( ( $true
= ( sK0 @ X2 @ X3 ) )
| ( ( sK0 @ X0 @ X3 )
= $true )
| ( ( sK0 @ X1 @ X3 )
= $true )
| ( X2 = X3 )
| ( X0 = X1 )
| ( ( X0 = X3 )
= $true )
| ( ( sK0 @ X2 @ X0 )
= $true )
| ( X0 = X2 )
| ( ( sK0 @ X1 @ X2 )
= $true )
| ( X0 = X3 )
| ( X1 = X2 )
| ( ( sK0 @ X1 @ X0 )
= $true )
| ( X1 = X3 ) ),
inference(duplicate_literal_removal,[],[f203]) ).
thf(f203,plain,
! [X2: $o > $o,X3: $o > $o,X0: $o > $o,X1: $o > $o] :
( ( ( sK0 @ X2 @ X0 )
= $true )
| ( X0 = X1 )
| ( ( sK0 @ X1 @ X2 )
= $true )
| ( X1 = X2 )
| ( X2 = X3 )
| ( $true
= ( sK0 @ X2 @ X3 ) )
| ( ( sK0 @ X1 @ X3 )
= $true )
| ( X0 = X2 )
| ( ( sK0 @ X1 @ X0 )
= $true )
| ( X0 = X2 )
| ( X0 = X3 )
| ( X1 = X3 )
| ( ( sK0 @ X0 @ X3 )
= $true )
| ( ( X0 = X3 )
= $true ) ),
inference(equality_proxy_clausification,[],[f173]) ).
thf(f173,plain,
! [X2: $o > $o,X3: $o > $o,X0: $o > $o,X1: $o > $o] :
( ( ( sK0 @ X1 @ X0 )
= $true )
| ( X2 = X3 )
| ( X0 = X3 )
| ( ( sK0 @ X1 @ X2 )
= $true )
| ( ( sK0 @ X2 @ X0 )
= $true )
| ( ( sK0 @ X1 @ X3 )
= $true )
| ( $true
= ( sK0 @ X2 @ X3 ) )
| ( ( X0 = X2 )
= $true )
| ( X1 = X2 )
| ( X0 = X1 )
| ( ( X0 = X3 )
= $true )
| ( ( sK0 @ X0 @ X3 )
= $true )
| ( X0 = X2 )
| ( X1 = X3 ) ),
inference(leibniz_equality_elimination,[],[f170]) ).
thf(f170,plain,
! [X2: $o > $o,X3: ( $o > $o ) > $o,X0: $o > $o,X1: $o > $o,X4: $o > $o] :
( ( ( sK0 @ X4 @ X2 )
= $true )
| ( ( X3 @ X4 )
= $true )
| ( X0 = X4 )
| ( ( sK0 @ X4 @ X1 )
= $true )
| ( ( sK0 @ X2 @ X0 )
= $true )
| ( X1 = X2 )
| ( ( sK0 @ X2 @ X1 )
= $true )
| ( $true
!= ( X3 @ X1 ) )
| ( X0 = X2 )
| ( X0 = X1 )
| ( ( X3 @ X0 )
= $true )
| ( ( sK0 @ X4 @ X0 )
= $true )
| ( X2 = X4 )
| ( ( X3 @ X2 )
= $true )
| ( ( sK0 @ X1 @ X0 )
= $true ) ),
inference(equality_proxy_clausification,[],[f169]) ).
thf(f169,plain,
! [X2: $o > $o,X3: ( $o > $o ) > $o,X0: $o > $o,X1: $o > $o,X4: $o > $o] :
( ( X0 = X2 )
| ( $true
!= ( X3 @ X1 ) )
| ( ( sK0 @ X4 @ X1 )
= $true )
| ( ( X3 @ X2 )
= $true )
| ( ( sK0 @ X4 @ X2 )
= $true )
| ( ( sK0 @ X2 @ X1 )
= $true )
| ( ( X3 @ X0 )
= $true )
| ( X0 = X1 )
| ( ( sK0 @ X1 @ X0 )
= $true )
| ( X2 = X4 )
| ( ( sK0 @ X2 @ X0 )
= $true )
| ( ( X3 @ X4 )
= $true )
| ( X1 = X2 )
| ( $true
= ( X0 = X4 ) )
| ( ( sK0 @ X4 @ X0 )
= $true ) ),
inference(duplicate_literal_removal,[],[f168]) ).
thf(f168,plain,
! [X2: $o > $o,X3: ( $o > $o ) > $o,X0: $o > $o,X1: $o > $o,X4: $o > $o] :
( ( X0 = X1 )
| ( ( sK0 @ X4 @ X1 )
= $true )
| ( X0 = X2 )
| ( $true
= ( X0 = X4 ) )
| ( ( sK0 @ X4 @ X2 )
= $true )
| ( ( X3 @ X2 )
= $true )
| ( ( sK0 @ X1 @ X0 )
= $true )
| ( X0 = X2 )
| ( ( sK0 @ X2 @ X0 )
= $true )
| ( X2 = X4 )
| ( ( X3 @ X4 )
= $true )
| ( ( sK0 @ X2 @ X1 )
= $true )
| ( ( X3 @ X0 )
= $true )
| ( $true
!= ( X3 @ X1 ) )
| ( ( sK0 @ X4 @ X0 )
= $true )
| ( X1 = X2 ) ),
inference(equality_proxy_clausification,[],[f123]) ).
thf(f123,plain,
! [X2: $o > $o,X3: ( $o > $o ) > $o,X0: $o > $o,X1: $o > $o,X4: $o > $o] :
( ( ( sK0 @ X1 @ X0 )
= $true )
| ( X2 = X4 )
| ( ( sK0 @ X2 @ X0 )
= $true )
| ( X1 = X2 )
| ( ( X0 = X2 )
= $true )
| ( X0 = X1 )
| ( $true
!= ( X3 @ X1 ) )
| ( $true
= ( X0 = X4 ) )
| ( X0 = X2 )
| ( ( sK0 @ X2 @ X1 )
= $true )
| ( ( sK0 @ X4 @ X2 )
= $true )
| ( ( sK0 @ X4 @ X0 )
= $true )
| ( ( sK0 @ X4 @ X1 )
= $true )
| ( ( X3 @ X2 )
= $true )
| ( ( X3 @ X0 )
= $true )
| ( ( X3 @ X4 )
= $true ) ),
inference(leibniz_equality_elimination,[],[f111]) ).
thf(f111,plain,
! [X2: $o > $o,X3: ( $o > $o ) > $o,X0: $o > $o,X1: $o > $o,X4: $o > $o,X5: ( $o > $o ) > $o] :
( ( ( sK0 @ X4 @ X2 )
= $true )
| ( ( X5 @ X2 )
= $true )
| ( X0 = X1 )
| ( X0 = X2 )
| ( ( X5 @ X0 )
= $true )
| ( ( sK0 @ X0 @ X2 )
= $true )
| ( $true
= ( X3 @ X1 ) )
| ( ( sK0 @ X1 @ X4 )
= $true )
| ( ( X3 @ X2 )
!= $true )
| ( ( X5 @ X4 )
!= $true )
| ( ( X3 @ X0 )
= $true )
| ( ( sK0 @ X1 @ X2 )
= $true )
| ( ( X5 @ X1 )
= $true )
| ( ( sK0 @ X1 @ X0 )
= $true )
| ( X0 = X4 )
| ( ( X3 @ X4 )
= $true )
| ( ( sK0 @ X0 @ X4 )
= $true ) ),
inference(equality_proxy_clausification,[],[f110]) ).
thf(f110,plain,
! [X2: $o > $o,X3: ( $o > $o ) > $o,X0: $o > $o,X1: $o > $o,X4: $o > $o,X5: ( $o > $o ) > $o] :
( ( ( X5 @ X0 )
= $true )
| ( ( X3 @ X0 )
= $true )
| ( ( sK0 @ X1 @ X4 )
= $true )
| ( ( X0 = X2 )
= $true )
| ( ( sK0 @ X1 @ X2 )
= $true )
| ( ( sK0 @ X1 @ X0 )
= $true )
| ( ( X3 @ X2 )
!= $true )
| ( ( X5 @ X4 )
!= $true )
| ( ( sK0 @ X4 @ X2 )
= $true )
| ( ( X3 @ X4 )
= $true )
| ( X0 = X1 )
| ( ( X5 @ X1 )
= $true )
| ( $true
= ( X3 @ X1 ) )
| ( ( sK0 @ X0 @ X4 )
= $true )
| ( X0 = X4 )
| ( ( X5 @ X2 )
= $true )
| ( ( sK0 @ X0 @ X2 )
= $true ) ),
inference(equality_proxy_clausification,[],[f67]) ).
thf(f67,plain,
! [X2: $o > $o,X3: ( $o > $o ) > $o,X0: $o > $o,X1: $o > $o,X4: $o > $o,X5: ( $o > $o ) > $o] :
( ( ( X5 @ X1 )
= $true )
| ( ( X3 @ X2 )
!= $true )
| ( ( X3 @ X4 )
= $true )
| ( X0 = X1 )
| ( ( X5 @ X0 )
= $true )
| ( ( sK0 @ X0 @ X4 )
= $true )
| ( ( sK0 @ X4 @ X2 )
= $true )
| ( $true
= ( X3 @ X1 ) )
| ( ( X5 @ X4 )
!= $true )
| ( $true
= ( X0 = X4 ) )
| ( ( sK0 @ X1 @ X0 )
= $true )
| ( ( sK0 @ X1 @ X2 )
= $true )
| ( ( sK0 @ X1 @ X4 )
= $true )
| ( ( X5 @ X2 )
= $true )
| ( ( X3 @ X0 )
= $true )
| ( ( sK0 @ X0 @ X2 )
= $true )
| ( ( X0 = X2 )
= $true ) ),
inference(leibniz_equality_elimination,[],[f13]) ).
thf(f13,plain,
! [X10: $o > $o,X8: ( $o > $o ) > $o,X6: $o > $o,X9: $o > $o,X7: ( $o > $o ) > $o,X4: ( $o > $o ) > $o,X5: $o > $o] :
( ( ( sK0 @ X10 @ X9 )
= $true )
| ( ( X4 @ X6 )
= $true )
| ( ( X7 @ X9 )
= $true )
| ( ( X4 @ X10 )
= $true )
| ( $true
= ( X7 @ X5 ) )
| ( ( X8 @ X6 )
= $true )
| ( ( X7 @ X6 )
!= $true )
| ( ( sK0 @ X6 @ X9 )
= $true )
| ( ( sK0 @ X10 @ X5 )
= $true )
| ( $true
!= ( X4 @ X9 ) )
| ( ( X4 @ X5 )
= $true )
| ( ( sK0 @ X10 @ X6 )
= $true )
| ( ( X7 @ X10 )
= $true )
| ( ( sK0 @ X5 @ X9 )
= $true )
| ( ( X8 @ X10 )
= $true )
| ( $true
= ( X8 @ X9 ) )
| ( ( sK0 @ X6 @ X5 )
= $true )
| ( ( X8 @ X5 )
!= $true ) ),
inference(cnf_transformation,[],[f11]) ).
thf(f11,plain,
( ! [X1: ( $o > $o ) > $o,X2: $o > $o,X3: $o > $o] :
( ( ( X1 @ X2 )
= $true )
| ( ( X1 @ X3 )
!= $true )
| ( $true
!= ( sK0 @ X2 @ X3 ) ) )
& ! [X4: ( $o > $o ) > $o,X5: $o > $o,X6: $o > $o,X7: ( $o > $o ) > $o,X8: ( $o > $o ) > $o,X9: $o > $o,X10: $o > $o] :
( ( $true
= ( X8 @ X9 ) )
| ( $true
!= ( X4 @ X9 ) )
| ( ( sK0 @ X6 @ X5 )
= $true )
| ( ( X8 @ X10 )
= $true )
| ( ( X8 @ X5 )
!= $true )
| ( ( X8 @ X6 )
= $true )
| ( ( X4 @ X10 )
= $true )
| ( ( X4 @ X5 )
= $true )
| ( $true
= ( X7 @ X5 ) )
| ( ( X7 @ X9 )
= $true )
| ( ( X4 @ X6 )
= $true )
| ( ( sK0 @ X10 @ X6 )
= $true )
| ( ( sK0 @ X5 @ X9 )
= $true )
| ( ( X7 @ X6 )
!= $true )
| ( ( sK0 @ X10 @ X5 )
= $true )
| ( ( X7 @ X10 )
= $true )
| ( ( sK0 @ X10 @ X9 )
= $true )
| ( ( sK0 @ X6 @ X9 )
= $true ) )
& ! [X11: $o > $o,X12: $o > $o] :
( ( ( sK0 @ X12 @ X11 )
!= $true )
| ( ( sK0 @ X11 @ X12 )
= $true ) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0])],[f9,f10]) ).
thf(f10,plain,
( ? [X0: ( $o > $o ) > ( $o > $o ) > $o] :
( ! [X1: ( $o > $o ) > $o,X2: $o > $o,X3: $o > $o] :
( ( ( X1 @ X2 )
= $true )
| ( ( X1 @ X3 )
!= $true )
| ( ( X0 @ X2 @ X3 )
!= $true ) )
& ! [X4: ( $o > $o ) > $o,X5: $o > $o,X6: $o > $o,X7: ( $o > $o ) > $o,X8: ( $o > $o ) > $o,X9: $o > $o,X10: $o > $o] :
( ( $true
= ( X8 @ X9 ) )
| ( $true
!= ( X4 @ X9 ) )
| ( ( X0 @ X6 @ X5 )
= $true )
| ( ( X8 @ X10 )
= $true )
| ( ( X8 @ X5 )
!= $true )
| ( ( X8 @ X6 )
= $true )
| ( ( X4 @ X10 )
= $true )
| ( ( X4 @ X5 )
= $true )
| ( $true
= ( X7 @ X5 ) )
| ( ( X7 @ X9 )
= $true )
| ( ( X4 @ X6 )
= $true )
| ( ( X0 @ X10 @ X6 )
= $true )
| ( ( X0 @ X5 @ X9 )
= $true )
| ( ( X7 @ X6 )
!= $true )
| ( ( X0 @ X10 @ X5 )
= $true )
| ( ( X7 @ X10 )
= $true )
| ( ( X0 @ X10 @ X9 )
= $true )
| ( ( X0 @ X6 @ X9 )
= $true ) )
& ! [X11: $o > $o,X12: $o > $o] :
( ( ( X0 @ X12 @ X11 )
!= $true )
| ( ( X0 @ X11 @ X12 )
= $true ) ) )
=> ( ! [X3: $o > $o,X2: $o > $o,X1: ( $o > $o ) > $o] :
( ( ( X1 @ X2 )
= $true )
| ( ( X1 @ X3 )
!= $true )
| ( $true
!= ( sK0 @ X2 @ X3 ) ) )
& ! [X10: $o > $o,X9: $o > $o,X8: ( $o > $o ) > $o,X7: ( $o > $o ) > $o,X6: $o > $o,X5: $o > $o,X4: ( $o > $o ) > $o] :
( ( $true
= ( X8 @ X9 ) )
| ( $true
!= ( X4 @ X9 ) )
| ( ( sK0 @ X6 @ X5 )
= $true )
| ( ( X8 @ X10 )
= $true )
| ( ( X8 @ X5 )
!= $true )
| ( ( X8 @ X6 )
= $true )
| ( ( X4 @ X10 )
= $true )
| ( ( X4 @ X5 )
= $true )
| ( $true
= ( X7 @ X5 ) )
| ( ( X7 @ X9 )
= $true )
| ( ( X4 @ X6 )
= $true )
| ( ( sK0 @ X10 @ X6 )
= $true )
| ( ( sK0 @ X5 @ X9 )
= $true )
| ( ( X7 @ X6 )
!= $true )
| ( ( sK0 @ X10 @ X5 )
= $true )
| ( ( X7 @ X10 )
= $true )
| ( ( sK0 @ X10 @ X9 )
= $true )
| ( ( sK0 @ X6 @ X9 )
= $true ) )
& ! [X12: $o > $o,X11: $o > $o] :
( ( ( sK0 @ X12 @ X11 )
!= $true )
| ( ( sK0 @ X11 @ X12 )
= $true ) ) ) ),
introduced(choice_axiom,[]) ).
thf(f9,plain,
? [X0: ( $o > $o ) > ( $o > $o ) > $o] :
( ! [X1: ( $o > $o ) > $o,X2: $o > $o,X3: $o > $o] :
( ( ( X1 @ X2 )
= $true )
| ( ( X1 @ X3 )
!= $true )
| ( ( X0 @ X2 @ X3 )
!= $true ) )
& ! [X4: ( $o > $o ) > $o,X5: $o > $o,X6: $o > $o,X7: ( $o > $o ) > $o,X8: ( $o > $o ) > $o,X9: $o > $o,X10: $o > $o] :
( ( $true
= ( X8 @ X9 ) )
| ( $true
!= ( X4 @ X9 ) )
| ( ( X0 @ X6 @ X5 )
= $true )
| ( ( X8 @ X10 )
= $true )
| ( ( X8 @ X5 )
!= $true )
| ( ( X8 @ X6 )
= $true )
| ( ( X4 @ X10 )
= $true )
| ( ( X4 @ X5 )
= $true )
| ( $true
= ( X7 @ X5 ) )
| ( ( X7 @ X9 )
= $true )
| ( ( X4 @ X6 )
= $true )
| ( ( X0 @ X10 @ X6 )
= $true )
| ( ( X0 @ X5 @ X9 )
= $true )
| ( ( X7 @ X6 )
!= $true )
| ( ( X0 @ X10 @ X5 )
= $true )
| ( ( X7 @ X10 )
= $true )
| ( ( X0 @ X10 @ X9 )
= $true )
| ( ( X0 @ X6 @ X9 )
= $true ) )
& ! [X11: $o > $o,X12: $o > $o] :
( ( ( X0 @ X12 @ X11 )
!= $true )
| ( ( X0 @ X11 @ X12 )
= $true ) ) ),
inference(rectify,[],[f8]) ).
thf(f8,plain,
? [X0: ( $o > $o ) > ( $o > $o ) > $o] :
( ! [X5: ( $o > $o ) > $o,X4: $o > $o,X3: $o > $o] :
( ( ( X5 @ X4 )
= $true )
| ( ( X5 @ X3 )
!= $true )
| ( ( X0 @ X4 @ X3 )
!= $true ) )
& ! [X10: ( $o > $o ) > $o,X6: $o > $o,X9: $o > $o,X8: ( $o > $o ) > $o,X11: ( $o > $o ) > $o,X7: $o > $o,X12: $o > $o] :
( ( ( X11 @ X7 )
= $true )
| ( ( X10 @ X7 )
!= $true )
| ( ( X0 @ X9 @ X6 )
= $true )
| ( ( X11 @ X12 )
= $true )
| ( ( X11 @ X6 )
!= $true )
| ( $true
= ( X11 @ X9 ) )
| ( ( X10 @ X12 )
= $true )
| ( ( X10 @ X6 )
= $true )
| ( ( X8 @ X6 )
= $true )
| ( ( X8 @ X7 )
= $true )
| ( ( X10 @ X9 )
= $true )
| ( ( X0 @ X12 @ X9 )
= $true )
| ( ( X0 @ X6 @ X7 )
= $true )
| ( $true
!= ( X8 @ X9 ) )
| ( ( X0 @ X12 @ X6 )
= $true )
| ( ( X8 @ X12 )
= $true )
| ( ( X0 @ X12 @ X7 )
= $true )
| ( ( X0 @ X9 @ X7 )
= $true ) )
& ! [X2: $o > $o,X1: $o > $o] :
( ( ( X0 @ X1 @ X2 )
!= $true )
| ( ( X0 @ X2 @ X1 )
= $true ) ) ),
inference(flattening,[],[f7]) ).
thf(f7,plain,
? [X0: ( $o > $o ) > ( $o > $o ) > $o] :
( ! [X10: ( $o > $o ) > $o,X6: $o > $o,X9: $o > $o,X8: ( $o > $o ) > $o,X11: ( $o > $o ) > $o,X7: $o > $o,X12: $o > $o] :
( ( ( X11 @ X7 )
= $true )
| ( ( X10 @ X7 )
!= $true )
| ( ( X0 @ X9 @ X6 )
= $true )
| ( ( X11 @ X12 )
= $true )
| ( ( X11 @ X6 )
!= $true )
| ( $true
= ( X11 @ X9 ) )
| ( ( X10 @ X12 )
= $true )
| ( ( X10 @ X6 )
= $true )
| ( ( X8 @ X6 )
= $true )
| ( ( X8 @ X7 )
= $true )
| ( ( X10 @ X9 )
= $true )
| ( ( X0 @ X12 @ X9 )
= $true )
| ( ( X0 @ X6 @ X7 )
= $true )
| ( $true
!= ( X8 @ X9 ) )
| ( ( X0 @ X12 @ X6 )
= $true )
| ( ( X8 @ X12 )
= $true )
| ( ( X0 @ X12 @ X7 )
= $true )
| ( ( X0 @ X9 @ X7 )
= $true ) )
& ! [X5: ( $o > $o ) > $o,X4: $o > $o,X3: $o > $o] :
( ( ( X5 @ X4 )
= $true )
| ( ( X5 @ X3 )
!= $true )
| ( ( X0 @ X4 @ X3 )
!= $true ) )
& ! [X2: $o > $o,X1: $o > $o] :
( ( ( X0 @ X1 @ X2 )
!= $true )
| ( ( X0 @ X2 @ X1 )
= $true ) ) ),
inference(ennf_transformation,[],[f6]) ).
thf(f6,plain,
~ ! [X0: ( $o > $o ) > ( $o > $o ) > $o] :
( ! [X2: $o > $o,X1: $o > $o] :
( ( ( X0 @ X1 @ X2 )
= $true )
=> ( ( X0 @ X2 @ X1 )
= $true ) )
=> ( ? [X10: ( $o > $o ) > $o,X9: $o > $o,X12: $o > $o,X8: ( $o > $o ) > $o,X6: $o > $o,X7: $o > $o,X11: ( $o > $o ) > $o] :
( ( ( X0 @ X12 @ X9 )
!= $true )
& ( $true
!= ( X11 @ X9 ) )
& ( ( X8 @ X12 )
!= $true )
& ( ( X11 @ X12 )
!= $true )
& ( ( X10 @ X7 )
= $true )
& ( ( X11 @ X7 )
!= $true )
& ( ( X0 @ X6 @ X7 )
!= $true )
& ( $true
= ( X8 @ X9 ) )
& ( ( X0 @ X12 @ X7 )
!= $true )
& ( ( X10 @ X12 )
!= $true )
& ( ( X11 @ X6 )
= $true )
& ( ( X0 @ X9 @ X6 )
!= $true )
& ( ( X10 @ X6 )
!= $true )
& ( ( X10 @ X9 )
!= $true )
& ( ( X8 @ X7 )
!= $true )
& ( ( X0 @ X9 @ X7 )
!= $true )
& ( ( X8 @ X6 )
!= $true )
& ( ( X0 @ X12 @ X6 )
!= $true ) )
| ? [X4: $o > $o,X3: $o > $o,X5: ( $o > $o ) > $o] :
( ( ( X5 @ X4 )
!= $true )
& ( ( X0 @ X4 @ X3 )
= $true )
& ( ( X5 @ X3 )
= $true ) ) ) ),
inference(flattening,[],[f5]) ).
thf(f5,plain,
~ ! [X0: ( $o > $o ) > ( $o > $o ) > $o] :
( ! [X2: $o > $o,X1: $o > $o] :
( ( ( X0 @ X1 @ X2 )
= $true )
=> ( ( X0 @ X2 @ X1 )
= $true ) )
=> ( ? [X3: $o > $o,X4: $o > $o,X5: ( $o > $o ) > $o] :
( ( ( X5 @ X3 )
= $true )
& ( ( X5 @ X4 )
!= $true )
& ( ( X0 @ X4 @ X3 )
= $true ) )
| ? [X6: $o > $o,X7: $o > $o,X8: ( $o > $o ) > $o,X9: $o > $o,X10: ( $o > $o ) > $o,X11: ( $o > $o ) > $o,X12: $o > $o] :
( ( ( X11 @ X7 )
!= $true )
& ( ( X0 @ X9 @ X6 )
!= $true )
& ( $true
= ( X8 @ X9 ) )
& ( ( X10 @ X7 )
= $true )
& ( ( X0 @ X12 @ X6 )
!= $true )
& ( ( X10 @ X6 )
!= $true )
& ( ( X0 @ X6 @ X7 )
!= $true )
& ( ( X0 @ X12 @ X7 )
!= $true )
& ( ( X0 @ X9 @ X7 )
!= $true )
& ( ( X8 @ X6 )
!= $true )
& ( ( X11 @ X6 )
= $true )
& ( $true
!= ( X11 @ X9 ) )
& ( ( X10 @ X9 )
!= $true )
& ( ( X10 @ X12 )
!= $true )
& ( ( X8 @ X7 )
!= $true )
& ( ( X0 @ X12 @ X9 )
!= $true )
& ( ( X11 @ X12 )
!= $true )
& ( ( X8 @ X12 )
!= $true ) ) ) ),
inference(fool_elimination,[],[f4]) ).
thf(f4,plain,
~ ! [X0: ( $o > $o ) > ( $o > $o ) > $o] :
( ! [X1: $o > $o,X2: $o > $o] :
( ( X0 @ X1 @ X2 )
=> ( X0 @ X2 @ X1 ) )
=> ( ? [X3: $o > $o,X4: $o > $o,X5: ( $o > $o ) > $o] :
( ( X5 @ X3 )
& ~ ( X5 @ X4 )
& ( X0 @ X4 @ X3 ) )
| ? [X6: $o > $o,X7: $o > $o,X8: ( $o > $o ) > $o,X9: $o > $o,X10: ( $o > $o ) > $o,X11: ( $o > $o ) > $o,X12: $o > $o] :
( ~ ( X11 @ X7 )
& ~ ( X0 @ X9 @ X6 )
& ( X8 @ X9 )
& ( X10 @ X7 )
& ~ ( X0 @ X12 @ X6 )
& ~ ( X10 @ X6 )
& ~ ( X0 @ X6 @ X7 )
& ~ ( X0 @ X12 @ X7 )
& ~ ( X0 @ X9 @ X7 )
& ~ ( X8 @ X6 )
& ( X11 @ X6 )
& ~ ( X11 @ X9 )
& ~ ( X10 @ X9 )
& ~ ( X10 @ X12 )
& ~ ( X8 @ X7 )
& ~ ( X0 @ X12 @ X9 )
& ~ ( X11 @ X12 )
& ~ ( X8 @ X12 ) ) ) ),
inference(rectify,[],[f2]) ).
thf(f2,negated_conjecture,
~ ! [X0: ( $o > $o ) > ( $o > $o ) > $o] :
( ! [X1: $o > $o,X2: $o > $o] :
( ( X0 @ X1 @ X2 )
=> ( X0 @ X2 @ X1 ) )
=> ( ? [X3: $o > $o,X4: $o > $o,X5: ( $o > $o ) > $o] :
( ( X5 @ X3 )
& ~ ( X5 @ X4 )
& ( X0 @ X4 @ X3 ) )
| ? [X4: $o > $o,X3: $o > $o,X9: ( $o > $o ) > $o,X6: $o > $o,X5: ( $o > $o ) > $o,X8: ( $o > $o ) > $o,X7: $o > $o] :
( ~ ( X8 @ X3 )
& ~ ( X0 @ X6 @ X4 )
& ( X9 @ X6 )
& ( X5 @ X3 )
& ~ ( X0 @ X7 @ X4 )
& ~ ( X5 @ X4 )
& ~ ( X0 @ X4 @ X3 )
& ~ ( X0 @ X7 @ X3 )
& ~ ( X0 @ X6 @ X3 )
& ~ ( X9 @ X4 )
& ( X8 @ X4 )
& ~ ( X8 @ X6 )
& ~ ( X5 @ X6 )
& ~ ( X5 @ X7 )
& ~ ( X9 @ X3 )
& ~ ( X0 @ X7 @ X6 )
& ~ ( X8 @ X7 )
& ~ ( X9 @ X7 ) ) ) ),
inference(negated_conjecture,[],[f1]) ).
thf(f1,conjecture,
! [X0: ( $o > $o ) > ( $o > $o ) > $o] :
( ! [X1: $o > $o,X2: $o > $o] :
( ( X0 @ X1 @ X2 )
=> ( X0 @ X2 @ X1 ) )
=> ( ? [X3: $o > $o,X4: $o > $o,X5: ( $o > $o ) > $o] :
( ( X5 @ X3 )
& ~ ( X5 @ X4 )
& ( X0 @ X4 @ X3 ) )
| ? [X4: $o > $o,X3: $o > $o,X9: ( $o > $o ) > $o,X6: $o > $o,X5: ( $o > $o ) > $o,X8: ( $o > $o ) > $o,X7: $o > $o] :
( ~ ( X8 @ X3 )
& ~ ( X0 @ X6 @ X4 )
& ( X9 @ X6 )
& ( X5 @ X3 )
& ~ ( X0 @ X7 @ X4 )
& ~ ( X5 @ X4 )
& ~ ( X0 @ X4 @ X3 )
& ~ ( X0 @ X7 @ X3 )
& ~ ( X0 @ X6 @ X3 )
& ~ ( X9 @ X4 )
& ( X8 @ X4 )
& ~ ( X8 @ X6 )
& ~ ( X5 @ X6 )
& ~ ( X5 @ X7 )
& ~ ( X9 @ X3 )
& ~ ( X0 @ X7 @ X6 )
& ~ ( X8 @ X7 )
& ~ ( X9 @ X7 ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ramsey_u_2_4_4) ).
thf(f16,plain,
! [X0: $o > $o,X1: $o > $o] :
( ( ( sK0 @ X0 @ X1 )
!= $true )
| ( X0 = X1 ) ),
inference(leibniz_equality_elimination,[],[f14]) ).
thf(f14,plain,
! [X2: $o > $o,X3: $o > $o,X1: ( $o > $o ) > $o] :
( ( $true
!= ( sK0 @ X2 @ X3 ) )
| ( ( X1 @ X3 )
!= $true )
| ( ( X1 @ X2 )
= $true ) ),
inference(cnf_transformation,[],[f11]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : GRA028^1 : TPTP v8.2.0. Released v3.6.0.
% 0.11/0.14 % 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.13/0.35 % Computer : n020.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Sat May 18 12:42:52 EDT 2024
% 0.13/0.35 % CPUTime :
% 0.13/0.35 This is a TH0_THM_NEQ_NAR problem
% 0.13/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/sandbox/benchmark/theBenchmark.p
% 0.13/0.37 % (13561)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.13/0.37 % (13564)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.13/0.37 % (13560)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.13/0.37 % (13564)Instruction limit reached!
% 0.13/0.37 % (13564)------------------------------
% 0.13/0.37 % (13564)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.13/0.37 % (13564)Termination reason: Unknown
% 0.13/0.37 % (13564)Termination phase: shuffling
% 0.13/0.37
% 0.13/0.37 % (13564)Memory used [KB]: 895
% 0.13/0.37 % (13564)Time elapsed: 0.003 s
% 0.13/0.37 % (13564)Instructions burned: 2 (million)
% 0.13/0.37 % (13564)------------------------------
% 0.13/0.37 % (13564)------------------------------
% 0.13/0.37 % (13565)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.13/0.37 % (13566)lrs+1004_1:128_cond=on:e2e=on:sp=weighted_frequency:i=18:si=on:rtra=on_0 on theBenchmark for (2999ds/18Mi)
% 0.13/0.37 % (13563)lrs+10_1:1_au=on:inj=on:i=2:si=on:rtra=on_0 on theBenchmark for (2999ds/2Mi)
% 0.13/0.37 % (13562)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.13/0.37 % (13567)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.13/0.37 % (13563)Instruction limit reached!
% 0.13/0.37 % (13563)------------------------------
% 0.13/0.37 % (13563)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.13/0.37 % (13563)Termination reason: Unknown
% 0.13/0.37 % (13563)Termination phase: Preprocessing 1
% 0.13/0.37
% 0.13/0.37 % (13563)Memory used [KB]: 895
% 0.13/0.37 % (13563)Time elapsed: 0.002 s
% 0.13/0.37 % (13563)Instructions burned: 2 (million)
% 0.13/0.37 % (13563)------------------------------
% 0.13/0.37 % (13563)------------------------------
% 0.13/0.37 % (13561)Instruction limit reached!
% 0.13/0.37 % (13561)------------------------------
% 0.13/0.37 % (13561)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.13/0.37 % (13561)Termination reason: Unknown
% 0.13/0.37 % (13561)Termination phase: Saturation
% 0.13/0.37
% 0.13/0.37 % (13561)Memory used [KB]: 5500
% 0.13/0.37 % (13561)Time elapsed: 0.004 s
% 0.13/0.37 % (13561)Instructions burned: 4 (million)
% 0.13/0.37 % (13561)------------------------------
% 0.13/0.37 % (13561)------------------------------
% 0.13/0.37 % (13567)Instruction limit reached!
% 0.13/0.37 % (13567)------------------------------
% 0.13/0.37 % (13567)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.13/0.37 % (13567)Termination reason: Unknown
% 0.13/0.37 % (13567)Termination phase: Saturation
% 0.13/0.37
% 0.13/0.37 % (13567)Memory used [KB]: 5500
% 0.13/0.37 % (13567)Time elapsed: 0.004 s
% 0.13/0.37 % (13567)Instructions burned: 3 (million)
% 0.13/0.37 % (13567)------------------------------
% 0.13/0.37 % (13567)------------------------------
% 0.13/0.37 % (13562)Refutation not found, incomplete strategy
% 0.13/0.37 % (13562)------------------------------
% 0.13/0.37 % (13562)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.13/0.37 % (13562)Termination reason: Refutation not found, incomplete strategy
% 0.13/0.37
% 0.13/0.37
% 0.13/0.37 % (13562)Memory used [KB]: 5500
% 0.13/0.37 % (13562)Time elapsed: 0.003 s
% 0.13/0.37 % (13562)Instructions burned: 3 (million)
% 0.13/0.37 % (13562)------------------------------
% 0.13/0.37 % (13562)------------------------------
% 0.13/0.38 % (13566)Instruction limit reached!
% 0.13/0.38 % (13566)------------------------------
% 0.13/0.38 % (13566)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.13/0.38 % (13566)Termination reason: Unknown
% 0.13/0.38 % (13566)Termination phase: Saturation
% 0.13/0.38
% 0.13/0.38 % (13566)Memory used [KB]: 5628
% 0.13/0.38 % (13566)Time elapsed: 0.012 s
% 0.13/0.38 % (13566)Instructions burned: 19 (million)
% 0.13/0.38 % (13566)------------------------------
% 0.13/0.38 % (13566)------------------------------
% 0.13/0.38 % (13568)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.13/0.39 % (13570)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.13/0.39 % (13569)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.13/0.39 % (13571)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.13/0.39 % (13570)Instruction limit reached!
% 0.13/0.39 % (13570)------------------------------
% 0.13/0.39 % (13570)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.13/0.39 % (13570)Termination reason: Unknown
% 0.13/0.39 % (13570)Termination phase: Saturation
% 0.13/0.39
% 0.13/0.39 % (13570)Memory used [KB]: 5500
% 0.13/0.39 % (13570)Time elapsed: 0.004 s
% 0.13/0.39 % (13570)Instructions burned: 3 (million)
% 0.13/0.39 % (13570)------------------------------
% 0.13/0.39 % (13570)------------------------------
% 0.13/0.39 % (13572)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.13/0.39 % (13572)Instruction limit reached!
% 0.13/0.39 % (13572)------------------------------
% 0.13/0.39 % (13572)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.13/0.39 % (13572)Termination reason: Unknown
% 0.13/0.39 % (13572)Termination phase: Saturation
% 0.13/0.39
% 0.13/0.39 % (13572)Memory used [KB]: 1023
% 0.13/0.39 % (13572)Time elapsed: 0.006 s
% 0.13/0.39 % (13572)Instructions burned: 8 (million)
% 0.13/0.39 % (13572)------------------------------
% 0.13/0.39 % (13572)------------------------------
% 0.13/0.40 % (13569)Instruction limit reached!
% 0.13/0.40 % (13569)------------------------------
% 0.13/0.40 % (13569)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.13/0.40 % (13569)Termination reason: Unknown
% 0.13/0.40 % (13569)Termination phase: Saturation
% 0.13/0.40
% 0.13/0.40 % (13569)Memory used [KB]: 5500
% 0.13/0.40 % (13569)Time elapsed: 0.011 s
% 0.13/0.40 % (13569)Instructions burned: 16 (million)
% 0.13/0.40 % (13569)------------------------------
% 0.13/0.40 % (13569)------------------------------
% 0.13/0.40 % (13573)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.13/0.40 % (13568)Instruction limit reached!
% 0.13/0.40 % (13568)------------------------------
% 0.13/0.40 % (13568)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.13/0.40 % (13568)Termination reason: Unknown
% 0.13/0.40 % (13568)Termination phase: Saturation
% 0.13/0.40
% 0.13/0.40 % (13568)Memory used [KB]: 5628
% 0.13/0.40 % (13568)Time elapsed: 0.019 s
% 0.13/0.40 % (13568)Instructions burned: 37 (million)
% 0.13/0.40 % (13568)------------------------------
% 0.13/0.40 % (13568)------------------------------
% 0.13/0.40 % (13574)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.13/0.40 % (13574)Instruction limit reached!
% 0.13/0.40 % (13574)------------------------------
% 0.13/0.40 % (13574)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.13/0.40 % (13574)Termination reason: Unknown
% 0.13/0.40 % (13574)Termination phase: Saturation
% 0.13/0.40
% 0.13/0.40 % (13574)Memory used [KB]: 5500
% 0.13/0.40 % (13574)Time elapsed: 0.004 s
% 0.13/0.40 % (13574)Instructions burned: 4 (million)
% 0.13/0.40 % (13574)------------------------------
% 0.13/0.40 % (13574)------------------------------
% 0.13/0.41 % (13573)Instruction limit reached!
% 0.13/0.41 % (13573)------------------------------
% 0.13/0.41 % (13573)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.13/0.41 % (13573)Termination reason: Unknown
% 0.13/0.41 % (13573)Termination phase: Saturation
% 0.13/0.41
% 0.13/0.41 % (13573)Memory used [KB]: 5628
% 0.13/0.41 % (13573)Time elapsed: 0.011 s
% 0.13/0.41 % (13573)Instructions burned: 17 (million)
% 0.13/0.41 % (13573)------------------------------
% 0.13/0.41 % (13573)------------------------------
% 0.13/0.41 % (13575)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.13/0.41 % (13576)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.13/0.41 % (13575)Instruction limit reached!
% 0.13/0.41 % (13575)------------------------------
% 0.13/0.41 % (13575)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.13/0.41 % (13575)Termination reason: Unknown
% 0.13/0.41 % (13575)Termination phase: Saturation
% 0.13/0.41
% 0.13/0.41 % (13575)Memory used [KB]: 1023
% 0.13/0.41 % (13575)Time elapsed: 0.004 s
% 0.13/0.41 % (13575)Instructions burned: 4 (million)
% 0.13/0.41 % (13575)------------------------------
% 0.13/0.41 % (13575)------------------------------
% 0.13/0.41 % (13576)Instruction limit reached!
% 0.13/0.41 % (13576)------------------------------
% 0.13/0.41 % (13576)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.13/0.41 % (13576)Termination reason: Unknown
% 0.13/0.41 % (13576)Termination phase: Saturation
% 0.13/0.41
% 0.13/0.41 % (13576)Memory used [KB]: 5500
% 0.13/0.41 % (13576)Time elapsed: 0.006 s
% 0.13/0.41 % (13576)Instructions burned: 8 (million)
% 0.13/0.41 % (13576)------------------------------
% 0.13/0.41 % (13576)------------------------------
% 0.13/0.42 % (13577)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.13/0.42 % (13577)Instruction limit reached!
% 0.13/0.42 % (13577)------------------------------
% 0.13/0.42 % (13577)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.13/0.42 % (13577)Termination reason: Unknown
% 0.13/0.42 % (13577)Termination phase: Property scanning
% 0.13/0.42
% 0.13/0.42 % (13577)Memory used [KB]: 1023
% 0.13/0.42 % (13577)Time elapsed: 0.003 s
% 0.13/0.42 % (13577)Instructions burned: 3 (million)
% 0.13/0.42 % (13577)------------------------------
% 0.13/0.42 % (13577)------------------------------
% 0.13/0.42 % (13578)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.19/0.42 % (13578)Instruction limit reached!
% 0.19/0.42 % (13578)------------------------------
% 0.19/0.42 % (13578)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.19/0.42 % (13578)Termination reason: Unknown
% 0.19/0.42 % (13578)Termination phase: Saturation
% 0.19/0.42
% 0.19/0.42 % (13578)Memory used [KB]: 5500
% 0.19/0.42 % (13578)Time elapsed: 0.005 s
% 0.19/0.42 % (13578)Instructions burned: 5 (million)
% 0.19/0.42 % (13578)------------------------------
% 0.19/0.42 % (13578)------------------------------
% 0.19/0.42 % (13579)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.19/0.43 % (13580)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.19/0.43 % (13582)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.19/0.43 % (13581)lrs+1004_1:1_chr=on:prag=on:i=6:si=on:rtra=on_0 on theBenchmark for (2999ds/6Mi)
% 0.19/0.43 % (13579)Instruction limit reached!
% 0.19/0.43 % (13579)------------------------------
% 0.19/0.43 % (13579)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.19/0.43 % (13579)Termination reason: Unknown
% 0.19/0.43 % (13579)Termination phase: Saturation
% 0.19/0.43
% 0.19/0.43 % (13579)Memory used [KB]: 5500
% 0.19/0.43 % (13579)Time elapsed: 0.012 s
% 0.19/0.43 % (13579)Instructions burned: 19 (million)
% 0.19/0.43 % (13579)------------------------------
% 0.19/0.43 % (13579)------------------------------
% 0.19/0.43 % (13581)Instruction limit reached!
% 0.19/0.43 % (13581)------------------------------
% 0.19/0.43 % (13581)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.19/0.43 % (13581)Termination reason: Unknown
% 0.19/0.43 % (13581)Termination phase: Saturation
% 0.19/0.43
% 0.19/0.43 % (13581)Memory used [KB]: 5500
% 0.19/0.43 % (13581)Time elapsed: 0.005 s
% 0.19/0.43 % (13581)Instructions burned: 6 (million)
% 0.19/0.43 % (13581)------------------------------
% 0.19/0.43 % (13581)------------------------------
% 0.19/0.43 % (13583)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.19/0.45 % (13584)dis+10_1:1_cnfonf=lazy_gen:fe=off:i=5:si=on:rtra=on_0 on theBenchmark for (2999ds/5Mi)
% 0.19/0.45 % (13583)Instruction limit reached!
% 0.19/0.45 % (13583)------------------------------
% 0.19/0.45 % (13583)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.19/0.45 % (13583)Termination reason: Unknown
% 0.19/0.45 % (13583)Termination phase: Saturation
% 0.19/0.45
% 0.19/0.45 % (13583)Memory used [KB]: 5628
% 0.19/0.45 % (13583)Time elapsed: 0.037 s
% 0.19/0.45 % (13583)Instructions burned: 22 (million)
% 0.19/0.45 % (13583)------------------------------
% 0.19/0.45 % (13583)------------------------------
% 0.19/0.45 % (13560)Instruction limit reached!
% 0.19/0.45 % (13560)------------------------------
% 0.19/0.45 % (13560)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.19/0.45 % (13560)Termination reason: Unknown
% 0.19/0.45 % (13560)Termination phase: Saturation
% 0.19/0.45
% 0.19/0.45 % (13560)Memory used [KB]: 5756
% 0.19/0.45 % (13560)Time elapsed: 0.080 s
% 0.19/0.45 % (13560)Instructions burned: 184 (million)
% 0.19/0.45 % (13560)------------------------------
% 0.19/0.45 % (13560)------------------------------
% 0.19/0.45 % (13584)Instruction limit reached!
% 0.19/0.45 % (13584)------------------------------
% 0.19/0.45 % (13584)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.19/0.45 % (13584)Termination reason: Unknown
% 0.19/0.45 % (13584)Termination phase: Saturation
% 0.19/0.45
% 0.19/0.45 % (13584)Memory used [KB]: 5500
% 0.19/0.45 % (13584)Time elapsed: 0.005 s
% 0.19/0.45 % (13584)Instructions burned: 6 (million)
% 0.19/0.45 % (13584)------------------------------
% 0.19/0.45 % (13584)------------------------------
% 0.19/0.45 % (13585)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.19/0.45 % (13585)Instruction limit reached!
% 0.19/0.45 % (13585)------------------------------
% 0.19/0.45 % (13585)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.19/0.45 % (13585)Termination reason: Unknown
% 0.19/0.45 % (13585)Termination phase: Saturation
% 0.19/0.45
% 0.19/0.45 % (13585)Memory used [KB]: 5500
% 0.19/0.45 % (13585)Time elapsed: 0.006 s
% 0.19/0.45 % (13585)Instructions burned: 7 (million)
% 0.19/0.45 % (13585)------------------------------
% 0.19/0.45 % (13585)------------------------------
% 0.19/0.46 % (13586)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.19/0.46 % (13587)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.19/0.46 % (13588)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.19/0.47 % (13589)lrs+1010_1:1_au=on:s2a=on:sd=1:sgt=50:ss=axioms:i=879:si=on:rtra=on_0 on theBenchmark for (2999ds/879Mi)
% 0.19/0.47 % (13588)Instruction limit reached!
% 0.19/0.47 % (13588)------------------------------
% 0.19/0.47 % (13588)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.19/0.47 % (13588)Termination reason: Unknown
% 0.19/0.47 % (13588)Termination phase: Saturation
% 0.19/0.47
% 0.19/0.47 % (13588)Memory used [KB]: 5628
% 0.19/0.47 % (13588)Time elapsed: 0.034 s
% 0.19/0.47 % (13588)Instructions burned: 19 (million)
% 0.19/0.47 % (13588)------------------------------
% 0.19/0.47 % (13588)------------------------------
% 0.19/0.49 % (13590)dis+1002_1:128_acc=on:er=filter:i=17:si=on:rtra=on_0 on theBenchmark for (2999ds/17Mi)
% 0.19/0.50 % (13590)Instruction limit reached!
% 0.19/0.50 % (13590)------------------------------
% 0.19/0.50 % (13590)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.19/0.50 % (13590)Termination reason: Unknown
% 0.19/0.50 % (13590)Termination phase: Saturation
% 0.19/0.50
% 0.19/0.50 % (13590)Memory used [KB]: 5628
% 0.19/0.50 % (13590)Time elapsed: 0.034 s
% 0.19/0.50 % (13590)Instructions burned: 18 (million)
% 0.19/0.50 % (13590)------------------------------
% 0.19/0.50 % (13590)------------------------------
% 0.19/0.51 % (13565)Instruction limit reached!
% 0.19/0.51 % (13565)------------------------------
% 0.19/0.51 % (13565)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.19/0.51 % (13565)Termination reason: Unknown
% 0.19/0.51 % (13565)Termination phase: Saturation
% 0.19/0.51
% 0.19/0.51 % (13565)Memory used [KB]: 5756
% 0.19/0.51 % (13565)Time elapsed: 0.140 s
% 0.19/0.51 % (13565)Instructions burned: 275 (million)
% 0.19/0.51 % (13565)------------------------------
% 0.19/0.51 % (13565)------------------------------
% 0.19/0.52 % (13591)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.19/0.52 % (13591)Instruction limit reached!
% 0.19/0.52 % (13591)------------------------------
% 0.19/0.52 % (13591)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.19/0.52 % (13591)Termination reason: Unknown
% 0.19/0.52 % (13591)Termination phase: Saturation
% 0.19/0.52
% 0.19/0.52 % (13591)Memory used [KB]: 1023
% 0.19/0.52 % (13591)Time elapsed: 0.004 s
% 0.19/0.52 % (13591)Instructions burned: 3 (million)
% 0.19/0.52 % (13591)------------------------------
% 0.19/0.52 % (13591)------------------------------
% 0.19/0.52 % (13592)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.19/0.53 % (13593)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.19/0.54 % (13592)Instruction limit reached!
% 0.19/0.54 % (13592)------------------------------
% 0.19/0.54 % (13592)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.19/0.54 % (13592)Termination reason: Unknown
% 0.19/0.54 % (13592)Termination phase: Saturation
% 0.19/0.54
% 0.19/0.54 % (13592)Memory used [KB]: 5628
% 0.19/0.54 % (13592)Time elapsed: 0.019 s
% 0.19/0.54 % (13592)Instructions burned: 30 (million)
% 0.19/0.54 % (13592)------------------------------
% 0.19/0.54 % (13592)------------------------------
% 1.83/0.58 % (13594)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)
% 1.83/0.59 % (13586)First to succeed.
% 1.83/0.60 % (13586)Refutation found. Thanks to Tanya!
% 1.83/0.60 % SZS status Theorem for theBenchmark
% 1.83/0.60 % SZS output start Proof for theBenchmark
% See solution above
% 1.83/0.60 % (13586)------------------------------
% 1.83/0.60 % (13586)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 1.83/0.60 % (13586)Termination reason: Refutation
% 1.83/0.60
% 1.83/0.60 % (13586)Memory used [KB]: 5884
% 1.83/0.60 % (13586)Time elapsed: 0.159 s
% 1.83/0.60 % (13586)Instructions burned: 273 (million)
% 1.83/0.60 % (13586)------------------------------
% 1.83/0.60 % (13586)------------------------------
% 1.83/0.60 % (13559)Success in time 0.233 s
% 1.83/0.60 % Vampire---4.8 exiting
%------------------------------------------------------------------------------