TSTP Solution File: SWC236+1 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SWC236+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 : n021.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 04:00:47 EDT 2024
% Result : Theorem 0.61s 0.82s
% Output : Refutation 0.61s
% Verified :
% SZS Type : Refutation
% Derivation depth : 17
% Number of leaves : 23
% Syntax : Number of formulae : 87 ( 10 unt; 0 def)
% Number of atoms : 862 ( 241 equ)
% Maximal formula atoms : 72 ( 9 avg)
% Number of connectives : 1278 ( 503 ~; 454 |; 277 &)
% ( 7 <=>; 37 =>; 0 <=; 0 <~>)
% Maximal formula depth : 27 ( 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 : 365 ( 263 !; 102 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f853,plain,
$false,
inference(avatar_sat_refutation,[],[f600,f613,f629,f631,f685,f726,f730,f852]) ).
fof(f852,plain,
( ~ spl54_11
| spl54_2
| ~ spl54_23
| ~ spl54_24 ),
inference(avatar_split_clause,[],[f851,f728,f724,f596,f650]) ).
fof(f650,plain,
( spl54_11
<=> ssList(sK49) ),
introduced(avatar_definition,[new_symbols(naming,[spl54_11])]) ).
fof(f596,plain,
( spl54_2
<=> nil = sK49 ),
introduced(avatar_definition,[new_symbols(naming,[spl54_2])]) ).
fof(f724,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(f728,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(f851,plain,
( nil = sK49
| ~ ssList(sK49)
| ~ spl54_23
| ~ spl54_24 ),
inference(equality_resolution,[],[f850]) ).
fof(f850,plain,
( ! [X0] :
( sK49 != X0
| nil = X0
| ~ ssList(X0) )
| ~ spl54_23
| ~ spl54_24 ),
inference(duplicate_literal_removal,[],[f849]) ).
fof(f849,plain,
( ! [X0] :
( sK49 != X0
| nil = X0
| ~ ssList(X0)
| nil = X0
| ~ ssList(X0) )
| ~ spl54_23
| ~ spl54_24 ),
inference(resolution,[],[f848,f428]) ).
fof(f428,plain,
! [X0] :
( ssItem(sK44(X0))
| nil = X0
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f308]) ).
fof(f308,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,f307,f306]) ).
fof(f306,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(f307,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/tmp/tmp.H32pw4m56N/Vampire---4.8_14971',ax20) ).
fof(f848,plain,
( ! [X0] :
( ~ ssItem(sK44(X0))
| sK49 != X0
| nil = X0
| ~ ssList(X0) )
| ~ spl54_23
| ~ spl54_24 ),
inference(duplicate_literal_removal,[],[f847]) ).
fof(f847,plain,
( ! [X0] :
( ~ ssItem(sK44(X0))
| sK49 != X0
| nil = X0
| ~ ssList(X0)
| nil = X0
| ~ ssList(X0) )
| ~ spl54_23
| ~ spl54_24 ),
inference(resolution,[],[f845,f427]) ).
fof(f427,plain,
! [X0] :
( ssList(sK43(X0))
| nil = X0
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f308]) ).
fof(f845,plain,
( ! [X0] :
( ~ ssList(sK43(X0))
| ~ ssItem(sK44(X0))
| sK49 != X0
| nil = X0
| ~ ssList(X0) )
| ~ spl54_23
| ~ spl54_24 ),
inference(superposition,[],[f844,f429]) ).
fof(f429,plain,
! [X0] :
( cons(sK44(X0),sK43(X0)) = X0
| nil = X0
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f308]) ).
fof(f844,plain,
( ! [X0,X1] :
( cons(X0,X1) != sK49
| ~ ssItem(X0)
| ~ ssList(X1) )
| ~ spl54_23
| ~ spl54_24 ),
inference(duplicate_literal_removal,[],[f841]) ).
fof(f841,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,[],[f839,f511]) ).
fof(f511,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/tmp/tmp.H32pw4m56N/Vampire---4.8_14971',ax81) ).
fof(f839,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,[],[f836]) ).
fof(f836,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,[],[f835,f729]) ).
fof(f729,plain,
( ! [X0,X1] :
( ssItem(sK53(X0,nil,X1))
| ~ ssItem(X0)
| ~ ssList(X1)
| sK49 != app(cons(X0,nil),X1) )
| ~ spl54_24 ),
inference(avatar_component_clause,[],[f728]) ).
fof(f835,plain,
( ! [X0,X1] :
( ~ ssItem(sK53(X0,nil,X1))
| ~ ssList(X1)
| ~ ssItem(X0)
| cons(X0,X1) != sK49 )
| ~ spl54_23 ),
inference(duplicate_literal_removal,[],[f815]) ).
fof(f815,plain,
( ! [X0,X1] :
( cons(X0,X1) != sK49
| ~ ssList(X1)
| ~ ssItem(X0)
| ~ ssItem(sK53(X0,nil,X1))
| ~ ssItem(X0)
| ~ ssList(X1) )
| ~ spl54_23 ),
inference(superposition,[],[f734,f511]) ).
fof(f734,plain,
( ! [X0,X1] :
( sK49 != app(cons(X0,nil),X1)
| ~ ssList(X1)
| ~ ssItem(X0)
| ~ ssItem(sK53(X0,nil,X1)) )
| ~ spl54_23 ),
inference(resolution,[],[f725,f453]) ).
fof(f453,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/sandbox2/tmp/tmp.H32pw4m56N/Vampire---4.8_14971',ax38) ).
fof(f725,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,[],[f724]) ).
fof(f730,plain,
( ~ spl54_3
| spl54_24
| ~ spl54_8 ),
inference(avatar_split_clause,[],[f706,f627,f728,f607]) ).
fof(f607,plain,
( spl54_3
<=> ssList(nil) ),
introduced(avatar_definition,[new_symbols(naming,[spl54_3])]) ).
fof(f627,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(f706,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,[],[f705]) ).
fof(f705,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,[],[f422,f628]) ).
fof(f628,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,[],[f627]) ).
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.H32pw4m56N/Vampire---4.8_14971',ax16) ).
fof(f726,plain,
( ~ spl54_3
| spl54_23
| ~ spl54_4 ),
inference(avatar_split_clause,[],[f707,f611,f724,f607]) ).
fof(f611,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(f707,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,[],[f704]) ).
fof(f704,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,[],[f422,f612]) ).
fof(f612,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,[],[f611]) ).
fof(f685,plain,
spl54_11,
inference(avatar_contradiction_clause,[],[f684]) ).
fof(f684,plain,
( $false
| spl54_11 ),
inference(resolution,[],[f652,f532]) ).
fof(f532,plain,
ssList(sK49),
inference(cnf_transformation,[],[f339]) ).
fof(f339,plain,
( ( nil != sK49
| nil = sK50 )
& ! [X6] :
( ! [X7] :
( ! [X8] :
( ! [X9] :
( ~ leq(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] :
( ~ leq(X10,X12)
| app(cons(X12,nil),X13) != sK49
| ~ ssList(X13) )
| ~ ssItem(X12) )
| app(X11,cons(X10,nil)) != sK51
| ~ ssList(X11) )
| ~ ssItem(X10) )
& totalorderedP(sK49)
& sK50 = app(app(sK51,sK49),sK52)
& ssList(sK52)
& ssList(sK51)
& ! [X14] :
( ! [X15] :
( ! [X16] :
( ( ~ lt(X14,sK53(X14,X15,X16))
& leq(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])],[f223,f338,f337,f336,f335,f334,f333,f332]) ).
fof(f332,plain,
( ? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( nil != X2
| nil = X3 )
& ? [X4] :
( ? [X5] :
( ! [X6] :
( ! [X7] :
( ! [X8] :
( ! [X9] :
( ~ leq(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] :
( ~ leq(X10,X12)
| app(cons(X12,nil),X13) != X2
| ~ ssList(X13) )
| ~ ssItem(X12) )
| app(X11,cons(X10,nil)) != X4
| ~ ssList(X11) )
| ~ ssItem(X10) )
& totalorderedP(X2)
& app(app(X4,X2),X5) = X3
& ssList(X5) )
& ssList(X4) )
& ! [X14] :
( ! [X15] :
( ! [X16] :
( ? [X17] :
( ~ lt(X14,X17)
& leq(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] :
( ~ leq(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] :
( ~ leq(X10,X12)
| app(cons(X12,nil),X13) != X2
| ~ ssList(X13) )
| ~ ssItem(X12) )
| app(X11,cons(X10,nil)) != X4
| ~ ssList(X11) )
| ~ ssItem(X10) )
& totalorderedP(X2)
& app(app(X4,X2),X5) = X3
& ssList(X5) )
& ssList(X4) )
& ! [X14] :
( ! [X15] :
( ! [X16] :
( ? [X17] :
( ~ lt(X14,X17)
& leq(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(f333,plain,
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( nil != X2
| nil = X3 )
& ? [X4] :
( ? [X5] :
( ! [X6] :
( ! [X7] :
( ! [X8] :
( ! [X9] :
( ~ leq(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] :
( ~ leq(X10,X12)
| app(cons(X12,nil),X13) != X2
| ~ ssList(X13) )
| ~ ssItem(X12) )
| app(X11,cons(X10,nil)) != X4
| ~ ssList(X11) )
| ~ ssItem(X10) )
& totalorderedP(X2)
& app(app(X4,X2),X5) = X3
& ssList(X5) )
& ssList(X4) )
& ! [X14] :
( ! [X15] :
( ! [X16] :
( ? [X17] :
( ~ lt(X14,X17)
& leq(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] :
( ~ leq(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] :
( ~ leq(X10,X12)
| app(cons(X12,nil),X13) != X2
| ~ ssList(X13) )
| ~ ssItem(X12) )
| app(X11,cons(X10,nil)) != X4
| ~ ssList(X11) )
| ~ ssItem(X10) )
& totalorderedP(X2)
& app(app(X4,X2),X5) = X3
& ssList(X5) )
& ssList(X4) )
& ! [X14] :
( ! [X15] :
( ! [X16] :
( ? [X17] :
( ~ lt(X14,X17)
& leq(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(f334,plain,
( ? [X2] :
( ? [X3] :
( ( nil != X2
| nil = X3 )
& ? [X4] :
( ? [X5] :
( ! [X6] :
( ! [X7] :
( ! [X8] :
( ! [X9] :
( ~ leq(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] :
( ~ leq(X10,X12)
| app(cons(X12,nil),X13) != X2
| ~ ssList(X13) )
| ~ ssItem(X12) )
| app(X11,cons(X10,nil)) != X4
| ~ ssList(X11) )
| ~ ssItem(X10) )
& totalorderedP(X2)
& app(app(X4,X2),X5) = X3
& ssList(X5) )
& ssList(X4) )
& ! [X14] :
( ! [X15] :
( ! [X16] :
( ? [X17] :
( ~ lt(X14,X17)
& leq(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] :
( ~ leq(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] :
( ~ leq(X10,X12)
| app(cons(X12,nil),X13) != sK49
| ~ ssList(X13) )
| ~ ssItem(X12) )
| app(X11,cons(X10,nil)) != X4
| ~ ssList(X11) )
| ~ ssItem(X10) )
& totalorderedP(sK49)
& app(app(X4,sK49),X5) = X3
& ssList(X5) )
& ssList(X4) )
& ! [X14] :
( ! [X15] :
( ! [X16] :
( ? [X17] :
( ~ lt(X14,X17)
& leq(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(f335,plain,
( ? [X3] :
( ( nil != sK49
| nil = X3 )
& ? [X4] :
( ? [X5] :
( ! [X6] :
( ! [X7] :
( ! [X8] :
( ! [X9] :
( ~ leq(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] :
( ~ leq(X10,X12)
| app(cons(X12,nil),X13) != sK49
| ~ ssList(X13) )
| ~ ssItem(X12) )
| app(X11,cons(X10,nil)) != X4
| ~ ssList(X11) )
| ~ ssItem(X10) )
& totalorderedP(sK49)
& app(app(X4,sK49),X5) = X3
& ssList(X5) )
& ssList(X4) )
& ! [X14] :
( ! [X15] :
( ! [X16] :
( ? [X17] :
( ~ lt(X14,X17)
& leq(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] :
( ~ leq(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] :
( ~ leq(X10,X12)
| app(cons(X12,nil),X13) != sK49
| ~ ssList(X13) )
| ~ ssItem(X12) )
| app(X11,cons(X10,nil)) != X4
| ~ ssList(X11) )
| ~ ssItem(X10) )
& totalorderedP(sK49)
& app(app(X4,sK49),X5) = sK50
& ssList(X5) )
& ssList(X4) )
& ! [X14] :
( ! [X15] :
( ! [X16] :
( ? [X17] :
( ~ lt(X14,X17)
& leq(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(f336,plain,
( ? [X4] :
( ? [X5] :
( ! [X6] :
( ! [X7] :
( ! [X8] :
( ! [X9] :
( ~ leq(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] :
( ~ leq(X10,X12)
| app(cons(X12,nil),X13) != sK49
| ~ ssList(X13) )
| ~ ssItem(X12) )
| app(X11,cons(X10,nil)) != X4
| ~ ssList(X11) )
| ~ ssItem(X10) )
& totalorderedP(sK49)
& app(app(X4,sK49),X5) = sK50
& ssList(X5) )
& ssList(X4) )
=> ( ? [X5] :
( ! [X6] :
( ! [X7] :
( ! [X8] :
( ! [X9] :
( ~ leq(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] :
( ~ leq(X10,X12)
| app(cons(X12,nil),X13) != sK49
| ~ ssList(X13) )
| ~ ssItem(X12) )
| app(X11,cons(X10,nil)) != sK51
| ~ ssList(X11) )
| ~ ssItem(X10) )
& totalorderedP(sK49)
& sK50 = app(app(sK51,sK49),X5)
& ssList(X5) )
& ssList(sK51) ) ),
introduced(choice_axiom,[]) ).
fof(f337,plain,
( ? [X5] :
( ! [X6] :
( ! [X7] :
( ! [X8] :
( ! [X9] :
( ~ leq(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] :
( ~ leq(X10,X12)
| app(cons(X12,nil),X13) != sK49
| ~ ssList(X13) )
| ~ ssItem(X12) )
| app(X11,cons(X10,nil)) != sK51
| ~ ssList(X11) )
| ~ ssItem(X10) )
& totalorderedP(sK49)
& sK50 = app(app(sK51,sK49),X5)
& ssList(X5) )
=> ( ! [X6] :
( ! [X7] :
( ! [X8] :
( ! [X9] :
( ~ leq(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] :
( ~ leq(X10,X12)
| app(cons(X12,nil),X13) != sK49
| ~ ssList(X13) )
| ~ ssItem(X12) )
| app(X11,cons(X10,nil)) != sK51
| ~ ssList(X11) )
| ~ ssItem(X10) )
& totalorderedP(sK49)
& sK50 = app(app(sK51,sK49),sK52)
& ssList(sK52) ) ),
introduced(choice_axiom,[]) ).
fof(f338,plain,
! [X14,X15,X16] :
( ? [X17] :
( ~ lt(X14,X17)
& leq(X14,X17)
& memberP(X16,X17)
& memberP(X15,X17)
& ssItem(X17) )
=> ( ~ lt(X14,sK53(X14,X15,X16))
& leq(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(f223,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( nil != X2
| nil = X3 )
& ? [X4] :
( ? [X5] :
( ! [X6] :
( ! [X7] :
( ! [X8] :
( ! [X9] :
( ~ leq(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] :
( ~ leq(X10,X12)
| app(cons(X12,nil),X13) != X2
| ~ ssList(X13) )
| ~ ssItem(X12) )
| app(X11,cons(X10,nil)) != X4
| ~ ssList(X11) )
| ~ ssItem(X10) )
& totalorderedP(X2)
& app(app(X4,X2),X5) = X3
& ssList(X5) )
& ssList(X4) )
& ! [X14] :
( ! [X15] :
( ! [X16] :
( ? [X17] :
( ~ lt(X14,X17)
& leq(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(flattening,[],[f222]) ).
fof(f222,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( nil != X2
| nil = X3 )
& ? [X4] :
( ? [X5] :
( ! [X6] :
( ! [X7] :
( ! [X8] :
( ! [X9] :
( ~ leq(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] :
( ~ leq(X10,X12)
| app(cons(X12,nil),X13) != X2
| ~ ssList(X13) )
| ~ ssItem(X12) )
| app(X11,cons(X10,nil)) != X4
| ~ ssList(X11) )
| ~ ssItem(X10) )
& totalorderedP(X2)
& app(app(X4,X2),X5) = X3
& ssList(X5) )
& ssList(X4) )
& ! [X14] :
( ! [X15] :
( ! [X16] :
( ? [X17] :
( ~ lt(X14,X17)
& leq(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] :
( ssList(X3)
=> ( ( nil = X2
& nil != X3 )
| ! [X4] :
( ssList(X4)
=> ! [X5] :
( ssList(X5)
=> ( ? [X6] :
( ? [X7] :
( ? [X8] :
( ? [X9] :
( leq(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] :
( leq(X10,X12)
& app(cons(X12,nil),X13) = X2
& ssList(X13) )
& ssItem(X12) )
& app(X11,cons(X10,nil)) = X4
& ssList(X11) )
& ssItem(X10) )
| ~ totalorderedP(X2)
| app(app(X4,X2),X5) != X3 ) ) )
| ? [X14] :
( ? [X15] :
( ? [X16] :
( ! [X17] :
( ssItem(X17)
=> ( lt(X14,X17)
| ~ leq(X14,X17)
| ~ memberP(X16,X17)
| ~ memberP(X15,X17) ) )
& app(app(X15,cons(X14,nil)),X16) = X0
& ssList(X16) )
& ssList(X15) )
& ssItem(X14) )
| nil = X0
| X0 != X2
| X1 != X3 ) ) ) ) ),
inference(rectify,[],[f97]) ).
fof(f97,negated_conjecture,
~ ! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( ( nil = X2
& nil != X3 )
| ! [X8] :
( ssList(X8)
=> ! [X9] :
( ssList(X9)
=> ( ? [X14] :
( ? [X15] :
( ? [X16] :
( ? [X17] :
( leq(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] :
( leq(X10,X12)
& app(cons(X12,nil),X13) = X2
& ssList(X13) )
& ssItem(X12) )
& app(X11,cons(X10,nil)) = X8
& ssList(X11) )
& ssItem(X10) )
| ~ totalorderedP(X2)
| app(app(X8,X2),X9) != X3 ) ) )
| ? [X4] :
( ? [X5] :
( ? [X6] :
( ! [X7] :
( ssItem(X7)
=> ( lt(X4,X7)
| ~ leq(X4,X7)
| ~ memberP(X6,X7)
| ~ memberP(X5,X7) ) )
& app(app(X5,cons(X4,nil)),X6) = X0
& ssList(X6) )
& ssList(X5) )
& ssItem(X4) )
| nil = X0
| X0 != X2
| X1 != X3 ) ) ) ) ),
inference(negated_conjecture,[],[f96]) ).
fof(f96,conjecture,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( ( nil = X2
& nil != X3 )
| ! [X8] :
( ssList(X8)
=> ! [X9] :
( ssList(X9)
=> ( ? [X14] :
( ? [X15] :
( ? [X16] :
( ? [X17] :
( leq(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] :
( leq(X10,X12)
& app(cons(X12,nil),X13) = X2
& ssList(X13) )
& ssItem(X12) )
& app(X11,cons(X10,nil)) = X8
& ssList(X11) )
& ssItem(X10) )
| ~ totalorderedP(X2)
| app(app(X8,X2),X9) != X3 ) ) )
| ? [X4] :
( ? [X5] :
( ? [X6] :
( ! [X7] :
( ssItem(X7)
=> ( lt(X4,X7)
| ~ leq(X4,X7)
| ~ memberP(X6,X7)
| ~ memberP(X5,X7) ) )
& app(app(X5,cons(X4,nil)),X6) = X0
& ssList(X6) )
& ssList(X5) )
& ssItem(X4) )
| nil = X0
| X0 != X2
| X1 != X3 ) ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.H32pw4m56N/Vampire---4.8_14971',co1) ).
fof(f652,plain,
( ~ ssList(sK49)
| spl54_11 ),
inference(avatar_component_clause,[],[f650]) ).
fof(f631,plain,
spl54_3,
inference(avatar_contradiction_clause,[],[f630]) ).
fof(f630,plain,
( $false
| spl54_3 ),
inference(resolution,[],[f609,f423]) ).
fof(f423,plain,
ssList(nil),
inference(cnf_transformation,[],[f17]) ).
fof(f17,axiom,
ssList(nil),
file('/export/starexec/sandbox2/tmp/tmp.H32pw4m56N/Vampire---4.8_14971',ax17) ).
fof(f609,plain,
( ~ ssList(nil)
| spl54_3 ),
inference(avatar_component_clause,[],[f607]) ).
fof(f629,plain,
( ~ spl54_3
| spl54_8 ),
inference(avatar_split_clause,[],[f605,f627,f607]) ).
fof(f605,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,[],[f553,f437]) ).
fof(f437,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/tmp/tmp.H32pw4m56N/Vampire---4.8_14971',ax28) ).
fof(f553,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,[],[f537,f535]) ).
fof(f535,plain,
sK47 = sK49,
inference(cnf_transformation,[],[f339]) ).
fof(f537,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,[],[f339]) ).
fof(f613,plain,
( ~ spl54_3
| spl54_4 ),
inference(avatar_split_clause,[],[f601,f611,f607]) ).
fof(f601,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,[],[f552,f437]) ).
fof(f552,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,[],[f538,f535]) ).
fof(f538,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,[],[f339]) ).
fof(f600,plain,
~ spl54_2,
inference(avatar_split_clause,[],[f554,f596]) ).
fof(f554,plain,
nil != sK49,
inference(definition_unfolding,[],[f536,f535]) ).
fof(f536,plain,
nil != sK47,
inference(cnf_transformation,[],[f339]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.13 % Problem : SWC236+1 : TPTP v8.1.2. Released v2.4.0.
% 0.15/0.15 % 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.16/0.36 % Computer : n021.cluster.edu
% 0.16/0.36 % Model : x86_64 x86_64
% 0.16/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.36 % Memory : 8042.1875MB
% 0.16/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.16/0.36 % CPULimit : 300
% 0.16/0.36 % WCLimit : 300
% 0.16/0.36 % DateTime : Tue Apr 30 18:25:11 EDT 2024
% 0.16/0.37 % CPUTime :
% 0.16/0.37 This is a FOF_THM_RFO_SEQ problem
% 0.16/0.37 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.H32pw4m56N/Vampire---4.8_14971
% 0.61/0.80 % (15171)lrs+1011_1:1_sil=8000:sp=occurrence:nwc=10.0:i=78:ss=axioms:sgt=8_0 on Vampire---4 for (2995ds/78Mi)
% 0.61/0.80 % (15176)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 (2995ds/56Mi)
% 0.61/0.80 % (15169)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 (2995ds/34Mi)
% 0.61/0.80 % (15172)ott+1011_1:1_sil=2000:urr=on:i=33:sd=1:kws=inv_frequency:ss=axioms:sup=off_0 on Vampire---4 for (2995ds/33Mi)
% 0.61/0.80 % (15173)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 (2995ds/34Mi)
% 0.61/0.80 % (15174)lrs+1002_1:16_to=lpo:sil=32000:sp=unary_frequency:sos=on:i=45:bd=off:ss=axioms_0 on Vampire---4 for (2995ds/45Mi)
% 0.61/0.80 % (15175)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 (2995ds/83Mi)
% 0.61/0.80 % (15170)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 (2995ds/51Mi)
% 0.61/0.81 % (15176)Instruction limit reached!
% 0.61/0.81 % (15176)------------------------------
% 0.61/0.81 % (15176)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.61/0.81 % (15176)Termination reason: Unknown
% 0.61/0.81 % (15176)Termination phase: Saturation
% 0.61/0.81
% 0.61/0.81 % (15176)Memory used [KB]: 1718
% 0.61/0.81 % (15176)Time elapsed: 0.019 s
% 0.61/0.81 % (15176)Instructions burned: 58 (million)
% 0.61/0.81 % (15176)------------------------------
% 0.61/0.81 % (15176)------------------------------
% 0.61/0.82 % (15170)First to succeed.
% 0.61/0.82 % (15173)Instruction limit reached!
% 0.61/0.82 % (15173)------------------------------
% 0.61/0.82 % (15173)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.61/0.82 % (15173)Termination reason: Unknown
% 0.61/0.82 % (15173)Termination phase: Saturation
% 0.61/0.82
% 0.61/0.82 % (15173)Memory used [KB]: 1903
% 0.61/0.82 % (15173)Time elapsed: 0.019 s
% 0.61/0.82 % (15173)Instructions burned: 34 (million)
% 0.61/0.82 % (15173)------------------------------
% 0.61/0.82 % (15173)------------------------------
% 0.61/0.82 % (15172)Instruction limit reached!
% 0.61/0.82 % (15172)------------------------------
% 0.61/0.82 % (15172)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.61/0.82 % (15172)Termination reason: Unknown
% 0.61/0.82 % (15172)Termination phase: Saturation
% 0.61/0.82
% 0.61/0.82 % (15172)Memory used [KB]: 1748
% 0.61/0.82 % (15172)Time elapsed: 0.020 s
% 0.61/0.82 % (15172)Instructions burned: 34 (million)
% 0.61/0.82 % (15172)------------------------------
% 0.61/0.82 % (15172)------------------------------
% 0.61/0.82 % (15187)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 (2995ds/55Mi)
% 0.61/0.82 % (15169)Instruction limit reached!
% 0.61/0.82 % (15169)------------------------------
% 0.61/0.82 % (15169)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.61/0.82 % (15169)Termination reason: Unknown
% 0.61/0.82 % (15169)Termination phase: Saturation
% 0.61/0.82
% 0.61/0.82 % (15169)Memory used [KB]: 1549
% 0.61/0.82 % (15169)Time elapsed: 0.022 s
% 0.61/0.82 % (15169)Instructions burned: 34 (million)
% 0.61/0.82 % (15169)------------------------------
% 0.61/0.82 % (15169)------------------------------
% 0.61/0.82 % (15170)Refutation found. Thanks to Tanya!
% 0.61/0.82 % SZS status Theorem for Vampire---4
% 0.61/0.82 % SZS output start Proof for Vampire---4
% See solution above
% 0.61/0.82 % (15170)------------------------------
% 0.61/0.82 % (15170)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.61/0.82 % (15170)Termination reason: Refutation
% 0.61/0.82
% 0.61/0.82 % (15170)Memory used [KB]: 1561
% 0.61/0.82 % (15170)Time elapsed: 0.021 s
% 0.61/0.82 % (15170)Instructions burned: 34 (million)
% 0.61/0.82 % (15170)------------------------------
% 0.61/0.82 % (15170)------------------------------
% 0.61/0.82 % (15149)Success in time 0.422 s
% 0.61/0.82 % Vampire---4.8 exiting
%------------------------------------------------------------------------------