TSTP Solution File: SWW678_1 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SWW678_1 : TPTP v8.2.0. 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 : n003.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 07:02:15 EDT 2024
% Result : Theorem 0.65s 0.84s
% Output : Refutation 0.65s
% Verified :
% SZS Type : Refutation
% Derivation depth : 15
% Number of leaves : 41
% Syntax : Number of formulae : 171 ( 14 unt; 20 typ; 0 def)
% Number of atoms : 514 ( 104 equ)
% Maximal formula atoms : 14 ( 3 avg)
% Number of connectives : 542 ( 179 ~; 261 |; 41 &)
% ( 23 <=>; 37 =>; 0 <=; 1 <~>)
% Maximal formula depth : 14 ( 5 avg)
% Maximal term depth : 3 ( 1 avg)
% Number arithmetic : 113 ( 49 atm; 0 fun; 0 num; 64 var)
% Number of types : 3 ( 1 usr; 1 ari)
% Number of type conns : 26 ( 16 >; 10 *; 0 +; 0 <<)
% Number of predicates : 26 ( 20 usr; 14 prp; 0-2 aty)
% Number of functors : 11 ( 11 usr; 3 con; 0-3 aty)
% Number of variables : 138 ( 128 !; 10 ?; 138 :)
% 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,
sK0: 'Tree' ).
tff(func_def_10,type,
sK1: $int ).
tff(func_def_11,type,
sK5: ( 'Tree' * $int ) > 'Tree' ).
tff(func_def_12,type,
sK6: ( 'Tree' * $int ) > 'Tree' ).
tff(func_def_13,type,
sK8: 'Tree' > $int ).
tff(func_def_14,type,
sK9: 'Tree' > $int ).
tff(pred_def_1,type,
searchtree: 'Tree' > $o ).
tff(pred_def_2,type,
in: ( $int * 'Tree' ) > $o ).
tff(pred_def_6,type,
sP2: ( $int * 'Tree' ) > $o ).
tff(pred_def_7,type,
sP3: ( $int * 'Tree' ) > $o ).
tff(pred_def_8,type,
sP4: ( $int * 'Tree' ) > $o ).
tff(pred_def_9,type,
sP7: 'Tree' > $o ).
tff(pred_def_10,type,
sP10: ( $int * 'Tree' ) > $o ).
tff(pred_def_11,type,
sP11: ( 'Tree' * $int ) > $o ).
tff(f775,plain,
$false,
inference(avatar_sat_refutation,[],[f94,f99,f100,f452,f472,f486,f503,f540,f569,f571,f619,f624,f625,f631,f719,f722,f747,f753,f754,f772]) ).
tff(f772,plain,
( spl12_2
| spl12_3
| ~ spl12_5 ),
inference(avatar_contradiction_clause,[],[f771]) ).
tff(f771,plain,
( $false
| spl12_2
| spl12_3
| ~ spl12_5 ),
inference(subsumption_resolution,[],[f764,f92]) ).
tff(f92,plain,
( ~ in(sK1,sK0)
| spl12_2 ),
inference(avatar_component_clause,[],[f91]) ).
tff(f91,plain,
( spl12_2
<=> in(sK1,sK0) ),
introduced(avatar_definition,[new_symbols(naming,[spl12_2])]) ).
tff(f764,plain,
( in(sK1,sK0)
| spl12_3
| ~ spl12_5 ),
inference(superposition,[],[f512,f447]) ).
tff(f447,plain,
( ( sK1 = 'val:(Tree)>Int'(sK0) )
| ~ spl12_5 ),
inference(avatar_component_clause,[],[f445]) ).
tff(f445,plain,
( spl12_5
<=> ( sK1 = 'val:(Tree)>Int'(sK0) ) ),
introduced(avatar_definition,[new_symbols(naming,[spl12_5])]) ).
tff(f512,plain,
( in('val:(Tree)>Int'(sK0),sK0)
| spl12_3 ),
inference(unit_resulting_resolution,[],[f84,f97,f74]) ).
tff(f74,plain,
! [X0: $int,X1: 'Tree'] :
( ~ sP11(X1,X0)
| ( 'empty:Tree' = X1 )
| in(X0,X1) ),
inference(cnf_transformation,[],[f33]) ).
tff(f33,plain,
! [X0: $int,X1: 'Tree'] :
( in(X0,X1)
<=> ( ( in(X0,'right:(Tree)>Tree'(X1))
| in(X0,'left:(Tree)>Tree'(X1))
| ( 'val:(Tree)>Int'(X1) = X0 )
| ( 'empty:Tree' = X1 ) )
& ( $false
| ( 'empty:Tree' != X1 ) ) ) ),
inference(flattening,[],[f32]) ).
tff(f32,plain,
! [X0: $int,X1: 'Tree'] :
( in(X0,X1)
<=> ( ( in(X0,'right:(Tree)>Tree'(X1))
| in(X0,'left:(Tree)>Tree'(X1))
| ( 'val:(Tree)>Int'(X1) = X0 )
| ( 'empty:Tree' = X1 ) )
& ( $false
| ( 'empty:Tree' != X1 ) ) ) ),
inference(ennf_transformation,[],[f27]) ).
tff(f27,plain,
! [X0: $int,X1: 'Tree'] :
( in(X0,X1)
<=> ( ( ( 'empty:Tree' != X1 )
=> ( in(X0,'right:(Tree)>Tree'(X1))
| in(X0,'left:(Tree)>Tree'(X1))
| ( 'val:(Tree)>Int'(X1) = X0 ) ) )
& ( ( 'empty:Tree' = X1 )
=> $false ) ) ),
inference(rectify,[],[f6]) ).
tff(f6,axiom,
! [X4: $int,X5: 'Tree'] :
( in(X4,X5)
<=> ( ( ( 'empty:Tree' != X5 )
=> ( in(X4,'right:(Tree)>Tree'(X5))
| in(X4,'left:(Tree)>Tree'(X5))
| ( 'val:(Tree)>Int'(X5) = X4 ) ) )
& ( ( 'empty:Tree' = X5 )
=> $false ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',formula_005) ).
tff(f97,plain,
( ( 'empty:Tree' != sK0 )
| spl12_3 ),
inference(avatar_component_clause,[],[f96]) ).
tff(f96,plain,
( spl12_3
<=> ( 'empty:Tree' = sK0 ) ),
introduced(avatar_definition,[new_symbols(naming,[spl12_3])]) ).
tff(f84,plain,
! [X1: 'Tree'] : sP11(X1,'val:(Tree)>Int'(X1)),
inference(equality_resolution,[],[f69]) ).
tff(f69,plain,
! [X0: $int,X1: 'Tree'] :
( ( 'val:(Tree)>Int'(X1) != X0 )
| sP11(X1,X0) ),
inference(cnf_transformation,[],[f33]) ).
tff(f754,plain,
( ~ spl12_14
| spl12_2
| spl12_3 ),
inference(avatar_split_clause,[],[f736,f96,f91,f725]) ).
tff(f725,plain,
( spl12_14
<=> sP11(sK0,sK1) ),
introduced(avatar_definition,[new_symbols(naming,[spl12_14])]) ).
tff(f736,plain,
( ~ sP11(sK0,sK1)
| spl12_2
| spl12_3 ),
inference(unit_resulting_resolution,[],[f97,f92,f74]) ).
tff(f753,plain,
( spl12_14
| ~ spl12_15 ),
inference(avatar_contradiction_clause,[],[f752]) ).
tff(f752,plain,
( $false
| spl12_14
| ~ spl12_15 ),
inference(subsumption_resolution,[],[f748,f731]) ).
tff(f731,plain,
( in(sK1,'left:(Tree)>Tree'(sK0))
| ~ spl12_15 ),
inference(avatar_component_clause,[],[f729]) ).
tff(f729,plain,
( spl12_15
<=> in(sK1,'left:(Tree)>Tree'(sK0)) ),
introduced(avatar_definition,[new_symbols(naming,[spl12_15])]) ).
tff(f748,plain,
( ~ in(sK1,'left:(Tree)>Tree'(sK0))
| spl12_14 ),
inference(unit_resulting_resolution,[],[f727,f70]) ).
tff(f70,plain,
! [X0: $int,X1: 'Tree'] :
( ~ in(X0,'left:(Tree)>Tree'(X1))
| sP11(X1,X0) ),
inference(cnf_transformation,[],[f33]) ).
tff(f727,plain,
( ~ sP11(sK0,sK1)
| spl12_14 ),
inference(avatar_component_clause,[],[f725]) ).
tff(f747,plain,
( spl12_15
| spl12_5
| ~ spl12_9
| ~ spl12_12
| ~ spl12_13 ),
inference(avatar_split_clause,[],[f746,f628,f566,f468,f445,f729]) ).
tff(f468,plain,
( spl12_9
<=> $less(sK1,'val:(Tree)>Int'(sK0)) ),
introduced(avatar_definition,[new_symbols(naming,[spl12_9])]) ).
tff(f566,plain,
( spl12_12
<=> sP3(sK1,sK0) ),
introduced(avatar_definition,[new_symbols(naming,[spl12_12])]) ).
tff(f628,plain,
( spl12_13
<=> ( 'left:(Tree)>Tree'(sK0) = sK5(sK0,sK1) ) ),
introduced(avatar_definition,[new_symbols(naming,[spl12_13])]) ).
tff(f746,plain,
( in(sK1,'left:(Tree)>Tree'(sK0))
| spl12_5
| ~ spl12_9
| ~ spl12_12
| ~ spl12_13 ),
inference(forward_demodulation,[],[f738,f630]) ).
tff(f630,plain,
( ( 'left:(Tree)>Tree'(sK0) = sK5(sK0,sK1) )
| ~ spl12_13 ),
inference(avatar_component_clause,[],[f628]) ).
tff(f738,plain,
( in(sK1,sK5(sK0,sK1))
| spl12_5
| ~ spl12_9
| ~ spl12_12 ),
inference(unit_resulting_resolution,[],[f470,f446,f568,f38]) ).
tff(f38,plain,
! [X0: 'Tree',X1: $int] :
( in(X1,sK5(X0,X1))
| ~ $less(X1,'val:(Tree)>Int'(X0))
| ( 'val:(Tree)>Int'(X0) = X1 )
| ~ sP3(X1,X0) ),
inference(cnf_transformation,[],[f30]) ).
tff(f30,plain,
? [X0: 'Tree',X1: $int] :
( ( ( ( ( ( ( ( ? [X2: 'Tree'] :
( in(X1,X2)
& ( 'right:(Tree)>Tree'(X0) = X2 ) )
| $less(X1,'val:(Tree)>Int'(X0)) )
& ( ? [X3: 'Tree'] :
( in(X1,X3)
& ( 'left:(Tree)>Tree'(X0) = X3 ) )
| ~ $less(X1,'val:(Tree)>Int'(X0)) ) )
| ( 'val:(Tree)>Int'(X0) = X1 ) )
& ( $true
| ( 'val:(Tree)>Int'(X0) != X1 ) ) )
| ( 'empty:Tree' = X0 ) )
& ( $false
| ( 'empty:Tree' != X0 ) ) )
<~> in(X1,X0) )
& searchtree(X0) ),
inference(ennf_transformation,[],[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'] :
( in(X1,X2)
& ( 'right:(Tree)>Tree'(X0) = X2 ) ) )
& ( $less(X1,'val:(Tree)>Int'(X0))
=> ? [X3: 'Tree'] :
( in(X1,X3)
& ( 'left:(Tree)>Tree'(X0) = X3 ) ) ) ) )
& ( ( 'val:(Tree)>Int'(X0) = X1 )
=> $true ) ) )
& ( ( 'empty:Tree' = X0 )
=> $false ) )
<=> in(X1,X0) ) ),
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'] :
( in(X4,X7)
& ( 'right:(Tree)>Tree'(X5) = X7 ) ) )
& ( $less(X4,'val:(Tree)>Int'(X5))
=> ? [X6: 'Tree'] :
( in(X4,X6)
& ( 'left:(Tree)>Tree'(X5) = X6 ) ) ) ) )
& ( ( 'val:(Tree)>Int'(X5) = X4 )
=> $true ) ) )
& ( ( 'empty:Tree' = X5 )
=> $false ) )
<=> in(X4,X5) ) ),
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'] :
( in(X4,X7)
& ( 'right:(Tree)>Tree'(X5) = X7 ) ) )
& ( $less(X4,'val:(Tree)>Int'(X5))
=> ? [X6: 'Tree'] :
( in(X4,X6)
& ( 'left:(Tree)>Tree'(X5) = X6 ) ) ) ) )
& ( ( 'val:(Tree)>Int'(X5) = X4 )
=> $true ) ) )
& ( ( 'empty:Tree' = X5 )
=> $false ) )
<=> in(X4,X5) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',formula_007) ).
tff(f568,plain,
( sP3(sK1,sK0)
| ~ spl12_12 ),
inference(avatar_component_clause,[],[f566]) ).
tff(f446,plain,
( ( sK1 != 'val:(Tree)>Int'(sK0) )
| spl12_5 ),
inference(avatar_component_clause,[],[f445]) ).
tff(f470,plain,
( $less(sK1,'val:(Tree)>Int'(sK0))
| ~ spl12_9 ),
inference(avatar_component_clause,[],[f468]) ).
tff(f722,plain,
( ~ spl12_1
| spl12_3
| spl12_12 ),
inference(avatar_split_clause,[],[f650,f566,f96,f87]) ).
tff(f87,plain,
( spl12_1
<=> sP2(sK1,sK0) ),
introduced(avatar_definition,[new_symbols(naming,[spl12_1])]) ).
tff(f650,plain,
( ~ sP2(sK1,sK0)
| spl12_3
| spl12_12 ),
inference(unit_resulting_resolution,[],[f97,f567,f46]) ).
tff(f46,plain,
! [X0: 'Tree',X1: $int] :
( sP3(X1,X0)
| ( 'empty:Tree' = X0 )
| ~ sP2(X1,X0) ),
inference(cnf_transformation,[],[f30]) ).
tff(f567,plain,
( ~ sP3(sK1,sK0)
| spl12_12 ),
inference(avatar_component_clause,[],[f566]) ).
tff(f719,plain,
( ~ spl12_2
| spl12_3
| spl12_4
| spl12_5
| ~ spl12_9
| spl12_12 ),
inference(avatar_contradiction_clause,[],[f718]) ).
tff(f718,plain,
( $false
| ~ spl12_2
| spl12_3
| spl12_4
| spl12_5
| ~ spl12_9
| spl12_12 ),
inference(subsumption_resolution,[],[f717,f634]) ).
tff(f634,plain,
( sP11(sK0,sK1)
| ~ spl12_2 ),
inference(unit_resulting_resolution,[],[f93,f75]) ).
tff(f75,plain,
! [X0: $int,X1: 'Tree'] :
( sP11(X1,X0)
| ~ in(X0,X1) ),
inference(cnf_transformation,[],[f33]) ).
tff(f93,plain,
( in(sK1,sK0)
| ~ spl12_2 ),
inference(avatar_component_clause,[],[f91]) ).
tff(f717,plain,
( ~ sP11(sK0,sK1)
| spl12_3
| spl12_4
| spl12_5
| ~ spl12_9
| spl12_12 ),
inference(subsumption_resolution,[],[f716,f97]) ).
tff(f716,plain,
( ( 'empty:Tree' = sK0 )
| ~ sP11(sK0,sK1)
| spl12_3
| spl12_4
| spl12_5
| ~ spl12_9
| spl12_12 ),
inference(subsumption_resolution,[],[f715,f662]) ).
tff(f662,plain,
( ~ in(sK1,'left:(Tree)>Tree'(sK0))
| spl12_3
| ~ spl12_9
| spl12_12 ),
inference(unit_resulting_resolution,[],[f97,f567,f470,f227]) ).
tff(f227,plain,
! [X0: 'Tree',X1: $int] :
( ~ in(X1,'left:(Tree)>Tree'(X0))
| sP3(X1,X0)
| ~ $less(X1,'val:(Tree)>Int'(X0))
| ( 'empty:Tree' = X0 ) ),
inference(superposition,[],[f189,f53]) ).
tff(f53,plain,
! [X0: 'Tree'] :
( ( 'node:(Int*Tree*Tree)>Tree'('val:(Tree)>Int'(X0),'left:(Tree)>Tree'(X0),'right:(Tree)>Tree'(X0)) = X0 )
| ( 'empty:Tree' = X0 ) ),
inference(cnf_transformation,[],[f1]) ).
tff(f1,axiom,
! [X0: 'Tree'] :
( ( 'node:(Int*Tree*Tree)>Tree'('val:(Tree)>Int'(X0),'left:(Tree)>Tree'(X0),'right:(Tree)>Tree'(X0)) = X0 )
| ( 'empty:Tree' = X0 ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',formula) ).
tff(f189,plain,
! [X2: $int,X3: 'Tree',X0: $int,X1: 'Tree'] :
( sP3(X0,'node:(Int*Tree*Tree)>Tree'(X2,X1,X3))
| ~ in(X0,X1)
| ~ $less(X0,X2) ),
inference(forward_demodulation,[],[f186,f76]) ).
tff(f76,plain,
! [X2: 'Tree',X0: $int,X1: 'Tree'] : ( 'val:(Tree)>Int'('node:(Int*Tree*Tree)>Tree'(X0,X1,X2)) = X0 ),
inference(cnf_transformation,[],[f28]) ).
tff(f28,plain,
! [X0: $int,X1: 'Tree',X2: 'Tree'] : ( 'val:(Tree)>Int'('node:(Int*Tree*Tree)>Tree'(X0,X1,X2)) = X0 ),
inference(rectify,[],[f2]) ).
tff(f2,axiom,
! [X1: $int,X2: 'Tree',X3: 'Tree'] : ( 'val:(Tree)>Int'('node:(Int*Tree*Tree)>Tree'(X1,X2,X3)) = X1 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',formula_001) ).
tff(f186,plain,
! [X2: $int,X3: 'Tree',X0: $int,X1: 'Tree'] :
( ~ in(X0,X1)
| sP3(X0,'node:(Int*Tree*Tree)>Tree'(X2,X1,X3))
| ~ $less(X0,'val:(Tree)>Int'('node:(Int*Tree*Tree)>Tree'(X2,X1,X3))) ),
inference(resolution,[],[f140,f40]) ).
tff(f40,plain,
! [X0: 'Tree',X1: $int] :
( sP4(X1,X0)
| ~ $less(X1,'val:(Tree)>Int'(X0)) ),
inference(cnf_transformation,[],[f30]) ).
tff(f140,plain,
! [X2: 'Tree',X3: $int,X0: $int,X1: 'Tree'] :
( ~ sP4(X3,'node:(Int*Tree*Tree)>Tree'(X0,X1,X2))
| ~ in(X3,X1)
| sP3(X3,'node:(Int*Tree*Tree)>Tree'(X0,X1,X2)) ),
inference(superposition,[],[f80,f67]) ).
tff(f67,plain,
! [X2: 'Tree',X0: $int,X1: 'Tree'] : ( 'left:(Tree)>Tree'('node:(Int*Tree*Tree)>Tree'(X0,X1,X2)) = X1 ),
inference(cnf_transformation,[],[f26]) ).
tff(f26,plain,
! [X0: $int,X1: 'Tree',X2: 'Tree'] : ( 'left:(Tree)>Tree'('node:(Int*Tree*Tree)>Tree'(X0,X1,X2)) = X1 ),
inference(rectify,[],[f3]) ).
tff(f3,axiom,
! [X1: $int,X2: 'Tree',X3: 'Tree'] : ( 'left:(Tree)>Tree'('node:(Int*Tree*Tree)>Tree'(X1,X2,X3)) = X2 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',formula_002) ).
tff(f80,plain,
! [X0: 'Tree',X1: $int] :
( ~ in(X1,'left:(Tree)>Tree'(X0))
| ~ sP4(X1,X0)
| sP3(X1,X0) ),
inference(equality_resolution,[],[f39]) ).
tff(f39,plain,
! [X3: 'Tree',X0: 'Tree',X1: $int] :
( ( 'left:(Tree)>Tree'(X0) != X3 )
| ~ in(X1,X3)
| ~ sP4(X1,X0)
| sP3(X1,X0) ),
inference(cnf_transformation,[],[f30]) ).
tff(f715,plain,
( in(sK1,'left:(Tree)>Tree'(sK0))
| ( 'empty:Tree' = sK0 )
| ~ sP11(sK0,sK1)
| spl12_3
| spl12_4
| spl12_5 ),
inference(subsumption_resolution,[],[f711,f446]) ).
tff(f711,plain,
( ( sK1 = 'val:(Tree)>Int'(sK0) )
| in(sK1,'left:(Tree)>Tree'(sK0))
| ( 'empty:Tree' = sK0 )
| ~ sP11(sK0,sK1)
| spl12_3
| spl12_4 ),
inference(resolution,[],[f652,f72]) ).
tff(f72,plain,
! [X0: $int,X1: 'Tree'] :
( in(X0,'right:(Tree)>Tree'(X1))
| ( 'val:(Tree)>Int'(X1) = X0 )
| in(X0,'left:(Tree)>Tree'(X1))
| ( 'empty:Tree' = X1 )
| ~ sP11(X1,X0) ),
inference(cnf_transformation,[],[f33]) ).
tff(f652,plain,
( ~ in(sK1,'right:(Tree)>Tree'(sK0))
| spl12_3
| spl12_4 ),
inference(unit_resulting_resolution,[],[f509,f443,f56]) ).
tff(f56,plain,
! [X0: 'Tree',X1: $int] :
( ~ in(X1,'right:(Tree)>Tree'(X0))
| $less('val:(Tree)>Int'(X0),X1)
| ~ sP10(X1,X0) ),
inference(cnf_transformation,[],[f31]) ).
tff(f31,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 ) )
& ( $true
| ( 'empty:Tree' != X0 ) ) ) ),
inference(ennf_transformation,[],[f25]) ).
tff(f25,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/benchmark/theBenchmark.p',formula_006) ).
tff(f443,plain,
( ~ $less('val:(Tree)>Int'(sK0),sK1)
| spl12_4 ),
inference(avatar_component_clause,[],[f441]) ).
tff(f441,plain,
( spl12_4
<=> $less('val:(Tree)>Int'(sK0),sK1) ),
introduced(avatar_definition,[new_symbols(naming,[spl12_4])]) ).
tff(f509,plain,
( ! [X0: $int] : sP10(X0,sK0)
| spl12_3 ),
inference(unit_resulting_resolution,[],[f101,f97,f62]) ).
tff(f62,plain,
! [X0: 'Tree',X1: $int] :
( sP10(X1,X0)
| ( 'empty:Tree' = X0 )
| ~ sP7(X0) ),
inference(cnf_transformation,[],[f31]) ).
tff(f101,plain,
sP7(sK0),
inference(unit_resulting_resolution,[],[f51,f66]) ).
tff(f66,plain,
! [X0: 'Tree'] :
( sP7(X0)
| ~ searchtree(X0) ),
inference(cnf_transformation,[],[f31]) ).
tff(f51,plain,
searchtree(sK0),
inference(cnf_transformation,[],[f30]) ).
tff(f631,plain,
( spl12_13
| ~ spl12_9
| spl12_5
| ~ spl12_12 ),
inference(avatar_split_clause,[],[f626,f566,f445,f468,f628]) ).
tff(f626,plain,
( ~ $less(sK1,'val:(Tree)>Int'(sK0))
| ( 'left:(Tree)>Tree'(sK0) = sK5(sK0,sK1) )
| spl12_5
| ~ spl12_12 ),
inference(subsumption_resolution,[],[f580,f446]) ).
tff(f580,plain,
( ~ $less(sK1,'val:(Tree)>Int'(sK0))
| ( 'left:(Tree)>Tree'(sK0) = sK5(sK0,sK1) )
| ( sK1 = 'val:(Tree)>Int'(sK0) )
| ~ spl12_12 ),
inference(resolution,[],[f568,f37]) ).
tff(f37,plain,
! [X0: 'Tree',X1: $int] :
( ~ sP3(X1,X0)
| ~ $less(X1,'val:(Tree)>Int'(X0))
| ( 'left:(Tree)>Tree'(X0) = sK5(X0,X1) )
| ( 'val:(Tree)>Int'(X0) = X1 ) ),
inference(cnf_transformation,[],[f30]) ).
tff(f625,plain,
( spl12_6
| spl12_5
| ~ spl12_12 ),
inference(avatar_split_clause,[],[f586,f566,f445,f449]) ).
tff(f449,plain,
( spl12_6
<=> sP4(sK1,sK0) ),
introduced(avatar_definition,[new_symbols(naming,[spl12_6])]) ).
tff(f586,plain,
( sP4(sK1,sK0)
| spl12_5
| ~ spl12_12 ),
inference(unit_resulting_resolution,[],[f568,f446,f42]) ).
tff(f42,plain,
! [X0: 'Tree',X1: $int] :
( sP4(X1,X0)
| ( 'val:(Tree)>Int'(X0) = X1 )
| ~ sP3(X1,X0) ),
inference(cnf_transformation,[],[f30]) ).
tff(f624,plain,
( spl12_1
| ~ spl12_12 ),
inference(avatar_split_clause,[],[f578,f566,f87]) ).
tff(f578,plain,
( sP2(sK1,sK0)
| ~ spl12_12 ),
inference(unit_resulting_resolution,[],[f568,f44]) ).
tff(f44,plain,
! [X0: 'Tree',X1: $int] :
( ~ sP3(X1,X0)
| sP2(X1,X0) ),
inference(cnf_transformation,[],[f30]) ).
tff(f619,plain,
( spl12_2
| spl12_3
| ~ spl12_6
| spl12_9
| ~ spl12_11 ),
inference(avatar_contradiction_clause,[],[f618]) ).
tff(f618,plain,
( $false
| spl12_2
| spl12_3
| ~ spl12_6
| spl12_9
| ~ spl12_11 ),
inference(subsumption_resolution,[],[f617,f575]) ).
tff(f575,plain,
( ~ in(sK1,'right:(Tree)>Tree'(sK0))
| spl12_2
| spl12_3 ),
inference(unit_resulting_resolution,[],[f573,f71]) ).
tff(f71,plain,
! [X0: $int,X1: 'Tree'] :
( ~ in(X0,'right:(Tree)>Tree'(X1))
| sP11(X1,X0) ),
inference(cnf_transformation,[],[f33]) ).
tff(f573,plain,
( ~ sP11(sK0,sK1)
| spl12_2
| spl12_3 ),
inference(unit_resulting_resolution,[],[f97,f92,f74]) ).
tff(f617,plain,
( in(sK1,'right:(Tree)>Tree'(sK0))
| ~ spl12_6
| spl12_9
| ~ spl12_11 ),
inference(forward_demodulation,[],[f610,f539]) ).
tff(f539,plain,
( ( 'right:(Tree)>Tree'(sK0) = sK6(sK0,sK1) )
| ~ spl12_11 ),
inference(avatar_component_clause,[],[f537]) ).
tff(f537,plain,
( spl12_11
<=> ( 'right:(Tree)>Tree'(sK0) = sK6(sK0,sK1) ) ),
introduced(avatar_definition,[new_symbols(naming,[spl12_11])]) ).
tff(f610,plain,
( in(sK1,sK6(sK0,sK1))
| ~ spl12_6
| spl12_9 ),
inference(unit_resulting_resolution,[],[f451,f469,f35]) ).
tff(f35,plain,
! [X0: 'Tree',X1: $int] :
( in(X1,sK6(X0,X1))
| $less(X1,'val:(Tree)>Int'(X0))
| ~ sP4(X1,X0) ),
inference(cnf_transformation,[],[f30]) ).
tff(f469,plain,
( ~ $less(sK1,'val:(Tree)>Int'(sK0))
| spl12_9 ),
inference(avatar_component_clause,[],[f468]) ).
tff(f451,plain,
( sP4(sK1,sK0)
| ~ spl12_6 ),
inference(avatar_component_clause,[],[f449]) ).
tff(f571,plain,
( ~ spl12_9
| ~ spl12_4 ),
inference(avatar_split_clause,[],[f553,f441,f468]) ).
tff(f553,plain,
( ~ $less(sK1,'val:(Tree)>Int'(sK0))
| ~ spl12_4 ),
inference(unit_resulting_resolution,[],[f16,f442,f17]) ).
tff(f17,plain,
! [X2: $int,X0: $int,X1: $int] :
( ~ $less(X1,X2)
| ~ $less(X0,X1)
| $less(X0,X2) ),
introduced(theory_axiom_143,[]) ).
tff(f442,plain,
( $less('val:(Tree)>Int'(sK0),sK1)
| ~ spl12_4 ),
inference(avatar_component_clause,[],[f441]) ).
tff(f16,plain,
! [X0: $int] : ~ $less(X0,X0),
introduced(theory_axiom_142,[]) ).
tff(f569,plain,
( spl12_12
| spl12_9
| ~ spl12_6 ),
inference(avatar_split_clause,[],[f534,f449,f468,f566]) ).
tff(f534,plain,
( $less(sK1,'val:(Tree)>Int'(sK0))
| sP3(sK1,sK0)
| ~ spl12_6 ),
inference(resolution,[],[f451,f41]) ).
tff(f41,plain,
! [X0: 'Tree',X1: $int] :
( ~ sP4(X1,X0)
| $less(X1,'val:(Tree)>Int'(X0))
| sP3(X1,X0) ),
inference(cnf_transformation,[],[f30]) ).
tff(f540,plain,
( spl12_9
| spl12_11
| ~ spl12_6 ),
inference(avatar_split_clause,[],[f533,f449,f537,f468]) ).
tff(f533,plain,
( ( 'right:(Tree)>Tree'(sK0) = sK6(sK0,sK1) )
| $less(sK1,'val:(Tree)>Int'(sK0))
| ~ spl12_6 ),
inference(resolution,[],[f451,f34]) ).
tff(f34,plain,
! [X0: 'Tree',X1: $int] :
( ~ sP4(X1,X0)
| ( 'right:(Tree)>Tree'(X0) = sK6(X0,X1) )
| $less(X1,'val:(Tree)>Int'(X0)) ),
inference(cnf_transformation,[],[f30]) ).
tff(f503,plain,
( ~ spl12_2
| ~ spl12_3 ),
inference(avatar_contradiction_clause,[],[f502]) ).
tff(f502,plain,
( $false
| ~ spl12_2
| ~ spl12_3 ),
inference(subsumption_resolution,[],[f489,f83]) ).
tff(f83,plain,
! [X0: $int] : ~ in(X0,'empty:Tree'),
inference(equality_resolution,[],[f73]) ).
tff(f73,plain,
! [X0: $int,X1: 'Tree'] :
( ( 'empty:Tree' != X1 )
| ~ in(X0,X1) ),
inference(cnf_transformation,[],[f33]) ).
tff(f489,plain,
( in(sK1,'empty:Tree')
| ~ spl12_2
| ~ spl12_3 ),
inference(superposition,[],[f93,f98]) ).
tff(f98,plain,
( ( 'empty:Tree' = sK0 )
| ~ spl12_3 ),
inference(avatar_component_clause,[],[f96]) ).
tff(f486,plain,
( spl12_1
| ~ spl12_5 ),
inference(avatar_split_clause,[],[f473,f445,f87]) ).
tff(f473,plain,
( sP2(sK1,sK0)
| ~ spl12_5 ),
inference(superposition,[],[f109,f447]) ).
tff(f109,plain,
! [X0: 'Tree'] : sP2('val:(Tree)>Int'(X0),X0),
inference(unit_resulting_resolution,[],[f79,f44]) ).
tff(f79,plain,
! [X0: 'Tree'] : sP3('val:(Tree)>Int'(X0),X0),
inference(equality_resolution,[],[f43]) ).
tff(f43,plain,
! [X0: 'Tree',X1: $int] :
( ( 'val:(Tree)>Int'(X0) != X1 )
| sP3(X1,X0) ),
inference(cnf_transformation,[],[f30]) ).
tff(f472,plain,
( spl12_5
| spl12_9
| spl12_4 ),
inference(avatar_split_clause,[],[f457,f441,f468,f445]) ).
tff(f457,plain,
( $less(sK1,'val:(Tree)>Int'(sK0))
| ( sK1 = 'val:(Tree)>Int'(sK0) )
| spl12_4 ),
inference(resolution,[],[f443,f18]) ).
tff(f18,plain,
! [X0: $int,X1: $int] :
( $less(X0,X1)
| $less(X1,X0)
| ( X0 = X1 ) ),
introduced(theory_axiom_144,[]) ).
tff(f452,plain,
( ~ spl12_4
| spl12_5
| spl12_3
| spl12_6
| ~ spl12_2 ),
inference(avatar_split_clause,[],[f439,f91,f449,f96,f445,f441]) ).
tff(f439,plain,
( sP4(sK1,sK0)
| ( 'empty:Tree' = sK0 )
| ( sK1 = 'val:(Tree)>Int'(sK0) )
| ~ $less('val:(Tree)>Int'(sK0),sK1)
| ~ spl12_2 ),
inference(subsumption_resolution,[],[f438,f101]) ).
tff(f438,plain,
( sP4(sK1,sK0)
| ( 'empty:Tree' = sK0 )
| ( sK1 = 'val:(Tree)>Int'(sK0) )
| ~ $less('val:(Tree)>Int'(sK0),sK1)
| ~ sP7(sK0)
| ~ spl12_2 ),
inference(resolution,[],[f252,f105]) ).
tff(f105,plain,
( sP11(sK0,sK1)
| ~ spl12_2 ),
inference(unit_resulting_resolution,[],[f93,f75]) ).
tff(f252,plain,
! [X0: 'Tree',X1: $int] :
( ~ sP11(X0,X1)
| sP4(X1,X0)
| ( 'empty:Tree' = X0 )
| ( 'val:(Tree)>Int'(X0) = X1 )
| ~ $less('val:(Tree)>Int'(X0),X1)
| ~ sP7(X0) ),
inference(duplicate_literal_removal,[],[f249]) ).
tff(f249,plain,
! [X0: 'Tree',X1: $int] :
( ( 'val:(Tree)>Int'(X0) = X1 )
| sP4(X1,X0)
| ( 'empty:Tree' = X0 )
| ~ sP11(X0,X1)
| ( 'empty:Tree' = X0 )
| ~ $less('val:(Tree)>Int'(X0),X1)
| ~ sP7(X0) ),
inference(resolution,[],[f116,f59]) ).
tff(f59,plain,
! [X2: $int,X0: 'Tree'] :
( ~ in(X2,'left:(Tree)>Tree'(X0))
| ( 'empty:Tree' = X0 )
| ~ $less('val:(Tree)>Int'(X0),X2)
| ~ sP7(X0) ),
inference(cnf_transformation,[],[f31]) ).
tff(f116,plain,
! [X0: $int,X1: 'Tree'] :
( in(X0,'left:(Tree)>Tree'(X1))
| ( 'val:(Tree)>Int'(X1) = X0 )
| sP4(X0,X1)
| ( 'empty:Tree' = X1 )
| ~ sP11(X1,X0) ),
inference(resolution,[],[f81,f72]) ).
tff(f81,plain,
! [X0: 'Tree',X1: $int] :
( ~ in(X1,'right:(Tree)>Tree'(X0))
| sP4(X1,X0) ),
inference(equality_resolution,[],[f36]) ).
tff(f36,plain,
! [X2: 'Tree',X0: 'Tree',X1: $int] :
( ( 'right:(Tree)>Tree'(X0) != X2 )
| ~ in(X1,X2)
| sP4(X1,X0) ),
inference(cnf_transformation,[],[f30]) ).
tff(f100,plain,
( ~ spl12_3
| spl12_2 ),
inference(avatar_split_clause,[],[f48,f91,f96]) ).
tff(f48,plain,
( in(sK1,sK0)
| ( 'empty:Tree' != sK0 ) ),
inference(cnf_transformation,[],[f30]) ).
tff(f99,plain,
( ~ spl12_1
| spl12_3
| ~ spl12_2 ),
inference(avatar_split_clause,[],[f49,f91,f96,f87]) ).
tff(f49,plain,
( ~ in(sK1,sK0)
| ( 'empty:Tree' = sK0 )
| ~ sP2(sK1,sK0) ),
inference(cnf_transformation,[],[f30]) ).
tff(f94,plain,
( spl12_1
| spl12_2 ),
inference(avatar_split_clause,[],[f50,f91,f87]) ).
tff(f50,plain,
( in(sK1,sK0)
| sP2(sK1,sK0) ),
inference(cnf_transformation,[],[f30]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.05/0.11 % Problem : SWW678_1 : TPTP v8.2.0. Released v6.4.0.
% 0.05/0.13 % 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.11/0.33 % Computer : n003.cluster.edu
% 0.11/0.33 % Model : x86_64 x86_64
% 0.11/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.33 % Memory : 8042.1875MB
% 0.11/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.33 % CPULimit : 300
% 0.11/0.33 % WCLimit : 300
% 0.11/0.33 % DateTime : Sat May 18 19:30:22 EDT 2024
% 0.11/0.33 % CPUTime :
% 0.11/0.33 This is a TF0_THM_EQU_ARI problem
% 0.11/0.33 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/benchmark/theBenchmark.p
% 0.58/0.81 % (697)ott+1011_1:1_sil=2000:urr=on:i=33:sd=1:kws=inv_frequency:ss=axioms:sup=off_0 on theBenchmark for (2995ds/33Mi)
% 0.58/0.81 % (696)lrs+1011_1:1_sil=8000:sp=occurrence:nwc=10.0:i=78:ss=axioms:sgt=8_0 on theBenchmark for (2995ds/78Mi)
% 0.58/0.81 % (694)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 theBenchmark for (2995ds/34Mi)
% 0.58/0.81 % (695)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 theBenchmark for (2995ds/51Mi)
% 0.58/0.81 % (698)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 theBenchmark for (2995ds/34Mi)
% 0.58/0.81 % (699)lrs+1002_1:16_to=lpo:sil=32000:sp=unary_frequency:sos=on:i=45:bd=off:ss=axioms_0 on theBenchmark for (2995ds/45Mi)
% 0.58/0.81 % (700)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 theBenchmark for (2995ds/83Mi)
% 0.58/0.81 % (701)lrs-21_1:1_to=lpo:sil=2000:sp=frequency:sos=on:lma=on:i=56:sd=2:ss=axioms:ep=R_0 on theBenchmark for (2995ds/56Mi)
% 0.58/0.81 % (701)Refutation not found, incomplete strategy% (701)------------------------------
% 0.58/0.81 % (701)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.58/0.81 % (698)Refutation not found, incomplete strategy% (698)------------------------------
% 0.58/0.81 % (698)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.58/0.81 % (699)Refutation not found, incomplete strategy% (699)------------------------------
% 0.58/0.81 % (699)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.58/0.81 % (698)Termination reason: Refutation not found, incomplete strategy
% 0.58/0.81
% 0.58/0.81 % (698)Memory used [KB]: 1040
% 0.58/0.81 % (699)Termination reason: Refutation not found, incomplete strategy
% 0.58/0.81
% 0.58/0.81 % (698)Time elapsed: 0.004 s
% 0.58/0.81 % (699)Memory used [KB]: 1035
% 0.58/0.81 % (699)Time elapsed: 0.004 s
% 0.58/0.81 % (698)Instructions burned: 5 (million)
% 0.58/0.81 % (699)Instructions burned: 4 (million)
% 0.58/0.81 % (701)Termination reason: Refutation not found, incomplete strategy
% 0.58/0.81
% 0.58/0.81 % (701)Memory used [KB]: 1038
% 0.58/0.81 % (701)Time elapsed: 0.004 s
% 0.58/0.81 % (701)Instructions burned: 4 (million)
% 0.58/0.81 % (699)------------------------------
% 0.58/0.81 % (699)------------------------------
% 0.58/0.81 % (701)------------------------------
% 0.58/0.81 % (701)------------------------------
% 0.58/0.81 % (698)------------------------------
% 0.58/0.81 % (698)------------------------------
% 0.58/0.81 % (697)Refutation not found, incomplete strategy% (697)------------------------------
% 0.58/0.81 % (697)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.58/0.81 % (697)Termination reason: Refutation not found, incomplete strategy
% 0.58/0.81
% 0.58/0.81 % (697)Memory used [KB]: 1055
% 0.58/0.81 % (697)Time elapsed: 0.005 s
% 0.58/0.81 % (697)Instructions burned: 6 (million)
% 0.58/0.81 % (697)------------------------------
% 0.58/0.81 % (697)------------------------------
% 0.58/0.81 % (702)lrs+21_1:16_sil=2000:sp=occurrence:urr=on:flr=on:i=55:sd=1:nm=0:ins=3:ss=included:rawr=on:br=off_0 on theBenchmark for (2995ds/55Mi)
% 0.65/0.81 % (703)dis+3_25:4_sil=16000:sos=all:erd=off:i=50:s2at=4.0:bd=off:nm=60:sup=off:cond=on:av=off:ins=2:nwc=10.0:etr=on:to=lpo:s2agt=20:fd=off:bsr=unit_only:slsq=on:slsqr=28,19:awrs=converge:awrsf=500:tgt=ground:bs=unit_only_0 on theBenchmark for (2995ds/50Mi)
% 0.65/0.81 % (704)lrs+1010_1:2_sil=4000:tgt=ground:nwc=10.0:st=2.0:i=208:sd=1:bd=off:ss=axioms_0 on theBenchmark for (2995ds/208Mi)
% 0.65/0.82 % (705)lrs-1011_1:1_sil=4000:plsq=on:plsqr=32,1:sp=frequency:plsql=on:nwc=10.0:i=52:aac=none:afr=on:ss=axioms:er=filter:sgt=16:rawr=on:etr=on:lma=on_0 on theBenchmark for (2995ds/52Mi)
% 0.65/0.83 % (694)Instruction limit reached!
% 0.65/0.83 % (694)------------------------------
% 0.65/0.83 % (694)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.65/0.83 % (694)Termination reason: Unknown
% 0.65/0.83 % (694)Termination phase: Saturation
% 0.65/0.83
% 0.65/0.83 % (694)Memory used [KB]: 1165
% 0.65/0.83 % (694)Time elapsed: 0.019 s
% 0.65/0.83 % (694)Instructions burned: 35 (million)
% 0.65/0.83 % (694)------------------------------
% 0.65/0.83 % (694)------------------------------
% 0.65/0.83 % (706)lrs-1010_1:1_to=lpo:sil=2000:sp=reverse_arity:sos=on:urr=ec_only:i=518:sd=2:bd=off:ss=axioms:sgt=16_0 on theBenchmark for (2995ds/518Mi)
% 0.65/0.83 % (706)Refutation not found, incomplete strategy% (706)------------------------------
% 0.65/0.83 % (706)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.65/0.83 % (706)Termination reason: Refutation not found, incomplete strategy
% 0.65/0.83
% 0.65/0.83 % (706)Memory used [KB]: 1036
% 0.65/0.83 % (706)Time elapsed: 0.004 s
% 0.65/0.83 % (706)Instructions burned: 5 (million)
% 0.65/0.83 % (706)------------------------------
% 0.65/0.83 % (706)------------------------------
% 0.65/0.83 % (700)First to succeed.
% 0.65/0.83 % (700)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-687"
% 0.65/0.83 % (707)lrs+1011_87677:1048576_sil=8000:sos=on:spb=non_intro:nwc=10.0:kmz=on:i=42:ep=RS:nm=0:ins=1:uhcvi=on:rawr=on:fde=unused:afp=2000:afq=1.444:plsq=on:nicw=on_0 on theBenchmark for (2995ds/42Mi)
% 0.65/0.84 % (700)Refutation found. Thanks to Tanya!
% 0.65/0.84 % SZS status Theorem for theBenchmark
% 0.65/0.84 % SZS output start Proof for theBenchmark
% See solution above
% 0.65/0.84 % (700)------------------------------
% 0.65/0.84 % (700)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.65/0.84 % (700)Termination reason: Refutation
% 0.65/0.84
% 0.65/0.84 % (700)Memory used [KB]: 1250
% 0.65/0.84 % (700)Time elapsed: 0.027 s
% 0.65/0.84 % (700)Instructions burned: 47 (million)
% 0.65/0.84 % (687)Success in time 0.496 s
% 0.65/0.84 % Vampire---4.8 exiting
%------------------------------------------------------------------------------