TSTP Solution File: SWC014+1 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SWC014+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 : n029.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:47:59 EDT 2024
% Result : Theorem 0.59s 0.77s
% Output : Refutation 0.59s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 26
% Syntax : Number of formulae : 100 ( 11 unt; 0 def)
% Number of atoms : 513 ( 158 equ)
% Maximal formula atoms : 38 ( 5 avg)
% Number of connectives : 644 ( 231 ~; 216 |; 149 &)
% ( 16 <=>; 32 =>; 0 <=; 0 <~>)
% Maximal formula depth : 20 ( 5 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 19 ( 17 usr; 15 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 7 con; 0-2 aty)
% Number of variables : 130 ( 76 !; 54 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f978,plain,
$false,
inference(avatar_sat_refutation,[],[f604,f609,f614,f619,f637,f644,f646,f696,f725,f754,f761,f897,f917,f945,f974]) ).
fof(f974,plain,
( ~ spl53_1
| ~ spl53_3
| spl53_7
| ~ spl53_37 ),
inference(avatar_contradiction_clause,[],[f973]) ).
fof(f973,plain,
( $false
| ~ spl53_1
| ~ spl53_3
| spl53_7
| ~ spl53_37 ),
inference(trivial_inequality_removal,[],[f971]) ).
fof(f971,plain,
( sK50 != sK50
| ~ spl53_1
| ~ spl53_3
| spl53_7
| ~ spl53_37 ),
inference(superposition,[],[f962,f647]) ).
fof(f647,plain,
( sK50 = app(sK49,sK52)
| ~ spl53_1
| ~ spl53_3 ),
inference(forward_demodulation,[],[f599,f608]) ).
fof(f608,plain,
( sK49 = cons(sK51,nil)
| ~ spl53_3 ),
inference(avatar_component_clause,[],[f606]) ).
fof(f606,plain,
( spl53_3
<=> sK49 = cons(sK51,nil) ),
introduced(avatar_definition,[new_symbols(naming,[spl53_3])]) ).
fof(f599,plain,
( sK50 = app(cons(sK51,nil),sK52)
| ~ spl53_1 ),
inference(avatar_component_clause,[],[f597]) ).
fof(f597,plain,
( spl53_1
<=> sK50 = app(cons(sK51,nil),sK52) ),
introduced(avatar_definition,[new_symbols(naming,[spl53_1])]) ).
fof(f962,plain,
( sK50 != app(sK49,sK52)
| spl53_7
| ~ spl53_37 ),
inference(superposition,[],[f628,f944]) ).
fof(f944,plain,
( sK52 = tl(sK50)
| ~ spl53_37 ),
inference(avatar_component_clause,[],[f942]) ).
fof(f942,plain,
( spl53_37
<=> sK52 = tl(sK50) ),
introduced(avatar_definition,[new_symbols(naming,[spl53_37])]) ).
fof(f628,plain,
( sK50 != app(sK49,tl(sK50))
| spl53_7 ),
inference(avatar_component_clause,[],[f626]) ).
fof(f626,plain,
( spl53_7
<=> sK50 = app(sK49,tl(sK50)) ),
introduced(avatar_definition,[new_symbols(naming,[spl53_7])]) ).
fof(f945,plain,
( ~ spl53_4
| ~ spl53_5
| spl53_37
| ~ spl53_32 ),
inference(avatar_split_clause,[],[f935,f913,f942,f616,f611]) ).
fof(f611,plain,
( spl53_4
<=> ssList(sK52) ),
introduced(avatar_definition,[new_symbols(naming,[spl53_4])]) ).
fof(f616,plain,
( spl53_5
<=> ssItem(sK51) ),
introduced(avatar_definition,[new_symbols(naming,[spl53_5])]) ).
fof(f913,plain,
( spl53_32
<=> sK50 = cons(sK51,sK52) ),
introduced(avatar_definition,[new_symbols(naming,[spl53_32])]) ).
fof(f935,plain,
( sK52 = tl(sK50)
| ~ ssItem(sK51)
| ~ ssList(sK52)
| ~ spl53_32 ),
inference(superposition,[],[f433,f915]) ).
fof(f915,plain,
( sK50 = cons(sK51,sK52)
| ~ spl53_32 ),
inference(avatar_component_clause,[],[f913]) ).
fof(f433,plain,
! [X0,X1] :
( tl(cons(X1,X0)) = X0
| ~ ssItem(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f132]) ).
fof(f132,plain,
! [X0] :
( ! [X1] :
( tl(cons(X1,X0)) = X0
| ~ ssItem(X1) )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f25]) ).
fof(f25,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssItem(X1)
=> tl(cons(X1,X0)) = X0 ) ),
file('/export/starexec/sandbox/tmp/tmp.3DvrSSq98l/Vampire---4.8_12864',ax25) ).
fof(f917,plain,
( ~ spl53_4
| spl53_32
| ~ spl53_1
| ~ spl53_3
| ~ spl53_31 ),
inference(avatar_split_clause,[],[f903,f895,f606,f597,f913,f611]) ).
fof(f895,plain,
( spl53_31
<=> ! [X0] :
( cons(sK51,X0) = app(sK49,X0)
| ~ ssList(X0) ) ),
introduced(avatar_definition,[new_symbols(naming,[spl53_31])]) ).
fof(f903,plain,
( sK50 = cons(sK51,sK52)
| ~ ssList(sK52)
| ~ spl53_1
| ~ spl53_3
| ~ spl53_31 ),
inference(superposition,[],[f647,f896]) ).
fof(f896,plain,
( ! [X0] :
( cons(sK51,X0) = app(sK49,X0)
| ~ ssList(X0) )
| ~ spl53_31 ),
inference(avatar_component_clause,[],[f895]) ).
fof(f897,plain,
( ~ spl53_5
| spl53_31
| ~ spl53_3 ),
inference(avatar_split_clause,[],[f886,f606,f895,f616]) ).
fof(f886,plain,
( ! [X0] :
( cons(sK51,X0) = app(sK49,X0)
| ~ ssItem(sK51)
| ~ ssList(X0) )
| ~ spl53_3 ),
inference(superposition,[],[f510,f608]) ).
fof(f510,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.3DvrSSq98l/Vampire---4.8_12864',ax81) ).
fof(f761,plain,
( ~ spl53_18
| ~ spl53_6
| spl53_17
| spl53_9 ),
inference(avatar_split_clause,[],[f758,f634,f693,f622,f716]) ).
fof(f716,plain,
( spl53_18
<=> ssList(nil) ),
introduced(avatar_definition,[new_symbols(naming,[spl53_18])]) ).
fof(f622,plain,
( spl53_6
<=> ssList(sK50) ),
introduced(avatar_definition,[new_symbols(naming,[spl53_6])]) ).
fof(f693,plain,
( spl53_17
<=> nil = sK50 ),
introduced(avatar_definition,[new_symbols(naming,[spl53_17])]) ).
fof(f634,plain,
( spl53_9
<=> neq(nil,sK50) ),
introduced(avatar_definition,[new_symbols(naming,[spl53_9])]) ).
fof(f758,plain,
( nil = sK50
| ~ ssList(sK50)
| ~ ssList(nil)
| spl53_9 ),
inference(resolution,[],[f420,f636]) ).
fof(f636,plain,
( ~ neq(nil,sK50)
| spl53_9 ),
inference(avatar_component_clause,[],[f634]) ).
fof(f420,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.3DvrSSq98l/Vampire---4.8_12864',ax15) ).
fof(f754,plain,
( ~ spl53_18
| ~ spl53_2
| ~ spl53_17 ),
inference(avatar_split_clause,[],[f752,f693,f601,f716]) ).
fof(f601,plain,
( spl53_2
<=> neq(sK50,nil) ),
introduced(avatar_definition,[new_symbols(naming,[spl53_2])]) ).
fof(f752,plain,
( ~ ssList(nil)
| ~ spl53_2
| ~ spl53_17 ),
inference(resolution,[],[f749,f593]) ).
fof(f593,plain,
! [X1] :
( ~ neq(X1,X1)
| ~ ssList(X1) ),
inference(duplicate_literal_removal,[],[f571]) ).
fof(f571,plain,
! [X1] :
( ~ neq(X1,X1)
| ~ ssList(X1)
| ~ ssList(X1) ),
inference(equality_resolution,[],[f419]) ).
fof(f419,plain,
! [X0,X1] :
( X0 != X1
| ~ neq(X0,X1)
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f305]) ).
fof(f749,plain,
( neq(nil,nil)
| ~ spl53_2
| ~ spl53_17 ),
inference(superposition,[],[f602,f695]) ).
fof(f695,plain,
( nil = sK50
| ~ spl53_17 ),
inference(avatar_component_clause,[],[f693]) ).
fof(f602,plain,
( neq(sK50,nil)
| ~ spl53_2 ),
inference(avatar_component_clause,[],[f601]) ).
fof(f725,plain,
spl53_18,
inference(avatar_contradiction_clause,[],[f724]) ).
fof(f724,plain,
( $false
| spl53_18 ),
inference(resolution,[],[f718,f422]) ).
fof(f422,plain,
ssList(nil),
inference(cnf_transformation,[],[f17]) ).
fof(f17,axiom,
ssList(nil),
file('/export/starexec/sandbox/tmp/tmp.3DvrSSq98l/Vampire---4.8_12864',ax17) ).
fof(f718,plain,
( ~ ssList(nil)
| spl53_18 ),
inference(avatar_component_clause,[],[f716]) ).
fof(f696,plain,
( ~ spl53_6
| spl53_17
| spl53_8 ),
inference(avatar_split_clause,[],[f691,f630,f693,f622]) ).
fof(f630,plain,
( spl53_8
<=> ssList(tl(sK50)) ),
introduced(avatar_definition,[new_symbols(naming,[spl53_8])]) ).
fof(f691,plain,
( nil = sK50
| ~ ssList(sK50)
| spl53_8 ),
inference(resolution,[],[f432,f632]) ).
fof(f632,plain,
( ~ ssList(tl(sK50))
| spl53_8 ),
inference(avatar_component_clause,[],[f630]) ).
fof(f432,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.3DvrSSq98l/Vampire---4.8_12864',ax24) ).
fof(f646,plain,
spl53_6,
inference(avatar_split_clause,[],[f555,f622]) ).
fof(f555,plain,
ssList(sK50),
inference(definition_unfolding,[],[f530,f533]) ).
fof(f533,plain,
sK48 = sK50,
inference(cnf_transformation,[],[f338]) ).
fof(f338,plain,
( ( ( ~ neq(sK50,nil)
& neq(sK48,nil) )
| ( sK50 = app(cons(sK51,nil),sK52)
& sK49 = cons(sK51,nil)
& ssList(sK52)
& ssItem(sK51)
& ! [X6] :
( ! [X7] :
( ~ neq(nil,sK48)
| app(sK47,X7) != X6
| tl(sK48) != X7
| ~ ssList(X7) )
| sK48 != 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,sK51,sK52])],[f223,f337,f336,f335,f334,f333,f332]) ).
fof(f332,plain,
( ? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ( ~ neq(X3,nil)
& neq(X1,nil) )
| ( ? [X4] :
( ? [X5] :
( app(cons(X4,nil),X5) = X3
& cons(X4,nil) = X2
& ssList(X5) )
& ssItem(X4) )
& ! [X6] :
( ! [X7] :
( ~ neq(nil,X1)
| app(X0,X7) != X6
| tl(X1) != X7
| ~ ssList(X7) )
| X1 != 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] :
( app(cons(X4,nil),X5) = X3
& cons(X4,nil) = X2
& ssList(X5) )
& ssItem(X4) )
& ! [X6] :
( ! [X7] :
( ~ neq(nil,X1)
| app(sK47,X7) != X6
| tl(X1) != X7
| ~ ssList(X7) )
| X1 != 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] :
( ( ( ~ neq(X3,nil)
& neq(X1,nil) )
| ( ? [X4] :
( ? [X5] :
( app(cons(X4,nil),X5) = X3
& cons(X4,nil) = X2
& ssList(X5) )
& ssItem(X4) )
& ! [X6] :
( ! [X7] :
( ~ neq(nil,X1)
| app(sK47,X7) != X6
| tl(X1) != X7
| ~ ssList(X7) )
| X1 != X6
| ~ ssList(X6) )
& neq(X1,nil) ) )
& sK47 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
=> ( ? [X2] :
( ? [X3] :
( ( ( ~ neq(X3,nil)
& neq(sK48,nil) )
| ( ? [X4] :
( ? [X5] :
( app(cons(X4,nil),X5) = X3
& cons(X4,nil) = X2
& ssList(X5) )
& ssItem(X4) )
& ! [X6] :
( ! [X7] :
( ~ neq(nil,sK48)
| app(sK47,X7) != X6
| tl(sK48) != X7
| ~ ssList(X7) )
| sK48 != X6
| ~ ssList(X6) )
& 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] :
( app(cons(X4,nil),X5) = X3
& cons(X4,nil) = X2
& ssList(X5) )
& ssItem(X4) )
& ! [X6] :
( ! [X7] :
( ~ neq(nil,sK48)
| app(sK47,X7) != X6
| tl(sK48) != X7
| ~ ssList(X7) )
| sK48 != X6
| ~ ssList(X6) )
& neq(sK48,nil) ) )
& sK47 = X2
& sK48 = X3
& ssList(X3) )
& ssList(X2) )
=> ( ? [X3] :
( ( ( ~ neq(X3,nil)
& neq(sK48,nil) )
| ( ? [X4] :
( ? [X5] :
( app(cons(X4,nil),X5) = X3
& cons(X4,nil) = sK49
& ssList(X5) )
& ssItem(X4) )
& ! [X6] :
( ! [X7] :
( ~ neq(nil,sK48)
| app(sK47,X7) != X6
| tl(sK48) != X7
| ~ ssList(X7) )
| sK48 != X6
| ~ ssList(X6) )
& 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] :
( app(cons(X4,nil),X5) = X3
& cons(X4,nil) = sK49
& ssList(X5) )
& ssItem(X4) )
& ! [X6] :
( ! [X7] :
( ~ neq(nil,sK48)
| app(sK47,X7) != X6
| tl(sK48) != X7
| ~ ssList(X7) )
| sK48 != X6
| ~ ssList(X6) )
& neq(sK48,nil) ) )
& sK47 = sK49
& sK48 = X3
& ssList(X3) )
=> ( ( ( ~ neq(sK50,nil)
& neq(sK48,nil) )
| ( ? [X4] :
( ? [X5] :
( app(cons(X4,nil),X5) = sK50
& cons(X4,nil) = sK49
& ssList(X5) )
& ssItem(X4) )
& ! [X6] :
( ! [X7] :
( ~ neq(nil,sK48)
| app(sK47,X7) != X6
| tl(sK48) != X7
| ~ ssList(X7) )
| sK48 != X6
| ~ ssList(X6) )
& neq(sK48,nil) ) )
& sK47 = sK49
& sK48 = sK50
& ssList(sK50) ) ),
introduced(choice_axiom,[]) ).
fof(f336,plain,
( ? [X4] :
( ? [X5] :
( app(cons(X4,nil),X5) = sK50
& cons(X4,nil) = sK49
& ssList(X5) )
& ssItem(X4) )
=> ( ? [X5] :
( sK50 = app(cons(sK51,nil),X5)
& sK49 = cons(sK51,nil)
& ssList(X5) )
& ssItem(sK51) ) ),
introduced(choice_axiom,[]) ).
fof(f337,plain,
( ? [X5] :
( sK50 = app(cons(sK51,nil),X5)
& sK49 = cons(sK51,nil)
& ssList(X5) )
=> ( sK50 = app(cons(sK51,nil),sK52)
& sK49 = cons(sK51,nil)
& ssList(sK52) ) ),
introduced(choice_axiom,[]) ).
fof(f223,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ( ~ neq(X3,nil)
& neq(X1,nil) )
| ( ? [X4] :
( ? [X5] :
( app(cons(X4,nil),X5) = X3
& cons(X4,nil) = X2
& ssList(X5) )
& ssItem(X4) )
& ! [X6] :
( ! [X7] :
( ~ neq(nil,X1)
| app(X0,X7) != X6
| tl(X1) != X7
| ~ ssList(X7) )
| X1 != 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] :
( ( ( ~ neq(X3,nil)
& neq(X1,nil) )
| ( ? [X4] :
( ? [X5] :
( app(cons(X4,nil),X5) = X3
& cons(X4,nil) = X2
& ssList(X5) )
& ssItem(X4) )
& ! [X6] :
( ! [X7] :
( ~ neq(nil,X1)
| app(X0,X7) != X6
| tl(X1) != X7
| ~ ssList(X7) )
| X1 != 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] :
( ssItem(X4)
=> ! [X5] :
( ssList(X5)
=> ( app(cons(X4,nil),X5) != X3
| cons(X4,nil) != X2 ) ) )
| ? [X6] :
( ? [X7] :
( neq(nil,X1)
& app(X0,X7) = X6
& tl(X1) = X7
& ssList(X7) )
& X1 = 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] :
( ssItem(X6)
=> ! [X7] :
( ssList(X7)
=> ( app(cons(X6,nil),X7) != X3
| cons(X6,nil) != X2 ) ) )
| ? [X4] :
( ? [X5] :
( neq(nil,X1)
& app(X0,X5) = X4
& tl(X1) = X5
& ssList(X5) )
& X1 = 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] :
( ssItem(X6)
=> ! [X7] :
( ssList(X7)
=> ( app(cons(X6,nil),X7) != X3
| cons(X6,nil) != X2 ) ) )
| ? [X4] :
( ? [X5] :
( neq(nil,X1)
& app(X0,X5) = X4
& tl(X1) = X5
& ssList(X5) )
& X1 = X4
& ssList(X4) )
| ~ neq(X1,nil) ) )
| X0 != X2
| X1 != X3 ) ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.3DvrSSq98l/Vampire---4.8_12864',co1) ).
fof(f530,plain,
ssList(sK48),
inference(cnf_transformation,[],[f338]) ).
fof(f644,plain,
spl53_2,
inference(avatar_split_clause,[],[f588,f601]) ).
fof(f588,plain,
neq(sK50,nil),
inference(duplicate_literal_removal,[],[f554]) ).
fof(f554,plain,
( neq(sK50,nil)
| neq(sK50,nil) ),
inference(definition_unfolding,[],[f535,f533,f533]) ).
fof(f535,plain,
( neq(sK48,nil)
| neq(sK48,nil) ),
inference(cnf_transformation,[],[f338]) ).
fof(f637,plain,
( ~ spl53_6
| ~ spl53_7
| ~ spl53_8
| ~ spl53_9
| ~ spl53_2 ),
inference(avatar_split_clause,[],[f620,f601,f634,f630,f626,f622]) ).
fof(f620,plain,
( ~ neq(sK50,nil)
| ~ neq(nil,sK50)
| ~ ssList(tl(sK50))
| sK50 != app(sK49,tl(sK50))
| ~ ssList(sK50) ),
inference(inner_rewriting,[],[f585]) ).
fof(f585,plain,
( ~ neq(sK50,nil)
| ~ neq(nil,sK50)
| ~ ssList(tl(sK50))
| sK50 != app(sK49,tl(sK50))
| ~ ssList(app(sK49,tl(sK50))) ),
inference(equality_resolution,[],[f584]) ).
fof(f584,plain,
! [X7] :
( ~ neq(sK50,nil)
| ~ neq(nil,sK50)
| tl(sK50) != X7
| ~ ssList(X7)
| sK50 != app(sK49,X7)
| ~ ssList(app(sK49,X7)) ),
inference(equality_resolution,[],[f547]) ).
fof(f547,plain,
! [X6,X7] :
( ~ neq(sK50,nil)
| ~ neq(nil,sK50)
| app(sK49,X7) != X6
| tl(sK50) != X7
| ~ ssList(X7)
| sK50 != X6
| ~ ssList(X6) ),
inference(definition_unfolding,[],[f542,f533,f534,f533,f533]) ).
fof(f534,plain,
sK47 = sK49,
inference(cnf_transformation,[],[f338]) ).
fof(f542,plain,
! [X6,X7] :
( ~ neq(sK50,nil)
| ~ neq(nil,sK48)
| app(sK47,X7) != X6
| tl(sK48) != X7
| ~ ssList(X7)
| sK48 != X6
| ~ ssList(X6) ),
inference(cnf_transformation,[],[f338]) ).
fof(f619,plain,
( spl53_5
| ~ spl53_2 ),
inference(avatar_split_clause,[],[f543,f601,f616]) ).
fof(f543,plain,
( ~ neq(sK50,nil)
| ssItem(sK51) ),
inference(cnf_transformation,[],[f338]) ).
fof(f614,plain,
( spl53_4
| ~ spl53_2 ),
inference(avatar_split_clause,[],[f544,f601,f611]) ).
fof(f544,plain,
( ~ neq(sK50,nil)
| ssList(sK52) ),
inference(cnf_transformation,[],[f338]) ).
fof(f609,plain,
( spl53_3
| ~ spl53_2 ),
inference(avatar_split_clause,[],[f545,f601,f606]) ).
fof(f545,plain,
( ~ neq(sK50,nil)
| sK49 = cons(sK51,nil) ),
inference(cnf_transformation,[],[f338]) ).
fof(f604,plain,
( spl53_1
| ~ spl53_2 ),
inference(avatar_split_clause,[],[f546,f601,f597]) ).
fof(f546,plain,
( ~ neq(sK50,nil)
| sK50 = app(cons(sK51,nil),sK52) ),
inference(cnf_transformation,[],[f338]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : SWC014+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.15/0.36 % Computer : n029.cluster.edu
% 0.15/0.36 % Model : x86_64 x86_64
% 0.15/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.36 % Memory : 8042.1875MB
% 0.15/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.36 % CPULimit : 300
% 0.15/0.36 % WCLimit : 300
% 0.15/0.36 % DateTime : Fri May 3 20:35:23 EDT 2024
% 0.15/0.36 % CPUTime :
% 0.15/0.36 This is a FOF_THM_RFO_SEQ problem
% 0.15/0.36 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.3DvrSSq98l/Vampire---4.8_12864
% 0.53/0.75 % (12979)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.53/0.75 % (12972)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.53/0.75 % (12974)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.53/0.75 % (12976)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.53/0.75 % (12973)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.53/0.75 % (12977)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.53/0.75 % (12975)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.53/0.75 % (12978)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.53/0.75 % (12979)Refutation not found, incomplete strategy% (12979)------------------------------
% 0.53/0.75 % (12979)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.53/0.75 % (12979)Termination reason: Refutation not found, incomplete strategy
% 0.53/0.75
% 0.53/0.75 % (12979)Memory used [KB]: 1151
% 0.53/0.75 % (12979)Time elapsed: 0.003 s
% 0.53/0.75 % (12979)Instructions burned: 5 (million)
% 0.53/0.75 % (12979)------------------------------
% 0.53/0.75 % (12979)------------------------------
% 0.59/0.76 % (12977)Refutation not found, incomplete strategy% (12977)------------------------------
% 0.59/0.76 % (12977)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.59/0.76 % (12977)Termination reason: Refutation not found, incomplete strategy
% 0.59/0.76
% 0.59/0.76 % (12977)Memory used [KB]: 1146
% 0.59/0.76 % (12977)Time elapsed: 0.004 s
% 0.59/0.76 % (12977)Instructions burned: 5 (million)
% 0.59/0.76 % (12980)lrs+21_1:16_sil=2000:sp=occurrence:urr=on:flr=on:i=55:sd=1:nm=0:ins=3:ss=included:rawr=on:br=off_0 on Vampire---4 for (2996ds/55Mi)
% 0.59/0.76 % (12977)------------------------------
% 0.59/0.76 % (12977)------------------------------
% 0.59/0.76 % (12981)dis+3_25:4_sil=16000:sos=all:erd=off:i=50:s2at=4.0:bd=off:nm=60:sup=off:cond=on:av=off:ins=2:nwc=10.0:etr=on:to=lpo:s2agt=20:fd=off:bsr=unit_only:slsq=on:slsqr=28,19:awrs=converge:awrsf=500:tgt=ground:bs=unit_only_0 on Vampire---4 for (2996ds/50Mi)
% 0.59/0.77 % (12973)First to succeed.
% 0.59/0.77 % (12973)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-12971"
% 0.59/0.77 % (12975)Instruction limit reached!
% 0.59/0.77 % (12975)------------------------------
% 0.59/0.77 % (12975)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.59/0.77 % (12976)Instruction limit reached!
% 0.59/0.77 % (12976)------------------------------
% 0.59/0.77 % (12976)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.59/0.77 % (12975)Termination reason: Unknown
% 0.59/0.77 % (12975)Termination phase: Saturation
% 0.59/0.77
% 0.59/0.77 % (12975)Memory used [KB]: 1673
% 0.59/0.77 % (12975)Time elapsed: 0.020 s
% 0.59/0.77 % (12975)Instructions burned: 34 (million)
% 0.59/0.77 % (12975)------------------------------
% 0.59/0.77 % (12975)------------------------------
% 0.59/0.77 % (12976)Termination reason: Unknown
% 0.59/0.77 % (12976)Termination phase: Saturation
% 0.59/0.77
% 0.59/0.77 % (12976)Memory used [KB]: 2056
% 0.59/0.77 % (12976)Time elapsed: 0.020 s
% 0.59/0.77 % (12976)Instructions burned: 35 (million)
% 0.59/0.77 % (12976)------------------------------
% 0.59/0.77 % (12976)------------------------------
% 0.59/0.77 % (12973)Refutation found. Thanks to Tanya!
% 0.59/0.77 % SZS status Theorem for Vampire---4
% 0.59/0.77 % SZS output start Proof for Vampire---4
% See solution above
% 0.59/0.77 % (12973)------------------------------
% 0.59/0.77 % (12973)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.59/0.77 % (12973)Termination reason: Refutation
% 0.59/0.77
% 0.59/0.77 % (12973)Memory used [KB]: 1511
% 0.59/0.77 % (12973)Time elapsed: 0.019 s
% 0.59/0.77 % (12973)Instructions burned: 29 (million)
% 0.59/0.77 % (12971)Success in time 0.404 s
% 0.59/0.77 % Vampire---4.8 exiting
%------------------------------------------------------------------------------