TSTP Solution File: SET795+4 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SET795+4 : TPTP v8.1.2. Released v3.2.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/sandbox/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -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 May 1 03:49:01 EDT 2024
% Result : Theorem 0.64s 0.82s
% Output : Refutation 0.64s
% Verified :
% SZS Type : Refutation
% Derivation depth : 17
% Number of leaves : 11
% Syntax : Number of formulae : 74 ( 7 unt; 0 def)
% Number of atoms : 312 ( 26 equ)
% Maximal formula atoms : 14 ( 4 avg)
% Number of connectives : 356 ( 118 ~; 113 |; 85 &)
% ( 12 <=>; 28 =>; 0 <=; 0 <~>)
% Maximal formula depth : 14 ( 6 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 10 ( 8 usr; 4 prp; 0-4 aty)
% Number of functors : 7 ( 7 usr; 4 con; 0-4 aty)
% Number of variables : 178 ( 160 !; 18 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f150,plain,
$false,
inference(avatar_sat_refutation,[],[f103,f114,f137,f148]) ).
fof(f148,plain,
( spl6_1
| ~ spl6_4 ),
inference(avatar_contradiction_clause,[],[f147]) ).
fof(f147,plain,
( $false
| spl6_1
| ~ spl6_4 ),
inference(subsumption_resolution,[],[f146,f56]) ).
fof(f56,plain,
apply(sK0,sK2,sK3),
inference(cnf_transformation,[],[f43]) ).
fof(f43,plain,
( ~ least_upper_bound(sK3,unordered_pair(sK2,sK3),sK0,sK1)
& apply(sK0,sK2,sK3)
& member(sK3,sK1)
& member(sK2,sK1)
& order(sK0,sK1) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3])],[f36,f42]) ).
fof(f42,plain,
( ? [X0,X1,X2,X3] :
( ~ least_upper_bound(X3,unordered_pair(X2,X3),X0,X1)
& apply(X0,X2,X3)
& member(X3,X1)
& member(X2,X1)
& order(X0,X1) )
=> ( ~ least_upper_bound(sK3,unordered_pair(sK2,sK3),sK0,sK1)
& apply(sK0,sK2,sK3)
& member(sK3,sK1)
& member(sK2,sK1)
& order(sK0,sK1) ) ),
introduced(choice_axiom,[]) ).
fof(f36,plain,
? [X0,X1,X2,X3] :
( ~ least_upper_bound(X3,unordered_pair(X2,X3),X0,X1)
& apply(X0,X2,X3)
& member(X3,X1)
& member(X2,X1)
& order(X0,X1) ),
inference(flattening,[],[f35]) ).
fof(f35,plain,
? [X0,X1,X2,X3] :
( ~ least_upper_bound(X3,unordered_pair(X2,X3),X0,X1)
& apply(X0,X2,X3)
& member(X3,X1)
& member(X2,X1)
& order(X0,X1) ),
inference(ennf_transformation,[],[f24]) ).
fof(f24,plain,
~ ! [X0,X1,X2,X3] :
( ( apply(X0,X2,X3)
& member(X3,X1)
& member(X2,X1)
& order(X0,X1) )
=> least_upper_bound(X3,unordered_pair(X2,X3),X0,X1) ),
inference(rectify,[],[f23]) ).
fof(f23,negated_conjecture,
~ ! [X5,X3,X0,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,
! [X5,X3,X0,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/tmp/tmp.QeJRIJJpaO/Vampire---4.8_28380',thIV7) ).
fof(f146,plain,
( ~ apply(sK0,sK2,sK3)
| spl6_1
| ~ spl6_4 ),
inference(forward_demodulation,[],[f144,f102]) ).
fof(f102,plain,
( sK2 = sK5(sK0,unordered_pair(sK2,sK3),sK3)
| ~ spl6_4 ),
inference(avatar_component_clause,[],[f100]) ).
fof(f100,plain,
( spl6_4
<=> sK2 = sK5(sK0,unordered_pair(sK2,sK3),sK3) ),
introduced(avatar_definition,[new_symbols(naming,[spl6_4])]) ).
fof(f144,plain,
( ~ apply(sK0,sK5(sK0,unordered_pair(sK2,sK3),sK3),sK3)
| spl6_1 ),
inference(resolution,[],[f83,f71]) ).
fof(f71,plain,
! [X2,X0,X1] :
( upper_bound(X2,X0,X1)
| ~ apply(X0,sK5(X0,X1,X2),X2) ),
inference(cnf_transformation,[],[f52]) ).
fof(f52,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])],[f50,f51]) ).
fof(f51,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(f50,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,[],[f49]) ).
fof(f49,plain,
! [X0,X1,X2] :
( ( upper_bound(X2,X0,X1)
| ? [X3] :
( ~ apply(X0,X3,X2)
& member(X3,X1) ) )
& ( ! [X3] :
( apply(X0,X3,X2)
| ~ member(X3,X1) )
| ~ upper_bound(X2,X0,X1) ) ),
inference(nnf_transformation,[],[f41]) ).
fof(f41,plain,
! [X0,X1,X2] :
( upper_bound(X2,X0,X1)
<=> ! [X3] :
( apply(X0,X3,X2)
| ~ member(X3,X1) ) ),
inference(ennf_transformation,[],[f32]) ).
fof(f32,plain,
! [X0,X1,X2] :
( upper_bound(X2,X0,X1)
<=> ! [X3] :
( member(X3,X1)
=> apply(X0,X3,X2) ) ),
inference(rectify,[],[f14]) ).
fof(f14,axiom,
! [X5,X3,X7] :
( upper_bound(X7,X5,X3)
<=> ! [X2] :
( member(X2,X3)
=> apply(X5,X2,X7) ) ),
file('/export/starexec/sandbox/tmp/tmp.QeJRIJJpaO/Vampire---4.8_28380',upper_bound) ).
fof(f83,plain,
( ~ upper_bound(sK3,sK0,unordered_pair(sK2,sK3))
| spl6_1 ),
inference(avatar_component_clause,[],[f81]) ).
fof(f81,plain,
( spl6_1
<=> upper_bound(sK3,sK0,unordered_pair(sK2,sK3)) ),
introduced(avatar_definition,[new_symbols(naming,[spl6_1])]) ).
fof(f137,plain,
~ spl6_1,
inference(avatar_contradiction_clause,[],[f136]) ).
fof(f136,plain,
( $false
| ~ spl6_1 ),
inference(subsumption_resolution,[],[f135,f82]) ).
fof(f82,plain,
( upper_bound(sK3,sK0,unordered_pair(sK2,sK3))
| ~ spl6_1 ),
inference(avatar_component_clause,[],[f81]) ).
fof(f135,plain,
( ~ upper_bound(sK3,sK0,unordered_pair(sK2,sK3))
| ~ spl6_1 ),
inference(subsumption_resolution,[],[f134,f57]) ).
fof(f57,plain,
~ least_upper_bound(sK3,unordered_pair(sK2,sK3),sK0,sK1),
inference(cnf_transformation,[],[f43]) ).
fof(f134,plain,
( least_upper_bound(sK3,unordered_pair(sK2,sK3),sK0,sK1)
| ~ upper_bound(sK3,sK0,unordered_pair(sK2,sK3))
| ~ spl6_1 ),
inference(subsumption_resolution,[],[f133,f72]) ).
fof(f72,plain,
! [X2,X1] : member(X2,unordered_pair(X1,X2)),
inference(equality_resolution,[],[f63]) ).
fof(f63,plain,
! [X2,X0,X1] :
( member(X0,unordered_pair(X1,X2))
| X0 != X2 ),
inference(cnf_transformation,[],[f45]) ).
fof(f45,plain,
! [X0,X1,X2] :
( ( member(X0,unordered_pair(X1,X2))
| ( X0 != X2
& X0 != X1 ) )
& ( X0 = X2
| X0 = X1
| ~ member(X0,unordered_pair(X1,X2)) ) ),
inference(flattening,[],[f44]) ).
fof(f44,plain,
! [X0,X1,X2] :
( ( member(X0,unordered_pair(X1,X2))
| ( X0 != X2
& X0 != X1 ) )
& ( X0 = X2
| X0 = X1
| ~ member(X0,unordered_pair(X1,X2)) ) ),
inference(nnf_transformation,[],[f27]) ).
fof(f27,plain,
! [X0,X1,X2] :
( member(X0,unordered_pair(X1,X2))
<=> ( X0 = X2
| X0 = X1 ) ),
inference(rectify,[],[f9]) ).
fof(f9,axiom,
! [X2,X0,X1] :
( member(X2,unordered_pair(X0,X1))
<=> ( X1 = X2
| X0 = X2 ) ),
file('/export/starexec/sandbox/tmp/tmp.QeJRIJJpaO/Vampire---4.8_28380',unordered_pair) ).
fof(f133,plain,
( ~ member(sK3,unordered_pair(sK2,sK3))
| least_upper_bound(sK3,unordered_pair(sK2,sK3),sK0,sK1)
| ~ upper_bound(sK3,sK0,unordered_pair(sK2,sK3))
| ~ spl6_1 ),
inference(duplicate_literal_removal,[],[f130]) ).
fof(f130,plain,
( ~ member(sK3,unordered_pair(sK2,sK3))
| least_upper_bound(sK3,unordered_pair(sK2,sK3),sK0,sK1)
| ~ upper_bound(sK3,sK0,unordered_pair(sK2,sK3))
| ~ member(sK3,unordered_pair(sK2,sK3))
| ~ spl6_1 ),
inference(resolution,[],[f129,f65]) ).
fof(f65,plain,
! [X2,X3,X0,X1] :
( upper_bound(sK4(X0,X1,X2,X3),X2,X1)
| least_upper_bound(X0,X1,X2,X3)
| ~ upper_bound(X0,X2,X1)
| ~ member(X0,X1) ),
inference(cnf_transformation,[],[f47]) ).
fof(f47,plain,
! [X0,X1,X2,X3] :
( least_upper_bound(X0,X1,X2,X3)
| ( ~ apply(X2,X0,sK4(X0,X1,X2,X3))
& upper_bound(sK4(X0,X1,X2,X3),X2,X1)
& member(sK4(X0,X1,X2,X3),X3) )
| ~ upper_bound(X0,X2,X1)
| ~ member(X0,X1) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK4])],[f40,f46]) ).
fof(f46,plain,
! [X0,X1,X2,X3] :
( ? [X4] :
( ~ apply(X2,X0,X4)
& upper_bound(X4,X2,X1)
& member(X4,X3) )
=> ( ~ apply(X2,X0,sK4(X0,X1,X2,X3))
& upper_bound(sK4(X0,X1,X2,X3),X2,X1)
& member(sK4(X0,X1,X2,X3),X3) ) ),
introduced(choice_axiom,[]) ).
fof(f40,plain,
! [X0,X1,X2,X3] :
( least_upper_bound(X0,X1,X2,X3)
| ? [X4] :
( ~ apply(X2,X0,X4)
& upper_bound(X4,X2,X1)
& member(X4,X3) )
| ~ upper_bound(X0,X2,X1)
| ~ member(X0,X1) ),
inference(flattening,[],[f39]) ).
fof(f39,plain,
! [X0,X1,X2,X3] :
( least_upper_bound(X0,X1,X2,X3)
| ? [X4] :
( ~ apply(X2,X0,X4)
& upper_bound(X4,X2,X1)
& member(X4,X3) )
| ~ upper_bound(X0,X2,X1)
| ~ member(X0,X1) ),
inference(ennf_transformation,[],[f33]) ).
fof(f33,plain,
! [X0,X1,X2,X3] :
( ( ! [X4] :
( ( upper_bound(X4,X2,X1)
& member(X4,X3) )
=> apply(X2,X0,X4) )
& upper_bound(X0,X2,X1)
& member(X0,X1) )
=> least_upper_bound(X0,X1,X2,X3) ),
inference(unused_predicate_definition_removal,[],[f28]) ).
fof(f28,plain,
! [X0,X1,X2,X3] :
( least_upper_bound(X0,X1,X2,X3)
<=> ( ! [X4] :
( ( upper_bound(X4,X2,X1)
& member(X4,X3) )
=> apply(X2,X0,X4) )
& upper_bound(X0,X2,X1)
& member(X0,X1) ) ),
inference(rectify,[],[f20]) ).
fof(f20,axiom,
! [X0,X2,X5,X3] :
( least_upper_bound(X0,X2,X5,X3)
<=> ( ! [X7] :
( ( upper_bound(X7,X5,X2)
& member(X7,X3) )
=> apply(X5,X0,X7) )
& upper_bound(X0,X5,X2)
& member(X0,X2) ) ),
file('/export/starexec/sandbox/tmp/tmp.QeJRIJJpaO/Vampire---4.8_28380',least_upper_bound) ).
fof(f129,plain,
( ! [X0] :
( ~ upper_bound(sK4(sK3,unordered_pair(sK2,sK3),sK0,sK1),sK0,X0)
| ~ member(sK3,X0) )
| ~ spl6_1 ),
inference(subsumption_resolution,[],[f128,f72]) ).
fof(f128,plain,
( ! [X0] :
( ~ member(sK3,unordered_pair(sK2,sK3))
| ~ member(sK3,X0)
| ~ upper_bound(sK4(sK3,unordered_pair(sK2,sK3),sK0,sK1),sK0,X0) )
| ~ spl6_1 ),
inference(subsumption_resolution,[],[f127,f82]) ).
fof(f127,plain,
! [X0] :
( ~ upper_bound(sK3,sK0,unordered_pair(sK2,sK3))
| ~ member(sK3,unordered_pair(sK2,sK3))
| ~ member(sK3,X0)
| ~ upper_bound(sK4(sK3,unordered_pair(sK2,sK3),sK0,sK1),sK0,X0) ),
inference(resolution,[],[f93,f57]) ).
fof(f93,plain,
! [X2,X3,X0,X1,X4] :
( least_upper_bound(X0,X1,X2,X3)
| ~ upper_bound(X0,X2,X1)
| ~ member(X0,X1)
| ~ member(X0,X4)
| ~ upper_bound(sK4(X0,X1,X2,X3),X2,X4) ),
inference(resolution,[],[f66,f69]) ).
fof(f69,plain,
! [X2,X0,X1,X4] :
( apply(X0,X4,X2)
| ~ member(X4,X1)
| ~ upper_bound(X2,X0,X1) ),
inference(cnf_transformation,[],[f52]) ).
fof(f66,plain,
! [X2,X3,X0,X1] :
( ~ apply(X2,X0,sK4(X0,X1,X2,X3))
| least_upper_bound(X0,X1,X2,X3)
| ~ upper_bound(X0,X2,X1)
| ~ member(X0,X1) ),
inference(cnf_transformation,[],[f47]) ).
fof(f114,plain,
( spl6_1
| ~ spl6_3 ),
inference(avatar_contradiction_clause,[],[f113]) ).
fof(f113,plain,
( $false
| spl6_1
| ~ spl6_3 ),
inference(subsumption_resolution,[],[f112,f55]) ).
fof(f55,plain,
member(sK3,sK1),
inference(cnf_transformation,[],[f43]) ).
fof(f112,plain,
( ~ member(sK3,sK1)
| spl6_1
| ~ spl6_3 ),
inference(resolution,[],[f108,f53]) ).
fof(f53,plain,
order(sK0,sK1),
inference(cnf_transformation,[],[f43]) ).
fof(f108,plain,
( ! [X0] :
( ~ order(sK0,X0)
| ~ member(sK3,X0) )
| spl6_1
| ~ spl6_3 ),
inference(resolution,[],[f106,f58]) ).
fof(f58,plain,
! [X0,X1,X7] :
( apply(X0,X7,X7)
| ~ member(X7,X1)
| ~ order(X0,X1) ),
inference(cnf_transformation,[],[f38]) ).
fof(f38,plain,
! [X0,X1] :
( ( ! [X2,X3,X4] :
( apply(X0,X2,X4)
| ~ apply(X0,X3,X4)
| ~ apply(X0,X2,X3)
| ~ member(X4,X1)
| ~ member(X3,X1)
| ~ member(X2,X1) )
& ! [X5,X6] :
( X5 = X6
| ~ apply(X0,X6,X5)
| ~ apply(X0,X5,X6)
| ~ member(X6,X1)
| ~ member(X5,X1) )
& ! [X7] :
( apply(X0,X7,X7)
| ~ member(X7,X1) ) )
| ~ order(X0,X1) ),
inference(flattening,[],[f37]) ).
fof(f37,plain,
! [X0,X1] :
( ( ! [X2,X3,X4] :
( apply(X0,X2,X4)
| ~ apply(X0,X3,X4)
| ~ apply(X0,X2,X3)
| ~ member(X4,X1)
| ~ member(X3,X1)
| ~ member(X2,X1) )
& ! [X5,X6] :
( X5 = X6
| ~ apply(X0,X6,X5)
| ~ apply(X0,X5,X6)
| ~ member(X6,X1)
| ~ member(X5,X1) )
& ! [X7] :
( apply(X0,X7,X7)
| ~ member(X7,X1) ) )
| ~ order(X0,X1) ),
inference(ennf_transformation,[],[f34]) ).
fof(f34,plain,
! [X0,X1] :
( order(X0,X1)
=> ( ! [X2,X3,X4] :
( ( member(X4,X1)
& member(X3,X1)
& member(X2,X1) )
=> ( ( apply(X0,X3,X4)
& apply(X0,X2,X3) )
=> apply(X0,X2,X4) ) )
& ! [X5,X6] :
( ( member(X6,X1)
& member(X5,X1) )
=> ( ( apply(X0,X6,X5)
& apply(X0,X5,X6) )
=> X5 = X6 ) )
& ! [X7] :
( member(X7,X1)
=> apply(X0,X7,X7) ) ) ),
inference(unused_predicate_definition_removal,[],[f26]) ).
fof(f26,plain,
! [X0,X1] :
( order(X0,X1)
<=> ( ! [X2,X3,X4] :
( ( member(X4,X1)
& member(X3,X1)
& member(X2,X1) )
=> ( ( apply(X0,X3,X4)
& apply(X0,X2,X3) )
=> apply(X0,X2,X4) ) )
& ! [X5,X6] :
( ( member(X6,X1)
& member(X5,X1) )
=> ( ( apply(X0,X6,X5)
& apply(X0,X5,X6) )
=> X5 = X6 ) )
& ! [X7] :
( member(X7,X1)
=> apply(X0,X7,X7) ) ) ),
inference(rectify,[],[f12]) ).
fof(f12,axiom,
! [X5,X3] :
( order(X5,X3)
<=> ( ! [X2,X4,X6] :
( ( member(X6,X3)
& member(X4,X3)
& member(X2,X3) )
=> ( ( apply(X5,X4,X6)
& apply(X5,X2,X4) )
=> apply(X5,X2,X6) ) )
& ! [X2,X4] :
( ( member(X4,X3)
& member(X2,X3) )
=> ( ( apply(X5,X4,X2)
& apply(X5,X2,X4) )
=> X2 = X4 ) )
& ! [X2] :
( member(X2,X3)
=> apply(X5,X2,X2) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.QeJRIJJpaO/Vampire---4.8_28380',order) ).
fof(f106,plain,
( ~ apply(sK0,sK3,sK3)
| spl6_1
| ~ spl6_3 ),
inference(backward_demodulation,[],[f90,f98]) ).
fof(f98,plain,
( sK3 = sK5(sK0,unordered_pair(sK2,sK3),sK3)
| ~ spl6_3 ),
inference(avatar_component_clause,[],[f96]) ).
fof(f96,plain,
( spl6_3
<=> sK3 = sK5(sK0,unordered_pair(sK2,sK3),sK3) ),
introduced(avatar_definition,[new_symbols(naming,[spl6_3])]) ).
fof(f90,plain,
( ~ apply(sK0,sK5(sK0,unordered_pair(sK2,sK3),sK3),sK3)
| spl6_1 ),
inference(resolution,[],[f83,f71]) ).
fof(f103,plain,
( spl6_3
| spl6_4
| spl6_1 ),
inference(avatar_split_clause,[],[f94,f81,f100,f96]) ).
fof(f94,plain,
( sK2 = sK5(sK0,unordered_pair(sK2,sK3),sK3)
| sK3 = sK5(sK0,unordered_pair(sK2,sK3),sK3)
| spl6_1 ),
inference(resolution,[],[f91,f61]) ).
fof(f61,plain,
! [X2,X0,X1] :
( ~ member(X0,unordered_pair(X1,X2))
| X0 = X1
| X0 = X2 ),
inference(cnf_transformation,[],[f45]) ).
fof(f91,plain,
( member(sK5(sK0,unordered_pair(sK2,sK3),sK3),unordered_pair(sK2,sK3))
| spl6_1 ),
inference(resolution,[],[f83,f70]) ).
fof(f70,plain,
! [X2,X0,X1] :
( upper_bound(X2,X0,X1)
| member(sK5(X0,X1,X2),X1) ),
inference(cnf_transformation,[],[f52]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.13 % Problem : SET795+4 : TPTP v8.1.2. Released v3.2.0.
% 0.08/0.15 % Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% 0.14/0.36 % Computer : n019.cluster.edu
% 0.14/0.36 % Model : x86_64 x86_64
% 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36 % Memory : 8042.1875MB
% 0.14/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36 % CPULimit : 300
% 0.14/0.36 % WCLimit : 300
% 0.14/0.36 % DateTime : Tue Apr 30 17:15:14 EDT 2024
% 0.14/0.36 % CPUTime :
% 0.14/0.36 This is a FOF_THM_RFO_SEQ problem
% 0.14/0.37 Running vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t 300 /export/starexec/sandbox/tmp/tmp.QeJRIJJpaO/Vampire---4.8_28380
% 0.64/0.82 % (28638)lrs+21_1:5_sil=2000:sos=on:urr=on:newcnf=on:slsq=on:i=83:slsql=off:bd=off:nm=2:ss=axioms:st=1.5:sp=const_min:gsp=on:rawr=on_0 on Vampire---4 for (2995ds/83Mi)
% 0.64/0.82 % (28639)lrs-21_1:1_to=lpo:sil=2000:sp=frequency:sos=on:lma=on:i=56:sd=2:ss=axioms:ep=R_0 on Vampire---4 for (2995ds/56Mi)
% 0.64/0.82 % (28632)dis-1011_2:1_sil=2000:lsd=20:nwc=5.0:flr=on:mep=off:st=3.0:i=34:sd=1:ep=RS:ss=axioms_0 on Vampire---4 for (2995ds/34Mi)
% 0.64/0.82 % (28634)lrs+1011_1:1_sil=8000:sp=occurrence:nwc=10.0:i=78:ss=axioms:sgt=8_0 on Vampire---4 for (2995ds/78Mi)
% 0.64/0.82 % (28635)ott+1011_1:1_sil=2000:urr=on:i=33:sd=1:kws=inv_frequency:ss=axioms:sup=off_0 on Vampire---4 for (2995ds/33Mi)
% 0.64/0.82 % (28633)lrs+1011_461:32768_sil=16000:irw=on:sp=frequency:lsd=20:fd=preordered:nwc=10.0:s2agt=32:alpa=false:cond=fast:s2a=on:i=51:s2at=3.0:awrs=decay:awrsf=691:bd=off:nm=20:fsr=off:amm=sco:uhcvi=on:rawr=on_0 on Vampire---4 for (2995ds/51Mi)
% 0.64/0.82 % (28637)lrs+1002_1:16_to=lpo:sil=32000:sp=unary_frequency:sos=on:i=45:bd=off:ss=axioms_0 on Vampire---4 for (2995ds/45Mi)
% 0.64/0.82 % (28636)lrs+2_1:1_sil=16000:fde=none:sos=all:nwc=5.0:i=34:ep=RS:s2pl=on:lma=on:afp=100000_0 on Vampire---4 for (2995ds/34Mi)
% 0.64/0.82 % (28639)Refutation not found, incomplete strategy% (28639)------------------------------
% 0.64/0.82 % (28639)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.64/0.82 % (28639)Termination reason: Refutation not found, incomplete strategy
% 0.64/0.82
% 0.64/0.82 % (28639)Memory used [KB]: 1065
% 0.64/0.82 % (28639)Time elapsed: 0.002 s
% 0.64/0.82 % (28639)Instructions burned: 3 (million)
% 0.64/0.82 % (28639)------------------------------
% 0.64/0.82 % (28639)------------------------------
% 0.64/0.82 % (28635)Refutation not found, incomplete strategy% (28635)------------------------------
% 0.64/0.82 % (28635)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.64/0.82 % (28640)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 Vampire---4 for (2995ds/55Mi)
% 0.64/0.82 % (28635)Termination reason: Refutation not found, incomplete strategy
% 0.64/0.82
% 0.64/0.82 % (28635)Memory used [KB]: 1069
% 0.64/0.82 % (28635)Time elapsed: 0.004 s
% 0.64/0.82 % (28635)Instructions burned: 5 (million)
% 0.64/0.82 % (28635)------------------------------
% 0.64/0.82 % (28635)------------------------------
% 0.64/0.82 % (28640)Refutation not found, incomplete strategy% (28640)------------------------------
% 0.64/0.82 % (28640)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.64/0.82 % (28640)Termination reason: Refutation not found, incomplete strategy
% 0.64/0.82
% 0.64/0.82 % (28634)First to succeed.
% 0.64/0.82 % (28640)Memory used [KB]: 1061
% 0.64/0.82 % (28640)Time elapsed: 0.002 s
% 0.64/0.82 % (28640)Instructions burned: 4 (million)
% 0.64/0.82 % (28640)------------------------------
% 0.64/0.82 % (28640)------------------------------
% 0.64/0.82 % (28634)Refutation found. Thanks to Tanya!
% 0.64/0.82 % SZS status Theorem for Vampire---4
% 0.64/0.82 % SZS output start Proof for Vampire---4
% See solution above
% 0.64/0.82 % (28634)------------------------------
% 0.64/0.82 % (28634)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.64/0.82 % (28634)Termination reason: Refutation
% 0.64/0.82
% 0.64/0.82 % (28634)Memory used [KB]: 1098
% 0.64/0.82 % (28634)Time elapsed: 0.007 s
% 0.64/0.82 % (28634)Instructions burned: 10 (million)
% 0.64/0.82 % (28634)------------------------------
% 0.64/0.82 % (28634)------------------------------
% 0.64/0.82 % (28619)Success in time 0.445 s
% 0.64/0.82 % Vampire---4.8 exiting
%------------------------------------------------------------------------------