TSTP Solution File: SWC009+1 by SnakeForV---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV---1.0
% Problem : SWC009+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_uns --cores 0 -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 Aug 31 18:38:11 EDT 2022
% Result : Theorem 0.21s 0.55s
% Output : Refutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 13
% Syntax : Number of formulae : 50 ( 15 unt; 0 def)
% Number of atoms : 415 ( 155 equ)
% Maximal formula atoms : 46 ( 8 avg)
% Number of connectives : 591 ( 226 ~; 196 |; 148 &)
% ( 5 <=>; 16 =>; 0 <=; 0 <~>)
% Maximal formula depth : 26 ( 7 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 11 ( 9 usr; 6 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 6 con; 0-2 aty)
% Number of variables : 168 ( 114 !; 54 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f736,plain,
$false,
inference(avatar_sat_refutation,[],[f607,f634,f638,f640,f729,f735]) ).
fof(f735,plain,
spl52_24,
inference(avatar_contradiction_clause,[],[f732]) ).
fof(f732,plain,
( $false
| spl52_24 ),
inference(resolution,[],[f731,f543]) ).
fof(f543,plain,
ssList(sK7),
inference(definition_unfolding,[],[f387,f389]) ).
fof(f389,plain,
sK9 = sK7,
inference(cnf_transformation,[],[f246]) ).
fof(f246,plain,
( ssList(sK7)
& ssList(sK8)
& sK6 = sK8
& ( nil != sK8
| nil = sK9 )
& strictorderedP(sK8)
& ssList(sK10)
& ! [X5] :
( ! [X6] :
( ! [X7] :
( ~ ssItem(X7)
| ! [X8] :
( ~ lt(X7,X5)
| app(X8,cons(X7,nil)) != sK8
| ~ ssList(X8) ) )
| ~ ssList(X6)
| sK10 != app(cons(X5,nil),X6) )
| ~ ssItem(X5) )
& sK9 = app(sK8,sK10)
& sK9 = sK7
& ! [X9] :
( ! [X10] :
( ! [X11] :
( ~ ssList(X11)
| app(app(X9,X10),X11) != sK7
| app(X9,X11) != sK6 )
| ~ ssList(X10) )
| ~ ssList(X9) )
& ssList(sK9)
& ssList(sK6) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK6,sK7,sK8,sK9,sK10])],[f240,f245,f244,f243,f242,f241]) ).
fof(f241,plain,
( ? [X0] :
( ? [X1] :
( ssList(X1)
& ? [X2] :
( ssList(X2)
& ? [X3] :
( X0 = X2
& ( nil != X2
| nil = X3 )
& ? [X4] :
( strictorderedP(X2)
& ssList(X4)
& ! [X5] :
( ! [X6] :
( ! [X7] :
( ~ ssItem(X7)
| ! [X8] :
( ~ lt(X7,X5)
| app(X8,cons(X7,nil)) != X2
| ~ ssList(X8) ) )
| ~ ssList(X6)
| app(cons(X5,nil),X6) != X4 )
| ~ ssItem(X5) )
& app(X2,X4) = X3 )
& X1 = X3
& ! [X9] :
( ! [X10] :
( ! [X11] :
( ~ ssList(X11)
| app(app(X9,X10),X11) != X1
| app(X9,X11) != X0 )
| ~ ssList(X10) )
| ~ ssList(X9) )
& ssList(X3) ) ) )
& ssList(X0) )
=> ( ? [X1] :
( ssList(X1)
& ? [X2] :
( ssList(X2)
& ? [X3] :
( sK6 = X2
& ( nil != X2
| nil = X3 )
& ? [X4] :
( strictorderedP(X2)
& ssList(X4)
& ! [X5] :
( ! [X6] :
( ! [X7] :
( ~ ssItem(X7)
| ! [X8] :
( ~ lt(X7,X5)
| app(X8,cons(X7,nil)) != X2
| ~ ssList(X8) ) )
| ~ ssList(X6)
| app(cons(X5,nil),X6) != X4 )
| ~ ssItem(X5) )
& app(X2,X4) = X3 )
& X1 = X3
& ! [X9] :
( ! [X10] :
( ! [X11] :
( ~ ssList(X11)
| app(app(X9,X10),X11) != X1
| app(X9,X11) != sK6 )
| ~ ssList(X10) )
| ~ ssList(X9) )
& ssList(X3) ) ) )
& ssList(sK6) ) ),
introduced(choice_axiom,[]) ).
fof(f242,plain,
( ? [X1] :
( ssList(X1)
& ? [X2] :
( ssList(X2)
& ? [X3] :
( sK6 = X2
& ( nil != X2
| nil = X3 )
& ? [X4] :
( strictorderedP(X2)
& ssList(X4)
& ! [X5] :
( ! [X6] :
( ! [X7] :
( ~ ssItem(X7)
| ! [X8] :
( ~ lt(X7,X5)
| app(X8,cons(X7,nil)) != X2
| ~ ssList(X8) ) )
| ~ ssList(X6)
| app(cons(X5,nil),X6) != X4 )
| ~ ssItem(X5) )
& app(X2,X4) = X3 )
& X1 = X3
& ! [X9] :
( ! [X10] :
( ! [X11] :
( ~ ssList(X11)
| app(app(X9,X10),X11) != X1
| app(X9,X11) != sK6 )
| ~ ssList(X10) )
| ~ ssList(X9) )
& ssList(X3) ) ) )
=> ( ssList(sK7)
& ? [X2] :
( ssList(X2)
& ? [X3] :
( sK6 = X2
& ( nil != X2
| nil = X3 )
& ? [X4] :
( strictorderedP(X2)
& ssList(X4)
& ! [X5] :
( ! [X6] :
( ! [X7] :
( ~ ssItem(X7)
| ! [X8] :
( ~ lt(X7,X5)
| app(X8,cons(X7,nil)) != X2
| ~ ssList(X8) ) )
| ~ ssList(X6)
| app(cons(X5,nil),X6) != X4 )
| ~ ssItem(X5) )
& app(X2,X4) = X3 )
& sK7 = X3
& ! [X9] :
( ! [X10] :
( ! [X11] :
( ~ ssList(X11)
| app(app(X9,X10),X11) != sK7
| app(X9,X11) != sK6 )
| ~ ssList(X10) )
| ~ ssList(X9) )
& ssList(X3) ) ) ) ),
introduced(choice_axiom,[]) ).
fof(f243,plain,
( ? [X2] :
( ssList(X2)
& ? [X3] :
( sK6 = X2
& ( nil != X2
| nil = X3 )
& ? [X4] :
( strictorderedP(X2)
& ssList(X4)
& ! [X5] :
( ! [X6] :
( ! [X7] :
( ~ ssItem(X7)
| ! [X8] :
( ~ lt(X7,X5)
| app(X8,cons(X7,nil)) != X2
| ~ ssList(X8) ) )
| ~ ssList(X6)
| app(cons(X5,nil),X6) != X4 )
| ~ ssItem(X5) )
& app(X2,X4) = X3 )
& sK7 = X3
& ! [X9] :
( ! [X10] :
( ! [X11] :
( ~ ssList(X11)
| app(app(X9,X10),X11) != sK7
| app(X9,X11) != sK6 )
| ~ ssList(X10) )
| ~ ssList(X9) )
& ssList(X3) ) )
=> ( ssList(sK8)
& ? [X3] :
( sK6 = sK8
& ( nil != sK8
| nil = X3 )
& ? [X4] :
( strictorderedP(sK8)
& ssList(X4)
& ! [X5] :
( ! [X6] :
( ! [X7] :
( ~ ssItem(X7)
| ! [X8] :
( ~ lt(X7,X5)
| app(X8,cons(X7,nil)) != sK8
| ~ ssList(X8) ) )
| ~ ssList(X6)
| app(cons(X5,nil),X6) != X4 )
| ~ ssItem(X5) )
& app(sK8,X4) = X3 )
& sK7 = X3
& ! [X9] :
( ! [X10] :
( ! [X11] :
( ~ ssList(X11)
| app(app(X9,X10),X11) != sK7
| app(X9,X11) != sK6 )
| ~ ssList(X10) )
| ~ ssList(X9) )
& ssList(X3) ) ) ),
introduced(choice_axiom,[]) ).
fof(f244,plain,
( ? [X3] :
( sK6 = sK8
& ( nil != sK8
| nil = X3 )
& ? [X4] :
( strictorderedP(sK8)
& ssList(X4)
& ! [X5] :
( ! [X6] :
( ! [X7] :
( ~ ssItem(X7)
| ! [X8] :
( ~ lt(X7,X5)
| app(X8,cons(X7,nil)) != sK8
| ~ ssList(X8) ) )
| ~ ssList(X6)
| app(cons(X5,nil),X6) != X4 )
| ~ ssItem(X5) )
& app(sK8,X4) = X3 )
& sK7 = X3
& ! [X9] :
( ! [X10] :
( ! [X11] :
( ~ ssList(X11)
| app(app(X9,X10),X11) != sK7
| app(X9,X11) != sK6 )
| ~ ssList(X10) )
| ~ ssList(X9) )
& ssList(X3) )
=> ( sK6 = sK8
& ( nil != sK8
| nil = sK9 )
& ? [X4] :
( strictorderedP(sK8)
& ssList(X4)
& ! [X5] :
( ! [X6] :
( ! [X7] :
( ~ ssItem(X7)
| ! [X8] :
( ~ lt(X7,X5)
| app(X8,cons(X7,nil)) != sK8
| ~ ssList(X8) ) )
| ~ ssList(X6)
| app(cons(X5,nil),X6) != X4 )
| ~ ssItem(X5) )
& app(sK8,X4) = sK9 )
& sK9 = sK7
& ! [X9] :
( ! [X10] :
( ! [X11] :
( ~ ssList(X11)
| app(app(X9,X10),X11) != sK7
| app(X9,X11) != sK6 )
| ~ ssList(X10) )
| ~ ssList(X9) )
& ssList(sK9) ) ),
introduced(choice_axiom,[]) ).
fof(f245,plain,
( ? [X4] :
( strictorderedP(sK8)
& ssList(X4)
& ! [X5] :
( ! [X6] :
( ! [X7] :
( ~ ssItem(X7)
| ! [X8] :
( ~ lt(X7,X5)
| app(X8,cons(X7,nil)) != sK8
| ~ ssList(X8) ) )
| ~ ssList(X6)
| app(cons(X5,nil),X6) != X4 )
| ~ ssItem(X5) )
& app(sK8,X4) = sK9 )
=> ( strictorderedP(sK8)
& ssList(sK10)
& ! [X5] :
( ! [X6] :
( ! [X7] :
( ~ ssItem(X7)
| ! [X8] :
( ~ lt(X7,X5)
| app(X8,cons(X7,nil)) != sK8
| ~ ssList(X8) ) )
| ~ ssList(X6)
| sK10 != app(cons(X5,nil),X6) )
| ~ ssItem(X5) )
& sK9 = app(sK8,sK10) ) ),
introduced(choice_axiom,[]) ).
fof(f240,plain,
? [X0] :
( ? [X1] :
( ssList(X1)
& ? [X2] :
( ssList(X2)
& ? [X3] :
( X0 = X2
& ( nil != X2
| nil = X3 )
& ? [X4] :
( strictorderedP(X2)
& ssList(X4)
& ! [X5] :
( ! [X6] :
( ! [X7] :
( ~ ssItem(X7)
| ! [X8] :
( ~ lt(X7,X5)
| app(X8,cons(X7,nil)) != X2
| ~ ssList(X8) ) )
| ~ ssList(X6)
| app(cons(X5,nil),X6) != X4 )
| ~ ssItem(X5) )
& app(X2,X4) = X3 )
& X1 = X3
& ! [X9] :
( ! [X10] :
( ! [X11] :
( ~ ssList(X11)
| app(app(X9,X10),X11) != X1
| app(X9,X11) != X0 )
| ~ ssList(X10) )
| ~ ssList(X9) )
& ssList(X3) ) ) )
& ssList(X0) ),
inference(rectify,[],[f115]) ).
fof(f115,plain,
? [X0] :
( ? [X1] :
( ssList(X1)
& ? [X2] :
( ssList(X2)
& ? [X3] :
( X0 = X2
& ( nil != X2
| nil = X3 )
& ? [X7] :
( strictorderedP(X2)
& ssList(X7)
& ! [X8] :
( ! [X9] :
( ! [X10] :
( ~ ssItem(X10)
| ! [X11] :
( ~ lt(X10,X8)
| app(X11,cons(X10,nil)) != X2
| ~ ssList(X11) ) )
| ~ ssList(X9)
| app(cons(X8,nil),X9) != X7 )
| ~ ssItem(X8) )
& app(X2,X7) = X3 )
& X1 = X3
& ! [X4] :
( ! [X5] :
( ! [X6] :
( ~ ssList(X6)
| app(app(X4,X5),X6) != X1
| app(X4,X6) != X0 )
| ~ ssList(X5) )
| ~ ssList(X4) )
& ssList(X3) ) ) )
& ssList(X0) ),
inference(flattening,[],[f114]) ).
fof(f114,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ? [X7] :
( strictorderedP(X2)
& app(X2,X7) = X3
& ! [X8] :
( ! [X9] :
( ! [X10] :
( ~ ssItem(X10)
| ! [X11] :
( ~ lt(X10,X8)
| app(X11,cons(X10,nil)) != X2
| ~ ssList(X11) ) )
| ~ ssList(X9)
| app(cons(X8,nil),X9) != X7 )
| ~ ssItem(X8) )
& ssList(X7) )
& ( nil != X2
| nil = X3 )
& X1 = X3
& ! [X4] :
( ! [X5] :
( ! [X6] :
( ~ ssList(X6)
| app(app(X4,X5),X6) != X1
| app(X4,X6) != X0 )
| ~ ssList(X5) )
| ~ ssList(X4) )
& X0 = 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)
=> ( ! [X7] :
( ssList(X7)
=> ( ~ strictorderedP(X2)
| app(X2,X7) != X3
| ? [X8] :
( ssItem(X8)
& ? [X9] :
( ssList(X9)
& app(cons(X8,nil),X9) = X7
& ? [X10] :
( ? [X11] :
( app(X11,cons(X10,nil)) = X2
& lt(X10,X8)
& ssList(X11) )
& ssItem(X10) ) ) ) ) )
| ( nil != X3
& nil = X2 )
| X1 != X3
| ? [X4] :
( ssList(X4)
& ? [X5] :
( ? [X6] :
( app(X4,X6) = X0
& app(app(X4,X5),X6) = X1
& ssList(X6) )
& ssList(X5) ) )
| X0 != X2 ) ) ) ) ),
inference(negated_conjecture,[],[f96]) ).
fof(f96,conjecture,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( ! [X7] :
( ssList(X7)
=> ( ~ strictorderedP(X2)
| app(X2,X7) != X3
| ? [X8] :
( ssItem(X8)
& ? [X9] :
( ssList(X9)
& app(cons(X8,nil),X9) = X7
& ? [X10] :
( ? [X11] :
( app(X11,cons(X10,nil)) = X2
& lt(X10,X8)
& ssList(X11) )
& ssItem(X10) ) ) ) ) )
| ( nil != X3
& nil = X2 )
| X1 != X3
| ? [X4] :
( ssList(X4)
& ? [X5] :
( ? [X6] :
( app(X4,X6) = X0
& app(app(X4,X5),X6) = X1
& ssList(X6) )
& ssList(X5) ) )
| X0 != X2 ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1) ).
fof(f387,plain,
ssList(sK9),
inference(cnf_transformation,[],[f246]) ).
fof(f731,plain,
( ~ ssList(sK7)
| spl52_24 ),
inference(trivial_inequality_removal,[],[f730]) ).
fof(f730,plain,
( sK7 != sK7
| ~ ssList(sK7)
| spl52_24 ),
inference(superposition,[],[f728,f503]) ).
fof(f503,plain,
! [X0] :
( app(X0,nil) = X0
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f174]) ).
fof(f174,plain,
! [X0] :
( ~ ssList(X0)
| app(X0,nil) = X0 ),
inference(ennf_transformation,[],[f84]) ).
fof(f84,axiom,
! [X0] :
( ssList(X0)
=> app(X0,nil) = X0 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax84) ).
fof(f728,plain,
( app(sK7,nil) != sK7
| spl52_24 ),
inference(avatar_component_clause,[],[f726]) ).
fof(f726,plain,
( spl52_24
<=> app(sK7,nil) = sK7 ),
introduced(avatar_definition,[new_symbols(naming,[spl52_24])]) ).
fof(f729,plain,
( ~ spl52_24
| ~ spl52_10
| ~ spl52_4
| ~ spl52_11 ),
inference(avatar_split_clause,[],[f702,f628,f592,f624,f726]) ).
fof(f624,plain,
( spl52_10
<=> ssList(sK8) ),
introduced(avatar_definition,[new_symbols(naming,[spl52_10])]) ).
fof(f592,plain,
( spl52_4
<=> ssList(nil) ),
introduced(avatar_definition,[new_symbols(naming,[spl52_4])]) ).
fof(f628,plain,
( spl52_11
<=> ! [X0] :
( sK7 != app(sK7,X0)
| ~ ssList(X0)
| sK8 != app(sK8,X0) ) ),
introduced(avatar_definition,[new_symbols(naming,[spl52_11])]) ).
fof(f702,plain,
( ~ ssList(nil)
| ~ ssList(sK8)
| app(sK7,nil) != sK7
| ~ spl52_11 ),
inference(trivial_inequality_removal,[],[f701]) ).
fof(f701,plain,
( sK8 != sK8
| ~ ssList(sK8)
| ~ ssList(nil)
| app(sK7,nil) != sK7
| ~ spl52_11 ),
inference(superposition,[],[f629,f503]) ).
fof(f629,plain,
( ! [X0] :
( sK8 != app(sK8,X0)
| sK7 != app(sK7,X0)
| ~ ssList(X0) )
| ~ spl52_11 ),
inference(avatar_component_clause,[],[f628]) ).
fof(f640,plain,
spl52_12,
inference(avatar_contradiction_clause,[],[f639]) ).
fof(f639,plain,
( $false
| spl52_12 ),
inference(resolution,[],[f633,f392]) ).
fof(f392,plain,
ssList(sK10),
inference(cnf_transformation,[],[f246]) ).
fof(f633,plain,
( ~ ssList(sK10)
| spl52_12 ),
inference(avatar_component_clause,[],[f631]) ).
fof(f631,plain,
( spl52_12
<=> ssList(sK10) ),
introduced(avatar_definition,[new_symbols(naming,[spl52_12])]) ).
fof(f638,plain,
spl52_10,
inference(avatar_contradiction_clause,[],[f636]) ).
fof(f636,plain,
( $false
| spl52_10 ),
inference(resolution,[],[f626,f396]) ).
fof(f396,plain,
ssList(sK8),
inference(cnf_transformation,[],[f246]) ).
fof(f626,plain,
( ~ ssList(sK8)
| spl52_10 ),
inference(avatar_component_clause,[],[f624]) ).
fof(f634,plain,
( ~ spl52_10
| spl52_11
| ~ spl52_12 ),
inference(avatar_split_clause,[],[f622,f631,f628,f624]) ).
fof(f622,plain,
! [X0] :
( ~ ssList(sK10)
| sK7 != app(sK7,X0)
| sK8 != app(sK8,X0)
| ~ ssList(sK8)
| ~ ssList(X0) ),
inference(superposition,[],[f542,f541]) ).
fof(f541,plain,
app(sK8,sK10) = sK7,
inference(definition_unfolding,[],[f390,f389]) ).
fof(f390,plain,
sK9 = app(sK8,sK10),
inference(cnf_transformation,[],[f246]) ).
fof(f542,plain,
! [X10,X11,X9] :
( app(app(X9,X10),X11) != sK7
| ~ ssList(X10)
| ~ ssList(X9)
| ~ ssList(X11)
| app(X9,X11) != sK8 ),
inference(definition_unfolding,[],[f388,f395]) ).
fof(f395,plain,
sK6 = sK8,
inference(cnf_transformation,[],[f246]) ).
fof(f388,plain,
! [X10,X11,X9] :
( ~ ssList(X11)
| app(app(X9,X10),X11) != sK7
| app(X9,X11) != sK6
| ~ ssList(X10)
| ~ ssList(X9) ),
inference(cnf_transformation,[],[f246]) ).
fof(f607,plain,
spl52_4,
inference(avatar_split_clause,[],[f345,f592]) ).
fof(f345,plain,
ssList(nil),
inference(cnf_transformation,[],[f17]) ).
fof(f17,axiom,
ssList(nil),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax17) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : SWC009+1 : TPTP v8.1.0. Released v2.4.0.
% 0.11/0.13 % Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_uns --cores 0 -t %d %s
% 0.14/0.34 % Computer : n021.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 300
% 0.14/0.34 % DateTime : Tue Aug 30 17:50:41 EDT 2022
% 0.14/0.34 % CPUTime :
% 0.21/0.52 % (23415)dis+21_1:1_av=off:sos=on:sp=frequency:ss=included:to=lpo:i=15:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/15Mi)
% 0.21/0.52 % (23432)dis+1010_2:3_fs=off:fsr=off:nm=0:nwc=5.0:s2a=on:s2agt=32:i=82:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/82Mi)
% 0.21/0.52 % (23424)lrs+10_1:1_ins=3:sp=reverse_frequency:spb=goal:to=lpo:i=3:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/3Mi)
% 0.21/0.52 % (23420)lrs+10_1:1_ep=R:lcm=predicate:lma=on:sos=all:spb=goal:ss=included:i=12:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/12Mi)
% 0.21/0.53 % (23417)lrs+2_1:1_lcm=reverse:lma=on:sos=all:spb=goal_then_units:ss=included:urr=on:i=39:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/39Mi)
% 0.21/0.53 % (23424)Instruction limit reached!
% 0.21/0.53 % (23424)------------------------------
% 0.21/0.53 % (23424)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.21/0.53 % (23424)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.21/0.53 % (23424)Termination reason: Unknown
% 0.21/0.53 % (23424)Termination phase: Preprocessing 3
% 0.21/0.53
% 0.21/0.53 % (23424)Memory used [KB]: 1663
% 0.21/0.53 % (23424)Time elapsed: 0.005 s
% 0.21/0.53 % (23424)Instructions burned: 4 (million)
% 0.21/0.53 % (23424)------------------------------
% 0.21/0.53 % (23424)------------------------------
% 0.21/0.53 % (23438)dis+2_3:1_aac=none:abs=on:ep=R:lcm=reverse:nwc=10.0:sos=on:sp=const_frequency:spb=units:urr=ec_only:i=8:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/8Mi)
% 0.21/0.53 % (23429)dis-10_3:2_amm=sco:ep=RS:fsr=off:nm=10:sd=2:sos=on:ss=axioms:st=3.0:i=11:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/11Mi)
% 0.21/0.53 % (23413)lrs+10_5:1_br=off:fde=none:nwc=3.0:sd=1:sgt=10:sos=on:ss=axioms:urr=on:i=51:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/51Mi)
% 0.21/0.53 % (23414)lrs+10_1:1024_nm=0:nwc=5.0:ss=axioms:i=13:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/13Mi)
% 0.21/0.53 % (23412)dis+1002_1:1_aac=none:bd=off:sac=on:sos=on:spb=units:i=3:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/3Mi)
% 0.21/0.53 % (23438)Instruction limit reached!
% 0.21/0.53 % (23438)------------------------------
% 0.21/0.53 % (23438)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.21/0.53 % (23421)lrs+10_1:2_br=off:nm=4:ss=included:urr=on:i=7:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/7Mi)
% 0.21/0.54 % (23422)lrs+10_1:4_av=off:bs=unit_only:bsr=unit_only:ep=RS:s2a=on:sos=on:sp=frequency:to=lpo:i=16:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/16Mi)
% 0.21/0.54 % (23436)lrs+1011_1:1_fd=preordered:fsd=on:sos=on:thsq=on:thsqc=64:thsqd=32:uwa=ground:i=99:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/99Mi)
% 0.21/0.54 % (23421)Instruction limit reached!
% 0.21/0.54 % (23421)------------------------------
% 0.21/0.54 % (23421)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.21/0.54 % (23429)Instruction limit reached!
% 0.21/0.54 % (23429)------------------------------
% 0.21/0.54 % (23429)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.21/0.54 % (23425)lrs+10_1:1_drc=off:sp=reverse_frequency:spb=goal:to=lpo:i=7:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/7Mi)
% 0.21/0.54 % (23415)Instruction limit reached!
% 0.21/0.54 % (23415)------------------------------
% 0.21/0.54 % (23415)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.21/0.54 % (23438)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.21/0.54 % (23438)Termination reason: Unknown
% 0.21/0.54 % (23438)Termination phase: Property scanning
% 0.21/0.54
% 0.21/0.54 % (23438)Memory used [KB]: 1791
% 0.21/0.54 % (23438)Time elapsed: 0.005 s
% 0.21/0.54 % (23438)Instructions burned: 8 (million)
% 0.21/0.54 % (23438)------------------------------
% 0.21/0.54 % (23438)------------------------------
% 0.21/0.54 % (23432)First to succeed.
% 0.21/0.54 % (23420)Instruction limit reached!
% 0.21/0.54 % (23420)------------------------------
% 0.21/0.54 % (23420)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.21/0.54 % (23420)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.21/0.54 % (23420)Termination reason: Unknown
% 0.21/0.54 % (23420)Termination phase: Saturation
% 0.21/0.54
% 0.21/0.54 % (23420)Memory used [KB]: 6268
% 0.21/0.54 % (23420)Time elapsed: 0.131 s
% 0.21/0.54 % (23420)Instructions burned: 13 (million)
% 0.21/0.54 % (23420)------------------------------
% 0.21/0.54 % (23420)------------------------------
% 0.21/0.54 % (23435)lrs+11_1:1_plsq=on:plsqc=1:plsqr=32,1:ss=included:i=95:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/95Mi)
% 0.21/0.54 % (23411)lrs+10_1:1_gsp=on:sd=1:sgt=32:sos=on:ss=axioms:i=13:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/13Mi)
% 0.21/0.54 % (23412)Instruction limit reached!
% 0.21/0.54 % (23412)------------------------------
% 0.21/0.54 % (23412)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.21/0.54 % (23412)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.21/0.54 % (23412)Termination reason: Unknown
% 0.21/0.54 % (23412)Termination phase: Naming
% 0.21/0.54
% 0.21/0.54 % (23412)Memory used [KB]: 1535
% 0.21/0.54 % (23412)Time elapsed: 0.003 s
% 0.21/0.54 % (23412)Instructions burned: 3 (million)
% 0.21/0.54 % (23412)------------------------------
% 0.21/0.54 % (23412)------------------------------
% 0.21/0.54 % (23418)dis+10_1:1_newcnf=on:sgt=8:sos=on:ss=axioms:to=lpo:urr=on:i=49:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/49Mi)
% 0.21/0.55 % (23433)dis+10_1:1_av=off:sos=on:sp=reverse_arity:ss=included:st=2.0:to=lpo:urr=ec_only:i=45:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/45Mi)
% 0.21/0.55 % (23415)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.21/0.55 % (23415)Termination reason: Unknown
% 0.21/0.55 % (23415)Termination phase: Saturation
% 0.21/0.55
% 0.21/0.55 % (23415)Memory used [KB]: 1791
% 0.21/0.55 % (23415)Time elapsed: 0.128 s
% 0.21/0.55 % (23415)Instructions burned: 15 (million)
% 0.21/0.55 % (23415)------------------------------
% 0.21/0.55 % (23415)------------------------------
% 0.21/0.55 % (23432)Refutation found. Thanks to Tanya!
% 0.21/0.55 % SZS status Theorem for theBenchmark
% 0.21/0.55 % SZS output start Proof for theBenchmark
% See solution above
% 0.21/0.55 % (23432)------------------------------
% 0.21/0.55 % (23432)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.21/0.55 % (23432)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.21/0.55 % (23432)Termination reason: Refutation
% 0.21/0.55
% 0.21/0.55 % (23432)Memory used [KB]: 6524
% 0.21/0.55 % (23432)Time elapsed: 0.091 s
% 0.21/0.55 % (23432)Instructions burned: 15 (million)
% 0.21/0.55 % (23432)------------------------------
% 0.21/0.55 % (23432)------------------------------
% 0.21/0.55 % (23409)Success in time 0.197 s
%------------------------------------------------------------------------------