TSTP Solution File: SET805+4 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SET805+4 : TPTP v8.2.0. 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 : Tue May 21 03:13:21 EDT 2024
% Result : Theorem 0.70s 0.88s
% Output : Refutation 0.70s
% Verified :
% SZS Type : Refutation
% Derivation depth : 15
% Number of leaves : 12
% Syntax : Number of formulae : 90 ( 8 unt; 0 def)
% Number of atoms : 390 ( 16 equ)
% Maximal formula atoms : 14 ( 4 avg)
% Number of connectives : 459 ( 159 ~; 167 |; 99 &)
% ( 10 <=>; 24 =>; 0 <=; 0 <~>)
% Maximal formula depth : 14 ( 6 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 10 ( 8 usr; 3 prp; 0-3 aty)
% Number of functors : 9 ( 9 usr; 3 con; 0-2 aty)
% Number of variables : 185 ( 158 !; 27 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f150,plain,
$false,
inference(avatar_sat_refutation,[],[f119,f139,f149]) ).
fof(f149,plain,
( ~ spl11_2
| ~ spl11_3 ),
inference(avatar_contradiction_clause,[],[f148]) ).
fof(f148,plain,
( $false
| ~ spl11_2
| ~ spl11_3 ),
inference(subsumption_resolution,[],[f146,f142]) ).
fof(f142,plain,
( member(sK10(sK2,sK4),sK4)
| ~ spl11_2
| ~ spl11_3 ),
inference(unit_resulting_resolution,[],[f52,f81,f85,f70]) ).
fof(f70,plain,
! [X0,X1] :
( member(sK10(X0,X1),X1)
| ~ sP0(X0,X1)
| ~ sP1(X0,X1)
| order(X0,X1) ),
inference(cnf_transformation,[],[f49]) ).
fof(f49,plain,
! [X0,X1] :
( ( order(X0,X1)
| ~ sP0(X0,X1)
| ~ sP1(X0,X1)
| ( ~ apply(X0,sK10(X0,X1),sK10(X0,X1))
& member(sK10(X0,X1),X1) ) )
& ( ( sP0(X0,X1)
& sP1(X0,X1)
& ! [X3] :
( apply(X0,X3,X3)
| ~ member(X3,X1) ) )
| ~ order(X0,X1) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK10])],[f47,f48]) ).
fof(f48,plain,
! [X0,X1] :
( ? [X2] :
( ~ apply(X0,X2,X2)
& member(X2,X1) )
=> ( ~ apply(X0,sK10(X0,X1),sK10(X0,X1))
& member(sK10(X0,X1),X1) ) ),
introduced(choice_axiom,[]) ).
fof(f47,plain,
! [X0,X1] :
( ( order(X0,X1)
| ~ sP0(X0,X1)
| ~ sP1(X0,X1)
| ? [X2] :
( ~ apply(X0,X2,X2)
& member(X2,X1) ) )
& ( ( sP0(X0,X1)
& sP1(X0,X1)
& ! [X3] :
( apply(X0,X3,X3)
| ~ member(X3,X1) ) )
| ~ order(X0,X1) ) ),
inference(rectify,[],[f46]) ).
fof(f46,plain,
! [X0,X1] :
( ( order(X0,X1)
| ~ sP0(X0,X1)
| ~ sP1(X0,X1)
| ? [X7] :
( ~ apply(X0,X7,X7)
& member(X7,X1) ) )
& ( ( sP0(X0,X1)
& sP1(X0,X1)
& ! [X7] :
( apply(X0,X7,X7)
| ~ member(X7,X1) ) )
| ~ order(X0,X1) ) ),
inference(flattening,[],[f45]) ).
fof(f45,plain,
! [X0,X1] :
( ( order(X0,X1)
| ~ sP0(X0,X1)
| ~ sP1(X0,X1)
| ? [X7] :
( ~ apply(X0,X7,X7)
& member(X7,X1) ) )
& ( ( sP0(X0,X1)
& sP1(X0,X1)
& ! [X7] :
( apply(X0,X7,X7)
| ~ member(X7,X1) ) )
| ~ order(X0,X1) ) ),
inference(nnf_transformation,[],[f33]) ).
fof(f33,plain,
! [X0,X1] :
( order(X0,X1)
<=> ( sP0(X0,X1)
& sP1(X0,X1)
& ! [X7] :
( apply(X0,X7,X7)
| ~ member(X7,X1) ) ) ),
inference(definition_folding,[],[f30,f32,f31]) ).
fof(f31,plain,
! [X0,X1] :
( sP0(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) ) ),
introduced(predicate_definition_introduction,[new_symbols(naming,[sP0])]) ).
fof(f32,plain,
! [X0,X1] :
( sP1(X0,X1)
<=> ! [X5,X6] :
( X5 = X6
| ~ apply(X0,X6,X5)
| ~ apply(X0,X5,X6)
| ~ member(X6,X1)
| ~ member(X5,X1) ) ),
introduced(predicate_definition_introduction,[new_symbols(naming,[sP1])]) ).
fof(f30,plain,
! [X0,X1] :
( order(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) ) ) ),
inference(flattening,[],[f29]) ).
fof(f29,plain,
! [X0,X1] :
( order(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) ) ) ),
inference(ennf_transformation,[],[f25]) ).
fof(f25,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/benchmark/theBenchmark.p',order) ).
fof(f85,plain,
( sP1(sK2,sK4)
| ~ spl11_3 ),
inference(avatar_component_clause,[],[f84]) ).
fof(f84,plain,
( spl11_3
<=> sP1(sK2,sK4) ),
introduced(avatar_definition,[new_symbols(naming,[spl11_3])]) ).
fof(f81,plain,
( sP0(sK2,sK4)
| ~ spl11_2 ),
inference(avatar_component_clause,[],[f80]) ).
fof(f80,plain,
( spl11_2
<=> sP0(sK2,sK4) ),
introduced(avatar_definition,[new_symbols(naming,[spl11_2])]) ).
fof(f52,plain,
~ order(sK2,sK4),
inference(cnf_transformation,[],[f36]) ).
fof(f36,plain,
( ~ order(sK2,sK4)
& subset(sK4,sK3)
& order(sK2,sK3) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK2,sK3,sK4])],[f27,f35,f34]) ).
fof(f34,plain,
( ? [X0,X1] :
( ? [X2] :
( ~ order(X0,X2)
& subset(X2,X1) )
& order(X0,X1) )
=> ( ? [X2] :
( ~ order(sK2,X2)
& subset(X2,sK3) )
& order(sK2,sK3) ) ),
introduced(choice_axiom,[]) ).
fof(f35,plain,
( ? [X2] :
( ~ order(sK2,X2)
& subset(X2,sK3) )
=> ( ~ order(sK2,sK4)
& subset(sK4,sK3) ) ),
introduced(choice_axiom,[]) ).
fof(f27,plain,
? [X0,X1] :
( ? [X2] :
( ~ order(X0,X2)
& subset(X2,X1) )
& order(X0,X1) ),
inference(ennf_transformation,[],[f24]) ).
fof(f24,plain,
~ ! [X0,X1] :
( order(X0,X1)
=> ! [X2] :
( subset(X2,X1)
=> order(X0,X2) ) ),
inference(rectify,[],[f23]) ).
fof(f23,negated_conjecture,
~ ! [X5,X3] :
( order(X5,X3)
=> ! [X2] :
( subset(X2,X3)
=> order(X5,X2) ) ),
inference(negated_conjecture,[],[f22]) ).
fof(f22,conjecture,
! [X5,X3] :
( order(X5,X3)
=> ! [X2] :
( subset(X2,X3)
=> order(X5,X2) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',thIV17) ).
fof(f146,plain,
( ~ member(sK10(sK2,sK4),sK4)
| ~ spl11_2
| ~ spl11_3 ),
inference(unit_resulting_resolution,[],[f51,f140,f53]) ).
fof(f53,plain,
! [X2,X0,X1] :
( member(X2,X1)
| ~ member(X2,X0)
| ~ subset(X0,X1) ),
inference(cnf_transformation,[],[f28]) ).
fof(f28,plain,
! [X0,X1] :
( ! [X2] :
( member(X2,X1)
| ~ member(X2,X0) )
| ~ subset(X0,X1) ),
inference(ennf_transformation,[],[f26]) ).
fof(f26,plain,
! [X0,X1] :
( subset(X0,X1)
=> ! [X2] :
( member(X2,X0)
=> member(X2,X1) ) ),
inference(unused_predicate_definition_removal,[],[f1]) ).
fof(f1,axiom,
! [X0,X1] :
( subset(X0,X1)
<=> ! [X2] :
( member(X2,X0)
=> member(X2,X1) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',subset) ).
fof(f140,plain,
( ~ member(sK10(sK2,sK4),sK3)
| ~ spl11_2
| ~ spl11_3 ),
inference(unit_resulting_resolution,[],[f50,f52,f81,f85,f74]) ).
fof(f74,plain,
! [X2,X0,X1] :
( order(X0,X1)
| ~ sP1(X0,X1)
| ~ sP0(X0,X1)
| ~ member(sK10(X0,X1),X2)
| ~ order(X0,X2) ),
inference(resolution,[],[f71,f67]) ).
fof(f67,plain,
! [X3,X0,X1] :
( apply(X0,X3,X3)
| ~ member(X3,X1)
| ~ order(X0,X1) ),
inference(cnf_transformation,[],[f49]) ).
fof(f71,plain,
! [X0,X1] :
( ~ apply(X0,sK10(X0,X1),sK10(X0,X1))
| ~ sP0(X0,X1)
| ~ sP1(X0,X1)
| order(X0,X1) ),
inference(cnf_transformation,[],[f49]) ).
fof(f50,plain,
order(sK2,sK3),
inference(cnf_transformation,[],[f36]) ).
fof(f51,plain,
subset(sK4,sK3),
inference(cnf_transformation,[],[f36]) ).
fof(f139,plain,
spl11_3,
inference(avatar_contradiction_clause,[],[f138]) ).
fof(f138,plain,
( $false
| spl11_3 ),
inference(subsumption_resolution,[],[f134,f124]) ).
fof(f124,plain,
( apply(sK2,sK5(sK2,sK4),sK6(sK2,sK4))
| spl11_3 ),
inference(unit_resulting_resolution,[],[f86,f57]) ).
fof(f57,plain,
! [X0,X1] :
( apply(X0,sK5(X0,X1),sK6(X0,X1))
| sP1(X0,X1) ),
inference(cnf_transformation,[],[f40]) ).
fof(f40,plain,
! [X0,X1] :
( ( sP1(X0,X1)
| ( sK5(X0,X1) != sK6(X0,X1)
& apply(X0,sK6(X0,X1),sK5(X0,X1))
& apply(X0,sK5(X0,X1),sK6(X0,X1))
& member(sK6(X0,X1),X1)
& member(sK5(X0,X1),X1) ) )
& ( ! [X4,X5] :
( X4 = X5
| ~ apply(X0,X5,X4)
| ~ apply(X0,X4,X5)
| ~ member(X5,X1)
| ~ member(X4,X1) )
| ~ sP1(X0,X1) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK5,sK6])],[f38,f39]) ).
fof(f39,plain,
! [X0,X1] :
( ? [X2,X3] :
( X2 != X3
& apply(X0,X3,X2)
& apply(X0,X2,X3)
& member(X3,X1)
& member(X2,X1) )
=> ( sK5(X0,X1) != sK6(X0,X1)
& apply(X0,sK6(X0,X1),sK5(X0,X1))
& apply(X0,sK5(X0,X1),sK6(X0,X1))
& member(sK6(X0,X1),X1)
& member(sK5(X0,X1),X1) ) ),
introduced(choice_axiom,[]) ).
fof(f38,plain,
! [X0,X1] :
( ( sP1(X0,X1)
| ? [X2,X3] :
( X2 != X3
& apply(X0,X3,X2)
& apply(X0,X2,X3)
& member(X3,X1)
& member(X2,X1) ) )
& ( ! [X4,X5] :
( X4 = X5
| ~ apply(X0,X5,X4)
| ~ apply(X0,X4,X5)
| ~ member(X5,X1)
| ~ member(X4,X1) )
| ~ sP1(X0,X1) ) ),
inference(rectify,[],[f37]) ).
fof(f37,plain,
! [X0,X1] :
( ( sP1(X0,X1)
| ? [X5,X6] :
( X5 != X6
& apply(X0,X6,X5)
& apply(X0,X5,X6)
& member(X6,X1)
& member(X5,X1) ) )
& ( ! [X5,X6] :
( X5 = X6
| ~ apply(X0,X6,X5)
| ~ apply(X0,X5,X6)
| ~ member(X6,X1)
| ~ member(X5,X1) )
| ~ sP1(X0,X1) ) ),
inference(nnf_transformation,[],[f32]) ).
fof(f86,plain,
( ~ sP1(sK2,sK4)
| spl11_3 ),
inference(avatar_component_clause,[],[f84]) ).
fof(f134,plain,
( ~ apply(sK2,sK5(sK2,sK4),sK6(sK2,sK4))
| spl11_3 ),
inference(unit_resulting_resolution,[],[f72,f130,f131,f125,f123,f54]) ).
fof(f54,plain,
! [X0,X1,X4,X5] :
( X4 = X5
| ~ apply(X0,X5,X4)
| ~ apply(X0,X4,X5)
| ~ member(X5,X1)
| ~ member(X4,X1)
| ~ sP1(X0,X1) ),
inference(cnf_transformation,[],[f40]) ).
fof(f123,plain,
( apply(sK2,sK6(sK2,sK4),sK5(sK2,sK4))
| spl11_3 ),
inference(unit_resulting_resolution,[],[f86,f58]) ).
fof(f58,plain,
! [X0,X1] :
( apply(X0,sK6(X0,X1),sK5(X0,X1))
| sP1(X0,X1) ),
inference(cnf_transformation,[],[f40]) ).
fof(f125,plain,
( sK6(sK2,sK4) != sK5(sK2,sK4)
| spl11_3 ),
inference(unit_resulting_resolution,[],[f86,f59]) ).
fof(f59,plain,
! [X0,X1] :
( sK5(X0,X1) != sK6(X0,X1)
| sP1(X0,X1) ),
inference(cnf_transformation,[],[f40]) ).
fof(f131,plain,
( member(sK5(sK2,sK4),sK3)
| spl11_3 ),
inference(unit_resulting_resolution,[],[f51,f127,f53]) ).
fof(f127,plain,
( member(sK5(sK2,sK4),sK4)
| spl11_3 ),
inference(unit_resulting_resolution,[],[f86,f55]) ).
fof(f55,plain,
! [X0,X1] :
( member(sK5(X0,X1),X1)
| sP1(X0,X1) ),
inference(cnf_transformation,[],[f40]) ).
fof(f130,plain,
( member(sK6(sK2,sK4),sK3)
| spl11_3 ),
inference(unit_resulting_resolution,[],[f51,f126,f53]) ).
fof(f126,plain,
( member(sK6(sK2,sK4),sK4)
| spl11_3 ),
inference(unit_resulting_resolution,[],[f86,f56]) ).
fof(f56,plain,
! [X0,X1] :
( member(sK6(X0,X1),X1)
| sP1(X0,X1) ),
inference(cnf_transformation,[],[f40]) ).
fof(f72,plain,
sP1(sK2,sK3),
inference(unit_resulting_resolution,[],[f50,f68]) ).
fof(f68,plain,
! [X0,X1] :
( sP1(X0,X1)
| ~ order(X0,X1) ),
inference(cnf_transformation,[],[f49]) ).
fof(f119,plain,
spl11_2,
inference(avatar_contradiction_clause,[],[f118]) ).
fof(f118,plain,
( $false
| spl11_2 ),
inference(subsumption_resolution,[],[f108,f105]) ).
fof(f105,plain,
( member(sK9(sK2,sK4),sK3)
| spl11_2 ),
inference(unit_resulting_resolution,[],[f51,f90,f53]) ).
fof(f90,plain,
( member(sK9(sK2,sK4),sK4)
| spl11_2 ),
inference(unit_resulting_resolution,[],[f82,f63]) ).
fof(f63,plain,
! [X0,X1] :
( member(sK9(X0,X1),X1)
| sP0(X0,X1) ),
inference(cnf_transformation,[],[f44]) ).
fof(f44,plain,
! [X0,X1] :
( ( sP0(X0,X1)
| ( ~ apply(X0,sK7(X0,X1),sK9(X0,X1))
& apply(X0,sK8(X0,X1),sK9(X0,X1))
& apply(X0,sK7(X0,X1),sK8(X0,X1))
& member(sK9(X0,X1),X1)
& member(sK8(X0,X1),X1)
& member(sK7(X0,X1),X1) ) )
& ( ! [X5,X6,X7] :
( apply(X0,X5,X7)
| ~ apply(X0,X6,X7)
| ~ apply(X0,X5,X6)
| ~ member(X7,X1)
| ~ member(X6,X1)
| ~ member(X5,X1) )
| ~ sP0(X0,X1) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK7,sK8,sK9])],[f42,f43]) ).
fof(f43,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) )
=> ( ~ apply(X0,sK7(X0,X1),sK9(X0,X1))
& apply(X0,sK8(X0,X1),sK9(X0,X1))
& apply(X0,sK7(X0,X1),sK8(X0,X1))
& member(sK9(X0,X1),X1)
& member(sK8(X0,X1),X1)
& member(sK7(X0,X1),X1) ) ),
introduced(choice_axiom,[]) ).
fof(f42,plain,
! [X0,X1] :
( ( sP0(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,X7] :
( apply(X0,X5,X7)
| ~ apply(X0,X6,X7)
| ~ apply(X0,X5,X6)
| ~ member(X7,X1)
| ~ member(X6,X1)
| ~ member(X5,X1) )
| ~ sP0(X0,X1) ) ),
inference(rectify,[],[f41]) ).
fof(f41,plain,
! [X0,X1] :
( ( sP0(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) ) )
& ( ! [X2,X3,X4] :
( apply(X0,X2,X4)
| ~ apply(X0,X3,X4)
| ~ apply(X0,X2,X3)
| ~ member(X4,X1)
| ~ member(X3,X1)
| ~ member(X2,X1) )
| ~ sP0(X0,X1) ) ),
inference(nnf_transformation,[],[f31]) ).
fof(f82,plain,
( ~ sP0(sK2,sK4)
| spl11_2 ),
inference(avatar_component_clause,[],[f80]) ).
fof(f108,plain,
( ~ member(sK9(sK2,sK4),sK3)
| spl11_2 ),
inference(unit_resulting_resolution,[],[f98,f101,f92,f91,f93,f97]) ).
fof(f97,plain,
! [X2,X0,X1] :
( apply(sK2,X2,X1)
| ~ apply(sK2,X2,X0)
| ~ member(X1,sK3)
| ~ member(X0,sK3)
| ~ member(X2,sK3)
| ~ apply(sK2,X0,X1) ),
inference(resolution,[],[f60,f73]) ).
fof(f73,plain,
sP0(sK2,sK3),
inference(unit_resulting_resolution,[],[f50,f69]) ).
fof(f69,plain,
! [X0,X1] :
( sP0(X0,X1)
| ~ order(X0,X1) ),
inference(cnf_transformation,[],[f49]) ).
fof(f60,plain,
! [X0,X1,X6,X7,X5] :
( ~ sP0(X0,X1)
| ~ apply(X0,X6,X7)
| ~ apply(X0,X5,X6)
| ~ member(X7,X1)
| ~ member(X6,X1)
| ~ member(X5,X1)
| apply(X0,X5,X7) ),
inference(cnf_transformation,[],[f44]) ).
fof(f93,plain,
( ~ apply(sK2,sK7(sK2,sK4),sK9(sK2,sK4))
| spl11_2 ),
inference(unit_resulting_resolution,[],[f82,f66]) ).
fof(f66,plain,
! [X0,X1] :
( ~ apply(X0,sK7(X0,X1),sK9(X0,X1))
| sP0(X0,X1) ),
inference(cnf_transformation,[],[f44]) ).
fof(f91,plain,
( apply(sK2,sK7(sK2,sK4),sK8(sK2,sK4))
| spl11_2 ),
inference(unit_resulting_resolution,[],[f82,f64]) ).
fof(f64,plain,
! [X0,X1] :
( apply(X0,sK7(X0,X1),sK8(X0,X1))
| sP0(X0,X1) ),
inference(cnf_transformation,[],[f44]) ).
fof(f92,plain,
( apply(sK2,sK8(sK2,sK4),sK9(sK2,sK4))
| spl11_2 ),
inference(unit_resulting_resolution,[],[f82,f65]) ).
fof(f65,plain,
! [X0,X1] :
( apply(X0,sK8(X0,X1),sK9(X0,X1))
| sP0(X0,X1) ),
inference(cnf_transformation,[],[f44]) ).
fof(f101,plain,
( member(sK8(sK2,sK4),sK3)
| spl11_2 ),
inference(unit_resulting_resolution,[],[f51,f89,f53]) ).
fof(f89,plain,
( member(sK8(sK2,sK4),sK4)
| spl11_2 ),
inference(unit_resulting_resolution,[],[f82,f62]) ).
fof(f62,plain,
! [X0,X1] :
( member(sK8(X0,X1),X1)
| sP0(X0,X1) ),
inference(cnf_transformation,[],[f44]) ).
fof(f98,plain,
( member(sK7(sK2,sK4),sK3)
| spl11_2 ),
inference(unit_resulting_resolution,[],[f51,f88,f53]) ).
fof(f88,plain,
( member(sK7(sK2,sK4),sK4)
| spl11_2 ),
inference(unit_resulting_resolution,[],[f82,f61]) ).
fof(f61,plain,
! [X0,X1] :
( member(sK7(X0,X1),X1)
| sP0(X0,X1) ),
inference(cnf_transformation,[],[f44]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.14 % Problem : SET805+4 : TPTP v8.2.0. Released v3.2.0.
% 0.12/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.15/0.36 % Computer : n002.cluster.edu
% 0.15/0.36 % Model : x86_64 x86_64
% 0.15/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.36 % Memory : 8042.1875MB
% 0.15/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.37 % CPULimit : 300
% 0.15/0.37 % WCLimit : 300
% 0.15/0.37 % DateTime : Mon May 20 11:32:53 EDT 2024
% 0.15/0.37 % CPUTime :
% 0.15/0.37 This is a FOF_THM_RFO_SEQ problem
% 0.15/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/benchmark/theBenchmark.p
% 0.70/0.88 % (25957)lrs+1002_1:16_to=lpo:sil=32000:sp=unary_frequency:sos=on:i=45:bd=off:ss=axioms_0 on theBenchmark for (2995ds/45Mi)
% 0.70/0.88 % (25955)ott+1011_1:1_sil=2000:urr=on:i=33:sd=1:kws=inv_frequency:ss=axioms:sup=off_0 on theBenchmark for (2995ds/33Mi)
% 0.70/0.88 % (25956)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 theBenchmark for (2995ds/34Mi)
% 0.70/0.88 % (25952)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 theBenchmark for (2995ds/34Mi)
% 0.70/0.88 % (25954)lrs+1011_1:1_sil=8000:sp=occurrence:nwc=10.0:i=78:ss=axioms:sgt=8_0 on theBenchmark for (2995ds/78Mi)
% 0.70/0.88 % (25958)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 theBenchmark for (2995ds/83Mi)
% 0.70/0.88 % (25959)lrs-21_1:1_to=lpo:sil=2000:sp=frequency:sos=on:lma=on:i=56:sd=2:ss=axioms:ep=R_0 on theBenchmark for (2995ds/56Mi)
% 0.70/0.88 % (25953)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 theBenchmark for (2995ds/51Mi)
% 0.70/0.88 % (25957)Refutation not found, incomplete strategy% (25957)------------------------------
% 0.70/0.88 % (25957)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.70/0.88 % (25957)Termination reason: Refutation not found, incomplete strategy
% 0.70/0.88
% 0.70/0.88 % (25957)Memory used [KB]: 1062
% 0.70/0.88 % (25957)Time elapsed: 0.003 s
% 0.70/0.88 % (25957)Instructions burned: 3 (million)
% 0.70/0.88 % (25959)Refutation not found, incomplete strategy% (25959)------------------------------
% 0.70/0.88 % (25959)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.70/0.88 % (25959)Termination reason: Refutation not found, incomplete strategy
% 0.70/0.88
% 0.70/0.88 % (25956)Refutation not found, incomplete strategy% (25956)------------------------------
% 0.70/0.88 % (25956)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.70/0.88 % (25959)Memory used [KB]: 1067
% 0.70/0.88 % (25957)------------------------------
% 0.70/0.88 % (25957)------------------------------
% 0.70/0.88 % (25959)Time elapsed: 0.004 s
% 0.70/0.88 % (25959)Instructions burned: 3 (million)
% 0.70/0.88 % (25956)Termination reason: Refutation not found, incomplete strategy
% 0.70/0.88
% 0.70/0.88 % (25956)Memory used [KB]: 1089
% 0.70/0.88 % (25956)Time elapsed: 0.004 s
% 0.70/0.88 % (25956)Instructions burned: 4 (million)
% 0.70/0.88 % (25958)Refutation not found, incomplete strategy% (25958)------------------------------
% 0.70/0.88 % (25958)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.70/0.88 % (25958)Termination reason: Refutation not found, incomplete strategy
% 0.70/0.88
% 0.70/0.88 % (25958)Memory used [KB]: 1066
% 0.70/0.88 % (25958)Time elapsed: 0.004 s
% 0.70/0.88 % (25958)Instructions burned: 4 (million)
% 0.70/0.88 % (25959)------------------------------
% 0.70/0.88 % (25959)------------------------------
% 0.70/0.88 % (25956)------------------------------
% 0.70/0.88 % (25956)------------------------------
% 0.70/0.88 % (25958)------------------------------
% 0.70/0.88 % (25958)------------------------------
% 0.70/0.88 % (25955)First to succeed.
% 0.70/0.88 % (25962)lrs+1010_1:2_sil=4000:tgt=ground:nwc=10.0:st=2.0:i=208:sd=1:bd=off:ss=axioms_0 on theBenchmark for (2994ds/208Mi)
% 0.70/0.88 % (25960)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 theBenchmark for (2994ds/55Mi)
% 0.70/0.88 % (25961)dis+3_25:4_sil=16000:sos=all:erd=off:i=50:s2at=4.0:bd=off:nm=60:sup=off:cond=on:av=off:ins=2:nwc=10.0:etr=on:to=lpo:s2agt=20:fd=off:bsr=unit_only:slsq=on:slsqr=28,19:awrs=converge:awrsf=500:tgt=ground:bs=unit_only_0 on theBenchmark for (2994ds/50Mi)
% 0.70/0.88 % (25963)lrs-1011_1:1_sil=4000:plsq=on:plsqr=32,1:sp=frequency:plsql=on:nwc=10.0:i=52:aac=none:afr=on:ss=axioms:er=filter:sgt=16:rawr=on:etr=on:lma=on_0 on theBenchmark for (2994ds/52Mi)
% 0.70/0.88 % (25955)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-25951"
% 0.70/0.88 % (25955)Refutation found. Thanks to Tanya!
% 0.70/0.88 % SZS status Theorem for theBenchmark
% 0.70/0.88 % SZS output start Proof for theBenchmark
% See solution above
% 0.70/0.89 % (25955)------------------------------
% 0.70/0.89 % (25955)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.70/0.89 % (25955)Termination reason: Refutation
% 0.70/0.89
% 0.70/0.89 % (25955)Memory used [KB]: 1131
% 0.70/0.89 % (25955)Time elapsed: 0.010 s
% 0.70/0.89 % (25955)Instructions burned: 12 (million)
% 0.70/0.89 % (25951)Success in time 0.511 s
% 0.70/0.89 % Vampire---4.8 exiting
%------------------------------------------------------------------------------