TSTP Solution File: SWC233+1 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SWC233+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 : n032.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:21 EDT 2024
% Result : Theorem 0.40s 0.61s
% Output : Refutation 0.40s
% Verified :
% SZS Type : Refutation
% Derivation depth : 17
% Number of leaves : 21
% Syntax : Number of formulae : 88 ( 10 unt; 0 def)
% Number of atoms : 644 ( 139 equ)
% Maximal formula atoms : 50 ( 7 avg)
% Number of connectives : 916 ( 360 ~; 334 |; 186 &)
% ( 7 <=>; 29 =>; 0 <=; 0 <~>)
% Maximal formula depth : 24 ( 7 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 14 ( 12 usr; 8 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 5 con; 0-3 aty)
% Number of variables : 247 ( 181 !; 66 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f832,plain,
$false,
inference(avatar_sat_refutation,[],[f614,f618,f661,f672,f694,f710,f826,f831]) ).
fof(f831,plain,
~ spl52_22,
inference(avatar_contradiction_clause,[],[f830]) ).
fof(f830,plain,
( $false
| ~ spl52_22 ),
inference(trivial_inequality_removal,[],[f828]) ).
fof(f828,plain,
( nil != nil
| ~ spl52_22 ),
inference(superposition,[],[f547,f825]) ).
fof(f825,plain,
( nil = sK49
| ~ spl52_22 ),
inference(avatar_component_clause,[],[f823]) ).
fof(f823,plain,
( spl52_22
<=> nil = sK49 ),
introduced(avatar_definition,[new_symbols(naming,[spl52_22])]) ).
fof(f547,plain,
nil != sK49,
inference(definition_unfolding,[],[f534,f533]) ).
fof(f533,plain,
sK47 = sK49,
inference(cnf_transformation,[],[f337]) ).
fof(f337,plain,
( ! [X4] :
( ! [X5] :
( ! [X6] :
( ! [X7] :
( ( ( ~ memberP(X5,X7)
| lt(X7,X4) )
& ( ~ memberP(X6,X7)
| lt(X4,X7) ) )
| ~ ssItem(X7) )
| app(app(X5,cons(X4,nil)),X6) != sK49
| ~ ssList(X6) )
| ~ ssList(X5) )
| ~ ssItem(X4) )
& ! [X8] :
( ! [X9] :
( ! [X10] :
( ( ~ lt(X8,sK51(X8,X9,X10))
& leq(X8,sK51(X8,X9,X10))
& memberP(X10,sK51(X8,X9,X10))
& memberP(X9,sK51(X8,X9,X10))
& ssItem(sK51(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])],[f223,f336,f335,f334,f333,f332]) ).
fof(f332,plain,
( ? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ! [X4] :
( ! [X5] :
( ! [X6] :
( ! [X7] :
( ( ( ~ memberP(X5,X7)
| lt(X7,X4) )
& ( ~ memberP(X6,X7)
| lt(X4,X7) ) )
| ~ ssItem(X7) )
| app(app(X5,cons(X4,nil)),X6) != X2
| ~ ssList(X6) )
| ~ ssList(X5) )
| ~ ssItem(X4) )
& ! [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] :
( ( ( ~ memberP(X5,X7)
| lt(X7,X4) )
& ( ~ memberP(X6,X7)
| lt(X4,X7) ) )
| ~ ssItem(X7) )
| app(app(X5,cons(X4,nil)),X6) != X2
| ~ ssList(X6) )
| ~ ssList(X5) )
| ~ ssItem(X4) )
& ! [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(f333,plain,
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ! [X4] :
( ! [X5] :
( ! [X6] :
( ! [X7] :
( ( ( ~ memberP(X5,X7)
| lt(X7,X4) )
& ( ~ memberP(X6,X7)
| lt(X4,X7) ) )
| ~ ssItem(X7) )
| app(app(X5,cons(X4,nil)),X6) != X2
| ~ ssList(X6) )
| ~ ssList(X5) )
| ~ ssItem(X4) )
& ! [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] :
( ( ( ~ memberP(X5,X7)
| lt(X7,X4) )
& ( ~ memberP(X6,X7)
| lt(X4,X7) ) )
| ~ ssItem(X7) )
| app(app(X5,cons(X4,nil)),X6) != X2
| ~ ssList(X6) )
| ~ ssList(X5) )
| ~ ssItem(X4) )
& ! [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(f334,plain,
( ? [X2] :
( ? [X3] :
( ! [X4] :
( ! [X5] :
( ! [X6] :
( ! [X7] :
( ( ( ~ memberP(X5,X7)
| lt(X7,X4) )
& ( ~ memberP(X6,X7)
| lt(X4,X7) ) )
| ~ ssItem(X7) )
| app(app(X5,cons(X4,nil)),X6) != X2
| ~ ssList(X6) )
| ~ ssList(X5) )
| ~ ssItem(X4) )
& ! [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] :
( ( ( ~ memberP(X5,X7)
| lt(X7,X4) )
& ( ~ memberP(X6,X7)
| lt(X4,X7) ) )
| ~ ssItem(X7) )
| app(app(X5,cons(X4,nil)),X6) != sK49
| ~ ssList(X6) )
| ~ ssList(X5) )
| ~ ssItem(X4) )
& ! [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(f335,plain,
( ? [X3] :
( ! [X4] :
( ! [X5] :
( ! [X6] :
( ! [X7] :
( ( ( ~ memberP(X5,X7)
| lt(X7,X4) )
& ( ~ memberP(X6,X7)
| lt(X4,X7) ) )
| ~ ssItem(X7) )
| app(app(X5,cons(X4,nil)),X6) != sK49
| ~ ssList(X6) )
| ~ ssList(X5) )
| ~ ssItem(X4) )
& ! [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] :
( ( ( ~ memberP(X5,X7)
| lt(X7,X4) )
& ( ~ memberP(X6,X7)
| lt(X4,X7) ) )
| ~ ssItem(X7) )
| app(app(X5,cons(X4,nil)),X6) != sK49
| ~ ssList(X6) )
| ~ ssList(X5) )
| ~ ssItem(X4) )
& ! [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(f336,plain,
! [X8,X9,X10] :
( ? [X11] :
( ~ lt(X8,X11)
& leq(X8,X11)
& memberP(X10,X11)
& memberP(X9,X11)
& ssItem(X11) )
=> ( ~ lt(X8,sK51(X8,X9,X10))
& leq(X8,sK51(X8,X9,X10))
& memberP(X10,sK51(X8,X9,X10))
& memberP(X9,sK51(X8,X9,X10))
& ssItem(sK51(X8,X9,X10)) ) ),
introduced(choice_axiom,[]) ).
fof(f223,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ! [X4] :
( ! [X5] :
( ! [X6] :
( ! [X7] :
( ( ( ~ memberP(X5,X7)
| lt(X7,X4) )
& ( ~ memberP(X6,X7)
| lt(X4,X7) ) )
| ~ ssItem(X7) )
| app(app(X5,cons(X4,nil)),X6) != X2
| ~ ssList(X6) )
| ~ ssList(X5) )
| ~ ssItem(X4) )
& ! [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(flattening,[],[f222]) ).
fof(f222,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ! [X4] :
( ! [X5] :
( ! [X6] :
( ! [X7] :
( ( ( ~ memberP(X5,X7)
| lt(X7,X4) )
& ( ~ memberP(X6,X7)
| lt(X4,X7) ) )
| ~ ssItem(X7) )
| app(app(X5,cons(X4,nil)),X6) != X2
| ~ ssList(X6) )
| ~ ssList(X5) )
| ~ ssItem(X4) )
& ! [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] :
( ssList(X3)
=> ( ? [X4] :
( ? [X5] :
( ? [X6] :
( ? [X7] :
( ( ( memberP(X5,X7)
& ~ lt(X7,X4) )
| ( memberP(X6,X7)
& ~ lt(X4,X7) ) )
& ssItem(X7) )
& app(app(X5,cons(X4,nil)),X6) = X2
& ssList(X6) )
& ssList(X5) )
& ssItem(X4) )
| ? [X8] :
( ? [X9] :
( ? [X10] :
( ! [X11] :
( ssItem(X11)
=> ( lt(X8,X11)
| ~ leq(X8,X11)
| ~ memberP(X10,X11)
| ~ memberP(X9,X11) ) )
& app(app(X9,cons(X8,nil)),X10) = X0
& ssList(X10) )
& ssList(X9) )
& ssItem(X8) )
| nil = X0
| X0 != X2
| X1 != X3 ) ) ) ) ),
inference(rectify,[],[f97]) ).
fof(f97,negated_conjecture,
~ ! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( ? [X8] :
( ? [X9] :
( ? [X10] :
( ? [X11] :
( ( ( memberP(X9,X11)
& ~ lt(X11,X8) )
| ( memberP(X10,X11)
& ~ lt(X8,X11) ) )
& ssItem(X11) )
& app(app(X9,cons(X8,nil)),X10) = X2
& ssList(X10) )
& ssList(X9) )
& ssItem(X8) )
| ? [X4] :
( ? [X5] :
( ? [X6] :
( ! [X7] :
( ssItem(X7)
=> ( lt(X4,X7)
| ~ leq(X4,X7)
| ~ memberP(X6,X7)
| ~ memberP(X5,X7) ) )
& app(app(X5,cons(X4,nil)),X6) = X0
& ssList(X6) )
& ssList(X5) )
& ssItem(X4) )
| nil = X0
| X0 != X2
| X1 != X3 ) ) ) ) ),
inference(negated_conjecture,[],[f96]) ).
fof(f96,conjecture,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( ? [X8] :
( ? [X9] :
( ? [X10] :
( ? [X11] :
( ( ( memberP(X9,X11)
& ~ lt(X11,X8) )
| ( memberP(X10,X11)
& ~ lt(X8,X11) ) )
& ssItem(X11) )
& app(app(X9,cons(X8,nil)),X10) = X2
& ssList(X10) )
& ssList(X9) )
& ssItem(X8) )
| ? [X4] :
( ? [X5] :
( ? [X6] :
( ! [X7] :
( ssItem(X7)
=> ( lt(X4,X7)
| ~ leq(X4,X7)
| ~ memberP(X6,X7)
| ~ memberP(X5,X7) ) )
& app(app(X5,cons(X4,nil)),X6) = X0
& ssList(X6) )
& ssList(X5) )
& ssItem(X4) )
| nil = X0
| X0 != X2
| X1 != X3 ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1) ).
fof(f534,plain,
nil != sK47,
inference(cnf_transformation,[],[f337]) ).
fof(f826,plain,
( ~ spl52_8
| spl52_22
| ~ spl52_17
| ~ spl52_21 ),
inference(avatar_split_clause,[],[f821,f708,f692,f823,f628]) ).
fof(f628,plain,
( spl52_8
<=> ssList(sK49) ),
introduced(avatar_definition,[new_symbols(naming,[spl52_8])]) ).
fof(f692,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(f708,plain,
( spl52_21
<=> ! [X0,X1] :
( ~ ssItem(X0)
| ssItem(sK51(X0,nil,X1))
| ~ ssList(X1)
| sK49 != app(cons(X0,nil),X1) ) ),
introduced(avatar_definition,[new_symbols(naming,[spl52_21])]) ).
fof(f821,plain,
( nil = sK49
| ~ ssList(sK49)
| ~ spl52_17
| ~ spl52_21 ),
inference(equality_resolution,[],[f820]) ).
fof(f820,plain,
( ! [X0] :
( sK49 != X0
| nil = X0
| ~ ssList(X0) )
| ~ spl52_17
| ~ spl52_21 ),
inference(duplicate_literal_removal,[],[f819]) ).
fof(f819,plain,
( ! [X0] :
( sK49 != X0
| nil = X0
| ~ ssList(X0)
| nil = X0
| ~ ssList(X0) )
| ~ spl52_17
| ~ spl52_21 ),
inference(resolution,[],[f818,f426]) ).
fof(f426,plain,
! [X0] :
( ssItem(sK44(X0))
| nil = X0
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f308]) ).
fof(f308,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,f307,f306]) ).
fof(f306,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(f307,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/benchmark/theBenchmark.p',ax20) ).
fof(f818,plain,
( ! [X0] :
( ~ ssItem(sK44(X0))
| sK49 != X0
| nil = X0
| ~ ssList(X0) )
| ~ spl52_17
| ~ spl52_21 ),
inference(duplicate_literal_removal,[],[f817]) ).
fof(f817,plain,
( ! [X0] :
( ~ ssItem(sK44(X0))
| sK49 != X0
| nil = X0
| ~ ssList(X0)
| nil = X0
| ~ ssList(X0) )
| ~ spl52_17
| ~ spl52_21 ),
inference(resolution,[],[f815,f425]) ).
fof(f425,plain,
! [X0] :
( ssList(sK43(X0))
| nil = X0
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f308]) ).
fof(f815,plain,
( ! [X0] :
( ~ ssList(sK43(X0))
| ~ ssItem(sK44(X0))
| sK49 != X0
| nil = X0
| ~ ssList(X0) )
| ~ spl52_17
| ~ spl52_21 ),
inference(superposition,[],[f814,f427]) ).
fof(f427,plain,
! [X0] :
( cons(sK44(X0),sK43(X0)) = X0
| nil = X0
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f308]) ).
fof(f814,plain,
( ! [X0,X1] :
( cons(X0,X1) != sK49
| ~ ssItem(X0)
| ~ ssList(X1) )
| ~ spl52_17
| ~ spl52_21 ),
inference(duplicate_literal_removal,[],[f811]) ).
fof(f811,plain,
( ! [X0,X1] :
( cons(X0,X1) != sK49
| ~ ssItem(X0)
| cons(X0,X1) != sK49
| ~ ssList(X1)
| ~ ssItem(X0)
| ~ ssList(X1) )
| ~ spl52_17
| ~ spl52_21 ),
inference(superposition,[],[f809,f509]) ).
fof(f509,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/benchmark/theBenchmark.p',ax81) ).
fof(f809,plain,
( ! [X0,X1] :
( app(cons(X1,nil),X0) != sK49
| ~ ssItem(X1)
| cons(X1,X0) != sK49
| ~ ssList(X0) )
| ~ spl52_17
| ~ spl52_21 ),
inference(duplicate_literal_removal,[],[f806]) ).
fof(f806,plain,
( ! [X0,X1] :
( ~ ssList(X0)
| ~ ssItem(X1)
| cons(X1,X0) != sK49
| ~ ssItem(X1)
| ~ ssList(X0)
| app(cons(X1,nil),X0) != sK49 )
| ~ spl52_17
| ~ spl52_21 ),
inference(resolution,[],[f803,f709]) ).
fof(f709,plain,
( ! [X0,X1] :
( ssItem(sK51(X0,nil,X1))
| ~ ssItem(X0)
| ~ ssList(X1)
| sK49 != app(cons(X0,nil),X1) )
| ~ spl52_21 ),
inference(avatar_component_clause,[],[f708]) ).
fof(f803,plain,
( ! [X0,X1] :
( ~ ssItem(sK51(X0,nil,X1))
| ~ ssList(X1)
| ~ ssItem(X0)
| cons(X0,X1) != sK49 )
| ~ spl52_17 ),
inference(duplicate_literal_removal,[],[f786]) ).
fof(f786,plain,
( ! [X0,X1] :
( cons(X0,X1) != sK49
| ~ ssList(X1)
| ~ ssItem(X0)
| ~ ssItem(sK51(X0,nil,X1))
| ~ ssItem(X0)
| ~ ssList(X1) )
| ~ spl52_17 ),
inference(superposition,[],[f713,f509]) ).
fof(f713,plain,
( ! [X0,X1] :
( sK49 != app(cons(X0,nil),X1)
| ~ ssList(X1)
| ~ ssItem(X0)
| ~ ssItem(sK51(X0,nil,X1)) )
| ~ spl52_17 ),
inference(resolution,[],[f693,f451]) ).
fof(f451,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/benchmark/theBenchmark.p',ax38) ).
fof(f693,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,[],[f692]) ).
fof(f710,plain,
( ~ spl52_1
| spl52_21
| ~ spl52_7 ),
inference(avatar_split_clause,[],[f681,f616,f708,f592]) ).
fof(f592,plain,
( spl52_1
<=> ssList(nil) ),
introduced(avatar_definition,[new_symbols(naming,[spl52_1])]) ).
fof(f616,plain,
( spl52_7
<=> ! [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_7])]) ).
fof(f681,plain,
( ! [X0,X1] :
( ~ ssItem(X0)
| ~ ssList(nil)
| sK49 != app(cons(X0,nil),X1)
| ~ ssList(X1)
| ssItem(sK51(X0,nil,X1)) )
| ~ spl52_7 ),
inference(duplicate_literal_removal,[],[f680]) ).
fof(f680,plain,
( ! [X0,X1] :
( ~ ssItem(X0)
| ~ ssList(nil)
| sK49 != app(cons(X0,nil),X1)
| ~ ssItem(X0)
| ~ ssList(X1)
| ssItem(sK51(X0,nil,X1)) )
| ~ spl52_7 ),
inference(resolution,[],[f420,f617]) ).
fof(f617,plain,
( ! [X0,X1] :
( ~ ssList(cons(X0,nil))
| sK49 != app(cons(X0,nil),X1)
| ~ ssItem(X0)
| ~ ssList(X1)
| ssItem(sK51(X0,nil,X1)) )
| ~ spl52_7 ),
inference(avatar_component_clause,[],[f616]) ).
fof(f420,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/benchmark/theBenchmark.p',ax16) ).
fof(f694,plain,
( ~ spl52_1
| spl52_17
| ~ spl52_6 ),
inference(avatar_split_clause,[],[f685,f612,f692,f592]) ).
fof(f612,plain,
( spl52_6
<=> ! [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_6])]) ).
fof(f685,plain,
( ! [X0,X1] :
( ~ ssItem(X0)
| ~ ssList(nil)
| sK49 != app(cons(X0,nil),X1)
| ~ ssList(X1)
| memberP(nil,sK51(X0,nil,X1)) )
| ~ spl52_6 ),
inference(duplicate_literal_removal,[],[f676]) ).
fof(f676,plain,
( ! [X0,X1] :
( ~ ssItem(X0)
| ~ ssList(nil)
| sK49 != app(cons(X0,nil),X1)
| ~ ssItem(X0)
| ~ ssList(X1)
| memberP(nil,sK51(X0,nil,X1)) )
| ~ spl52_6 ),
inference(resolution,[],[f420,f613]) ).
fof(f613,plain,
( ! [X0,X1] :
( ~ ssList(cons(X0,nil))
| sK49 != app(cons(X0,nil),X1)
| ~ ssItem(X0)
| ~ ssList(X1)
| memberP(nil,sK51(X0,nil,X1)) )
| ~ spl52_6 ),
inference(avatar_component_clause,[],[f612]) ).
fof(f672,plain,
spl52_8,
inference(avatar_contradiction_clause,[],[f671]) ).
fof(f671,plain,
( $false
| spl52_8 ),
inference(resolution,[],[f630,f530]) ).
fof(f530,plain,
ssList(sK49),
inference(cnf_transformation,[],[f337]) ).
fof(f630,plain,
( ~ ssList(sK49)
| spl52_8 ),
inference(avatar_component_clause,[],[f628]) ).
fof(f661,plain,
spl52_1,
inference(avatar_contradiction_clause,[],[f660]) ).
fof(f660,plain,
( $false
| spl52_1 ),
inference(resolution,[],[f594,f421]) ).
fof(f421,plain,
ssList(nil),
inference(cnf_transformation,[],[f17]) ).
fof(f17,axiom,
ssList(nil),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax17) ).
fof(f594,plain,
( ~ ssList(nil)
| spl52_1 ),
inference(avatar_component_clause,[],[f592]) ).
fof(f618,plain,
( ~ spl52_1
| spl52_7 ),
inference(avatar_split_clause,[],[f590,f616,f592]) ).
fof(f590,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,[],[f546,f435]) ).
fof(f435,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/benchmark/theBenchmark.p',ax28) ).
fof(f546,plain,
! [X10,X8,X9] :
( app(app(X9,cons(X8,nil)),X10) != sK49
| ssItem(sK51(X8,X9,X10))
| ~ ssList(X10)
| ~ ssList(X9)
| ~ ssItem(X8) ),
inference(definition_unfolding,[],[f535,f533]) ).
fof(f535,plain,
! [X10,X8,X9] :
( ssItem(sK51(X8,X9,X10))
| app(app(X9,cons(X8,nil)),X10) != sK47
| ~ ssList(X10)
| ~ ssList(X9)
| ~ ssItem(X8) ),
inference(cnf_transformation,[],[f337]) ).
fof(f614,plain,
( ~ spl52_1
| spl52_6 ),
inference(avatar_split_clause,[],[f589,f612,f592]) ).
fof(f589,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,[],[f545,f435]) ).
fof(f545,plain,
! [X10,X8,X9] :
( app(app(X9,cons(X8,nil)),X10) != sK49
| memberP(X9,sK51(X8,X9,X10))
| ~ ssList(X10)
| ~ ssList(X9)
| ~ ssItem(X8) ),
inference(definition_unfolding,[],[f536,f533]) ).
fof(f536,plain,
! [X10,X8,X9] :
( memberP(X9,sK51(X8,X9,X10))
| app(app(X9,cons(X8,nil)),X10) != sK47
| ~ ssList(X10)
| ~ ssList(X9)
| ~ ssItem(X8) ),
inference(cnf_transformation,[],[f337]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.02/0.10 % Problem : SWC233+1 : TPTP v8.2.0. Released v2.4.0.
% 0.02/0.11 % 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.10/0.30 % Computer : n032.cluster.edu
% 0.10/0.30 % Model : x86_64 x86_64
% 0.10/0.30 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.30 % Memory : 8042.1875MB
% 0.10/0.30 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.30 % CPULimit : 300
% 0.10/0.30 % WCLimit : 300
% 0.10/0.30 % DateTime : Sun May 19 02:41:22 EDT 2024
% 0.10/0.30 % CPUTime :
% 0.10/0.30 This is a FOF_THM_RFO_SEQ problem
% 0.10/0.30 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.40/0.59 % (22590)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 (2997ds/83Mi)
% 0.40/0.59 % (22588)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 (2997ds/34Mi)
% 0.40/0.59 % (22585)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 (2997ds/51Mi)
% 0.40/0.59 % (22586)lrs+1011_1:1_sil=8000:sp=occurrence:nwc=10.0:i=78:ss=axioms:sgt=8_0 on theBenchmark for (2997ds/78Mi)
% 0.40/0.59 % (22587)ott+1011_1:1_sil=2000:urr=on:i=33:sd=1:kws=inv_frequency:ss=axioms:sup=off_0 on theBenchmark for (2997ds/33Mi)
% 0.40/0.59 % (22589)lrs+1002_1:16_to=lpo:sil=32000:sp=unary_frequency:sos=on:i=45:bd=off:ss=axioms_0 on theBenchmark for (2997ds/45Mi)
% 0.40/0.60 % (22584)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 (2997ds/34Mi)
% 0.40/0.61 % (22585)First to succeed.
% 0.40/0.61 % (22591)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 (2997ds/56Mi)
% 0.40/0.61 % (22585)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-22583"
% 0.40/0.61 % (22585)Refutation found. Thanks to Tanya!
% 0.40/0.61 % SZS status Theorem for theBenchmark
% 0.40/0.61 % SZS output start Proof for theBenchmark
% See solution above
% 0.40/0.61 % (22585)------------------------------
% 0.40/0.61 % (22585)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.40/0.61 % (22585)Termination reason: Refutation
% 0.40/0.61
% 0.40/0.61 % (22585)Memory used [KB]: 1503
% 0.40/0.61 % (22585)Time elapsed: 0.014 s
% 0.40/0.61 % (22585)Instructions burned: 32 (million)
% 0.40/0.61 % (22583)Success in time 0.292 s
% 0.40/0.61 % Vampire---4.8 exiting
%------------------------------------------------------------------------------