TSTP Solution File: SWC312+1 by SnakeForV-SAT---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV-SAT---1.0
% Problem : SWC312+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 : n024.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:43:05 EDT 2022
% Result : Theorem 1.65s 0.61s
% Output : Refutation 1.65s
% Verified :
% SZS Type : Refutation
% Derivation depth : 25
% Number of leaves : 10
% Syntax : Number of formulae : 73 ( 17 unt; 0 def)
% Number of atoms : 397 ( 218 equ)
% Maximal formula atoms : 40 ( 5 avg)
% Number of connectives : 501 ( 177 ~; 160 |; 146 &)
% ( 0 <=>; 18 =>; 0 <=; 0 <~>)
% Maximal formula depth : 21 ( 5 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 12 ( 12 usr; 10 con; 0-2 aty)
% Number of variables : 102 ( 54 !; 48 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f656,plain,
$false,
inference(subsumption_resolution,[],[f655,f650]) ).
fof(f650,plain,
nil = app(sK27,sF59),
inference(backward_demodulation,[],[f592,f649]) ).
fof(f649,plain,
nil = sF60,
inference(resolution,[],[f641,f642]) ).
fof(f642,plain,
neq(nil,nil),
inference(trivial_inequality_removal,[],[f639]) ).
fof(f639,plain,
( neq(nil,nil)
| nil != nil ),
inference(backward_demodulation,[],[f626,f636]) ).
fof(f636,plain,
nil = sK22,
inference(trivial_inequality_removal,[],[f635]) ).
fof(f635,plain,
( nil = sK22
| nil != nil ),
inference(superposition,[],[f610,f629]) ).
fof(f629,plain,
nil = sK25,
inference(backward_demodulation,[],[f421,f624]) ).
fof(f624,plain,
nil = sK23,
inference(subsumption_resolution,[],[f623,f616]) ).
fof(f616,plain,
( sF60 = sK22
| nil = sK23 ),
inference(resolution,[],[f608,f417]) ).
fof(f417,plain,
( neq(sK23,nil)
| nil = sK23 ),
inference(cnf_transformation,[],[f272]) ).
fof(f272,plain,
( sK23 = sK25
& sK22 = sK24
& ( ( ! [X4] :
( ! [X5] :
( app(cons(X4,nil),X5) != sK23
| app(X5,cons(X4,nil)) != sK22
| ~ ssList(X5) )
| ~ ssItem(X4) )
& neq(sK23,nil) )
| ( nil = sK23
& nil != sK22 ) )
& ssList(sK25)
& ( nil != sK25
| nil = sK24 )
& ( ~ neq(sK25,nil)
| ( app(sK27,cons(sK26,nil)) = sK24
& app(cons(sK26,nil),sK27) = sK25
& ssList(sK27)
& ssItem(sK26) ) )
& ssList(sK24)
& ssList(sK23)
& ssList(sK22) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK22,sK23,sK24,sK25,sK26,sK27])],[f210,f271,f270,f269,f268,f267,f266]) ).
fof(f266,plain,
( ? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( X1 = X3
& X0 = X2
& ( ( ! [X4] :
( ! [X5] :
( app(cons(X4,nil),X5) != X1
| app(X5,cons(X4,nil)) != X0
| ~ ssList(X5) )
| ~ ssItem(X4) )
& neq(X1,nil) )
| ( nil = X1
& nil != X0 ) )
& ssList(X3)
& ( nil != X3
| nil = X2 )
& ( ~ neq(X3,nil)
| ? [X6] :
( ? [X7] :
( app(X7,cons(X6,nil)) = X2
& app(cons(X6,nil),X7) = X3
& ssList(X7) )
& ssItem(X6) ) ) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) )
=> ( ? [X1] :
( ? [X2] :
( ? [X3] :
( X1 = X3
& sK22 = X2
& ( ( ! [X4] :
( ! [X5] :
( app(cons(X4,nil),X5) != X1
| app(X5,cons(X4,nil)) != sK22
| ~ ssList(X5) )
| ~ ssItem(X4) )
& neq(X1,nil) )
| ( nil = X1
& nil != sK22 ) )
& ssList(X3)
& ( nil != X3
| nil = X2 )
& ( ~ neq(X3,nil)
| ? [X6] :
( ? [X7] :
( app(X7,cons(X6,nil)) = X2
& app(cons(X6,nil),X7) = X3
& ssList(X7) )
& ssItem(X6) ) ) )
& ssList(X2) )
& ssList(X1) )
& ssList(sK22) ) ),
introduced(choice_axiom,[]) ).
fof(f267,plain,
( ? [X1] :
( ? [X2] :
( ? [X3] :
( X1 = X3
& sK22 = X2
& ( ( ! [X4] :
( ! [X5] :
( app(cons(X4,nil),X5) != X1
| app(X5,cons(X4,nil)) != sK22
| ~ ssList(X5) )
| ~ ssItem(X4) )
& neq(X1,nil) )
| ( nil = X1
& nil != sK22 ) )
& ssList(X3)
& ( nil != X3
| nil = X2 )
& ( ~ neq(X3,nil)
| ? [X6] :
( ? [X7] :
( app(X7,cons(X6,nil)) = X2
& app(cons(X6,nil),X7) = X3
& ssList(X7) )
& ssItem(X6) ) ) )
& ssList(X2) )
& ssList(X1) )
=> ( ? [X2] :
( ? [X3] :
( sK23 = X3
& sK22 = X2
& ( ( ! [X4] :
( ! [X5] :
( app(cons(X4,nil),X5) != sK23
| app(X5,cons(X4,nil)) != sK22
| ~ ssList(X5) )
| ~ ssItem(X4) )
& neq(sK23,nil) )
| ( nil = sK23
& nil != sK22 ) )
& ssList(X3)
& ( nil != X3
| nil = X2 )
& ( ~ neq(X3,nil)
| ? [X6] :
( ? [X7] :
( app(X7,cons(X6,nil)) = X2
& app(cons(X6,nil),X7) = X3
& ssList(X7) )
& ssItem(X6) ) ) )
& ssList(X2) )
& ssList(sK23) ) ),
introduced(choice_axiom,[]) ).
fof(f268,plain,
( ? [X2] :
( ? [X3] :
( sK23 = X3
& sK22 = X2
& ( ( ! [X4] :
( ! [X5] :
( app(cons(X4,nil),X5) != sK23
| app(X5,cons(X4,nil)) != sK22
| ~ ssList(X5) )
| ~ ssItem(X4) )
& neq(sK23,nil) )
| ( nil = sK23
& nil != sK22 ) )
& ssList(X3)
& ( nil != X3
| nil = X2 )
& ( ~ neq(X3,nil)
| ? [X6] :
( ? [X7] :
( app(X7,cons(X6,nil)) = X2
& app(cons(X6,nil),X7) = X3
& ssList(X7) )
& ssItem(X6) ) ) )
& ssList(X2) )
=> ( ? [X3] :
( sK23 = X3
& sK22 = sK24
& ( ( ! [X4] :
( ! [X5] :
( app(cons(X4,nil),X5) != sK23
| app(X5,cons(X4,nil)) != sK22
| ~ ssList(X5) )
| ~ ssItem(X4) )
& neq(sK23,nil) )
| ( nil = sK23
& nil != sK22 ) )
& ssList(X3)
& ( nil != X3
| nil = sK24 )
& ( ~ neq(X3,nil)
| ? [X6] :
( ? [X7] :
( app(X7,cons(X6,nil)) = sK24
& app(cons(X6,nil),X7) = X3
& ssList(X7) )
& ssItem(X6) ) ) )
& ssList(sK24) ) ),
introduced(choice_axiom,[]) ).
fof(f269,plain,
( ? [X3] :
( sK23 = X3
& sK22 = sK24
& ( ( ! [X4] :
( ! [X5] :
( app(cons(X4,nil),X5) != sK23
| app(X5,cons(X4,nil)) != sK22
| ~ ssList(X5) )
| ~ ssItem(X4) )
& neq(sK23,nil) )
| ( nil = sK23
& nil != sK22 ) )
& ssList(X3)
& ( nil != X3
| nil = sK24 )
& ( ~ neq(X3,nil)
| ? [X6] :
( ? [X7] :
( app(X7,cons(X6,nil)) = sK24
& app(cons(X6,nil),X7) = X3
& ssList(X7) )
& ssItem(X6) ) ) )
=> ( sK23 = sK25
& sK22 = sK24
& ( ( ! [X4] :
( ! [X5] :
( app(cons(X4,nil),X5) != sK23
| app(X5,cons(X4,nil)) != sK22
| ~ ssList(X5) )
| ~ ssItem(X4) )
& neq(sK23,nil) )
| ( nil = sK23
& nil != sK22 ) )
& ssList(sK25)
& ( nil != sK25
| nil = sK24 )
& ( ~ neq(sK25,nil)
| ? [X6] :
( ? [X7] :
( app(X7,cons(X6,nil)) = sK24
& app(cons(X6,nil),X7) = sK25
& ssList(X7) )
& ssItem(X6) ) ) ) ),
introduced(choice_axiom,[]) ).
fof(f270,plain,
( ? [X6] :
( ? [X7] :
( app(X7,cons(X6,nil)) = sK24
& app(cons(X6,nil),X7) = sK25
& ssList(X7) )
& ssItem(X6) )
=> ( ? [X7] :
( app(X7,cons(sK26,nil)) = sK24
& app(cons(sK26,nil),X7) = sK25
& ssList(X7) )
& ssItem(sK26) ) ),
introduced(choice_axiom,[]) ).
fof(f271,plain,
( ? [X7] :
( app(X7,cons(sK26,nil)) = sK24
& app(cons(sK26,nil),X7) = sK25
& ssList(X7) )
=> ( app(sK27,cons(sK26,nil)) = sK24
& app(cons(sK26,nil),sK27) = sK25
& ssList(sK27) ) ),
introduced(choice_axiom,[]) ).
fof(f210,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( X1 = X3
& X0 = X2
& ( ( ! [X4] :
( ! [X5] :
( app(cons(X4,nil),X5) != X1
| app(X5,cons(X4,nil)) != X0
| ~ ssList(X5) )
| ~ ssItem(X4) )
& neq(X1,nil) )
| ( nil = X1
& nil != X0 ) )
& ssList(X3)
& ( nil != X3
| nil = X2 )
& ( ~ neq(X3,nil)
| ? [X6] :
( ? [X7] :
( app(X7,cons(X6,nil)) = X2
& app(cons(X6,nil),X7) = X3
& ssList(X7) )
& ssItem(X6) ) ) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(ennf_transformation,[],[f98]) ).
fof(f98,plain,
~ ! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ( ( ? [X4] :
( ssItem(X4)
& ? [X5] :
( ssList(X5)
& app(X5,cons(X4,nil)) = X0
& app(cons(X4,nil),X5) = X1 ) )
| ~ neq(X1,nil) )
& ( nil = X0
| nil != X1 ) )
| ( nil = X3
& nil != X2 )
| X1 != X3
| ( ! [X6] :
( ssItem(X6)
=> ! [X7] :
( app(cons(X6,nil),X7) != X3
| app(X7,cons(X6,nil)) != X2
| ~ ssList(X7) ) )
& neq(X3,nil) )
| ~ ssList(X3)
| X0 != X2 ) ) ) ),
inference(rectify,[],[f97]) ).
fof(f97,negated_conjecture,
~ ! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ( ( ~ neq(X1,nil)
| ? [X6] :
( ssItem(X6)
& ? [X7] :
( app(cons(X6,nil),X7) = X1
& ssList(X7)
& app(X7,cons(X6,nil)) = X0 ) ) )
& ( nil = X0
| nil != X1 ) )
| X1 != X3
| X0 != X2
| ( nil = X3
& nil != X2 )
| ( ! [X4] :
( ssItem(X4)
=> ! [X5] :
( app(cons(X4,nil),X5) != X3
| app(X5,cons(X4,nil)) != X2
| ~ ssList(X5) ) )
& neq(X3,nil) )
| ~ ssList(X3) ) ) ) ),
inference(negated_conjecture,[],[f96]) ).
fof(f96,conjecture,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ( ( ~ neq(X1,nil)
| ? [X6] :
( ssItem(X6)
& ? [X7] :
( app(cons(X6,nil),X7) = X1
& ssList(X7)
& app(X7,cons(X6,nil)) = X0 ) ) )
& ( nil = X0
| nil != X1 ) )
| X1 != X3
| X0 != X2
| ( nil = X3
& nil != X2 )
| ( ! [X4] :
( ssItem(X4)
=> ! [X5] :
( app(cons(X4,nil),X5) != X3
| app(X5,cons(X4,nil)) != X2
| ~ ssList(X5) ) )
& neq(X3,nil) )
| ~ ssList(X3) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1) ).
fof(f608,plain,
( ~ neq(sK23,nil)
| sF60 = sK22 ),
inference(backward_demodulation,[],[f606,f420]) ).
fof(f420,plain,
sK22 = sK24,
inference(cnf_transformation,[],[f272]) ).
fof(f606,plain,
( ~ neq(sK23,nil)
| sF60 = sK24 ),
inference(backward_demodulation,[],[f593,f421]) ).
fof(f593,plain,
( ~ neq(sK25,nil)
| sF60 = sK24 ),
inference(definition_folding,[],[f413,f592,f591]) ).
fof(f591,plain,
cons(sK26,nil) = sF59,
introduced(function_definition,[]) ).
fof(f413,plain,
( ~ neq(sK25,nil)
| app(sK27,cons(sK26,nil)) = sK24 ),
inference(cnf_transformation,[],[f272]) ).
fof(f623,plain,
( nil = sK23
| sF60 != sK22 ),
inference(superposition,[],[f622,f592]) ).
fof(f622,plain,
( app(sK27,sF59) != sK22
| nil = sK23 ),
inference(subsumption_resolution,[],[f621,f615]) ).
fof(f615,plain,
( sF61 = sK23
| nil = sK23 ),
inference(resolution,[],[f607,f417]) ).
fof(f607,plain,
( ~ neq(sK23,nil)
| sF61 = sK23 ),
inference(forward_demodulation,[],[f603,f421]) ).
fof(f603,plain,
( ~ neq(sK25,nil)
| sF61 = sK23 ),
inference(backward_demodulation,[],[f595,f421]) ).
fof(f595,plain,
( ~ neq(sK25,nil)
| sF61 = sK25 ),
inference(definition_folding,[],[f412,f594,f591]) ).
fof(f594,plain,
sF61 = app(sF59,sK27),
introduced(function_definition,[]) ).
fof(f412,plain,
( ~ neq(sK25,nil)
| app(cons(sK26,nil),sK27) = sK25 ),
inference(cnf_transformation,[],[f272]) ).
fof(f621,plain,
( sF61 != sK23
| nil = sK23
| app(sK27,sF59) != sK22 ),
inference(subsumption_resolution,[],[f620,f614]) ).
fof(f614,plain,
( ssList(sK27)
| nil = sK23 ),
inference(resolution,[],[f417,f605]) ).
fof(f605,plain,
( ~ neq(sK23,nil)
| ssList(sK27) ),
inference(backward_demodulation,[],[f411,f421]) ).
fof(f411,plain,
( ssList(sK27)
| ~ neq(sK25,nil) ),
inference(cnf_transformation,[],[f272]) ).
fof(f620,plain,
( ~ ssList(sK27)
| app(sK27,sF59) != sK22
| sF61 != sK23
| nil = sK23 ),
inference(superposition,[],[f619,f594]) ).
fof(f619,plain,
! [X0] :
( sK23 != app(sF59,X0)
| nil = sK23
| app(X0,sF59) != sK22
| ~ ssList(X0) ),
inference(subsumption_resolution,[],[f618,f613]) ).
fof(f613,plain,
( ssItem(sK26)
| nil = sK23 ),
inference(resolution,[],[f417,f609]) ).
fof(f609,plain,
( ~ neq(sK23,nil)
| ssItem(sK26) ),
inference(forward_demodulation,[],[f410,f421]) ).
fof(f410,plain,
( ~ neq(sK25,nil)
| ssItem(sK26) ),
inference(cnf_transformation,[],[f272]) ).
fof(f618,plain,
! [X0] :
( sK23 != app(sF59,X0)
| ~ ssItem(sK26)
| nil = sK23
| ~ ssList(X0)
| app(X0,sF59) != sK22 ),
inference(superposition,[],[f419,f591]) ).
fof(f419,plain,
! [X4,X5] :
( app(cons(X4,nil),X5) != sK23
| ~ ssList(X5)
| nil = sK23
| ~ ssItem(X4)
| app(X5,cons(X4,nil)) != sK22 ),
inference(cnf_transformation,[],[f272]) ).
fof(f421,plain,
sK23 = sK25,
inference(cnf_transformation,[],[f272]) ).
fof(f610,plain,
( nil != sK25
| nil = sK22 ),
inference(forward_demodulation,[],[f414,f420]) ).
fof(f414,plain,
( nil = sK24
| nil != sK25 ),
inference(cnf_transformation,[],[f272]) ).
fof(f626,plain,
( neq(nil,nil)
| nil != sK22 ),
inference(backward_demodulation,[],[f416,f624]) ).
fof(f416,plain,
( nil != sK22
| neq(sK23,nil) ),
inference(cnf_transformation,[],[f272]) ).
fof(f641,plain,
( ~ neq(nil,nil)
| nil = sF60 ),
inference(backward_demodulation,[],[f632,f636]) ).
fof(f632,plain,
( sF60 = sK22
| ~ neq(nil,nil) ),
inference(backward_demodulation,[],[f608,f624]) ).
fof(f592,plain,
sF60 = app(sK27,sF59),
introduced(function_definition,[]) ).
fof(f655,plain,
nil != app(sK27,sF59),
inference(subsumption_resolution,[],[f654,f645]) ).
fof(f645,plain,
ssList(sK27),
inference(resolution,[],[f630,f642]) ).
fof(f630,plain,
( ~ neq(nil,nil)
| ssList(sK27) ),
inference(backward_demodulation,[],[f605,f624]) ).
fof(f654,plain,
( ~ ssList(sK27)
| nil != app(sK27,sF59) ),
inference(trivial_inequality_removal,[],[f653]) ).
fof(f653,plain,
( nil != nil
| ~ ssList(sK27)
| nil != app(sK27,sF59) ),
inference(superposition,[],[f652,f648]) ).
fof(f648,plain,
nil = app(sF59,sK27),
inference(backward_demodulation,[],[f594,f647]) ).
fof(f647,plain,
nil = sF61,
inference(resolution,[],[f634,f642]) ).
fof(f634,plain,
( ~ neq(nil,nil)
| nil = sF61 ),
inference(forward_demodulation,[],[f631,f624]) ).
fof(f631,plain,
( sF61 = sK23
| ~ neq(nil,nil) ),
inference(backward_demodulation,[],[f607,f624]) ).
fof(f652,plain,
! [X0] :
( nil != app(sF59,X0)
| ~ ssList(X0)
| nil != app(X0,sF59) ),
inference(subsumption_resolution,[],[f651,f646]) ).
fof(f646,plain,
ssItem(sK26),
inference(resolution,[],[f633,f642]) ).
fof(f633,plain,
( ~ neq(nil,nil)
| ssItem(sK26) ),
inference(backward_demodulation,[],[f609,f624]) ).
fof(f651,plain,
! [X0] :
( ~ ssItem(sK26)
| ~ ssList(X0)
| nil != app(X0,sF59)
| nil != app(sF59,X0) ),
inference(superposition,[],[f644,f591]) ).
fof(f644,plain,
! [X4,X5] :
( nil != app(cons(X4,nil),X5)
| nil != app(X5,cons(X4,nil))
| ~ ssItem(X4)
| ~ ssList(X5) ),
inference(forward_demodulation,[],[f643,f636]) ).
fof(f643,plain,
! [X4,X5] :
( ~ ssList(X5)
| ~ ssItem(X4)
| app(X5,cons(X4,nil)) != sK22
| nil != app(cons(X4,nil),X5) ),
inference(trivial_inequality_removal,[],[f640]) ).
fof(f640,plain,
! [X4,X5] :
( nil != nil
| ~ ssList(X5)
| nil != app(cons(X4,nil),X5)
| ~ ssItem(X4)
| app(X5,cons(X4,nil)) != sK22 ),
inference(backward_demodulation,[],[f628,f636]) ).
fof(f628,plain,
! [X4,X5] :
( nil != sK22
| ~ ssItem(X4)
| nil != app(cons(X4,nil),X5)
| app(X5,cons(X4,nil)) != sK22
| ~ ssList(X5) ),
inference(backward_demodulation,[],[f418,f624]) ).
fof(f418,plain,
! [X4,X5] :
( nil != sK22
| ~ ssList(X5)
| ~ ssItem(X4)
| app(cons(X4,nil),X5) != sK23
| app(X5,cons(X4,nil)) != sK22 ),
inference(cnf_transformation,[],[f272]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.13 % Problem : SWC312+1 : TPTP v8.1.0. Released v2.4.0.
% 0.03/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.13/0.35 % Computer : n024.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Tue Aug 30 18:47:49 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.20/0.56 % (17497)fmb+10_1:1_fmbsr=2.0:nm=4:skr=on:i=51:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/51Mi)
% 0.20/0.56 % (17498)dis+10_1:1_fsd=on:sp=occurrence:i=7:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/7Mi)
% 0.20/0.56 % (17499)dis+2_1:64_add=large:bce=on:bd=off:i=2:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/2Mi)
% 0.20/0.56 % (17499)Instruction limit reached!
% 0.20/0.56 % (17499)------------------------------
% 0.20/0.56 % (17499)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.20/0.56 % (17499)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.20/0.56 % (17499)Termination reason: Unknown
% 0.20/0.56 % (17499)Termination phase: Preprocessing 2
% 0.20/0.56
% 0.20/0.56 % (17499)Memory used [KB]: 1023
% 0.20/0.56 % (17499)Time elapsed: 0.003 s
% 0.20/0.56 % (17499)Instructions burned: 2 (million)
% 0.20/0.56 % (17499)------------------------------
% 0.20/0.56 % (17499)------------------------------
% 0.20/0.56 % (17498)Instruction limit reached!
% 0.20/0.56 % (17498)------------------------------
% 0.20/0.56 % (17498)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.20/0.56 % (17513)dis+21_1:1_av=off:er=filter:slsq=on:slsqc=0:slsqr=1,1:sp=frequency:to=lpo:i=498:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/498Mi)
% 0.20/0.57 % (17514)ott+11_1:1_drc=off:nwc=5.0:slsq=on:slsqc=1:spb=goal_then_units:to=lpo:i=467:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/467Mi)
% 0.20/0.57 % (17507)dis+34_1:32_abs=on:add=off:bsr=on:gsp=on:sp=weighted_frequency:i=99:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/99Mi)
% 0.20/0.57 % (17515)ott+10_1:1_kws=precedence:tgt=ground:i=482:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/482Mi)
% 0.20/0.57 % (17505)ins+10_1:1_awrs=decay:awrsf=30:bsr=unit_only:foolp=on:igrr=8/457:igs=10:igwr=on:nwc=1.5:sp=weighted_frequency:to=lpo:uhcvi=on:i=68:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/68Mi)
% 0.20/0.57 % (17506)ott+11_2:3_av=off:fde=unused:nwc=5.0:tgt=ground:i=75:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/75Mi)
% 0.20/0.57 % (17498)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.20/0.57 % (17498)Termination reason: Unknown
% 0.20/0.57 % (17498)Termination phase: Property scanning
% 0.20/0.57
% 0.20/0.57 % (17498)Memory used [KB]: 1279
% 0.20/0.57 % (17498)Time elapsed: 0.007 s
% 0.20/0.57 % (17498)Instructions burned: 7 (million)
% 0.20/0.57 % (17498)------------------------------
% 0.20/0.57 % (17498)------------------------------
% 0.20/0.60 % (17506)First to succeed.
% 1.65/0.61 TRYING [1]
% 1.65/0.61 % (17506)Refutation found. Thanks to Tanya!
% 1.65/0.61 % SZS status Theorem for theBenchmark
% 1.65/0.61 % SZS output start Proof for theBenchmark
% See solution above
% 1.65/0.61 % (17506)------------------------------
% 1.65/0.61 % (17506)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 1.65/0.61 % (17506)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 1.65/0.61 % (17506)Termination reason: Refutation
% 1.65/0.61
% 1.65/0.61 % (17506)Memory used [KB]: 1535
% 1.65/0.61 % (17506)Time elapsed: 0.172 s
% 1.65/0.61 % (17506)Instructions burned: 19 (million)
% 1.65/0.61 % (17506)------------------------------
% 1.65/0.61 % (17506)------------------------------
% 1.65/0.61 % (17490)Success in time 0.243 s
%------------------------------------------------------------------------------