TSTP Solution File: SET795+4 by SnakeForV---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV---1.0
% Problem : SET795+4 : TPTP v8.1.0. Released v3.2.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 : n006.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:22:17 EDT 2022
% Result : Theorem 1.29s 0.52s
% Output : Refutation 1.29s
% Verified :
% SZS Type : Refutation
% Derivation depth : 17
% Number of leaves : 10
% Syntax : Number of formulae : 70 ( 9 unt; 0 def)
% Number of atoms : 314 ( 33 equ)
% Maximal formula atoms : 14 ( 4 avg)
% Number of connectives : 362 ( 118 ~; 110 |; 95 &)
% ( 11 <=>; 28 =>; 0 <=; 0 <~>)
% Maximal formula depth : 15 ( 7 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 9 ( 7 usr; 3 prp; 0-4 aty)
% Number of functors : 7 ( 7 usr; 4 con; 0-4 aty)
% Number of variables : 207 ( 184 !; 23 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f122,plain,
$false,
inference(avatar_sat_refutation,[],[f108,f113,f121]) ).
fof(f121,plain,
~ spl6_5,
inference(avatar_contradiction_clause,[],[f120]) ).
fof(f120,plain,
( $false
| ~ spl6_5 ),
inference(subsumption_resolution,[],[f119,f58]) ).
fof(f58,plain,
member(sK1,sK2),
inference(cnf_transformation,[],[f46]) ).
fof(f46,plain,
( order(sK4,sK2)
& apply(sK4,sK3,sK1)
& ~ least_upper_bound(sK1,unordered_pair(sK3,sK1),sK4,sK2)
& member(sK3,sK2)
& member(sK1,sK2) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK1,sK2,sK3,sK4])],[f44,f45]) ).
fof(f45,plain,
( ? [X0,X1,X2,X3] :
( order(X3,X1)
& apply(X3,X2,X0)
& ~ least_upper_bound(X0,unordered_pair(X2,X0),X3,X1)
& member(X2,X1)
& member(X0,X1) )
=> ( order(sK4,sK2)
& apply(sK4,sK3,sK1)
& ~ least_upper_bound(sK1,unordered_pair(sK3,sK1),sK4,sK2)
& member(sK3,sK2)
& member(sK1,sK2) ) ),
introduced(choice_axiom,[]) ).
fof(f44,plain,
? [X0,X1,X2,X3] :
( order(X3,X1)
& apply(X3,X2,X0)
& ~ least_upper_bound(X0,unordered_pair(X2,X0),X3,X1)
& member(X2,X1)
& member(X0,X1) ),
inference(rectify,[],[f32]) ).
fof(f32,plain,
? [X3,X2,X0,X1] :
( order(X1,X2)
& apply(X1,X0,X3)
& ~ least_upper_bound(X3,unordered_pair(X0,X3),X1,X2)
& member(X0,X2)
& member(X3,X2) ),
inference(flattening,[],[f31]) ).
fof(f31,plain,
? [X2,X3,X1,X0] :
( ~ least_upper_bound(X3,unordered_pair(X0,X3),X1,X2)
& member(X0,X2)
& member(X3,X2)
& apply(X1,X0,X3)
& order(X1,X2) ),
inference(ennf_transformation,[],[f24]) ).
fof(f24,plain,
~ ! [X2,X3,X1,X0] :
( ( member(X0,X2)
& member(X3,X2)
& apply(X1,X0,X3)
& order(X1,X2) )
=> least_upper_bound(X3,unordered_pair(X0,X3),X1,X2) ),
inference(rectify,[],[f23]) ).
fof(f23,negated_conjecture,
~ ! [X0,X5,X3,X1] :
( ( apply(X5,X0,X1)
& member(X1,X3)
& member(X0,X3)
& order(X5,X3) )
=> least_upper_bound(X1,unordered_pair(X0,X1),X5,X3) ),
inference(negated_conjecture,[],[f22]) ).
fof(f22,conjecture,
! [X0,X5,X3,X1] :
( ( apply(X5,X0,X1)
& member(X1,X3)
& member(X0,X3)
& order(X5,X3) )
=> least_upper_bound(X1,unordered_pair(X0,X1),X5,X3) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',thIV7) ).
fof(f119,plain,
( ~ member(sK1,sK2)
| ~ spl6_5 ),
inference(resolution,[],[f118,f71]) ).
fof(f71,plain,
! [X0] :
( apply(sK4,X0,X0)
| ~ member(X0,sK2) ),
inference(resolution,[],[f63,f62]) ).
fof(f62,plain,
order(sK4,sK2),
inference(cnf_transformation,[],[f46]) ).
fof(f63,plain,
! [X0,X1,X7] :
( ~ order(X1,X0)
| apply(X1,X7,X7)
| ~ member(X7,X0) ),
inference(cnf_transformation,[],[f47]) ).
fof(f47,plain,
! [X0,X1] :
( ~ order(X1,X0)
| ( ! [X2,X3,X4] :
( ~ apply(X1,X2,X4)
| ~ member(X3,X0)
| ~ apply(X1,X3,X2)
| ~ member(X4,X0)
| apply(X1,X3,X4)
| ~ member(X2,X0) )
& ! [X5,X6] :
( ~ member(X6,X0)
| ~ apply(X1,X6,X5)
| ~ member(X5,X0)
| ~ apply(X1,X5,X6)
| X5 = X6 )
& ! [X7] :
( ~ member(X7,X0)
| apply(X1,X7,X7) ) ) ),
inference(rectify,[],[f34]) ).
fof(f34,plain,
! [X1,X0] :
( ~ order(X0,X1)
| ( ! [X5,X7,X6] :
( ~ apply(X0,X5,X6)
| ~ member(X7,X1)
| ~ apply(X0,X7,X5)
| ~ member(X6,X1)
| apply(X0,X7,X6)
| ~ member(X5,X1) )
& ! [X3,X2] :
( ~ member(X2,X1)
| ~ apply(X0,X2,X3)
| ~ member(X3,X1)
| ~ apply(X0,X3,X2)
| X2 = X3 )
& ! [X4] :
( ~ member(X4,X1)
| apply(X0,X4,X4) ) ) ),
inference(flattening,[],[f33]) ).
fof(f33,plain,
! [X1,X0] :
( ( ! [X4] :
( ~ member(X4,X1)
| apply(X0,X4,X4) )
& ! [X5,X6,X7] :
( apply(X0,X7,X6)
| ~ apply(X0,X5,X6)
| ~ apply(X0,X7,X5)
| ~ member(X7,X1)
| ~ member(X5,X1)
| ~ member(X6,X1) )
& ! [X3,X2] :
( X2 = X3
| ~ apply(X0,X3,X2)
| ~ apply(X0,X2,X3)
| ~ member(X2,X1)
| ~ member(X3,X1) ) )
| ~ order(X0,X1) ),
inference(ennf_transformation,[],[f30]) ).
fof(f30,plain,
! [X1,X0] :
( order(X0,X1)
=> ( ! [X4] :
( member(X4,X1)
=> apply(X0,X4,X4) )
& ! [X5,X6,X7] :
( ( member(X7,X1)
& member(X5,X1)
& member(X6,X1) )
=> ( ( apply(X0,X5,X6)
& apply(X0,X7,X5) )
=> apply(X0,X7,X6) ) )
& ! [X3,X2] :
( ( member(X2,X1)
& member(X3,X1) )
=> ( ( apply(X0,X3,X2)
& apply(X0,X2,X3) )
=> X2 = X3 ) ) ) ),
inference(unused_predicate_definition_removal,[],[f27]) ).
fof(f27,plain,
! [X1,X0] :
( ( ! [X4] :
( member(X4,X1)
=> apply(X0,X4,X4) )
& ! [X5,X6,X7] :
( ( member(X7,X1)
& member(X5,X1)
& member(X6,X1) )
=> ( ( apply(X0,X5,X6)
& apply(X0,X7,X5) )
=> apply(X0,X7,X6) ) )
& ! [X3,X2] :
( ( member(X2,X1)
& member(X3,X1) )
=> ( ( apply(X0,X3,X2)
& apply(X0,X2,X3) )
=> X2 = X3 ) ) )
<=> order(X0,X1) ),
inference(rectify,[],[f12]) ).
fof(f12,axiom,
! [X5,X3] :
( order(X5,X3)
<=> ( ! [X2,X4] :
( ( member(X4,X3)
& member(X2,X3) )
=> ( ( apply(X5,X2,X4)
& apply(X5,X4,X2) )
=> X2 = X4 ) )
& ! [X2] :
( member(X2,X3)
=> apply(X5,X2,X2) )
& ! [X4,X6,X2] :
( ( member(X4,X3)
& member(X2,X3)
& member(X6,X3) )
=> ( ( apply(X5,X2,X4)
& apply(X5,X4,X6) )
=> apply(X5,X2,X6) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',order) ).
fof(f118,plain,
( ~ apply(sK4,sK1,sK1)
| ~ spl6_5 ),
inference(subsumption_resolution,[],[f116,f98]) ).
fof(f98,plain,
~ upper_bound(sK1,sK4,unordered_pair(sK3,sK1)),
inference(subsumption_resolution,[],[f97,f70]) ).
fof(f70,plain,
! [X2,X0] : member(X2,unordered_pair(X0,X2)),
inference(equality_resolution,[],[f53]) ).
fof(f53,plain,
! [X2,X0,X1] :
( member(X1,unordered_pair(X0,X2))
| X1 != X2 ),
inference(cnf_transformation,[],[f40]) ).
fof(f40,plain,
! [X0,X1,X2] :
( ( member(X1,unordered_pair(X0,X2))
| ( X0 != X1
& X1 != X2 ) )
& ( X0 = X1
| X1 = X2
| ~ member(X1,unordered_pair(X0,X2)) ) ),
inference(rectify,[],[f39]) ).
fof(f39,plain,
! [X2,X1,X0] :
( ( member(X1,unordered_pair(X2,X0))
| ( X1 != X2
& X0 != X1 ) )
& ( X1 = X2
| X0 = X1
| ~ member(X1,unordered_pair(X2,X0)) ) ),
inference(flattening,[],[f38]) ).
fof(f38,plain,
! [X2,X1,X0] :
( ( member(X1,unordered_pair(X2,X0))
| ( X1 != X2
& X0 != X1 ) )
& ( X1 = X2
| X0 = X1
| ~ member(X1,unordered_pair(X2,X0)) ) ),
inference(nnf_transformation,[],[f26]) ).
fof(f26,plain,
! [X2,X1,X0] :
( member(X1,unordered_pair(X2,X0))
<=> ( X1 = X2
| X0 = X1 ) ),
inference(rectify,[],[f9]) ).
fof(f9,axiom,
! [X1,X2,X0] :
( ( X1 = X2
| X0 = X2 )
<=> member(X2,unordered_pair(X0,X1)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',unordered_pair) ).
fof(f97,plain,
( ~ member(sK1,unordered_pair(sK3,sK1))
| ~ upper_bound(sK1,sK4,unordered_pair(sK3,sK1)) ),
inference(resolution,[],[f96,f60]) ).
fof(f60,plain,
~ least_upper_bound(sK1,unordered_pair(sK3,sK1),sK4,sK2),
inference(cnf_transformation,[],[f46]) ).
fof(f96,plain,
! [X8,X6,X7,X5] :
( least_upper_bound(X5,X7,X6,X8)
| ~ member(X5,X7)
| ~ upper_bound(X5,X6,X7) ),
inference(duplicate_literal_removal,[],[f94]) ).
fof(f94,plain,
! [X8,X6,X7,X5] :
( least_upper_bound(X5,X7,X6,X8)
| ~ member(X5,X7)
| ~ upper_bound(X5,X6,X7)
| ~ member(X5,X7)
| ~ upper_bound(X5,X6,X7)
| ~ member(X5,X7)
| least_upper_bound(X5,X7,X6,X8) ),
inference(resolution,[],[f76,f57]) ).
fof(f57,plain,
! [X2,X3,X0,X1] :
( ~ apply(X0,X2,sK0(X0,X1,X2,X3))
| least_upper_bound(X2,X3,X0,X1)
| ~ upper_bound(X2,X0,X3)
| ~ member(X2,X3) ),
inference(cnf_transformation,[],[f43]) ).
fof(f43,plain,
! [X0,X1,X2,X3] :
( least_upper_bound(X2,X3,X0,X1)
| ~ member(X2,X3)
| ~ upper_bound(X2,X0,X3)
| ( ~ apply(X0,X2,sK0(X0,X1,X2,X3))
& upper_bound(sK0(X0,X1,X2,X3),X0,X3)
& member(sK0(X0,X1,X2,X3),X1) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0])],[f41,f42]) ).
fof(f42,plain,
! [X0,X1,X2,X3] :
( ? [X4] :
( ~ apply(X0,X2,X4)
& upper_bound(X4,X0,X3)
& member(X4,X1) )
=> ( ~ apply(X0,X2,sK0(X0,X1,X2,X3))
& upper_bound(sK0(X0,X1,X2,X3),X0,X3)
& member(sK0(X0,X1,X2,X3),X1) ) ),
introduced(choice_axiom,[]) ).
fof(f41,plain,
! [X0,X1,X2,X3] :
( least_upper_bound(X2,X3,X0,X1)
| ~ member(X2,X3)
| ~ upper_bound(X2,X0,X3)
| ? [X4] :
( ~ apply(X0,X2,X4)
& upper_bound(X4,X0,X3)
& member(X4,X1) ) ),
inference(rectify,[],[f36]) ).
fof(f36,plain,
! [X1,X0,X3,X2] :
( least_upper_bound(X3,X2,X1,X0)
| ~ member(X3,X2)
| ~ upper_bound(X3,X1,X2)
| ? [X4] :
( ~ apply(X1,X3,X4)
& upper_bound(X4,X1,X2)
& member(X4,X0) ) ),
inference(flattening,[],[f35]) ).
fof(f35,plain,
! [X0,X3,X2,X1] :
( least_upper_bound(X3,X2,X1,X0)
| ? [X4] :
( ~ apply(X1,X3,X4)
& upper_bound(X4,X1,X2)
& member(X4,X0) )
| ~ upper_bound(X3,X1,X2)
| ~ member(X3,X2) ),
inference(ennf_transformation,[],[f29]) ).
fof(f29,plain,
! [X0,X3,X2,X1] :
( ( ! [X4] :
( ( upper_bound(X4,X1,X2)
& member(X4,X0) )
=> apply(X1,X3,X4) )
& upper_bound(X3,X1,X2)
& member(X3,X2) )
=> least_upper_bound(X3,X2,X1,X0) ),
inference(unused_predicate_definition_removal,[],[f25]) ).
fof(f25,plain,
! [X0,X3,X2,X1] :
( least_upper_bound(X3,X2,X1,X0)
<=> ( ! [X4] :
( ( upper_bound(X4,X1,X2)
& member(X4,X0) )
=> apply(X1,X3,X4) )
& upper_bound(X3,X1,X2)
& member(X3,X2) ) ),
inference(rectify,[],[f20]) ).
fof(f20,axiom,
! [X3,X5,X2,X0] :
( least_upper_bound(X0,X2,X5,X3)
<=> ( member(X0,X2)
& ! [X7] :
( ( member(X7,X3)
& upper_bound(X7,X5,X2) )
=> apply(X5,X0,X7) )
& upper_bound(X0,X5,X2) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',least_upper_bound) ).
fof(f76,plain,
! [X2,X3,X0,X1,X4] :
( apply(X2,X4,sK0(X2,X3,X0,X1))
| ~ upper_bound(X0,X2,X1)
| ~ member(X0,X1)
| ~ member(X4,X1)
| least_upper_bound(X0,X1,X2,X3) ),
inference(resolution,[],[f56,f66]) ).
fof(f66,plain,
! [X2,X0,X1,X4] :
( ~ upper_bound(X2,X0,X1)
| apply(X0,X4,X2)
| ~ member(X4,X1) ),
inference(cnf_transformation,[],[f51]) ).
fof(f51,plain,
! [X0,X1,X2] :
( ( upper_bound(X2,X0,X1)
| ( ~ apply(X0,sK5(X0,X1,X2),X2)
& member(sK5(X0,X1,X2),X1) ) )
& ( ! [X4] :
( apply(X0,X4,X2)
| ~ member(X4,X1) )
| ~ upper_bound(X2,X0,X1) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK5])],[f49,f50]) ).
fof(f50,plain,
! [X0,X1,X2] :
( ? [X3] :
( ~ apply(X0,X3,X2)
& member(X3,X1) )
=> ( ~ apply(X0,sK5(X0,X1,X2),X2)
& member(sK5(X0,X1,X2),X1) ) ),
introduced(choice_axiom,[]) ).
fof(f49,plain,
! [X0,X1,X2] :
( ( upper_bound(X2,X0,X1)
| ? [X3] :
( ~ apply(X0,X3,X2)
& member(X3,X1) ) )
& ( ! [X4] :
( apply(X0,X4,X2)
| ~ member(X4,X1) )
| ~ upper_bound(X2,X0,X1) ) ),
inference(rectify,[],[f48]) ).
fof(f48,plain,
! [X2,X1,X0] :
( ( upper_bound(X0,X2,X1)
| ? [X3] :
( ~ apply(X2,X3,X0)
& member(X3,X1) ) )
& ( ! [X3] :
( apply(X2,X3,X0)
| ~ member(X3,X1) )
| ~ upper_bound(X0,X2,X1) ) ),
inference(nnf_transformation,[],[f37]) ).
fof(f37,plain,
! [X2,X1,X0] :
( upper_bound(X0,X2,X1)
<=> ! [X3] :
( apply(X2,X3,X0)
| ~ member(X3,X1) ) ),
inference(ennf_transformation,[],[f28]) ).
fof(f28,plain,
! [X0,X1,X2] :
( ! [X3] :
( member(X3,X1)
=> apply(X2,X3,X0) )
<=> upper_bound(X0,X2,X1) ),
inference(rectify,[],[f14]) ).
fof(f14,axiom,
! [X7,X3,X5] :
( upper_bound(X7,X5,X3)
<=> ! [X2] :
( member(X2,X3)
=> apply(X5,X2,X7) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',upper_bound) ).
fof(f56,plain,
! [X2,X3,X0,X1] :
( upper_bound(sK0(X0,X1,X2,X3),X0,X3)
| least_upper_bound(X2,X3,X0,X1)
| ~ member(X2,X3)
| ~ upper_bound(X2,X0,X3) ),
inference(cnf_transformation,[],[f43]) ).
fof(f116,plain,
( upper_bound(sK1,sK4,unordered_pair(sK3,sK1))
| ~ apply(sK4,sK1,sK1)
| ~ spl6_5 ),
inference(superposition,[],[f68,f107]) ).
fof(f107,plain,
( sK5(sK4,unordered_pair(sK3,sK1),sK1) = sK1
| ~ spl6_5 ),
inference(avatar_component_clause,[],[f105]) ).
fof(f105,plain,
( spl6_5
<=> sK5(sK4,unordered_pair(sK3,sK1),sK1) = sK1 ),
introduced(avatar_definition,[new_symbols(naming,[spl6_5])]) ).
fof(f68,plain,
! [X2,X0,X1] :
( ~ apply(X0,sK5(X0,X1,X2),X2)
| upper_bound(X2,X0,X1) ),
inference(cnf_transformation,[],[f51]) ).
fof(f113,plain,
~ spl6_4,
inference(avatar_contradiction_clause,[],[f112]) ).
fof(f112,plain,
( $false
| ~ spl6_4 ),
inference(subsumption_resolution,[],[f111,f98]) ).
fof(f111,plain,
( upper_bound(sK1,sK4,unordered_pair(sK3,sK1))
| ~ spl6_4 ),
inference(subsumption_resolution,[],[f109,f61]) ).
fof(f61,plain,
apply(sK4,sK3,sK1),
inference(cnf_transformation,[],[f46]) ).
fof(f109,plain,
( ~ apply(sK4,sK3,sK1)
| upper_bound(sK1,sK4,unordered_pair(sK3,sK1))
| ~ spl6_4 ),
inference(superposition,[],[f68,f103]) ).
fof(f103,plain,
( sK5(sK4,unordered_pair(sK3,sK1),sK1) = sK3
| ~ spl6_4 ),
inference(avatar_component_clause,[],[f101]) ).
fof(f101,plain,
( spl6_4
<=> sK5(sK4,unordered_pair(sK3,sK1),sK1) = sK3 ),
introduced(avatar_definition,[new_symbols(naming,[spl6_4])]) ).
fof(f108,plain,
( spl6_4
| spl6_5 ),
inference(avatar_split_clause,[],[f99,f105,f101]) ).
fof(f99,plain,
( sK5(sK4,unordered_pair(sK3,sK1),sK1) = sK1
| sK5(sK4,unordered_pair(sK3,sK1),sK1) = sK3 ),
inference(resolution,[],[f98,f74]) ).
fof(f74,plain,
! [X6,X7,X4,X5] :
( upper_bound(X7,X5,unordered_pair(X4,X6))
| sK5(X5,unordered_pair(X4,X6),X7) = X4
| sK5(X5,unordered_pair(X4,X6),X7) = X6 ),
inference(resolution,[],[f52,f67]) ).
fof(f67,plain,
! [X2,X0,X1] :
( member(sK5(X0,X1,X2),X1)
| upper_bound(X2,X0,X1) ),
inference(cnf_transformation,[],[f51]) ).
fof(f52,plain,
! [X2,X0,X1] :
( ~ member(X1,unordered_pair(X0,X2))
| X0 = X1
| X1 = X2 ),
inference(cnf_transformation,[],[f40]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SET795+4 : TPTP v8.1.0. Released v3.2.0.
% 0.07/0.13 % Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_uns --cores 0 -t %d %s
% 0.13/0.34 % Computer : n006.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Tue Aug 30 14:19:25 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.19/0.50 % (2264)lrs+10_1:4_av=off:bs=unit_only:bsr=unit_only:ep=RS:s2a=on:sos=on:sp=frequency:to=lpo:i=16:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/16Mi)
% 0.19/0.51 % (2272)dis+1010_1:1_bs=on:ep=RS:erd=off:newcnf=on:nwc=10.0:s2a=on:sgt=32:ss=axioms:i=30:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/30Mi)
% 0.19/0.51 % (2263)lrs+10_1:2_br=off:nm=4:ss=included:urr=on:i=7:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/7Mi)
% 0.19/0.51 % (2280)dis+2_3:1_aac=none:abs=on:ep=R:lcm=reverse:nwc=10.0:sos=on:sp=const_frequency:spb=units:urr=ec_only:i=8:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/8Mi)
% 0.19/0.51 % (2257)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.51 % (2256)lrs+10_1:1024_nm=0:nwc=5.0:ss=axioms:i=13:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/13Mi)
% 0.19/0.51 % (2280)Refutation not found, incomplete strategy% (2280)------------------------------
% 0.19/0.51 % (2280)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.19/0.52 % (2256)First to succeed.
% 0.19/0.52 % (2280)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.19/0.52 % (2280)Termination reason: Refutation not found, incomplete strategy
% 0.19/0.52
% 0.19/0.52 % (2280)Memory used [KB]: 6012
% 0.19/0.52 % (2280)Time elapsed: 0.102 s
% 0.19/0.52 % (2280)Instructions burned: 5 (million)
% 0.19/0.52 % (2280)------------------------------
% 0.19/0.52 % (2280)------------------------------
% 1.29/0.52 % (2255)lrs+10_5:1_br=off:fde=none:nwc=3.0:sd=1:sgt=10:sos=on:ss=axioms:urr=on:i=51:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/51Mi)
% 1.29/0.52 % (2254)dis+1002_1:1_aac=none:bd=off:sac=on:sos=on:spb=units:i=3:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/3Mi)
% 1.29/0.52 % (2266)lrs+10_1:1_ins=3:sp=reverse_frequency:spb=goal:to=lpo:i=3:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/3Mi)
% 1.29/0.52 % (2254)Instruction limit reached!
% 1.29/0.52 % (2254)------------------------------
% 1.29/0.52 % (2254)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 1.29/0.52 % (2254)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 1.29/0.52 % (2254)Termination reason: Unknown
% 1.29/0.52 % (2254)Termination phase: Saturation
% 1.29/0.52
% 1.29/0.52 % (2254)Memory used [KB]: 6012
% 1.29/0.52 % (2254)Time elapsed: 0.117 s
% 1.29/0.52 % (2254)Instructions burned: 3 (million)
% 1.29/0.52 % (2254)------------------------------
% 1.29/0.52 % (2254)------------------------------
% 1.29/0.52 % (2266)Instruction limit reached!
% 1.29/0.52 % (2266)------------------------------
% 1.29/0.52 % (2266)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 1.29/0.52 % (2266)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 1.29/0.52 % (2266)Termination reason: Unknown
% 1.29/0.52 % (2266)Termination phase: Saturation
% 1.29/0.52
% 1.29/0.52 % (2266)Memory used [KB]: 6012
% 1.29/0.52 % (2266)Time elapsed: 0.003 s
% 1.29/0.52 % (2266)Instructions burned: 4 (million)
% 1.29/0.52 % (2266)------------------------------
% 1.29/0.52 % (2266)------------------------------
% 1.29/0.52 % (2255)Refutation not found, incomplete strategy% (2255)------------------------------
% 1.29/0.52 % (2255)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 1.29/0.52 % (2255)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 1.29/0.52 % (2255)Termination reason: Refutation not found, incomplete strategy
% 1.29/0.52
% 1.29/0.52 % (2255)Memory used [KB]: 6012
% 1.29/0.52 % (2255)Time elapsed: 0.117 s
% 1.29/0.52 % (2255)Instructions burned: 4 (million)
% 1.29/0.52 % (2255)------------------------------
% 1.29/0.52 % (2255)------------------------------
% 1.29/0.52 % (2259)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)
% 1.29/0.52 % (2260)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)
% 1.29/0.52 % (2261)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)
% 1.29/0.52 % (2257)Also succeeded, but the first one will report.
% 1.29/0.52 % (2256)Refutation found. Thanks to Tanya!
% 1.29/0.52 % SZS status Theorem for theBenchmark
% 1.29/0.52 % SZS output start Proof for theBenchmark
% See solution above
% 1.29/0.52 % (2256)------------------------------
% 1.29/0.52 % (2256)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 1.29/0.52 % (2256)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 1.29/0.52 % (2256)Termination reason: Refutation
% 1.29/0.52
% 1.29/0.52 % (2256)Memory used [KB]: 6012
% 1.29/0.52 % (2256)Time elapsed: 0.118 s
% 1.29/0.52 % (2256)Instructions burned: 4 (million)
% 1.29/0.52 % (2256)------------------------------
% 1.29/0.52 % (2256)------------------------------
% 1.29/0.52 % (2251)Success in time 0.172 s
%------------------------------------------------------------------------------