TSTP Solution File: SWC013+1 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SWC013+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 : n002.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:12 EDT 2024
% Result : Theorem 0.63s 0.82s
% Output : Refutation 0.63s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 15
% Syntax : Number of formulae : 71 ( 8 unt; 0 def)
% Number of atoms : 464 ( 147 equ)
% Maximal formula atoms : 42 ( 6 avg)
% Number of connectives : 644 ( 251 ~; 242 |; 121 &)
% ( 8 <=>; 22 =>; 0 <=; 0 <~>)
% Maximal formula depth : 20 ( 6 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 11 ( 9 usr; 7 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 5 con; 0-2 aty)
% Number of variables : 122 ( 86 !; 36 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f275,plain,
$false,
inference(avatar_sat_refutation,[],[f232,f233,f236,f239,f250,f268,f274]) ).
fof(f274,plain,
( spl9_4
| ~ spl9_5
| ~ spl9_8 ),
inference(avatar_contradiction_clause,[],[f273]) ).
fof(f273,plain,
( $false
| spl9_4
| ~ spl9_5
| ~ spl9_8 ),
inference(subsumption_resolution,[],[f271,f269]) ).
fof(f269,plain,
( ~ neq(nil,nil)
| spl9_4
| ~ spl9_8 ),
inference(superposition,[],[f227,f264]) ).
fof(f264,plain,
( nil = sK3
| ~ spl9_8 ),
inference(avatar_component_clause,[],[f262]) ).
fof(f262,plain,
( spl9_8
<=> nil = sK3 ),
introduced(avatar_definition,[new_symbols(naming,[spl9_8])]) ).
fof(f227,plain,
( ~ neq(nil,sK3)
| spl9_4 ),
inference(avatar_component_clause,[],[f225]) ).
fof(f225,plain,
( spl9_4
<=> neq(nil,sK3) ),
introduced(avatar_definition,[new_symbols(naming,[spl9_4])]) ).
fof(f271,plain,
( neq(nil,nil)
| ~ spl9_5
| ~ spl9_8 ),
inference(superposition,[],[f230,f264]) ).
fof(f230,plain,
( neq(sK3,nil)
| ~ spl9_5 ),
inference(avatar_component_clause,[],[f229]) ).
fof(f229,plain,
( spl9_5
<=> neq(sK3,nil) ),
introduced(avatar_definition,[new_symbols(naming,[spl9_5])]) ).
fof(f268,plain,
( spl9_8
| spl9_4 ),
inference(avatar_split_clause,[],[f267,f225,f262]) ).
fof(f267,plain,
( nil = sK3
| spl9_4 ),
inference(subsumption_resolution,[],[f266,f172]) ).
fof(f172,plain,
ssList(nil),
inference(cnf_transformation,[],[f17]) ).
fof(f17,axiom,
ssList(nil),
file('/export/starexec/sandbox/tmp/tmp.l3tL2K9rQ3/Vampire---4.8_31885',ax17) ).
fof(f266,plain,
( nil = sK3
| ~ ssList(nil)
| spl9_4 ),
inference(subsumption_resolution,[],[f252,f148]) ).
fof(f148,plain,
ssList(sK3),
inference(cnf_transformation,[],[f132]) ).
fof(f132,plain,
( ( ( ~ neq(sK3,nil)
& neq(sK1,nil) )
| ( ! [X4] :
( ! [X5] :
( ~ neq(nil,sK1)
| hd(sK1) != X5
| cons(X5,nil) != X4
| ~ ssItem(X5) )
| sK0 != X4
| ~ ssList(X4) )
& ! [X6] :
( ! [X7] :
( ~ neq(nil,sK3)
| hd(sK3) != X7
| cons(X7,nil) != X6
| ~ ssItem(X7) )
| sK2 = X6
| ~ ssList(X6) )
& neq(sK1,nil) ) )
& sK0 = sK2
& sK1 = sK3
& ssList(sK3)
& ssList(sK2)
& ssList(sK1)
& ssList(sK0) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3])],[f100,f131,f130,f129,f128]) ).
fof(f128,plain,
( ? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ( ~ neq(X3,nil)
& neq(X1,nil) )
| ( ! [X4] :
( ! [X5] :
( ~ neq(nil,X1)
| hd(X1) != X5
| cons(X5,nil) != X4
| ~ ssItem(X5) )
| X0 != X4
| ~ ssList(X4) )
& ! [X6] :
( ! [X7] :
( ~ neq(nil,X3)
| hd(X3) != X7
| cons(X7,nil) != X6
| ~ ssItem(X7) )
| X2 = X6
| ~ ssList(X6) )
& 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] :
( ~ neq(nil,X1)
| hd(X1) != X5
| cons(X5,nil) != X4
| ~ ssItem(X5) )
| sK0 != X4
| ~ ssList(X4) )
& ! [X6] :
( ! [X7] :
( ~ neq(nil,X3)
| hd(X3) != X7
| cons(X7,nil) != X6
| ~ ssItem(X7) )
| X2 = X6
| ~ ssList(X6) )
& neq(X1,nil) ) )
& sK0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(sK0) ) ),
introduced(choice_axiom,[]) ).
fof(f129,plain,
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ( ~ neq(X3,nil)
& neq(X1,nil) )
| ( ! [X4] :
( ! [X5] :
( ~ neq(nil,X1)
| hd(X1) != X5
| cons(X5,nil) != X4
| ~ ssItem(X5) )
| sK0 != X4
| ~ ssList(X4) )
& ! [X6] :
( ! [X7] :
( ~ neq(nil,X3)
| hd(X3) != X7
| cons(X7,nil) != X6
| ~ ssItem(X7) )
| X2 = X6
| ~ ssList(X6) )
& neq(X1,nil) ) )
& sK0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
=> ( ? [X2] :
( ? [X3] :
( ( ( ~ neq(X3,nil)
& neq(sK1,nil) )
| ( ! [X4] :
( ! [X5] :
( ~ neq(nil,sK1)
| hd(sK1) != X5
| cons(X5,nil) != X4
| ~ ssItem(X5) )
| sK0 != X4
| ~ ssList(X4) )
& ! [X6] :
( ! [X7] :
( ~ neq(nil,X3)
| hd(X3) != X7
| cons(X7,nil) != X6
| ~ ssItem(X7) )
| X2 = X6
| ~ ssList(X6) )
& neq(sK1,nil) ) )
& sK0 = X2
& sK1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(sK1) ) ),
introduced(choice_axiom,[]) ).
fof(f130,plain,
( ? [X2] :
( ? [X3] :
( ( ( ~ neq(X3,nil)
& neq(sK1,nil) )
| ( ! [X4] :
( ! [X5] :
( ~ neq(nil,sK1)
| hd(sK1) != X5
| cons(X5,nil) != X4
| ~ ssItem(X5) )
| sK0 != X4
| ~ ssList(X4) )
& ! [X6] :
( ! [X7] :
( ~ neq(nil,X3)
| hd(X3) != X7
| cons(X7,nil) != X6
| ~ ssItem(X7) )
| X2 = X6
| ~ ssList(X6) )
& neq(sK1,nil) ) )
& sK0 = X2
& sK1 = X3
& ssList(X3) )
& ssList(X2) )
=> ( ? [X3] :
( ( ( ~ neq(X3,nil)
& neq(sK1,nil) )
| ( ! [X4] :
( ! [X5] :
( ~ neq(nil,sK1)
| hd(sK1) != X5
| cons(X5,nil) != X4
| ~ ssItem(X5) )
| sK0 != X4
| ~ ssList(X4) )
& ! [X6] :
( ! [X7] :
( ~ neq(nil,X3)
| hd(X3) != X7
| cons(X7,nil) != X6
| ~ ssItem(X7) )
| sK2 = X6
| ~ ssList(X6) )
& neq(sK1,nil) ) )
& sK0 = sK2
& sK1 = X3
& ssList(X3) )
& ssList(sK2) ) ),
introduced(choice_axiom,[]) ).
fof(f131,plain,
( ? [X3] :
( ( ( ~ neq(X3,nil)
& neq(sK1,nil) )
| ( ! [X4] :
( ! [X5] :
( ~ neq(nil,sK1)
| hd(sK1) != X5
| cons(X5,nil) != X4
| ~ ssItem(X5) )
| sK0 != X4
| ~ ssList(X4) )
& ! [X6] :
( ! [X7] :
( ~ neq(nil,X3)
| hd(X3) != X7
| cons(X7,nil) != X6
| ~ ssItem(X7) )
| sK2 = X6
| ~ ssList(X6) )
& neq(sK1,nil) ) )
& sK0 = sK2
& sK1 = X3
& ssList(X3) )
=> ( ( ( ~ neq(sK3,nil)
& neq(sK1,nil) )
| ( ! [X4] :
( ! [X5] :
( ~ neq(nil,sK1)
| hd(sK1) != X5
| cons(X5,nil) != X4
| ~ ssItem(X5) )
| sK0 != X4
| ~ ssList(X4) )
& ! [X6] :
( ! [X7] :
( ~ neq(nil,sK3)
| hd(sK3) != X7
| cons(X7,nil) != X6
| ~ ssItem(X7) )
| sK2 = X6
| ~ ssList(X6) )
& neq(sK1,nil) ) )
& sK0 = sK2
& sK1 = sK3
& ssList(sK3) ) ),
introduced(choice_axiom,[]) ).
fof(f100,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ( ~ neq(X3,nil)
& neq(X1,nil) )
| ( ! [X4] :
( ! [X5] :
( ~ neq(nil,X1)
| hd(X1) != X5
| cons(X5,nil) != X4
| ~ ssItem(X5) )
| X0 != X4
| ~ ssList(X4) )
& ! [X6] :
( ! [X7] :
( ~ neq(nil,X3)
| hd(X3) != X7
| cons(X7,nil) != X6
| ~ ssItem(X7) )
| X2 = X6
| ~ ssList(X6) )
& neq(X1,nil) ) )
& X0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(flattening,[],[f99]) ).
fof(f99,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ( ~ neq(X3,nil)
& neq(X1,nil) )
| ( ! [X4] :
( ! [X5] :
( ~ neq(nil,X1)
| hd(X1) != X5
| cons(X5,nil) != X4
| ~ ssItem(X5) )
| X0 != X4
| ~ ssList(X4) )
& ! [X6] :
( ! [X7] :
( ~ neq(nil,X3)
| hd(X3) != X7
| cons(X7,nil) != X6
| ~ ssItem(X7) )
| X2 = X6
| ~ ssList(X6) )
& 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] :
( ? [X5] :
( neq(nil,X1)
& hd(X1) = X5
& cons(X5,nil) = X4
& ssItem(X5) )
& X0 = X4
& ssList(X4) )
| ? [X6] :
( ? [X7] :
( neq(nil,X3)
& hd(X3) = X7
& cons(X7,nil) = X6
& ssItem(X7) )
& X2 != X6
& ssList(X6) )
| ~ 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) )
& ( ? [X6] :
( ? [X7] :
( neq(nil,X1)
& hd(X1) = X7
& cons(X7,nil) = X6
& ssItem(X7) )
& X0 = X6
& ssList(X6) )
| ? [X4] :
( ? [X5] :
( neq(nil,X3)
& hd(X3) = X5
& cons(X5,nil) = X4
& ssItem(X5) )
& X2 != X4
& ssList(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) )
& ( ? [X6] :
( ? [X7] :
( neq(nil,X1)
& hd(X1) = X7
& cons(X7,nil) = X6
& ssItem(X7) )
& X0 = X6
& ssList(X6) )
| ? [X4] :
( ? [X5] :
( neq(nil,X3)
& hd(X3) = X5
& cons(X5,nil) = X4
& ssItem(X5) )
& X2 != X4
& ssList(X4) )
| ~ neq(X1,nil) ) )
| X0 != X2
| X1 != X3 ) ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.l3tL2K9rQ3/Vampire---4.8_31885',co1) ).
fof(f252,plain,
( nil = sK3
| ~ ssList(sK3)
| ~ ssList(nil)
| spl9_4 ),
inference(resolution,[],[f227,f169]) ).
fof(f169,plain,
! [X0,X1] :
( neq(X0,X1)
| X0 = X1
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f139]) ).
fof(f139,plain,
! [X0] :
( ! [X1] :
( ( ( neq(X0,X1)
| X0 = X1 )
& ( X0 != X1
| ~ neq(X0,X1) ) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(nnf_transformation,[],[f108]) ).
fof(f108,plain,
! [X0] :
( ! [X1] :
( ( neq(X0,X1)
<=> X0 != X1 )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f15]) ).
fof(f15,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ( neq(X0,X1)
<=> X0 != X1 ) ) ),
file('/export/starexec/sandbox/tmp/tmp.l3tL2K9rQ3/Vampire---4.8_31885',ax15) ).
fof(f250,plain,
( spl9_3
| ~ spl9_5 ),
inference(avatar_contradiction_clause,[],[f249]) ).
fof(f249,plain,
( $false
| spl9_3
| ~ spl9_5 ),
inference(subsumption_resolution,[],[f248,f172]) ).
fof(f248,plain,
( ~ ssList(nil)
| spl9_3
| ~ spl9_5 ),
inference(resolution,[],[f244,f208]) ).
fof(f208,plain,
! [X1] :
( ~ neq(X1,X1)
| ~ ssList(X1) ),
inference(duplicate_literal_removal,[],[f204]) ).
fof(f204,plain,
! [X1] :
( ~ neq(X1,X1)
| ~ ssList(X1)
| ~ ssList(X1) ),
inference(equality_resolution,[],[f168]) ).
fof(f168,plain,
! [X0,X1] :
( X0 != X1
| ~ neq(X0,X1)
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f139]) ).
fof(f244,plain,
( neq(nil,nil)
| spl9_3
| ~ spl9_5 ),
inference(superposition,[],[f230,f241]) ).
fof(f241,plain,
( nil = sK3
| spl9_3 ),
inference(subsumption_resolution,[],[f240,f148]) ).
fof(f240,plain,
( nil = sK3
| ~ ssList(sK3)
| spl9_3 ),
inference(resolution,[],[f223,f177]) ).
fof(f177,plain,
! [X0] :
( ssItem(hd(X0))
| nil = X0
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f116]) ).
fof(f116,plain,
! [X0] :
( ssItem(hd(X0))
| nil = X0
| ~ ssList(X0) ),
inference(flattening,[],[f115]) ).
fof(f115,plain,
! [X0] :
( ssItem(hd(X0))
| nil = X0
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f22]) ).
fof(f22,axiom,
! [X0] :
( ssList(X0)
=> ( nil != X0
=> ssItem(hd(X0)) ) ),
file('/export/starexec/sandbox/tmp/tmp.l3tL2K9rQ3/Vampire---4.8_31885',ax22) ).
fof(f223,plain,
( ~ ssItem(hd(sK3))
| spl9_3 ),
inference(avatar_component_clause,[],[f221]) ).
fof(f221,plain,
( spl9_3
<=> ssItem(hd(sK3)) ),
introduced(avatar_definition,[new_symbols(naming,[spl9_3])]) ).
fof(f239,plain,
( ~ spl9_3
| spl9_1 ),
inference(avatar_split_clause,[],[f238,f213,f221]) ).
fof(f213,plain,
( spl9_1
<=> ssList(cons(hd(sK3),nil)) ),
introduced(avatar_definition,[new_symbols(naming,[spl9_1])]) ).
fof(f238,plain,
( ~ ssItem(hd(sK3))
| spl9_1 ),
inference(subsumption_resolution,[],[f237,f172]) ).
fof(f237,plain,
( ~ ssItem(hd(sK3))
| ~ ssList(nil)
| spl9_1 ),
inference(resolution,[],[f215,f167]) ).
fof(f167,plain,
! [X0,X1] :
( ssList(cons(X1,X0))
| ~ ssItem(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f107]) ).
fof(f107,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.l3tL2K9rQ3/Vampire---4.8_31885',ax16) ).
fof(f215,plain,
( ~ ssList(cons(hd(sK3),nil))
| spl9_1 ),
inference(avatar_component_clause,[],[f213]) ).
fof(f236,plain,
spl9_5,
inference(avatar_split_clause,[],[f211,f229]) ).
fof(f211,plain,
neq(sK3,nil),
inference(duplicate_literal_removal,[],[f193]) ).
fof(f193,plain,
( neq(sK3,nil)
| neq(sK3,nil) ),
inference(definition_unfolding,[],[f151,f149,f149]) ).
fof(f149,plain,
sK1 = sK3,
inference(cnf_transformation,[],[f132]) ).
fof(f151,plain,
( neq(sK1,nil)
| neq(sK1,nil) ),
inference(cnf_transformation,[],[f132]) ).
fof(f233,plain,
( ~ spl9_1
| spl9_2
| ~ spl9_3
| ~ spl9_4
| ~ spl9_5 ),
inference(avatar_split_clause,[],[f199,f229,f225,f221,f217,f213]) ).
fof(f217,plain,
( spl9_2
<=> sK2 = cons(hd(sK3),nil) ),
introduced(avatar_definition,[new_symbols(naming,[spl9_2])]) ).
fof(f199,plain,
( ~ neq(sK3,nil)
| ~ neq(nil,sK3)
| ~ ssItem(hd(sK3))
| sK2 = cons(hd(sK3),nil)
| ~ ssList(cons(hd(sK3),nil)) ),
inference(equality_resolution,[],[f198]) ).
fof(f198,plain,
! [X6] :
( ~ neq(sK3,nil)
| ~ neq(nil,sK3)
| cons(hd(sK3),nil) != X6
| ~ ssItem(hd(sK3))
| sK2 = X6
| ~ ssList(X6) ),
inference(equality_resolution,[],[f155]) ).
fof(f155,plain,
! [X6,X7] :
( ~ neq(sK3,nil)
| ~ neq(nil,sK3)
| hd(sK3) != X7
| cons(X7,nil) != X6
| ~ ssItem(X7)
| sK2 = X6
| ~ ssList(X6) ),
inference(cnf_transformation,[],[f132]) ).
fof(f232,plain,
( ~ spl9_1
| ~ spl9_2
| ~ spl9_3
| ~ spl9_4
| ~ spl9_5 ),
inference(avatar_split_clause,[],[f197,f229,f225,f221,f217,f213]) ).
fof(f197,plain,
( ~ neq(sK3,nil)
| ~ neq(nil,sK3)
| ~ ssItem(hd(sK3))
| sK2 != cons(hd(sK3),nil)
| ~ ssList(cons(hd(sK3),nil)) ),
inference(equality_resolution,[],[f196]) ).
fof(f196,plain,
! [X4] :
( ~ neq(sK3,nil)
| ~ neq(nil,sK3)
| cons(hd(sK3),nil) != X4
| ~ ssItem(hd(sK3))
| sK2 != X4
| ~ ssList(X4) ),
inference(equality_resolution,[],[f189]) ).
fof(f189,plain,
! [X4,X5] :
( ~ neq(sK3,nil)
| ~ neq(nil,sK3)
| hd(sK3) != X5
| cons(X5,nil) != X4
| ~ ssItem(X5)
| sK2 != X4
| ~ ssList(X4) ),
inference(definition_unfolding,[],[f156,f149,f149,f150]) ).
fof(f150,plain,
sK0 = sK2,
inference(cnf_transformation,[],[f132]) ).
fof(f156,plain,
! [X4,X5] :
( ~ neq(sK3,nil)
| ~ neq(nil,sK1)
| hd(sK1) != X5
| cons(X5,nil) != X4
| ~ ssItem(X5)
| sK0 != X4
| ~ ssList(X4) ),
inference(cnf_transformation,[],[f132]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.11 % Problem : SWC013+1 : TPTP v8.1.2. 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 : n002.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 : Tue Apr 30 18:37:55 EDT 2024
% 0.12/0.34 % CPUTime :
% 0.12/0.34 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/tmp/tmp.l3tL2K9rQ3/Vampire---4.8_31885
% 0.63/0.82 % (31998)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 (2995ds/34Mi)
% 0.63/0.82 % (32000)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 (2995ds/83Mi)
% 0.63/0.82 % (31999)lrs+1002_1:16_to=lpo:sil=32000:sp=unary_frequency:sos=on:i=45:bd=off:ss=axioms_0 on Vampire---4 for (2995ds/45Mi)
% 0.63/0.82 % (31997)ott+1011_1:1_sil=2000:urr=on:i=33:sd=1:kws=inv_frequency:ss=axioms:sup=off_0 on Vampire---4 for (2995ds/33Mi)
% 0.63/0.82 % (31995)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 (2995ds/51Mi)
% 0.63/0.82 % (31994)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 (2995ds/34Mi)
% 0.63/0.82 % (31996)lrs+1011_1:1_sil=8000:sp=occurrence:nwc=10.0:i=78:ss=axioms:sgt=8_0 on Vampire---4 for (2995ds/78Mi)
% 0.63/0.82 % (32001)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 (2995ds/56Mi)
% 0.63/0.82 % (32001)Refutation not found, incomplete strategy% (32001)------------------------------
% 0.63/0.82 % (32001)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.63/0.82 % (32001)Termination reason: Refutation not found, incomplete strategy
% 0.63/0.82
% 0.63/0.82 % (32001)Memory used [KB]: 1149
% 0.63/0.82 % (32001)Time elapsed: 0.004 s
% 0.63/0.82 % (32001)Instructions burned: 5 (million)
% 0.63/0.82 % (32001)------------------------------
% 0.63/0.82 % (32001)------------------------------
% 0.63/0.82 % (31999)First to succeed.
% 0.63/0.82 % (31996)Also succeeded, but the first one will report.
% 0.63/0.82 % (31999)Refutation found. Thanks to Tanya!
% 0.63/0.82 % SZS status Theorem for Vampire---4
% 0.63/0.82 % SZS output start Proof for Vampire---4
% See solution above
% 0.63/0.82 % (31999)------------------------------
% 0.63/0.82 % (31999)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.63/0.82 % (31999)Termination reason: Refutation
% 0.63/0.82
% 0.63/0.82 % (31999)Memory used [KB]: 1169
% 0.63/0.82 % (31999)Time elapsed: 0.006 s
% 0.63/0.82 % (31999)Instructions burned: 8 (million)
% 0.63/0.82 % (31999)------------------------------
% 0.63/0.82 % (31999)------------------------------
% 0.63/0.82 % (31993)Success in time 0.48 s
% 0.63/0.82 % Vampire---4.8 exiting
%------------------------------------------------------------------------------