TSTP Solution File: SWC308+1 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SWC308+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 : n009.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 : Sun May 5 09:50:12 EDT 2024
% Result : Theorem 0.61s 0.78s
% Output : Refutation 0.61s
% Verified :
% SZS Type : Refutation
% Derivation depth : 15
% Number of leaves : 21
% Syntax : Number of formulae : 92 ( 13 unt; 0 def)
% Number of atoms : 590 ( 220 equ)
% Maximal formula atoms : 48 ( 6 avg)
% Number of connectives : 838 ( 340 ~; 329 |; 130 &)
% ( 11 <=>; 28 =>; 0 <=; 0 <~>)
% Maximal formula depth : 24 ( 6 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 14 ( 12 usr; 10 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 5 con; 0-2 aty)
% Number of variables : 177 ( 135 !; 42 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f796,plain,
$false,
inference(avatar_sat_refutation,[],[f614,f616,f636,f638,f741,f777,f779,f781,f783,f786]) ).
fof(f786,plain,
( ~ spl51_10
| ~ spl51_9
| spl51_2
| spl51_8 ),
inference(avatar_split_clause,[],[f784,f611,f585,f620,f624]) ).
fof(f624,plain,
( spl51_10
<=> ssList(nil) ),
introduced(avatar_definition,[new_symbols(naming,[spl51_10])]) ).
fof(f620,plain,
( spl51_9
<=> ssList(sK50) ),
introduced(avatar_definition,[new_symbols(naming,[spl51_9])]) ).
fof(f585,plain,
( spl51_2
<=> nil = sK50 ),
introduced(avatar_definition,[new_symbols(naming,[spl51_2])]) ).
fof(f611,plain,
( spl51_8
<=> neq(nil,sK50) ),
introduced(avatar_definition,[new_symbols(naming,[spl51_8])]) ).
fof(f784,plain,
( nil = sK50
| ~ ssList(sK50)
| ~ ssList(nil)
| spl51_8 ),
inference(resolution,[],[f613,f418]) ).
fof(f418,plain,
! [X0,X1] :
( neq(X0,X1)
| X0 = X1
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f305]) ).
fof(f305,plain,
! [X0] :
( ! [X1] :
( ( ( neq(X0,X1)
| X0 = X1 )
& ( X0 != X1
| ~ neq(X0,X1) ) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(nnf_transformation,[],[f119]) ).
fof(f119,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.zcr0WsnGdt/Vampire---4.8_7890',ax15) ).
fof(f613,plain,
( ~ neq(nil,sK50)
| spl51_8 ),
inference(avatar_component_clause,[],[f611]) ).
fof(f783,plain,
( ~ spl51_10
| ~ spl51_7
| spl51_6 ),
inference(avatar_split_clause,[],[f782,f603,f607,f624]) ).
fof(f607,plain,
( spl51_7
<=> ssItem(hd(sK50)) ),
introduced(avatar_definition,[new_symbols(naming,[spl51_7])]) ).
fof(f603,plain,
( spl51_6
<=> ssList(cons(hd(sK50),nil)) ),
introduced(avatar_definition,[new_symbols(naming,[spl51_6])]) ).
fof(f782,plain,
( ~ ssItem(hd(sK50))
| ~ ssList(nil)
| spl51_6 ),
inference(resolution,[],[f605,f419]) ).
fof(f419,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.zcr0WsnGdt/Vampire---4.8_7890',ax16) ).
fof(f605,plain,
( ~ ssList(cons(hd(sK50),nil))
| spl51_6 ),
inference(avatar_component_clause,[],[f603]) ).
fof(f781,plain,
( ~ spl51_9
| spl51_2
| spl51_5 ),
inference(avatar_split_clause,[],[f780,f599,f585,f620]) ).
fof(f599,plain,
( spl51_5
<=> ssList(tl(sK50)) ),
introduced(avatar_definition,[new_symbols(naming,[spl51_5])]) ).
fof(f780,plain,
( nil = sK50
| ~ ssList(sK50)
| spl51_5 ),
inference(resolution,[],[f601,f430]) ).
fof(f430,plain,
! [X0] :
( ssList(tl(X0))
| nil = X0
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f131]) ).
fof(f131,plain,
! [X0] :
( ssList(tl(X0))
| nil = X0
| ~ ssList(X0) ),
inference(flattening,[],[f130]) ).
fof(f130,plain,
! [X0] :
( ssList(tl(X0))
| nil = X0
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f24]) ).
fof(f24,axiom,
! [X0] :
( ssList(X0)
=> ( nil != X0
=> ssList(tl(X0)) ) ),
file('/export/starexec/sandbox/tmp/tmp.zcr0WsnGdt/Vampire---4.8_7890',ax24) ).
fof(f601,plain,
( ~ ssList(tl(sK50))
| spl51_5 ),
inference(avatar_component_clause,[],[f599]) ).
fof(f779,plain,
( ~ spl51_9
| spl51_2
| spl51_7 ),
inference(avatar_split_clause,[],[f778,f607,f585,f620]) ).
fof(f778,plain,
( nil = sK50
| ~ ssList(sK50)
| spl51_7 ),
inference(resolution,[],[f609,f428]) ).
fof(f428,plain,
! [X0] :
( ssItem(hd(X0))
| nil = X0
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f128]) ).
fof(f128,plain,
! [X0] :
( ssItem(hd(X0))
| nil = X0
| ~ ssList(X0) ),
inference(flattening,[],[f127]) ).
fof(f127,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.zcr0WsnGdt/Vampire---4.8_7890',ax22) ).
fof(f609,plain,
( ~ ssItem(hd(sK50))
| spl51_7 ),
inference(avatar_component_clause,[],[f607]) ).
fof(f777,plain,
( ~ spl51_9
| spl51_2
| ~ spl51_7
| ~ spl51_5
| spl51_4 ),
inference(avatar_split_clause,[],[f776,f595,f599,f607,f585,f620]) ).
fof(f595,plain,
( spl51_4
<=> sK49 = app(tl(sK50),cons(hd(sK50),nil)) ),
introduced(avatar_definition,[new_symbols(naming,[spl51_4])]) ).
fof(f776,plain,
( sK49 = app(tl(sK50),cons(hd(sK50),nil))
| ~ ssList(tl(sK50))
| ~ ssItem(hd(sK50))
| nil = sK50
| ~ ssList(sK50) ),
inference(equality_resolution,[],[f717]) ).
fof(f717,plain,
! [X0] :
( sK50 != X0
| sK49 = app(tl(X0),cons(hd(X0),nil))
| ~ ssList(tl(X0))
| ~ ssItem(hd(X0))
| nil = X0
| ~ ssList(X0) ),
inference(superposition,[],[f715,f505]) ).
fof(f505,plain,
! [X0] :
( cons(hd(X0),tl(X0)) = X0
| nil = X0
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f194]) ).
fof(f194,plain,
! [X0] :
( cons(hd(X0),tl(X0)) = X0
| nil = X0
| ~ ssList(X0) ),
inference(flattening,[],[f193]) ).
fof(f193,plain,
! [X0] :
( cons(hd(X0),tl(X0)) = X0
| nil = X0
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f78]) ).
fof(f78,axiom,
! [X0] :
( ssList(X0)
=> ( nil != X0
=> cons(hd(X0),tl(X0)) = X0 ) ),
file('/export/starexec/sandbox/tmp/tmp.zcr0WsnGdt/Vampire---4.8_7890',ax78) ).
fof(f715,plain,
! [X0,X1] :
( cons(X0,X1) != sK50
| sK49 = app(X1,cons(X0,nil))
| ~ ssList(X1)
| ~ ssItem(X0) ),
inference(duplicate_literal_removal,[],[f708]) ).
fof(f708,plain,
! [X0,X1] :
( cons(X0,X1) != sK50
| sK49 = app(X1,cons(X0,nil))
| ~ ssList(X1)
| ~ ssItem(X0)
| ~ ssItem(X0)
| ~ ssList(X1) ),
inference(superposition,[],[f535,f508]) ).
fof(f508,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.zcr0WsnGdt/Vampire---4.8_7890',ax81) ).
fof(f535,plain,
! [X4,X5] :
( app(cons(X4,nil),X5) != sK50
| app(X5,cons(X4,nil)) = sK49
| ~ ssList(X5)
| ~ ssItem(X4) ),
inference(cnf_transformation,[],[f336]) ).
fof(f336,plain,
( ( nil != sK50
| nil = sK49 )
& ! [X4] :
( ! [X5] :
( app(cons(X4,nil),X5) != sK50
| app(X5,cons(X4,nil)) = sK49
| ~ ssList(X5) )
| ~ ssItem(X4) )
& ! [X6] :
( ! [X7] :
( ! [X8] :
( ~ neq(nil,sK48)
| ! [X9] :
( ~ neq(nil,sK48)
| hd(sK48) != X9
| cons(X9,nil) != X8
| ~ ssItem(X9) )
| app(X7,X8) != X6
| tl(sK48) != X7
| ~ ssList(X8) )
| ~ ssList(X7) )
| sK47 != X6
| ~ ssList(X6) )
& 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])],[f223,f335,f334,f333,f332]) ).
fof(f332,plain,
( ? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( nil != X3
| nil = X2 )
& ! [X4] :
( ! [X5] :
( app(cons(X4,nil),X5) != X3
| app(X5,cons(X4,nil)) = X2
| ~ ssList(X5) )
| ~ ssItem(X4) )
& ! [X6] :
( ! [X7] :
( ! [X8] :
( ~ neq(nil,X1)
| ! [X9] :
( ~ neq(nil,X1)
| hd(X1) != X9
| cons(X9,nil) != X8
| ~ ssItem(X9) )
| app(X7,X8) != X6
| tl(X1) != X7
| ~ ssList(X8) )
| ~ ssList(X7) )
| X0 != X6
| ~ ssList(X6) )
& neq(X1,nil)
& X0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) )
=> ( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( nil != X3
| nil = X2 )
& ! [X4] :
( ! [X5] :
( app(cons(X4,nil),X5) != X3
| app(X5,cons(X4,nil)) = X2
| ~ ssList(X5) )
| ~ ssItem(X4) )
& ! [X6] :
( ! [X7] :
( ! [X8] :
( ~ neq(nil,X1)
| ! [X9] :
( ~ neq(nil,X1)
| hd(X1) != X9
| cons(X9,nil) != X8
| ~ ssItem(X9) )
| app(X7,X8) != X6
| tl(X1) != X7
| ~ ssList(X8) )
| ~ ssList(X7) )
| sK47 != X6
| ~ ssList(X6) )
& neq(X1,nil)
& sK47 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(sK47) ) ),
introduced(choice_axiom,[]) ).
fof(f333,plain,
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( nil != X3
| nil = X2 )
& ! [X4] :
( ! [X5] :
( app(cons(X4,nil),X5) != X3
| app(X5,cons(X4,nil)) = X2
| ~ ssList(X5) )
| ~ ssItem(X4) )
& ! [X6] :
( ! [X7] :
( ! [X8] :
( ~ neq(nil,X1)
| ! [X9] :
( ~ neq(nil,X1)
| hd(X1) != X9
| cons(X9,nil) != X8
| ~ ssItem(X9) )
| app(X7,X8) != X6
| tl(X1) != X7
| ~ ssList(X8) )
| ~ ssList(X7) )
| sK47 != X6
| ~ ssList(X6) )
& neq(X1,nil)
& sK47 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
=> ( ? [X2] :
( ? [X3] :
( ( nil != X3
| nil = X2 )
& ! [X4] :
( ! [X5] :
( app(cons(X4,nil),X5) != X3
| app(X5,cons(X4,nil)) = X2
| ~ ssList(X5) )
| ~ ssItem(X4) )
& ! [X6] :
( ! [X7] :
( ! [X8] :
( ~ neq(nil,sK48)
| ! [X9] :
( ~ neq(nil,sK48)
| hd(sK48) != X9
| cons(X9,nil) != X8
| ~ ssItem(X9) )
| app(X7,X8) != X6
| tl(sK48) != X7
| ~ ssList(X8) )
| ~ ssList(X7) )
| sK47 != X6
| ~ ssList(X6) )
& neq(sK48,nil)
& sK47 = X2
& sK48 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(sK48) ) ),
introduced(choice_axiom,[]) ).
fof(f334,plain,
( ? [X2] :
( ? [X3] :
( ( nil != X3
| nil = X2 )
& ! [X4] :
( ! [X5] :
( app(cons(X4,nil),X5) != X3
| app(X5,cons(X4,nil)) = X2
| ~ ssList(X5) )
| ~ ssItem(X4) )
& ! [X6] :
( ! [X7] :
( ! [X8] :
( ~ neq(nil,sK48)
| ! [X9] :
( ~ neq(nil,sK48)
| hd(sK48) != X9
| cons(X9,nil) != X8
| ~ ssItem(X9) )
| app(X7,X8) != X6
| tl(sK48) != X7
| ~ ssList(X8) )
| ~ ssList(X7) )
| sK47 != X6
| ~ ssList(X6) )
& neq(sK48,nil)
& sK47 = X2
& sK48 = X3
& ssList(X3) )
& ssList(X2) )
=> ( ? [X3] :
( ( nil != X3
| nil = sK49 )
& ! [X4] :
( ! [X5] :
( app(cons(X4,nil),X5) != X3
| app(X5,cons(X4,nil)) = sK49
| ~ ssList(X5) )
| ~ ssItem(X4) )
& ! [X6] :
( ! [X7] :
( ! [X8] :
( ~ neq(nil,sK48)
| ! [X9] :
( ~ neq(nil,sK48)
| hd(sK48) != X9
| cons(X9,nil) != X8
| ~ ssItem(X9) )
| app(X7,X8) != X6
| tl(sK48) != X7
| ~ ssList(X8) )
| ~ ssList(X7) )
| sK47 != X6
| ~ ssList(X6) )
& neq(sK48,nil)
& sK47 = sK49
& sK48 = X3
& ssList(X3) )
& ssList(sK49) ) ),
introduced(choice_axiom,[]) ).
fof(f335,plain,
( ? [X3] :
( ( nil != X3
| nil = sK49 )
& ! [X4] :
( ! [X5] :
( app(cons(X4,nil),X5) != X3
| app(X5,cons(X4,nil)) = sK49
| ~ ssList(X5) )
| ~ ssItem(X4) )
& ! [X6] :
( ! [X7] :
( ! [X8] :
( ~ neq(nil,sK48)
| ! [X9] :
( ~ neq(nil,sK48)
| hd(sK48) != X9
| cons(X9,nil) != X8
| ~ ssItem(X9) )
| app(X7,X8) != X6
| tl(sK48) != X7
| ~ ssList(X8) )
| ~ ssList(X7) )
| sK47 != X6
| ~ ssList(X6) )
& neq(sK48,nil)
& sK47 = sK49
& sK48 = X3
& ssList(X3) )
=> ( ( nil != sK50
| nil = sK49 )
& ! [X4] :
( ! [X5] :
( app(cons(X4,nil),X5) != sK50
| app(X5,cons(X4,nil)) = sK49
| ~ ssList(X5) )
| ~ ssItem(X4) )
& ! [X6] :
( ! [X7] :
( ! [X8] :
( ~ neq(nil,sK48)
| ! [X9] :
( ~ neq(nil,sK48)
| hd(sK48) != X9
| cons(X9,nil) != X8
| ~ ssItem(X9) )
| app(X7,X8) != X6
| tl(sK48) != X7
| ~ ssList(X8) )
| ~ ssList(X7) )
| sK47 != X6
| ~ ssList(X6) )
& neq(sK48,nil)
& sK47 = sK49
& sK48 = sK50
& ssList(sK50) ) ),
introduced(choice_axiom,[]) ).
fof(f223,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( nil != X3
| nil = X2 )
& ! [X4] :
( ! [X5] :
( app(cons(X4,nil),X5) != X3
| app(X5,cons(X4,nil)) = X2
| ~ ssList(X5) )
| ~ ssItem(X4) )
& ! [X6] :
( ! [X7] :
( ! [X8] :
( ~ neq(nil,X1)
| ! [X9] :
( ~ neq(nil,X1)
| hd(X1) != X9
| cons(X9,nil) != X8
| ~ ssItem(X9) )
| app(X7,X8) != X6
| tl(X1) != X7
| ~ ssList(X8) )
| ~ ssList(X7) )
| X0 != X6
| ~ ssList(X6) )
& 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] :
( ( nil != X3
| nil = X2 )
& ! [X4] :
( ! [X5] :
( app(cons(X4,nil),X5) != X3
| app(X5,cons(X4,nil)) = X2
| ~ ssList(X5) )
| ~ ssItem(X4) )
& ! [X6] :
( ! [X7] :
( ! [X8] :
( ~ neq(nil,X1)
| ! [X9] :
( ~ neq(nil,X1)
| hd(X1) != X9
| cons(X9,nil) != X8
| ~ ssItem(X9) )
| app(X7,X8) != X6
| tl(X1) != X7
| ~ ssList(X8) )
| ~ ssList(X7) )
| X0 != 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)
=> ( ( nil = X3
& nil != X2 )
| ? [X4] :
( ? [X5] :
( app(cons(X4,nil),X5) = X3
& app(X5,cons(X4,nil)) != X2
& ssList(X5) )
& ssItem(X4) )
| ? [X6] :
( ? [X7] :
( ? [X8] :
( neq(nil,X1)
& ? [X9] :
( neq(nil,X1)
& hd(X1) = X9
& cons(X9,nil) = X8
& ssItem(X9) )
& app(X7,X8) = X6
& tl(X1) = X7
& ssList(X8) )
& ssList(X7) )
& X0 = 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)
=> ( ( nil = X3
& nil != X2 )
| ? [X8] :
( ? [X9] :
( app(cons(X8,nil),X9) = X3
& app(X9,cons(X8,nil)) != X2
& ssList(X9) )
& ssItem(X8) )
| ? [X4] :
( ? [X5] :
( ? [X6] :
( neq(nil,X1)
& ? [X7] :
( neq(nil,X1)
& hd(X1) = X7
& cons(X7,nil) = X6
& ssItem(X7) )
& app(X5,X6) = X4
& tl(X1) = X5
& ssList(X6) )
& ssList(X5) )
& X0 = 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)
=> ( ( nil = X3
& nil != X2 )
| ? [X8] :
( ? [X9] :
( app(cons(X8,nil),X9) = X3
& app(X9,cons(X8,nil)) != X2
& ssList(X9) )
& ssItem(X8) )
| ? [X4] :
( ? [X5] :
( ? [X6] :
( neq(nil,X1)
& ? [X7] :
( neq(nil,X1)
& hd(X1) = X7
& cons(X7,nil) = X6
& ssItem(X7) )
& app(X5,X6) = X4
& tl(X1) = X5
& ssList(X6) )
& ssList(X5) )
& X0 = X4
& ssList(X4) )
| ~ neq(X1,nil)
| X0 != X2
| X1 != X3 ) ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.zcr0WsnGdt/Vampire---4.8_7890',co1) ).
fof(f741,plain,
( ~ spl51_10
| ~ spl51_2 ),
inference(avatar_split_clause,[],[f740,f585,f624]) ).
fof(f740,plain,
( ~ ssList(nil)
| ~ spl51_2 ),
inference(resolution,[],[f736,f577]) ).
fof(f577,plain,
! [X1] :
( ~ neq(X1,X1)
| ~ ssList(X1) ),
inference(duplicate_literal_removal,[],[f555]) ).
fof(f555,plain,
! [X1] :
( ~ neq(X1,X1)
| ~ ssList(X1)
| ~ ssList(X1) ),
inference(equality_resolution,[],[f417]) ).
fof(f417,plain,
! [X0,X1] :
( X0 != X1
| ~ neq(X0,X1)
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f305]) ).
fof(f736,plain,
( neq(nil,nil)
| ~ spl51_2 ),
inference(superposition,[],[f538,f586]) ).
fof(f586,plain,
( nil = sK50
| ~ spl51_2 ),
inference(avatar_component_clause,[],[f585]) ).
fof(f538,plain,
neq(sK50,nil),
inference(definition_unfolding,[],[f533,f531]) ).
fof(f531,plain,
sK48 = sK50,
inference(cnf_transformation,[],[f336]) ).
fof(f533,plain,
neq(sK48,nil),
inference(cnf_transformation,[],[f336]) ).
fof(f638,plain,
spl51_10,
inference(avatar_contradiction_clause,[],[f637]) ).
fof(f637,plain,
( $false
| spl51_10 ),
inference(resolution,[],[f626,f420]) ).
fof(f420,plain,
ssList(nil),
inference(cnf_transformation,[],[f17]) ).
fof(f17,axiom,
ssList(nil),
file('/export/starexec/sandbox/tmp/tmp.zcr0WsnGdt/Vampire---4.8_7890',ax17) ).
fof(f626,plain,
( ~ ssList(nil)
| spl51_10 ),
inference(avatar_component_clause,[],[f624]) ).
fof(f636,plain,
spl51_9,
inference(avatar_contradiction_clause,[],[f635]) ).
fof(f635,plain,
( $false
| spl51_9 ),
inference(resolution,[],[f622,f530]) ).
fof(f530,plain,
ssList(sK50),
inference(cnf_transformation,[],[f336]) ).
fof(f622,plain,
( ~ ssList(sK50)
| spl51_9 ),
inference(avatar_component_clause,[],[f620]) ).
fof(f616,plain,
spl51_3,
inference(avatar_split_clause,[],[f540,f591]) ).
fof(f591,plain,
( spl51_3
<=> ssList(sK49) ),
introduced(avatar_definition,[new_symbols(naming,[spl51_3])]) ).
fof(f540,plain,
ssList(sK49),
inference(definition_unfolding,[],[f527,f532]) ).
fof(f532,plain,
sK47 = sK49,
inference(cnf_transformation,[],[f336]) ).
fof(f527,plain,
ssList(sK47),
inference(cnf_transformation,[],[f336]) ).
fof(f614,plain,
( ~ spl51_3
| ~ spl51_4
| ~ spl51_5
| ~ spl51_6
| ~ spl51_7
| ~ spl51_8 ),
inference(avatar_split_clause,[],[f589,f611,f607,f603,f599,f595,f591]) ).
fof(f589,plain,
( ~ neq(nil,sK50)
| ~ ssItem(hd(sK50))
| ~ ssList(cons(hd(sK50),nil))
| ~ ssList(tl(sK50))
| sK49 != app(tl(sK50),cons(hd(sK50),nil))
| ~ ssList(sK49) ),
inference(inner_rewriting,[],[f572]) ).
fof(f572,plain,
( ~ neq(nil,sK50)
| ~ ssItem(hd(sK50))
| ~ ssList(cons(hd(sK50),nil))
| ~ ssList(tl(sK50))
| sK49 != app(tl(sK50),cons(hd(sK50),nil))
| ~ ssList(app(tl(sK50),cons(hd(sK50),nil))) ),
inference(duplicate_literal_removal,[],[f571]) ).
fof(f571,plain,
( ~ neq(nil,sK50)
| ~ neq(nil,sK50)
| ~ ssItem(hd(sK50))
| ~ ssList(cons(hd(sK50),nil))
| ~ ssList(tl(sK50))
| sK49 != app(tl(sK50),cons(hd(sK50),nil))
| ~ ssList(app(tl(sK50),cons(hd(sK50),nil))) ),
inference(equality_resolution,[],[f570]) ).
fof(f570,plain,
! [X7] :
( ~ neq(nil,sK50)
| ~ neq(nil,sK50)
| ~ ssItem(hd(sK50))
| tl(sK50) != X7
| ~ ssList(cons(hd(sK50),nil))
| ~ ssList(X7)
| sK49 != app(X7,cons(hd(sK50),nil))
| ~ ssList(app(X7,cons(hd(sK50),nil))) ),
inference(equality_resolution,[],[f569]) ).
fof(f569,plain,
! [X6,X7] :
( ~ neq(nil,sK50)
| ~ neq(nil,sK50)
| ~ ssItem(hd(sK50))
| app(X7,cons(hd(sK50),nil)) != X6
| tl(sK50) != X7
| ~ ssList(cons(hd(sK50),nil))
| ~ ssList(X7)
| sK49 != X6
| ~ ssList(X6) ),
inference(equality_resolution,[],[f568]) ).
fof(f568,plain,
! [X8,X6,X7] :
( ~ neq(nil,sK50)
| ~ neq(nil,sK50)
| cons(hd(sK50),nil) != X8
| ~ ssItem(hd(sK50))
| app(X7,X8) != X6
| tl(sK50) != X7
| ~ ssList(X8)
| ~ ssList(X7)
| sK49 != X6
| ~ ssList(X6) ),
inference(equality_resolution,[],[f537]) ).
fof(f537,plain,
! [X8,X6,X9,X7] :
( ~ neq(nil,sK50)
| ~ neq(nil,sK50)
| hd(sK50) != X9
| cons(X9,nil) != X8
| ~ ssItem(X9)
| app(X7,X8) != X6
| tl(sK50) != X7
| ~ ssList(X8)
| ~ ssList(X7)
| sK49 != X6
| ~ ssList(X6) ),
inference(definition_unfolding,[],[f534,f531,f531,f531,f531,f532]) ).
fof(f534,plain,
! [X8,X6,X9,X7] :
( ~ neq(nil,sK48)
| ~ neq(nil,sK48)
| hd(sK48) != X9
| cons(X9,nil) != X8
| ~ ssItem(X9)
| app(X7,X8) != X6
| tl(sK48) != X7
| ~ ssList(X8)
| ~ ssList(X7)
| sK47 != X6
| ~ ssList(X6) ),
inference(cnf_transformation,[],[f336]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.13/0.14 % Problem : SWC308+1 : TPTP v8.1.2. Released v2.4.0.
% 0.13/0.16 % 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.37 % Computer : n009.cluster.edu
% 0.15/0.37 % Model : x86_64 x86_64
% 0.15/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.37 % Memory : 8042.1875MB
% 0.15/0.37 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.37 % CPULimit : 300
% 0.15/0.37 % WCLimit : 300
% 0.15/0.37 % DateTime : Fri May 3 20:29:08 EDT 2024
% 0.15/0.37 % CPUTime :
% 0.15/0.37 This is a FOF_THM_RFO_SEQ problem
% 0.15/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.zcr0WsnGdt/Vampire---4.8_7890
% 0.61/0.76 % (8287)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.61/0.76 % (8279)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.61/0.76 % (8282)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.61/0.76 % (8280)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.61/0.76 % (8284)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.61/0.76 % (8285)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.61/0.76 % (8283)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.61/0.76 % (8286)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.61/0.77 % (8280)First to succeed.
% 0.61/0.78 % (8287)Instruction limit reached!
% 0.61/0.78 % (8287)------------------------------
% 0.61/0.78 % (8287)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.61/0.78 % (8287)Termination reason: Unknown
% 0.61/0.78 % (8287)Termination phase: Saturation
% 0.61/0.78
% 0.61/0.78 % (8287)Memory used [KB]: 1667
% 0.61/0.78 % (8287)Time elapsed: 0.018 s
% 0.61/0.78 % (8287)Instructions burned: 57 (million)
% 0.61/0.78 % (8287)------------------------------
% 0.61/0.78 % (8287)------------------------------
% 0.61/0.78 % (8280)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-8140"
% 0.61/0.78 % (8280)Refutation found. Thanks to Tanya!
% 0.61/0.78 % SZS status Theorem for Vampire---4
% 0.61/0.78 % SZS output start Proof for Vampire---4
% See solution above
% 0.61/0.78 % (8280)------------------------------
% 0.61/0.78 % (8280)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.61/0.78 % (8280)Termination reason: Refutation
% 0.61/0.78
% 0.61/0.78 % (8280)Memory used [KB]: 1479
% 0.61/0.78 % (8280)Time elapsed: 0.017 s
% 0.61/0.78 % (8280)Instructions burned: 27 (million)
% 0.61/0.78 % (8140)Success in time 0.389 s
% 0.61/0.78 % Vampire---4.8 exiting
%------------------------------------------------------------------------------