TSTP Solution File: SWW581_2 by SnakeForV-SAT---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV-SAT---1.0
% Problem : SWW581_2 : TPTP v8.1.0. Released v6.1.0.
% Transfm : none
% Format : tptp:raw
% Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_sat --cores 0 -t %d %s
% Computer : n019.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 : Wed Aug 31 19:19:59 EDT 2022
% Result : Theorem 0.16s 0.53s
% Output : Refutation 0.16s
% Verified :
% SZS Type : Refutation
% Derivation depth : 16
% Number of leaves : 42
% Syntax : Number of formulae : 101 ( 23 unt; 25 typ; 0 def)
% Number of atoms : 292 ( 86 equ)
% Maximal formula atoms : 26 ( 3 avg)
% Number of connectives : 336 ( 120 ~; 66 |; 114 &)
% ( 5 <=>; 31 =>; 0 <=; 0 <~>)
% Maximal formula depth : 20 ( 5 avg)
% Maximal term depth : 5 ( 1 avg)
% Number arithmetic : 496 ( 163 atm; 110 fun; 133 num; 90 var)
% Number of types : 6 ( 4 usr; 1 ari)
% Number of type conns : 13 ( 7 >; 6 *; 0 +; 0 <<)
% Number of predicates : 10 ( 6 usr; 6 prp; 0-2 aty)
% Number of functors : 27 ( 20 usr; 17 con; 0-4 aty)
% Number of variables : 90 ( 48 !; 42 ?; 90 :)
% Comments :
%------------------------------------------------------------------------------
tff(type_def_5,type,
uni: $tType ).
tff(type_def_6,type,
ty: $tType ).
tff(type_def_7,type,
bool: $tType ).
tff(type_def_8,type,
tuple0: $tType ).
tff(func_def_0,type,
witness: ty > uni ).
tff(func_def_1,type,
int: ty ).
tff(func_def_2,type,
real: ty ).
tff(func_def_3,type,
bool1: ty ).
tff(func_def_4,type,
true: bool ).
tff(func_def_5,type,
false: bool ).
tff(func_def_6,type,
match_bool: ( ty * bool * uni * uni ) > uni ).
tff(func_def_7,type,
tuple01: ty ).
tff(func_def_8,type,
tuple02: tuple0 ).
tff(func_def_9,type,
qtmark: ty ).
tff(func_def_12,type,
fact: $int > $int ).
tff(func_def_15,type,
ref: ty > ty ).
tff(func_def_16,type,
mk_ref: ( ty * uni ) > uni ).
tff(func_def_17,type,
contents: ( ty * uni ) > uni ).
tff(func_def_20,type,
sK0: $int ).
tff(func_def_21,type,
sK1: $int ).
tff(func_def_22,type,
sK2: $int ).
tff(func_def_23,type,
sK3: $int ).
tff(func_def_24,type,
sK4: $int ).
tff(func_def_25,type,
sK5: $int ).
tff(pred_def_1,type,
sort: ( ty * uni ) > $o ).
tff(f719,plain,
$false,
inference(avatar_sat_refutation,[],[f110,f509,f584,f675,f676,f714]) ).
tff(f714,plain,
~ spl6_1,
inference(avatar_contradiction_clause,[],[f713]) ).
tff(f713,plain,
( $false
| ~ spl6_1 ),
inference(subsumption_resolution,[],[f712,f465]) ).
tff(f465,plain,
~ $less(sK0,$sum(1,sK1)),
inference(forward_demodulation,[],[f453,f20]) ).
tff(f20,plain,
! [X0: $int,X1: $int] : ( $sum(X1,X0) = $sum(X0,X1) ),
introduced(theory_axiom_140,[]) ).
tff(f453,plain,
~ $less(sK0,$sum(sK1,1)),
inference(resolution,[],[f359,f37]) ).
tff(f37,plain,
! [X0: $int,X1: $int] :
( ~ $less(X1,$sum(X0,1))
| ~ $less(X0,X1) ),
introduced(theory_axiom_166,[]) ).
tff(f359,plain,
! [X0: $int] : $less($sum(sK1,X0),$sum(sK0,X0)),
inference(resolution,[],[f81,f28]) ).
tff(f28,plain,
! [X2: $int,X0: $int,X1: $int] :
( ~ $less(X0,X1)
| $less($sum(X0,X2),$sum(X1,X2)) ),
introduced(theory_axiom_150,[]) ).
tff(f81,plain,
$less(sK1,sK0),
inference(cnf_transformation,[],[f63]) ).
tff(f63,plain,
( $less(sK1,sK0)
& ~ $less(sK0,sK1)
& ~ $less($sum(sK1,1),sK4)
& ~ $less(sK4,1)
& ( $product(sK4,fact(sK1)) = sK3 )
& $less(sK1,sK4)
& ( $sum(sK1,1) = sK5 )
& ( $less(sK0,sK5)
| ( fact(sK5) != sK3 )
| $less(sK5,0) )
& ( fact(sK1) = sK2 )
& ~ $less(sK1,0)
& ~ $less(sK0,0) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3,sK4,sK5])],[f58,f62,f61,f60,f59]) ).
tff(f59,plain,
( ? [X0: $int] :
( ? [X1: $int,X2: $int] :
( $less(X1,X0)
& ~ $less(X0,X1)
& ? [X3: $int,X4: $int] :
( ~ $less($sum(X1,1),X4)
& ~ $less(X4,1)
& ( $product(X4,fact(X1)) = X3 )
& $less(X1,X4)
& ? [X5: $int] :
( ( $sum(X1,1) = X5 )
& ( $less(X0,X5)
| ( fact(X5) != X3 )
| $less(X5,0) ) ) )
& ( fact(X1) = X2 )
& ~ $less(X1,0) )
& ~ $less(X0,0) )
=> ( ? [X2: $int,X1: $int] :
( $less(X1,sK0)
& ~ $less(sK0,X1)
& ? [X4: $int,X3: $int] :
( ~ $less($sum(X1,1),X4)
& ~ $less(X4,1)
& ( $product(X4,fact(X1)) = X3 )
& $less(X1,X4)
& ? [X5: $int] :
( ( $sum(X1,1) = X5 )
& ( $less(sK0,X5)
| ( fact(X5) != X3 )
| $less(X5,0) ) ) )
& ( fact(X1) = X2 )
& ~ $less(X1,0) )
& ~ $less(sK0,0) ) ),
introduced(choice_axiom,[]) ).
tff(f60,plain,
( ? [X2: $int,X1: $int] :
( $less(X1,sK0)
& ~ $less(sK0,X1)
& ? [X4: $int,X3: $int] :
( ~ $less($sum(X1,1),X4)
& ~ $less(X4,1)
& ( $product(X4,fact(X1)) = X3 )
& $less(X1,X4)
& ? [X5: $int] :
( ( $sum(X1,1) = X5 )
& ( $less(sK0,X5)
| ( fact(X5) != X3 )
| $less(X5,0) ) ) )
& ( fact(X1) = X2 )
& ~ $less(X1,0) )
=> ( $less(sK1,sK0)
& ~ $less(sK0,sK1)
& ? [X4: $int,X3: $int] :
( ~ $less($sum(sK1,1),X4)
& ~ $less(X4,1)
& ( $product(X4,fact(sK1)) = X3 )
& $less(sK1,X4)
& ? [X5: $int] :
( ( $sum(sK1,1) = X5 )
& ( $less(sK0,X5)
| ( fact(X5) != X3 )
| $less(X5,0) ) ) )
& ( fact(sK1) = sK2 )
& ~ $less(sK1,0) ) ),
introduced(choice_axiom,[]) ).
tff(f61,plain,
( ? [X4: $int,X3: $int] :
( ~ $less($sum(sK1,1),X4)
& ~ $less(X4,1)
& ( $product(X4,fact(sK1)) = X3 )
& $less(sK1,X4)
& ? [X5: $int] :
( ( $sum(sK1,1) = X5 )
& ( $less(sK0,X5)
| ( fact(X5) != X3 )
| $less(X5,0) ) ) )
=> ( ~ $less($sum(sK1,1),sK4)
& ~ $less(sK4,1)
& ( $product(sK4,fact(sK1)) = sK3 )
& $less(sK1,sK4)
& ? [X5: $int] :
( ( $sum(sK1,1) = X5 )
& ( $less(sK0,X5)
| ( fact(X5) != sK3 )
| $less(X5,0) ) ) ) ),
introduced(choice_axiom,[]) ).
tff(f62,plain,
( ? [X5: $int] :
( ( $sum(sK1,1) = X5 )
& ( $less(sK0,X5)
| ( fact(X5) != sK3 )
| $less(X5,0) ) )
=> ( ( $sum(sK1,1) = sK5 )
& ( $less(sK0,sK5)
| ( fact(sK5) != sK3 )
| $less(sK5,0) ) ) ),
introduced(choice_axiom,[]) ).
tff(f58,plain,
? [X0: $int] :
( ? [X1: $int,X2: $int] :
( $less(X1,X0)
& ~ $less(X0,X1)
& ? [X3: $int,X4: $int] :
( ~ $less($sum(X1,1),X4)
& ~ $less(X4,1)
& ( $product(X4,fact(X1)) = X3 )
& $less(X1,X4)
& ? [X5: $int] :
( ( $sum(X1,1) = X5 )
& ( $less(X0,X5)
| ( fact(X5) != X3 )
| $less(X5,0) ) ) )
& ( fact(X1) = X2 )
& ~ $less(X1,0) )
& ~ $less(X0,0) ),
inference(rectify,[],[f57]) ).
tff(f57,plain,
? [X0: $int] :
( ? [X2: $int,X1: $int] :
( $less(X2,X0)
& ~ $less(X0,X2)
& ? [X3: $int,X4: $int] :
( ~ $less($sum(X2,1),X4)
& ~ $less(X4,1)
& ( $product(X4,fact(X2)) = X3 )
& $less(X2,X4)
& ? [X5: $int] :
( ( $sum(X2,1) = X5 )
& ( $less(X0,X5)
| ( fact(X5) != X3 )
| $less(X5,0) ) ) )
& ( fact(X2) = X1 )
& ~ $less(X2,0) )
& ~ $less(X0,0) ),
inference(flattening,[],[f56]) ).
tff(f56,plain,
? [X0: $int] :
( ? [X1: $int,X2: $int] :
( ? [X4: $int,X3: $int] :
( ? [X5: $int] :
( ( $sum(X2,1) = X5 )
& ( $less(X0,X5)
| ( fact(X5) != X3 )
| $less(X5,0) ) )
& $less(X2,X4)
& ( $product(X4,fact(X2)) = X3 )
& ~ $less(X4,1)
& ~ $less($sum(X2,1),X4) )
& $less(X2,X0)
& ~ $less(X0,X2)
& ~ $less(X2,0)
& ( fact(X2) = X1 ) )
& ~ $less(X0,0) ),
inference(ennf_transformation,[],[f46]) ).
tff(f46,plain,
~ ! [X0: $int] :
( ~ $less(X0,0)
=> ! [X1: $int,X2: $int] :
( ( ~ $less(X0,X2)
& ~ $less(X2,0)
& ( fact(X2) = X1 ) )
=> ( $less(X2,X0)
=> ! [X4: $int,X3: $int] :
( ( ( $product(X4,fact(X2)) = X3 )
& ~ $less(X4,1)
& ~ $less($sum(X2,1),X4) )
=> ( $less(X2,X4)
=> ! [X5: $int] :
( ( $sum(X2,1) = X5 )
=> ( ( fact(X5) = X3 )
& ~ $less(X0,X5)
& ~ $less(X5,0) ) ) ) ) ) ) ),
inference(rectify,[],[f19]) ).
tff(f19,plain,
~ ! [X8: $int] :
( ~ $less(X8,0)
=> ! [X6: $int,X9: $int] :
( ( ~ $less(X8,X9)
& ( fact(X9) = X6 )
& ~ $less(X9,0) )
=> ( $less(X9,X8)
=> ! [X11: $int,X10: $int] :
( ( ( $product(X10,fact(X9)) = X11 )
& ~ $less($sum(X9,1),X10)
& ~ $less(X10,1) )
=> ( $less(X9,X10)
=> ! [X12: $int] :
( ( $sum(X9,1) = X12 )
=> ( ~ $less(X12,0)
& ~ $less(X8,X12)
& ( fact(X12) = X11 ) ) ) ) ) ) ) ),
inference(theory_normalization,[],[f16]) ).
tff(f16,negated_conjecture,
~ ! [X8: $int] :
( $lesseq(0,X8)
=> ! [X6: $int,X9: $int] :
( ( $lesseq(X9,X8)
& ( fact(X9) = X6 )
& $lesseq(0,X9) )
=> ( $less(X9,X8)
=> ! [X11: $int,X10: $int] :
( ( ( $product(X10,fact(X9)) = X11 )
& $lesseq(X10,$sum(X9,1))
& $lesseq(1,X10) )
=> ( ~ $lesseq(X10,X9)
=> ! [X12: $int] :
( ( $sum(X9,1) = X12 )
=> ( $lesseq(0,X12)
& $lesseq(X12,X8)
& ( fact(X12) = X11 ) ) ) ) ) ) ) ),
inference(negated_conjecture,[],[f15]) ).
tff(f15,conjecture,
! [X8: $int] :
( $lesseq(0,X8)
=> ! [X6: $int,X9: $int] :
( ( $lesseq(X9,X8)
& ( fact(X9) = X6 )
& $lesseq(0,X9) )
=> ( $less(X9,X8)
=> ! [X11: $int,X10: $int] :
( ( ( $product(X10,fact(X9)) = X11 )
& $lesseq(X10,$sum(X9,1))
& $lesseq(1,X10) )
=> ( ~ $lesseq(X10,X9)
=> ! [X12: $int] :
( ( $sum(X9,1) = X12 )
=> ( $lesseq(0,X12)
& $lesseq(X12,X8)
& ( fact(X12) = X11 ) ) ) ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',wP_parameter_routine) ).
tff(f712,plain,
( $less(sK0,$sum(1,sK1))
| ~ spl6_1 ),
inference(forward_demodulation,[],[f101,f113]) ).
tff(f113,plain,
$sum(1,sK1) = sK5,
inference(backward_demodulation,[],[f75,f20]) ).
tff(f75,plain,
$sum(sK1,1) = sK5,
inference(cnf_transformation,[],[f63]) ).
tff(f101,plain,
( $less(sK0,sK5)
| ~ spl6_1 ),
inference(avatar_component_clause,[],[f99]) ).
tff(f99,plain,
( spl6_1
<=> $less(sK0,sK5) ),
introduced(avatar_definition,[new_symbols(naming,[spl6_1])]) ).
tff(f676,plain,
~ spl6_8,
inference(avatar_split_clause,[],[f670,f188]) ).
tff(f188,plain,
( spl6_8
<=> $less(sK4,$sum(1,sK1)) ),
introduced(avatar_definition,[new_symbols(naming,[spl6_8])]) ).
tff(f670,plain,
~ $less(sK4,$sum(1,sK1)),
inference(forward_demodulation,[],[f659,f20]) ).
tff(f659,plain,
~ $less(sK4,$sum(sK1,1)),
inference(resolution,[],[f586,f37]) ).
tff(f586,plain,
! [X0: $int] : $less($sum(sK1,X0),$sum(sK4,X0)),
inference(resolution,[],[f76,f28]) ).
tff(f76,plain,
$less(sK1,sK4),
inference(cnf_transformation,[],[f63]) ).
tff(f675,plain,
( spl6_9
| spl6_8 ),
inference(avatar_split_clause,[],[f637,f188,f192]) ).
tff(f192,plain,
( spl6_9
<=> ( sK4 = $sum(1,sK1) ) ),
introduced(avatar_definition,[new_symbols(naming,[spl6_9])]) ).
tff(f637,plain,
( $less(sK4,$sum(1,sK1))
| ( sK4 = $sum(1,sK1) ) ),
inference(resolution,[],[f114,f27]) ).
tff(f27,plain,
! [X0: $int,X1: $int] :
( $less(X0,X1)
| $less(X1,X0)
| ( X0 = X1 ) ),
introduced(theory_axiom_149,[]) ).
tff(f114,plain,
~ $less($sum(1,sK1),sK4),
inference(backward_demodulation,[],[f79,f20]) ).
tff(f79,plain,
~ $less($sum(sK1,1),sK4),
inference(cnf_transformation,[],[f63]) ).
tff(f584,plain,
( ~ spl6_3
| ~ spl6_9 ),
inference(avatar_contradiction_clause,[],[f583]) ).
tff(f583,plain,
( $false
| ~ spl6_3
| ~ spl6_9 ),
inference(subsumption_resolution,[],[f571,f72]) ).
tff(f72,plain,
~ $less(sK1,0),
inference(cnf_transformation,[],[f63]) ).
tff(f571,plain,
( $less(sK1,0)
| ~ spl6_3
| ~ spl6_9 ),
inference(resolution,[],[f490,f510]) ).
tff(f510,plain,
( $less($sum(1,sK1),0)
| ~ spl6_3 ),
inference(forward_demodulation,[],[f109,f113]) ).
tff(f109,plain,
( $less(sK5,0)
| ~ spl6_3 ),
inference(avatar_component_clause,[],[f107]) ).
tff(f107,plain,
( spl6_3
<=> $less(sK5,0) ),
introduced(avatar_definition,[new_symbols(naming,[spl6_3])]) ).
tff(f490,plain,
( ! [X0: $int] :
( ~ $less($sum(1,sK1),X0)
| $less(sK1,X0) )
| ~ spl6_9 ),
inference(backward_demodulation,[],[f146,f194]) ).
tff(f194,plain,
( ( sK4 = $sum(1,sK1) )
| ~ spl6_9 ),
inference(avatar_component_clause,[],[f192]) ).
tff(f146,plain,
! [X0: $int] :
( ~ $less(sK4,X0)
| $less(sK1,X0) ),
inference(resolution,[],[f26,f76]) ).
tff(f26,plain,
! [X2: $int,X0: $int,X1: $int] :
( ~ $less(X0,X1)
| ~ $less(X1,X2)
| $less(X0,X2) ),
introduced(theory_axiom_148,[]) ).
tff(f509,plain,
( spl6_2
| ~ spl6_9 ),
inference(avatar_contradiction_clause,[],[f508]) ).
tff(f508,plain,
( $false
| spl6_2
| ~ spl6_9 ),
inference(subsumption_resolution,[],[f507,f497]) ).
tff(f497,plain,
( ( $product($sum(1,sK1),sK2) != fact($sum(1,sK1)) )
| spl6_2
| ~ spl6_9 ),
inference(backward_demodulation,[],[f115,f496]) ).
tff(f496,plain,
( ( $product($sum(1,sK1),sK2) = sK3 )
| ~ spl6_9 ),
inference(forward_demodulation,[],[f486,f31]) ).
tff(f31,plain,
! [X0: $int,X1: $int] : ( $product(X0,X1) = $product(X1,X0) ),
introduced(theory_axiom_140,[]) ).
tff(f486,plain,
( ( $product(sK2,$sum(1,sK1)) = sK3 )
| ~ spl6_9 ),
inference(backward_demodulation,[],[f112,f194]) ).
tff(f112,plain,
$product(sK2,sK4) = sK3,
inference(backward_demodulation,[],[f111,f31]) ).
tff(f111,plain,
$product(sK4,sK2) = sK3,
inference(backward_demodulation,[],[f77,f73]) ).
tff(f73,plain,
fact(sK1) = sK2,
inference(cnf_transformation,[],[f63]) ).
tff(f77,plain,
$product(sK4,fact(sK1)) = sK3,
inference(cnf_transformation,[],[f63]) ).
tff(f115,plain,
( ( fact($sum(1,sK1)) != sK3 )
| spl6_2 ),
inference(forward_demodulation,[],[f105,f113]) ).
tff(f105,plain,
( ( fact(sK5) != sK3 )
| spl6_2 ),
inference(avatar_component_clause,[],[f103]) ).
tff(f103,plain,
( spl6_2
<=> ( fact(sK5) = sK3 ) ),
introduced(avatar_definition,[new_symbols(naming,[spl6_2])]) ).
tff(f507,plain,
( ( $product($sum(1,sK1),sK2) = fact($sum(1,sK1)) )
| ~ spl6_9 ),
inference(forward_demodulation,[],[f506,f73]) ).
tff(f506,plain,
( ( $product($sum(1,sK1),fact(sK1)) = fact($sum(1,sK1)) )
| ~ spl6_9 ),
inference(evaluation,[],[f501]) ).
tff(f501,plain,
( ( fact($sum(1,sK1)) = $product($sum(1,sK1),fact($sum($sum(1,sK1),-1))) )
| ~ spl6_9 ),
inference(resolution,[],[f485,f97]) ).
tff(f97,plain,
! [X0: $int] :
( $less(X0,1)
| ( $product(X0,fact($sum(X0,-1))) = fact(X0) ) ),
inference(evaluation,[],[f83]) ).
tff(f83,plain,
! [X0: $int] :
( $less(X0,1)
| ( fact(X0) = $product(X0,fact($sum(X0,$uminus(1)))) ) ),
inference(cnf_transformation,[],[f49]) ).
tff(f49,plain,
! [X0: $int] :
( $less(X0,1)
| ( fact(X0) = $product(X0,fact($sum(X0,$uminus(1)))) ) ),
inference(ennf_transformation,[],[f43]) ).
tff(f43,plain,
! [X0: $int] :
( ~ $less(X0,1)
=> ( fact(X0) = $product(X0,fact($sum(X0,$uminus(1)))) ) ),
inference(rectify,[],[f17]) ).
tff(f17,plain,
! [X8: $int] :
( ~ $less(X8,1)
=> ( fact(X8) = $product(X8,fact($sum(X8,$uminus(1)))) ) ),
inference(theory_normalization,[],[f10]) ).
tff(f10,axiom,
! [X8: $int] :
( $lesseq(1,X8)
=> ( fact(X8) = $product(X8,fact($difference(X8,1))) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',factn) ).
tff(f485,plain,
( ~ $less($sum(1,sK1),1)
| ~ spl6_9 ),
inference(backward_demodulation,[],[f78,f194]) ).
tff(f78,plain,
~ $less(sK4,1),
inference(cnf_transformation,[],[f63]) ).
tff(f110,plain,
( spl6_1
| ~ spl6_2
| spl6_3 ),
inference(avatar_split_clause,[],[f74,f107,f103,f99]) ).
tff(f74,plain,
( $less(sK5,0)
| ( fact(sK5) != sK3 )
| $less(sK0,sK5) ),
inference(cnf_transformation,[],[f63]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.10 % Problem : SWW581=2 : TPTP v8.1.0. Released v6.1.0.
% 0.03/0.11 % Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_sat --cores 0 -t %d %s
% 0.10/0.31 % Computer : n019.cluster.edu
% 0.10/0.31 % Model : x86_64 x86_64
% 0.10/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.31 % Memory : 8042.1875MB
% 0.10/0.31 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.31 % CPULimit : 300
% 0.10/0.31 % WCLimit : 300
% 0.10/0.31 % DateTime : Tue Aug 30 20:55:50 EDT 2022
% 0.10/0.31 % CPUTime :
% 0.16/0.46 % (11339)ott+10_1:32_abs=on:br=off:urr=ec_only:i=50:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/50Mi)
% 0.16/0.46 % (11362)ott+10_1:1_kws=precedence:tgt=ground:i=482:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/482Mi)
% 0.16/0.46 % (11353)ott+11_2:3_av=off:fde=unused:nwc=5.0:tgt=ground:i=75:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/75Mi)
% 0.16/0.47 % (11338)fmb+10_1:1_bce=on:fmbsr=1.5:nm=4:skr=on:i=191324:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/191324Mi)
% 0.16/0.47 % (11338)WARNING: trying to run FMB on interpreted or otherwise provably infinite-domain problem!
% 0.16/0.47 % (11338)Terminated due to inappropriate strategy.
% 0.16/0.47 % (11338)------------------------------
% 0.16/0.47 % (11338)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.16/0.47 % (11338)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.16/0.47 % (11338)Termination reason: Inappropriate
% 0.16/0.47
% 0.16/0.47 % (11338)Memory used [KB]: 895
% 0.16/0.47 % (11338)Time elapsed: 0.002 s
% 0.16/0.47 % (11338)Instructions burned: 2 (million)
% 0.16/0.47 % (11338)------------------------------
% 0.16/0.47 % (11338)------------------------------
% 0.16/0.47 % (11345)dis+10_1:1_fsd=on:sp=occurrence:i=7:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/7Mi)
% 0.16/0.47 % (11344)fmb+10_1:1_fmbsr=2.0:nm=4:skr=on:i=51:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/51Mi)
% 0.16/0.48 % (11344)WARNING: trying to run FMB on interpreted or otherwise provably infinite-domain problem!
% 0.16/0.48 % (11344)Terminated due to inappropriate strategy.
% 0.16/0.48 % (11344)------------------------------
% 0.16/0.48 % (11344)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.16/0.48 % (11344)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.16/0.48 % (11344)Termination reason: Inappropriate
% 0.16/0.48
% 0.16/0.48 % (11344)Memory used [KB]: 895
% 0.16/0.48 % (11344)Time elapsed: 0.003 s
% 0.16/0.48 % (11344)Instructions burned: 2 (million)
% 0.16/0.48 % (11344)------------------------------
% 0.16/0.48 % (11344)------------------------------
% 0.16/0.48 % (11361)ott+11_1:1_drc=off:nwc=5.0:slsq=on:slsqc=1:spb=goal_then_units:to=lpo:i=467:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/467Mi)
% 0.16/0.48 % (11342)ott+33_1:4_s2a=on:tgt=ground:i=51:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/51Mi)
% 0.16/0.48 % (11352)ins+10_1:1_awrs=decay:awrsf=30:bsr=unit_only:foolp=on:igrr=8/457:igs=10:igwr=on:nwc=1.5:sp=weighted_frequency:to=lpo:uhcvi=on:i=68:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/68Mi)
% 0.16/0.48 % (11341)ott+10_1:32_bd=off:fsr=off:newcnf=on:tgt=full:i=51:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/51Mi)
% 0.16/0.48 % (11363)ott+10_1:5_bd=off:tgt=full:i=500:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/500Mi)
% 0.16/0.49 % (11354)dis+34_1:32_abs=on:add=off:bsr=on:gsp=on:sp=weighted_frequency:i=99:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/99Mi)
% 0.16/0.49 % (11355)fmb+10_1:1_bce=on:i=59:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/59Mi)
% 0.16/0.49 % (11346)dis+2_1:64_add=large:bce=on:bd=off:i=2:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/2Mi)
% 0.16/0.49 % (11345)Instruction limit reached!
% 0.16/0.49 % (11345)------------------------------
% 0.16/0.49 % (11345)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.16/0.49 % (11345)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.16/0.49 % (11345)Termination reason: Unknown
% 0.16/0.49 % (11345)Termination phase: Saturation
% 0.16/0.49
% 0.16/0.49 % (11345)Memory used [KB]: 5500
% 0.16/0.49 % (11345)Time elapsed: 0.083 s
% 0.16/0.49 % (11345)Instructions burned: 7 (million)
% 0.16/0.49 % (11345)------------------------------
% 0.16/0.49 % (11345)------------------------------
% 0.16/0.49 % (11355)WARNING: trying to run FMB on interpreted or otherwise provably infinite-domain problem!
% 0.16/0.49 % (11355)Terminated due to inappropriate strategy.
% 0.16/0.49 % (11355)------------------------------
% 0.16/0.49 % (11355)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.16/0.49 % (11355)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.16/0.49 % (11355)Termination reason: Inappropriate
% 0.16/0.49
% 0.16/0.49 % (11355)Memory used [KB]: 895
% 0.16/0.49 % (11355)Time elapsed: 0.002 s
% 0.16/0.49 % (11355)Instructions burned: 2 (million)
% 0.16/0.49 % (11355)------------------------------
% 0.16/0.49 % (11355)------------------------------
% 0.16/0.49 % (11346)Instruction limit reached!
% 0.16/0.49 % (11346)------------------------------
% 0.16/0.49 % (11346)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.16/0.49 % (11346)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.16/0.49 % (11346)Termination reason: Unknown
% 0.16/0.49 % (11346)Termination phase: Property scanning
% 0.16/0.49
% 0.16/0.49 % (11346)Memory used [KB]: 895
% 0.16/0.49 % (11346)Time elapsed: 0.002 s
% 0.16/0.49 % (11346)Instructions burned: 3 (million)
% 0.16/0.49 % (11346)------------------------------
% 0.16/0.49 % (11346)------------------------------
% 0.16/0.50 % (11347)ott-1_1:6_av=off:cond=on:fsr=off:nwc=3.0:i=51:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/51Mi)
% 0.16/0.50 % (11357)ott+4_1:1_av=off:bd=off:nwc=5.0:rp=on:s2a=on:s2at=2.0:slsq=on:slsqc=2:slsql=off:slsqr=1,2:sp=frequency:i=100:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/100Mi)
% 0.16/0.50 % (11359)ott+3_1:1_gsp=on:lcm=predicate:i=138:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/138Mi)
% 0.16/0.51 % (11349)ott+10_1:32_bd=off:fsr=off:newcnf=on:tgt=full:i=100:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/100Mi)
% 0.16/0.51 % (11340)ott+4_1:1_av=off:bd=off:nwc=5.0:s2a=on:s2at=2.0:slsq=on:slsqc=2:slsql=off:slsqr=1,2:sp=frequency:i=37:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/37Mi)
% 0.16/0.52 % (11364)ins+10_1:1_awrs=decay:awrsf=30:bsr=unit_only:foolp=on:igrr=8/457:igs=10:igwr=on:nwc=1.5:sp=weighted_frequency:to=lpo:uhcvi=on:i=68:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/68Mi)
% 0.16/0.52 % (11365)ott+11_2:3_av=off:fde=unused:nwc=5.0:tgt=ground:i=177:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/177Mi)
% 0.16/0.52 % (11343)dis+34_1:32_abs=on:add=off:bsr=on:gsp=on:sp=weighted_frequency:i=48:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/48Mi)
% 0.16/0.52 % (11358)ott+10_1:8_bsd=on:fsd=on:lcm=predicate:nwc=5.0:s2a=on:s2at=1.5:spb=goal_then_units:i=176:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/176Mi)
% 0.16/0.52 % (11356)ott+10_1:1_tgt=ground:i=100:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/100Mi)
% 0.16/0.53 % (11360)dis+21_1:1_av=off:er=filter:slsq=on:slsqc=0:slsqr=1,1:sp=frequency:to=lpo:i=498:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/498Mi)
% 0.16/0.53 % (11361)First to succeed.
% 0.16/0.53 % (11352)Also succeeded, but the first one will report.
% 0.16/0.53 % (11367)ott+10_7:2_awrs=decay:awrsf=8:bd=preordered:drc=off:fd=preordered:fde=unused:fsr=off:slsq=on:slsqc=2:slsqr=5,8:sp=const_min:spb=units:to=lpo:i=355:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/355Mi)
% 0.16/0.53 % (11361)Refutation found. Thanks to Tanya!
% 0.16/0.53 % SZS status Theorem for theBenchmark
% 0.16/0.53 % SZS output start Proof for theBenchmark
% See solution above
% 0.16/0.53 % (11361)------------------------------
% 0.16/0.53 % (11361)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.16/0.53 % (11361)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.16/0.53 % (11361)Termination reason: Refutation
% 0.16/0.53
% 0.16/0.53 % (11361)Memory used [KB]: 5756
% 0.16/0.53 % (11361)Time elapsed: 0.164 s
% 0.16/0.53 % (11361)Instructions burned: 33 (million)
% 0.16/0.53 % (11361)------------------------------
% 0.16/0.53 % (11361)------------------------------
% 0.16/0.53 % (11337)Success in time 0.215 s
%------------------------------------------------------------------------------