TSTP Solution File: SWC010+1 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SWC010+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 : n020.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 03:59:11 EDT 2024
% Result : Theorem 0.60s 0.77s
% Output : Refutation 0.60s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 15
% Syntax : Number of formulae : 48 ( 5 unt; 0 def)
% Number of atoms : 461 ( 136 equ)
% Maximal formula atoms : 46 ( 9 avg)
% Number of connectives : 621 ( 208 ~; 188 |; 190 &)
% ( 7 <=>; 28 =>; 0 <=; 0 <~>)
% Maximal formula depth : 25 ( 8 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 14 ( 12 usr; 8 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 8 con; 0-2 aty)
% Number of variables : 158 ( 83 !; 75 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f649,plain,
$false,
inference(avatar_sat_refutation,[],[f611,f616,f621,f626,f631,f635,f643,f648]) ).
fof(f648,plain,
( ~ spl54_5
| ~ spl54_6
| ~ spl54_7
| ~ spl54_3
| ~ spl54_4
| ~ spl54_8 ),
inference(avatar_split_clause,[],[f647,f633,f613,f608,f628,f623,f618]) ).
fof(f618,plain,
( spl54_5
<=> ssList(sK53) ),
introduced(avatar_definition,[new_symbols(naming,[spl54_5])]) ).
fof(f623,plain,
( spl54_6
<=> ssList(sK52) ),
introduced(avatar_definition,[new_symbols(naming,[spl54_6])]) ).
fof(f628,plain,
( spl54_7
<=> ssItem(sK51) ),
introduced(avatar_definition,[new_symbols(naming,[spl54_7])]) ).
fof(f608,plain,
( spl54_3
<=> sK49 = app(sK52,sK53) ),
introduced(avatar_definition,[new_symbols(naming,[spl54_3])]) ).
fof(f613,plain,
( spl54_4
<=> sK50 = app(app(sK52,cons(sK51,nil)),sK53) ),
introduced(avatar_definition,[new_symbols(naming,[spl54_4])]) ).
fof(f633,plain,
( spl54_8
<=> ! [X9,X8,X10] :
( app(X9,X10) != sK49
| ~ ssItem(X8)
| ~ ssList(X9)
| ~ ssList(X10)
| app(app(X9,cons(X8,nil)),X10) != sK50 ) ),
introduced(avatar_definition,[new_symbols(naming,[spl54_8])]) ).
fof(f647,plain,
( ~ ssItem(sK51)
| ~ ssList(sK52)
| ~ ssList(sK53)
| ~ spl54_3
| ~ spl54_4
| ~ spl54_8 ),
inference(trivial_inequality_removal,[],[f646]) ).
fof(f646,plain,
( sK49 != sK49
| ~ ssItem(sK51)
| ~ ssList(sK52)
| ~ ssList(sK53)
| ~ spl54_3
| ~ spl54_4
| ~ spl54_8 ),
inference(forward_demodulation,[],[f645,f610]) ).
fof(f610,plain,
( sK49 = app(sK52,sK53)
| ~ spl54_3 ),
inference(avatar_component_clause,[],[f608]) ).
fof(f645,plain,
( ~ ssItem(sK51)
| ~ ssList(sK52)
| ~ ssList(sK53)
| sK49 != app(sK52,sK53)
| ~ spl54_4
| ~ spl54_8 ),
inference(trivial_inequality_removal,[],[f644]) ).
fof(f644,plain,
( sK50 != sK50
| ~ ssItem(sK51)
| ~ ssList(sK52)
| ~ ssList(sK53)
| sK49 != app(sK52,sK53)
| ~ spl54_4
| ~ spl54_8 ),
inference(superposition,[],[f634,f615]) ).
fof(f615,plain,
( sK50 = app(app(sK52,cons(sK51,nil)),sK53)
| ~ spl54_4 ),
inference(avatar_component_clause,[],[f613]) ).
fof(f634,plain,
( ! [X10,X8,X9] :
( app(app(X9,cons(X8,nil)),X10) != sK50
| ~ ssItem(X8)
| ~ ssList(X9)
| ~ ssList(X10)
| app(X9,X10) != sK49 )
| ~ spl54_8 ),
inference(avatar_component_clause,[],[f633]) ).
fof(f643,plain,
spl54_2,
inference(avatar_split_clause,[],[f591,f603]) ).
fof(f603,plain,
( spl54_2
<=> neq(sK50,nil) ),
introduced(avatar_definition,[new_symbols(naming,[spl54_2])]) ).
fof(f591,plain,
neq(sK50,nil),
inference(duplicate_literal_removal,[],[f561]) ).
fof(f561,plain,
( neq(sK50,nil)
| neq(sK50,nil) ),
inference(definition_unfolding,[],[f536,f534,f534]) ).
fof(f534,plain,
sK48 = sK50,
inference(cnf_transformation,[],[f339]) ).
fof(f339,plain,
( ( ( ~ neq(sK50,nil)
& neq(sK48,nil) )
| ( ! [X7] :
( ~ geq(X7,sK51)
| ~ memberP(sK50,X7)
| sK51 = X7
| ~ ssItem(X7) )
& sK49 = app(sK52,sK53)
& sK50 = app(app(sK52,cons(sK51,nil)),sK53)
& ssList(sK53)
& ssList(sK52)
& ssItem(sK51)
& ! [X8] :
( ! [X9] :
( ! [X10] :
( app(X9,X10) != sK47
| app(app(X9,cons(X8,nil)),X10) != sK48
| ~ ssList(X10) )
| ~ ssList(X9) )
| ~ ssItem(X8) )
& neq(sK48,nil) ) )
& 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])],[f223,f338,f337,f336,f335,f334,f333,f332]) ).
fof(f332,plain,
( ? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ( ~ neq(X3,nil)
& neq(X1,nil) )
| ( ? [X4] :
( ? [X5] :
( ? [X6] :
( ! [X7] :
( ~ geq(X7,X4)
| ~ memberP(X3,X7)
| X4 = X7
| ~ ssItem(X7) )
& app(X5,X6) = X2
& app(app(X5,cons(X4,nil)),X6) = X3
& ssList(X6) )
& ssList(X5) )
& ssItem(X4) )
& ! [X8] :
( ! [X9] :
( ! [X10] :
( app(X9,X10) != X0
| app(app(X9,cons(X8,nil)),X10) != X1
| ~ ssList(X10) )
| ~ ssList(X9) )
| ~ ssItem(X8) )
& neq(X1,nil) ) )
& X0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) )
=> ( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ( ~ neq(X3,nil)
& neq(X1,nil) )
| ( ? [X4] :
( ? [X5] :
( ? [X6] :
( ! [X7] :
( ~ geq(X7,X4)
| ~ memberP(X3,X7)
| X4 = X7
| ~ ssItem(X7) )
& app(X5,X6) = X2
& app(app(X5,cons(X4,nil)),X6) = X3
& ssList(X6) )
& ssList(X5) )
& ssItem(X4) )
& ! [X8] :
( ! [X9] :
( ! [X10] :
( app(X9,X10) != sK47
| app(app(X9,cons(X8,nil)),X10) != X1
| ~ ssList(X10) )
| ~ ssList(X9) )
| ~ ssItem(X8) )
& neq(X1,nil) ) )
& sK47 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(sK47) ) ),
introduced(choice_axiom,[]) ).
fof(f333,plain,
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ( ~ neq(X3,nil)
& neq(X1,nil) )
| ( ? [X4] :
( ? [X5] :
( ? [X6] :
( ! [X7] :
( ~ geq(X7,X4)
| ~ memberP(X3,X7)
| X4 = X7
| ~ ssItem(X7) )
& app(X5,X6) = X2
& app(app(X5,cons(X4,nil)),X6) = X3
& ssList(X6) )
& ssList(X5) )
& ssItem(X4) )
& ! [X8] :
( ! [X9] :
( ! [X10] :
( app(X9,X10) != sK47
| app(app(X9,cons(X8,nil)),X10) != X1
| ~ ssList(X10) )
| ~ ssList(X9) )
| ~ ssItem(X8) )
& neq(X1,nil) ) )
& sK47 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
=> ( ? [X2] :
( ? [X3] :
( ( ( ~ neq(X3,nil)
& neq(sK48,nil) )
| ( ? [X4] :
( ? [X5] :
( ? [X6] :
( ! [X7] :
( ~ geq(X7,X4)
| ~ memberP(X3,X7)
| X4 = X7
| ~ ssItem(X7) )
& app(X5,X6) = X2
& app(app(X5,cons(X4,nil)),X6) = X3
& ssList(X6) )
& ssList(X5) )
& ssItem(X4) )
& ! [X8] :
( ! [X9] :
( ! [X10] :
( app(X9,X10) != sK47
| app(app(X9,cons(X8,nil)),X10) != sK48
| ~ ssList(X10) )
| ~ ssList(X9) )
| ~ ssItem(X8) )
& neq(sK48,nil) ) )
& sK47 = X2
& sK48 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(sK48) ) ),
introduced(choice_axiom,[]) ).
fof(f334,plain,
( ? [X2] :
( ? [X3] :
( ( ( ~ neq(X3,nil)
& neq(sK48,nil) )
| ( ? [X4] :
( ? [X5] :
( ? [X6] :
( ! [X7] :
( ~ geq(X7,X4)
| ~ memberP(X3,X7)
| X4 = X7
| ~ ssItem(X7) )
& app(X5,X6) = X2
& app(app(X5,cons(X4,nil)),X6) = X3
& ssList(X6) )
& ssList(X5) )
& ssItem(X4) )
& ! [X8] :
( ! [X9] :
( ! [X10] :
( app(X9,X10) != sK47
| app(app(X9,cons(X8,nil)),X10) != sK48
| ~ ssList(X10) )
| ~ ssList(X9) )
| ~ ssItem(X8) )
& neq(sK48,nil) ) )
& sK47 = X2
& sK48 = X3
& ssList(X3) )
& ssList(X2) )
=> ( ? [X3] :
( ( ( ~ neq(X3,nil)
& neq(sK48,nil) )
| ( ? [X4] :
( ? [X5] :
( ? [X6] :
( ! [X7] :
( ~ geq(X7,X4)
| ~ memberP(X3,X7)
| X4 = X7
| ~ ssItem(X7) )
& app(X5,X6) = sK49
& app(app(X5,cons(X4,nil)),X6) = X3
& ssList(X6) )
& ssList(X5) )
& ssItem(X4) )
& ! [X8] :
( ! [X9] :
( ! [X10] :
( app(X9,X10) != sK47
| app(app(X9,cons(X8,nil)),X10) != sK48
| ~ ssList(X10) )
| ~ ssList(X9) )
| ~ ssItem(X8) )
& neq(sK48,nil) ) )
& sK47 = sK49
& sK48 = X3
& ssList(X3) )
& ssList(sK49) ) ),
introduced(choice_axiom,[]) ).
fof(f335,plain,
( ? [X3] :
( ( ( ~ neq(X3,nil)
& neq(sK48,nil) )
| ( ? [X4] :
( ? [X5] :
( ? [X6] :
( ! [X7] :
( ~ geq(X7,X4)
| ~ memberP(X3,X7)
| X4 = X7
| ~ ssItem(X7) )
& app(X5,X6) = sK49
& app(app(X5,cons(X4,nil)),X6) = X3
& ssList(X6) )
& ssList(X5) )
& ssItem(X4) )
& ! [X8] :
( ! [X9] :
( ! [X10] :
( app(X9,X10) != sK47
| app(app(X9,cons(X8,nil)),X10) != sK48
| ~ ssList(X10) )
| ~ ssList(X9) )
| ~ ssItem(X8) )
& neq(sK48,nil) ) )
& sK47 = sK49
& sK48 = X3
& ssList(X3) )
=> ( ( ( ~ neq(sK50,nil)
& neq(sK48,nil) )
| ( ? [X4] :
( ? [X5] :
( ? [X6] :
( ! [X7] :
( ~ geq(X7,X4)
| ~ memberP(sK50,X7)
| X4 = X7
| ~ ssItem(X7) )
& app(X5,X6) = sK49
& app(app(X5,cons(X4,nil)),X6) = sK50
& ssList(X6) )
& ssList(X5) )
& ssItem(X4) )
& ! [X8] :
( ! [X9] :
( ! [X10] :
( app(X9,X10) != sK47
| app(app(X9,cons(X8,nil)),X10) != sK48
| ~ ssList(X10) )
| ~ ssList(X9) )
| ~ ssItem(X8) )
& neq(sK48,nil) ) )
& sK47 = sK49
& sK48 = sK50
& ssList(sK50) ) ),
introduced(choice_axiom,[]) ).
fof(f336,plain,
( ? [X4] :
( ? [X5] :
( ? [X6] :
( ! [X7] :
( ~ geq(X7,X4)
| ~ memberP(sK50,X7)
| X4 = X7
| ~ ssItem(X7) )
& app(X5,X6) = sK49
& app(app(X5,cons(X4,nil)),X6) = sK50
& ssList(X6) )
& ssList(X5) )
& ssItem(X4) )
=> ( ? [X5] :
( ? [X6] :
( ! [X7] :
( ~ geq(X7,sK51)
| ~ memberP(sK50,X7)
| sK51 = X7
| ~ ssItem(X7) )
& app(X5,X6) = sK49
& sK50 = app(app(X5,cons(sK51,nil)),X6)
& ssList(X6) )
& ssList(X5) )
& ssItem(sK51) ) ),
introduced(choice_axiom,[]) ).
fof(f337,plain,
( ? [X5] :
( ? [X6] :
( ! [X7] :
( ~ geq(X7,sK51)
| ~ memberP(sK50,X7)
| sK51 = X7
| ~ ssItem(X7) )
& app(X5,X6) = sK49
& sK50 = app(app(X5,cons(sK51,nil)),X6)
& ssList(X6) )
& ssList(X5) )
=> ( ? [X6] :
( ! [X7] :
( ~ geq(X7,sK51)
| ~ memberP(sK50,X7)
| sK51 = X7
| ~ ssItem(X7) )
& sK49 = app(sK52,X6)
& sK50 = app(app(sK52,cons(sK51,nil)),X6)
& ssList(X6) )
& ssList(sK52) ) ),
introduced(choice_axiom,[]) ).
fof(f338,plain,
( ? [X6] :
( ! [X7] :
( ~ geq(X7,sK51)
| ~ memberP(sK50,X7)
| sK51 = X7
| ~ ssItem(X7) )
& sK49 = app(sK52,X6)
& sK50 = app(app(sK52,cons(sK51,nil)),X6)
& ssList(X6) )
=> ( ! [X7] :
( ~ geq(X7,sK51)
| ~ memberP(sK50,X7)
| sK51 = X7
| ~ ssItem(X7) )
& sK49 = app(sK52,sK53)
& sK50 = app(app(sK52,cons(sK51,nil)),sK53)
& ssList(sK53) ) ),
introduced(choice_axiom,[]) ).
fof(f223,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ( ~ neq(X3,nil)
& neq(X1,nil) )
| ( ? [X4] :
( ? [X5] :
( ? [X6] :
( ! [X7] :
( ~ geq(X7,X4)
| ~ memberP(X3,X7)
| X4 = X7
| ~ ssItem(X7) )
& app(X5,X6) = X2
& app(app(X5,cons(X4,nil)),X6) = X3
& ssList(X6) )
& ssList(X5) )
& ssItem(X4) )
& ! [X8] :
( ! [X9] :
( ! [X10] :
( app(X9,X10) != X0
| app(app(X9,cons(X8,nil)),X10) != X1
| ~ ssList(X10) )
| ~ ssList(X9) )
| ~ ssItem(X8) )
& neq(X1,nil) ) )
& X0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(flattening,[],[f222]) ).
fof(f222,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ( ~ neq(X3,nil)
& neq(X1,nil) )
| ( ? [X4] :
( ? [X5] :
( ? [X6] :
( ! [X7] :
( ~ geq(X7,X4)
| ~ memberP(X3,X7)
| X4 = X7
| ~ ssItem(X7) )
& app(X5,X6) = X2
& app(app(X5,cons(X4,nil)),X6) = X3
& ssList(X6) )
& ssList(X5) )
& ssItem(X4) )
& ! [X8] :
( ! [X9] :
( ! [X10] :
( app(X9,X10) != X0
| app(app(X9,cons(X8,nil)),X10) != X1
| ~ ssList(X10) )
| ~ ssList(X9) )
| ~ ssItem(X8) )
& neq(X1,nil) ) )
& 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)
=> ( ( ( neq(X3,nil)
| ~ neq(X1,nil) )
& ( ! [X4] :
( ssItem(X4)
=> ! [X5] :
( ssList(X5)
=> ! [X6] :
( ssList(X6)
=> ( ? [X7] :
( geq(X7,X4)
& memberP(X3,X7)
& X4 != X7
& ssItem(X7) )
| app(X5,X6) != X2
| app(app(X5,cons(X4,nil)),X6) != X3 ) ) ) )
| ? [X8] :
( ? [X9] :
( ? [X10] :
( app(X9,X10) = X0
& app(app(X9,cons(X8,nil)),X10) = X1
& ssList(X10) )
& ssList(X9) )
& ssItem(X8) )
| ~ neq(X1,nil) ) )
| X0 != X2
| X1 != X3 ) ) ) ) ),
inference(rectify,[],[f97]) ).
fof(f97,negated_conjecture,
~ ! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( ( ( neq(X3,nil)
| ~ neq(X1,nil) )
& ( ! [X7] :
( ssItem(X7)
=> ! [X8] :
( ssList(X8)
=> ! [X9] :
( ssList(X9)
=> ( ? [X10] :
( geq(X10,X7)
& memberP(X3,X10)
& X7 != X10
& ssItem(X10) )
| app(X8,X9) != X2
| app(app(X8,cons(X7,nil)),X9) != X3 ) ) ) )
| ? [X4] :
( ? [X5] :
( ? [X6] :
( app(X5,X6) = X0
& app(app(X5,cons(X4,nil)),X6) = X1
& ssList(X6) )
& ssList(X5) )
& ssItem(X4) )
| ~ neq(X1,nil) ) )
| X0 != X2
| X1 != X3 ) ) ) ) ),
inference(negated_conjecture,[],[f96]) ).
fof(f96,conjecture,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( ( ( neq(X3,nil)
| ~ neq(X1,nil) )
& ( ! [X7] :
( ssItem(X7)
=> ! [X8] :
( ssList(X8)
=> ! [X9] :
( ssList(X9)
=> ( ? [X10] :
( geq(X10,X7)
& memberP(X3,X10)
& X7 != X10
& ssItem(X10) )
| app(X8,X9) != X2
| app(app(X8,cons(X7,nil)),X9) != X3 ) ) ) )
| ? [X4] :
( ? [X5] :
( ? [X6] :
( app(X5,X6) = X0
& app(app(X5,cons(X4,nil)),X6) = X1
& ssList(X6) )
& ssList(X5) )
& ssItem(X4) )
| ~ neq(X1,nil) ) )
| X0 != X2
| X1 != X3 ) ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.jzdaRm9Jfv/Vampire---4.8_21232',co1) ).
fof(f536,plain,
( neq(sK48,nil)
| neq(sK48,nil) ),
inference(cnf_transformation,[],[f339]) ).
fof(f635,plain,
( spl54_8
| ~ spl54_2 ),
inference(avatar_split_clause,[],[f552,f603,f633]) ).
fof(f552,plain,
! [X10,X8,X9] :
( ~ neq(sK50,nil)
| app(X9,X10) != sK49
| app(app(X9,cons(X8,nil)),X10) != sK50
| ~ ssList(X10)
| ~ ssList(X9)
| ~ ssItem(X8) ),
inference(definition_unfolding,[],[f545,f535,f534]) ).
fof(f535,plain,
sK47 = sK49,
inference(cnf_transformation,[],[f339]) ).
fof(f545,plain,
! [X10,X8,X9] :
( ~ neq(sK50,nil)
| app(X9,X10) != sK47
| app(app(X9,cons(X8,nil)),X10) != sK48
| ~ ssList(X10)
| ~ ssList(X9)
| ~ ssItem(X8) ),
inference(cnf_transformation,[],[f339]) ).
fof(f631,plain,
( spl54_7
| ~ spl54_2 ),
inference(avatar_split_clause,[],[f546,f603,f628]) ).
fof(f546,plain,
( ~ neq(sK50,nil)
| ssItem(sK51) ),
inference(cnf_transformation,[],[f339]) ).
fof(f626,plain,
( spl54_6
| ~ spl54_2 ),
inference(avatar_split_clause,[],[f547,f603,f623]) ).
fof(f547,plain,
( ~ neq(sK50,nil)
| ssList(sK52) ),
inference(cnf_transformation,[],[f339]) ).
fof(f621,plain,
( spl54_5
| ~ spl54_2 ),
inference(avatar_split_clause,[],[f548,f603,f618]) ).
fof(f548,plain,
( ~ neq(sK50,nil)
| ssList(sK53) ),
inference(cnf_transformation,[],[f339]) ).
fof(f616,plain,
( spl54_4
| ~ spl54_2 ),
inference(avatar_split_clause,[],[f549,f603,f613]) ).
fof(f549,plain,
( ~ neq(sK50,nil)
| sK50 = app(app(sK52,cons(sK51,nil)),sK53) ),
inference(cnf_transformation,[],[f339]) ).
fof(f611,plain,
( spl54_3
| ~ spl54_2 ),
inference(avatar_split_clause,[],[f550,f603,f608]) ).
fof(f550,plain,
( ~ neq(sK50,nil)
| sK49 = app(sK52,sK53) ),
inference(cnf_transformation,[],[f339]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : SWC010+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.16/0.37 % Computer : n020.cluster.edu
% 0.16/0.37 % Model : x86_64 x86_64
% 0.16/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.37 % Memory : 8042.1875MB
% 0.16/0.37 % OS : Linux 3.10.0-693.el7.x86_64
% 0.16/0.37 % CPULimit : 300
% 0.16/0.37 % WCLimit : 300
% 0.16/0.37 % DateTime : Tue Apr 30 18:17:47 EDT 2024
% 0.16/0.37 % CPUTime :
% 0.16/0.37 This is a FOF_THM_RFO_SEQ problem
% 0.16/0.37 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.jzdaRm9Jfv/Vampire---4.8_21232
% 0.54/0.75 % (21489)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.76 % (21483)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.76 % (21485)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.76 % (21484)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.76 % (21487)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.76 % (21486)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.76 % (21488)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.60/0.77 % (21484)First to succeed.
% 0.60/0.77 % (21490)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.60/0.77 % (21484)Refutation found. Thanks to Tanya!
% 0.60/0.77 % SZS status Theorem for Vampire---4
% 0.60/0.77 % SZS output start Proof for Vampire---4
% See solution above
% 0.60/0.77 % (21484)------------------------------
% 0.60/0.77 % (21484)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.60/0.77 % (21484)Termination reason: Refutation
% 0.60/0.77
% 0.60/0.77 % (21484)Memory used [KB]: 1451
% 0.60/0.77 % (21484)Time elapsed: 0.013 s
% 0.60/0.77 % (21484)Instructions burned: 19 (million)
% 0.60/0.77 % (21484)------------------------------
% 0.60/0.77 % (21484)------------------------------
% 0.60/0.77 % (21479)Success in time 0.381 s
% 0.60/0.77 % Vampire---4.8 exiting
%------------------------------------------------------------------------------