TSTP Solution File: SEU137+1 by SnakeForV---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV---1.0
% Problem : SEU137+1 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_uns --cores 0 -t %d %s
% Computer : n009.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 18:26:50 EDT 2022
% Result : Theorem 0.19s 0.50s
% Output : Refutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 12
% Syntax : Number of formulae : 75 ( 4 unt; 0 def)
% Number of atoms : 313 ( 42 equ)
% Maximal formula atoms : 14 ( 4 avg)
% Number of connectives : 372 ( 134 ~; 152 |; 59 &)
% ( 13 <=>; 13 =>; 0 <=; 1 <~>)
% Maximal formula depth : 11 ( 6 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 7 ( 5 usr; 3 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 2 con; 0-3 aty)
% Number of variables : 154 ( 136 !; 18 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f238,plain,
$false,
inference(avatar_sat_refutation,[],[f196,f202,f214,f237]) ).
fof(f237,plain,
( spl8_3
| ~ spl8_4 ),
inference(avatar_contradiction_clause,[],[f236]) ).
fof(f236,plain,
( $false
| spl8_3
| ~ spl8_4 ),
inference(subsumption_resolution,[],[f232,f191]) ).
fof(f191,plain,
( ~ in(sK6(sK1,set_union2(sK0,set_difference(sK1,sK0))),sK1)
| spl8_3 ),
inference(avatar_component_clause,[],[f189]) ).
fof(f189,plain,
( spl8_3
<=> in(sK6(sK1,set_union2(sK0,set_difference(sK1,sK0))),sK1) ),
introduced(avatar_definition,[new_symbols(naming,[spl8_3])]) ).
fof(f232,plain,
( in(sK6(sK1,set_union2(sK0,set_difference(sK1,sK0))),sK1)
| spl8_3
| ~ spl8_4 ),
inference(resolution,[],[f230,f102]) ).
fof(f102,plain,
! [X2,X3,X1] :
( ~ in(X3,set_difference(X2,X1))
| in(X3,X2) ),
inference(equality_resolution,[],[f82]) ).
fof(f82,plain,
! [X2,X3,X0,X1] :
( in(X3,X2)
| ~ in(X3,X0)
| set_difference(X2,X1) != X0 ),
inference(cnf_transformation,[],[f54]) ).
fof(f54,plain,
! [X0,X1,X2] :
( ( ! [X3] :
( ( ( ~ in(X3,X1)
& in(X3,X2) )
| ~ in(X3,X0) )
& ( in(X3,X0)
| in(X3,X1)
| ~ in(X3,X2) ) )
| set_difference(X2,X1) != X0 )
& ( set_difference(X2,X1) = X0
| ( ( ~ in(sK3(X0,X1,X2),X0)
| in(sK3(X0,X1,X2),X1)
| ~ in(sK3(X0,X1,X2),X2) )
& ( in(sK3(X0,X1,X2),X0)
| ( ~ in(sK3(X0,X1,X2),X1)
& in(sK3(X0,X1,X2),X2) ) ) ) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK3])],[f52,f53]) ).
fof(f53,plain,
! [X0,X1,X2] :
( ? [X4] :
( ( ~ in(X4,X0)
| in(X4,X1)
| ~ in(X4,X2) )
& ( in(X4,X0)
| ( ~ in(X4,X1)
& in(X4,X2) ) ) )
=> ( ( ~ in(sK3(X0,X1,X2),X0)
| in(sK3(X0,X1,X2),X1)
| ~ in(sK3(X0,X1,X2),X2) )
& ( in(sK3(X0,X1,X2),X0)
| ( ~ in(sK3(X0,X1,X2),X1)
& in(sK3(X0,X1,X2),X2) ) ) ) ),
introduced(choice_axiom,[]) ).
fof(f52,plain,
! [X0,X1,X2] :
( ( ! [X3] :
( ( ( ~ in(X3,X1)
& in(X3,X2) )
| ~ in(X3,X0) )
& ( in(X3,X0)
| in(X3,X1)
| ~ in(X3,X2) ) )
| set_difference(X2,X1) != X0 )
& ( set_difference(X2,X1) = X0
| ? [X4] :
( ( ~ in(X4,X0)
| in(X4,X1)
| ~ in(X4,X2) )
& ( in(X4,X0)
| ( ~ in(X4,X1)
& in(X4,X2) ) ) ) ) ),
inference(rectify,[],[f51]) ).
fof(f51,plain,
! [X2,X1,X0] :
( ( ! [X3] :
( ( ( ~ in(X3,X1)
& in(X3,X0) )
| ~ in(X3,X2) )
& ( in(X3,X2)
| in(X3,X1)
| ~ in(X3,X0) ) )
| set_difference(X0,X1) != X2 )
& ( set_difference(X0,X1) = X2
| ? [X3] :
( ( ~ in(X3,X2)
| in(X3,X1)
| ~ in(X3,X0) )
& ( in(X3,X2)
| ( ~ in(X3,X1)
& in(X3,X0) ) ) ) ) ),
inference(flattening,[],[f50]) ).
fof(f50,plain,
! [X2,X1,X0] :
( ( ! [X3] :
( ( ( ~ in(X3,X1)
& in(X3,X0) )
| ~ in(X3,X2) )
& ( in(X3,X2)
| in(X3,X1)
| ~ in(X3,X0) ) )
| set_difference(X0,X1) != X2 )
& ( set_difference(X0,X1) = X2
| ? [X3] :
( ( ~ in(X3,X2)
| in(X3,X1)
| ~ in(X3,X0) )
& ( in(X3,X2)
| ( ~ in(X3,X1)
& in(X3,X0) ) ) ) ) ),
inference(nnf_transformation,[],[f5]) ).
fof(f5,axiom,
! [X2,X1,X0] :
( ! [X3] :
( ( ~ in(X3,X1)
& in(X3,X0) )
<=> in(X3,X2) )
<=> set_difference(X0,X1) = X2 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d4_xboole_0) ).
fof(f230,plain,
( in(sK6(sK1,set_union2(sK0,set_difference(sK1,sK0))),set_difference(sK1,sK0))
| spl8_3
| ~ spl8_4 ),
inference(subsumption_resolution,[],[f227,f215]) ).
fof(f215,plain,
( ~ in(sK6(sK1,set_union2(sK0,set_difference(sK1,sK0))),sK0)
| spl8_3 ),
inference(resolution,[],[f191,f153]) ).
fof(f153,plain,
! [X0] :
( in(X0,sK1)
| ~ in(X0,sK0) ),
inference(resolution,[],[f84,f72]) ).
fof(f72,plain,
subset(sK0,sK1),
inference(cnf_transformation,[],[f45]) ).
fof(f45,plain,
( subset(sK0,sK1)
& sK1 != set_union2(sK0,set_difference(sK1,sK0)) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1])],[f43,f44]) ).
fof(f44,plain,
( ? [X0,X1] :
( subset(X0,X1)
& set_union2(X0,set_difference(X1,X0)) != X1 )
=> ( subset(sK0,sK1)
& sK1 != set_union2(sK0,set_difference(sK1,sK0)) ) ),
introduced(choice_axiom,[]) ).
fof(f43,plain,
? [X0,X1] :
( subset(X0,X1)
& set_union2(X0,set_difference(X1,X0)) != X1 ),
inference(rectify,[],[f41]) ).
fof(f41,plain,
? [X1,X0] :
( subset(X1,X0)
& set_union2(X1,set_difference(X0,X1)) != X0 ),
inference(ennf_transformation,[],[f28]) ).
fof(f28,plain,
~ ! [X0,X1] :
( subset(X1,X0)
=> set_union2(X1,set_difference(X0,X1)) = X0 ),
inference(rectify,[],[f20]) ).
fof(f20,negated_conjecture,
~ ! [X1,X0] :
( subset(X0,X1)
=> set_union2(X0,set_difference(X1,X0)) = X1 ),
inference(negated_conjecture,[],[f19]) ).
fof(f19,conjecture,
! [X1,X0] :
( subset(X0,X1)
=> set_union2(X0,set_difference(X1,X0)) = X1 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t45_xboole_1) ).
fof(f84,plain,
! [X2,X0,X1] :
( ~ subset(X0,X1)
| ~ in(X2,X0)
| in(X2,X1) ),
inference(cnf_transformation,[],[f55]) ).
fof(f55,plain,
! [X0,X1] :
( ! [X2] :
( ~ in(X2,X0)
| in(X2,X1) )
| ~ subset(X0,X1) ),
inference(rectify,[],[f39]) ).
fof(f39,plain,
! [X1,X0] :
( ! [X2] :
( ~ in(X2,X1)
| in(X2,X0) )
| ~ subset(X1,X0) ),
inference(ennf_transformation,[],[f32]) ).
fof(f32,plain,
! [X0,X1] :
( subset(X1,X0)
=> ! [X2] :
( in(X2,X1)
=> in(X2,X0) ) ),
inference(unused_predicate_definition_removal,[],[f26]) ).
fof(f26,plain,
! [X0,X1] :
( subset(X1,X0)
<=> ! [X2] :
( in(X2,X1)
=> in(X2,X0) ) ),
inference(rectify,[],[f4]) ).
fof(f4,axiom,
! [X1,X0] :
( ! [X2] :
( in(X2,X0)
=> in(X2,X1) )
<=> subset(X0,X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d3_tarski) ).
fof(f227,plain,
( in(sK6(sK1,set_union2(sK0,set_difference(sK1,sK0))),sK0)
| in(sK6(sK1,set_union2(sK0,set_difference(sK1,sK0))),set_difference(sK1,sK0))
| ~ spl8_4 ),
inference(resolution,[],[f194,f104]) ).
fof(f104,plain,
! [X2,X3,X1] :
( ~ in(X3,set_union2(X1,X2))
| in(X3,X1)
| in(X3,X2) ),
inference(equality_resolution,[],[f92]) ).
fof(f92,plain,
! [X2,X3,X0,X1] :
( in(X3,X1)
| in(X3,X2)
| ~ in(X3,X0)
| set_union2(X1,X2) != X0 ),
inference(cnf_transformation,[],[f61]) ).
fof(f61,plain,
! [X0,X1,X2] :
( ( ! [X3] :
( ( in(X3,X1)
| in(X3,X2)
| ~ in(X3,X0) )
& ( in(X3,X0)
| ( ~ in(X3,X1)
& ~ in(X3,X2) ) ) )
| set_union2(X1,X2) != X0 )
& ( set_union2(X1,X2) = X0
| ( ( ~ in(sK4(X0,X1,X2),X0)
| ( ~ in(sK4(X0,X1,X2),X1)
& ~ in(sK4(X0,X1,X2),X2) ) )
& ( in(sK4(X0,X1,X2),X0)
| in(sK4(X0,X1,X2),X1)
| in(sK4(X0,X1,X2),X2) ) ) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK4])],[f59,f60]) ).
fof(f60,plain,
! [X0,X1,X2] :
( ? [X4] :
( ( ~ in(X4,X0)
| ( ~ in(X4,X1)
& ~ in(X4,X2) ) )
& ( in(X4,X0)
| in(X4,X1)
| in(X4,X2) ) )
=> ( ( ~ in(sK4(X0,X1,X2),X0)
| ( ~ in(sK4(X0,X1,X2),X1)
& ~ in(sK4(X0,X1,X2),X2) ) )
& ( in(sK4(X0,X1,X2),X0)
| in(sK4(X0,X1,X2),X1)
| in(sK4(X0,X1,X2),X2) ) ) ),
introduced(choice_axiom,[]) ).
fof(f59,plain,
! [X0,X1,X2] :
( ( ! [X3] :
( ( in(X3,X1)
| in(X3,X2)
| ~ in(X3,X0) )
& ( in(X3,X0)
| ( ~ in(X3,X1)
& ~ in(X3,X2) ) ) )
| set_union2(X1,X2) != X0 )
& ( set_union2(X1,X2) = X0
| ? [X4] :
( ( ~ in(X4,X0)
| ( ~ in(X4,X1)
& ~ in(X4,X2) ) )
& ( in(X4,X0)
| in(X4,X1)
| in(X4,X2) ) ) ) ),
inference(rectify,[],[f58]) ).
fof(f58,plain,
! [X1,X2,X0] :
( ( ! [X3] :
( ( in(X3,X2)
| in(X3,X0)
| ~ in(X3,X1) )
& ( in(X3,X1)
| ( ~ in(X3,X2)
& ~ in(X3,X0) ) ) )
| set_union2(X2,X0) != X1 )
& ( set_union2(X2,X0) = X1
| ? [X3] :
( ( ~ in(X3,X1)
| ( ~ in(X3,X2)
& ~ in(X3,X0) ) )
& ( in(X3,X1)
| in(X3,X2)
| in(X3,X0) ) ) ) ),
inference(flattening,[],[f57]) ).
fof(f57,plain,
! [X1,X2,X0] :
( ( ! [X3] :
( ( in(X3,X2)
| in(X3,X0)
| ~ in(X3,X1) )
& ( in(X3,X1)
| ( ~ in(X3,X2)
& ~ in(X3,X0) ) ) )
| set_union2(X2,X0) != X1 )
& ( set_union2(X2,X0) = X1
| ? [X3] :
( ( ~ in(X3,X1)
| ( ~ in(X3,X2)
& ~ in(X3,X0) ) )
& ( in(X3,X1)
| in(X3,X2)
| in(X3,X0) ) ) ) ),
inference(nnf_transformation,[],[f25]) ).
fof(f25,plain,
! [X1,X2,X0] :
( ! [X3] :
( ( in(X3,X2)
| in(X3,X0) )
<=> in(X3,X1) )
<=> set_union2(X2,X0) = X1 ),
inference(rectify,[],[f3]) ).
fof(f3,axiom,
! [X1,X2,X0] :
( ! [X3] :
( in(X3,X2)
<=> ( in(X3,X0)
| in(X3,X1) ) )
<=> set_union2(X0,X1) = X2 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d2_xboole_0) ).
fof(f194,plain,
( in(sK6(sK1,set_union2(sK0,set_difference(sK1,sK0))),set_union2(sK0,set_difference(sK1,sK0)))
| ~ spl8_4 ),
inference(avatar_component_clause,[],[f193]) ).
fof(f193,plain,
( spl8_4
<=> in(sK6(sK1,set_union2(sK0,set_difference(sK1,sK0))),set_union2(sK0,set_difference(sK1,sK0))) ),
introduced(avatar_definition,[new_symbols(naming,[spl8_4])]) ).
fof(f214,plain,
( ~ spl8_3
| spl8_4 ),
inference(avatar_contradiction_clause,[],[f213]) ).
fof(f213,plain,
( $false
| ~ spl8_3
| spl8_4 ),
inference(subsumption_resolution,[],[f212,f190]) ).
fof(f190,plain,
( in(sK6(sK1,set_union2(sK0,set_difference(sK1,sK0))),sK1)
| ~ spl8_3 ),
inference(avatar_component_clause,[],[f189]) ).
fof(f212,plain,
( ~ in(sK6(sK1,set_union2(sK0,set_difference(sK1,sK0))),sK1)
| spl8_4 ),
inference(subsumption_resolution,[],[f211,f206]) ).
fof(f206,plain,
( ~ in(sK6(sK1,set_union2(sK0,set_difference(sK1,sK0))),sK0)
| spl8_4 ),
inference(resolution,[],[f195,f105]) ).
fof(f105,plain,
! [X2,X3,X1] :
( in(X3,set_union2(X1,X2))
| ~ in(X3,X1) ),
inference(equality_resolution,[],[f91]) ).
fof(f91,plain,
! [X2,X3,X0,X1] :
( in(X3,X0)
| ~ in(X3,X1)
| set_union2(X1,X2) != X0 ),
inference(cnf_transformation,[],[f61]) ).
fof(f195,plain,
( ~ in(sK6(sK1,set_union2(sK0,set_difference(sK1,sK0))),set_union2(sK0,set_difference(sK1,sK0)))
| spl8_4 ),
inference(avatar_component_clause,[],[f193]) ).
fof(f211,plain,
( in(sK6(sK1,set_union2(sK0,set_difference(sK1,sK0))),sK0)
| ~ in(sK6(sK1,set_union2(sK0,set_difference(sK1,sK0))),sK1)
| spl8_4 ),
inference(resolution,[],[f205,f103]) ).
fof(f103,plain,
! [X2,X3,X1] :
( in(X3,set_difference(X2,X1))
| ~ in(X3,X2)
| in(X3,X1) ),
inference(equality_resolution,[],[f81]) ).
fof(f81,plain,
! [X2,X3,X0,X1] :
( in(X3,X0)
| in(X3,X1)
| ~ in(X3,X2)
| set_difference(X2,X1) != X0 ),
inference(cnf_transformation,[],[f54]) ).
fof(f205,plain,
( ~ in(sK6(sK1,set_union2(sK0,set_difference(sK1,sK0))),set_difference(sK1,sK0))
| spl8_4 ),
inference(resolution,[],[f195,f106]) ).
fof(f106,plain,
! [X2,X3,X1] :
( in(X3,set_union2(X1,X2))
| ~ in(X3,X2) ),
inference(equality_resolution,[],[f90]) ).
fof(f90,plain,
! [X2,X3,X0,X1] :
( in(X3,X0)
| ~ in(X3,X2)
| set_union2(X1,X2) != X0 ),
inference(cnf_transformation,[],[f61]) ).
fof(f202,plain,
( spl8_4
| spl8_3 ),
inference(avatar_split_clause,[],[f198,f189,f193]) ).
fof(f198,plain,
( in(sK6(sK1,set_union2(sK0,set_difference(sK1,sK0))),sK1)
| in(sK6(sK1,set_union2(sK0,set_difference(sK1,sK0))),set_union2(sK0,set_difference(sK1,sK0))) ),
inference(resolution,[],[f122,f109]) ).
fof(f109,plain,
~ sQ7_eqProxy(sK1,set_union2(sK0,set_difference(sK1,sK0))),
inference(equality_proxy_replacement,[],[f71,f107]) ).
fof(f107,plain,
! [X0,X1] :
( sQ7_eqProxy(X0,X1)
<=> X0 = X1 ),
introduced(equality_proxy_definition,[new_symbols(naming,[sQ7_eqProxy])]) ).
fof(f71,plain,
sK1 != set_union2(sK0,set_difference(sK1,sK0)),
inference(cnf_transformation,[],[f45]) ).
fof(f122,plain,
! [X0,X1] :
( sQ7_eqProxy(X0,X1)
| in(sK6(X0,X1),X1)
| in(sK6(X0,X1),X0) ),
inference(equality_proxy_replacement,[],[f97,f107]) ).
fof(f97,plain,
! [X0,X1] :
( in(sK6(X0,X1),X1)
| in(sK6(X0,X1),X0)
| X0 = X1 ),
inference(cnf_transformation,[],[f68]) ).
fof(f68,plain,
! [X0,X1] :
( ( ( ~ in(sK6(X0,X1),X1)
| ~ in(sK6(X0,X1),X0) )
& ( in(sK6(X0,X1),X1)
| in(sK6(X0,X1),X0) ) )
| X0 = X1 ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK6])],[f66,f67]) ).
fof(f67,plain,
! [X0,X1] :
( ? [X2] :
( ( ~ in(X2,X1)
| ~ in(X2,X0) )
& ( in(X2,X1)
| in(X2,X0) ) )
=> ( ( ~ in(sK6(X0,X1),X1)
| ~ in(sK6(X0,X1),X0) )
& ( in(sK6(X0,X1),X1)
| in(sK6(X0,X1),X0) ) ) ),
introduced(choice_axiom,[]) ).
fof(f66,plain,
! [X0,X1] :
( ? [X2] :
( ( ~ in(X2,X1)
| ~ in(X2,X0) )
& ( in(X2,X1)
| in(X2,X0) ) )
| X0 = X1 ),
inference(rectify,[],[f65]) ).
fof(f65,plain,
! [X1,X0] :
( ? [X2] :
( ( ~ in(X2,X0)
| ~ in(X2,X1) )
& ( in(X2,X0)
| in(X2,X1) ) )
| X0 = X1 ),
inference(nnf_transformation,[],[f33]) ).
fof(f33,plain,
! [X1,X0] :
( ? [X2] :
( in(X2,X1)
<~> in(X2,X0) )
| X0 = X1 ),
inference(ennf_transformation,[],[f27]) ).
fof(f27,plain,
! [X1,X0] :
( ! [X2] :
( in(X2,X0)
<=> in(X2,X1) )
=> X0 = X1 ),
inference(rectify,[],[f17]) ).
fof(f17,axiom,
! [X1,X0] :
( ! [X2] :
( in(X2,X0)
<=> in(X2,X1) )
=> X0 = X1 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t2_tarski) ).
fof(f196,plain,
( ~ spl8_3
| ~ spl8_4 ),
inference(avatar_split_clause,[],[f186,f193,f189]) ).
fof(f186,plain,
( ~ in(sK6(sK1,set_union2(sK0,set_difference(sK1,sK0))),set_union2(sK0,set_difference(sK1,sK0)))
| ~ in(sK6(sK1,set_union2(sK0,set_difference(sK1,sK0))),sK1) ),
inference(resolution,[],[f121,f109]) ).
fof(f121,plain,
! [X0,X1] :
( sQ7_eqProxy(X0,X1)
| ~ in(sK6(X0,X1),X1)
| ~ in(sK6(X0,X1),X0) ),
inference(equality_proxy_replacement,[],[f98,f107]) ).
fof(f98,plain,
! [X0,X1] :
( ~ in(sK6(X0,X1),X1)
| ~ in(sK6(X0,X1),X0)
| X0 = X1 ),
inference(cnf_transformation,[],[f68]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.11 % Problem : SEU137+1 : TPTP v8.1.0. Released v3.3.0.
% 0.06/0.12 % Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_uns --cores 0 -t %d %s
% 0.12/0.33 % Computer : n009.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 300
% 0.12/0.33 % DateTime : Tue Aug 30 14:40:50 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.19/0.44 % (576)dis+10_1:1_av=off:sos=on:sp=reverse_arity:ss=included:st=2.0:to=lpo:urr=ec_only:i=45:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/45Mi)
% 0.19/0.45 % (564)lrs+10_1:1_drc=off:sp=reverse_frequency:spb=goal:to=lpo:i=7:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/7Mi)
% 0.19/0.46 % (564)Instruction limit reached!
% 0.19/0.46 % (564)------------------------------
% 0.19/0.46 % (564)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.19/0.46 % (555)lrs+2_1:1_lcm=reverse:lma=on:sos=all:spb=goal_then_units:ss=included:urr=on:i=39:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/39Mi)
% 0.19/0.46 % (564)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.19/0.46 % (564)Termination reason: Unknown
% 0.19/0.46 % (564)Termination phase: Saturation
% 0.19/0.46
% 0.19/0.46 % (564)Memory used [KB]: 6012
% 0.19/0.46 % (564)Time elapsed: 0.062 s
% 0.19/0.46 % (564)Instructions burned: 7 (million)
% 0.19/0.46 % (564)------------------------------
% 0.19/0.46 % (564)------------------------------
% 0.19/0.48 % (553)dis+21_1:1_av=off:sos=on:sp=frequency:ss=included:to=lpo:i=15:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/15Mi)
% 0.19/0.49 % (577)dis+21_1:1_ep=RS:nwc=10.0:s2a=on:s2at=1.5:i=50:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/50Mi)
% 0.19/0.49 % (556)dis+10_1:1_newcnf=on:sgt=8:sos=on:ss=axioms:to=lpo:urr=on:i=49:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/49Mi)
% 0.19/0.49 % (557)lrs+10_1:1_br=off:sos=on:ss=axioms:st=2.0:urr=on:i=33:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/33Mi)
% 0.19/0.50 % (577)First to succeed.
% 0.19/0.50 % (557)Refutation not found, incomplete strategy% (557)------------------------------
% 0.19/0.50 % (557)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.19/0.50 % (557)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.19/0.50 % (557)Termination reason: Refutation not found, incomplete strategy
% 0.19/0.50
% 0.19/0.50 % (557)Memory used [KB]: 6012
% 0.19/0.50 % (557)Time elapsed: 0.102 s
% 0.19/0.50 % (557)Instructions burned: 2 (million)
% 0.19/0.50 % (557)------------------------------
% 0.19/0.50 % (557)------------------------------
% 0.19/0.50 % (574)ott+21_1:1_erd=off:s2a=on:sac=on:sd=1:sgt=64:sos=on:ss=included:st=3.0:to=lpo:urr=on:i=99:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/99Mi)
% 0.19/0.50 % (562)lrs+10_1:32_br=off:nm=16:sd=2:ss=axioms:st=2.0:urr=on:i=51:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/51Mi)
% 0.19/0.50 % (565)lrs+1011_1:1_fd=preordered:fsd=on:sos=on:thsq=on:thsqc=64:thsqd=32:uwa=ground:i=50:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/50Mi)
% 0.19/0.50 % (577)Refutation found. Thanks to Tanya!
% 0.19/0.50 % SZS status Theorem for theBenchmark
% 0.19/0.50 % SZS output start Proof for theBenchmark
% See solution above
% 0.19/0.50 % (577)------------------------------
% 0.19/0.50 % (577)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.19/0.50 % (577)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.19/0.50 % (577)Termination reason: Refutation
% 0.19/0.50
% 0.19/0.50 % (577)Memory used [KB]: 6012
% 0.19/0.50 % (577)Time elapsed: 0.106 s
% 0.19/0.50 % (577)Instructions burned: 7 (million)
% 0.19/0.50 % (577)------------------------------
% 0.19/0.50 % (577)------------------------------
% 0.19/0.50 % (545)Success in time 0.165 s
%------------------------------------------------------------------------------