TSTP Solution File: SWC279+1 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SWC279+1 : TPTP v8.2.0. Released v2.4.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/sandbox2/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% Computer : n003.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 04:37:43 EDT 2024
% Result : Theorem 0.62s 0.79s
% Output : Refutation 0.62s
% Verified :
% SZS Type : Refutation
% Derivation depth : 17
% Number of leaves : 13
% Syntax : Number of formulae : 56 ( 8 unt; 0 def)
% Number of atoms : 501 ( 69 equ)
% Maximal formula atoms : 48 ( 8 avg)
% Number of connectives : 655 ( 210 ~; 190 |; 219 &)
% ( 4 <=>; 32 =>; 0 <=; 0 <~>)
% Maximal formula depth : 23 ( 7 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 10 ( 8 usr; 5 prp; 0-2 aty)
% Number of functors : 11 ( 11 usr; 9 con; 0-2 aty)
% Number of variables : 178 ( 86 !; 92 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f256,plain,
$false,
inference(avatar_sat_refutation,[],[f225,f230,f235,f236,f251,f255]) ).
fof(f255,plain,
( spl14_2
| ~ spl14_4 ),
inference(avatar_contradiction_clause,[],[f254]) ).
fof(f254,plain,
( $false
| spl14_2
| ~ spl14_4 ),
inference(subsumption_resolution,[],[f253,f234]) ).
fof(f234,plain,
( memberP(sK6,sK7)
| ~ spl14_4 ),
inference(avatar_component_clause,[],[f232]) ).
fof(f232,plain,
( spl14_4
<=> memberP(sK6,sK7) ),
introduced(avatar_definition,[new_symbols(naming,[spl14_4])]) ).
fof(f253,plain,
( ~ memberP(sK6,sK7)
| spl14_2 ),
inference(subsumption_resolution,[],[f252,f166]) ).
fof(f166,plain,
ssItem(sK7),
inference(cnf_transformation,[],[f136]) ).
fof(f136,plain,
( ( ( ~ leq(sK4,sK7)
& memberP(sK6,sK7) )
| ( ~ leq(sK7,sK4)
& memberP(sK5,sK7) ) )
& ssItem(sK7)
& sK0 = app(app(sK5,cons(sK4,nil)),sK6)
& ssList(sK6)
& ssList(sK5)
& ssItem(sK4)
& ! [X8] :
( ! [X9] :
( ! [X10] :
( ! [X11] :
( ( ( ~ memberP(X9,X11)
| leq(X11,X8) )
& ( ~ memberP(X10,X11)
| leq(X8,X11) ) )
| ~ ssItem(X11) )
| app(app(X9,cons(X8,nil)),X10) != sK2
| ~ ssList(X10) )
| ~ ssList(X9) )
| ~ ssItem(X8) )
& sK0 = sK2
& sK1 = sK3
& ssList(sK3)
& ssList(sK2)
& ssList(sK1)
& ssList(sK0) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3,sK4,sK5,sK6,sK7])],[f100,f135,f134,f133,f132,f131,f130,f129,f128]) ).
fof(f128,plain,
( ? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ? [X4] :
( ? [X5] :
( ? [X6] :
( ? [X7] :
( ( ( ~ leq(X4,X7)
& memberP(X6,X7) )
| ( ~ leq(X7,X4)
& memberP(X5,X7) ) )
& ssItem(X7) )
& app(app(X5,cons(X4,nil)),X6) = X0
& ssList(X6) )
& ssList(X5) )
& ssItem(X4) )
& ! [X8] :
( ! [X9] :
( ! [X10] :
( ! [X11] :
( ( ( ~ memberP(X9,X11)
| leq(X11,X8) )
& ( ~ memberP(X10,X11)
| leq(X8,X11) ) )
| ~ ssItem(X11) )
| app(app(X9,cons(X8,nil)),X10) != X2
| ~ ssList(X10) )
| ~ ssList(X9) )
| ~ ssItem(X8) )
& X0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) )
=> ( ? [X1] :
( ? [X2] :
( ? [X3] :
( ? [X4] :
( ? [X5] :
( ? [X6] :
( ? [X7] :
( ( ( ~ leq(X4,X7)
& memberP(X6,X7) )
| ( ~ leq(X7,X4)
& memberP(X5,X7) ) )
& ssItem(X7) )
& app(app(X5,cons(X4,nil)),X6) = sK0
& ssList(X6) )
& ssList(X5) )
& ssItem(X4) )
& ! [X8] :
( ! [X9] :
( ! [X10] :
( ! [X11] :
( ( ( ~ memberP(X9,X11)
| leq(X11,X8) )
& ( ~ memberP(X10,X11)
| leq(X8,X11) ) )
| ~ ssItem(X11) )
| app(app(X9,cons(X8,nil)),X10) != X2
| ~ ssList(X10) )
| ~ ssList(X9) )
| ~ ssItem(X8) )
& sK0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(sK0) ) ),
introduced(choice_axiom,[]) ).
fof(f129,plain,
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ? [X4] :
( ? [X5] :
( ? [X6] :
( ? [X7] :
( ( ( ~ leq(X4,X7)
& memberP(X6,X7) )
| ( ~ leq(X7,X4)
& memberP(X5,X7) ) )
& ssItem(X7) )
& app(app(X5,cons(X4,nil)),X6) = sK0
& ssList(X6) )
& ssList(X5) )
& ssItem(X4) )
& ! [X8] :
( ! [X9] :
( ! [X10] :
( ! [X11] :
( ( ( ~ memberP(X9,X11)
| leq(X11,X8) )
& ( ~ memberP(X10,X11)
| leq(X8,X11) ) )
| ~ ssItem(X11) )
| app(app(X9,cons(X8,nil)),X10) != X2
| ~ ssList(X10) )
| ~ ssList(X9) )
| ~ ssItem(X8) )
& sK0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
=> ( ? [X2] :
( ? [X3] :
( ? [X4] :
( ? [X5] :
( ? [X6] :
( ? [X7] :
( ( ( ~ leq(X4,X7)
& memberP(X6,X7) )
| ( ~ leq(X7,X4)
& memberP(X5,X7) ) )
& ssItem(X7) )
& app(app(X5,cons(X4,nil)),X6) = sK0
& ssList(X6) )
& ssList(X5) )
& ssItem(X4) )
& ! [X8] :
( ! [X9] :
( ! [X10] :
( ! [X11] :
( ( ( ~ memberP(X9,X11)
| leq(X11,X8) )
& ( ~ memberP(X10,X11)
| leq(X8,X11) ) )
| ~ ssItem(X11) )
| app(app(X9,cons(X8,nil)),X10) != X2
| ~ ssList(X10) )
| ~ ssList(X9) )
| ~ ssItem(X8) )
& sK0 = X2
& sK1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(sK1) ) ),
introduced(choice_axiom,[]) ).
fof(f130,plain,
( ? [X2] :
( ? [X3] :
( ? [X4] :
( ? [X5] :
( ? [X6] :
( ? [X7] :
( ( ( ~ leq(X4,X7)
& memberP(X6,X7) )
| ( ~ leq(X7,X4)
& memberP(X5,X7) ) )
& ssItem(X7) )
& app(app(X5,cons(X4,nil)),X6) = sK0
& ssList(X6) )
& ssList(X5) )
& ssItem(X4) )
& ! [X8] :
( ! [X9] :
( ! [X10] :
( ! [X11] :
( ( ( ~ memberP(X9,X11)
| leq(X11,X8) )
& ( ~ memberP(X10,X11)
| leq(X8,X11) ) )
| ~ ssItem(X11) )
| app(app(X9,cons(X8,nil)),X10) != X2
| ~ ssList(X10) )
| ~ ssList(X9) )
| ~ ssItem(X8) )
& sK0 = X2
& sK1 = X3
& ssList(X3) )
& ssList(X2) )
=> ( ? [X3] :
( ? [X4] :
( ? [X5] :
( ? [X6] :
( ? [X7] :
( ( ( ~ leq(X4,X7)
& memberP(X6,X7) )
| ( ~ leq(X7,X4)
& memberP(X5,X7) ) )
& ssItem(X7) )
& app(app(X5,cons(X4,nil)),X6) = sK0
& ssList(X6) )
& ssList(X5) )
& ssItem(X4) )
& ! [X8] :
( ! [X9] :
( ! [X10] :
( ! [X11] :
( ( ( ~ memberP(X9,X11)
| leq(X11,X8) )
& ( ~ memberP(X10,X11)
| leq(X8,X11) ) )
| ~ ssItem(X11) )
| app(app(X9,cons(X8,nil)),X10) != sK2
| ~ ssList(X10) )
| ~ ssList(X9) )
| ~ ssItem(X8) )
& sK0 = sK2
& sK1 = X3
& ssList(X3) )
& ssList(sK2) ) ),
introduced(choice_axiom,[]) ).
fof(f131,plain,
( ? [X3] :
( ? [X4] :
( ? [X5] :
( ? [X6] :
( ? [X7] :
( ( ( ~ leq(X4,X7)
& memberP(X6,X7) )
| ( ~ leq(X7,X4)
& memberP(X5,X7) ) )
& ssItem(X7) )
& app(app(X5,cons(X4,nil)),X6) = sK0
& ssList(X6) )
& ssList(X5) )
& ssItem(X4) )
& ! [X8] :
( ! [X9] :
( ! [X10] :
( ! [X11] :
( ( ( ~ memberP(X9,X11)
| leq(X11,X8) )
& ( ~ memberP(X10,X11)
| leq(X8,X11) ) )
| ~ ssItem(X11) )
| app(app(X9,cons(X8,nil)),X10) != sK2
| ~ ssList(X10) )
| ~ ssList(X9) )
| ~ ssItem(X8) )
& sK0 = sK2
& sK1 = X3
& ssList(X3) )
=> ( ? [X4] :
( ? [X5] :
( ? [X6] :
( ? [X7] :
( ( ( ~ leq(X4,X7)
& memberP(X6,X7) )
| ( ~ leq(X7,X4)
& memberP(X5,X7) ) )
& ssItem(X7) )
& app(app(X5,cons(X4,nil)),X6) = sK0
& ssList(X6) )
& ssList(X5) )
& ssItem(X4) )
& ! [X8] :
( ! [X9] :
( ! [X10] :
( ! [X11] :
( ( ( ~ memberP(X9,X11)
| leq(X11,X8) )
& ( ~ memberP(X10,X11)
| leq(X8,X11) ) )
| ~ ssItem(X11) )
| app(app(X9,cons(X8,nil)),X10) != sK2
| ~ ssList(X10) )
| ~ ssList(X9) )
| ~ ssItem(X8) )
& sK0 = sK2
& sK1 = sK3
& ssList(sK3) ) ),
introduced(choice_axiom,[]) ).
fof(f132,plain,
( ? [X4] :
( ? [X5] :
( ? [X6] :
( ? [X7] :
( ( ( ~ leq(X4,X7)
& memberP(X6,X7) )
| ( ~ leq(X7,X4)
& memberP(X5,X7) ) )
& ssItem(X7) )
& app(app(X5,cons(X4,nil)),X6) = sK0
& ssList(X6) )
& ssList(X5) )
& ssItem(X4) )
=> ( ? [X5] :
( ? [X6] :
( ? [X7] :
( ( ( ~ leq(sK4,X7)
& memberP(X6,X7) )
| ( ~ leq(X7,sK4)
& memberP(X5,X7) ) )
& ssItem(X7) )
& sK0 = app(app(X5,cons(sK4,nil)),X6)
& ssList(X6) )
& ssList(X5) )
& ssItem(sK4) ) ),
introduced(choice_axiom,[]) ).
fof(f133,plain,
( ? [X5] :
( ? [X6] :
( ? [X7] :
( ( ( ~ leq(sK4,X7)
& memberP(X6,X7) )
| ( ~ leq(X7,sK4)
& memberP(X5,X7) ) )
& ssItem(X7) )
& sK0 = app(app(X5,cons(sK4,nil)),X6)
& ssList(X6) )
& ssList(X5) )
=> ( ? [X6] :
( ? [X7] :
( ( ( ~ leq(sK4,X7)
& memberP(X6,X7) )
| ( ~ leq(X7,sK4)
& memberP(sK5,X7) ) )
& ssItem(X7) )
& sK0 = app(app(sK5,cons(sK4,nil)),X6)
& ssList(X6) )
& ssList(sK5) ) ),
introduced(choice_axiom,[]) ).
fof(f134,plain,
( ? [X6] :
( ? [X7] :
( ( ( ~ leq(sK4,X7)
& memberP(X6,X7) )
| ( ~ leq(X7,sK4)
& memberP(sK5,X7) ) )
& ssItem(X7) )
& sK0 = app(app(sK5,cons(sK4,nil)),X6)
& ssList(X6) )
=> ( ? [X7] :
( ( ( ~ leq(sK4,X7)
& memberP(sK6,X7) )
| ( ~ leq(X7,sK4)
& memberP(sK5,X7) ) )
& ssItem(X7) )
& sK0 = app(app(sK5,cons(sK4,nil)),sK6)
& ssList(sK6) ) ),
introduced(choice_axiom,[]) ).
fof(f135,plain,
( ? [X7] :
( ( ( ~ leq(sK4,X7)
& memberP(sK6,X7) )
| ( ~ leq(X7,sK4)
& memberP(sK5,X7) ) )
& ssItem(X7) )
=> ( ( ( ~ leq(sK4,sK7)
& memberP(sK6,sK7) )
| ( ~ leq(sK7,sK4)
& memberP(sK5,sK7) ) )
& ssItem(sK7) ) ),
introduced(choice_axiom,[]) ).
fof(f100,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ? [X4] :
( ? [X5] :
( ? [X6] :
( ? [X7] :
( ( ( ~ leq(X4,X7)
& memberP(X6,X7) )
| ( ~ leq(X7,X4)
& memberP(X5,X7) ) )
& ssItem(X7) )
& app(app(X5,cons(X4,nil)),X6) = X0
& ssList(X6) )
& ssList(X5) )
& ssItem(X4) )
& ! [X8] :
( ! [X9] :
( ! [X10] :
( ! [X11] :
( ( ( ~ memberP(X9,X11)
| leq(X11,X8) )
& ( ~ memberP(X10,X11)
| leq(X8,X11) ) )
| ~ ssItem(X11) )
| app(app(X9,cons(X8,nil)),X10) != X2
| ~ ssList(X10) )
| ~ ssList(X9) )
| ~ ssItem(X8) )
& X0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(flattening,[],[f99]) ).
fof(f99,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ? [X4] :
( ? [X5] :
( ? [X6] :
( ? [X7] :
( ( ( ~ leq(X4,X7)
& memberP(X6,X7) )
| ( ~ leq(X7,X4)
& memberP(X5,X7) ) )
& ssItem(X7) )
& app(app(X5,cons(X4,nil)),X6) = X0
& ssList(X6) )
& ssList(X5) )
& ssItem(X4) )
& ! [X8] :
( ! [X9] :
( ! [X10] :
( ! [X11] :
( ( ( ~ memberP(X9,X11)
| leq(X11,X8) )
& ( ~ memberP(X10,X11)
| leq(X8,X11) ) )
| ~ ssItem(X11) )
| app(app(X9,cons(X8,nil)),X10) != X2
| ~ ssList(X10) )
| ~ ssList(X9) )
| ~ ssItem(X8) )
& X0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(ennf_transformation,[],[f98]) ).
fof(f98,plain,
~ ! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( ! [X4] :
( ssItem(X4)
=> ! [X5] :
( ssList(X5)
=> ! [X6] :
( ssList(X6)
=> ( ! [X7] :
( ssItem(X7)
=> ( ( leq(X4,X7)
| ~ memberP(X6,X7) )
& ( leq(X7,X4)
| ~ memberP(X5,X7) ) ) )
| app(app(X5,cons(X4,nil)),X6) != X0 ) ) ) )
| ? [X8] :
( ? [X9] :
( ? [X10] :
( ? [X11] :
( ( ( memberP(X9,X11)
& ~ leq(X11,X8) )
| ( memberP(X10,X11)
& ~ leq(X8,X11) ) )
& ssItem(X11) )
& app(app(X9,cons(X8,nil)),X10) = X2
& ssList(X10) )
& ssList(X9) )
& ssItem(X8) )
| X0 != X2
| X1 != X3 ) ) ) ) ),
inference(rectify,[],[f97]) ).
fof(f97,negated_conjecture,
~ ! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( ! [X8] :
( ssItem(X8)
=> ! [X9] :
( ssList(X9)
=> ! [X10] :
( ssList(X10)
=> ( ! [X11] :
( ssItem(X11)
=> ( ( leq(X8,X11)
| ~ memberP(X10,X11) )
& ( leq(X11,X8)
| ~ memberP(X9,X11) ) ) )
| app(app(X9,cons(X8,nil)),X10) != X0 ) ) ) )
| ? [X4] :
( ? [X5] :
( ? [X6] :
( ? [X7] :
( ( ( memberP(X5,X7)
& ~ leq(X7,X4) )
| ( memberP(X6,X7)
& ~ leq(X4,X7) ) )
& ssItem(X7) )
& app(app(X5,cons(X4,nil)),X6) = X2
& ssList(X6) )
& ssList(X5) )
& ssItem(X4) )
| X0 != X2
| X1 != X3 ) ) ) ) ),
inference(negated_conjecture,[],[f96]) ).
fof(f96,conjecture,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( ! [X8] :
( ssItem(X8)
=> ! [X9] :
( ssList(X9)
=> ! [X10] :
( ssList(X10)
=> ( ! [X11] :
( ssItem(X11)
=> ( ( leq(X8,X11)
| ~ memberP(X10,X11) )
& ( leq(X11,X8)
| ~ memberP(X9,X11) ) ) )
| app(app(X9,cons(X8,nil)),X10) != X0 ) ) ) )
| ? [X4] :
( ? [X5] :
( ? [X6] :
( ? [X7] :
( ( ( memberP(X5,X7)
& ~ leq(X7,X4) )
| ( memberP(X6,X7)
& ~ leq(X4,X7) ) )
& ssItem(X7) )
& app(app(X5,cons(X4,nil)),X6) = X2
& ssList(X6) )
& ssList(X5) )
& ssItem(X4) )
| X0 != X2
| X1 != X3 ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1) ).
fof(f252,plain,
( ~ ssItem(sK7)
| ~ memberP(sK6,sK7)
| spl14_2 ),
inference(resolution,[],[f224,f241]) ).
fof(f241,plain,
! [X0] :
( leq(sK4,X0)
| ~ ssItem(X0)
| ~ memberP(sK6,X0) ),
inference(subsumption_resolution,[],[f240,f162]) ).
fof(f162,plain,
ssItem(sK4),
inference(cnf_transformation,[],[f136]) ).
fof(f240,plain,
! [X0] :
( leq(sK4,X0)
| ~ ssItem(X0)
| ~ memberP(sK6,X0)
| ~ ssItem(sK4) ),
inference(subsumption_resolution,[],[f239,f163]) ).
fof(f163,plain,
ssList(sK5),
inference(cnf_transformation,[],[f136]) ).
fof(f239,plain,
! [X0] :
( leq(sK4,X0)
| ~ ssItem(X0)
| ~ memberP(sK6,X0)
| ~ ssList(sK5)
| ~ ssItem(sK4) ),
inference(subsumption_resolution,[],[f238,f164]) ).
fof(f164,plain,
ssList(sK6),
inference(cnf_transformation,[],[f136]) ).
fof(f238,plain,
! [X0] :
( leq(sK4,X0)
| ~ ssItem(X0)
| ~ memberP(sK6,X0)
| ~ ssList(sK6)
| ~ ssList(sK5)
| ~ ssItem(sK4) ),
inference(trivial_inequality_removal,[],[f237]) ).
fof(f237,plain,
! [X0] :
( sK2 != sK2
| leq(sK4,X0)
| ~ ssItem(X0)
| ~ memberP(sK6,X0)
| ~ ssList(sK6)
| ~ ssList(sK5)
| ~ ssItem(sK4) ),
inference(superposition,[],[f160,f208]) ).
fof(f208,plain,
sK2 = app(app(sK5,cons(sK4,nil)),sK6),
inference(definition_unfolding,[],[f165,f159]) ).
fof(f159,plain,
sK0 = sK2,
inference(cnf_transformation,[],[f136]) ).
fof(f165,plain,
sK0 = app(app(sK5,cons(sK4,nil)),sK6),
inference(cnf_transformation,[],[f136]) ).
fof(f160,plain,
! [X10,X11,X8,X9] :
( app(app(X9,cons(X8,nil)),X10) != sK2
| leq(X8,X11)
| ~ ssItem(X11)
| ~ memberP(X10,X11)
| ~ ssList(X10)
| ~ ssList(X9)
| ~ ssItem(X8) ),
inference(cnf_transformation,[],[f136]) ).
fof(f224,plain,
( ~ leq(sK4,sK7)
| spl14_2 ),
inference(avatar_component_clause,[],[f222]) ).
fof(f222,plain,
( spl14_2
<=> leq(sK4,sK7) ),
introduced(avatar_definition,[new_symbols(naming,[spl14_2])]) ).
fof(f251,plain,
( ~ spl14_3
| spl14_1 ),
inference(avatar_split_clause,[],[f248,f218,f227]) ).
fof(f227,plain,
( spl14_3
<=> memberP(sK5,sK7) ),
introduced(avatar_definition,[new_symbols(naming,[spl14_3])]) ).
fof(f218,plain,
( spl14_1
<=> leq(sK7,sK4) ),
introduced(avatar_definition,[new_symbols(naming,[spl14_1])]) ).
fof(f248,plain,
( ~ memberP(sK5,sK7)
| spl14_1 ),
inference(subsumption_resolution,[],[f247,f166]) ).
fof(f247,plain,
( ~ ssItem(sK7)
| ~ memberP(sK5,sK7)
| spl14_1 ),
inference(resolution,[],[f246,f220]) ).
fof(f220,plain,
( ~ leq(sK7,sK4)
| spl14_1 ),
inference(avatar_component_clause,[],[f218]) ).
fof(f246,plain,
! [X0] :
( leq(X0,sK4)
| ~ ssItem(X0)
| ~ memberP(sK5,X0) ),
inference(subsumption_resolution,[],[f245,f162]) ).
fof(f245,plain,
! [X0] :
( leq(X0,sK4)
| ~ ssItem(X0)
| ~ memberP(sK5,X0)
| ~ ssItem(sK4) ),
inference(subsumption_resolution,[],[f244,f163]) ).
fof(f244,plain,
! [X0] :
( leq(X0,sK4)
| ~ ssItem(X0)
| ~ memberP(sK5,X0)
| ~ ssList(sK5)
| ~ ssItem(sK4) ),
inference(subsumption_resolution,[],[f243,f164]) ).
fof(f243,plain,
! [X0] :
( leq(X0,sK4)
| ~ ssItem(X0)
| ~ memberP(sK5,X0)
| ~ ssList(sK6)
| ~ ssList(sK5)
| ~ ssItem(sK4) ),
inference(trivial_inequality_removal,[],[f242]) ).
fof(f242,plain,
! [X0] :
( sK2 != sK2
| leq(X0,sK4)
| ~ ssItem(X0)
| ~ memberP(sK5,X0)
| ~ ssList(sK6)
| ~ ssList(sK5)
| ~ ssItem(sK4) ),
inference(superposition,[],[f161,f208]) ).
fof(f161,plain,
! [X10,X11,X8,X9] :
( app(app(X9,cons(X8,nil)),X10) != sK2
| leq(X11,X8)
| ~ ssItem(X11)
| ~ memberP(X9,X11)
| ~ ssList(X10)
| ~ ssList(X9)
| ~ ssItem(X8) ),
inference(cnf_transformation,[],[f136]) ).
fof(f236,plain,
( spl14_3
| spl14_4 ),
inference(avatar_split_clause,[],[f167,f232,f227]) ).
fof(f167,plain,
( memberP(sK6,sK7)
| memberP(sK5,sK7) ),
inference(cnf_transformation,[],[f136]) ).
fof(f235,plain,
( ~ spl14_1
| spl14_4 ),
inference(avatar_split_clause,[],[f168,f232,f218]) ).
fof(f168,plain,
( memberP(sK6,sK7)
| ~ leq(sK7,sK4) ),
inference(cnf_transformation,[],[f136]) ).
fof(f230,plain,
( spl14_3
| ~ spl14_2 ),
inference(avatar_split_clause,[],[f169,f222,f227]) ).
fof(f169,plain,
( ~ leq(sK4,sK7)
| memberP(sK5,sK7) ),
inference(cnf_transformation,[],[f136]) ).
fof(f225,plain,
( ~ spl14_1
| ~ spl14_2 ),
inference(avatar_split_clause,[],[f170,f222,f218]) ).
fof(f170,plain,
( ~ leq(sK4,sK7)
| ~ leq(sK7,sK4) ),
inference(cnf_transformation,[],[f136]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.11 % Problem : SWC279+1 : TPTP v8.2.0. Released v2.4.0.
% 0.06/0.12 % Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox2/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% 0.12/0.32 % Computer : n003.cluster.edu
% 0.12/0.32 % Model : x86_64 x86_64
% 0.12/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.32 % Memory : 8042.1875MB
% 0.12/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.32 % CPULimit : 300
% 0.12/0.32 % WCLimit : 300
% 0.12/0.32 % DateTime : Sun May 19 02:42:23 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/sandbox2/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.62/0.79 % (19969)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.62/0.79 % (19970)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.62/0.79 % (19968)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.62/0.79 % (19967)lrs+1011_1:1_sil=8000:sp=occurrence:nwc=10.0:i=78:ss=axioms:sgt=8_0 on theBenchmark for (2995ds/78Mi)
% 0.62/0.79 % (19972)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.62/0.79 % (19971)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.62/0.79 % (19965)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.62/0.79 % (19966)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.62/0.79 % (19967)First to succeed.
% 0.62/0.79 % (19965)Also succeeded, but the first one will report.
% 0.62/0.79 % (19967)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-19964"
% 0.62/0.79 % (19967)Refutation found. Thanks to Tanya!
% 0.62/0.79 % SZS status Theorem for theBenchmark
% 0.62/0.79 % SZS output start Proof for theBenchmark
% See solution above
% 0.62/0.79 % (19967)------------------------------
% 0.62/0.79 % (19967)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.62/0.79 % (19967)Termination reason: Refutation
% 0.62/0.79
% 0.62/0.79 % (19967)Memory used [KB]: 1178
% 0.62/0.79 % (19967)Time elapsed: 0.007 s
% 0.62/0.79 % (19967)Instructions burned: 10 (million)
% 0.62/0.79 % (19964)Success in time 0.461 s
% 0.62/0.79 % Vampire---4.8 exiting
%------------------------------------------------------------------------------