TSTP Solution File: SWC251+1 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SWC251+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/sandbox/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% Computer : n017.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:37:27 EDT 2024
% Result : Theorem 0.55s 0.76s
% Output : Refutation 0.55s
% Verified :
% SZS Type : Refutation
% Derivation depth : 17
% Number of leaves : 23
% Syntax : Number of formulae : 86 ( 10 unt; 0 def)
% Number of atoms : 826 ( 230 equ)
% Maximal formula atoms : 72 ( 9 avg)
% Number of connectives : 1231 ( 491 ~; 446 |; 259 &)
% ( 7 <=>; 28 =>; 0 <=; 0 <~>)
% Maximal formula depth : 26 ( 8 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 15 ( 13 usr; 8 prp; 0-2 aty)
% Number of functors : 12 ( 12 usr; 7 con; 0-3 aty)
% Number of variables : 347 ( 252 !; 95 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f862,plain,
$false,
inference(avatar_sat_refutation,[],[f599,f612,f628,f630,f684,f725,f729,f861]) ).
fof(f861,plain,
( ~ spl54_11
| spl54_2
| ~ spl54_23
| ~ spl54_24 ),
inference(avatar_split_clause,[],[f860,f727,f723,f595,f649]) ).
fof(f649,plain,
( spl54_11
<=> ssList(sK49) ),
introduced(avatar_definition,[new_symbols(naming,[spl54_11])]) ).
fof(f595,plain,
( spl54_2
<=> nil = sK49 ),
introduced(avatar_definition,[new_symbols(naming,[spl54_2])]) ).
fof(f723,plain,
( spl54_23
<=> ! [X0,X1] :
( ~ ssItem(X0)
| memberP(nil,sK53(X0,nil,X1))
| ~ ssList(X1)
| sK49 != app(cons(X0,nil),X1) ) ),
introduced(avatar_definition,[new_symbols(naming,[spl54_23])]) ).
fof(f727,plain,
( spl54_24
<=> ! [X0,X1] :
( ~ ssItem(X0)
| ssItem(sK53(X0,nil,X1))
| ~ ssList(X1)
| sK49 != app(cons(X0,nil),X1) ) ),
introduced(avatar_definition,[new_symbols(naming,[spl54_24])]) ).
fof(f860,plain,
( nil = sK49
| ~ ssList(sK49)
| ~ spl54_23
| ~ spl54_24 ),
inference(equality_resolution,[],[f859]) ).
fof(f859,plain,
( ! [X0] :
( sK49 != X0
| nil = X0
| ~ ssList(X0) )
| ~ spl54_23
| ~ spl54_24 ),
inference(duplicate_literal_removal,[],[f858]) ).
fof(f858,plain,
( ! [X0] :
( sK49 != X0
| nil = X0
| ~ ssList(X0)
| nil = X0
| ~ ssList(X0) )
| ~ spl54_23
| ~ spl54_24 ),
inference(resolution,[],[f857,f427]) ).
fof(f427,plain,
! [X0] :
( ssItem(sK44(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/sandbox/benchmark/theBenchmark.p',ax20) ).
fof(f857,plain,
( ! [X0] :
( ~ ssItem(sK44(X0))
| sK49 != X0
| nil = X0
| ~ ssList(X0) )
| ~ spl54_23
| ~ spl54_24 ),
inference(duplicate_literal_removal,[],[f856]) ).
fof(f856,plain,
( ! [X0] :
( ~ ssItem(sK44(X0))
| sK49 != X0
| nil = X0
| ~ ssList(X0)
| nil = X0
| ~ ssList(X0) )
| ~ spl54_23
| ~ spl54_24 ),
inference(resolution,[],[f854,f426]) ).
fof(f426,plain,
! [X0] :
( ssList(sK43(X0))
| nil = X0
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f307]) ).
fof(f854,plain,
( ! [X0] :
( ~ ssList(sK43(X0))
| ~ ssItem(sK44(X0))
| sK49 != X0
| nil = X0
| ~ ssList(X0) )
| ~ spl54_23
| ~ spl54_24 ),
inference(superposition,[],[f853,f428]) ).
fof(f428,plain,
! [X0] :
( cons(sK44(X0),sK43(X0)) = X0
| nil = X0
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f307]) ).
fof(f853,plain,
( ! [X0,X1] :
( cons(X0,X1) != sK49
| ~ ssItem(X0)
| ~ ssList(X1) )
| ~ spl54_23
| ~ spl54_24 ),
inference(duplicate_literal_removal,[],[f850]) ).
fof(f850,plain,
( ! [X0,X1] :
( cons(X0,X1) != sK49
| ~ ssItem(X0)
| cons(X0,X1) != sK49
| ~ ssList(X1)
| ~ ssItem(X0)
| ~ ssList(X1) )
| ~ spl54_23
| ~ spl54_24 ),
inference(superposition,[],[f848,f510]) ).
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/benchmark/theBenchmark.p',ax81) ).
fof(f848,plain,
( ! [X0,X1] :
( app(cons(X1,nil),X0) != sK49
| ~ ssItem(X1)
| cons(X1,X0) != sK49
| ~ ssList(X0) )
| ~ spl54_23
| ~ spl54_24 ),
inference(duplicate_literal_removal,[],[f845]) ).
fof(f845,plain,
( ! [X0,X1] :
( ~ ssList(X0)
| ~ ssItem(X1)
| cons(X1,X0) != sK49
| ~ ssItem(X1)
| ~ ssList(X0)
| app(cons(X1,nil),X0) != sK49 )
| ~ spl54_23
| ~ spl54_24 ),
inference(resolution,[],[f844,f728]) ).
fof(f728,plain,
( ! [X0,X1] :
( ssItem(sK53(X0,nil,X1))
| ~ ssItem(X0)
| ~ ssList(X1)
| sK49 != app(cons(X0,nil),X1) )
| ~ spl54_24 ),
inference(avatar_component_clause,[],[f727]) ).
fof(f844,plain,
( ! [X0,X1] :
( ~ ssItem(sK53(X0,nil,X1))
| ~ ssList(X1)
| ~ ssItem(X0)
| cons(X0,X1) != sK49 )
| ~ spl54_23 ),
inference(duplicate_literal_removal,[],[f824]) ).
fof(f824,plain,
( ! [X0,X1] :
( cons(X0,X1) != sK49
| ~ ssList(X1)
| ~ ssItem(X0)
| ~ ssItem(sK53(X0,nil,X1))
| ~ ssItem(X0)
| ~ ssList(X1) )
| ~ spl54_23 ),
inference(superposition,[],[f733,f510]) ).
fof(f733,plain,
( ! [X0,X1] :
( sK49 != app(cons(X0,nil),X1)
| ~ ssList(X1)
| ~ ssItem(X0)
| ~ ssItem(sK53(X0,nil,X1)) )
| ~ spl54_23 ),
inference(resolution,[],[f724,f452]) ).
fof(f452,plain,
! [X0] :
( ~ memberP(nil,X0)
| ~ ssItem(X0) ),
inference(cnf_transformation,[],[f149]) ).
fof(f149,plain,
! [X0] :
( ~ memberP(nil,X0)
| ~ ssItem(X0) ),
inference(ennf_transformation,[],[f38]) ).
fof(f38,axiom,
! [X0] :
( ssItem(X0)
=> ~ memberP(nil,X0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax38) ).
fof(f724,plain,
( ! [X0,X1] :
( memberP(nil,sK53(X0,nil,X1))
| ~ ssItem(X0)
| ~ ssList(X1)
| sK49 != app(cons(X0,nil),X1) )
| ~ spl54_23 ),
inference(avatar_component_clause,[],[f723]) ).
fof(f729,plain,
( ~ spl54_3
| spl54_24
| ~ spl54_8 ),
inference(avatar_split_clause,[],[f705,f626,f727,f606]) ).
fof(f606,plain,
( spl54_3
<=> ssList(nil) ),
introduced(avatar_definition,[new_symbols(naming,[spl54_3])]) ).
fof(f626,plain,
( spl54_8
<=> ! [X0,X1] :
( sK49 != app(cons(X0,nil),X1)
| ~ ssList(cons(X0,nil))
| ~ ssItem(X0)
| ~ ssList(X1)
| ssItem(sK53(X0,nil,X1)) ) ),
introduced(avatar_definition,[new_symbols(naming,[spl54_8])]) ).
fof(f705,plain,
( ! [X0,X1] :
( ~ ssItem(X0)
| ~ ssList(nil)
| sK49 != app(cons(X0,nil),X1)
| ~ ssList(X1)
| ssItem(sK53(X0,nil,X1)) )
| ~ spl54_8 ),
inference(duplicate_literal_removal,[],[f704]) ).
fof(f704,plain,
( ! [X0,X1] :
( ~ ssItem(X0)
| ~ ssList(nil)
| sK49 != app(cons(X0,nil),X1)
| ~ ssItem(X0)
| ~ ssList(X1)
| ssItem(sK53(X0,nil,X1)) )
| ~ spl54_8 ),
inference(resolution,[],[f421,f627]) ).
fof(f627,plain,
( ! [X0,X1] :
( ~ ssList(cons(X0,nil))
| sK49 != app(cons(X0,nil),X1)
| ~ ssItem(X0)
| ~ ssList(X1)
| ssItem(sK53(X0,nil,X1)) )
| ~ spl54_8 ),
inference(avatar_component_clause,[],[f626]) ).
fof(f421,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/benchmark/theBenchmark.p',ax16) ).
fof(f725,plain,
( ~ spl54_3
| spl54_23
| ~ spl54_4 ),
inference(avatar_split_clause,[],[f706,f610,f723,f606]) ).
fof(f610,plain,
( spl54_4
<=> ! [X0,X1] :
( sK49 != app(cons(X0,nil),X1)
| ~ ssList(cons(X0,nil))
| ~ ssItem(X0)
| ~ ssList(X1)
| memberP(nil,sK53(X0,nil,X1)) ) ),
introduced(avatar_definition,[new_symbols(naming,[spl54_4])]) ).
fof(f706,plain,
( ! [X0,X1] :
( ~ ssItem(X0)
| ~ ssList(nil)
| sK49 != app(cons(X0,nil),X1)
| ~ ssList(X1)
| memberP(nil,sK53(X0,nil,X1)) )
| ~ spl54_4 ),
inference(duplicate_literal_removal,[],[f703]) ).
fof(f703,plain,
( ! [X0,X1] :
( ~ ssItem(X0)
| ~ ssList(nil)
| sK49 != app(cons(X0,nil),X1)
| ~ ssItem(X0)
| ~ ssList(X1)
| memberP(nil,sK53(X0,nil,X1)) )
| ~ spl54_4 ),
inference(resolution,[],[f421,f611]) ).
fof(f611,plain,
( ! [X0,X1] :
( ~ ssList(cons(X0,nil))
| sK49 != app(cons(X0,nil),X1)
| ~ ssItem(X0)
| ~ ssList(X1)
| memberP(nil,sK53(X0,nil,X1)) )
| ~ spl54_4 ),
inference(avatar_component_clause,[],[f610]) ).
fof(f684,plain,
spl54_11,
inference(avatar_contradiction_clause,[],[f683]) ).
fof(f683,plain,
( $false
| spl54_11 ),
inference(resolution,[],[f651,f531]) ).
fof(f531,plain,
ssList(sK49),
inference(cnf_transformation,[],[f338]) ).
fof(f338,plain,
( ( nil != sK49
| nil = sK50 )
& ! [X6] :
( ! [X7] :
( ! [X8] :
( ! [X9] :
( ~ lt(X8,X6)
| app(X9,cons(X8,nil)) != sK49
| ~ ssList(X9) )
| ~ ssItem(X8) )
| app(cons(X6,nil),X7) != sK52
| ~ ssList(X7) )
| ~ ssItem(X6) )
& ! [X10] :
( ! [X11] :
( ! [X12] :
( ! [X13] :
( ~ lt(X10,X12)
| app(cons(X12,nil),X13) != sK49
| ~ ssList(X13) )
| ~ ssItem(X12) )
| app(X11,cons(X10,nil)) != sK51
| ~ ssList(X11) )
| ~ ssItem(X10) )
& strictorderedP(sK49)
& sK50 = app(app(sK51,sK49),sK52)
& ssList(sK52)
& ssList(sK51)
& ! [X14] :
( ! [X15] :
( ! [X16] :
( ( ~ leq(X14,sK53(X14,X15,X16))
& lt(X14,sK53(X14,X15,X16))
& memberP(X16,sK53(X14,X15,X16))
& memberP(X15,sK53(X14,X15,X16))
& ssItem(sK53(X14,X15,X16)) )
| app(app(X15,cons(X14,nil)),X16) != sK47
| ~ ssList(X16) )
| ~ ssList(X15) )
| ~ ssItem(X14) )
& nil != sK47
& 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])],[f222,f337,f336,f335,f334,f333,f332,f331]) ).
fof(f331,plain,
( ? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( nil != X2
| nil = X3 )
& ? [X4] :
( ? [X5] :
( ! [X6] :
( ! [X7] :
( ! [X8] :
( ! [X9] :
( ~ lt(X8,X6)
| app(X9,cons(X8,nil)) != X2
| ~ ssList(X9) )
| ~ ssItem(X8) )
| app(cons(X6,nil),X7) != X5
| ~ ssList(X7) )
| ~ ssItem(X6) )
& ! [X10] :
( ! [X11] :
( ! [X12] :
( ! [X13] :
( ~ lt(X10,X12)
| app(cons(X12,nil),X13) != X2
| ~ ssList(X13) )
| ~ ssItem(X12) )
| app(X11,cons(X10,nil)) != X4
| ~ ssList(X11) )
| ~ ssItem(X10) )
& strictorderedP(X2)
& app(app(X4,X2),X5) = X3
& ssList(X5) )
& ssList(X4) )
& ! [X14] :
( ! [X15] :
( ! [X16] :
( ? [X17] :
( ~ leq(X14,X17)
& lt(X14,X17)
& memberP(X16,X17)
& memberP(X15,X17)
& ssItem(X17) )
| app(app(X15,cons(X14,nil)),X16) != X0
| ~ ssList(X16) )
| ~ ssList(X15) )
| ~ ssItem(X14) )
& nil != X0
& X0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) )
=> ( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( nil != X2
| nil = X3 )
& ? [X4] :
( ? [X5] :
( ! [X6] :
( ! [X7] :
( ! [X8] :
( ! [X9] :
( ~ lt(X8,X6)
| app(X9,cons(X8,nil)) != X2
| ~ ssList(X9) )
| ~ ssItem(X8) )
| app(cons(X6,nil),X7) != X5
| ~ ssList(X7) )
| ~ ssItem(X6) )
& ! [X10] :
( ! [X11] :
( ! [X12] :
( ! [X13] :
( ~ lt(X10,X12)
| app(cons(X12,nil),X13) != X2
| ~ ssList(X13) )
| ~ ssItem(X12) )
| app(X11,cons(X10,nil)) != X4
| ~ ssList(X11) )
| ~ ssItem(X10) )
& strictorderedP(X2)
& app(app(X4,X2),X5) = X3
& ssList(X5) )
& ssList(X4) )
& ! [X14] :
( ! [X15] :
( ! [X16] :
( ? [X17] :
( ~ leq(X14,X17)
& lt(X14,X17)
& memberP(X16,X17)
& memberP(X15,X17)
& ssItem(X17) )
| app(app(X15,cons(X14,nil)),X16) != sK47
| ~ ssList(X16) )
| ~ ssList(X15) )
| ~ ssItem(X14) )
& nil != sK47
& sK47 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(sK47) ) ),
introduced(choice_axiom,[]) ).
fof(f332,plain,
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( nil != X2
| nil = X3 )
& ? [X4] :
( ? [X5] :
( ! [X6] :
( ! [X7] :
( ! [X8] :
( ! [X9] :
( ~ lt(X8,X6)
| app(X9,cons(X8,nil)) != X2
| ~ ssList(X9) )
| ~ ssItem(X8) )
| app(cons(X6,nil),X7) != X5
| ~ ssList(X7) )
| ~ ssItem(X6) )
& ! [X10] :
( ! [X11] :
( ! [X12] :
( ! [X13] :
( ~ lt(X10,X12)
| app(cons(X12,nil),X13) != X2
| ~ ssList(X13) )
| ~ ssItem(X12) )
| app(X11,cons(X10,nil)) != X4
| ~ ssList(X11) )
| ~ ssItem(X10) )
& strictorderedP(X2)
& app(app(X4,X2),X5) = X3
& ssList(X5) )
& ssList(X4) )
& ! [X14] :
( ! [X15] :
( ! [X16] :
( ? [X17] :
( ~ leq(X14,X17)
& lt(X14,X17)
& memberP(X16,X17)
& memberP(X15,X17)
& ssItem(X17) )
| app(app(X15,cons(X14,nil)),X16) != sK47
| ~ ssList(X16) )
| ~ ssList(X15) )
| ~ ssItem(X14) )
& nil != sK47
& sK47 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
=> ( ? [X2] :
( ? [X3] :
( ( nil != X2
| nil = X3 )
& ? [X4] :
( ? [X5] :
( ! [X6] :
( ! [X7] :
( ! [X8] :
( ! [X9] :
( ~ lt(X8,X6)
| app(X9,cons(X8,nil)) != X2
| ~ ssList(X9) )
| ~ ssItem(X8) )
| app(cons(X6,nil),X7) != X5
| ~ ssList(X7) )
| ~ ssItem(X6) )
& ! [X10] :
( ! [X11] :
( ! [X12] :
( ! [X13] :
( ~ lt(X10,X12)
| app(cons(X12,nil),X13) != X2
| ~ ssList(X13) )
| ~ ssItem(X12) )
| app(X11,cons(X10,nil)) != X4
| ~ ssList(X11) )
| ~ ssItem(X10) )
& strictorderedP(X2)
& app(app(X4,X2),X5) = X3
& ssList(X5) )
& ssList(X4) )
& ! [X14] :
( ! [X15] :
( ! [X16] :
( ? [X17] :
( ~ leq(X14,X17)
& lt(X14,X17)
& memberP(X16,X17)
& memberP(X15,X17)
& ssItem(X17) )
| app(app(X15,cons(X14,nil)),X16) != sK47
| ~ ssList(X16) )
| ~ ssList(X15) )
| ~ ssItem(X14) )
& nil != sK47
& sK47 = X2
& sK48 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(sK48) ) ),
introduced(choice_axiom,[]) ).
fof(f333,plain,
( ? [X2] :
( ? [X3] :
( ( nil != X2
| nil = X3 )
& ? [X4] :
( ? [X5] :
( ! [X6] :
( ! [X7] :
( ! [X8] :
( ! [X9] :
( ~ lt(X8,X6)
| app(X9,cons(X8,nil)) != X2
| ~ ssList(X9) )
| ~ ssItem(X8) )
| app(cons(X6,nil),X7) != X5
| ~ ssList(X7) )
| ~ ssItem(X6) )
& ! [X10] :
( ! [X11] :
( ! [X12] :
( ! [X13] :
( ~ lt(X10,X12)
| app(cons(X12,nil),X13) != X2
| ~ ssList(X13) )
| ~ ssItem(X12) )
| app(X11,cons(X10,nil)) != X4
| ~ ssList(X11) )
| ~ ssItem(X10) )
& strictorderedP(X2)
& app(app(X4,X2),X5) = X3
& ssList(X5) )
& ssList(X4) )
& ! [X14] :
( ! [X15] :
( ! [X16] :
( ? [X17] :
( ~ leq(X14,X17)
& lt(X14,X17)
& memberP(X16,X17)
& memberP(X15,X17)
& ssItem(X17) )
| app(app(X15,cons(X14,nil)),X16) != sK47
| ~ ssList(X16) )
| ~ ssList(X15) )
| ~ ssItem(X14) )
& nil != sK47
& sK47 = X2
& sK48 = X3
& ssList(X3) )
& ssList(X2) )
=> ( ? [X3] :
( ( nil != sK49
| nil = X3 )
& ? [X4] :
( ? [X5] :
( ! [X6] :
( ! [X7] :
( ! [X8] :
( ! [X9] :
( ~ lt(X8,X6)
| app(X9,cons(X8,nil)) != sK49
| ~ ssList(X9) )
| ~ ssItem(X8) )
| app(cons(X6,nil),X7) != X5
| ~ ssList(X7) )
| ~ ssItem(X6) )
& ! [X10] :
( ! [X11] :
( ! [X12] :
( ! [X13] :
( ~ lt(X10,X12)
| app(cons(X12,nil),X13) != sK49
| ~ ssList(X13) )
| ~ ssItem(X12) )
| app(X11,cons(X10,nil)) != X4
| ~ ssList(X11) )
| ~ ssItem(X10) )
& strictorderedP(sK49)
& app(app(X4,sK49),X5) = X3
& ssList(X5) )
& ssList(X4) )
& ! [X14] :
( ! [X15] :
( ! [X16] :
( ? [X17] :
( ~ leq(X14,X17)
& lt(X14,X17)
& memberP(X16,X17)
& memberP(X15,X17)
& ssItem(X17) )
| app(app(X15,cons(X14,nil)),X16) != sK47
| ~ ssList(X16) )
| ~ ssList(X15) )
| ~ ssItem(X14) )
& nil != sK47
& sK47 = sK49
& sK48 = X3
& ssList(X3) )
& ssList(sK49) ) ),
introduced(choice_axiom,[]) ).
fof(f334,plain,
( ? [X3] :
( ( nil != sK49
| nil = X3 )
& ? [X4] :
( ? [X5] :
( ! [X6] :
( ! [X7] :
( ! [X8] :
( ! [X9] :
( ~ lt(X8,X6)
| app(X9,cons(X8,nil)) != sK49
| ~ ssList(X9) )
| ~ ssItem(X8) )
| app(cons(X6,nil),X7) != X5
| ~ ssList(X7) )
| ~ ssItem(X6) )
& ! [X10] :
( ! [X11] :
( ! [X12] :
( ! [X13] :
( ~ lt(X10,X12)
| app(cons(X12,nil),X13) != sK49
| ~ ssList(X13) )
| ~ ssItem(X12) )
| app(X11,cons(X10,nil)) != X4
| ~ ssList(X11) )
| ~ ssItem(X10) )
& strictorderedP(sK49)
& app(app(X4,sK49),X5) = X3
& ssList(X5) )
& ssList(X4) )
& ! [X14] :
( ! [X15] :
( ! [X16] :
( ? [X17] :
( ~ leq(X14,X17)
& lt(X14,X17)
& memberP(X16,X17)
& memberP(X15,X17)
& ssItem(X17) )
| app(app(X15,cons(X14,nil)),X16) != sK47
| ~ ssList(X16) )
| ~ ssList(X15) )
| ~ ssItem(X14) )
& nil != sK47
& sK47 = sK49
& sK48 = X3
& ssList(X3) )
=> ( ( nil != sK49
| nil = sK50 )
& ? [X4] :
( ? [X5] :
( ! [X6] :
( ! [X7] :
( ! [X8] :
( ! [X9] :
( ~ lt(X8,X6)
| app(X9,cons(X8,nil)) != sK49
| ~ ssList(X9) )
| ~ ssItem(X8) )
| app(cons(X6,nil),X7) != X5
| ~ ssList(X7) )
| ~ ssItem(X6) )
& ! [X10] :
( ! [X11] :
( ! [X12] :
( ! [X13] :
( ~ lt(X10,X12)
| app(cons(X12,nil),X13) != sK49
| ~ ssList(X13) )
| ~ ssItem(X12) )
| app(X11,cons(X10,nil)) != X4
| ~ ssList(X11) )
| ~ ssItem(X10) )
& strictorderedP(sK49)
& app(app(X4,sK49),X5) = sK50
& ssList(X5) )
& ssList(X4) )
& ! [X14] :
( ! [X15] :
( ! [X16] :
( ? [X17] :
( ~ leq(X14,X17)
& lt(X14,X17)
& memberP(X16,X17)
& memberP(X15,X17)
& ssItem(X17) )
| app(app(X15,cons(X14,nil)),X16) != sK47
| ~ ssList(X16) )
| ~ ssList(X15) )
| ~ ssItem(X14) )
& nil != sK47
& sK47 = sK49
& sK48 = sK50
& ssList(sK50) ) ),
introduced(choice_axiom,[]) ).
fof(f335,plain,
( ? [X4] :
( ? [X5] :
( ! [X6] :
( ! [X7] :
( ! [X8] :
( ! [X9] :
( ~ lt(X8,X6)
| app(X9,cons(X8,nil)) != sK49
| ~ ssList(X9) )
| ~ ssItem(X8) )
| app(cons(X6,nil),X7) != X5
| ~ ssList(X7) )
| ~ ssItem(X6) )
& ! [X10] :
( ! [X11] :
( ! [X12] :
( ! [X13] :
( ~ lt(X10,X12)
| app(cons(X12,nil),X13) != sK49
| ~ ssList(X13) )
| ~ ssItem(X12) )
| app(X11,cons(X10,nil)) != X4
| ~ ssList(X11) )
| ~ ssItem(X10) )
& strictorderedP(sK49)
& app(app(X4,sK49),X5) = sK50
& ssList(X5) )
& ssList(X4) )
=> ( ? [X5] :
( ! [X6] :
( ! [X7] :
( ! [X8] :
( ! [X9] :
( ~ lt(X8,X6)
| app(X9,cons(X8,nil)) != sK49
| ~ ssList(X9) )
| ~ ssItem(X8) )
| app(cons(X6,nil),X7) != X5
| ~ ssList(X7) )
| ~ ssItem(X6) )
& ! [X10] :
( ! [X11] :
( ! [X12] :
( ! [X13] :
( ~ lt(X10,X12)
| app(cons(X12,nil),X13) != sK49
| ~ ssList(X13) )
| ~ ssItem(X12) )
| app(X11,cons(X10,nil)) != sK51
| ~ ssList(X11) )
| ~ ssItem(X10) )
& strictorderedP(sK49)
& sK50 = app(app(sK51,sK49),X5)
& ssList(X5) )
& ssList(sK51) ) ),
introduced(choice_axiom,[]) ).
fof(f336,plain,
( ? [X5] :
( ! [X6] :
( ! [X7] :
( ! [X8] :
( ! [X9] :
( ~ lt(X8,X6)
| app(X9,cons(X8,nil)) != sK49
| ~ ssList(X9) )
| ~ ssItem(X8) )
| app(cons(X6,nil),X7) != X5
| ~ ssList(X7) )
| ~ ssItem(X6) )
& ! [X10] :
( ! [X11] :
( ! [X12] :
( ! [X13] :
( ~ lt(X10,X12)
| app(cons(X12,nil),X13) != sK49
| ~ ssList(X13) )
| ~ ssItem(X12) )
| app(X11,cons(X10,nil)) != sK51
| ~ ssList(X11) )
| ~ ssItem(X10) )
& strictorderedP(sK49)
& sK50 = app(app(sK51,sK49),X5)
& ssList(X5) )
=> ( ! [X6] :
( ! [X7] :
( ! [X8] :
( ! [X9] :
( ~ lt(X8,X6)
| app(X9,cons(X8,nil)) != sK49
| ~ ssList(X9) )
| ~ ssItem(X8) )
| app(cons(X6,nil),X7) != sK52
| ~ ssList(X7) )
| ~ ssItem(X6) )
& ! [X10] :
( ! [X11] :
( ! [X12] :
( ! [X13] :
( ~ lt(X10,X12)
| app(cons(X12,nil),X13) != sK49
| ~ ssList(X13) )
| ~ ssItem(X12) )
| app(X11,cons(X10,nil)) != sK51
| ~ ssList(X11) )
| ~ ssItem(X10) )
& strictorderedP(sK49)
& sK50 = app(app(sK51,sK49),sK52)
& ssList(sK52) ) ),
introduced(choice_axiom,[]) ).
fof(f337,plain,
! [X14,X15,X16] :
( ? [X17] :
( ~ leq(X14,X17)
& lt(X14,X17)
& memberP(X16,X17)
& memberP(X15,X17)
& ssItem(X17) )
=> ( ~ leq(X14,sK53(X14,X15,X16))
& lt(X14,sK53(X14,X15,X16))
& memberP(X16,sK53(X14,X15,X16))
& memberP(X15,sK53(X14,X15,X16))
& ssItem(sK53(X14,X15,X16)) ) ),
introduced(choice_axiom,[]) ).
fof(f222,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( nil != X2
| nil = X3 )
& ? [X4] :
( ? [X5] :
( ! [X6] :
( ! [X7] :
( ! [X8] :
( ! [X9] :
( ~ lt(X8,X6)
| app(X9,cons(X8,nil)) != X2
| ~ ssList(X9) )
| ~ ssItem(X8) )
| app(cons(X6,nil),X7) != X5
| ~ ssList(X7) )
| ~ ssItem(X6) )
& ! [X10] :
( ! [X11] :
( ! [X12] :
( ! [X13] :
( ~ lt(X10,X12)
| app(cons(X12,nil),X13) != X2
| ~ ssList(X13) )
| ~ ssItem(X12) )
| app(X11,cons(X10,nil)) != X4
| ~ ssList(X11) )
| ~ ssItem(X10) )
& strictorderedP(X2)
& app(app(X4,X2),X5) = X3
& ssList(X5) )
& ssList(X4) )
& ! [X14] :
( ! [X15] :
( ! [X16] :
( ? [X17] :
( ~ leq(X14,X17)
& lt(X14,X17)
& memberP(X16,X17)
& memberP(X15,X17)
& ssItem(X17) )
| app(app(X15,cons(X14,nil)),X16) != X0
| ~ ssList(X16) )
| ~ ssList(X15) )
| ~ ssItem(X14) )
& nil != X0
& 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 = X2
& nil != X3 )
| ! [X4] :
( ssList(X4)
=> ! [X5] :
( ? [X6] :
( ? [X7] :
( ? [X8] :
( ? [X9] :
( lt(X8,X6)
& app(X9,cons(X8,nil)) = X2
& ssList(X9) )
& ssItem(X8) )
& app(cons(X6,nil),X7) = X5
& ssList(X7) )
& ssItem(X6) )
| ? [X10] :
( ? [X11] :
( ? [X12] :
( ? [X13] :
( lt(X10,X12)
& app(cons(X12,nil),X13) = X2
& ssList(X13) )
& ssItem(X12) )
& app(X11,cons(X10,nil)) = X4
& ssList(X11) )
& ssItem(X10) )
| ~ strictorderedP(X2)
| app(app(X4,X2),X5) != X3
| ~ ssList(X5) ) )
| ? [X14] :
( ? [X15] :
( ? [X16] :
( ! [X17] :
( leq(X14,X17)
| ~ lt(X14,X17)
| ~ memberP(X16,X17)
| ~ memberP(X15,X17)
| ~ ssItem(X17) )
& app(app(X15,cons(X14,nil)),X16) = X0
& ssList(X16) )
& ssList(X15) )
& ssItem(X14) )
| nil = X0
| X0 != X2
| X1 != X3
| ~ ssList(X3) ) ) ) ),
inference(rectify,[],[f97]) ).
fof(f97,negated_conjecture,
~ ! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ( nil = X2
& nil != X3 )
| ! [X8] :
( ssList(X8)
=> ! [X9] :
( ? [X14] :
( ? [X15] :
( ? [X16] :
( ? [X17] :
( lt(X16,X14)
& app(X17,cons(X16,nil)) = X2
& ssList(X17) )
& ssItem(X16) )
& app(cons(X14,nil),X15) = X9
& ssList(X15) )
& ssItem(X14) )
| ? [X10] :
( ? [X11] :
( ? [X12] :
( ? [X13] :
( lt(X10,X12)
& app(cons(X12,nil),X13) = X2
& ssList(X13) )
& ssItem(X12) )
& app(X11,cons(X10,nil)) = X8
& ssList(X11) )
& ssItem(X10) )
| ~ strictorderedP(X2)
| app(app(X8,X2),X9) != X3
| ~ ssList(X9) ) )
| ? [X4] :
( ? [X5] :
( ? [X6] :
( ! [X7] :
( leq(X4,X7)
| ~ lt(X4,X7)
| ~ memberP(X6,X7)
| ~ memberP(X5,X7)
| ~ ssItem(X7) )
& app(app(X5,cons(X4,nil)),X6) = X0
& ssList(X6) )
& ssList(X5) )
& ssItem(X4) )
| nil = X0
| X0 != X2
| X1 != X3
| ~ ssList(X3) ) ) ) ),
inference(negated_conjecture,[],[f96]) ).
fof(f96,conjecture,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ( nil = X2
& nil != X3 )
| ! [X8] :
( ssList(X8)
=> ! [X9] :
( ? [X14] :
( ? [X15] :
( ? [X16] :
( ? [X17] :
( lt(X16,X14)
& app(X17,cons(X16,nil)) = X2
& ssList(X17) )
& ssItem(X16) )
& app(cons(X14,nil),X15) = X9
& ssList(X15) )
& ssItem(X14) )
| ? [X10] :
( ? [X11] :
( ? [X12] :
( ? [X13] :
( lt(X10,X12)
& app(cons(X12,nil),X13) = X2
& ssList(X13) )
& ssItem(X12) )
& app(X11,cons(X10,nil)) = X8
& ssList(X11) )
& ssItem(X10) )
| ~ strictorderedP(X2)
| app(app(X8,X2),X9) != X3
| ~ ssList(X9) ) )
| ? [X4] :
( ? [X5] :
( ? [X6] :
( ! [X7] :
( leq(X4,X7)
| ~ lt(X4,X7)
| ~ memberP(X6,X7)
| ~ memberP(X5,X7)
| ~ ssItem(X7) )
& app(app(X5,cons(X4,nil)),X6) = X0
& ssList(X6) )
& ssList(X5) )
& ssItem(X4) )
| nil = X0
| X0 != X2
| X1 != X3
| ~ ssList(X3) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1) ).
fof(f651,plain,
( ~ ssList(sK49)
| spl54_11 ),
inference(avatar_component_clause,[],[f649]) ).
fof(f630,plain,
spl54_3,
inference(avatar_contradiction_clause,[],[f629]) ).
fof(f629,plain,
( $false
| spl54_3 ),
inference(resolution,[],[f608,f422]) ).
fof(f422,plain,
ssList(nil),
inference(cnf_transformation,[],[f17]) ).
fof(f17,axiom,
ssList(nil),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax17) ).
fof(f608,plain,
( ~ ssList(nil)
| spl54_3 ),
inference(avatar_component_clause,[],[f606]) ).
fof(f628,plain,
( ~ spl54_3
| spl54_8 ),
inference(avatar_split_clause,[],[f604,f626,f606]) ).
fof(f604,plain,
! [X0,X1] :
( sK49 != app(cons(X0,nil),X1)
| ssItem(sK53(X0,nil,X1))
| ~ ssList(X1)
| ~ ssList(nil)
| ~ ssItem(X0)
| ~ ssList(cons(X0,nil)) ),
inference(superposition,[],[f552,f436]) ).
fof(f436,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/sandbox/benchmark/theBenchmark.p',ax28) ).
fof(f552,plain,
! [X16,X14,X15] :
( app(app(X15,cons(X14,nil)),X16) != sK49
| ssItem(sK53(X14,X15,X16))
| ~ ssList(X16)
| ~ ssList(X15)
| ~ ssItem(X14) ),
inference(definition_unfolding,[],[f536,f534]) ).
fof(f534,plain,
sK47 = sK49,
inference(cnf_transformation,[],[f338]) ).
fof(f536,plain,
! [X16,X14,X15] :
( ssItem(sK53(X14,X15,X16))
| app(app(X15,cons(X14,nil)),X16) != sK47
| ~ ssList(X16)
| ~ ssList(X15)
| ~ ssItem(X14) ),
inference(cnf_transformation,[],[f338]) ).
fof(f612,plain,
( ~ spl54_3
| spl54_4 ),
inference(avatar_split_clause,[],[f600,f610,f606]) ).
fof(f600,plain,
! [X0,X1] :
( sK49 != app(cons(X0,nil),X1)
| memberP(nil,sK53(X0,nil,X1))
| ~ ssList(X1)
| ~ ssList(nil)
| ~ ssItem(X0)
| ~ ssList(cons(X0,nil)) ),
inference(superposition,[],[f551,f436]) ).
fof(f551,plain,
! [X16,X14,X15] :
( app(app(X15,cons(X14,nil)),X16) != sK49
| memberP(X15,sK53(X14,X15,X16))
| ~ ssList(X16)
| ~ ssList(X15)
| ~ ssItem(X14) ),
inference(definition_unfolding,[],[f537,f534]) ).
fof(f537,plain,
! [X16,X14,X15] :
( memberP(X15,sK53(X14,X15,X16))
| app(app(X15,cons(X14,nil)),X16) != sK47
| ~ ssList(X16)
| ~ ssList(X15)
| ~ ssItem(X14) ),
inference(cnf_transformation,[],[f338]) ).
fof(f599,plain,
~ spl54_2,
inference(avatar_split_clause,[],[f553,f595]) ).
fof(f553,plain,
nil != sK49,
inference(definition_unfolding,[],[f535,f534]) ).
fof(f535,plain,
nil != sK47,
inference(cnf_transformation,[],[f338]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SWC251+1 : TPTP v8.2.0. Released v2.4.0.
% 0.07/0.13 % Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% 0.13/0.34 % Computer : n017.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 02:55:38 EDT 2024
% 0.13/0.34 % CPUTime :
% 0.13/0.34 This is a FOF_THM_RFO_SEQ problem
% 0.13/0.35 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/benchmark/theBenchmark.p
% 0.55/0.72 % (3924)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.55/0.72 % (3922)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.55/0.72 % (3923)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.55/0.72 % (3917)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.55/0.72 % (3918)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.55/0.72 % (3921)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.55/0.73 % (3920)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.55/0.73 % (3919)lrs+1011_1:1_sil=8000:sp=occurrence:nwc=10.0:i=78:ss=axioms:sgt=8_0 on theBenchmark for (2996ds/78Mi)
% 0.55/0.74 % (3924)Instruction limit reached!
% 0.55/0.74 % (3924)------------------------------
% 0.55/0.74 % (3924)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.55/0.74 % (3924)Termination reason: Unknown
% 0.55/0.74 % (3924)Termination phase: Saturation
% 0.55/0.74
% 0.55/0.74 % (3924)Memory used [KB]: 1743
% 0.55/0.74 % (3924)Time elapsed: 0.019 s
% 0.55/0.74 % (3924)Instructions burned: 56 (million)
% 0.55/0.74 % (3924)------------------------------
% 0.55/0.74 % (3924)------------------------------
% 0.55/0.74 % (3925)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 (2996ds/55Mi)
% 0.55/0.74 % (3917)Instruction limit reached!
% 0.55/0.74 % (3917)------------------------------
% 0.55/0.74 % (3917)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.55/0.74 % (3917)Termination reason: Unknown
% 0.55/0.74 % (3917)Termination phase: Saturation
% 0.55/0.74
% 0.55/0.74 % (3917)Memory used [KB]: 1566
% 0.55/0.74 % (3917)Time elapsed: 0.022 s
% 0.55/0.74 % (3917)Instructions burned: 34 (million)
% 0.55/0.74 % (3917)------------------------------
% 0.55/0.74 % (3917)------------------------------
% 0.55/0.74 % (3921)Instruction limit reached!
% 0.55/0.74 % (3921)------------------------------
% 0.55/0.74 % (3921)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.55/0.74 % (3921)Termination reason: Unknown
% 0.55/0.74 % (3921)Termination phase: Saturation
% 0.55/0.74
% 0.55/0.74 % (3921)Memory used [KB]: 1946
% 0.55/0.74 % (3921)Time elapsed: 0.017 s
% 0.55/0.74 % (3921)Instructions burned: 35 (million)
% 0.55/0.74 % (3921)------------------------------
% 0.55/0.74 % (3921)------------------------------
% 0.55/0.74 % (3922)Instruction limit reached!
% 0.55/0.74 % (3922)------------------------------
% 0.55/0.74 % (3922)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.55/0.74 % (3922)Termination reason: Unknown
% 0.55/0.74 % (3922)Termination phase: Saturation
% 0.55/0.74
% 0.55/0.74 % (3922)Memory used [KB]: 1650
% 0.55/0.74 % (3922)Time elapsed: 0.026 s
% 0.55/0.74 % (3922)Instructions burned: 47 (million)
% 0.55/0.74 % (3922)------------------------------
% 0.55/0.74 % (3922)------------------------------
% 0.55/0.75 % (3926)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 (2996ds/50Mi)
% 0.55/0.75 % (3927)lrs+1010_1:2_sil=4000:tgt=ground:nwc=10.0:st=2.0:i=208:sd=1:bd=off:ss=axioms_0 on theBenchmark for (2996ds/208Mi)
% 0.55/0.75 % (3920)Instruction limit reached!
% 0.55/0.75 % (3920)------------------------------
% 0.55/0.75 % (3920)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.55/0.75 % (3920)Termination reason: Unknown
% 0.55/0.75 % (3920)Termination phase: Saturation
% 0.55/0.75
% 0.55/0.75 % (3920)Memory used [KB]: 1757
% 0.55/0.75 % (3920)Time elapsed: 0.020 s
% 0.55/0.75 % (3920)Instructions burned: 33 (million)
% 0.55/0.75 % (3920)------------------------------
% 0.55/0.75 % (3920)------------------------------
% 0.55/0.75 % (3918)First to succeed.
% 0.55/0.75 % (3929)lrs-1010_1:1_to=lpo:sil=2000:sp=reverse_arity:sos=on:urr=ec_only:i=518:sd=2:bd=off:ss=axioms:sgt=16_0 on theBenchmark for (2996ds/518Mi)
% 0.55/0.75 % (3918)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-3916"
% 0.55/0.76 % (3928)lrs-1011_1:1_sil=4000:plsq=on:plsqr=32,1:sp=frequency:plsql=on:nwc=10.0:i=52:aac=none:afr=on:ss=axioms:er=filter:sgt=16:rawr=on:etr=on:lma=on_0 on theBenchmark for (2996ds/52Mi)
% 0.55/0.76 % (3918)Refutation found. Thanks to Tanya!
% 0.55/0.76 % SZS status Theorem for theBenchmark
% 0.55/0.76 % SZS output start Proof for theBenchmark
% See solution above
% 0.55/0.76 % (3918)------------------------------
% 0.55/0.76 % (3918)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.55/0.76 % (3918)Termination reason: Refutation
% 0.55/0.76
% 0.55/0.76 % (3918)Memory used [KB]: 1571
% 0.55/0.76 % (3918)Time elapsed: 0.021 s
% 0.55/0.76 % (3918)Instructions burned: 34 (million)
% 0.55/0.76 % (3916)Success in time 0.404 s
% 0.55/0.76 % Vampire---4.8 exiting
%------------------------------------------------------------------------------