TSTP Solution File: SWC213+1 by SnakeForV-SAT---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV-SAT---1.0
% Problem : SWC213+1 : TPTP v8.1.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_sat --cores 0 -t %d %s
% Computer : n020.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 Aug 31 18:42:26 EDT 2022
% Result : Theorem 1.28s 0.53s
% Output : Refutation 1.28s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 12
% Syntax : Number of formulae : 46 ( 9 unt; 0 def)
% Number of atoms : 453 ( 164 equ)
% Maximal formula atoms : 48 ( 9 avg)
% Number of connectives : 643 ( 236 ~; 189 |; 193 &)
% ( 5 <=>; 20 =>; 0 <=; 0 <~>)
% Maximal formula depth : 27 ( 8 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 9 ( 7 usr; 4 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 7 con; 0-2 aty)
% Number of variables : 186 ( 120 !; 66 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1623,plain,
$false,
inference(avatar_sat_refutation,[],[f627,f637,f1556,f1622]) ).
fof(f1622,plain,
( ~ spl61_1
| spl61_6 ),
inference(avatar_contradiction_clause,[],[f1621]) ).
fof(f1621,plain,
( $false
| ~ spl61_1
| spl61_6 ),
inference(subsumption_resolution,[],[f1620,f611]) ).
fof(f611,plain,
( ssList(nil)
| ~ spl61_1 ),
inference(avatar_component_clause,[],[f610]) ).
fof(f610,plain,
( spl61_1
<=> ssList(nil) ),
introduced(avatar_definition,[new_symbols(naming,[spl61_1])]) ).
fof(f1620,plain,
( ~ ssList(nil)
| spl61_6 ),
inference(subsumption_resolution,[],[f1619,f636]) ).
fof(f636,plain,
( nil != sK26
| spl61_6 ),
inference(avatar_component_clause,[],[f634]) ).
fof(f634,plain,
( spl61_6
<=> nil = sK26 ),
introduced(avatar_definition,[new_symbols(naming,[spl61_6])]) ).
fof(f1619,plain,
( nil = sK26
| ~ ssList(nil) ),
inference(subsumption_resolution,[],[f1616,f420]) ).
fof(f420,plain,
ssList(sK26),
inference(cnf_transformation,[],[f279]) ).
fof(f279,plain,
( ssList(sK28)
& sK29 = sK27
& ssList(sK31)
& app(app(sK30,sK28),sK31) = sK29
& ! [X6] :
( ~ ssItem(X6)
| ! [X7] :
( ~ ssList(X7)
| sK31 != app(cons(X6,nil),X7)
| ! [X8] :
( ~ ssList(X8)
| sK28 != app(X8,cons(X6,nil)) ) ) )
& ! [X9] :
( ! [X10] :
( ~ ssList(X10)
| ! [X11] :
( sK28 != app(cons(X9,nil),X11)
| ~ ssList(X11) )
| app(X10,cons(X9,nil)) != sK30 )
| ~ ssItem(X9) )
& equalelemsP(sK28)
& ssList(sK30)
& ssList(sK29)
& ~ neq(sK26,nil)
& neq(sK27,nil)
& ( nil = sK29
| nil != sK28 )
& sK28 = sK26
& ssList(sK27)
& ssList(sK26) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK26,sK27,sK28,sK29,sK30,sK31])],[f272,f278,f277,f276,f275,f274,f273]) ).
fof(f273,plain,
( ? [X0] :
( ? [X1] :
( ? [X2] :
( ssList(X2)
& ? [X3] :
( X1 = X3
& ? [X4] :
( ? [X5] :
( ssList(X5)
& app(app(X4,X2),X5) = X3
& ! [X6] :
( ~ ssItem(X6)
| ! [X7] :
( ~ ssList(X7)
| app(cons(X6,nil),X7) != X5
| ! [X8] :
( ~ ssList(X8)
| app(X8,cons(X6,nil)) != X2 ) ) )
& ! [X9] :
( ! [X10] :
( ~ ssList(X10)
| ! [X11] :
( app(cons(X9,nil),X11) != X2
| ~ ssList(X11) )
| app(X10,cons(X9,nil)) != X4 )
| ~ ssItem(X9) )
& equalelemsP(X2) )
& ssList(X4) )
& ssList(X3)
& ~ neq(X0,nil)
& neq(X1,nil)
& ( nil = X3
| nil != X2 )
& X0 = X2 ) )
& ssList(X1) )
& ssList(X0) )
=> ( ? [X1] :
( ? [X2] :
( ssList(X2)
& ? [X3] :
( X1 = X3
& ? [X4] :
( ? [X5] :
( ssList(X5)
& app(app(X4,X2),X5) = X3
& ! [X6] :
( ~ ssItem(X6)
| ! [X7] :
( ~ ssList(X7)
| app(cons(X6,nil),X7) != X5
| ! [X8] :
( ~ ssList(X8)
| app(X8,cons(X6,nil)) != X2 ) ) )
& ! [X9] :
( ! [X10] :
( ~ ssList(X10)
| ! [X11] :
( app(cons(X9,nil),X11) != X2
| ~ ssList(X11) )
| app(X10,cons(X9,nil)) != X4 )
| ~ ssItem(X9) )
& equalelemsP(X2) )
& ssList(X4) )
& ssList(X3)
& ~ neq(sK26,nil)
& neq(X1,nil)
& ( nil = X3
| nil != X2 )
& sK26 = X2 ) )
& ssList(X1) )
& ssList(sK26) ) ),
introduced(choice_axiom,[]) ).
fof(f274,plain,
( ? [X1] :
( ? [X2] :
( ssList(X2)
& ? [X3] :
( X1 = X3
& ? [X4] :
( ? [X5] :
( ssList(X5)
& app(app(X4,X2),X5) = X3
& ! [X6] :
( ~ ssItem(X6)
| ! [X7] :
( ~ ssList(X7)
| app(cons(X6,nil),X7) != X5
| ! [X8] :
( ~ ssList(X8)
| app(X8,cons(X6,nil)) != X2 ) ) )
& ! [X9] :
( ! [X10] :
( ~ ssList(X10)
| ! [X11] :
( app(cons(X9,nil),X11) != X2
| ~ ssList(X11) )
| app(X10,cons(X9,nil)) != X4 )
| ~ ssItem(X9) )
& equalelemsP(X2) )
& ssList(X4) )
& ssList(X3)
& ~ neq(sK26,nil)
& neq(X1,nil)
& ( nil = X3
| nil != X2 )
& sK26 = X2 ) )
& ssList(X1) )
=> ( ? [X2] :
( ssList(X2)
& ? [X3] :
( sK27 = X3
& ? [X4] :
( ? [X5] :
( ssList(X5)
& app(app(X4,X2),X5) = X3
& ! [X6] :
( ~ ssItem(X6)
| ! [X7] :
( ~ ssList(X7)
| app(cons(X6,nil),X7) != X5
| ! [X8] :
( ~ ssList(X8)
| app(X8,cons(X6,nil)) != X2 ) ) )
& ! [X9] :
( ! [X10] :
( ~ ssList(X10)
| ! [X11] :
( app(cons(X9,nil),X11) != X2
| ~ ssList(X11) )
| app(X10,cons(X9,nil)) != X4 )
| ~ ssItem(X9) )
& equalelemsP(X2) )
& ssList(X4) )
& ssList(X3)
& ~ neq(sK26,nil)
& neq(sK27,nil)
& ( nil = X3
| nil != X2 )
& sK26 = X2 ) )
& ssList(sK27) ) ),
introduced(choice_axiom,[]) ).
fof(f275,plain,
( ? [X2] :
( ssList(X2)
& ? [X3] :
( sK27 = X3
& ? [X4] :
( ? [X5] :
( ssList(X5)
& app(app(X4,X2),X5) = X3
& ! [X6] :
( ~ ssItem(X6)
| ! [X7] :
( ~ ssList(X7)
| app(cons(X6,nil),X7) != X5
| ! [X8] :
( ~ ssList(X8)
| app(X8,cons(X6,nil)) != X2 ) ) )
& ! [X9] :
( ! [X10] :
( ~ ssList(X10)
| ! [X11] :
( app(cons(X9,nil),X11) != X2
| ~ ssList(X11) )
| app(X10,cons(X9,nil)) != X4 )
| ~ ssItem(X9) )
& equalelemsP(X2) )
& ssList(X4) )
& ssList(X3)
& ~ neq(sK26,nil)
& neq(sK27,nil)
& ( nil = X3
| nil != X2 )
& sK26 = X2 ) )
=> ( ssList(sK28)
& ? [X3] :
( sK27 = X3
& ? [X4] :
( ? [X5] :
( ssList(X5)
& app(app(X4,sK28),X5) = X3
& ! [X6] :
( ~ ssItem(X6)
| ! [X7] :
( ~ ssList(X7)
| app(cons(X6,nil),X7) != X5
| ! [X8] :
( ~ ssList(X8)
| sK28 != app(X8,cons(X6,nil)) ) ) )
& ! [X9] :
( ! [X10] :
( ~ ssList(X10)
| ! [X11] :
( sK28 != app(cons(X9,nil),X11)
| ~ ssList(X11) )
| app(X10,cons(X9,nil)) != X4 )
| ~ ssItem(X9) )
& equalelemsP(sK28) )
& ssList(X4) )
& ssList(X3)
& ~ neq(sK26,nil)
& neq(sK27,nil)
& ( nil = X3
| nil != sK28 )
& sK28 = sK26 ) ) ),
introduced(choice_axiom,[]) ).
fof(f276,plain,
( ? [X3] :
( sK27 = X3
& ? [X4] :
( ? [X5] :
( ssList(X5)
& app(app(X4,sK28),X5) = X3
& ! [X6] :
( ~ ssItem(X6)
| ! [X7] :
( ~ ssList(X7)
| app(cons(X6,nil),X7) != X5
| ! [X8] :
( ~ ssList(X8)
| sK28 != app(X8,cons(X6,nil)) ) ) )
& ! [X9] :
( ! [X10] :
( ~ ssList(X10)
| ! [X11] :
( sK28 != app(cons(X9,nil),X11)
| ~ ssList(X11) )
| app(X10,cons(X9,nil)) != X4 )
| ~ ssItem(X9) )
& equalelemsP(sK28) )
& ssList(X4) )
& ssList(X3)
& ~ neq(sK26,nil)
& neq(sK27,nil)
& ( nil = X3
| nil != sK28 )
& sK28 = sK26 )
=> ( sK29 = sK27
& ? [X4] :
( ? [X5] :
( ssList(X5)
& sK29 = app(app(X4,sK28),X5)
& ! [X6] :
( ~ ssItem(X6)
| ! [X7] :
( ~ ssList(X7)
| app(cons(X6,nil),X7) != X5
| ! [X8] :
( ~ ssList(X8)
| sK28 != app(X8,cons(X6,nil)) ) ) )
& ! [X9] :
( ! [X10] :
( ~ ssList(X10)
| ! [X11] :
( sK28 != app(cons(X9,nil),X11)
| ~ ssList(X11) )
| app(X10,cons(X9,nil)) != X4 )
| ~ ssItem(X9) )
& equalelemsP(sK28) )
& ssList(X4) )
& ssList(sK29)
& ~ neq(sK26,nil)
& neq(sK27,nil)
& ( nil = sK29
| nil != sK28 )
& sK28 = sK26 ) ),
introduced(choice_axiom,[]) ).
fof(f277,plain,
( ? [X4] :
( ? [X5] :
( ssList(X5)
& sK29 = app(app(X4,sK28),X5)
& ! [X6] :
( ~ ssItem(X6)
| ! [X7] :
( ~ ssList(X7)
| app(cons(X6,nil),X7) != X5
| ! [X8] :
( ~ ssList(X8)
| sK28 != app(X8,cons(X6,nil)) ) ) )
& ! [X9] :
( ! [X10] :
( ~ ssList(X10)
| ! [X11] :
( sK28 != app(cons(X9,nil),X11)
| ~ ssList(X11) )
| app(X10,cons(X9,nil)) != X4 )
| ~ ssItem(X9) )
& equalelemsP(sK28) )
& ssList(X4) )
=> ( ? [X5] :
( ssList(X5)
& sK29 = app(app(sK30,sK28),X5)
& ! [X6] :
( ~ ssItem(X6)
| ! [X7] :
( ~ ssList(X7)
| app(cons(X6,nil),X7) != X5
| ! [X8] :
( ~ ssList(X8)
| sK28 != app(X8,cons(X6,nil)) ) ) )
& ! [X9] :
( ! [X10] :
( ~ ssList(X10)
| ! [X11] :
( sK28 != app(cons(X9,nil),X11)
| ~ ssList(X11) )
| app(X10,cons(X9,nil)) != sK30 )
| ~ ssItem(X9) )
& equalelemsP(sK28) )
& ssList(sK30) ) ),
introduced(choice_axiom,[]) ).
fof(f278,plain,
( ? [X5] :
( ssList(X5)
& sK29 = app(app(sK30,sK28),X5)
& ! [X6] :
( ~ ssItem(X6)
| ! [X7] :
( ~ ssList(X7)
| app(cons(X6,nil),X7) != X5
| ! [X8] :
( ~ ssList(X8)
| sK28 != app(X8,cons(X6,nil)) ) ) )
& ! [X9] :
( ! [X10] :
( ~ ssList(X10)
| ! [X11] :
( sK28 != app(cons(X9,nil),X11)
| ~ ssList(X11) )
| app(X10,cons(X9,nil)) != sK30 )
| ~ ssItem(X9) )
& equalelemsP(sK28) )
=> ( ssList(sK31)
& app(app(sK30,sK28),sK31) = sK29
& ! [X6] :
( ~ ssItem(X6)
| ! [X7] :
( ~ ssList(X7)
| sK31 != app(cons(X6,nil),X7)
| ! [X8] :
( ~ ssList(X8)
| sK28 != app(X8,cons(X6,nil)) ) ) )
& ! [X9] :
( ! [X10] :
( ~ ssList(X10)
| ! [X11] :
( sK28 != app(cons(X9,nil),X11)
| ~ ssList(X11) )
| app(X10,cons(X9,nil)) != sK30 )
| ~ ssItem(X9) )
& equalelemsP(sK28) ) ),
introduced(choice_axiom,[]) ).
fof(f272,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ssList(X2)
& ? [X3] :
( X1 = X3
& ? [X4] :
( ? [X5] :
( ssList(X5)
& app(app(X4,X2),X5) = X3
& ! [X6] :
( ~ ssItem(X6)
| ! [X7] :
( ~ ssList(X7)
| app(cons(X6,nil),X7) != X5
| ! [X8] :
( ~ ssList(X8)
| app(X8,cons(X6,nil)) != X2 ) ) )
& ! [X9] :
( ! [X10] :
( ~ ssList(X10)
| ! [X11] :
( app(cons(X9,nil),X11) != X2
| ~ ssList(X11) )
| app(X10,cons(X9,nil)) != X4 )
| ~ ssItem(X9) )
& equalelemsP(X2) )
& ssList(X4) )
& ssList(X3)
& ~ neq(X0,nil)
& neq(X1,nil)
& ( nil = X3
| nil != X2 )
& X0 = X2 ) )
& ssList(X1) )
& ssList(X0) ),
inference(rectify,[],[f141]) ).
fof(f141,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ssList(X2)
& ? [X3] :
( X1 = X3
& ? [X4] :
( ? [X5] :
( ssList(X5)
& app(app(X4,X2),X5) = X3
& ! [X9] :
( ~ ssItem(X9)
| ! [X10] :
( ~ ssList(X10)
| app(cons(X9,nil),X10) != X5
| ! [X11] :
( ~ ssList(X11)
| app(X11,cons(X9,nil)) != X2 ) ) )
& ! [X6] :
( ! [X7] :
( ~ ssList(X7)
| ! [X8] :
( app(cons(X6,nil),X8) != X2
| ~ ssList(X8) )
| app(X7,cons(X6,nil)) != X4 )
| ~ ssItem(X6) )
& equalelemsP(X2) )
& ssList(X4) )
& ssList(X3)
& ~ neq(X0,nil)
& neq(X1,nil)
& ( nil = X3
| nil != X2 )
& X0 = X2 ) )
& ssList(X1) )
& ssList(X0) ),
inference(flattening,[],[f140]) ).
fof(f140,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( neq(X1,nil)
& X1 = X3
& ? [X4] :
( ? [X5] :
( ! [X6] :
( ! [X7] :
( ~ ssList(X7)
| ! [X8] :
( app(cons(X6,nil),X8) != X2
| ~ ssList(X8) )
| app(X7,cons(X6,nil)) != X4 )
| ~ ssItem(X6) )
& equalelemsP(X2)
& app(app(X4,X2),X5) = X3
& ! [X9] :
( ~ ssItem(X9)
| ! [X10] :
( ~ ssList(X10)
| app(cons(X9,nil),X10) != X5
| ! [X11] :
( ~ ssList(X11)
| app(X11,cons(X9,nil)) != X2 ) ) )
& ssList(X5) )
& ssList(X4) )
& X0 = X2
& ~ neq(X0,nil)
& ( nil = X3
| nil != X2 )
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(ennf_transformation,[],[f97]) ).
fof(f97,negated_conjecture,
~ ! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( ~ neq(X1,nil)
| X1 != X3
| ! [X4] :
( ssList(X4)
=> ! [X5] :
( ssList(X5)
=> ( ? [X6] :
( ssItem(X6)
& ? [X7] :
( ssList(X7)
& app(X7,cons(X6,nil)) = X4
& ? [X8] :
( app(cons(X6,nil),X8) = X2
& ssList(X8) ) ) )
| ~ equalelemsP(X2)
| app(app(X4,X2),X5) != X3
| ? [X9] :
( ? [X10] :
( app(cons(X9,nil),X10) = X5
& ? [X11] :
( ssList(X11)
& app(X11,cons(X9,nil)) = X2 )
& ssList(X10) )
& ssItem(X9) ) ) ) )
| X0 != X2
| neq(X0,nil)
| ( nil = X2
& nil != X3 ) ) ) ) ) ),
inference(negated_conjecture,[],[f96]) ).
fof(f96,conjecture,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( ~ neq(X1,nil)
| X1 != X3
| ! [X4] :
( ssList(X4)
=> ! [X5] :
( ssList(X5)
=> ( ? [X6] :
( ssItem(X6)
& ? [X7] :
( ssList(X7)
& app(X7,cons(X6,nil)) = X4
& ? [X8] :
( app(cons(X6,nil),X8) = X2
& ssList(X8) ) ) )
| ~ equalelemsP(X2)
| app(app(X4,X2),X5) != X3
| ? [X9] :
( ? [X10] :
( app(cons(X9,nil),X10) = X5
& ? [X11] :
( ssList(X11)
& app(X11,cons(X9,nil)) = X2 )
& ssList(X10) )
& ssItem(X9) ) ) ) )
| X0 != X2
| neq(X0,nil)
| ( nil = X2
& nil != X3 ) ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1) ).
fof(f1616,plain,
( ~ ssList(sK26)
| nil = sK26
| ~ ssList(nil) ),
inference(resolution,[],[f520,f425]) ).
fof(f425,plain,
~ neq(sK26,nil),
inference(cnf_transformation,[],[f279]) ).
fof(f520,plain,
! [X0,X1] :
( neq(X0,X1)
| ~ ssList(X1)
| X0 = X1
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f324]) ).
fof(f324,plain,
! [X0] :
( ~ ssList(X0)
| ! [X1] :
( ( ( X0 != X1
| ~ neq(X0,X1) )
& ( neq(X0,X1)
| X0 = X1 ) )
| ~ ssList(X1) ) ),
inference(nnf_transformation,[],[f117]) ).
fof(f117,plain,
! [X0] :
( ~ ssList(X0)
| ! [X1] :
( ( X0 != X1
<=> neq(X0,X1) )
| ~ ssList(X1) ) ),
inference(ennf_transformation,[],[f15]) ).
fof(f15,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ( X0 != X1
<=> neq(X0,X1) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax15) ).
fof(f1556,plain,
( ~ spl61_1
| ~ spl61_5 ),
inference(avatar_contradiction_clause,[],[f1555]) ).
fof(f1555,plain,
( $false
| ~ spl61_1
| ~ spl61_5 ),
inference(subsumption_resolution,[],[f1553,f611]) ).
fof(f1553,plain,
( ~ ssList(nil)
| ~ spl61_5 ),
inference(resolution,[],[f1433,f608]) ).
fof(f608,plain,
! [X1] :
( ~ neq(X1,X1)
| ~ ssList(X1) ),
inference(duplicate_literal_removal,[],[f591]) ).
fof(f591,plain,
! [X1] :
( ~ ssList(X1)
| ~ ssList(X1)
| ~ neq(X1,X1) ),
inference(equality_resolution,[],[f521]) ).
fof(f521,plain,
! [X0,X1] :
( ~ ssList(X0)
| X0 != X1
| ~ neq(X0,X1)
| ~ ssList(X1) ),
inference(cnf_transformation,[],[f324]) ).
fof(f1433,plain,
( neq(nil,nil)
| ~ spl61_5 ),
inference(backward_demodulation,[],[f424,f632]) ).
fof(f632,plain,
( nil = sK27
| ~ spl61_5 ),
inference(avatar_component_clause,[],[f630]) ).
fof(f630,plain,
( spl61_5
<=> nil = sK27 ),
introduced(avatar_definition,[new_symbols(naming,[spl61_5])]) ).
fof(f424,plain,
neq(sK27,nil),
inference(cnf_transformation,[],[f279]) ).
fof(f637,plain,
( spl61_5
| ~ spl61_6 ),
inference(avatar_split_clause,[],[f571,f634,f630]) ).
fof(f571,plain,
( nil != sK26
| nil = sK27 ),
inference(definition_unfolding,[],[f423,f433,f422]) ).
fof(f422,plain,
sK28 = sK26,
inference(cnf_transformation,[],[f279]) ).
fof(f433,plain,
sK29 = sK27,
inference(cnf_transformation,[],[f279]) ).
fof(f423,plain,
( nil = sK29
| nil != sK28 ),
inference(cnf_transformation,[],[f279]) ).
fof(f627,plain,
spl61_1,
inference(avatar_split_clause,[],[f351,f610]) ).
fof(f351,plain,
ssList(nil),
inference(cnf_transformation,[],[f17]) ).
fof(f17,axiom,
ssList(nil),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax17) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SWC213+1 : TPTP v8.1.0. Released v2.4.0.
% 0.07/0.13 % Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_sat --cores 0 -t %d %s
% 0.12/0.34 % Computer : n020.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 300
% 0.12/0.34 % DateTime : Tue Aug 30 18:36:45 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.21/0.46 % (30112)ott+2_1:1_fsr=off:gsp=on:i=50:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/50Mi)
% 0.21/0.46 % (30120)ott+10_1:1_tgt=ground:i=100:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/100Mi)
% 1.28/0.52 % (30120)First to succeed.
% 1.28/0.53 % (30120)Refutation found. Thanks to Tanya!
% 1.28/0.53 % SZS status Theorem for theBenchmark
% 1.28/0.53 % SZS output start Proof for theBenchmark
% See solution above
% 1.28/0.53 % (30120)------------------------------
% 1.28/0.53 % (30120)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 1.28/0.53 % (30120)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 1.28/0.53 % (30120)Termination reason: Refutation
% 1.28/0.53
% 1.28/0.53 % (30120)Memory used [KB]: 6652
% 1.28/0.53 % (30120)Time elapsed: 0.119 s
% 1.28/0.53 % (30120)Instructions burned: 47 (million)
% 1.28/0.53 % (30120)------------------------------
% 1.28/0.53 % (30120)------------------------------
% 1.28/0.53 % (30101)Success in time 0.177 s
%------------------------------------------------------------------------------