TSTP Solution File: SWW679_1 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SWW679_1 : TPTP v8.1.2. Released v6.4.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 : n024.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 : Sun May 5 11:19:48 EDT 2024
% Result : Theorem 0.61s 0.78s
% Output : Refutation 0.61s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 24
% Syntax : Number of formulae : 65 ( 7 unt; 14 typ; 0 def)
% Number of atoms : 284 ( 65 equ)
% Maximal formula atoms : 18 ( 5 avg)
% Number of connectives : 356 ( 123 ~; 81 |; 97 &)
% ( 11 <=>; 44 =>; 0 <=; 0 <~>)
% Maximal formula depth : 13 ( 6 avg)
% Maximal term depth : 2 ( 1 avg)
% Number arithmetic : 90 ( 55 atm; 0 fun; 0 num; 35 var)
% Number of types : 3 ( 1 usr; 1 ari)
% Number of type conns : 14 ( 10 >; 4 *; 0 +; 0 <<)
% Number of predicates : 13 ( 7 usr; 5 prp; 0-3 aty)
% Number of functors : 9 ( 9 usr; 3 con; 0-3 aty)
% Number of variables : 87 ( 64 !; 22 ?; 87 :)
% ( 1 !>; 0 ?*; 0 @-; 0 @+)
% Comments :
%------------------------------------------------------------------------------
tff(type_def_5,type,
'Tree': $tType ).
tff(func_def_0,type,
'empty:Tree': 'Tree' ).
tff(func_def_1,type,
'left:(Tree)>Tree': 'Tree' > 'Tree' ).
tff(func_def_2,type,
'val:(Tree)>Int': 'Tree' > $int ).
tff(func_def_3,type,
'node:(Int*Tree*Tree)>Tree': ( $int * 'Tree' * 'Tree' ) > 'Tree' ).
tff(func_def_4,type,
'right:(Tree)>Tree': 'Tree' > 'Tree' ).
tff(func_def_9,type,
sK1: 'Tree' ).
tff(func_def_10,type,
sK2: $int ).
tff(func_def_11,type,
sK3: 'Tree' > $int ).
tff(func_def_12,type,
sK4: 'Tree' > $int ).
tff(pred_def_1,type,
searchtree: 'Tree' > $o ).
tff(pred_def_2,type,
in: ( $int * 'Tree' ) > $o ).
tff(pred_def_6,type,
sP0: 'Tree' > $o ).
tff(pred_def_7,type,
sQ5_eqProxy:
!>[X0: $tType] : ( ( X0 * X0 ) > $o ) ).
tff(f164,plain,
$false,
inference(avatar_sat_refutation,[],[f124,f125,f157,f163]) ).
tff(f163,plain,
spl6_1,
inference(avatar_contradiction_clause,[],[f162]) ).
tff(f162,plain,
( $false
| spl6_1 ),
inference(subsumption_resolution,[],[f161,f52]) ).
tff(f52,plain,
searchtree(sK1),
inference(cnf_transformation,[],[f42]) ).
tff(f42,plain,
( ( ( ! [X2: 'Tree'] :
( ~ searchtree(X2)
| ( 'right:(Tree)>Tree'(sK1) != X2 ) )
& ~ $less(sK2,'val:(Tree)>Int'(sK1)) )
| ( ! [X3: 'Tree'] :
( ~ searchtree(X3)
| ( 'left:(Tree)>Tree'(sK1) != X3 ) )
& $less(sK2,'val:(Tree)>Int'(sK1)) ) )
& ( sK2 != 'val:(Tree)>Int'(sK1) )
& ( 'empty:Tree' != sK1 )
& searchtree(sK1) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK1,sK2])],[f35,f41]) ).
tff(f41,plain,
( ? [X0: 'Tree',X1: $int] :
( ( ( ! [X2: 'Tree'] :
( ~ searchtree(X2)
| ( 'right:(Tree)>Tree'(X0) != X2 ) )
& ~ $less(X1,'val:(Tree)>Int'(X0)) )
| ( ! [X3: 'Tree'] :
( ~ searchtree(X3)
| ( 'left:(Tree)>Tree'(X0) != X3 ) )
& $less(X1,'val:(Tree)>Int'(X0)) ) )
& ( 'val:(Tree)>Int'(X0) != X1 )
& ( 'empty:Tree' != X0 )
& searchtree(X0) )
=> ( ( ( ! [X2: 'Tree'] :
( ~ searchtree(X2)
| ( 'right:(Tree)>Tree'(sK1) != X2 ) )
& ~ $less(sK2,'val:(Tree)>Int'(sK1)) )
| ( ! [X3: 'Tree'] :
( ~ searchtree(X3)
| ( 'left:(Tree)>Tree'(sK1) != X3 ) )
& $less(sK2,'val:(Tree)>Int'(sK1)) ) )
& ( sK2 != 'val:(Tree)>Int'(sK1) )
& ( 'empty:Tree' != sK1 )
& searchtree(sK1) ) ),
introduced(choice_axiom,[]) ).
tff(f35,plain,
? [X0: 'Tree',X1: $int] :
( ( ( ! [X2: 'Tree'] :
( ~ searchtree(X2)
| ( 'right:(Tree)>Tree'(X0) != X2 ) )
& ~ $less(X1,'val:(Tree)>Int'(X0)) )
| ( ! [X3: 'Tree'] :
( ~ searchtree(X3)
| ( 'left:(Tree)>Tree'(X0) != X3 ) )
& $less(X1,'val:(Tree)>Int'(X0)) ) )
& ( 'val:(Tree)>Int'(X0) != X1 )
& ( 'empty:Tree' != X0 )
& searchtree(X0) ),
inference(flattening,[],[f34]) ).
tff(f34,plain,
? [X0: 'Tree',X1: $int] :
( ( ( ! [X2: 'Tree'] :
( ~ searchtree(X2)
| ( 'right:(Tree)>Tree'(X0) != X2 ) )
& ~ $less(X1,'val:(Tree)>Int'(X0)) )
| ( ! [X3: 'Tree'] :
( ~ searchtree(X3)
| ( 'left:(Tree)>Tree'(X0) != X3 ) )
& $less(X1,'val:(Tree)>Int'(X0)) ) )
& ( 'val:(Tree)>Int'(X0) != X1 )
& ( 'empty:Tree' != X0 )
& searchtree(X0) ),
inference(ennf_transformation,[],[f24]) ).
tff(f24,plain,
~ ! [X0: 'Tree',X1: $int] :
( searchtree(X0)
=> ( ( 'empty:Tree' != X0 )
=> ( ( 'val:(Tree)>Int'(X0) != X1 )
=> ( ( ~ $less(X1,'val:(Tree)>Int'(X0))
=> ? [X2: 'Tree'] :
( searchtree(X2)
& ( 'right:(Tree)>Tree'(X0) = X2 ) ) )
& ( $less(X1,'val:(Tree)>Int'(X0))
=> ? [X3: 'Tree'] :
( searchtree(X3)
& ( 'left:(Tree)>Tree'(X0) = X3 ) ) ) ) ) ) ),
inference(true_and_false_elimination,[],[f23]) ).
tff(f23,plain,
~ ! [X0: 'Tree',X1: $int] :
( searchtree(X0)
=> ( ( ( 'empty:Tree' != X0 )
=> ( ( ( 'val:(Tree)>Int'(X0) != X1 )
=> ( ( ~ $less(X1,'val:(Tree)>Int'(X0))
=> ? [X2: 'Tree'] :
( searchtree(X2)
& ( 'right:(Tree)>Tree'(X0) = X2 ) ) )
& ( $less(X1,'val:(Tree)>Int'(X0))
=> ? [X3: 'Tree'] :
( searchtree(X3)
& ( 'left:(Tree)>Tree'(X0) = X3 ) ) ) ) )
& ( ( 'val:(Tree)>Int'(X0) = X1 )
=> $true ) ) )
& ( ( 'empty:Tree' = X0 )
=> $true ) ) ),
inference(rectify,[],[f9]) ).
tff(f9,negated_conjecture,
~ ! [X5: 'Tree',X4: $int] :
( searchtree(X5)
=> ( ( ( 'empty:Tree' != X5 )
=> ( ( ( 'val:(Tree)>Int'(X5) != X4 )
=> ( ( ~ $less(X4,'val:(Tree)>Int'(X5))
=> ? [X7: 'Tree'] :
( searchtree(X7)
& ( 'right:(Tree)>Tree'(X5) = X7 ) ) )
& ( $less(X4,'val:(Tree)>Int'(X5))
=> ? [X6: 'Tree'] :
( searchtree(X6)
& ( 'left:(Tree)>Tree'(X5) = X6 ) ) ) ) )
& ( ( 'val:(Tree)>Int'(X5) = X4 )
=> $true ) ) )
& ( ( 'empty:Tree' = X5 )
=> $true ) ) ),
inference(negated_conjecture,[],[f8]) ).
tff(f8,conjecture,
! [X5: 'Tree',X4: $int] :
( searchtree(X5)
=> ( ( ( 'empty:Tree' != X5 )
=> ( ( ( 'val:(Tree)>Int'(X5) != X4 )
=> ( ( ~ $less(X4,'val:(Tree)>Int'(X5))
=> ? [X7: 'Tree'] :
( searchtree(X7)
& ( 'right:(Tree)>Tree'(X5) = X7 ) ) )
& ( $less(X4,'val:(Tree)>Int'(X5))
=> ? [X6: 'Tree'] :
( searchtree(X6)
& ( 'left:(Tree)>Tree'(X5) = X6 ) ) ) ) )
& ( ( 'val:(Tree)>Int'(X5) = X4 )
=> $true ) ) )
& ( ( 'empty:Tree' = X5 )
=> $true ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.NyZfiHgUo8/Vampire---4.8_16472',formula_007) ).
tff(f161,plain,
( ~ searchtree(sK1)
| spl6_1 ),
inference(subsumption_resolution,[],[f159,f114]) ).
tff(f114,plain,
( ~ searchtree('left:(Tree)>Tree'(sK1))
| spl6_1 ),
inference(avatar_component_clause,[],[f112]) ).
tff(f112,plain,
( spl6_1
<=> searchtree('left:(Tree)>Tree'(sK1)) ),
introduced(avatar_definition,[new_symbols(naming,[spl6_1])]) ).
tff(f159,plain,
( searchtree('left:(Tree)>Tree'(sK1))
| ~ searchtree(sK1) ),
inference(resolution,[],[f150,f91]) ).
tff(f91,plain,
~ sQ5_eqProxy('Tree','empty:Tree',sK1),
inference(equality_proxy_replacement,[],[f53,f89]) ).
tff(f89,plain,
! [X0: $tType,X2: X0,X1: X0] :
( sQ5_eqProxy(X0,X1,X2)
<=> ( X1 = X2 ) ),
introduced(equality_proxy_definition,[new_symbols(naming,[sQ5_eqProxy])]) ).
tff(f53,plain,
'empty:Tree' != sK1,
inference(cnf_transformation,[],[f42]) ).
tff(f150,plain,
! [X0: 'Tree'] :
( sQ5_eqProxy('Tree','empty:Tree',X0)
| searchtree('left:(Tree)>Tree'(X0))
| ~ searchtree(X0) ),
inference(forward_literal_rewriting,[],[f103,f73]) ).
tff(f73,plain,
! [X0: 'Tree'] :
( sP0(X0)
| ~ searchtree(X0) ),
inference(cnf_transformation,[],[f49]) ).
tff(f49,plain,
! [X0: 'Tree'] :
( ( searchtree(X0)
| ~ sP0(X0) )
& ( sP0(X0)
| ~ searchtree(X0) ) ),
inference(nnf_transformation,[],[f40]) ).
tff(f40,plain,
! [X0: 'Tree'] :
( searchtree(X0)
<=> sP0(X0) ),
inference(definition_folding,[],[f36,f39]) ).
tff(f39,plain,
! [X0: 'Tree'] :
( sP0(X0)
<=> ( ( ! [X1: $int] :
( $less('val:(Tree)>Int'(X0),X1)
| ~ in(X1,'right:(Tree)>Tree'(X0)) )
& ! [X2: $int] :
( ~ $less('val:(Tree)>Int'(X0),X2)
| ~ in(X2,'left:(Tree)>Tree'(X0)) )
& searchtree('right:(Tree)>Tree'(X0))
& searchtree('left:(Tree)>Tree'(X0)) )
| ( 'empty:Tree' = X0 ) ) ),
introduced(predicate_definition_introduction,[new_symbols(naming,[sP0])]) ).
tff(f36,plain,
! [X0: 'Tree'] :
( searchtree(X0)
<=> ( ( ! [X1: $int] :
( $less('val:(Tree)>Int'(X0),X1)
| ~ in(X1,'right:(Tree)>Tree'(X0)) )
& ! [X2: $int] :
( ~ $less('val:(Tree)>Int'(X0),X2)
| ~ in(X2,'left:(Tree)>Tree'(X0)) )
& searchtree('right:(Tree)>Tree'(X0))
& searchtree('left:(Tree)>Tree'(X0)) )
| ( 'empty:Tree' = X0 ) ) ),
inference(ennf_transformation,[],[f30]) ).
tff(f30,plain,
! [X0: 'Tree'] :
( searchtree(X0)
<=> ( ( 'empty:Tree' != X0 )
=> ( ! [X1: $int] :
( in(X1,'right:(Tree)>Tree'(X0))
=> $less('val:(Tree)>Int'(X0),X1) )
& ! [X2: $int] :
( in(X2,'left:(Tree)>Tree'(X0))
=> ~ $less('val:(Tree)>Int'(X0),X2) )
& searchtree('right:(Tree)>Tree'(X0))
& searchtree('left:(Tree)>Tree'(X0)) ) ) ),
inference(true_and_false_elimination,[],[f29]) ).
tff(f29,plain,
! [X0: 'Tree'] :
( searchtree(X0)
<=> ( ( ( 'empty:Tree' != X0 )
=> ( ! [X1: $int] :
( in(X1,'right:(Tree)>Tree'(X0))
=> $less('val:(Tree)>Int'(X0),X1) )
& ! [X2: $int] :
( in(X2,'left:(Tree)>Tree'(X0))
=> ~ $less('val:(Tree)>Int'(X0),X2) )
& searchtree('right:(Tree)>Tree'(X0))
& searchtree('left:(Tree)>Tree'(X0)) ) )
& ( ( 'empty:Tree' = X0 )
=> $true ) ) ),
inference(rectify,[],[f10]) ).
tff(f10,plain,
! [X5: 'Tree'] :
( searchtree(X5)
<=> ( ( ( 'empty:Tree' != X5 )
=> ( ! [X4: $int] :
( in(X4,'right:(Tree)>Tree'(X5))
=> $less('val:(Tree)>Int'(X5),X4) )
& ! [X4: $int] :
( in(X4,'left:(Tree)>Tree'(X5))
=> ~ $less('val:(Tree)>Int'(X5),X4) )
& searchtree('right:(Tree)>Tree'(X5))
& searchtree('left:(Tree)>Tree'(X5)) ) )
& ( ( 'empty:Tree' = X5 )
=> $true ) ) ),
inference(theory_normalization,[],[f7]) ).
tff(f7,axiom,
! [X5: 'Tree'] :
( searchtree(X5)
<=> ( ( ( 'empty:Tree' != X5 )
=> ( ! [X4: $int] :
( in(X4,'right:(Tree)>Tree'(X5))
=> $greater(X4,'val:(Tree)>Int'(X5)) )
& ! [X4: $int] :
( in(X4,'left:(Tree)>Tree'(X5))
=> $lesseq(X4,'val:(Tree)>Int'(X5)) )
& searchtree('right:(Tree)>Tree'(X5))
& searchtree('left:(Tree)>Tree'(X5)) ) )
& ( ( 'empty:Tree' = X5 )
=> $true ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.NyZfiHgUo8/Vampire---4.8_16472',formula_006) ).
tff(f103,plain,
! [X0: 'Tree'] :
( searchtree('left:(Tree)>Tree'(X0))
| sQ5_eqProxy('Tree','empty:Tree',X0)
| ~ sP0(X0) ),
inference(equality_proxy_replacement,[],[f64,f89]) ).
tff(f64,plain,
! [X0: 'Tree'] :
( searchtree('left:(Tree)>Tree'(X0))
| ( 'empty:Tree' = X0 )
| ~ sP0(X0) ),
inference(cnf_transformation,[],[f48]) ).
tff(f48,plain,
! [X0: 'Tree'] :
( ( sP0(X0)
| ( ( ( ~ $less('val:(Tree)>Int'(X0),sK3(X0))
& in(sK3(X0),'right:(Tree)>Tree'(X0)) )
| ( $less('val:(Tree)>Int'(X0),sK4(X0))
& in(sK4(X0),'left:(Tree)>Tree'(X0)) )
| ~ searchtree('right:(Tree)>Tree'(X0))
| ~ searchtree('left:(Tree)>Tree'(X0)) )
& ( 'empty:Tree' != X0 ) ) )
& ( ( ! [X3: $int] :
( $less('val:(Tree)>Int'(X0),X3)
| ~ in(X3,'right:(Tree)>Tree'(X0)) )
& ! [X4: $int] :
( ~ $less('val:(Tree)>Int'(X0),X4)
| ~ in(X4,'left:(Tree)>Tree'(X0)) )
& searchtree('right:(Tree)>Tree'(X0))
& searchtree('left:(Tree)>Tree'(X0)) )
| ( 'empty:Tree' = X0 )
| ~ sP0(X0) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK3,sK4])],[f45,f47,f46]) ).
tff(f46,plain,
! [X0: 'Tree'] :
( ? [X1: $int] :
( ~ $less('val:(Tree)>Int'(X0),X1)
& in(X1,'right:(Tree)>Tree'(X0)) )
=> ( ~ $less('val:(Tree)>Int'(X0),sK3(X0))
& in(sK3(X0),'right:(Tree)>Tree'(X0)) ) ),
introduced(choice_axiom,[]) ).
tff(f47,plain,
! [X0: 'Tree'] :
( ? [X2: $int] :
( $less('val:(Tree)>Int'(X0),X2)
& in(X2,'left:(Tree)>Tree'(X0)) )
=> ( $less('val:(Tree)>Int'(X0),sK4(X0))
& in(sK4(X0),'left:(Tree)>Tree'(X0)) ) ),
introduced(choice_axiom,[]) ).
tff(f45,plain,
! [X0: 'Tree'] :
( ( sP0(X0)
| ( ( ? [X1: $int] :
( ~ $less('val:(Tree)>Int'(X0),X1)
& in(X1,'right:(Tree)>Tree'(X0)) )
| ? [X2: $int] :
( $less('val:(Tree)>Int'(X0),X2)
& in(X2,'left:(Tree)>Tree'(X0)) )
| ~ searchtree('right:(Tree)>Tree'(X0))
| ~ searchtree('left:(Tree)>Tree'(X0)) )
& ( 'empty:Tree' != X0 ) ) )
& ( ( ! [X3: $int] :
( $less('val:(Tree)>Int'(X0),X3)
| ~ in(X3,'right:(Tree)>Tree'(X0)) )
& ! [X4: $int] :
( ~ $less('val:(Tree)>Int'(X0),X4)
| ~ in(X4,'left:(Tree)>Tree'(X0)) )
& searchtree('right:(Tree)>Tree'(X0))
& searchtree('left:(Tree)>Tree'(X0)) )
| ( 'empty:Tree' = X0 )
| ~ sP0(X0) ) ),
inference(rectify,[],[f44]) ).
tff(f44,plain,
! [X0: 'Tree'] :
( ( sP0(X0)
| ( ( ? [X1: $int] :
( ~ $less('val:(Tree)>Int'(X0),X1)
& in(X1,'right:(Tree)>Tree'(X0)) )
| ? [X2: $int] :
( $less('val:(Tree)>Int'(X0),X2)
& in(X2,'left:(Tree)>Tree'(X0)) )
| ~ searchtree('right:(Tree)>Tree'(X0))
| ~ searchtree('left:(Tree)>Tree'(X0)) )
& ( 'empty:Tree' != X0 ) ) )
& ( ( ! [X1: $int] :
( $less('val:(Tree)>Int'(X0),X1)
| ~ in(X1,'right:(Tree)>Tree'(X0)) )
& ! [X2: $int] :
( ~ $less('val:(Tree)>Int'(X0),X2)
| ~ in(X2,'left:(Tree)>Tree'(X0)) )
& searchtree('right:(Tree)>Tree'(X0))
& searchtree('left:(Tree)>Tree'(X0)) )
| ( 'empty:Tree' = X0 )
| ~ sP0(X0) ) ),
inference(flattening,[],[f43]) ).
tff(f43,plain,
! [X0: 'Tree'] :
( ( sP0(X0)
| ( ( ? [X1: $int] :
( ~ $less('val:(Tree)>Int'(X0),X1)
& in(X1,'right:(Tree)>Tree'(X0)) )
| ? [X2: $int] :
( $less('val:(Tree)>Int'(X0),X2)
& in(X2,'left:(Tree)>Tree'(X0)) )
| ~ searchtree('right:(Tree)>Tree'(X0))
| ~ searchtree('left:(Tree)>Tree'(X0)) )
& ( 'empty:Tree' != X0 ) ) )
& ( ( ! [X1: $int] :
( $less('val:(Tree)>Int'(X0),X1)
| ~ in(X1,'right:(Tree)>Tree'(X0)) )
& ! [X2: $int] :
( ~ $less('val:(Tree)>Int'(X0),X2)
| ~ in(X2,'left:(Tree)>Tree'(X0)) )
& searchtree('right:(Tree)>Tree'(X0))
& searchtree('left:(Tree)>Tree'(X0)) )
| ( 'empty:Tree' = X0 )
| ~ sP0(X0) ) ),
inference(nnf_transformation,[],[f39]) ).
tff(f157,plain,
spl6_2,
inference(avatar_split_clause,[],[f156,f116]) ).
tff(f116,plain,
( spl6_2
<=> searchtree('right:(Tree)>Tree'(sK1)) ),
introduced(avatar_definition,[new_symbols(naming,[spl6_2])]) ).
tff(f156,plain,
searchtree('right:(Tree)>Tree'(sK1)),
inference(subsumption_resolution,[],[f151,f52]) ).
tff(f151,plain,
( searchtree('right:(Tree)>Tree'(sK1))
| ~ searchtree(sK1) ),
inference(resolution,[],[f147,f91]) ).
tff(f147,plain,
! [X0: 'Tree'] :
( sQ5_eqProxy('Tree','empty:Tree',X0)
| searchtree('right:(Tree)>Tree'(X0))
| ~ searchtree(X0) ),
inference(forward_literal_rewriting,[],[f102,f73]) ).
tff(f102,plain,
! [X0: 'Tree'] :
( searchtree('right:(Tree)>Tree'(X0))
| sQ5_eqProxy('Tree','empty:Tree',X0)
| ~ sP0(X0) ),
inference(equality_proxy_replacement,[],[f65,f89]) ).
tff(f65,plain,
! [X0: 'Tree'] :
( searchtree('right:(Tree)>Tree'(X0))
| ( 'empty:Tree' = X0 )
| ~ sP0(X0) ),
inference(cnf_transformation,[],[f48]) ).
tff(f125,plain,
( ~ spl6_1
| ~ spl6_3 ),
inference(avatar_split_clause,[],[f84,f121,f112]) ).
tff(f121,plain,
( spl6_3
<=> $less(sK2,'val:(Tree)>Int'(sK1)) ),
introduced(avatar_definition,[new_symbols(naming,[spl6_3])]) ).
tff(f84,plain,
( ~ $less(sK2,'val:(Tree)>Int'(sK1))
| ~ searchtree('left:(Tree)>Tree'(sK1)) ),
inference(equality_resolution,[],[f56]) ).
tff(f56,plain,
! [X3: 'Tree'] :
( ~ $less(sK2,'val:(Tree)>Int'(sK1))
| ~ searchtree(X3)
| ( 'left:(Tree)>Tree'(sK1) != X3 ) ),
inference(cnf_transformation,[],[f42]) ).
tff(f124,plain,
( spl6_3
| ~ spl6_2 ),
inference(avatar_split_clause,[],[f83,f116,f121]) ).
tff(f83,plain,
( ~ searchtree('right:(Tree)>Tree'(sK1))
| $less(sK2,'val:(Tree)>Int'(sK1)) ),
inference(equality_resolution,[],[f57]) ).
tff(f57,plain,
! [X2: 'Tree'] :
( ~ searchtree(X2)
| ( 'right:(Tree)>Tree'(sK1) != X2 )
| $less(sK2,'val:(Tree)>Int'(sK1)) ),
inference(cnf_transformation,[],[f42]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.13 % Problem : SWW679_1 : TPTP v8.1.2. Released v6.4.0.
% 0.14/0.15 % 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.37 % Computer : n024.cluster.edu
% 0.15/0.37 % Model : x86_64 x86_64
% 0.15/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.37 % Memory : 8042.1875MB
% 0.15/0.37 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.37 % CPULimit : 300
% 0.15/0.37 % WCLimit : 300
% 0.15/0.37 % DateTime : Fri May 3 19:33:08 EDT 2024
% 0.15/0.37 % CPUTime :
% 0.15/0.37 This is a TF0_THM_EQU_ARI problem
% 0.15/0.37 Running 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 300 /export/starexec/sandbox2/tmp/tmp.NyZfiHgUo8/Vampire---4.8_16472
% 0.61/0.77 % (16638)dis-1011_2:1_sil=2000:lsd=20:nwc=5.0:flr=on:mep=off:st=3.0:i=34:sd=1:ep=RS:ss=axioms_0 on Vampire---4 for (2996ds/34Mi)
% 0.61/0.77 % (16640)lrs+1011_1:1_sil=8000:sp=occurrence:nwc=10.0:i=78:ss=axioms:sgt=8_0 on Vampire---4 for (2996ds/78Mi)
% 0.61/0.77 % (16645)lrs-21_1:1_to=lpo:sil=2000:sp=frequency:sos=on:lma=on:i=56:sd=2:ss=axioms:ep=R_0 on Vampire---4 for (2996ds/56Mi)
% 0.61/0.77 % (16641)ott+1011_1:1_sil=2000:urr=on:i=33:sd=1:kws=inv_frequency:ss=axioms:sup=off_0 on Vampire---4 for (2996ds/33Mi)
% 0.61/0.77 % (16639)lrs+1011_461:32768_sil=16000:irw=on:sp=frequency:lsd=20:fd=preordered:nwc=10.0:s2agt=32:alpa=false:cond=fast:s2a=on:i=51:s2at=3.0:awrs=decay:awrsf=691:bd=off:nm=20:fsr=off:amm=sco:uhcvi=on:rawr=on_0 on Vampire---4 for (2996ds/51Mi)
% 0.61/0.77 % (16642)lrs+2_1:1_sil=16000:fde=none:sos=all:nwc=5.0:i=34:ep=RS:s2pl=on:lma=on:afp=100000_0 on Vampire---4 for (2996ds/34Mi)
% 0.61/0.77 % (16643)lrs+1002_1:16_to=lpo:sil=32000:sp=unary_frequency:sos=on:i=45:bd=off:ss=axioms_0 on Vampire---4 for (2996ds/45Mi)
% 0.61/0.77 % (16644)lrs+21_1:5_sil=2000:sos=on:urr=on:newcnf=on:slsq=on:i=83:slsql=off:bd=off:nm=2:ss=axioms:st=1.5:sp=const_min:gsp=on:rawr=on_0 on Vampire---4 for (2996ds/83Mi)
% 0.61/0.78 % (16638)First to succeed.
% 0.61/0.78 % (16645)Also succeeded, but the first one will report.
% 0.61/0.78 % (16643)Also succeeded, but the first one will report.
% 0.61/0.78 % (16642)Also succeeded, but the first one will report.
% 0.61/0.78 % (16638)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-16637"
% 0.61/0.78 % (16641)Also succeeded, but the first one will report.
% 0.61/0.78 % (16638)Refutation found. Thanks to Tanya!
% 0.61/0.78 % SZS status Theorem for Vampire---4
% 0.61/0.78 % SZS output start Proof for Vampire---4
% See solution above
% 0.61/0.78 % (16638)------------------------------
% 0.61/0.78 % (16638)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.61/0.78 % (16638)Termination reason: Refutation
% 0.61/0.78
% 0.61/0.78 % (16638)Memory used [KB]: 1076
% 0.61/0.78 % (16638)Time elapsed: 0.004 s
% 0.61/0.78 % (16638)Instructions burned: 7 (million)
% 0.61/0.78 % (16637)Success in time 0.404 s
% 0.61/0.78 % Vampire---4.8 exiting
%------------------------------------------------------------------------------