TSTP Solution File: SWC325+1 by SnakeForV---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV---1.0
% Problem : SWC325+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 : n013.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:40:26 EDT 2022
% Result : Theorem 1.32s 0.53s
% Output : Refutation 1.32s
% Verified :
% SZS Type : Refutation
% Derivation depth : 16
% Number of leaves : 20
% Syntax : Number of formulae : 81 ( 7 unt; 0 def)
% Number of atoms : 415 ( 163 equ)
% Maximal formula atoms : 34 ( 5 avg)
% Number of connectives : 531 ( 197 ~; 170 |; 130 &)
% ( 10 <=>; 24 =>; 0 <=; 0 <~>)
% Maximal formula depth : 21 ( 5 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 13 ( 11 usr; 9 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 7 con; 0-2 aty)
% Number of variables : 115 ( 63 !; 52 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f357,plain,
$false,
inference(avatar_sat_refutation,[],[f196,f210,f219,f224,f229,f230,f281,f289,f356]) ).
fof(f356,plain,
( ~ spl10_2
| ~ spl10_4
| ~ spl10_5
| ~ spl10_8
| ~ spl10_9 ),
inference(avatar_contradiction_clause,[],[f355]) ).
fof(f355,plain,
( $false
| ~ spl10_2
| ~ spl10_4
| ~ spl10_5
| ~ spl10_8
| ~ spl10_9 ),
inference(subsumption_resolution,[],[f354,f203]) ).
fof(f203,plain,
( ssList(nil)
| ~ spl10_4 ),
inference(avatar_component_clause,[],[f202]) ).
fof(f202,plain,
( spl10_4
<=> ssList(nil) ),
introduced(avatar_definition,[new_symbols(naming,[spl10_4])]) ).
fof(f354,plain,
( ~ ssList(nil)
| ~ spl10_2
| ~ spl10_5
| ~ spl10_8
| ~ spl10_9 ),
inference(subsumption_resolution,[],[f353,f195]) ).
fof(f195,plain,
( ssItem(sK6)
| ~ spl10_2 ),
inference(avatar_component_clause,[],[f193]) ).
fof(f193,plain,
( spl10_2
<=> ssItem(sK6) ),
introduced(avatar_definition,[new_symbols(naming,[spl10_2])]) ).
fof(f353,plain,
( ~ ssItem(sK6)
| ~ ssList(nil)
| ~ spl10_5
| ~ spl10_8
| ~ spl10_9 ),
inference(resolution,[],[f352,f145]) ).
fof(f145,plain,
! [X0,X1] :
( ssList(cons(X1,X0))
| ~ ssItem(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f117]) ).
fof(f117,plain,
! [X0] :
( ~ ssList(X0)
| ! [X1] :
( ~ ssItem(X1)
| ssList(cons(X1,X0)) ) ),
inference(ennf_transformation,[],[f16]) ).
fof(f16,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssItem(X1)
=> ssList(cons(X1,X0)) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax16) ).
fof(f352,plain,
( ~ ssList(cons(sK6,nil))
| ~ spl10_5
| ~ spl10_8
| ~ spl10_9 ),
inference(subsumption_resolution,[],[f351,f223]) ).
fof(f223,plain,
( sK5 = app(sK7,cons(sK6,nil))
| ~ spl10_8 ),
inference(avatar_component_clause,[],[f221]) ).
fof(f221,plain,
( spl10_8
<=> sK5 = app(sK7,cons(sK6,nil)) ),
introduced(avatar_definition,[new_symbols(naming,[spl10_8])]) ).
fof(f351,plain,
( sK5 != app(sK7,cons(sK6,nil))
| ~ ssList(cons(sK6,nil))
| ~ spl10_5
| ~ spl10_9 ),
inference(subsumption_resolution,[],[f350,f228]) ).
fof(f228,plain,
( ssList(sK7)
| ~ spl10_9 ),
inference(avatar_component_clause,[],[f226]) ).
fof(f226,plain,
( spl10_9
<=> ssList(sK7) ),
introduced(avatar_definition,[new_symbols(naming,[spl10_9])]) ).
fof(f350,plain,
( ~ ssList(sK7)
| ~ ssList(cons(sK6,nil))
| sK5 != app(sK7,cons(sK6,nil))
| ~ spl10_5 ),
inference(trivial_inequality_removal,[],[f346]) ).
fof(f346,plain,
( ~ ssList(cons(sK6,nil))
| ~ ssList(sK7)
| sK2 != sK2
| sK5 != app(sK7,cons(sK6,nil))
| ~ spl10_5 ),
inference(superposition,[],[f177,f209]) ).
fof(f209,plain,
( sK2 = app(cons(sK6,nil),sK7)
| ~ spl10_5 ),
inference(avatar_component_clause,[],[f207]) ).
fof(f207,plain,
( spl10_5
<=> sK2 = app(cons(sK6,nil),sK7) ),
introduced(avatar_definition,[new_symbols(naming,[spl10_5])]) ).
fof(f177,plain,
! [X4,X5] :
( app(X5,X4) != sK2
| ~ ssList(X5)
| app(X4,X5) != sK5
| ~ ssList(X4) ),
inference(definition_unfolding,[],[f162,f165]) ).
fof(f165,plain,
sK3 = sK5,
inference(cnf_transformation,[],[f133]) ).
fof(f133,plain,
( ssList(sK2)
& sK3 = sK5
& ( nil = sK4
| nil != sK5 )
& sK4 = sK2
& ! [X4] :
( ! [X5] :
( app(X5,X4) != sK2
| ~ ssList(X5)
| app(X4,X5) != sK3 )
| ~ ssList(X4) )
& ssList(sK5)
& ( ~ neq(sK5,nil)
| ( ssItem(sK6)
& sK5 = app(sK7,cons(sK6,nil))
& sK4 = app(cons(sK6,nil),sK7)
& ssList(sK7) ) )
& ssList(sK4)
& ssList(sK3) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK2,sK3,sK4,sK5,sK6,sK7])],[f110,f132,f131,f130,f129,f128,f127]) ).
fof(f127,plain,
( ? [X0] :
( ssList(X0)
& ? [X1] :
( ? [X2] :
( ? [X3] :
( X1 = X3
& ( nil = X2
| nil != X3 )
& X0 = X2
& ! [X4] :
( ! [X5] :
( app(X5,X4) != X0
| ~ ssList(X5)
| app(X4,X5) != X1 )
| ~ ssList(X4) )
& ssList(X3)
& ( ~ neq(X3,nil)
| ? [X6] :
( ssItem(X6)
& ? [X7] :
( app(X7,cons(X6,nil)) = X3
& app(cons(X6,nil),X7) = X2
& ssList(X7) ) ) ) )
& ssList(X2) )
& ssList(X1) ) )
=> ( ssList(sK2)
& ? [X1] :
( ? [X2] :
( ? [X3] :
( X1 = X3
& ( nil = X2
| nil != X3 )
& sK2 = X2
& ! [X4] :
( ! [X5] :
( app(X5,X4) != sK2
| ~ ssList(X5)
| app(X4,X5) != X1 )
| ~ ssList(X4) )
& ssList(X3)
& ( ~ neq(X3,nil)
| ? [X6] :
( ssItem(X6)
& ? [X7] :
( app(X7,cons(X6,nil)) = X3
& app(cons(X6,nil),X7) = X2
& ssList(X7) ) ) ) )
& ssList(X2) )
& ssList(X1) ) ) ),
introduced(choice_axiom,[]) ).
fof(f128,plain,
( ? [X1] :
( ? [X2] :
( ? [X3] :
( X1 = X3
& ( nil = X2
| nil != X3 )
& sK2 = X2
& ! [X4] :
( ! [X5] :
( app(X5,X4) != sK2
| ~ ssList(X5)
| app(X4,X5) != X1 )
| ~ ssList(X4) )
& ssList(X3)
& ( ~ neq(X3,nil)
| ? [X6] :
( ssItem(X6)
& ? [X7] :
( app(X7,cons(X6,nil)) = X3
& app(cons(X6,nil),X7) = X2
& ssList(X7) ) ) ) )
& ssList(X2) )
& ssList(X1) )
=> ( ? [X2] :
( ? [X3] :
( sK3 = X3
& ( nil = X2
| nil != X3 )
& sK2 = X2
& ! [X4] :
( ! [X5] :
( app(X5,X4) != sK2
| ~ ssList(X5)
| app(X4,X5) != sK3 )
| ~ ssList(X4) )
& ssList(X3)
& ( ~ neq(X3,nil)
| ? [X6] :
( ssItem(X6)
& ? [X7] :
( app(X7,cons(X6,nil)) = X3
& app(cons(X6,nil),X7) = X2
& ssList(X7) ) ) ) )
& ssList(X2) )
& ssList(sK3) ) ),
introduced(choice_axiom,[]) ).
fof(f129,plain,
( ? [X2] :
( ? [X3] :
( sK3 = X3
& ( nil = X2
| nil != X3 )
& sK2 = X2
& ! [X4] :
( ! [X5] :
( app(X5,X4) != sK2
| ~ ssList(X5)
| app(X4,X5) != sK3 )
| ~ ssList(X4) )
& ssList(X3)
& ( ~ neq(X3,nil)
| ? [X6] :
( ssItem(X6)
& ? [X7] :
( app(X7,cons(X6,nil)) = X3
& app(cons(X6,nil),X7) = X2
& ssList(X7) ) ) ) )
& ssList(X2) )
=> ( ? [X3] :
( sK3 = X3
& ( nil = sK4
| nil != X3 )
& sK4 = sK2
& ! [X4] :
( ! [X5] :
( app(X5,X4) != sK2
| ~ ssList(X5)
| app(X4,X5) != sK3 )
| ~ ssList(X4) )
& ssList(X3)
& ( ~ neq(X3,nil)
| ? [X6] :
( ssItem(X6)
& ? [X7] :
( app(X7,cons(X6,nil)) = X3
& app(cons(X6,nil),X7) = sK4
& ssList(X7) ) ) ) )
& ssList(sK4) ) ),
introduced(choice_axiom,[]) ).
fof(f130,plain,
( ? [X3] :
( sK3 = X3
& ( nil = sK4
| nil != X3 )
& sK4 = sK2
& ! [X4] :
( ! [X5] :
( app(X5,X4) != sK2
| ~ ssList(X5)
| app(X4,X5) != sK3 )
| ~ ssList(X4) )
& ssList(X3)
& ( ~ neq(X3,nil)
| ? [X6] :
( ssItem(X6)
& ? [X7] :
( app(X7,cons(X6,nil)) = X3
& app(cons(X6,nil),X7) = sK4
& ssList(X7) ) ) ) )
=> ( sK3 = sK5
& ( nil = sK4
| nil != sK5 )
& sK4 = sK2
& ! [X4] :
( ! [X5] :
( app(X5,X4) != sK2
| ~ ssList(X5)
| app(X4,X5) != sK3 )
| ~ ssList(X4) )
& ssList(sK5)
& ( ~ neq(sK5,nil)
| ? [X6] :
( ssItem(X6)
& ? [X7] :
( app(X7,cons(X6,nil)) = sK5
& app(cons(X6,nil),X7) = sK4
& ssList(X7) ) ) ) ) ),
introduced(choice_axiom,[]) ).
fof(f131,plain,
( ? [X6] :
( ssItem(X6)
& ? [X7] :
( app(X7,cons(X6,nil)) = sK5
& app(cons(X6,nil),X7) = sK4
& ssList(X7) ) )
=> ( ssItem(sK6)
& ? [X7] :
( app(X7,cons(sK6,nil)) = sK5
& sK4 = app(cons(sK6,nil),X7)
& ssList(X7) ) ) ),
introduced(choice_axiom,[]) ).
fof(f132,plain,
( ? [X7] :
( app(X7,cons(sK6,nil)) = sK5
& sK4 = app(cons(sK6,nil),X7)
& ssList(X7) )
=> ( sK5 = app(sK7,cons(sK6,nil))
& sK4 = app(cons(sK6,nil),sK7)
& ssList(sK7) ) ),
introduced(choice_axiom,[]) ).
fof(f110,plain,
? [X0] :
( ssList(X0)
& ? [X1] :
( ? [X2] :
( ? [X3] :
( X1 = X3
& ( nil = X2
| nil != X3 )
& X0 = X2
& ! [X4] :
( ! [X5] :
( app(X5,X4) != X0
| ~ ssList(X5)
| app(X4,X5) != X1 )
| ~ ssList(X4) )
& ssList(X3)
& ( ~ neq(X3,nil)
| ? [X6] :
( ssItem(X6)
& ? [X7] :
( app(X7,cons(X6,nil)) = X3
& app(cons(X6,nil),X7) = X2
& ssList(X7) ) ) ) )
& ssList(X2) )
& ssList(X1) ) ),
inference(flattening,[],[f109]) ).
fof(f109,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( X0 = X2
& ( nil = X2
| nil != X3 )
& X1 = X3
& ( ~ neq(X3,nil)
| ? [X6] :
( ? [X7] :
( app(X7,cons(X6,nil)) = X3
& app(cons(X6,nil),X7) = X2
& ssList(X7) )
& ssItem(X6) ) )
& ! [X4] :
( ! [X5] :
( app(X5,X4) != X0
| ~ ssList(X5)
| app(X4,X5) != X1 )
| ~ ssList(X4) )
& 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)
=> ( X0 != X2
| ( nil != X2
& nil = X3 )
| X1 != X3
| ( neq(X3,nil)
& ! [X6] :
( ssItem(X6)
=> ! [X7] :
( ssList(X7)
=> ( app(X7,cons(X6,nil)) != X3
| app(cons(X6,nil),X7) != X2 ) ) ) )
| ? [X4] :
( ? [X5] :
( app(X4,X5) = X1
& app(X5,X4) = X0
& ssList(X5) )
& ssList(X4) ) ) ) ) ) ),
inference(negated_conjecture,[],[f96]) ).
fof(f96,conjecture,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( X0 != X2
| ( nil != X2
& nil = X3 )
| X1 != X3
| ( neq(X3,nil)
& ! [X6] :
( ssItem(X6)
=> ! [X7] :
( ssList(X7)
=> ( app(X7,cons(X6,nil)) != X3
| app(cons(X6,nil),X7) != X2 ) ) ) )
| ? [X4] :
( ? [X5] :
( app(X4,X5) = X1
& app(X5,X4) = X0
& ssList(X5) )
& ssList(X4) ) ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1) ).
fof(f162,plain,
! [X4,X5] :
( app(X5,X4) != sK2
| ~ ssList(X5)
| app(X4,X5) != sK3
| ~ ssList(X4) ),
inference(cnf_transformation,[],[f133]) ).
fof(f289,plain,
( ~ spl10_7
| ~ spl10_4
| ~ spl10_6 ),
inference(avatar_split_clause,[],[f288,f212,f202,f216]) ).
fof(f216,plain,
( spl10_7
<=> nil = sK2 ),
introduced(avatar_definition,[new_symbols(naming,[spl10_7])]) ).
fof(f212,plain,
( spl10_6
<=> nil = sK5 ),
introduced(avatar_definition,[new_symbols(naming,[spl10_6])]) ).
fof(f288,plain,
( nil != sK2
| ~ spl10_4
| ~ spl10_6 ),
inference(backward_demodulation,[],[f245,f213]) ).
fof(f213,plain,
( nil = sK5
| ~ spl10_6 ),
inference(avatar_component_clause,[],[f212]) ).
fof(f245,plain,
( sK2 != sK5
| ~ spl10_4 ),
inference(subsumption_resolution,[],[f244,f161]) ).
fof(f161,plain,
ssList(sK5),
inference(cnf_transformation,[],[f133]) ).
fof(f244,plain,
( ~ ssList(sK5)
| sK2 != sK5
| ~ spl10_4 ),
inference(equality_resolution,[],[f242]) ).
fof(f242,plain,
( ! [X0] :
( sK5 != X0
| sK2 != X0
| ~ ssList(X0) )
| ~ spl10_4 ),
inference(duplicate_literal_removal,[],[f239]) ).
fof(f239,plain,
( ! [X0] :
( sK5 != X0
| sK2 != X0
| ~ ssList(X0)
| ~ ssList(X0) )
| ~ spl10_4 ),
inference(superposition,[],[f235,f141]) ).
fof(f141,plain,
! [X0] :
( app(nil,X0) = X0
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f113]) ).
fof(f113,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/benchmark/theBenchmark.p',ax28) ).
fof(f235,plain,
( ! [X0] :
( app(nil,X0) != sK5
| sK2 != X0
| ~ ssList(X0) )
| ~ spl10_4 ),
inference(subsumption_resolution,[],[f234,f203]) ).
fof(f234,plain,
! [X0] :
( ~ ssList(X0)
| ~ ssList(nil)
| app(nil,X0) != sK5
| sK2 != X0 ),
inference(duplicate_literal_removal,[],[f233]) ).
fof(f233,plain,
! [X0] :
( ~ ssList(nil)
| ~ ssList(X0)
| ~ ssList(X0)
| sK2 != X0
| app(nil,X0) != sK5 ),
inference(superposition,[],[f177,f137]) ).
fof(f137,plain,
! [X0] :
( app(X0,nil) = X0
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f100]) ).
fof(f100,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/sandbox2/benchmark/theBenchmark.p',ax84) ).
fof(f281,plain,
( spl10_6
| spl10_1
| ~ spl10_4 ),
inference(avatar_split_clause,[],[f278,f202,f189,f212]) ).
fof(f189,plain,
( spl10_1
<=> neq(sK5,nil) ),
introduced(avatar_definition,[new_symbols(naming,[spl10_1])]) ).
fof(f278,plain,
( nil = sK5
| spl10_1
| ~ spl10_4 ),
inference(subsumption_resolution,[],[f277,f203]) ).
fof(f277,plain,
( ~ ssList(nil)
| nil = sK5
| spl10_1 ),
inference(subsumption_resolution,[],[f272,f161]) ).
fof(f272,plain,
( ~ ssList(sK5)
| ~ ssList(nil)
| nil = sK5
| spl10_1 ),
inference(resolution,[],[f151,f191]) ).
fof(f191,plain,
( ~ neq(sK5,nil)
| spl10_1 ),
inference(avatar_component_clause,[],[f189]) ).
fof(f151,plain,
! [X0,X1] :
( neq(X0,X1)
| ~ ssList(X1)
| ~ ssList(X0)
| X0 = X1 ),
inference(cnf_transformation,[],[f126]) ).
fof(f126,plain,
! [X0] :
( ~ ssList(X0)
| ! [X1] :
( ( ( neq(X0,X1)
| X0 = X1 )
& ( X0 != X1
| ~ neq(X0,X1) ) )
| ~ ssList(X1) ) ),
inference(nnf_transformation,[],[f99]) ).
fof(f99,plain,
! [X0] :
( ~ ssList(X0)
| ! [X1] :
( ( neq(X0,X1)
<=> X0 != X1 )
| ~ ssList(X1) ) ),
inference(ennf_transformation,[],[f15]) ).
fof(f15,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ( neq(X0,X1)
<=> X0 != X1 ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax15) ).
fof(f230,plain,
spl10_4,
inference(avatar_split_clause,[],[f171,f202]) ).
fof(f171,plain,
ssList(nil),
inference(cnf_transformation,[],[f17]) ).
fof(f17,axiom,
ssList(nil),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax17) ).
fof(f229,plain,
( spl10_9
| ~ spl10_1 ),
inference(avatar_split_clause,[],[f157,f189,f226]) ).
fof(f157,plain,
( ~ neq(sK5,nil)
| ssList(sK7) ),
inference(cnf_transformation,[],[f133]) ).
fof(f224,plain,
( ~ spl10_1
| spl10_8 ),
inference(avatar_split_clause,[],[f159,f221,f189]) ).
fof(f159,plain,
( sK5 = app(sK7,cons(sK6,nil))
| ~ neq(sK5,nil) ),
inference(cnf_transformation,[],[f133]) ).
fof(f219,plain,
( ~ spl10_6
| spl10_7 ),
inference(avatar_split_clause,[],[f176,f216,f212]) ).
fof(f176,plain,
( nil = sK2
| nil != sK5 ),
inference(definition_unfolding,[],[f164,f163]) ).
fof(f163,plain,
sK4 = sK2,
inference(cnf_transformation,[],[f133]) ).
fof(f164,plain,
( nil = sK4
| nil != sK5 ),
inference(cnf_transformation,[],[f133]) ).
fof(f210,plain,
( ~ spl10_1
| spl10_5 ),
inference(avatar_split_clause,[],[f178,f207,f189]) ).
fof(f178,plain,
( sK2 = app(cons(sK6,nil),sK7)
| ~ neq(sK5,nil) ),
inference(definition_unfolding,[],[f158,f163]) ).
fof(f158,plain,
( ~ neq(sK5,nil)
| sK4 = app(cons(sK6,nil),sK7) ),
inference(cnf_transformation,[],[f133]) ).
fof(f196,plain,
( ~ spl10_1
| spl10_2 ),
inference(avatar_split_clause,[],[f160,f193,f189]) ).
fof(f160,plain,
( ssItem(sK6)
| ~ neq(sK5,nil) ),
inference(cnf_transformation,[],[f133]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SWC325+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_uns --cores 0 -t %d %s
% 0.13/0.34 % Computer : n013.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 : Tue Aug 30 18:43:32 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.19/0.49 % (3639)ott+21_1:1_erd=off:s2a=on:sac=on:sd=1:sgt=64:sos=on:ss=included:st=3.0:to=lpo:urr=on:i=99:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/99Mi)
% 0.19/0.50 % (3646)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.19/0.50 % (3632)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.19/0.50 % (3632)Instruction limit reached!
% 0.19/0.50 % (3632)------------------------------
% 0.19/0.50 % (3632)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.19/0.50 % (3632)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.19/0.50 % (3632)Termination reason: Unknown
% 0.19/0.50 % (3632)Termination phase: Naming
% 0.19/0.50
% 0.19/0.50 % (3632)Memory used [KB]: 1535
% 0.19/0.50 % (3632)Time elapsed: 0.005 s
% 0.19/0.50 % (3632)Instructions burned: 3 (million)
% 0.19/0.50 % (3632)------------------------------
% 0.19/0.50 % (3632)------------------------------
% 0.19/0.50 % (3624)dis+1010_1:50_awrs=decay:awrsf=128:nwc=10.0:s2pl=no:sp=frequency:ss=axioms:i=39:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/39Mi)
% 0.19/0.50 % (3620)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.19/0.51 % (3620)Instruction limit reached!
% 0.19/0.51 % (3620)------------------------------
% 0.19/0.51 % (3620)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.19/0.51 % (3638)dis+1010_1:1_bs=on:ep=RS:erd=off:newcnf=on:nwc=10.0:s2a=on:sgt=32:ss=axioms:i=30:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/30Mi)
% 0.19/0.51 % (3626)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.19/0.51 % (3643)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.19/0.51 % (3620)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.19/0.51 % (3620)Termination reason: Unknown
% 0.19/0.51 % (3620)Termination phase: Preprocessing 3
% 0.19/0.51
% 0.19/0.51 % (3620)Memory used [KB]: 1663
% 0.19/0.51 % (3620)Time elapsed: 0.003 s
% 0.19/0.51 % (3620)Instructions burned: 3 (million)
% 0.19/0.51 % (3620)------------------------------
% 0.19/0.51 % (3620)------------------------------
% 0.19/0.52 % (3630)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.19/0.52 % (3629)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.19/0.52 % (3646)Instruction limit reached!
% 0.19/0.52 % (3646)------------------------------
% 0.19/0.52 % (3646)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.19/0.52 % (3623)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.19/0.52 % (3621)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.19/0.52 % (3631)lrs+10_1:32_br=off:nm=16:sd=2:ss=axioms:st=2.0:urr=on:i=51:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/51Mi)
% 0.19/0.52 % (3624)First to succeed.
% 1.32/0.53 % (3624)Refutation found. Thanks to Tanya!
% 1.32/0.53 % SZS status Theorem for theBenchmark
% 1.32/0.53 % SZS output start Proof for theBenchmark
% See solution above
% 1.32/0.53 % (3624)------------------------------
% 1.32/0.53 % (3624)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 1.32/0.53 % (3624)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 1.32/0.53 % (3624)Termination reason: Refutation
% 1.32/0.53
% 1.32/0.53 % (3624)Memory used [KB]: 6140
% 1.32/0.53 % (3624)Time elapsed: 0.085 s
% 1.32/0.53 % (3624)Instructions burned: 7 (million)
% 1.32/0.53 % (3624)------------------------------
% 1.32/0.53 % (3624)------------------------------
% 1.32/0.53 % (3617)Success in time 0.179 s
%------------------------------------------------------------------------------