TSTP Solution File: SWC279+1 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SWC279+1 : TPTP v8.1.2. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : vampire --ignore_missing on --mode portfolio/casc [--schedule casc_hol_2020] -p tptp -om szs -t %d %s
% Computer : n018.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 : Thu Aug 31 20:58:05 EDT 2023
% Result : Theorem 0.22s 0.45s
% Output : Refutation 0.22s
% Verified :
% SZS Type : Refutation
% Derivation depth : 16
% Number of leaves : 13
% Syntax : Number of formulae : 57 ( 7 unt; 0 def)
% Number of atoms : 505 ( 68 equ)
% Maximal formula atoms : 48 ( 8 avg)
% Number of connectives : 660 ( 212 ~; 193 |; 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(f1010,plain,
$false,
inference(avatar_sat_refutation,[],[f590,f595,f600,f601,f1003,f1008]) ).
fof(f1008,plain,
( spl55_2
| ~ spl55_4 ),
inference(avatar_contradiction_clause,[],[f1007]) ).
fof(f1007,plain,
( $false
| spl55_2
| ~ spl55_4 ),
inference(subsumption_resolution,[],[f1006,f589]) ).
fof(f589,plain,
( ~ leq(sK4,sK7)
| spl55_2 ),
inference(avatar_component_clause,[],[f587]) ).
fof(f587,plain,
( spl55_2
<=> leq(sK4,sK7) ),
introduced(avatar_definition,[new_symbols(naming,[spl55_2])]) ).
fof(f1006,plain,
( leq(sK4,sK7)
| ~ spl55_4 ),
inference(subsumption_resolution,[],[f1004,f353]) ).
fof(f353,plain,
ssItem(sK7),
inference(cnf_transformation,[],[f232]) ).
fof(f232,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,f231,f230,f229,f228,f227,f226,f225,f224]) ).
fof(f224,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(f225,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(f226,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(f227,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(f228,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(f229,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(f230,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(f231,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/sandbox/tmp/tmp.namS95FJDp/Vampire---4.8_12490',co1) ).
fof(f1004,plain,
( ~ ssItem(sK7)
| leq(sK4,sK7)
| ~ spl55_4 ),
inference(resolution,[],[f599,f778]) ).
fof(f778,plain,
! [X4] :
( ~ memberP(sK6,X4)
| ~ ssItem(X4)
| leq(sK4,X4) ),
inference(subsumption_resolution,[],[f777,f349]) ).
fof(f349,plain,
ssItem(sK4),
inference(cnf_transformation,[],[f232]) ).
fof(f777,plain,
! [X4] :
( leq(sK4,X4)
| ~ ssItem(X4)
| ~ memberP(sK6,X4)
| ~ ssItem(sK4) ),
inference(subsumption_resolution,[],[f776,f350]) ).
fof(f350,plain,
ssList(sK5),
inference(cnf_transformation,[],[f232]) ).
fof(f776,plain,
! [X4] :
( leq(sK4,X4)
| ~ ssItem(X4)
| ~ memberP(sK6,X4)
| ~ ssList(sK5)
| ~ ssItem(sK4) ),
inference(subsumption_resolution,[],[f775,f351]) ).
fof(f351,plain,
ssList(sK6),
inference(cnf_transformation,[],[f232]) ).
fof(f775,plain,
! [X4] :
( leq(sK4,X4)
| ~ ssItem(X4)
| ~ memberP(sK6,X4)
| ~ ssList(sK6)
| ~ ssList(sK5)
| ~ ssItem(sK4) ),
inference(subsumption_resolution,[],[f756,f346]) ).
fof(f346,plain,
sK0 = sK2,
inference(cnf_transformation,[],[f232]) ).
fof(f756,plain,
! [X4] :
( sK0 != sK2
| leq(sK4,X4)
| ~ ssItem(X4)
| ~ memberP(sK6,X4)
| ~ ssList(sK6)
| ~ ssList(sK5)
| ~ ssItem(sK4) ),
inference(superposition,[],[f347,f352]) ).
fof(f352,plain,
sK0 = app(app(sK5,cons(sK4,nil)),sK6),
inference(cnf_transformation,[],[f232]) ).
fof(f347,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,[],[f232]) ).
fof(f599,plain,
( memberP(sK6,sK7)
| ~ spl55_4 ),
inference(avatar_component_clause,[],[f597]) ).
fof(f597,plain,
( spl55_4
<=> memberP(sK6,sK7) ),
introduced(avatar_definition,[new_symbols(naming,[spl55_4])]) ).
fof(f1003,plain,
( spl55_1
| ~ spl55_3 ),
inference(avatar_contradiction_clause,[],[f1002]) ).
fof(f1002,plain,
( $false
| spl55_1
| ~ spl55_3 ),
inference(subsumption_resolution,[],[f1001,f585]) ).
fof(f585,plain,
( ~ leq(sK7,sK4)
| spl55_1 ),
inference(avatar_component_clause,[],[f583]) ).
fof(f583,plain,
( spl55_1
<=> leq(sK7,sK4) ),
introduced(avatar_definition,[new_symbols(naming,[spl55_1])]) ).
fof(f1001,plain,
( leq(sK7,sK4)
| ~ spl55_3 ),
inference(subsumption_resolution,[],[f1000,f353]) ).
fof(f1000,plain,
( ~ ssItem(sK7)
| leq(sK7,sK4)
| ~ spl55_3 ),
inference(resolution,[],[f818,f594]) ).
fof(f594,plain,
( memberP(sK5,sK7)
| ~ spl55_3 ),
inference(avatar_component_clause,[],[f592]) ).
fof(f592,plain,
( spl55_3
<=> memberP(sK5,sK7) ),
introduced(avatar_definition,[new_symbols(naming,[spl55_3])]) ).
fof(f818,plain,
! [X4] :
( ~ memberP(sK5,X4)
| ~ ssItem(X4)
| leq(X4,sK4) ),
inference(subsumption_resolution,[],[f817,f349]) ).
fof(f817,plain,
! [X4] :
( leq(X4,sK4)
| ~ ssItem(X4)
| ~ memberP(sK5,X4)
| ~ ssItem(sK4) ),
inference(subsumption_resolution,[],[f816,f350]) ).
fof(f816,plain,
! [X4] :
( leq(X4,sK4)
| ~ ssItem(X4)
| ~ memberP(sK5,X4)
| ~ ssList(sK5)
| ~ ssItem(sK4) ),
inference(subsumption_resolution,[],[f815,f351]) ).
fof(f815,plain,
! [X4] :
( leq(X4,sK4)
| ~ ssItem(X4)
| ~ memberP(sK5,X4)
| ~ ssList(sK6)
| ~ ssList(sK5)
| ~ ssItem(sK4) ),
inference(subsumption_resolution,[],[f798,f346]) ).
fof(f798,plain,
! [X4] :
( sK0 != sK2
| leq(X4,sK4)
| ~ ssItem(X4)
| ~ memberP(sK5,X4)
| ~ ssList(sK6)
| ~ ssList(sK5)
| ~ ssItem(sK4) ),
inference(superposition,[],[f348,f352]) ).
fof(f348,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,[],[f232]) ).
fof(f601,plain,
( spl55_3
| spl55_4 ),
inference(avatar_split_clause,[],[f354,f597,f592]) ).
fof(f354,plain,
( memberP(sK6,sK7)
| memberP(sK5,sK7) ),
inference(cnf_transformation,[],[f232]) ).
fof(f600,plain,
( ~ spl55_1
| spl55_4 ),
inference(avatar_split_clause,[],[f355,f597,f583]) ).
fof(f355,plain,
( memberP(sK6,sK7)
| ~ leq(sK7,sK4) ),
inference(cnf_transformation,[],[f232]) ).
fof(f595,plain,
( spl55_3
| ~ spl55_2 ),
inference(avatar_split_clause,[],[f356,f587,f592]) ).
fof(f356,plain,
( ~ leq(sK4,sK7)
| memberP(sK5,sK7) ),
inference(cnf_transformation,[],[f232]) ).
fof(f590,plain,
( ~ spl55_1
| ~ spl55_2 ),
inference(avatar_split_clause,[],[f357,f587,f583]) ).
fof(f357,plain,
( ~ leq(sK4,sK7)
| ~ leq(sK7,sK4) ),
inference(cnf_transformation,[],[f232]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : SWC279+1 : TPTP v8.1.2. Released v2.4.0.
% 0.07/0.15 % Command : vampire --ignore_missing on --mode portfolio/casc [--schedule casc_hol_2020] -p tptp -om szs -t %d %s
% 0.15/0.36 % Computer : n018.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.36 % CPULimit : 300
% 0.15/0.36 % WCLimit : 300
% 0.15/0.36 % DateTime : Mon Aug 28 15:00:17 EDT 2023
% 0.15/0.37 % CPUTime :
% 0.15/0.37 This is a FOF_THM_RFO_SEQ problem
% 0.15/0.37 Running vampire_casc2023 --mode casc -m 16384 --cores 7 -t 300 /export/starexec/sandbox/tmp/tmp.namS95FJDp/Vampire---4.8_12490
% 0.15/0.37 % (12818)Running in auto input_syntax mode. Trying TPTP
% 0.22/0.44 % (12829)ott+1011_4_er=known:fsd=off:nm=4:tgt=ground_499 on Vampire---4 for (499ds/0Mi)
% 0.22/0.44 % (12827)lrs-1004_3_av=off:ep=RSTC:fsd=off:fsr=off:urr=ec_only:stl=62_525 on Vampire---4 for (525ds/0Mi)
% 0.22/0.44 % (12831)lrs+10_1024_av=off:bsr=on:br=off:ep=RSTC:fsd=off:irw=on:nm=4:nwc=1.1:sims=off:urr=on:stl=125_440 on Vampire---4 for (440ds/0Mi)
% 0.22/0.44 % (12826)lrs+1011_1_bd=preordered:flr=on:fsd=off:fsr=off:irw=on:lcm=reverse:msp=off:nm=2:nwc=10.0:sos=on:sp=reverse_weighted_frequency:tgt=full:stl=62_562 on Vampire---4 for (562ds/0Mi)
% 0.22/0.44 % (12832)ott+1010_2:5_bd=off:fsd=off:fde=none:nm=16:sos=on_419 on Vampire---4 for (419ds/0Mi)
% 0.22/0.44 % (12828)lrs+10_4:5_amm=off:bsr=on:bce=on:flr=on:fsd=off:fde=unused:gs=on:gsem=on:lcm=predicate:sos=all:tgt=ground:stl=62_514 on Vampire---4 for (514ds/0Mi)
% 0.22/0.45 % (12830)ott+11_8:1_aac=none:amm=sco:anc=none:er=known:flr=on:fde=unused:irw=on:nm=0:nwc=1.2:nicw=on:sims=off:sos=all:sac=on_470 on Vampire---4 for (470ds/0Mi)
% 0.22/0.45 % (12832)First to succeed.
% 0.22/0.45 % (12832)Refutation found. Thanks to Tanya!
% 0.22/0.45 % SZS status Theorem for Vampire---4
% 0.22/0.45 % SZS output start Proof for Vampire---4
% See solution above
% 0.22/0.45 % (12832)------------------------------
% 0.22/0.45 % (12832)Version: Vampire 4.7 (commit 05ef610bd on 2023-06-21 19:03:17 +0100)
% 0.22/0.45 % (12832)Linked with Z3 4.9.1.0 6ed071b44407cf6623b8d3c0dceb2a8fb7040cee z3-4.8.4-6427-g6ed071b44
% 0.22/0.45 % (12832)Termination reason: Refutation
% 0.22/0.45
% 0.22/0.45 % (12832)Memory used [KB]: 6268
% 0.22/0.45 % (12832)Time elapsed: 0.018 s
% 0.22/0.45 % (12832)------------------------------
% 0.22/0.45 % (12832)------------------------------
% 0.22/0.45 % (12818)Success in time 0.082 s
% 0.22/0.46 % Vampire---4.8 exiting
%------------------------------------------------------------------------------