TSTP Solution File: SWC009+1 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SWC009+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 : n003.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:35:33 EDT 2024
% Result : Theorem 0.62s 0.83s
% Output : Refutation 0.62s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 14
% Syntax : Number of formulae : 53 ( 13 unt; 0 def)
% Number of atoms : 423 ( 154 equ)
% Maximal formula atoms : 46 ( 7 avg)
% Number of connectives : 592 ( 222 ~; 195 |; 148 &)
% ( 6 <=>; 21 =>; 0 <=; 0 <~>)
% Maximal formula depth : 24 ( 7 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 12 ( 10 usr; 7 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 6 con; 0-2 aty)
% Number of variables : 168 ( 112 !; 56 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f661,plain,
$false,
inference(avatar_sat_refutation,[],[f598,f600,f602,f614,f655,f657,f660]) ).
fof(f660,plain,
( ~ spl52_3
| spl52_13 ),
inference(avatar_split_clause,[],[f659,f652,f588]) ).
fof(f588,plain,
( spl52_3
<=> ssList(sK49) ),
introduced(avatar_definition,[new_symbols(naming,[spl52_3])]) ).
fof(f652,plain,
( spl52_13
<=> sK49 = app(sK49,nil) ),
introduced(avatar_definition,[new_symbols(naming,[spl52_13])]) ).
fof(f659,plain,
( ~ ssList(sK49)
| spl52_13 ),
inference(trivial_inequality_removal,[],[f658]) ).
fof(f658,plain,
( sK49 != sK49
| ~ ssList(sK49)
| spl52_13 ),
inference(superposition,[],[f654,f514]) ).
fof(f514,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/sandbox/benchmark/theBenchmark.p',ax84) ).
fof(f654,plain,
( sK49 != app(sK49,nil)
| spl52_13 ),
inference(avatar_component_clause,[],[f652]) ).
fof(f657,plain,
spl52_11,
inference(avatar_contradiction_clause,[],[f656]) ).
fof(f656,plain,
( $false
| spl52_11 ),
inference(resolution,[],[f646,f531]) ).
fof(f531,plain,
ssList(sK50),
inference(cnf_transformation,[],[f337]) ).
fof(f337,plain,
( ( nil != sK49
| nil = sK50 )
& ! [X5] :
( ! [X6] :
( ! [X7] :
( ! [X8] :
( ~ lt(X7,X5)
| app(X8,cons(X7,nil)) != sK49
| ~ ssList(X8) )
| ~ ssItem(X7) )
| app(cons(X5,nil),X6) != sK51
| ~ ssList(X6) )
| ~ ssItem(X5) )
& strictorderedP(sK49)
& sK50 = app(sK49,sK51)
& ssList(sK51)
& ! [X9] :
( ! [X10] :
( ! [X11] :
( app(X9,X11) != sK47
| app(app(X9,X10),X11) != sK48
| ~ ssList(X11) )
| ~ ssList(X10) )
| ~ ssList(X9) )
& sK47 = sK49
& sK48 = sK50
& ssList(sK50)
& ssList(sK49)
& ssList(sK48)
& ssList(sK47) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK47,sK48,sK49,sK50,sK51])],[f223,f336,f335,f334,f333,f332]) ).
fof(f332,plain,
( ? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( nil != X2
| nil = X3 )
& ? [X4] :
( ! [X5] :
( ! [X6] :
( ! [X7] :
( ! [X8] :
( ~ lt(X7,X5)
| app(X8,cons(X7,nil)) != X2
| ~ ssList(X8) )
| ~ ssItem(X7) )
| app(cons(X5,nil),X6) != X4
| ~ ssList(X6) )
| ~ ssItem(X5) )
& strictorderedP(X2)
& app(X2,X4) = X3
& ssList(X4) )
& ! [X9] :
( ! [X10] :
( ! [X11] :
( app(X9,X11) != X0
| app(app(X9,X10),X11) != X1
| ~ ssList(X11) )
| ~ ssList(X10) )
| ~ ssList(X9) )
& X0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) )
=> ( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( nil != X2
| nil = X3 )
& ? [X4] :
( ! [X5] :
( ! [X6] :
( ! [X7] :
( ! [X8] :
( ~ lt(X7,X5)
| app(X8,cons(X7,nil)) != X2
| ~ ssList(X8) )
| ~ ssItem(X7) )
| app(cons(X5,nil),X6) != X4
| ~ ssList(X6) )
| ~ ssItem(X5) )
& strictorderedP(X2)
& app(X2,X4) = X3
& ssList(X4) )
& ! [X9] :
( ! [X10] :
( ! [X11] :
( app(X9,X11) != sK47
| app(app(X9,X10),X11) != X1
| ~ ssList(X11) )
| ~ ssList(X10) )
| ~ ssList(X9) )
& 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] :
( ~ lt(X7,X5)
| app(X8,cons(X7,nil)) != X2
| ~ ssList(X8) )
| ~ ssItem(X7) )
| app(cons(X5,nil),X6) != X4
| ~ ssList(X6) )
| ~ ssItem(X5) )
& strictorderedP(X2)
& app(X2,X4) = X3
& ssList(X4) )
& ! [X9] :
( ! [X10] :
( ! [X11] :
( app(X9,X11) != sK47
| app(app(X9,X10),X11) != X1
| ~ ssList(X11) )
| ~ ssList(X10) )
| ~ ssList(X9) )
& sK47 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
=> ( ? [X2] :
( ? [X3] :
( ( nil != X2
| nil = X3 )
& ? [X4] :
( ! [X5] :
( ! [X6] :
( ! [X7] :
( ! [X8] :
( ~ lt(X7,X5)
| app(X8,cons(X7,nil)) != X2
| ~ ssList(X8) )
| ~ ssItem(X7) )
| app(cons(X5,nil),X6) != X4
| ~ ssList(X6) )
| ~ ssItem(X5) )
& strictorderedP(X2)
& app(X2,X4) = X3
& ssList(X4) )
& ! [X9] :
( ! [X10] :
( ! [X11] :
( app(X9,X11) != sK47
| app(app(X9,X10),X11) != sK48
| ~ ssList(X11) )
| ~ ssList(X10) )
| ~ ssList(X9) )
& 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] :
( ~ lt(X7,X5)
| app(X8,cons(X7,nil)) != X2
| ~ ssList(X8) )
| ~ ssItem(X7) )
| app(cons(X5,nil),X6) != X4
| ~ ssList(X6) )
| ~ ssItem(X5) )
& strictorderedP(X2)
& app(X2,X4) = X3
& ssList(X4) )
& ! [X9] :
( ! [X10] :
( ! [X11] :
( app(X9,X11) != sK47
| app(app(X9,X10),X11) != sK48
| ~ ssList(X11) )
| ~ ssList(X10) )
| ~ ssList(X9) )
& sK47 = X2
& sK48 = X3
& ssList(X3) )
& ssList(X2) )
=> ( ? [X3] :
( ( nil != sK49
| nil = X3 )
& ? [X4] :
( ! [X5] :
( ! [X6] :
( ! [X7] :
( ! [X8] :
( ~ lt(X7,X5)
| app(X8,cons(X7,nil)) != sK49
| ~ ssList(X8) )
| ~ ssItem(X7) )
| app(cons(X5,nil),X6) != X4
| ~ ssList(X6) )
| ~ ssItem(X5) )
& strictorderedP(sK49)
& app(sK49,X4) = X3
& ssList(X4) )
& ! [X9] :
( ! [X10] :
( ! [X11] :
( app(X9,X11) != sK47
| app(app(X9,X10),X11) != sK48
| ~ ssList(X11) )
| ~ ssList(X10) )
| ~ ssList(X9) )
& sK47 = sK49
& sK48 = X3
& ssList(X3) )
& ssList(sK49) ) ),
introduced(choice_axiom,[]) ).
fof(f335,plain,
( ? [X3] :
( ( nil != sK49
| nil = X3 )
& ? [X4] :
( ! [X5] :
( ! [X6] :
( ! [X7] :
( ! [X8] :
( ~ lt(X7,X5)
| app(X8,cons(X7,nil)) != sK49
| ~ ssList(X8) )
| ~ ssItem(X7) )
| app(cons(X5,nil),X6) != X4
| ~ ssList(X6) )
| ~ ssItem(X5) )
& strictorderedP(sK49)
& app(sK49,X4) = X3
& ssList(X4) )
& ! [X9] :
( ! [X10] :
( ! [X11] :
( app(X9,X11) != sK47
| app(app(X9,X10),X11) != sK48
| ~ ssList(X11) )
| ~ ssList(X10) )
| ~ ssList(X9) )
& sK47 = sK49
& sK48 = X3
& ssList(X3) )
=> ( ( nil != sK49
| nil = sK50 )
& ? [X4] :
( ! [X5] :
( ! [X6] :
( ! [X7] :
( ! [X8] :
( ~ lt(X7,X5)
| app(X8,cons(X7,nil)) != sK49
| ~ ssList(X8) )
| ~ ssItem(X7) )
| app(cons(X5,nil),X6) != X4
| ~ ssList(X6) )
| ~ ssItem(X5) )
& strictorderedP(sK49)
& app(sK49,X4) = sK50
& ssList(X4) )
& ! [X9] :
( ! [X10] :
( ! [X11] :
( app(X9,X11) != sK47
| app(app(X9,X10),X11) != sK48
| ~ ssList(X11) )
| ~ ssList(X10) )
| ~ ssList(X9) )
& sK47 = sK49
& sK48 = sK50
& ssList(sK50) ) ),
introduced(choice_axiom,[]) ).
fof(f336,plain,
( ? [X4] :
( ! [X5] :
( ! [X6] :
( ! [X7] :
( ! [X8] :
( ~ lt(X7,X5)
| app(X8,cons(X7,nil)) != sK49
| ~ ssList(X8) )
| ~ ssItem(X7) )
| app(cons(X5,nil),X6) != X4
| ~ ssList(X6) )
| ~ ssItem(X5) )
& strictorderedP(sK49)
& app(sK49,X4) = sK50
& ssList(X4) )
=> ( ! [X5] :
( ! [X6] :
( ! [X7] :
( ! [X8] :
( ~ lt(X7,X5)
| app(X8,cons(X7,nil)) != sK49
| ~ ssList(X8) )
| ~ ssItem(X7) )
| app(cons(X5,nil),X6) != sK51
| ~ ssList(X6) )
| ~ ssItem(X5) )
& strictorderedP(sK49)
& sK50 = app(sK49,sK51)
& ssList(sK51) ) ),
introduced(choice_axiom,[]) ).
fof(f223,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( nil != X2
| nil = X3 )
& ? [X4] :
( ! [X5] :
( ! [X6] :
( ! [X7] :
( ! [X8] :
( ~ lt(X7,X5)
| app(X8,cons(X7,nil)) != X2
| ~ ssList(X8) )
| ~ ssItem(X7) )
| app(cons(X5,nil),X6) != X4
| ~ ssList(X6) )
| ~ ssItem(X5) )
& strictorderedP(X2)
& app(X2,X4) = X3
& ssList(X4) )
& ! [X9] :
( ! [X10] :
( ! [X11] :
( app(X9,X11) != X0
| app(app(X9,X10),X11) != X1
| ~ ssList(X11) )
| ~ ssList(X10) )
| ~ ssList(X9) )
& 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] :
( ~ lt(X7,X5)
| app(X8,cons(X7,nil)) != X2
| ~ ssList(X8) )
| ~ ssItem(X7) )
| app(cons(X5,nil),X6) != X4
| ~ ssList(X6) )
| ~ ssItem(X5) )
& strictorderedP(X2)
& app(X2,X4) = X3
& ssList(X4) )
& ! [X9] :
( ! [X10] :
( ! [X11] :
( app(X9,X11) != X0
| app(app(X9,X10),X11) != X1
| ~ ssList(X11) )
| ~ ssList(X10) )
| ~ ssList(X9) )
& 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] :
( ? [X6] :
( ? [X7] :
( ? [X8] :
( lt(X7,X5)
& app(X8,cons(X7,nil)) = X2
& ssList(X8) )
& ssItem(X7) )
& app(cons(X5,nil),X6) = X4
& ssList(X6) )
& ssItem(X5) )
| ~ strictorderedP(X2)
| app(X2,X4) != X3 ) )
| ? [X9] :
( ? [X10] :
( ? [X11] :
( app(X9,X11) = X0
& app(app(X9,X10),X11) = X1
& ssList(X11) )
& ssList(X10) )
& ssList(X9) )
| 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 )
| ! [X7] :
( ssList(X7)
=> ( ? [X8] :
( ? [X9] :
( ? [X10] :
( ? [X11] :
( lt(X10,X8)
& app(X11,cons(X10,nil)) = X2
& ssList(X11) )
& ssItem(X10) )
& app(cons(X8,nil),X9) = X7
& ssList(X9) )
& ssItem(X8) )
| ~ strictorderedP(X2)
| app(X2,X7) != X3 ) )
| ? [X4] :
( ? [X5] :
( ? [X6] :
( app(X4,X6) = X0
& app(app(X4,X5),X6) = X1
& ssList(X6) )
& ssList(X5) )
& ssList(X4) )
| 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 )
| ! [X7] :
( ssList(X7)
=> ( ? [X8] :
( ? [X9] :
( ? [X10] :
( ? [X11] :
( lt(X10,X8)
& app(X11,cons(X10,nil)) = X2
& ssList(X11) )
& ssItem(X10) )
& app(cons(X8,nil),X9) = X7
& ssList(X9) )
& ssItem(X8) )
| ~ strictorderedP(X2)
| app(X2,X7) != X3 ) )
| ? [X4] :
( ? [X5] :
( ? [X6] :
( app(X4,X6) = X0
& app(app(X4,X5),X6) = X1
& ssList(X6) )
& ssList(X5) )
& ssList(X4) )
| X0 != X2
| X1 != X3 ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1) ).
fof(f646,plain,
( ~ ssList(sK50)
| spl52_11 ),
inference(avatar_component_clause,[],[f644]) ).
fof(f644,plain,
( spl52_11
<=> ssList(sK50) ),
introduced(avatar_definition,[new_symbols(naming,[spl52_11])]) ).
fof(f655,plain,
( ~ spl52_11
| ~ spl52_13
| ~ spl52_6
| ~ spl52_5 ),
inference(avatar_split_clause,[],[f633,f596,f606,f652,f644]) ).
fof(f606,plain,
( spl52_6
<=> ssList(nil) ),
introduced(avatar_definition,[new_symbols(naming,[spl52_6])]) ).
fof(f596,plain,
( spl52_5
<=> ! [X0] :
( sK50 != app(sK50,X0)
| ~ ssList(X0)
| sK49 != app(sK49,X0) ) ),
introduced(avatar_definition,[new_symbols(naming,[spl52_5])]) ).
fof(f633,plain,
( ~ ssList(nil)
| sK49 != app(sK49,nil)
| ~ ssList(sK50)
| ~ spl52_5 ),
inference(trivial_inequality_removal,[],[f632]) ).
fof(f632,plain,
( sK50 != sK50
| ~ ssList(nil)
| sK49 != app(sK49,nil)
| ~ ssList(sK50)
| ~ spl52_5 ),
inference(superposition,[],[f597,f514]) ).
fof(f597,plain,
( ! [X0] :
( sK50 != app(sK50,X0)
| ~ ssList(X0)
| sK49 != app(sK49,X0) )
| ~ spl52_5 ),
inference(avatar_component_clause,[],[f596]) ).
fof(f614,plain,
spl52_6,
inference(avatar_contradiction_clause,[],[f613]) ).
fof(f613,plain,
( $false
| spl52_6 ),
inference(resolution,[],[f608,f421]) ).
fof(f421,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)
| spl52_6 ),
inference(avatar_component_clause,[],[f606]) ).
fof(f602,plain,
spl52_4,
inference(avatar_contradiction_clause,[],[f601]) ).
fof(f601,plain,
( $false
| spl52_4 ),
inference(resolution,[],[f594,f535]) ).
fof(f535,plain,
ssList(sK51),
inference(cnf_transformation,[],[f337]) ).
fof(f594,plain,
( ~ ssList(sK51)
| spl52_4 ),
inference(avatar_component_clause,[],[f592]) ).
fof(f592,plain,
( spl52_4
<=> ssList(sK51) ),
introduced(avatar_definition,[new_symbols(naming,[spl52_4])]) ).
fof(f600,plain,
spl52_3,
inference(avatar_contradiction_clause,[],[f599]) ).
fof(f599,plain,
( $false
| spl52_3 ),
inference(resolution,[],[f590,f530]) ).
fof(f530,plain,
ssList(sK49),
inference(cnf_transformation,[],[f337]) ).
fof(f590,plain,
( ~ ssList(sK49)
| spl52_3 ),
inference(avatar_component_clause,[],[f588]) ).
fof(f598,plain,
( ~ spl52_3
| ~ spl52_4
| spl52_5 ),
inference(avatar_split_clause,[],[f586,f596,f592,f588]) ).
fof(f586,plain,
! [X0] :
( sK50 != app(sK50,X0)
| sK49 != app(sK49,X0)
| ~ ssList(X0)
| ~ ssList(sK51)
| ~ ssList(sK49) ),
inference(superposition,[],[f540,f536]) ).
fof(f536,plain,
sK50 = app(sK49,sK51),
inference(cnf_transformation,[],[f337]) ).
fof(f540,plain,
! [X10,X11,X9] :
( app(app(X9,X10),X11) != sK50
| app(X9,X11) != sK49
| ~ ssList(X11)
| ~ ssList(X10)
| ~ ssList(X9) ),
inference(definition_unfolding,[],[f534,f533,f532]) ).
fof(f532,plain,
sK48 = sK50,
inference(cnf_transformation,[],[f337]) ).
fof(f533,plain,
sK47 = sK49,
inference(cnf_transformation,[],[f337]) ).
fof(f534,plain,
! [X10,X11,X9] :
( app(X9,X11) != sK47
| app(app(X9,X10),X11) != sK48
| ~ ssList(X11)
| ~ ssList(X10)
| ~ ssList(X9) ),
inference(cnf_transformation,[],[f337]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.15 % Problem : SWC009+1 : TPTP v8.2.0. Released v2.4.0.
% 0.08/0.17 % 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.16/0.38 % Computer : n003.cluster.edu
% 0.16/0.38 % Model : x86_64 x86_64
% 0.16/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.38 % Memory : 8042.1875MB
% 0.16/0.38 % OS : Linux 3.10.0-693.el7.x86_64
% 0.16/0.38 % CPULimit : 300
% 0.16/0.38 % WCLimit : 300
% 0.16/0.38 % DateTime : Sun May 19 03:10:53 EDT 2024
% 0.16/0.39 % CPUTime :
% 0.16/0.39 This is a FOF_THM_RFO_SEQ problem
% 0.16/0.39 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.62/0.80 % (2791)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.62/0.80 % (2784)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.62/0.80 % (2790)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.62/0.81 % (2786)lrs+1011_1:1_sil=8000:sp=occurrence:nwc=10.0:i=78:ss=axioms:sgt=8_0 on theBenchmark for (2996ds/78Mi)
% 0.62/0.81 % (2787)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.62/0.81 % (2785)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.62/0.81 % (2789)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.62/0.82 % (2785)First to succeed.
% 0.62/0.82 % (2785)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-2783"
% 0.62/0.82 % (2788)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.62/0.82 % (2789)Also succeeded, but the first one will report.
% 0.62/0.83 % (2786)Also succeeded, but the first one will report.
% 0.62/0.83 % (2785)Refutation found. Thanks to Tanya!
% 0.62/0.83 % SZS status Theorem for theBenchmark
% 0.62/0.83 % SZS output start Proof for theBenchmark
% See solution above
% 0.62/0.83 % (2785)------------------------------
% 0.62/0.83 % (2785)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.62/0.83 % (2785)Termination reason: Refutation
% 0.62/0.83
% 0.62/0.83 % (2785)Memory used [KB]: 1471
% 0.62/0.83 % (2785)Time elapsed: 0.038 s
% 0.62/0.83 % (2785)Instructions burned: 21 (million)
% 0.62/0.83 % (2783)Success in time 0.422 s
% 0.62/0.83 % Vampire---4.8 exiting
%------------------------------------------------------------------------------