TSTP Solution File: SWC231+1 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SWC231+1 : TPTP v8.1.2. 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/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 04:00:45 EDT 2024
% Result : Theorem 0.58s 0.76s
% Output : Refutation 0.58s
% Verified :
% SZS Type : Refutation
% Derivation depth : 17
% Number of leaves : 24
% Syntax : Number of formulae : 87 ( 10 unt; 0 def)
% Number of atoms : 674 ( 151 equ)
% Maximal formula atoms : 52 ( 7 avg)
% Number of connectives : 936 ( 349 ~; 333 |; 215 &)
% ( 7 <=>; 32 =>; 0 <=; 0 <~>)
% Maximal formula depth : 23 ( 7 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 14 ( 12 usr; 8 prp; 0-2 aty)
% Number of functors : 13 ( 13 usr; 8 con; 0-3 aty)
% Number of variables : 247 ( 159 !; 88 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f902,plain,
$false,
inference(avatar_sat_refutation,[],[f617,f673,f689,f725,f733,f769,f773,f901]) ).
fof(f901,plain,
( ~ spl55_19
| spl55_1
| ~ spl55_30
| ~ spl55_31 ),
inference(avatar_split_clause,[],[f900,f771,f767,f590,f697]) ).
fof(f697,plain,
( spl55_19
<=> ssList(sK49) ),
introduced(avatar_definition,[new_symbols(naming,[spl55_19])]) ).
fof(f590,plain,
( spl55_1
<=> nil = sK49 ),
introduced(avatar_definition,[new_symbols(naming,[spl55_1])]) ).
fof(f767,plain,
( spl55_30
<=> ! [X0,X1] :
( ~ ssItem(X0)
| memberP(nil,sK54(X0,nil,X1))
| ~ ssList(X1)
| sK49 != app(cons(X0,nil),X1) ) ),
introduced(avatar_definition,[new_symbols(naming,[spl55_30])]) ).
fof(f771,plain,
( spl55_31
<=> ! [X0,X1] :
( ~ ssItem(X0)
| ssItem(sK54(X0,nil,X1))
| ~ ssList(X1)
| sK49 != app(cons(X0,nil),X1) ) ),
introduced(avatar_definition,[new_symbols(naming,[spl55_31])]) ).
fof(f900,plain,
( nil = sK49
| ~ ssList(sK49)
| ~ spl55_30
| ~ spl55_31 ),
inference(equality_resolution,[],[f899]) ).
fof(f899,plain,
( ! [X0] :
( sK49 != X0
| nil = X0
| ~ ssList(X0) )
| ~ spl55_30
| ~ spl55_31 ),
inference(duplicate_literal_removal,[],[f898]) ).
fof(f898,plain,
( ! [X0] :
( sK49 != X0
| nil = X0
| ~ ssList(X0)
| nil = X0
| ~ ssList(X0) )
| ~ spl55_30
| ~ spl55_31 ),
inference(resolution,[],[f897,f428]) ).
fof(f428,plain,
! [X0] :
( ssItem(sK44(X0))
| nil = X0
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f307]) ).
fof(f307,plain,
! [X0] :
( ( cons(sK44(X0),sK43(X0)) = X0
& ssItem(sK44(X0))
& ssList(sK43(X0)) )
| nil = X0
| ~ ssList(X0) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK43,sK44])],[f125,f306,f305]) ).
fof(f305,plain,
! [X0] :
( ? [X1] :
( ? [X2] :
( cons(X2,X1) = X0
& ssItem(X2) )
& ssList(X1) )
=> ( ? [X2] :
( cons(X2,sK43(X0)) = X0
& ssItem(X2) )
& ssList(sK43(X0)) ) ),
introduced(choice_axiom,[]) ).
fof(f306,plain,
! [X0] :
( ? [X2] :
( cons(X2,sK43(X0)) = X0
& ssItem(X2) )
=> ( cons(sK44(X0),sK43(X0)) = X0
& ssItem(sK44(X0)) ) ),
introduced(choice_axiom,[]) ).
fof(f125,plain,
! [X0] :
( ? [X1] :
( ? [X2] :
( cons(X2,X1) = X0
& ssItem(X2) )
& ssList(X1) )
| nil = X0
| ~ ssList(X0) ),
inference(flattening,[],[f124]) ).
fof(f124,plain,
! [X0] :
( ? [X1] :
( ? [X2] :
( cons(X2,X1) = X0
& ssItem(X2) )
& ssList(X1) )
| nil = X0
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f20]) ).
fof(f20,axiom,
! [X0] :
( ssList(X0)
=> ( ? [X1] :
( ? [X2] :
( cons(X2,X1) = X0
& ssItem(X2) )
& ssList(X1) )
| nil = X0 ) ),
file('/export/starexec/sandbox/tmp/tmp.ehOyysK9uy/Vampire---4.8_29542',ax20) ).
fof(f897,plain,
( ! [X0] :
( ~ ssItem(sK44(X0))
| sK49 != X0
| nil = X0
| ~ ssList(X0) )
| ~ spl55_30
| ~ spl55_31 ),
inference(duplicate_literal_removal,[],[f896]) ).
fof(f896,plain,
( ! [X0] :
( ~ ssItem(sK44(X0))
| sK49 != X0
| nil = X0
| ~ ssList(X0)
| nil = X0
| ~ ssList(X0) )
| ~ spl55_30
| ~ spl55_31 ),
inference(resolution,[],[f894,f427]) ).
fof(f427,plain,
! [X0] :
( ssList(sK43(X0))
| nil = X0
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f307]) ).
fof(f894,plain,
( ! [X0] :
( ~ ssList(sK43(X0))
| ~ ssItem(sK44(X0))
| sK49 != X0
| nil = X0
| ~ ssList(X0) )
| ~ spl55_30
| ~ spl55_31 ),
inference(superposition,[],[f893,f429]) ).
fof(f429,plain,
! [X0] :
( cons(sK44(X0),sK43(X0)) = X0
| nil = X0
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f307]) ).
fof(f893,plain,
( ! [X0,X1] :
( cons(X0,X1) != sK49
| ~ ssItem(X0)
| ~ ssList(X1) )
| ~ spl55_30
| ~ spl55_31 ),
inference(duplicate_literal_removal,[],[f890]) ).
fof(f890,plain,
( ! [X0,X1] :
( cons(X0,X1) != sK49
| ~ ssItem(X0)
| cons(X0,X1) != sK49
| ~ ssList(X1)
| ~ ssItem(X0)
| ~ ssList(X1) )
| ~ spl55_30
| ~ spl55_31 ),
inference(superposition,[],[f886,f511]) ).
fof(f511,plain,
! [X0,X1] :
( cons(X1,X0) = app(cons(X1,nil),X0)
| ~ ssItem(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f199]) ).
fof(f199,plain,
! [X0] :
( ! [X1] :
( cons(X1,X0) = app(cons(X1,nil),X0)
| ~ ssItem(X1) )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f81]) ).
fof(f81,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssItem(X1)
=> cons(X1,X0) = app(cons(X1,nil),X0) ) ),
file('/export/starexec/sandbox/tmp/tmp.ehOyysK9uy/Vampire---4.8_29542',ax81) ).
fof(f886,plain,
( ! [X0,X1] :
( app(cons(X1,nil),X0) != sK49
| ~ ssItem(X1)
| cons(X1,X0) != sK49
| ~ ssList(X0) )
| ~ spl55_30
| ~ spl55_31 ),
inference(duplicate_literal_removal,[],[f883]) ).
fof(f883,plain,
( ! [X0,X1] :
( ~ ssList(X0)
| ~ ssItem(X1)
| cons(X1,X0) != sK49
| ~ ssItem(X1)
| ~ ssList(X0)
| app(cons(X1,nil),X0) != sK49 )
| ~ spl55_30
| ~ spl55_31 ),
inference(resolution,[],[f882,f772]) ).
fof(f772,plain,
( ! [X0,X1] :
( ssItem(sK54(X0,nil,X1))
| ~ ssItem(X0)
| ~ ssList(X1)
| sK49 != app(cons(X0,nil),X1) )
| ~ spl55_31 ),
inference(avatar_component_clause,[],[f771]) ).
fof(f882,plain,
( ! [X0,X1] :
( ~ ssItem(sK54(X0,nil,X1))
| ~ ssList(X1)
| ~ ssItem(X0)
| cons(X0,X1) != sK49 )
| ~ spl55_30 ),
inference(duplicate_literal_removal,[],[f863]) ).
fof(f863,plain,
( ! [X0,X1] :
( cons(X0,X1) != sK49
| ~ ssList(X1)
| ~ ssItem(X0)
| ~ ssItem(sK54(X0,nil,X1))
| ~ ssItem(X0)
| ~ ssList(X1) )
| ~ spl55_30 ),
inference(superposition,[],[f778,f511]) ).
fof(f778,plain,
( ! [X0,X1] :
( sK49 != app(cons(X0,nil),X1)
| ~ ssList(X1)
| ~ ssItem(X0)
| ~ ssItem(sK54(X0,nil,X1)) )
| ~ spl55_30 ),
inference(resolution,[],[f768,f453]) ).
fof(f453,plain,
! [X0] :
( ~ memberP(nil,X0)
| ~ ssItem(X0) ),
inference(cnf_transformation,[],[f149]) ).
fof(f149,plain,
! [X0] :
( ~ memberP(nil,X0)
| ~ ssItem(X0) ),
inference(ennf_transformation,[],[f38]) ).
fof(f38,axiom,
! [X0] :
( ssItem(X0)
=> ~ memberP(nil,X0) ),
file('/export/starexec/sandbox/tmp/tmp.ehOyysK9uy/Vampire---4.8_29542',ax38) ).
fof(f768,plain,
( ! [X0,X1] :
( memberP(nil,sK54(X0,nil,X1))
| ~ ssItem(X0)
| ~ ssList(X1)
| sK49 != app(cons(X0,nil),X1) )
| ~ spl55_30 ),
inference(avatar_component_clause,[],[f767]) ).
fof(f773,plain,
( ~ spl55_13
| spl55_31
| ~ spl55_18 ),
inference(avatar_split_clause,[],[f749,f687,f771,f667]) ).
fof(f667,plain,
( spl55_13
<=> ssList(nil) ),
introduced(avatar_definition,[new_symbols(naming,[spl55_13])]) ).
fof(f687,plain,
( spl55_18
<=> ! [X0,X1] :
( sK49 != app(cons(X0,nil),X1)
| ~ ssList(cons(X0,nil))
| ~ ssItem(X0)
| ~ ssList(X1)
| ssItem(sK54(X0,nil,X1)) ) ),
introduced(avatar_definition,[new_symbols(naming,[spl55_18])]) ).
fof(f749,plain,
( ! [X0,X1] :
( ~ ssItem(X0)
| ~ ssList(nil)
| sK49 != app(cons(X0,nil),X1)
| ~ ssList(X1)
| ssItem(sK54(X0,nil,X1)) )
| ~ spl55_18 ),
inference(duplicate_literal_removal,[],[f748]) ).
fof(f748,plain,
( ! [X0,X1] :
( ~ ssItem(X0)
| ~ ssList(nil)
| sK49 != app(cons(X0,nil),X1)
| ~ ssItem(X0)
| ~ ssList(X1)
| ssItem(sK54(X0,nil,X1)) )
| ~ spl55_18 ),
inference(resolution,[],[f422,f688]) ).
fof(f688,plain,
( ! [X0,X1] :
( ~ ssList(cons(X0,nil))
| sK49 != app(cons(X0,nil),X1)
| ~ ssItem(X0)
| ~ ssList(X1)
| ssItem(sK54(X0,nil,X1)) )
| ~ spl55_18 ),
inference(avatar_component_clause,[],[f687]) ).
fof(f422,plain,
! [X0,X1] :
( ssList(cons(X1,X0))
| ~ ssItem(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f120]) ).
fof(f120,plain,
! [X0] :
( ! [X1] :
( ssList(cons(X1,X0))
| ~ ssItem(X1) )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f16]) ).
fof(f16,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssItem(X1)
=> ssList(cons(X1,X0)) ) ),
file('/export/starexec/sandbox/tmp/tmp.ehOyysK9uy/Vampire---4.8_29542',ax16) ).
fof(f769,plain,
( ~ spl55_13
| spl55_30
| ~ spl55_14 ),
inference(avatar_split_clause,[],[f750,f671,f767,f667]) ).
fof(f671,plain,
( spl55_14
<=> ! [X0,X1] :
( sK49 != app(cons(X0,nil),X1)
| ~ ssList(cons(X0,nil))
| ~ ssItem(X0)
| ~ ssList(X1)
| memberP(nil,sK54(X0,nil,X1)) ) ),
introduced(avatar_definition,[new_symbols(naming,[spl55_14])]) ).
fof(f750,plain,
( ! [X0,X1] :
( ~ ssItem(X0)
| ~ ssList(nil)
| sK49 != app(cons(X0,nil),X1)
| ~ ssList(X1)
| memberP(nil,sK54(X0,nil,X1)) )
| ~ spl55_14 ),
inference(duplicate_literal_removal,[],[f747]) ).
fof(f747,plain,
( ! [X0,X1] :
( ~ ssItem(X0)
| ~ ssList(nil)
| sK49 != app(cons(X0,nil),X1)
| ~ ssItem(X0)
| ~ ssList(X1)
| memberP(nil,sK54(X0,nil,X1)) )
| ~ spl55_14 ),
inference(resolution,[],[f422,f672]) ).
fof(f672,plain,
( ! [X0,X1] :
( ~ ssList(cons(X0,nil))
| sK49 != app(cons(X0,nil),X1)
| ~ ssItem(X0)
| ~ ssList(X1)
| memberP(nil,sK54(X0,nil,X1)) )
| ~ spl55_14 ),
inference(avatar_component_clause,[],[f671]) ).
fof(f733,plain,
spl55_19,
inference(avatar_contradiction_clause,[],[f732]) ).
fof(f732,plain,
( $false
| spl55_19 ),
inference(resolution,[],[f699,f532]) ).
fof(f532,plain,
ssList(sK49),
inference(cnf_transformation,[],[f339]) ).
fof(f339,plain,
( ( ( ! [X7] :
( ~ leq(sK51,X7)
| ~ memberP(sK53,X7)
| ~ memberP(sK52,X7)
| leq(X7,sK51)
| ~ ssItem(X7) )
& sK49 = app(app(sK52,cons(sK51,nil)),sK53)
& ssList(sK53)
& ssList(sK52)
& ssItem(sK51) )
| nil = sK49 )
& ! [X8] :
( ! [X9] :
( ! [X10] :
( ( ~ lt(X8,sK54(X8,X9,X10))
& leq(X8,sK54(X8,X9,X10))
& memberP(X10,sK54(X8,X9,X10))
& memberP(X9,sK54(X8,X9,X10))
& ssItem(sK54(X8,X9,X10)) )
| app(app(X9,cons(X8,nil)),X10) != sK47
| ~ ssList(X10) )
| ~ ssList(X9) )
| ~ ssItem(X8) )
& nil != sK47
& sK47 = sK49
& sK48 = sK50
& ssList(sK50)
& ssList(sK49)
& ssList(sK48)
& ssList(sK47) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK47,sK48,sK49,sK50,sK51,sK52,sK53,sK54])],[f222,f338,f337,f336,f335,f334,f333,f332,f331]) ).
fof(f331,plain,
( ? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ? [X4] :
( ? [X5] :
( ? [X6] :
( ! [X7] :
( ~ leq(X4,X7)
| ~ memberP(X6,X7)
| ~ memberP(X5,X7)
| leq(X7,X4)
| ~ ssItem(X7) )
& app(app(X5,cons(X4,nil)),X6) = X2
& ssList(X6) )
& ssList(X5) )
& ssItem(X4) )
| nil = X2 )
& ! [X8] :
( ! [X9] :
( ! [X10] :
( ? [X11] :
( ~ lt(X8,X11)
& leq(X8,X11)
& memberP(X10,X11)
& memberP(X9,X11)
& ssItem(X11) )
| app(app(X9,cons(X8,nil)),X10) != X0
| ~ ssList(X10) )
| ~ ssList(X9) )
| ~ ssItem(X8) )
& nil != X0
& 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)
| ~ memberP(X5,X7)
| leq(X7,X4)
| ~ ssItem(X7) )
& app(app(X5,cons(X4,nil)),X6) = X2
& ssList(X6) )
& ssList(X5) )
& ssItem(X4) )
| nil = X2 )
& ! [X8] :
( ! [X9] :
( ! [X10] :
( ? [X11] :
( ~ lt(X8,X11)
& leq(X8,X11)
& memberP(X10,X11)
& memberP(X9,X11)
& ssItem(X11) )
| app(app(X9,cons(X8,nil)),X10) != sK47
| ~ ssList(X10) )
| ~ ssList(X9) )
| ~ ssItem(X8) )
& nil != sK47
& sK47 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(sK47) ) ),
introduced(choice_axiom,[]) ).
fof(f332,plain,
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ? [X4] :
( ? [X5] :
( ? [X6] :
( ! [X7] :
( ~ leq(X4,X7)
| ~ memberP(X6,X7)
| ~ memberP(X5,X7)
| leq(X7,X4)
| ~ ssItem(X7) )
& app(app(X5,cons(X4,nil)),X6) = X2
& ssList(X6) )
& ssList(X5) )
& ssItem(X4) )
| nil = X2 )
& ! [X8] :
( ! [X9] :
( ! [X10] :
( ? [X11] :
( ~ lt(X8,X11)
& leq(X8,X11)
& memberP(X10,X11)
& memberP(X9,X11)
& ssItem(X11) )
| app(app(X9,cons(X8,nil)),X10) != sK47
| ~ ssList(X10) )
| ~ ssList(X9) )
| ~ ssItem(X8) )
& nil != sK47
& sK47 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
=> ( ? [X2] :
( ? [X3] :
( ( ? [X4] :
( ? [X5] :
( ? [X6] :
( ! [X7] :
( ~ leq(X4,X7)
| ~ memberP(X6,X7)
| ~ memberP(X5,X7)
| leq(X7,X4)
| ~ ssItem(X7) )
& app(app(X5,cons(X4,nil)),X6) = X2
& ssList(X6) )
& ssList(X5) )
& ssItem(X4) )
| nil = X2 )
& ! [X8] :
( ! [X9] :
( ! [X10] :
( ? [X11] :
( ~ lt(X8,X11)
& leq(X8,X11)
& memberP(X10,X11)
& memberP(X9,X11)
& ssItem(X11) )
| app(app(X9,cons(X8,nil)),X10) != sK47
| ~ ssList(X10) )
| ~ ssList(X9) )
| ~ ssItem(X8) )
& nil != sK47
& sK47 = X2
& sK48 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(sK48) ) ),
introduced(choice_axiom,[]) ).
fof(f333,plain,
( ? [X2] :
( ? [X3] :
( ( ? [X4] :
( ? [X5] :
( ? [X6] :
( ! [X7] :
( ~ leq(X4,X7)
| ~ memberP(X6,X7)
| ~ memberP(X5,X7)
| leq(X7,X4)
| ~ ssItem(X7) )
& app(app(X5,cons(X4,nil)),X6) = X2
& ssList(X6) )
& ssList(X5) )
& ssItem(X4) )
| nil = X2 )
& ! [X8] :
( ! [X9] :
( ! [X10] :
( ? [X11] :
( ~ lt(X8,X11)
& leq(X8,X11)
& memberP(X10,X11)
& memberP(X9,X11)
& ssItem(X11) )
| app(app(X9,cons(X8,nil)),X10) != sK47
| ~ ssList(X10) )
| ~ ssList(X9) )
| ~ ssItem(X8) )
& nil != sK47
& sK47 = X2
& sK48 = X3
& ssList(X3) )
& ssList(X2) )
=> ( ? [X3] :
( ( ? [X4] :
( ? [X5] :
( ? [X6] :
( ! [X7] :
( ~ leq(X4,X7)
| ~ memberP(X6,X7)
| ~ memberP(X5,X7)
| leq(X7,X4)
| ~ ssItem(X7) )
& app(app(X5,cons(X4,nil)),X6) = sK49
& ssList(X6) )
& ssList(X5) )
& ssItem(X4) )
| nil = sK49 )
& ! [X8] :
( ! [X9] :
( ! [X10] :
( ? [X11] :
( ~ lt(X8,X11)
& leq(X8,X11)
& memberP(X10,X11)
& memberP(X9,X11)
& ssItem(X11) )
| app(app(X9,cons(X8,nil)),X10) != sK47
| ~ ssList(X10) )
| ~ ssList(X9) )
| ~ ssItem(X8) )
& nil != sK47
& sK47 = sK49
& sK48 = X3
& ssList(X3) )
& ssList(sK49) ) ),
introduced(choice_axiom,[]) ).
fof(f334,plain,
( ? [X3] :
( ( ? [X4] :
( ? [X5] :
( ? [X6] :
( ! [X7] :
( ~ leq(X4,X7)
| ~ memberP(X6,X7)
| ~ memberP(X5,X7)
| leq(X7,X4)
| ~ ssItem(X7) )
& app(app(X5,cons(X4,nil)),X6) = sK49
& ssList(X6) )
& ssList(X5) )
& ssItem(X4) )
| nil = sK49 )
& ! [X8] :
( ! [X9] :
( ! [X10] :
( ? [X11] :
( ~ lt(X8,X11)
& leq(X8,X11)
& memberP(X10,X11)
& memberP(X9,X11)
& ssItem(X11) )
| app(app(X9,cons(X8,nil)),X10) != sK47
| ~ ssList(X10) )
| ~ ssList(X9) )
| ~ ssItem(X8) )
& nil != sK47
& sK47 = sK49
& sK48 = X3
& ssList(X3) )
=> ( ( ? [X4] :
( ? [X5] :
( ? [X6] :
( ! [X7] :
( ~ leq(X4,X7)
| ~ memberP(X6,X7)
| ~ memberP(X5,X7)
| leq(X7,X4)
| ~ ssItem(X7) )
& app(app(X5,cons(X4,nil)),X6) = sK49
& ssList(X6) )
& ssList(X5) )
& ssItem(X4) )
| nil = sK49 )
& ! [X8] :
( ! [X9] :
( ! [X10] :
( ? [X11] :
( ~ lt(X8,X11)
& leq(X8,X11)
& memberP(X10,X11)
& memberP(X9,X11)
& ssItem(X11) )
| app(app(X9,cons(X8,nil)),X10) != sK47
| ~ ssList(X10) )
| ~ ssList(X9) )
| ~ ssItem(X8) )
& nil != sK47
& sK47 = sK49
& sK48 = sK50
& ssList(sK50) ) ),
introduced(choice_axiom,[]) ).
fof(f335,plain,
( ? [X4] :
( ? [X5] :
( ? [X6] :
( ! [X7] :
( ~ leq(X4,X7)
| ~ memberP(X6,X7)
| ~ memberP(X5,X7)
| leq(X7,X4)
| ~ ssItem(X7) )
& app(app(X5,cons(X4,nil)),X6) = sK49
& ssList(X6) )
& ssList(X5) )
& ssItem(X4) )
=> ( ? [X5] :
( ? [X6] :
( ! [X7] :
( ~ leq(sK51,X7)
| ~ memberP(X6,X7)
| ~ memberP(X5,X7)
| leq(X7,sK51)
| ~ ssItem(X7) )
& sK49 = app(app(X5,cons(sK51,nil)),X6)
& ssList(X6) )
& ssList(X5) )
& ssItem(sK51) ) ),
introduced(choice_axiom,[]) ).
fof(f336,plain,
( ? [X5] :
( ? [X6] :
( ! [X7] :
( ~ leq(sK51,X7)
| ~ memberP(X6,X7)
| ~ memberP(X5,X7)
| leq(X7,sK51)
| ~ ssItem(X7) )
& sK49 = app(app(X5,cons(sK51,nil)),X6)
& ssList(X6) )
& ssList(X5) )
=> ( ? [X6] :
( ! [X7] :
( ~ leq(sK51,X7)
| ~ memberP(X6,X7)
| ~ memberP(sK52,X7)
| leq(X7,sK51)
| ~ ssItem(X7) )
& sK49 = app(app(sK52,cons(sK51,nil)),X6)
& ssList(X6) )
& ssList(sK52) ) ),
introduced(choice_axiom,[]) ).
fof(f337,plain,
( ? [X6] :
( ! [X7] :
( ~ leq(sK51,X7)
| ~ memberP(X6,X7)
| ~ memberP(sK52,X7)
| leq(X7,sK51)
| ~ ssItem(X7) )
& sK49 = app(app(sK52,cons(sK51,nil)),X6)
& ssList(X6) )
=> ( ! [X7] :
( ~ leq(sK51,X7)
| ~ memberP(sK53,X7)
| ~ memberP(sK52,X7)
| leq(X7,sK51)
| ~ ssItem(X7) )
& sK49 = app(app(sK52,cons(sK51,nil)),sK53)
& ssList(sK53) ) ),
introduced(choice_axiom,[]) ).
fof(f338,plain,
! [X8,X9,X10] :
( ? [X11] :
( ~ lt(X8,X11)
& leq(X8,X11)
& memberP(X10,X11)
& memberP(X9,X11)
& ssItem(X11) )
=> ( ~ lt(X8,sK54(X8,X9,X10))
& leq(X8,sK54(X8,X9,X10))
& memberP(X10,sK54(X8,X9,X10))
& memberP(X9,sK54(X8,X9,X10))
& ssItem(sK54(X8,X9,X10)) ) ),
introduced(choice_axiom,[]) ).
fof(f222,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ? [X4] :
( ? [X5] :
( ? [X6] :
( ! [X7] :
( ~ leq(X4,X7)
| ~ memberP(X6,X7)
| ~ memberP(X5,X7)
| leq(X7,X4)
| ~ ssItem(X7) )
& app(app(X5,cons(X4,nil)),X6) = X2
& ssList(X6) )
& ssList(X5) )
& ssItem(X4) )
| nil = X2 )
& ! [X8] :
( ! [X9] :
( ! [X10] :
( ? [X11] :
( ~ lt(X8,X11)
& leq(X8,X11)
& memberP(X10,X11)
& memberP(X9,X11)
& ssItem(X11) )
| app(app(X9,cons(X8,nil)),X10) != X0
| ~ ssList(X10) )
| ~ ssList(X9) )
| ~ ssItem(X8) )
& nil != X0
& 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] :
( ( ! [X4] :
( ssItem(X4)
=> ! [X5] :
( ssList(X5)
=> ! [X6] :
( ? [X7] :
( leq(X4,X7)
& memberP(X6,X7)
& memberP(X5,X7)
& ~ leq(X7,X4)
& ssItem(X7) )
| app(app(X5,cons(X4,nil)),X6) != X2
| ~ ssList(X6) ) ) )
& nil != X2 )
| ? [X8] :
( ? [X9] :
( ? [X10] :
( ! [X11] :
( lt(X8,X11)
| ~ leq(X8,X11)
| ~ memberP(X10,X11)
| ~ memberP(X9,X11)
| ~ ssItem(X11) )
& app(app(X9,cons(X8,nil)),X10) = X0
& ssList(X10) )
& ssList(X9) )
& ssItem(X8) )
| nil = X0
| X0 != X2
| X1 != X3
| ~ ssList(X3) ) ) ) ),
inference(rectify,[],[f97]) ).
fof(f97,negated_conjecture,
~ ! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ( ! [X8] :
( ssItem(X8)
=> ! [X9] :
( ssList(X9)
=> ! [X10] :
( ? [X11] :
( leq(X8,X11)
& memberP(X10,X11)
& memberP(X9,X11)
& ~ leq(X11,X8)
& ssItem(X11) )
| app(app(X9,cons(X8,nil)),X10) != X2
| ~ ssList(X10) ) ) )
& nil != X2 )
| ? [X4] :
( ? [X5] :
( ? [X6] :
( ! [X7] :
( lt(X4,X7)
| ~ leq(X4,X7)
| ~ memberP(X6,X7)
| ~ memberP(X5,X7)
| ~ ssItem(X7) )
& app(app(X5,cons(X4,nil)),X6) = X0
& ssList(X6) )
& ssList(X5) )
& ssItem(X4) )
| nil = X0
| X0 != X2
| X1 != X3
| ~ ssList(X3) ) ) ) ),
inference(negated_conjecture,[],[f96]) ).
fof(f96,conjecture,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ( ! [X8] :
( ssItem(X8)
=> ! [X9] :
( ssList(X9)
=> ! [X10] :
( ? [X11] :
( leq(X8,X11)
& memberP(X10,X11)
& memberP(X9,X11)
& ~ leq(X11,X8)
& ssItem(X11) )
| app(app(X9,cons(X8,nil)),X10) != X2
| ~ ssList(X10) ) ) )
& nil != X2 )
| ? [X4] :
( ? [X5] :
( ? [X6] :
( ! [X7] :
( lt(X4,X7)
| ~ leq(X4,X7)
| ~ memberP(X6,X7)
| ~ memberP(X5,X7)
| ~ ssItem(X7) )
& app(app(X5,cons(X4,nil)),X6) = X0
& ssList(X6) )
& ssList(X5) )
& ssItem(X4) )
| nil = X0
| X0 != X2
| X1 != X3
| ~ ssList(X3) ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.ehOyysK9uy/Vampire---4.8_29542',co1) ).
fof(f699,plain,
( ~ ssList(sK49)
| spl55_19 ),
inference(avatar_component_clause,[],[f697]) ).
fof(f725,plain,
spl55_13,
inference(avatar_contradiction_clause,[],[f724]) ).
fof(f724,plain,
( $false
| spl55_13 ),
inference(resolution,[],[f669,f423]) ).
fof(f423,plain,
ssList(nil),
inference(cnf_transformation,[],[f17]) ).
fof(f17,axiom,
ssList(nil),
file('/export/starexec/sandbox/tmp/tmp.ehOyysK9uy/Vampire---4.8_29542',ax17) ).
fof(f669,plain,
( ~ ssList(nil)
| spl55_13 ),
inference(avatar_component_clause,[],[f667]) ).
fof(f689,plain,
( ~ spl55_13
| spl55_18 ),
inference(avatar_split_clause,[],[f665,f687,f667]) ).
fof(f665,plain,
! [X0,X1] :
( sK49 != app(cons(X0,nil),X1)
| ssItem(sK54(X0,nil,X1))
| ~ ssList(X1)
| ~ ssList(nil)
| ~ ssItem(X0)
| ~ ssList(cons(X0,nil)) ),
inference(superposition,[],[f551,f437]) ).
fof(f437,plain,
! [X0] :
( app(nil,X0) = X0
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f135]) ).
fof(f135,plain,
! [X0] :
( app(nil,X0) = X0
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f28]) ).
fof(f28,axiom,
! [X0] :
( ssList(X0)
=> app(nil,X0) = X0 ),
file('/export/starexec/sandbox/tmp/tmp.ehOyysK9uy/Vampire---4.8_29542',ax28) ).
fof(f551,plain,
! [X10,X8,X9] :
( app(app(X9,cons(X8,nil)),X10) != sK49
| ssItem(sK54(X8,X9,X10))
| ~ ssList(X10)
| ~ ssList(X9)
| ~ ssItem(X8) ),
inference(definition_unfolding,[],[f537,f535]) ).
fof(f535,plain,
sK47 = sK49,
inference(cnf_transformation,[],[f339]) ).
fof(f537,plain,
! [X10,X8,X9] :
( ssItem(sK54(X8,X9,X10))
| app(app(X9,cons(X8,nil)),X10) != sK47
| ~ ssList(X10)
| ~ ssList(X9)
| ~ ssItem(X8) ),
inference(cnf_transformation,[],[f339]) ).
fof(f673,plain,
( ~ spl55_13
| spl55_14 ),
inference(avatar_split_clause,[],[f661,f671,f667]) ).
fof(f661,plain,
! [X0,X1] :
( sK49 != app(cons(X0,nil),X1)
| memberP(nil,sK54(X0,nil,X1))
| ~ ssList(X1)
| ~ ssList(nil)
| ~ ssItem(X0)
| ~ ssList(cons(X0,nil)) ),
inference(superposition,[],[f550,f437]) ).
fof(f550,plain,
! [X10,X8,X9] :
( app(app(X9,cons(X8,nil)),X10) != sK49
| memberP(X9,sK54(X8,X9,X10))
| ~ ssList(X10)
| ~ ssList(X9)
| ~ ssItem(X8) ),
inference(definition_unfolding,[],[f538,f535]) ).
fof(f538,plain,
! [X10,X8,X9] :
( memberP(X9,sK54(X8,X9,X10))
| app(app(X9,cons(X8,nil)),X10) != sK47
| ~ ssList(X10)
| ~ ssList(X9)
| ~ ssItem(X8) ),
inference(cnf_transformation,[],[f339]) ).
fof(f617,plain,
~ spl55_1,
inference(avatar_split_clause,[],[f552,f590]) ).
fof(f552,plain,
nil != sK49,
inference(definition_unfolding,[],[f536,f535]) ).
fof(f536,plain,
nil != sK47,
inference(cnf_transformation,[],[f339]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : SWC231+1 : TPTP v8.1.2. Released v2.4.0.
% 0.07/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 : n019.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 : Tue Apr 30 18:17:59 EDT 2024
% 0.15/0.36 % CPUTime :
% 0.15/0.36 This is a FOF_THM_RFO_SEQ problem
% 0.15/0.36 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.ehOyysK9uy/Vampire---4.8_29542
% 0.54/0.73 % (29798)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 (2996ds/83Mi)
% 0.54/0.74 % (29792)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 (2996ds/34Mi)
% 0.54/0.74 % (29794)lrs+1011_1:1_sil=8000:sp=occurrence:nwc=10.0:i=78:ss=axioms:sgt=8_0 on Vampire---4 for (2996ds/78Mi)
% 0.54/0.74 % (29793)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 (2996ds/51Mi)
% 0.54/0.74 % (29796)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 (2996ds/34Mi)
% 0.54/0.74 % (29795)ott+1011_1:1_sil=2000:urr=on:i=33:sd=1:kws=inv_frequency:ss=axioms:sup=off_0 on Vampire---4 for (2996ds/33Mi)
% 0.54/0.74 % (29797)lrs+1002_1:16_to=lpo:sil=32000:sp=unary_frequency:sos=on:i=45:bd=off:ss=axioms_0 on Vampire---4 for (2996ds/45Mi)
% 0.54/0.75 % (29799)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 (2996ds/56Mi)
% 0.54/0.75 % (29793)First to succeed.
% 0.58/0.75 % (29795)Instruction limit reached!
% 0.58/0.75 % (29795)------------------------------
% 0.58/0.75 % (29795)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.58/0.75 % (29795)Termination reason: Unknown
% 0.58/0.75 % (29795)Termination phase: Saturation
% 0.58/0.75
% 0.58/0.75 % (29795)Memory used [KB]: 1770
% 0.58/0.75 % (29795)Time elapsed: 0.020 s
% 0.58/0.75 % (29795)Instructions burned: 34 (million)
% 0.58/0.75 % (29795)------------------------------
% 0.58/0.75 % (29795)------------------------------
% 0.58/0.75 % (29792)Instruction limit reached!
% 0.58/0.75 % (29792)------------------------------
% 0.58/0.75 % (29792)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.58/0.75 % (29792)Termination reason: Unknown
% 0.58/0.75 % (29792)Termination phase: Saturation
% 0.58/0.75
% 0.58/0.75 % (29792)Memory used [KB]: 1459
% 0.58/0.75 % (29792)Time elapsed: 0.021 s
% 0.58/0.75 % (29792)Instructions burned: 35 (million)
% 0.58/0.75 % (29792)------------------------------
% 0.58/0.75 % (29792)------------------------------
% 0.58/0.75 % (29796)Instruction limit reached!
% 0.58/0.75 % (29796)------------------------------
% 0.58/0.75 % (29796)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.58/0.75 % (29796)Termination reason: Unknown
% 0.58/0.75 % (29796)Termination phase: Saturation
% 0.58/0.75
% 0.58/0.75 % (29796)Memory used [KB]: 1885
% 0.58/0.75 % (29796)Time elapsed: 0.021 s
% 0.58/0.75 % (29796)Instructions burned: 35 (million)
% 0.58/0.75 % (29796)------------------------------
% 0.58/0.75 % (29796)------------------------------
% 0.58/0.76 % (29793)Refutation found. Thanks to Tanya!
% 0.58/0.76 % SZS status Theorem for Vampire---4
% 0.58/0.76 % SZS output start Proof for Vampire---4
% See solution above
% 0.58/0.76 % (29793)------------------------------
% 0.58/0.76 % (29793)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.58/0.76 % (29793)Termination reason: Refutation
% 0.58/0.76
% 0.58/0.76 % (29793)Memory used [KB]: 1570
% 0.58/0.76 % (29793)Time elapsed: 0.021 s
% 0.58/0.76 % (29793)Instructions burned: 33 (million)
% 0.58/0.76 % (29793)------------------------------
% 0.58/0.76 % (29793)------------------------------
% 0.58/0.76 % (29788)Success in time 0.378 s
% 0.58/0.76 % Vampire---4.8 exiting
%------------------------------------------------------------------------------