TSTP Solution File: SET801+4 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SET801+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 : n002.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:02 EDT 2024
% Result : Theorem 0.61s 0.82s
% Output : Refutation 0.61s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 15
% Syntax : Number of formulae : 89 ( 2 unt; 0 def)
% Number of atoms : 379 ( 0 equ)
% Maximal formula atoms : 16 ( 4 avg)
% Number of connectives : 444 ( 154 ~; 158 |; 95 &)
% ( 18 <=>; 18 =>; 0 <=; 1 <~>)
% Maximal formula depth : 12 ( 6 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 13 ( 12 usr; 6 prp; 0-4 aty)
% Number of functors : 7 ( 7 usr; 4 con; 0-4 aty)
% Number of variables : 185 ( 152 !; 33 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f160,plain,
$false,
inference(avatar_sat_refutation,[],[f93,f94,f109,f130,f136,f141,f159]) ).
fof(f159,plain,
( ~ spl8_5
| spl8_6 ),
inference(avatar_contradiction_clause,[],[f158]) ).
fof(f158,plain,
( $false
| ~ spl8_5
| spl8_6 ),
inference(subsumption_resolution,[],[f157,f95]) ).
fof(f95,plain,
member(sK3,sK2),
inference(subsumption_resolution,[],[f61,f68]) ).
fof(f68,plain,
! [X2,X0,X1] :
( ~ greatest(X2,X0,X1)
| member(X2,X1) ),
inference(cnf_transformation,[],[f49]) ).
fof(f49,plain,
! [X0,X1,X2] :
( ( greatest(X2,X0,X1)
| ( ~ apply(X0,sK4(X0,X1,X2),X2)
& member(sK4(X0,X1,X2),X1) )
| ~ member(X2,X1) )
& ( ( ! [X4] :
( apply(X0,X4,X2)
| ~ member(X4,X1) )
& member(X2,X1) )
| ~ greatest(X2,X0,X1) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK4])],[f47,f48]) ).
fof(f48,plain,
! [X0,X1,X2] :
( ? [X3] :
( ~ apply(X0,X3,X2)
& member(X3,X1) )
=> ( ~ apply(X0,sK4(X0,X1,X2),X2)
& member(sK4(X0,X1,X2),X1) ) ),
introduced(choice_axiom,[]) ).
fof(f47,plain,
! [X0,X1,X2] :
( ( greatest(X2,X0,X1)
| ? [X3] :
( ~ apply(X0,X3,X2)
& member(X3,X1) )
| ~ member(X2,X1) )
& ( ( ! [X4] :
( apply(X0,X4,X2)
| ~ member(X4,X1) )
& member(X2,X1) )
| ~ greatest(X2,X0,X1) ) ),
inference(rectify,[],[f46]) ).
fof(f46,plain,
! [X0,X1,X2] :
( ( greatest(X2,X0,X1)
| ? [X3] :
( ~ apply(X0,X3,X2)
& member(X3,X1) )
| ~ member(X2,X1) )
& ( ( ! [X3] :
( apply(X0,X3,X2)
| ~ member(X3,X1) )
& member(X2,X1) )
| ~ greatest(X2,X0,X1) ) ),
inference(flattening,[],[f45]) ).
fof(f45,plain,
! [X0,X1,X2] :
( ( greatest(X2,X0,X1)
| ? [X3] :
( ~ apply(X0,X3,X2)
& member(X3,X1) )
| ~ member(X2,X1) )
& ( ( ! [X3] :
( apply(X0,X3,X2)
| ~ member(X3,X1) )
& member(X2,X1) )
| ~ greatest(X2,X0,X1) ) ),
inference(nnf_transformation,[],[f35]) ).
fof(f35,plain,
! [X0,X1,X2] :
( greatest(X2,X0,X1)
<=> ( ! [X3] :
( apply(X0,X3,X2)
| ~ member(X3,X1) )
& member(X2,X1) ) ),
inference(ennf_transformation,[],[f26]) ).
fof(f26,plain,
! [X0,X1,X2] :
( greatest(X2,X0,X1)
<=> ( ! [X3] :
( member(X3,X1)
=> apply(X0,X3,X2) )
& member(X2,X1) ) ),
inference(rectify,[],[f16]) ).
fof(f16,axiom,
! [X5,X3,X7] :
( greatest(X7,X5,X3)
<=> ( ! [X2] :
( member(X2,X3)
=> apply(X5,X2,X7) )
& member(X7,X3) ) ),
file('/export/starexec/sandbox/tmp/tmp.Iwm356XyML/Vampire---4.8_22535',greatest) ).
fof(f61,plain,
( member(sK3,sK2)
| greatest(sK3,sK0,sK2) ),
inference(cnf_transformation,[],[f44]) ).
fof(f44,plain,
( ( ~ least_upper_bound(sK3,sK2,sK0,sK1)
| ~ member(sK3,sK2)
| ~ greatest(sK3,sK0,sK2) )
& ( ( least_upper_bound(sK3,sK2,sK0,sK1)
& member(sK3,sK2) )
| greatest(sK3,sK0,sK2) )
& subset(sK2,sK1)
& order(sK0,sK1) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3])],[f40,f43,f42,f41]) ).
fof(f41,plain,
( ? [X0,X1] :
( ? [X2] :
( ? [X3] :
( ( ~ least_upper_bound(X3,X2,X0,X1)
| ~ member(X3,X2)
| ~ greatest(X3,X0,X2) )
& ( ( least_upper_bound(X3,X2,X0,X1)
& member(X3,X2) )
| greatest(X3,X0,X2) ) )
& subset(X2,X1) )
& order(X0,X1) )
=> ( ? [X2] :
( ? [X3] :
( ( ~ least_upper_bound(X3,X2,sK0,sK1)
| ~ member(X3,X2)
| ~ greatest(X3,sK0,X2) )
& ( ( least_upper_bound(X3,X2,sK0,sK1)
& member(X3,X2) )
| greatest(X3,sK0,X2) ) )
& subset(X2,sK1) )
& order(sK0,sK1) ) ),
introduced(choice_axiom,[]) ).
fof(f42,plain,
( ? [X2] :
( ? [X3] :
( ( ~ least_upper_bound(X3,X2,sK0,sK1)
| ~ member(X3,X2)
| ~ greatest(X3,sK0,X2) )
& ( ( least_upper_bound(X3,X2,sK0,sK1)
& member(X3,X2) )
| greatest(X3,sK0,X2) ) )
& subset(X2,sK1) )
=> ( ? [X3] :
( ( ~ least_upper_bound(X3,sK2,sK0,sK1)
| ~ member(X3,sK2)
| ~ greatest(X3,sK0,sK2) )
& ( ( least_upper_bound(X3,sK2,sK0,sK1)
& member(X3,sK2) )
| greatest(X3,sK0,sK2) ) )
& subset(sK2,sK1) ) ),
introduced(choice_axiom,[]) ).
fof(f43,plain,
( ? [X3] :
( ( ~ least_upper_bound(X3,sK2,sK0,sK1)
| ~ member(X3,sK2)
| ~ greatest(X3,sK0,sK2) )
& ( ( least_upper_bound(X3,sK2,sK0,sK1)
& member(X3,sK2) )
| greatest(X3,sK0,sK2) ) )
=> ( ( ~ least_upper_bound(sK3,sK2,sK0,sK1)
| ~ member(sK3,sK2)
| ~ greatest(sK3,sK0,sK2) )
& ( ( least_upper_bound(sK3,sK2,sK0,sK1)
& member(sK3,sK2) )
| greatest(sK3,sK0,sK2) ) ) ),
introduced(choice_axiom,[]) ).
fof(f40,plain,
? [X0,X1] :
( ? [X2] :
( ? [X3] :
( ( ~ least_upper_bound(X3,X2,X0,X1)
| ~ member(X3,X2)
| ~ greatest(X3,X0,X2) )
& ( ( least_upper_bound(X3,X2,X0,X1)
& member(X3,X2) )
| greatest(X3,X0,X2) ) )
& subset(X2,X1) )
& order(X0,X1) ),
inference(flattening,[],[f39]) ).
fof(f39,plain,
? [X0,X1] :
( ? [X2] :
( ? [X3] :
( ( ~ least_upper_bound(X3,X2,X0,X1)
| ~ member(X3,X2)
| ~ greatest(X3,X0,X2) )
& ( ( least_upper_bound(X3,X2,X0,X1)
& member(X3,X2) )
| greatest(X3,X0,X2) ) )
& subset(X2,X1) )
& order(X0,X1) ),
inference(nnf_transformation,[],[f31]) ).
fof(f31,plain,
? [X0,X1] :
( ? [X2] :
( ? [X3] :
( greatest(X3,X0,X2)
<~> ( least_upper_bound(X3,X2,X0,X1)
& member(X3,X2) ) )
& subset(X2,X1) )
& order(X0,X1) ),
inference(ennf_transformation,[],[f24]) ).
fof(f24,plain,
~ ! [X0,X1] :
( order(X0,X1)
=> ! [X2] :
( subset(X2,X1)
=> ! [X3] :
( greatest(X3,X0,X2)
<=> ( least_upper_bound(X3,X2,X0,X1)
& member(X3,X2) ) ) ) ),
inference(rectify,[],[f23]) ).
fof(f23,negated_conjecture,
~ ! [X5,X3] :
( order(X5,X3)
=> ! [X2] :
( subset(X2,X3)
=> ! [X7] :
( greatest(X7,X5,X2)
<=> ( least_upper_bound(X7,X2,X5,X3)
& member(X7,X2) ) ) ) ),
inference(negated_conjecture,[],[f22]) ).
fof(f22,conjecture,
! [X5,X3] :
( order(X5,X3)
=> ! [X2] :
( subset(X2,X3)
=> ! [X7] :
( greatest(X7,X5,X2)
<=> ( least_upper_bound(X7,X2,X5,X3)
& member(X7,X2) ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.Iwm356XyML/Vampire---4.8_22535',thIV13) ).
fof(f157,plain,
( ~ member(sK3,sK2)
| ~ spl8_5
| spl8_6 ),
inference(resolution,[],[f143,f135]) ).
fof(f135,plain,
( ~ apply(sK0,sK3,sK5(sK3,sK2,sK0,sK1))
| spl8_6 ),
inference(avatar_component_clause,[],[f133]) ).
fof(f133,plain,
( spl8_6
<=> apply(sK0,sK3,sK5(sK3,sK2,sK0,sK1)) ),
introduced(avatar_definition,[new_symbols(naming,[spl8_6])]) ).
fof(f143,plain,
( ! [X0] :
( apply(sK0,X0,sK5(sK3,sK2,sK0,sK1))
| ~ member(X0,sK2) )
| ~ spl8_5 ),
inference(resolution,[],[f129,f78]) ).
fof(f78,plain,
! [X2,X0,X1,X4] :
( ~ upper_bound(X2,X0,X1)
| ~ member(X4,X1)
| apply(X0,X4,X2) ),
inference(cnf_transformation,[],[f58]) ).
fof(f58,plain,
! [X0,X1,X2] :
( ( upper_bound(X2,X0,X1)
| ( ~ apply(X0,sK6(X0,X1,X2),X2)
& member(sK6(X0,X1,X2),X1) ) )
& ( ! [X4] :
( apply(X0,X4,X2)
| ~ member(X4,X1) )
| ~ upper_bound(X2,X0,X1) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK6])],[f56,f57]) ).
fof(f57,plain,
! [X0,X1,X2] :
( ? [X3] :
( ~ apply(X0,X3,X2)
& member(X3,X1) )
=> ( ~ apply(X0,sK6(X0,X1,X2),X2)
& member(sK6(X0,X1,X2),X1) ) ),
introduced(choice_axiom,[]) ).
fof(f56,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,[],[f55]) ).
fof(f55,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,[],[f38]) ).
fof(f38,plain,
! [X0,X1,X2] :
( upper_bound(X2,X0,X1)
<=> ! [X3] :
( apply(X0,X3,X2)
| ~ member(X3,X1) ) ),
inference(ennf_transformation,[],[f28]) ).
fof(f28,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.Iwm356XyML/Vampire---4.8_22535',upper_bound) ).
fof(f129,plain,
( upper_bound(sK5(sK3,sK2,sK0,sK1),sK0,sK2)
| ~ spl8_5 ),
inference(avatar_component_clause,[],[f127]) ).
fof(f127,plain,
( spl8_5
<=> upper_bound(sK5(sK3,sK2,sK0,sK1),sK0,sK2) ),
introduced(avatar_definition,[new_symbols(naming,[spl8_5])]) ).
fof(f141,plain,
( ~ spl8_1
| spl8_3 ),
inference(avatar_contradiction_clause,[],[f140]) ).
fof(f140,plain,
( $false
| ~ spl8_1
| spl8_3 ),
inference(subsumption_resolution,[],[f139,f137]) ).
fof(f137,plain,
( member(sK6(sK0,sK2,sK3),sK2)
| spl8_3 ),
inference(resolution,[],[f119,f79]) ).
fof(f79,plain,
! [X2,X0,X1] :
( upper_bound(X2,X0,X1)
| member(sK6(X0,X1,X2),X1) ),
inference(cnf_transformation,[],[f58]) ).
fof(f119,plain,
( ~ upper_bound(sK3,sK0,sK2)
| spl8_3 ),
inference(avatar_component_clause,[],[f117]) ).
fof(f117,plain,
( spl8_3
<=> upper_bound(sK3,sK0,sK2) ),
introduced(avatar_definition,[new_symbols(naming,[spl8_3])]) ).
fof(f139,plain,
( ~ member(sK6(sK0,sK2,sK3),sK2)
| ~ spl8_1
| spl8_3 ),
inference(resolution,[],[f138,f111]) ).
fof(f111,plain,
( ! [X0] :
( apply(sK0,X0,sK3)
| ~ member(X0,sK2) )
| ~ spl8_1 ),
inference(resolution,[],[f87,f69]) ).
fof(f69,plain,
! [X2,X0,X1,X4] :
( ~ greatest(X2,X0,X1)
| ~ member(X4,X1)
| apply(X0,X4,X2) ),
inference(cnf_transformation,[],[f49]) ).
fof(f87,plain,
( greatest(sK3,sK0,sK2)
| ~ spl8_1 ),
inference(avatar_component_clause,[],[f86]) ).
fof(f86,plain,
( spl8_1
<=> greatest(sK3,sK0,sK2) ),
introduced(avatar_definition,[new_symbols(naming,[spl8_1])]) ).
fof(f138,plain,
( ~ apply(sK0,sK6(sK0,sK2,sK3),sK3)
| spl8_3 ),
inference(resolution,[],[f119,f80]) ).
fof(f80,plain,
! [X2,X0,X1] :
( upper_bound(X2,X0,X1)
| ~ apply(X0,sK6(X0,X1,X2),X2) ),
inference(cnf_transformation,[],[f58]) ).
fof(f136,plain,
( ~ spl8_3
| ~ spl8_6
| spl8_2 ),
inference(avatar_split_clause,[],[f131,f90,f133,f117]) ).
fof(f90,plain,
( spl8_2
<=> least_upper_bound(sK3,sK2,sK0,sK1) ),
introduced(avatar_definition,[new_symbols(naming,[spl8_2])]) ).
fof(f131,plain,
( ~ apply(sK0,sK3,sK5(sK3,sK2,sK0,sK1))
| ~ upper_bound(sK3,sK0,sK2)
| spl8_2 ),
inference(subsumption_resolution,[],[f114,f95]) ).
fof(f114,plain,
( ~ apply(sK0,sK3,sK5(sK3,sK2,sK0,sK1))
| ~ upper_bound(sK3,sK0,sK2)
| ~ member(sK3,sK2)
| spl8_2 ),
inference(resolution,[],[f92,f77]) ).
fof(f77,plain,
! [X2,X3,X0,X1] :
( least_upper_bound(X0,X1,X2,X3)
| ~ apply(X2,X0,sK5(X0,X1,X2,X3))
| ~ upper_bound(X0,X2,X1)
| ~ member(X0,X1) ),
inference(cnf_transformation,[],[f54]) ).
fof(f54,plain,
! [X0,X1,X2,X3] :
( ( least_upper_bound(X0,X1,X2,X3)
| ( ~ apply(X2,X0,sK5(X0,X1,X2,X3))
& upper_bound(sK5(X0,X1,X2,X3),X2,X1)
& member(sK5(X0,X1,X2,X3),X3) )
| ~ upper_bound(X0,X2,X1)
| ~ member(X0,X1) )
& ( ( ! [X5] :
( apply(X2,X0,X5)
| ~ upper_bound(X5,X2,X1)
| ~ member(X5,X3) )
& upper_bound(X0,X2,X1)
& member(X0,X1) )
| ~ least_upper_bound(X0,X1,X2,X3) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK5])],[f52,f53]) ).
fof(f53,plain,
! [X0,X1,X2,X3] :
( ? [X4] :
( ~ apply(X2,X0,X4)
& upper_bound(X4,X2,X1)
& member(X4,X3) )
=> ( ~ apply(X2,X0,sK5(X0,X1,X2,X3))
& upper_bound(sK5(X0,X1,X2,X3),X2,X1)
& member(sK5(X0,X1,X2,X3),X3) ) ),
introduced(choice_axiom,[]) ).
fof(f52,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) )
& ( ( ! [X5] :
( apply(X2,X0,X5)
| ~ upper_bound(X5,X2,X1)
| ~ member(X5,X3) )
& upper_bound(X0,X2,X1)
& member(X0,X1) )
| ~ least_upper_bound(X0,X1,X2,X3) ) ),
inference(rectify,[],[f51]) ).
fof(f51,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) )
& ( ( ! [X4] :
( apply(X2,X0,X4)
| ~ upper_bound(X4,X2,X1)
| ~ member(X4,X3) )
& upper_bound(X0,X2,X1)
& member(X0,X1) )
| ~ least_upper_bound(X0,X1,X2,X3) ) ),
inference(flattening,[],[f50]) ).
fof(f50,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) )
& ( ( ! [X4] :
( apply(X2,X0,X4)
| ~ upper_bound(X4,X2,X1)
| ~ member(X4,X3) )
& upper_bound(X0,X2,X1)
& member(X0,X1) )
| ~ least_upper_bound(X0,X1,X2,X3) ) ),
inference(nnf_transformation,[],[f37]) ).
fof(f37,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,[],[f36]) ).
fof(f36,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,[],[f27]) ).
fof(f27,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.Iwm356XyML/Vampire---4.8_22535',least_upper_bound) ).
fof(f92,plain,
( ~ least_upper_bound(sK3,sK2,sK0,sK1)
| spl8_2 ),
inference(avatar_component_clause,[],[f90]) ).
fof(f130,plain,
( ~ spl8_3
| spl8_5
| spl8_2 ),
inference(avatar_split_clause,[],[f125,f90,f127,f117]) ).
fof(f125,plain,
( upper_bound(sK5(sK3,sK2,sK0,sK1),sK0,sK2)
| ~ upper_bound(sK3,sK0,sK2)
| spl8_2 ),
inference(subsumption_resolution,[],[f113,f95]) ).
fof(f113,plain,
( upper_bound(sK5(sK3,sK2,sK0,sK1),sK0,sK2)
| ~ upper_bound(sK3,sK0,sK2)
| ~ member(sK3,sK2)
| spl8_2 ),
inference(resolution,[],[f92,f76]) ).
fof(f76,plain,
! [X2,X3,X0,X1] :
( least_upper_bound(X0,X1,X2,X3)
| upper_bound(sK5(X0,X1,X2,X3),X2,X1)
| ~ upper_bound(X0,X2,X1)
| ~ member(X0,X1) ),
inference(cnf_transformation,[],[f54]) ).
fof(f109,plain,
( spl8_1
| ~ spl8_2 ),
inference(avatar_contradiction_clause,[],[f108]) ).
fof(f108,plain,
( $false
| spl8_1
| ~ spl8_2 ),
inference(subsumption_resolution,[],[f107,f101]) ).
fof(f101,plain,
( member(sK4(sK0,sK2,sK3),sK2)
| spl8_1 ),
inference(subsumption_resolution,[],[f99,f95]) ).
fof(f99,plain,
( member(sK4(sK0,sK2,sK3),sK2)
| ~ member(sK3,sK2)
| spl8_1 ),
inference(resolution,[],[f88,f70]) ).
fof(f70,plain,
! [X2,X0,X1] :
( greatest(X2,X0,X1)
| member(sK4(X0,X1,X2),X1)
| ~ member(X2,X1) ),
inference(cnf_transformation,[],[f49]) ).
fof(f88,plain,
( ~ greatest(sK3,sK0,sK2)
| spl8_1 ),
inference(avatar_component_clause,[],[f86]) ).
fof(f107,plain,
( ~ member(sK4(sK0,sK2,sK3),sK2)
| spl8_1
| ~ spl8_2 ),
inference(resolution,[],[f106,f102]) ).
fof(f102,plain,
( ~ apply(sK0,sK4(sK0,sK2,sK3),sK3)
| spl8_1 ),
inference(subsumption_resolution,[],[f100,f95]) ).
fof(f100,plain,
( ~ apply(sK0,sK4(sK0,sK2,sK3),sK3)
| ~ member(sK3,sK2)
| spl8_1 ),
inference(resolution,[],[f88,f71]) ).
fof(f71,plain,
! [X2,X0,X1] :
( greatest(X2,X0,X1)
| ~ apply(X0,sK4(X0,X1,X2),X2)
| ~ member(X2,X1) ),
inference(cnf_transformation,[],[f49]) ).
fof(f106,plain,
( ! [X0] :
( apply(sK0,X0,sK3)
| ~ member(X0,sK2) )
| ~ spl8_2 ),
inference(resolution,[],[f104,f78]) ).
fof(f104,plain,
( upper_bound(sK3,sK0,sK2)
| ~ spl8_2 ),
inference(resolution,[],[f91,f73]) ).
fof(f73,plain,
! [X2,X3,X0,X1] :
( ~ least_upper_bound(X0,X1,X2,X3)
| upper_bound(X0,X2,X1) ),
inference(cnf_transformation,[],[f54]) ).
fof(f91,plain,
( least_upper_bound(sK3,sK2,sK0,sK1)
| ~ spl8_2 ),
inference(avatar_component_clause,[],[f90]) ).
fof(f94,plain,
( spl8_1
| spl8_2 ),
inference(avatar_split_clause,[],[f62,f90,f86]) ).
fof(f62,plain,
( least_upper_bound(sK3,sK2,sK0,sK1)
| greatest(sK3,sK0,sK2) ),
inference(cnf_transformation,[],[f44]) ).
fof(f93,plain,
( ~ spl8_1
| ~ spl8_2 ),
inference(avatar_split_clause,[],[f84,f90,f86]) ).
fof(f84,plain,
( ~ least_upper_bound(sK3,sK2,sK0,sK1)
| ~ greatest(sK3,sK0,sK2) ),
inference(subsumption_resolution,[],[f63,f68]) ).
fof(f63,plain,
( ~ least_upper_bound(sK3,sK2,sK0,sK1)
| ~ member(sK3,sK2)
| ~ greatest(sK3,sK0,sK2) ),
inference(cnf_transformation,[],[f44]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11 % Problem : SET801+4 : TPTP v8.1.2. Released v3.2.0.
% 0.12/0.12 % 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.12/0.33 % Computer : n002.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 Apr 30 17:37:55 EDT 2024
% 0.12/0.33 % CPUTime :
% 0.12/0.33 This is a FOF_THM_RFO_SEQ problem
% 0.12/0.33 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.Iwm356XyML/Vampire---4.8_22535
% 0.61/0.81 % (22649)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.61/0.81 % (22648)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.61/0.81 % (22645)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.61/0.81 % (22647)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.61/0.81 % (22646)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.61/0.81 % (22650)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.61/0.81 % (22651)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.61/0.81 % (22652)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.61/0.82 % (22652)First to succeed.
% 0.61/0.82 % (22651)Also succeeded, but the first one will report.
% 0.61/0.82 % (22652)Refutation found. Thanks to Tanya!
% 0.61/0.82 % SZS status Theorem for Vampire---4
% 0.61/0.82 % SZS output start Proof for Vampire---4
% See solution above
% 0.61/0.82 % (22652)------------------------------
% 0.61/0.82 % (22652)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.61/0.82 % (22652)Termination reason: Refutation
% 0.61/0.82
% 0.61/0.82 % (22652)Memory used [KB]: 1106
% 0.61/0.82 % (22652)Time elapsed: 0.005 s
% 0.61/0.82 % (22652)Instructions burned: 8 (million)
% 0.61/0.82 % (22652)------------------------------
% 0.61/0.82 % (22652)------------------------------
% 0.61/0.82 % (22644)Success in time 0.487 s
% 0.61/0.82 % Vampire---4.8 exiting
%------------------------------------------------------------------------------