TSTP Solution File: SWC243+1 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SWC243+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/sandbox/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% Computer : n022.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:24 EDT 2024
% Result : Theorem 0.69s 0.87s
% Output : Refutation 0.69s
% Verified :
% SZS Type : Refutation
% Derivation depth : 17
% Number of leaves : 21
% Syntax : Number of formulae : 87 ( 10 unt; 0 def)
% Number of atoms : 515 ( 121 equ)
% Maximal formula atoms : 34 ( 5 avg)
% Number of connectives : 701 ( 273 ~; 247 |; 150 &)
% ( 7 <=>; 24 =>; 0 <=; 0 <~>)
% Maximal formula depth : 23 ( 7 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 15 ( 13 usr; 8 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 5 con; 0-3 aty)
% Number of variables : 183 ( 132 !; 51 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f825,plain,
$false,
inference(avatar_sat_refutation,[],[f594,f610,f646,f654,f680,f684,f818,f824]) ).
fof(f824,plain,
~ spl52_22,
inference(avatar_contradiction_clause,[],[f823]) ).
fof(f823,plain,
( $false
| ~ spl52_22 ),
inference(trivial_inequality_removal,[],[f820]) ).
fof(f820,plain,
( nil != nil
| ~ spl52_22 ),
inference(superposition,[],[f545,f817]) ).
fof(f817,plain,
( nil = sK49
| ~ spl52_22 ),
inference(avatar_component_clause,[],[f815]) ).
fof(f815,plain,
( spl52_22
<=> nil = sK49 ),
introduced(avatar_definition,[new_symbols(naming,[spl52_22])]) ).
fof(f545,plain,
nil != sK49,
inference(definition_unfolding,[],[f534,f532]) ).
fof(f532,plain,
sK47 = sK49,
inference(cnf_transformation,[],[f336]) ).
fof(f336,plain,
( ! [X4] :
( ! [X5] :
( ! [X6] :
( ( ~ leq(X4,sK51(X4,X5,X6))
& lt(X4,sK51(X4,X5,X6))
& memberP(X6,sK51(X4,X5,X6))
& memberP(X5,sK51(X4,X5,X6))
& ssItem(sK51(X4,X5,X6)) )
| app(app(X5,cons(X4,nil)),X6) != sK47
| ~ ssList(X6) )
| ~ ssList(X5) )
| ~ ssItem(X4) )
& nil != sK47
& totalorderedP(sK49)
& sK47 = sK49
& sK48 = sK50
& ssList(sK50)
& ssList(sK49)
& ssList(sK48)
& ssList(sK47) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK47,sK48,sK49,sK50,sK51])],[f222,f335,f334,f333,f332,f331]) ).
fof(f331,plain,
( ? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ! [X4] :
( ! [X5] :
( ! [X6] :
( ? [X7] :
( ~ leq(X4,X7)
& lt(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
& totalorderedP(X2)
& X0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) )
=> ( ? [X1] :
( ? [X2] :
( ? [X3] :
( ! [X4] :
( ! [X5] :
( ! [X6] :
( ? [X7] :
( ~ leq(X4,X7)
& lt(X4,X7)
& memberP(X6,X7)
& memberP(X5,X7)
& ssItem(X7) )
| app(app(X5,cons(X4,nil)),X6) != sK47
| ~ ssList(X6) )
| ~ ssList(X5) )
| ~ ssItem(X4) )
& nil != sK47
& totalorderedP(X2)
& 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)
& lt(X4,X7)
& memberP(X6,X7)
& memberP(X5,X7)
& ssItem(X7) )
| app(app(X5,cons(X4,nil)),X6) != sK47
| ~ ssList(X6) )
| ~ ssList(X5) )
| ~ ssItem(X4) )
& nil != sK47
& totalorderedP(X2)
& sK47 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
=> ( ? [X2] :
( ? [X3] :
( ! [X4] :
( ! [X5] :
( ! [X6] :
( ? [X7] :
( ~ leq(X4,X7)
& lt(X4,X7)
& memberP(X6,X7)
& memberP(X5,X7)
& ssItem(X7) )
| app(app(X5,cons(X4,nil)),X6) != sK47
| ~ ssList(X6) )
| ~ ssList(X5) )
| ~ ssItem(X4) )
& nil != sK47
& totalorderedP(X2)
& 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)
& lt(X4,X7)
& memberP(X6,X7)
& memberP(X5,X7)
& ssItem(X7) )
| app(app(X5,cons(X4,nil)),X6) != sK47
| ~ ssList(X6) )
| ~ ssList(X5) )
| ~ ssItem(X4) )
& nil != sK47
& totalorderedP(X2)
& sK47 = X2
& sK48 = X3
& ssList(X3) )
& ssList(X2) )
=> ( ? [X3] :
( ! [X4] :
( ! [X5] :
( ! [X6] :
( ? [X7] :
( ~ leq(X4,X7)
& lt(X4,X7)
& memberP(X6,X7)
& memberP(X5,X7)
& ssItem(X7) )
| app(app(X5,cons(X4,nil)),X6) != sK47
| ~ ssList(X6) )
| ~ ssList(X5) )
| ~ ssItem(X4) )
& nil != sK47
& totalorderedP(sK49)
& sK47 = sK49
& sK48 = X3
& ssList(X3) )
& ssList(sK49) ) ),
introduced(choice_axiom,[]) ).
fof(f334,plain,
( ? [X3] :
( ! [X4] :
( ! [X5] :
( ! [X6] :
( ? [X7] :
( ~ leq(X4,X7)
& lt(X4,X7)
& memberP(X6,X7)
& memberP(X5,X7)
& ssItem(X7) )
| app(app(X5,cons(X4,nil)),X6) != sK47
| ~ ssList(X6) )
| ~ ssList(X5) )
| ~ ssItem(X4) )
& nil != sK47
& totalorderedP(sK49)
& sK47 = sK49
& sK48 = X3
& ssList(X3) )
=> ( ! [X4] :
( ! [X5] :
( ! [X6] :
( ? [X7] :
( ~ leq(X4,X7)
& lt(X4,X7)
& memberP(X6,X7)
& memberP(X5,X7)
& ssItem(X7) )
| app(app(X5,cons(X4,nil)),X6) != sK47
| ~ ssList(X6) )
| ~ ssList(X5) )
| ~ ssItem(X4) )
& nil != sK47
& totalorderedP(sK49)
& sK47 = sK49
& sK48 = sK50
& ssList(sK50) ) ),
introduced(choice_axiom,[]) ).
fof(f335,plain,
! [X4,X5,X6] :
( ? [X7] :
( ~ leq(X4,X7)
& lt(X4,X7)
& memberP(X6,X7)
& memberP(X5,X7)
& ssItem(X7) )
=> ( ~ leq(X4,sK51(X4,X5,X6))
& lt(X4,sK51(X4,X5,X6))
& memberP(X6,sK51(X4,X5,X6))
& memberP(X5,sK51(X4,X5,X6))
& ssItem(sK51(X4,X5,X6)) ) ),
introduced(choice_axiom,[]) ).
fof(f222,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ! [X4] :
( ! [X5] :
( ! [X6] :
( ? [X7] :
( ~ leq(X4,X7)
& lt(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
& totalorderedP(X2)
& X0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(flattening,[],[f221]) ).
fof(f221,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ! [X4] :
( ! [X5] :
( ! [X6] :
( ? [X7] :
( ~ leq(X4,X7)
& lt(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
& totalorderedP(X2)
& X0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(ennf_transformation,[],[f97]) ).
fof(f97,negated_conjecture,
~ ! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( ? [X4] :
( ? [X5] :
( ? [X6] :
( ! [X7] :
( ssItem(X7)
=> ( leq(X4,X7)
| ~ lt(X4,X7)
| ~ memberP(X6,X7)
| ~ memberP(X5,X7) ) )
& app(app(X5,cons(X4,nil)),X6) = X0
& ssList(X6) )
& ssList(X5) )
& ssItem(X4) )
| nil = X0
| ~ totalorderedP(X2)
| X0 != X2
| X1 != X3 ) ) ) ) ),
inference(negated_conjecture,[],[f96]) ).
fof(f96,conjecture,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( ? [X4] :
( ? [X5] :
( ? [X6] :
( ! [X7] :
( ssItem(X7)
=> ( leq(X4,X7)
| ~ lt(X4,X7)
| ~ memberP(X6,X7)
| ~ memberP(X5,X7) ) )
& app(app(X5,cons(X4,nil)),X6) = X0
& ssList(X6) )
& ssList(X5) )
& ssItem(X4) )
| nil = X0
| ~ totalorderedP(X2)
| X0 != X2
| X1 != X3 ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1) ).
fof(f534,plain,
nil != sK47,
inference(cnf_transformation,[],[f336]) ).
fof(f818,plain,
( ~ spl52_7
| spl52_22
| ~ spl52_17
| ~ spl52_18 ),
inference(avatar_split_clause,[],[f813,f682,f678,f815,f618]) ).
fof(f618,plain,
( spl52_7
<=> ssList(sK49) ),
introduced(avatar_definition,[new_symbols(naming,[spl52_7])]) ).
fof(f678,plain,
( spl52_17
<=> ! [X0,X1] :
( ~ ssItem(X0)
| memberP(nil,sK51(X0,nil,X1))
| ~ ssList(X1)
| sK49 != app(cons(X0,nil),X1) ) ),
introduced(avatar_definition,[new_symbols(naming,[spl52_17])]) ).
fof(f682,plain,
( spl52_18
<=> ! [X0,X1] :
( ~ ssItem(X0)
| ssItem(sK51(X0,nil,X1))
| ~ ssList(X1)
| sK49 != app(cons(X0,nil),X1) ) ),
introduced(avatar_definition,[new_symbols(naming,[spl52_18])]) ).
fof(f813,plain,
( nil = sK49
| ~ ssList(sK49)
| ~ spl52_17
| ~ spl52_18 ),
inference(equality_resolution,[],[f812]) ).
fof(f812,plain,
( ! [X0] :
( sK49 != X0
| nil = X0
| ~ ssList(X0) )
| ~ spl52_17
| ~ spl52_18 ),
inference(duplicate_literal_removal,[],[f811]) ).
fof(f811,plain,
( ! [X0] :
( sK49 != X0
| nil = X0
| ~ ssList(X0)
| nil = X0
| ~ ssList(X0) )
| ~ spl52_17
| ~ spl52_18 ),
inference(resolution,[],[f810,f425]) ).
fof(f425,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])],[f124,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(f124,plain,
! [X0] :
( ? [X1] :
( ? [X2] :
( cons(X2,X1) = X0
& ssItem(X2) )
& ssList(X1) )
| nil = X0
| ~ ssList(X0) ),
inference(flattening,[],[f123]) ).
fof(f123,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/benchmark/theBenchmark.p',ax20) ).
fof(f810,plain,
( ! [X0] :
( ~ ssItem(sK44(X0))
| sK49 != X0
| nil = X0
| ~ ssList(X0) )
| ~ spl52_17
| ~ spl52_18 ),
inference(duplicate_literal_removal,[],[f809]) ).
fof(f809,plain,
( ! [X0] :
( ~ ssItem(sK44(X0))
| sK49 != X0
| nil = X0
| ~ ssList(X0)
| nil = X0
| ~ ssList(X0) )
| ~ spl52_17
| ~ spl52_18 ),
inference(resolution,[],[f807,f424]) ).
fof(f424,plain,
! [X0] :
( ssList(sK43(X0))
| nil = X0
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f307]) ).
fof(f807,plain,
( ! [X0] :
( ~ ssList(sK43(X0))
| ~ ssItem(sK44(X0))
| sK49 != X0
| nil = X0
| ~ ssList(X0) )
| ~ spl52_17
| ~ spl52_18 ),
inference(superposition,[],[f806,f426]) ).
fof(f426,plain,
! [X0] :
( cons(sK44(X0),sK43(X0)) = X0
| nil = X0
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f307]) ).
fof(f806,plain,
( ! [X0,X1] :
( cons(X0,X1) != sK49
| ~ ssItem(X0)
| ~ ssList(X1) )
| ~ spl52_17
| ~ spl52_18 ),
inference(duplicate_literal_removal,[],[f803]) ).
fof(f803,plain,
( ! [X0,X1] :
( cons(X0,X1) != sK49
| ~ ssItem(X0)
| cons(X0,X1) != sK49
| ~ ssList(X1)
| ~ ssItem(X0)
| ~ ssList(X1) )
| ~ spl52_17
| ~ spl52_18 ),
inference(superposition,[],[f792,f508]) ).
fof(f508,plain,
! [X0,X1] :
( cons(X1,X0) = app(cons(X1,nil),X0)
| ~ ssItem(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f198]) ).
fof(f198,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/benchmark/theBenchmark.p',ax81) ).
fof(f792,plain,
( ! [X0,X1] :
( app(cons(X1,nil),X0) != sK49
| ~ ssItem(X1)
| cons(X1,X0) != sK49
| ~ ssList(X0) )
| ~ spl52_17
| ~ spl52_18 ),
inference(duplicate_literal_removal,[],[f789]) ).
fof(f789,plain,
( ! [X0,X1] :
( ~ ssList(X0)
| ~ ssItem(X1)
| cons(X1,X0) != sK49
| ~ ssItem(X1)
| ~ ssList(X0)
| app(cons(X1,nil),X0) != sK49 )
| ~ spl52_17
| ~ spl52_18 ),
inference(resolution,[],[f788,f683]) ).
fof(f683,plain,
( ! [X0,X1] :
( ssItem(sK51(X0,nil,X1))
| ~ ssItem(X0)
| ~ ssList(X1)
| sK49 != app(cons(X0,nil),X1) )
| ~ spl52_18 ),
inference(avatar_component_clause,[],[f682]) ).
fof(f788,plain,
( ! [X0,X1] :
( ~ ssItem(sK51(X0,nil,X1))
| ~ ssList(X1)
| ~ ssItem(X0)
| cons(X0,X1) != sK49 )
| ~ spl52_17 ),
inference(duplicate_literal_removal,[],[f772]) ).
fof(f772,plain,
( ! [X0,X1] :
( cons(X0,X1) != sK49
| ~ ssList(X1)
| ~ ssItem(X0)
| ~ ssItem(sK51(X0,nil,X1))
| ~ ssItem(X0)
| ~ ssList(X1) )
| ~ spl52_17 ),
inference(superposition,[],[f693,f508]) ).
fof(f693,plain,
( ! [X0,X1] :
( sK49 != app(cons(X0,nil),X1)
| ~ ssList(X1)
| ~ ssItem(X0)
| ~ ssItem(sK51(X0,nil,X1)) )
| ~ spl52_17 ),
inference(resolution,[],[f679,f450]) ).
fof(f450,plain,
! [X0] :
( ~ memberP(nil,X0)
| ~ ssItem(X0) ),
inference(cnf_transformation,[],[f148]) ).
fof(f148,plain,
! [X0] :
( ~ memberP(nil,X0)
| ~ ssItem(X0) ),
inference(ennf_transformation,[],[f38]) ).
fof(f38,axiom,
! [X0] :
( ssItem(X0)
=> ~ memberP(nil,X0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax38) ).
fof(f679,plain,
( ! [X0,X1] :
( memberP(nil,sK51(X0,nil,X1))
| ~ ssItem(X0)
| ~ ssList(X1)
| sK49 != app(cons(X0,nil),X1) )
| ~ spl52_17 ),
inference(avatar_component_clause,[],[f678]) ).
fof(f684,plain,
( ~ spl52_1
| spl52_18
| ~ spl52_6 ),
inference(avatar_split_clause,[],[f660,f608,f682,f588]) ).
fof(f588,plain,
( spl52_1
<=> ssList(nil) ),
introduced(avatar_definition,[new_symbols(naming,[spl52_1])]) ).
fof(f608,plain,
( spl52_6
<=> ! [X0,X1] :
( sK49 != app(cons(X0,nil),X1)
| ~ ssList(cons(X0,nil))
| ~ ssItem(X0)
| ~ ssList(X1)
| ssItem(sK51(X0,nil,X1)) ) ),
introduced(avatar_definition,[new_symbols(naming,[spl52_6])]) ).
fof(f660,plain,
( ! [X0,X1] :
( ~ ssItem(X0)
| ~ ssList(nil)
| sK49 != app(cons(X0,nil),X1)
| ~ ssList(X1)
| ssItem(sK51(X0,nil,X1)) )
| ~ spl52_6 ),
inference(duplicate_literal_removal,[],[f659]) ).
fof(f659,plain,
( ! [X0,X1] :
( ~ ssItem(X0)
| ~ ssList(nil)
| sK49 != app(cons(X0,nil),X1)
| ~ ssItem(X0)
| ~ ssList(X1)
| ssItem(sK51(X0,nil,X1)) )
| ~ spl52_6 ),
inference(resolution,[],[f419,f609]) ).
fof(f609,plain,
( ! [X0,X1] :
( ~ ssList(cons(X0,nil))
| sK49 != app(cons(X0,nil),X1)
| ~ ssItem(X0)
| ~ ssList(X1)
| ssItem(sK51(X0,nil,X1)) )
| ~ spl52_6 ),
inference(avatar_component_clause,[],[f608]) ).
fof(f419,plain,
! [X0,X1] :
( ssList(cons(X1,X0))
| ~ ssItem(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f119]) ).
fof(f119,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/benchmark/theBenchmark.p',ax16) ).
fof(f680,plain,
( ~ spl52_1
| spl52_17
| ~ spl52_2 ),
inference(avatar_split_clause,[],[f661,f592,f678,f588]) ).
fof(f592,plain,
( spl52_2
<=> ! [X0,X1] :
( sK49 != app(cons(X0,nil),X1)
| ~ ssList(cons(X0,nil))
| ~ ssItem(X0)
| ~ ssList(X1)
| memberP(nil,sK51(X0,nil,X1)) ) ),
introduced(avatar_definition,[new_symbols(naming,[spl52_2])]) ).
fof(f661,plain,
( ! [X0,X1] :
( ~ ssItem(X0)
| ~ ssList(nil)
| sK49 != app(cons(X0,nil),X1)
| ~ ssList(X1)
| memberP(nil,sK51(X0,nil,X1)) )
| ~ spl52_2 ),
inference(duplicate_literal_removal,[],[f658]) ).
fof(f658,plain,
( ! [X0,X1] :
( ~ ssItem(X0)
| ~ ssList(nil)
| sK49 != app(cons(X0,nil),X1)
| ~ ssItem(X0)
| ~ ssList(X1)
| memberP(nil,sK51(X0,nil,X1)) )
| ~ spl52_2 ),
inference(resolution,[],[f419,f593]) ).
fof(f593,plain,
( ! [X0,X1] :
( ~ ssList(cons(X0,nil))
| sK49 != app(cons(X0,nil),X1)
| ~ ssItem(X0)
| ~ ssList(X1)
| memberP(nil,sK51(X0,nil,X1)) )
| ~ spl52_2 ),
inference(avatar_component_clause,[],[f592]) ).
fof(f654,plain,
spl52_7,
inference(avatar_contradiction_clause,[],[f653]) ).
fof(f653,plain,
( $false
| spl52_7 ),
inference(resolution,[],[f620,f529]) ).
fof(f529,plain,
ssList(sK49),
inference(cnf_transformation,[],[f336]) ).
fof(f620,plain,
( ~ ssList(sK49)
| spl52_7 ),
inference(avatar_component_clause,[],[f618]) ).
fof(f646,plain,
spl52_1,
inference(avatar_contradiction_clause,[],[f645]) ).
fof(f645,plain,
( $false
| spl52_1 ),
inference(resolution,[],[f590,f420]) ).
fof(f420,plain,
ssList(nil),
inference(cnf_transformation,[],[f17]) ).
fof(f17,axiom,
ssList(nil),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax17) ).
fof(f590,plain,
( ~ ssList(nil)
| spl52_1 ),
inference(avatar_component_clause,[],[f588]) ).
fof(f610,plain,
( ~ spl52_1
| spl52_6 ),
inference(avatar_split_clause,[],[f586,f608,f588]) ).
fof(f586,plain,
! [X0,X1] :
( sK49 != app(cons(X0,nil),X1)
| ssItem(sK51(X0,nil,X1))
| ~ ssList(X1)
| ~ ssList(nil)
| ~ ssItem(X0)
| ~ ssList(cons(X0,nil)) ),
inference(superposition,[],[f544,f434]) ).
fof(f434,plain,
! [X0] :
( app(nil,X0) = X0
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f134]) ).
fof(f134,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/benchmark/theBenchmark.p',ax28) ).
fof(f544,plain,
! [X6,X4,X5] :
( app(app(X5,cons(X4,nil)),X6) != sK49
| ssItem(sK51(X4,X5,X6))
| ~ ssList(X6)
| ~ ssList(X5)
| ~ ssItem(X4) ),
inference(definition_unfolding,[],[f535,f532]) ).
fof(f535,plain,
! [X6,X4,X5] :
( ssItem(sK51(X4,X5,X6))
| app(app(X5,cons(X4,nil)),X6) != sK47
| ~ ssList(X6)
| ~ ssList(X5)
| ~ ssItem(X4) ),
inference(cnf_transformation,[],[f336]) ).
fof(f594,plain,
( ~ spl52_1
| spl52_2 ),
inference(avatar_split_clause,[],[f582,f592,f588]) ).
fof(f582,plain,
! [X0,X1] :
( sK49 != app(cons(X0,nil),X1)
| memberP(nil,sK51(X0,nil,X1))
| ~ ssList(X1)
| ~ ssList(nil)
| ~ ssItem(X0)
| ~ ssList(cons(X0,nil)) ),
inference(superposition,[],[f543,f434]) ).
fof(f543,plain,
! [X6,X4,X5] :
( app(app(X5,cons(X4,nil)),X6) != sK49
| memberP(X5,sK51(X4,X5,X6))
| ~ ssList(X6)
| ~ ssList(X5)
| ~ ssItem(X4) ),
inference(definition_unfolding,[],[f536,f532]) ).
fof(f536,plain,
! [X6,X4,X5] :
( memberP(X5,sK51(X4,X5,X6))
| app(app(X5,cons(X4,nil)),X6) != sK47
| ~ ssList(X6)
| ~ ssList(X5)
| ~ ssItem(X4) ),
inference(cnf_transformation,[],[f336]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.11 % Problem : SWC243+1 : TPTP v8.2.0. Released v2.4.0.
% 0.11/0.13 % 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 : n022.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 : Sun May 19 03:41:07 EDT 2024
% 0.12/0.33 % CPUTime :
% 0.12/0.33 This is a FOF_THM_RFO_SEQ problem
% 0.12/0.34 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.64/0.85 % (6177)ott+1011_1:1_sil=2000:urr=on:i=33:sd=1:kws=inv_frequency:ss=axioms:sup=off_0 on theBenchmark for (2994ds/33Mi)
% 0.64/0.85 % (6179)lrs+1002_1:16_to=lpo:sil=32000:sp=unary_frequency:sos=on:i=45:bd=off:ss=axioms_0 on theBenchmark for (2994ds/45Mi)
% 0.64/0.85 % (6178)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 (2994ds/34Mi)
% 0.64/0.85 % (6175)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 (2994ds/51Mi)
% 0.64/0.85 % (6180)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 (2994ds/83Mi)
% 0.64/0.85 % (6176)lrs+1011_1:1_sil=8000:sp=occurrence:nwc=10.0:i=78:ss=axioms:sgt=8_0 on theBenchmark for (2994ds/78Mi)
% 0.64/0.85 % (6181)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 (2994ds/56Mi)
% 0.64/0.85 % (6174)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 (2994ds/34Mi)
% 0.69/0.87 % (6175)First to succeed.
% 0.69/0.87 % (6175)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-6173"
% 0.69/0.87 % (6175)Refutation found. Thanks to Tanya!
% 0.69/0.87 % SZS status Theorem for theBenchmark
% 0.69/0.87 % SZS output start Proof for theBenchmark
% See solution above
% 0.69/0.87 % (6175)------------------------------
% 0.69/0.87 % (6175)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.69/0.87 % (6175)Termination reason: Refutation
% 0.69/0.87
% 0.69/0.87 % (6175)Memory used [KB]: 1497
% 0.69/0.87 % (6175)Time elapsed: 0.021 s
% 0.69/0.87 % (6175)Instructions burned: 30 (million)
% 0.69/0.87 % (6173)Success in time 0.521 s
% 0.69/0.87 % Vampire---4.8 exiting
%------------------------------------------------------------------------------