TSTP Solution File: SWC324+1 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SWC324+1 : TPTP v8.2.0. 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 : n011.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 : Tue May 21 04:38:09 EDT 2024
% Result : Theorem 0.59s 0.77s
% Output : Refutation 0.65s
% Verified :
% SZS Type : Refutation
% Derivation depth : 15
% Number of leaves : 27
% Syntax : Number of formulae : 110 ( 10 unt; 0 def)
% Number of atoms : 481 ( 194 equ)
% Maximal formula atoms : 32 ( 4 avg)
% Number of connectives : 597 ( 226 ~; 232 |; 103 &)
% ( 14 <=>; 22 =>; 0 <=; 0 <~>)
% Maximal formula depth : 18 ( 5 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 18 ( 16 usr; 15 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 5 con; 0-2 aty)
% Number of variables : 136 ( 94 !; 42 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f912,plain,
$false,
inference(avatar_sat_refutation,[],[f580,f592,f618,f633,f644,f651,f663,f757,f776,f782,f784,f802,f819,f908,f911]) ).
fof(f911,plain,
( ~ spl51_6
| spl51_2
| spl51_28 ),
inference(avatar_split_clause,[],[f910,f905,f577,f606]) ).
fof(f606,plain,
( spl51_6
<=> ssList(sK50) ),
introduced(avatar_definition,[new_symbols(naming,[spl51_6])]) ).
fof(f577,plain,
( spl51_2
<=> nil = sK50 ),
introduced(avatar_definition,[new_symbols(naming,[spl51_2])]) ).
fof(f905,plain,
( spl51_28
<=> sK50 = cons(sK44(sK50),sK43(sK50)) ),
introduced(avatar_definition,[new_symbols(naming,[spl51_28])]) ).
fof(f910,plain,
( nil = sK50
| ~ ssList(sK50)
| spl51_28 ),
inference(trivial_inequality_removal,[],[f909]) ).
fof(f909,plain,
( sK50 != sK50
| nil = sK50
| ~ ssList(sK50)
| spl51_28 ),
inference(superposition,[],[f907,f425]) ).
fof(f425,plain,
! [X0] :
( cons(sK44(X0),sK43(X0)) = X0
| nil = X0
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f307]) ).
fof(f307,plain,
! [X0] :
( ( cons(sK44(X0),sK43(X0)) = X0
& ssItem(sK44(X0))
& ssList(sK43(X0)) )
| nil = X0
| ~ ssList(X0) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK43,sK44])],[f125,f306,f305]) ).
fof(f305,plain,
! [X0] :
( ? [X1] :
( ? [X2] :
( cons(X2,X1) = X0
& ssItem(X2) )
& ssList(X1) )
=> ( ? [X2] :
( cons(X2,sK43(X0)) = X0
& ssItem(X2) )
& ssList(sK43(X0)) ) ),
introduced(choice_axiom,[]) ).
fof(f306,plain,
! [X0] :
( ? [X2] :
( cons(X2,sK43(X0)) = X0
& ssItem(X2) )
=> ( cons(sK44(X0),sK43(X0)) = X0
& ssItem(sK44(X0)) ) ),
introduced(choice_axiom,[]) ).
fof(f125,plain,
! [X0] :
( ? [X1] :
( ? [X2] :
( cons(X2,X1) = X0
& ssItem(X2) )
& ssList(X1) )
| nil = X0
| ~ ssList(X0) ),
inference(flattening,[],[f124]) ).
fof(f124,plain,
! [X0] :
( ? [X1] :
( ? [X2] :
( cons(X2,X1) = X0
& ssItem(X2) )
& ssList(X1) )
| nil = X0
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f20]) ).
fof(f20,axiom,
! [X0] :
( ssList(X0)
=> ( ? [X1] :
( ? [X2] :
( cons(X2,X1) = X0
& ssItem(X2) )
& ssList(X1) )
| nil = X0 ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax20) ).
fof(f907,plain,
( sK50 != cons(sK44(sK50),sK43(sK50))
| spl51_28 ),
inference(avatar_component_clause,[],[f905]) ).
fof(f908,plain,
( ~ spl51_16
| ~ spl51_18
| ~ spl51_28
| spl51_17 ),
inference(avatar_split_clause,[],[f903,f773,f905,f779,f769]) ).
fof(f769,plain,
( spl51_16
<=> ssList(sK43(sK50)) ),
introduced(avatar_definition,[new_symbols(naming,[spl51_16])]) ).
fof(f779,plain,
( spl51_18
<=> ssItem(sK44(sK50)) ),
introduced(avatar_definition,[new_symbols(naming,[spl51_18])]) ).
fof(f773,plain,
( spl51_17
<=> sK50 = app(cons(sK44(sK50),nil),sK43(sK50)) ),
introduced(avatar_definition,[new_symbols(naming,[spl51_17])]) ).
fof(f903,plain,
( sK50 != cons(sK44(sK50),sK43(sK50))
| ~ ssItem(sK44(sK50))
| ~ ssList(sK43(sK50))
| spl51_17 ),
inference(superposition,[],[f775,f507]) ).
fof(f507,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/sandbox2/benchmark/theBenchmark.p',ax81) ).
fof(f775,plain,
( sK50 != app(cons(sK44(sK50),nil),sK43(sK50))
| spl51_17 ),
inference(avatar_component_clause,[],[f773]) ).
fof(f819,plain,
( ~ spl51_6
| spl51_2
| spl51_16 ),
inference(avatar_split_clause,[],[f818,f769,f577,f606]) ).
fof(f818,plain,
( nil = sK50
| ~ ssList(sK50)
| spl51_16 ),
inference(resolution,[],[f771,f423]) ).
fof(f423,plain,
! [X0] :
( ssList(sK43(X0))
| nil = X0
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f307]) ).
fof(f771,plain,
( ~ ssList(sK43(sK50))
| spl51_16 ),
inference(avatar_component_clause,[],[f769]) ).
fof(f802,plain,
( ~ spl51_1
| ~ spl51_2
| spl51_9 ),
inference(avatar_split_clause,[],[f793,f624,f577,f573]) ).
fof(f573,plain,
( spl51_1
<=> nil = sK49 ),
introduced(avatar_definition,[new_symbols(naming,[spl51_1])]) ).
fof(f624,plain,
( spl51_9
<=> sK49 = sK50 ),
introduced(avatar_definition,[new_symbols(naming,[spl51_9])]) ).
fof(f793,plain,
( nil != sK49
| ~ spl51_2
| spl51_9 ),
inference(superposition,[],[f625,f578]) ).
fof(f578,plain,
( nil = sK50
| ~ spl51_2 ),
inference(avatar_component_clause,[],[f577]) ).
fof(f625,plain,
( sK49 != sK50
| spl51_9 ),
inference(avatar_component_clause,[],[f624]) ).
fof(f784,plain,
( ~ spl51_6
| spl51_2
| spl51_18 ),
inference(avatar_split_clause,[],[f783,f779,f577,f606]) ).
fof(f783,plain,
( nil = sK50
| ~ ssList(sK50)
| spl51_18 ),
inference(resolution,[],[f781,f424]) ).
fof(f424,plain,
! [X0] :
( ssItem(sK44(X0))
| nil = X0
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f307]) ).
fof(f781,plain,
( ~ ssItem(sK44(sK50))
| spl51_18 ),
inference(avatar_component_clause,[],[f779]) ).
fof(f782,plain,
( ~ spl51_3
| ~ spl51_18
| spl51_15 ),
inference(avatar_split_clause,[],[f777,f765,f779,f584]) ).
fof(f584,plain,
( spl51_3
<=> ssList(nil) ),
introduced(avatar_definition,[new_symbols(naming,[spl51_3])]) ).
fof(f765,plain,
( spl51_15
<=> ssList(cons(sK44(sK50),nil)) ),
introduced(avatar_definition,[new_symbols(naming,[spl51_15])]) ).
fof(f777,plain,
( ~ ssItem(sK44(sK50))
| ~ ssList(nil)
| spl51_15 ),
inference(resolution,[],[f767,f418]) ).
fof(f418,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/benchmark/theBenchmark.p',ax16) ).
fof(f767,plain,
( ~ ssList(cons(sK44(sK50),nil))
| spl51_15 ),
inference(avatar_component_clause,[],[f765]) ).
fof(f776,plain,
( ~ spl51_15
| ~ spl51_16
| ~ spl51_17
| ~ spl51_14 ),
inference(avatar_split_clause,[],[f763,f754,f773,f769,f765]) ).
fof(f754,plain,
( spl51_14
<=> sK49 = app(sK43(sK50),cons(sK44(sK50),nil)) ),
introduced(avatar_definition,[new_symbols(naming,[spl51_14])]) ).
fof(f763,plain,
( sK50 != app(cons(sK44(sK50),nil),sK43(sK50))
| ~ ssList(sK43(sK50))
| ~ ssList(cons(sK44(sK50),nil))
| ~ spl51_14 ),
inference(trivial_inequality_removal,[],[f762]) ).
fof(f762,plain,
( sK49 != sK49
| sK50 != app(cons(sK44(sK50),nil),sK43(sK50))
| ~ ssList(sK43(sK50))
| ~ ssList(cons(sK44(sK50),nil))
| ~ spl51_14 ),
inference(superposition,[],[f535,f756]) ).
fof(f756,plain,
( sK49 = app(sK43(sK50),cons(sK44(sK50),nil))
| ~ spl51_14 ),
inference(avatar_component_clause,[],[f754]) ).
fof(f535,plain,
! [X6,X7] :
( app(X7,X6) != sK49
| app(X6,X7) != sK50
| ~ ssList(X7)
| ~ ssList(X6) ),
inference(definition_unfolding,[],[f532,f531,f530]) ).
fof(f530,plain,
sK48 = sK50,
inference(cnf_transformation,[],[f335]) ).
fof(f335,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] :
( app(X7,X6) != sK47
| app(X6,X7) != sK48
| ~ ssList(X7) )
| ~ ssList(X6) )
& sK47 = sK49
& sK48 = sK50
& ssList(sK50)
& ssList(sK49)
& ssList(sK48)
& ssList(sK47) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK47,sK48,sK49,sK50])],[f222,f334,f333,f332,f331]) ).
fof(f331,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] :
( app(X7,X6) != X0
| app(X6,X7) != X1
| ~ ssList(X7) )
| ~ ssList(X6) )
& 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] :
( app(X7,X6) != sK47
| app(X6,X7) != X1
| ~ ssList(X7) )
| ~ ssList(X6) )
& sK47 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(sK47) ) ),
introduced(choice_axiom,[]) ).
fof(f332,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] :
( app(X7,X6) != sK47
| app(X6,X7) != X1
| ~ ssList(X7) )
| ~ ssList(X6) )
& 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] :
( app(X7,X6) != sK47
| app(X6,X7) != sK48
| ~ ssList(X7) )
| ~ ssList(X6) )
& sK47 = X2
& sK48 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(sK48) ) ),
introduced(choice_axiom,[]) ).
fof(f333,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] :
( app(X7,X6) != sK47
| app(X6,X7) != sK48
| ~ ssList(X7) )
| ~ ssList(X6) )
& 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] :
( app(X7,X6) != sK47
| app(X6,X7) != sK48
| ~ ssList(X7) )
| ~ ssList(X6) )
& sK47 = sK49
& sK48 = X3
& ssList(X3) )
& ssList(sK49) ) ),
introduced(choice_axiom,[]) ).
fof(f334,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] :
( app(X7,X6) != sK47
| app(X6,X7) != sK48
| ~ ssList(X7) )
| ~ ssList(X6) )
& 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] :
( app(X7,X6) != sK47
| app(X6,X7) != sK48
| ~ ssList(X7) )
| ~ ssList(X6) )
& sK47 = sK49
& sK48 = sK50
& ssList(sK50) ) ),
introduced(choice_axiom,[]) ).
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] :
( app(X7,X6) != X0
| app(X6,X7) != X1
| ~ ssList(X7) )
| ~ ssList(X6) )
& 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] :
( ( nil = X3
& nil != X2 )
| ? [X4] :
( ? [X5] :
( app(cons(X4,nil),X5) = X3
& app(X5,cons(X4,nil)) != X2
& ssList(X5) )
& ssItem(X4) )
| ? [X6] :
( ? [X7] :
( app(X7,X6) = X0
& app(X6,X7) = X1
& ssList(X7) )
& ssList(X6) )
| X0 != X2
| X1 != X3
| ~ ssList(X3) ) ) ) ),
inference(rectify,[],[f97]) ).
fof(f97,negated_conjecture,
~ ! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ( nil = X3
& nil != X2 )
| ? [X6] :
( ? [X7] :
( app(cons(X6,nil),X7) = X3
& app(X7,cons(X6,nil)) != X2
& ssList(X7) )
& ssItem(X6) )
| ? [X4] :
( ? [X5] :
( app(X5,X4) = X0
& app(X4,X5) = X1
& ssList(X5) )
& ssList(X4) )
| X0 != X2
| X1 != X3
| ~ ssList(X3) ) ) ) ),
inference(negated_conjecture,[],[f96]) ).
fof(f96,conjecture,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ( nil = X3
& nil != X2 )
| ? [X6] :
( ? [X7] :
( app(cons(X6,nil),X7) = X3
& app(X7,cons(X6,nil)) != X2
& ssList(X7) )
& ssItem(X6) )
| ? [X4] :
( ? [X5] :
( app(X5,X4) = X0
& app(X4,X5) = X1
& ssList(X5) )
& ssList(X4) )
| X0 != X2
| X1 != X3
| ~ ssList(X3) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1) ).
fof(f531,plain,
sK47 = sK49,
inference(cnf_transformation,[],[f335]) ).
fof(f532,plain,
! [X6,X7] :
( app(X7,X6) != sK47
| app(X6,X7) != sK48
| ~ ssList(X7)
| ~ ssList(X6) ),
inference(cnf_transformation,[],[f335]) ).
fof(f757,plain,
( ~ spl51_6
| spl51_2
| spl51_14 ),
inference(avatar_split_clause,[],[f752,f754,f577,f606]) ).
fof(f752,plain,
( sK49 = app(sK43(sK50),cons(sK44(sK50),nil))
| nil = sK50
| ~ ssList(sK50) ),
inference(equality_resolution,[],[f751]) ).
fof(f751,plain,
! [X0] :
( sK50 != X0
| sK49 = app(sK43(X0),cons(sK44(X0),nil))
| nil = X0
| ~ ssList(X0) ),
inference(duplicate_literal_removal,[],[f750]) ).
fof(f750,plain,
! [X0] :
( sK50 != X0
| sK49 = app(sK43(X0),cons(sK44(X0),nil))
| nil = X0
| ~ ssList(X0)
| nil = X0
| ~ ssList(X0) ),
inference(resolution,[],[f749,f424]) ).
fof(f749,plain,
! [X0] :
( ~ ssItem(sK44(X0))
| sK50 != X0
| sK49 = app(sK43(X0),cons(sK44(X0),nil))
| nil = X0
| ~ ssList(X0) ),
inference(duplicate_literal_removal,[],[f748]) ).
fof(f748,plain,
! [X0] :
( sK49 = app(sK43(X0),cons(sK44(X0),nil))
| sK50 != X0
| ~ ssItem(sK44(X0))
| nil = X0
| ~ ssList(X0)
| nil = X0
| ~ ssList(X0) ),
inference(resolution,[],[f738,f423]) ).
fof(f738,plain,
! [X0] :
( ~ ssList(sK43(X0))
| sK49 = app(sK43(X0),cons(sK44(X0),nil))
| sK50 != X0
| ~ ssItem(sK44(X0))
| nil = X0
| ~ ssList(X0) ),
inference(superposition,[],[f737,f425]) ).
fof(f737,plain,
! [X0,X1] :
( cons(X0,X1) != sK50
| sK49 = app(X1,cons(X0,nil))
| ~ ssList(X1)
| ~ ssItem(X0) ),
inference(duplicate_literal_removal,[],[f727]) ).
fof(f727,plain,
! [X0,X1] :
( cons(X0,X1) != sK50
| sK49 = app(X1,cons(X0,nil))
| ~ ssList(X1)
| ~ ssItem(X0)
| ~ ssItem(X0)
| ~ ssList(X1) ),
inference(superposition,[],[f533,f507]) ).
fof(f533,plain,
! [X4,X5] :
( app(cons(X4,nil),X5) != sK50
| app(X5,cons(X4,nil)) = sK49
| ~ ssList(X5)
| ~ ssItem(X4) ),
inference(cnf_transformation,[],[f335]) ).
fof(f663,plain,
spl51_11,
inference(avatar_contradiction_clause,[],[f662]) ).
fof(f662,plain,
( $false
| spl51_11 ),
inference(resolution,[],[f650,f528]) ).
fof(f528,plain,
ssList(sK49),
inference(cnf_transformation,[],[f335]) ).
fof(f650,plain,
( ~ ssList(sK49)
| spl51_11 ),
inference(avatar_component_clause,[],[f648]) ).
fof(f648,plain,
( spl51_11
<=> ssList(sK49) ),
introduced(avatar_definition,[new_symbols(naming,[spl51_11])]) ).
fof(f651,plain,
( ~ spl51_11
| ~ spl51_9
| spl51_7 ),
inference(avatar_split_clause,[],[f646,f610,f624,f648]) ).
fof(f610,plain,
( spl51_7
<=> sK49 = app(nil,sK50) ),
introduced(avatar_definition,[new_symbols(naming,[spl51_7])]) ).
fof(f646,plain,
( sK49 != sK50
| ~ ssList(sK49)
| spl51_7 ),
inference(inner_rewriting,[],[f645]) ).
fof(f645,plain,
( sK49 != sK50
| ~ ssList(sK50)
| spl51_7 ),
inference(superposition,[],[f611,f433]) ).
fof(f433,plain,
! [X0] :
( app(nil,X0) = X0
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f135]) ).
fof(f135,plain,
! [X0] :
( app(nil,X0) = X0
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f28]) ).
fof(f28,axiom,
! [X0] :
( ssList(X0)
=> app(nil,X0) = X0 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax28) ).
fof(f611,plain,
( sK49 != app(nil,sK50)
| spl51_7 ),
inference(avatar_component_clause,[],[f610]) ).
fof(f644,plain,
( ~ spl51_6
| spl51_10 ),
inference(avatar_split_clause,[],[f640,f630,f606]) ).
fof(f630,plain,
( spl51_10
<=> sK50 = app(sK50,nil) ),
introduced(avatar_definition,[new_symbols(naming,[spl51_10])]) ).
fof(f640,plain,
( ~ ssList(sK50)
| spl51_10 ),
inference(trivial_inequality_removal,[],[f639]) ).
fof(f639,plain,
( sK50 != sK50
| ~ ssList(sK50)
| spl51_10 ),
inference(superposition,[],[f632,f512]) ).
fof(f512,plain,
! [X0] :
( app(X0,nil) = X0
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f202]) ).
fof(f202,plain,
! [X0] :
( app(X0,nil) = X0
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f84]) ).
fof(f84,axiom,
! [X0] :
( ssList(X0)
=> app(X0,nil) = X0 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax84) ).
fof(f632,plain,
( sK50 != app(sK50,nil)
| spl51_10 ),
inference(avatar_component_clause,[],[f630]) ).
fof(f633,plain,
( ~ spl51_6
| ~ spl51_3
| ~ spl51_10
| ~ spl51_7 ),
inference(avatar_split_clause,[],[f622,f610,f630,f584,f606]) ).
fof(f622,plain,
( sK50 != app(sK50,nil)
| ~ ssList(nil)
| ~ ssList(sK50)
| ~ spl51_7 ),
inference(trivial_inequality_removal,[],[f621]) ).
fof(f621,plain,
( sK49 != sK49
| sK50 != app(sK50,nil)
| ~ ssList(nil)
| ~ ssList(sK50)
| ~ spl51_7 ),
inference(superposition,[],[f535,f612]) ).
fof(f612,plain,
( sK49 = app(nil,sK50)
| ~ spl51_7 ),
inference(avatar_component_clause,[],[f610]) ).
fof(f618,plain,
spl51_6,
inference(avatar_contradiction_clause,[],[f617]) ).
fof(f617,plain,
( $false
| spl51_6 ),
inference(resolution,[],[f608,f529]) ).
fof(f529,plain,
ssList(sK50),
inference(cnf_transformation,[],[f335]) ).
fof(f608,plain,
( ~ ssList(sK50)
| spl51_6 ),
inference(avatar_component_clause,[],[f606]) ).
fof(f592,plain,
spl51_3,
inference(avatar_contradiction_clause,[],[f591]) ).
fof(f591,plain,
( $false
| spl51_3 ),
inference(resolution,[],[f586,f419]) ).
fof(f419,plain,
ssList(nil),
inference(cnf_transformation,[],[f17]) ).
fof(f17,axiom,
ssList(nil),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax17) ).
fof(f586,plain,
( ~ ssList(nil)
| spl51_3 ),
inference(avatar_component_clause,[],[f584]) ).
fof(f580,plain,
( spl51_1
| ~ spl51_2 ),
inference(avatar_split_clause,[],[f534,f577,f573]) ).
fof(f534,plain,
( nil != sK50
| nil = sK49 ),
inference(cnf_transformation,[],[f335]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.11 % Problem : SWC324+1 : TPTP v8.2.0. Released v2.4.0.
% 0.06/0.13 % 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.13/0.34 % Computer : n011.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Sun May 19 03:54:53 EDT 2024
% 0.13/0.34 % CPUTime :
% 0.13/0.34 This is a FOF_THM_RFO_SEQ problem
% 0.13/0.34 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/benchmark/theBenchmark.p
% 0.52/0.75 % (8489)lrs-21_1:1_to=lpo:sil=2000:sp=frequency:sos=on:lma=on:i=56:sd=2:ss=axioms:ep=R_0 on theBenchmark for (2996ds/56Mi)
% 0.52/0.75 % (8482)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 theBenchmark for (2996ds/34Mi)
% 0.52/0.75 % (8484)lrs+1011_1:1_sil=8000:sp=occurrence:nwc=10.0:i=78:ss=axioms:sgt=8_0 on theBenchmark for (2996ds/78Mi)
% 0.52/0.75 % (8486)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 theBenchmark for (2996ds/34Mi)
% 0.52/0.75 % (8483)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 theBenchmark for (2996ds/51Mi)
% 0.52/0.75 % (8485)ott+1011_1:1_sil=2000:urr=on:i=33:sd=1:kws=inv_frequency:ss=axioms:sup=off_0 on theBenchmark for (2996ds/33Mi)
% 0.52/0.75 % (8487)lrs+1002_1:16_to=lpo:sil=32000:sp=unary_frequency:sos=on:i=45:bd=off:ss=axioms_0 on theBenchmark for (2996ds/45Mi)
% 0.52/0.75 % (8488)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 theBenchmark for (2996ds/83Mi)
% 0.59/0.75 % (8482)Refutation not found, incomplete strategy% (8482)------------------------------
% 0.59/0.75 % (8482)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.59/0.75 % (8482)Termination reason: Refutation not found, incomplete strategy
% 0.59/0.75
% 0.59/0.75 % (8482)Memory used [KB]: 1175
% 0.59/0.75 % (8482)Time elapsed: 0.008 s
% 0.59/0.75 % (8482)Instructions burned: 11 (million)
% 0.59/0.76 % (8482)------------------------------
% 0.59/0.76 % (8482)------------------------------
% 0.59/0.76 % (8491)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 theBenchmark for (2995ds/55Mi)
% 0.59/0.76 % (8489)Instruction limit reached!
% 0.59/0.76 % (8489)------------------------------
% 0.59/0.76 % (8489)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.59/0.76 % (8489)Termination reason: Unknown
% 0.59/0.76 % (8489)Termination phase: Saturation
% 0.59/0.76
% 0.59/0.76 % (8489)Memory used [KB]: 1458
% 0.59/0.76 % (8489)Time elapsed: 0.018 s
% 0.59/0.76 % (8489)Instructions burned: 57 (million)
% 0.59/0.76 % (8489)------------------------------
% 0.59/0.76 % (8489)------------------------------
% 0.59/0.76 % (8483)First to succeed.
% 0.59/0.77 % (8485)Instruction limit reached!
% 0.59/0.77 % (8485)------------------------------
% 0.59/0.77 % (8485)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.59/0.77 % (8485)Termination reason: Unknown
% 0.59/0.77 % (8485)Termination phase: Saturation
% 0.59/0.77
% 0.59/0.77 % (8485)Memory used [KB]: 1657
% 0.59/0.77 % (8485)Time elapsed: 0.019 s
% 0.59/0.77 % (8485)Instructions burned: 33 (million)
% 0.59/0.77 % (8485)------------------------------
% 0.59/0.77 % (8485)------------------------------
% 0.59/0.77 % (8483)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-8461"
% 0.59/0.77 % (8496)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 theBenchmark for (2995ds/50Mi)
% 0.59/0.77 % (8486)Instruction limit reached!
% 0.59/0.77 % (8486)------------------------------
% 0.59/0.77 % (8486)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.59/0.77 % (8486)Termination reason: Unknown
% 0.59/0.77 % (8486)Termination phase: Saturation
% 0.59/0.77
% 0.59/0.77 % (8486)Memory used [KB]: 2019
% 0.59/0.77 % (8486)Time elapsed: 0.020 s
% 0.59/0.77 % (8486)Instructions burned: 35 (million)
% 0.59/0.77 % (8486)------------------------------
% 0.59/0.77 % (8486)------------------------------
% 0.59/0.77 % (8483)Refutation found. Thanks to Tanya!
% 0.59/0.77 % SZS status Theorem for theBenchmark
% 0.59/0.77 % SZS output start Proof for theBenchmark
% See solution above
% 0.65/0.77 % (8483)------------------------------
% 0.65/0.77 % (8483)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.65/0.77 % (8483)Termination reason: Refutation
% 0.65/0.77
% 0.65/0.77 % (8483)Memory used [KB]: 1509
% 0.65/0.77 % (8483)Time elapsed: 0.019 s
% 0.65/0.77 % (8483)Instructions burned: 30 (million)
% 0.65/0.77 % (8461)Success in time 0.43 s
% 0.65/0.77 % Vampire---4.8 exiting
%------------------------------------------------------------------------------