TSTP Solution File: SWC004+1 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SWC004+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/sandbox2/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 : Wed May 1 03:59:09 EDT 2024
% Result : Theorem 0.57s 0.76s
% Output : Refutation 0.57s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 23
% Syntax : Number of formulae : 77 ( 8 unt; 0 def)
% Number of atoms : 485 ( 128 equ)
% Maximal formula atoms : 40 ( 6 avg)
% Number of connectives : 625 ( 217 ~; 193 |; 168 &)
% ( 13 <=>; 34 =>; 0 <=; 0 <~>)
% Maximal formula depth : 22 ( 6 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 16 ( 14 usr; 12 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 8 con; 0-2 aty)
% Number of variables : 158 ( 86 !; 72 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f896,plain,
$false,
inference(avatar_sat_refutation,[],[f604,f609,f614,f619,f624,f628,f635,f666,f678,f839,f871,f895]) ).
fof(f895,plain,
( ~ spl54_14
| ~ spl54_6
| ~ spl54_28 ),
inference(avatar_split_clause,[],[f887,f808,f621,f670]) ).
fof(f670,plain,
( spl54_14
<=> ssList(nil) ),
introduced(avatar_definition,[new_symbols(naming,[spl54_14])]) ).
fof(f621,plain,
( spl54_6
<=> ssItem(sK51) ),
introduced(avatar_definition,[new_symbols(naming,[spl54_6])]) ).
fof(f808,plain,
( spl54_28
<=> nil = cons(sK51,nil) ),
introduced(avatar_definition,[new_symbols(naming,[spl54_28])]) ).
fof(f887,plain,
( ~ ssItem(sK51)
| ~ ssList(nil)
| ~ spl54_28 ),
inference(trivial_inequality_removal,[],[f885]) ).
fof(f885,plain,
( nil != nil
| ~ ssItem(sK51)
| ~ ssList(nil)
| ~ spl54_28 ),
inference(superposition,[],[f424,f810]) ).
fof(f810,plain,
( nil = cons(sK51,nil)
| ~ spl54_28 ),
inference(avatar_component_clause,[],[f808]) ).
fof(f424,plain,
! [X0,X1] :
( cons(X1,X0) != X0
| ~ ssItem(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f121]) ).
fof(f121,plain,
! [X0] :
( ! [X1] :
( cons(X1,X0) != X0
| ~ ssItem(X1) )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f18]) ).
fof(f18,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssItem(X1)
=> cons(X1,X0) != X0 ) ),
file('/export/starexec/sandbox2/tmp/tmp.lUopJTmVlV/Vampire---4.8_15827',ax18) ).
fof(f871,plain,
( ~ spl54_14
| ~ spl54_6
| spl54_13 ),
inference(avatar_split_clause,[],[f870,f663,f621,f670]) ).
fof(f663,plain,
( spl54_13
<=> ssList(cons(sK51,nil)) ),
introduced(avatar_definition,[new_symbols(naming,[spl54_13])]) ).
fof(f870,plain,
( ~ ssItem(sK51)
| ~ ssList(nil)
| spl54_13 ),
inference(resolution,[],[f665,f422]) ).
fof(f422,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/sandbox2/tmp/tmp.lUopJTmVlV/Vampire---4.8_15827',ax16) ).
fof(f665,plain,
( ~ ssList(cons(sK51,nil))
| spl54_13 ),
inference(avatar_component_clause,[],[f663]) ).
fof(f839,plain,
( ~ spl54_13
| ~ spl54_14
| spl54_28
| spl54_12 ),
inference(avatar_split_clause,[],[f829,f659,f808,f670,f663]) ).
fof(f659,plain,
( spl54_12
<=> neq(cons(sK51,nil),nil) ),
introduced(avatar_definition,[new_symbols(naming,[spl54_12])]) ).
fof(f829,plain,
( nil = cons(sK51,nil)
| ~ ssList(nil)
| ~ ssList(cons(sK51,nil))
| spl54_12 ),
inference(resolution,[],[f421,f661]) ).
fof(f661,plain,
( ~ neq(cons(sK51,nil),nil)
| spl54_12 ),
inference(avatar_component_clause,[],[f659]) ).
fof(f421,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/sandbox2/tmp/tmp.lUopJTmVlV/Vampire---4.8_15827',ax15) ).
fof(f678,plain,
spl54_14,
inference(avatar_contradiction_clause,[],[f677]) ).
fof(f677,plain,
( $false
| spl54_14 ),
inference(resolution,[],[f672,f423]) ).
fof(f423,plain,
ssList(nil),
inference(cnf_transformation,[],[f17]) ).
fof(f17,axiom,
ssList(nil),
file('/export/starexec/sandbox2/tmp/tmp.lUopJTmVlV/Vampire---4.8_15827',ax17) ).
fof(f672,plain,
( ~ ssList(nil)
| spl54_14 ),
inference(avatar_component_clause,[],[f670]) ).
fof(f666,plain,
( ~ spl54_12
| ~ spl54_4
| ~ spl54_13
| ~ spl54_5
| ~ spl54_1
| ~ spl54_3
| ~ spl54_7 ),
inference(avatar_split_clause,[],[f657,f626,f606,f597,f616,f663,f611,f659]) ).
fof(f611,plain,
( spl54_4
<=> ssList(sK53) ),
introduced(avatar_definition,[new_symbols(naming,[spl54_4])]) ).
fof(f616,plain,
( spl54_5
<=> ssList(sK52) ),
introduced(avatar_definition,[new_symbols(naming,[spl54_5])]) ).
fof(f597,plain,
( spl54_1
<=> sK49 = app(sK52,sK53) ),
introduced(avatar_definition,[new_symbols(naming,[spl54_1])]) ).
fof(f606,plain,
( spl54_3
<=> sK50 = app(app(sK52,cons(sK51,nil)),sK53) ),
introduced(avatar_definition,[new_symbols(naming,[spl54_3])]) ).
fof(f626,plain,
( spl54_7
<=> ! [X9,X8,X7] :
( ~ neq(X8,nil)
| ~ ssList(X7)
| ~ ssList(X8)
| ~ ssList(X9)
| app(app(X7,X8),X9) != sK50
| app(X7,X9) != sK49 ) ),
introduced(avatar_definition,[new_symbols(naming,[spl54_7])]) ).
fof(f657,plain,
( ~ ssList(sK52)
| ~ ssList(cons(sK51,nil))
| ~ ssList(sK53)
| ~ neq(cons(sK51,nil),nil)
| ~ spl54_1
| ~ spl54_3
| ~ spl54_7 ),
inference(trivial_inequality_removal,[],[f656]) ).
fof(f656,plain,
( sK49 != sK49
| ~ ssList(sK52)
| ~ ssList(cons(sK51,nil))
| ~ ssList(sK53)
| ~ neq(cons(sK51,nil),nil)
| ~ spl54_1
| ~ spl54_3
| ~ spl54_7 ),
inference(forward_demodulation,[],[f639,f599]) ).
fof(f599,plain,
( sK49 = app(sK52,sK53)
| ~ spl54_1 ),
inference(avatar_component_clause,[],[f597]) ).
fof(f639,plain,
( ~ ssList(sK52)
| ~ ssList(cons(sK51,nil))
| ~ ssList(sK53)
| ~ neq(cons(sK51,nil),nil)
| sK49 != app(sK52,sK53)
| ~ spl54_3
| ~ spl54_7 ),
inference(trivial_inequality_removal,[],[f638]) ).
fof(f638,plain,
( sK50 != sK50
| ~ ssList(sK52)
| ~ ssList(cons(sK51,nil))
| ~ ssList(sK53)
| ~ neq(cons(sK51,nil),nil)
| sK49 != app(sK52,sK53)
| ~ spl54_3
| ~ spl54_7 ),
inference(superposition,[],[f627,f608]) ).
fof(f608,plain,
( sK50 = app(app(sK52,cons(sK51,nil)),sK53)
| ~ spl54_3 ),
inference(avatar_component_clause,[],[f606]) ).
fof(f627,plain,
( ! [X8,X9,X7] :
( app(app(X7,X8),X9) != sK50
| ~ ssList(X7)
| ~ ssList(X8)
| ~ ssList(X9)
| ~ neq(X8,nil)
| app(X7,X9) != sK49 )
| ~ spl54_7 ),
inference(avatar_component_clause,[],[f626]) ).
fof(f635,plain,
spl54_2,
inference(avatar_split_clause,[],[f588,f601]) ).
fof(f601,plain,
( spl54_2
<=> neq(sK50,nil) ),
introduced(avatar_definition,[new_symbols(naming,[spl54_2])]) ).
fof(f588,plain,
neq(sK50,nil),
inference(duplicate_literal_removal,[],[f558]) ).
fof(f558,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) )
| ( sK49 = app(sK52,sK53)
& sK50 = app(app(sK52,cons(sK51,nil)),sK53)
& ssList(sK53)
& ssList(sK52)
& ssItem(sK51)
& ! [X7] :
( ! [X8] :
( ! [X9] :
( ~ neq(X8,nil)
| app(X7,X9) != sK47
| app(app(X7,X8),X9) != sK48
| ~ ssList(X9) )
| ~ ssList(X8) )
| ~ ssList(X7) )
& 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] :
( app(X5,X6) = X2
& app(app(X5,cons(X4,nil)),X6) = X3
& ssList(X6) )
& ssList(X5) )
& ssItem(X4) )
& ! [X7] :
( ! [X8] :
( ! [X9] :
( ~ neq(X8,nil)
| app(X7,X9) != X0
| app(app(X7,X8),X9) != X1
| ~ ssList(X9) )
| ~ ssList(X8) )
| ~ ssList(X7) )
& 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] :
( app(X5,X6) = X2
& app(app(X5,cons(X4,nil)),X6) = X3
& ssList(X6) )
& ssList(X5) )
& ssItem(X4) )
& ! [X7] :
( ! [X8] :
( ! [X9] :
( ~ neq(X8,nil)
| app(X7,X9) != sK47
| app(app(X7,X8),X9) != X1
| ~ ssList(X9) )
| ~ ssList(X8) )
| ~ ssList(X7) )
& 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] :
( app(X5,X6) = X2
& app(app(X5,cons(X4,nil)),X6) = X3
& ssList(X6) )
& ssList(X5) )
& ssItem(X4) )
& ! [X7] :
( ! [X8] :
( ! [X9] :
( ~ neq(X8,nil)
| app(X7,X9) != sK47
| app(app(X7,X8),X9) != X1
| ~ ssList(X9) )
| ~ ssList(X8) )
| ~ ssList(X7) )
& neq(X1,nil) ) )
& sK47 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
=> ( ? [X2] :
( ? [X3] :
( ( ( ~ neq(X3,nil)
& neq(sK48,nil) )
| ( ? [X4] :
( ? [X5] :
( ? [X6] :
( app(X5,X6) = X2
& app(app(X5,cons(X4,nil)),X6) = X3
& ssList(X6) )
& ssList(X5) )
& ssItem(X4) )
& ! [X7] :
( ! [X8] :
( ! [X9] :
( ~ neq(X8,nil)
| app(X7,X9) != sK47
| app(app(X7,X8),X9) != sK48
| ~ ssList(X9) )
| ~ ssList(X8) )
| ~ ssList(X7) )
& 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] :
( app(X5,X6) = X2
& app(app(X5,cons(X4,nil)),X6) = X3
& ssList(X6) )
& ssList(X5) )
& ssItem(X4) )
& ! [X7] :
( ! [X8] :
( ! [X9] :
( ~ neq(X8,nil)
| app(X7,X9) != sK47
| app(app(X7,X8),X9) != sK48
| ~ ssList(X9) )
| ~ ssList(X8) )
| ~ ssList(X7) )
& neq(sK48,nil) ) )
& sK47 = X2
& sK48 = X3
& ssList(X3) )
& ssList(X2) )
=> ( ? [X3] :
( ( ( ~ neq(X3,nil)
& neq(sK48,nil) )
| ( ? [X4] :
( ? [X5] :
( ? [X6] :
( app(X5,X6) = sK49
& app(app(X5,cons(X4,nil)),X6) = X3
& ssList(X6) )
& ssList(X5) )
& ssItem(X4) )
& ! [X7] :
( ! [X8] :
( ! [X9] :
( ~ neq(X8,nil)
| app(X7,X9) != sK47
| app(app(X7,X8),X9) != sK48
| ~ ssList(X9) )
| ~ ssList(X8) )
| ~ ssList(X7) )
& 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] :
( app(X5,X6) = sK49
& app(app(X5,cons(X4,nil)),X6) = X3
& ssList(X6) )
& ssList(X5) )
& ssItem(X4) )
& ! [X7] :
( ! [X8] :
( ! [X9] :
( ~ neq(X8,nil)
| app(X7,X9) != sK47
| app(app(X7,X8),X9) != sK48
| ~ ssList(X9) )
| ~ ssList(X8) )
| ~ ssList(X7) )
& neq(sK48,nil) ) )
& sK47 = sK49
& sK48 = X3
& ssList(X3) )
=> ( ( ( ~ neq(sK50,nil)
& neq(sK48,nil) )
| ( ? [X4] :
( ? [X5] :
( ? [X6] :
( app(X5,X6) = sK49
& app(app(X5,cons(X4,nil)),X6) = sK50
& ssList(X6) )
& ssList(X5) )
& ssItem(X4) )
& ! [X7] :
( ! [X8] :
( ! [X9] :
( ~ neq(X8,nil)
| app(X7,X9) != sK47
| app(app(X7,X8),X9) != sK48
| ~ ssList(X9) )
| ~ ssList(X8) )
| ~ ssList(X7) )
& neq(sK48,nil) ) )
& sK47 = sK49
& sK48 = sK50
& ssList(sK50) ) ),
introduced(choice_axiom,[]) ).
fof(f336,plain,
( ? [X4] :
( ? [X5] :
( ? [X6] :
( app(X5,X6) = sK49
& app(app(X5,cons(X4,nil)),X6) = sK50
& ssList(X6) )
& ssList(X5) )
& ssItem(X4) )
=> ( ? [X5] :
( ? [X6] :
( 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] :
( app(X5,X6) = sK49
& sK50 = app(app(X5,cons(sK51,nil)),X6)
& ssList(X6) )
& ssList(X5) )
=> ( ? [X6] :
( sK49 = app(sK52,X6)
& sK50 = app(app(sK52,cons(sK51,nil)),X6)
& ssList(X6) )
& ssList(sK52) ) ),
introduced(choice_axiom,[]) ).
fof(f338,plain,
( ? [X6] :
( sK49 = app(sK52,X6)
& sK50 = app(app(sK52,cons(sK51,nil)),X6)
& ssList(X6) )
=> ( 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] :
( app(X5,X6) = X2
& app(app(X5,cons(X4,nil)),X6) = X3
& ssList(X6) )
& ssList(X5) )
& ssItem(X4) )
& ! [X7] :
( ! [X8] :
( ! [X9] :
( ~ neq(X8,nil)
| app(X7,X9) != X0
| app(app(X7,X8),X9) != X1
| ~ ssList(X9) )
| ~ ssList(X8) )
| ~ ssList(X7) )
& 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] :
( app(X5,X6) = X2
& app(app(X5,cons(X4,nil)),X6) = X3
& ssList(X6) )
& ssList(X5) )
& ssItem(X4) )
& ! [X7] :
( ! [X8] :
( ! [X9] :
( ~ neq(X8,nil)
| app(X7,X9) != X0
| app(app(X7,X8),X9) != X1
| ~ ssList(X9) )
| ~ ssList(X8) )
| ~ ssList(X7) )
& 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)
=> ( app(X5,X6) != X2
| app(app(X5,cons(X4,nil)),X6) != X3 ) ) ) )
| ? [X7] :
( ? [X8] :
( ? [X9] :
( neq(X8,nil)
& app(X7,X9) = X0
& app(app(X7,X8),X9) = X1
& ssList(X9) )
& ssList(X8) )
& ssList(X7) )
| ~ 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)
=> ( app(X8,X9) != X2
| app(app(X8,cons(X7,nil)),X9) != X3 ) ) ) )
| ? [X4] :
( ? [X5] :
( ? [X6] :
( neq(X5,nil)
& app(X4,X6) = X0
& app(app(X4,X5),X6) = X1
& ssList(X6) )
& ssList(X5) )
& 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) )
& ( ! [X7] :
( ssItem(X7)
=> ! [X8] :
( ssList(X8)
=> ! [X9] :
( ssList(X9)
=> ( app(X8,X9) != X2
| app(app(X8,cons(X7,nil)),X9) != X3 ) ) ) )
| ? [X4] :
( ? [X5] :
( ? [X6] :
( neq(X5,nil)
& app(X4,X6) = X0
& app(app(X4,X5),X6) = X1
& ssList(X6) )
& ssList(X5) )
& ssList(X4) )
| ~ neq(X1,nil) ) )
| X0 != X2
| X1 != X3 ) ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.lUopJTmVlV/Vampire---4.8_15827',co1) ).
fof(f536,plain,
( neq(sK48,nil)
| neq(sK48,nil) ),
inference(cnf_transformation,[],[f339]) ).
fof(f628,plain,
( spl54_7
| ~ spl54_2 ),
inference(avatar_split_clause,[],[f550,f601,f626]) ).
fof(f550,plain,
! [X8,X9,X7] :
( ~ neq(sK50,nil)
| ~ neq(X8,nil)
| app(X7,X9) != sK49
| app(app(X7,X8),X9) != sK50
| ~ ssList(X9)
| ~ ssList(X8)
| ~ ssList(X7) ),
inference(definition_unfolding,[],[f544,f535,f534]) ).
fof(f535,plain,
sK47 = sK49,
inference(cnf_transformation,[],[f339]) ).
fof(f544,plain,
! [X8,X9,X7] :
( ~ neq(sK50,nil)
| ~ neq(X8,nil)
| app(X7,X9) != sK47
| app(app(X7,X8),X9) != sK48
| ~ ssList(X9)
| ~ ssList(X8)
| ~ ssList(X7) ),
inference(cnf_transformation,[],[f339]) ).
fof(f624,plain,
( spl54_6
| ~ spl54_2 ),
inference(avatar_split_clause,[],[f545,f601,f621]) ).
fof(f545,plain,
( ~ neq(sK50,nil)
| ssItem(sK51) ),
inference(cnf_transformation,[],[f339]) ).
fof(f619,plain,
( spl54_5
| ~ spl54_2 ),
inference(avatar_split_clause,[],[f546,f601,f616]) ).
fof(f546,plain,
( ~ neq(sK50,nil)
| ssList(sK52) ),
inference(cnf_transformation,[],[f339]) ).
fof(f614,plain,
( spl54_4
| ~ spl54_2 ),
inference(avatar_split_clause,[],[f547,f601,f611]) ).
fof(f547,plain,
( ~ neq(sK50,nil)
| ssList(sK53) ),
inference(cnf_transformation,[],[f339]) ).
fof(f609,plain,
( spl54_3
| ~ spl54_2 ),
inference(avatar_split_clause,[],[f548,f601,f606]) ).
fof(f548,plain,
( ~ neq(sK50,nil)
| sK50 = app(app(sK52,cons(sK51,nil)),sK53) ),
inference(cnf_transformation,[],[f339]) ).
fof(f604,plain,
( spl54_1
| ~ spl54_2 ),
inference(avatar_split_clause,[],[f549,f601,f597]) ).
fof(f549,plain,
( ~ neq(sK50,nil)
| sK49 = app(sK52,sK53) ),
inference(cnf_transformation,[],[f339]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : SWC004+1 : TPTP v8.1.2. Released v2.4.0.
% 0.07/0.14 % Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox2/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% 0.15/0.35 % Computer : n009.cluster.edu
% 0.15/0.35 % Model : x86_64 x86_64
% 0.15/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.35 % Memory : 8042.1875MB
% 0.15/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.35 % CPULimit : 300
% 0.15/0.35 % WCLimit : 300
% 0.15/0.35 % DateTime : Tue Apr 30 18:15:11 EDT 2024
% 0.15/0.35 % CPUTime :
% 0.15/0.35 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/sandbox2/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t 300 /export/starexec/sandbox2/tmp/tmp.lUopJTmVlV/Vampire---4.8_15827
% 0.57/0.74 % (16010)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.57/0.74 % (16012)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.57/0.74 % (16005)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.57/0.74 % (16007)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.57/0.74 % (16008)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.57/0.74 % (16009)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.57/0.74 % (16006)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.57/0.74 % (16011)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.57/0.74 % (16010)Refutation not found, incomplete strategy% (16010)------------------------------
% 0.57/0.74 % (16010)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.57/0.74 % (16010)Termination reason: Refutation not found, incomplete strategy
% 0.57/0.74
% 0.57/0.74 % (16010)Memory used [KB]: 1144
% 0.57/0.74 % (16010)Time elapsed: 0.002 s
% 0.57/0.74 % (16010)Instructions burned: 4 (million)
% 0.57/0.74 % (16010)------------------------------
% 0.57/0.74 % (16010)------------------------------
% 0.57/0.74 % (16012)Refutation not found, incomplete strategy% (16012)------------------------------
% 0.57/0.74 % (16012)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.57/0.74 % (16012)Termination reason: Refutation not found, incomplete strategy
% 0.57/0.74
% 0.57/0.74 % (16012)Memory used [KB]: 1148
% 0.57/0.74 % (16012)Time elapsed: 0.002 s
% 0.57/0.74 % (16012)Instructions burned: 5 (million)
% 0.57/0.74 % (16012)------------------------------
% 0.57/0.74 % (16012)------------------------------
% 0.57/0.75 % (16013)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.57/0.75 % (16014)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.57/0.76 % (16006)First to succeed.
% 0.57/0.76 % (16006)Refutation found. Thanks to Tanya!
% 0.57/0.76 % SZS status Theorem for Vampire---4
% 0.57/0.76 % SZS output start Proof for Vampire---4
% See solution above
% 0.57/0.76 % (16006)------------------------------
% 0.57/0.76 % (16006)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.57/0.76 % (16006)Termination reason: Refutation
% 0.57/0.76
% 0.57/0.76 % (16006)Memory used [KB]: 1509
% 0.57/0.76 % (16006)Time elapsed: 0.017 s
% 0.57/0.76 % (16006)Instructions burned: 27 (million)
% 0.57/0.76 % (16006)------------------------------
% 0.57/0.76 % (16006)------------------------------
% 0.57/0.76 % (15994)Success in time 0.397 s
% 0.57/0.76 % Vampire---4.8 exiting
%------------------------------------------------------------------------------