TSTP Solution File: SWC320+1 by SnakeForV-SAT---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV-SAT---1.0
% Problem : SWC320+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 : 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 : Wed Aug 31 18:43:09 EDT 2022
% Result : Theorem 0.19s 0.54s
% Output : Refutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 25
% Number of leaves : 9
% Syntax : Number of formulae : 57 ( 9 unt; 0 def)
% Number of atoms : 379 ( 194 equ)
% Maximal formula atoms : 40 ( 6 avg)
% Number of connectives : 486 ( 164 ~; 153 |; 147 &)
% ( 2 <=>; 20 =>; 0 <=; 0 <~>)
% Maximal formula depth : 21 ( 6 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 7 con; 0-2 aty)
% Number of variables : 100 ( 52 !; 48 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f655,plain,
$false,
inference(resolution,[],[f654,f358]) ).
fof(f358,plain,
ssList(nil),
inference(cnf_transformation,[],[f17]) ).
fof(f17,axiom,
ssList(nil),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax17) ).
fof(f654,plain,
~ ssList(nil),
inference(resolution,[],[f652,f604]) ).
fof(f604,plain,
! [X1] :
( ~ neq(X1,X1)
| ~ ssList(X1) ),
inference(duplicate_literal_removal,[],[f579]) ).
fof(f579,plain,
! [X1] :
( ~ ssList(X1)
| ~ ssList(X1)
| ~ neq(X1,X1) ),
inference(equality_resolution,[],[f395]) ).
fof(f395,plain,
! [X0,X1] :
( ~ ssList(X0)
| X0 != X1
| ~ neq(X0,X1)
| ~ ssList(X1) ),
inference(cnf_transformation,[],[f254]) ).
fof(f254,plain,
! [X0] :
( ~ ssList(X0)
| ! [X1] :
( ( ( neq(X0,X1)
| X0 = X1 )
& ( X0 != X1
| ~ neq(X0,X1) ) )
| ~ ssList(X1) ) ),
inference(nnf_transformation,[],[f102]) ).
fof(f102,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(f652,plain,
neq(nil,nil),
inference(trivial_inequality_removal,[],[f651]) ).
fof(f651,plain,
( neq(nil,nil)
| nil != nil ),
inference(forward_demodulation,[],[f631,f640]) ).
fof(f640,plain,
nil = sK31,
inference(trivial_inequality_removal,[],[f627]) ).
fof(f627,plain,
( nil != nil
| nil = sK31 ),
inference(backward_demodulation,[],[f564,f625]) ).
fof(f625,plain,
nil = sK30,
inference(duplicate_literal_removal,[],[f624]) ).
fof(f624,plain,
( nil = sK30
| nil = sK30 ),
inference(resolution,[],[f622,f449]) ).
fof(f449,plain,
( neq(sK30,nil)
| nil = sK30 ),
inference(cnf_transformation,[],[f286]) ).
fof(f286,plain,
( ( nil = sK31
| nil != sK32 )
& ssList(sK32)
& ( ( nil = sK30
& nil != sK29 )
| ( ! [X4] :
( ! [X5] :
( app(cons(X4,nil),X5) != sK29
| app(X5,cons(X4,nil)) != sK30
| ~ ssList(X5) )
| ~ ssItem(X4) )
& neq(sK30,nil) ) )
& sK29 = sK31
& sK32 = sK30
& ( ( ssItem(sK33)
& ssList(sK34)
& app(sK34,cons(sK33,nil)) = sK32
& sK31 = app(cons(sK33,nil),sK34) )
| ~ neq(sK32,nil) )
& ssList(sK31)
& ssList(sK30)
& ssList(sK29) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK29,sK30,sK31,sK32,sK33,sK34])],[f138,f285,f284,f283,f282,f281,f280]) ).
fof(f280,plain,
( ? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( nil = X2
| nil != X3 )
& ssList(X3)
& ( ( nil = X1
& nil != X0 )
| ( ! [X4] :
( ! [X5] :
( app(cons(X4,nil),X5) != X0
| app(X5,cons(X4,nil)) != X1
| ~ ssList(X5) )
| ~ ssItem(X4) )
& neq(X1,nil) ) )
& X0 = X2
& X1 = X3
& ( ? [X6] :
( ssItem(X6)
& ? [X7] :
( ssList(X7)
& app(X7,cons(X6,nil)) = X3
& app(cons(X6,nil),X7) = X2 ) )
| ~ neq(X3,nil) ) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) )
=> ( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( nil = X2
| nil != X3 )
& ssList(X3)
& ( ( nil = X1
& nil != sK29 )
| ( ! [X4] :
( ! [X5] :
( app(cons(X4,nil),X5) != sK29
| app(X5,cons(X4,nil)) != X1
| ~ ssList(X5) )
| ~ ssItem(X4) )
& neq(X1,nil) ) )
& sK29 = X2
& X1 = X3
& ( ? [X6] :
( ssItem(X6)
& ? [X7] :
( ssList(X7)
& app(X7,cons(X6,nil)) = X3
& app(cons(X6,nil),X7) = X2 ) )
| ~ neq(X3,nil) ) )
& ssList(X2) )
& ssList(X1) )
& ssList(sK29) ) ),
introduced(choice_axiom,[]) ).
fof(f281,plain,
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( nil = X2
| nil != X3 )
& ssList(X3)
& ( ( nil = X1
& nil != sK29 )
| ( ! [X4] :
( ! [X5] :
( app(cons(X4,nil),X5) != sK29
| app(X5,cons(X4,nil)) != X1
| ~ ssList(X5) )
| ~ ssItem(X4) )
& neq(X1,nil) ) )
& sK29 = X2
& X1 = X3
& ( ? [X6] :
( ssItem(X6)
& ? [X7] :
( ssList(X7)
& app(X7,cons(X6,nil)) = X3
& app(cons(X6,nil),X7) = X2 ) )
| ~ neq(X3,nil) ) )
& ssList(X2) )
& ssList(X1) )
=> ( ? [X2] :
( ? [X3] :
( ( nil = X2
| nil != X3 )
& ssList(X3)
& ( ( nil = sK30
& nil != sK29 )
| ( ! [X4] :
( ! [X5] :
( app(cons(X4,nil),X5) != sK29
| app(X5,cons(X4,nil)) != sK30
| ~ ssList(X5) )
| ~ ssItem(X4) )
& neq(sK30,nil) ) )
& sK29 = X2
& sK30 = X3
& ( ? [X6] :
( ssItem(X6)
& ? [X7] :
( ssList(X7)
& app(X7,cons(X6,nil)) = X3
& app(cons(X6,nil),X7) = X2 ) )
| ~ neq(X3,nil) ) )
& ssList(X2) )
& ssList(sK30) ) ),
introduced(choice_axiom,[]) ).
fof(f282,plain,
( ? [X2] :
( ? [X3] :
( ( nil = X2
| nil != X3 )
& ssList(X3)
& ( ( nil = sK30
& nil != sK29 )
| ( ! [X4] :
( ! [X5] :
( app(cons(X4,nil),X5) != sK29
| app(X5,cons(X4,nil)) != sK30
| ~ ssList(X5) )
| ~ ssItem(X4) )
& neq(sK30,nil) ) )
& sK29 = X2
& sK30 = X3
& ( ? [X6] :
( ssItem(X6)
& ? [X7] :
( ssList(X7)
& app(X7,cons(X6,nil)) = X3
& app(cons(X6,nil),X7) = X2 ) )
| ~ neq(X3,nil) ) )
& ssList(X2) )
=> ( ? [X3] :
( ( nil = sK31
| nil != X3 )
& ssList(X3)
& ( ( nil = sK30
& nil != sK29 )
| ( ! [X4] :
( ! [X5] :
( app(cons(X4,nil),X5) != sK29
| app(X5,cons(X4,nil)) != sK30
| ~ ssList(X5) )
| ~ ssItem(X4) )
& neq(sK30,nil) ) )
& sK29 = sK31
& sK30 = X3
& ( ? [X6] :
( ssItem(X6)
& ? [X7] :
( ssList(X7)
& app(X7,cons(X6,nil)) = X3
& app(cons(X6,nil),X7) = sK31 ) )
| ~ neq(X3,nil) ) )
& ssList(sK31) ) ),
introduced(choice_axiom,[]) ).
fof(f283,plain,
( ? [X3] :
( ( nil = sK31
| nil != X3 )
& ssList(X3)
& ( ( nil = sK30
& nil != sK29 )
| ( ! [X4] :
( ! [X5] :
( app(cons(X4,nil),X5) != sK29
| app(X5,cons(X4,nil)) != sK30
| ~ ssList(X5) )
| ~ ssItem(X4) )
& neq(sK30,nil) ) )
& sK29 = sK31
& sK30 = X3
& ( ? [X6] :
( ssItem(X6)
& ? [X7] :
( ssList(X7)
& app(X7,cons(X6,nil)) = X3
& app(cons(X6,nil),X7) = sK31 ) )
| ~ neq(X3,nil) ) )
=> ( ( nil = sK31
| nil != sK32 )
& ssList(sK32)
& ( ( nil = sK30
& nil != sK29 )
| ( ! [X4] :
( ! [X5] :
( app(cons(X4,nil),X5) != sK29
| app(X5,cons(X4,nil)) != sK30
| ~ ssList(X5) )
| ~ ssItem(X4) )
& neq(sK30,nil) ) )
& sK29 = sK31
& sK32 = sK30
& ( ? [X6] :
( ssItem(X6)
& ? [X7] :
( ssList(X7)
& app(X7,cons(X6,nil)) = sK32
& app(cons(X6,nil),X7) = sK31 ) )
| ~ neq(sK32,nil) ) ) ),
introduced(choice_axiom,[]) ).
fof(f284,plain,
( ? [X6] :
( ssItem(X6)
& ? [X7] :
( ssList(X7)
& app(X7,cons(X6,nil)) = sK32
& app(cons(X6,nil),X7) = sK31 ) )
=> ( ssItem(sK33)
& ? [X7] :
( ssList(X7)
& app(X7,cons(sK33,nil)) = sK32
& app(cons(sK33,nil),X7) = sK31 ) ) ),
introduced(choice_axiom,[]) ).
fof(f285,plain,
( ? [X7] :
( ssList(X7)
& app(X7,cons(sK33,nil)) = sK32
& app(cons(sK33,nil),X7) = sK31 )
=> ( ssList(sK34)
& app(sK34,cons(sK33,nil)) = sK32
& sK31 = app(cons(sK33,nil),sK34) ) ),
introduced(choice_axiom,[]) ).
fof(f138,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( nil = X2
| nil != X3 )
& ssList(X3)
& ( ( nil = X1
& nil != X0 )
| ( ! [X4] :
( ! [X5] :
( app(cons(X4,nil),X5) != X0
| app(X5,cons(X4,nil)) != X1
| ~ ssList(X5) )
| ~ ssItem(X4) )
& neq(X1,nil) ) )
& X0 = X2
& X1 = X3
& ( ? [X6] :
( ssItem(X6)
& ? [X7] :
( ssList(X7)
& app(X7,cons(X6,nil)) = X3
& app(cons(X6,nil),X7) = X2 ) )
| ~ neq(X3,nil) ) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(ennf_transformation,[],[f98]) ).
fof(f98,plain,
~ ! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( X1 != X3
| ( nil != X2
& nil = X3 )
| ( neq(X3,nil)
& ! [X6] :
( ssItem(X6)
=> ! [X7] :
( app(cons(X6,nil),X7) != X2
| ~ ssList(X7)
| app(X7,cons(X6,nil)) != X3 ) ) )
| X0 != X2
| ~ ssList(X3)
| ( ( ~ neq(X1,nil)
| ? [X4] :
( ssItem(X4)
& ? [X5] :
( ssList(X5)
& app(X5,cons(X4,nil)) = X1
& app(cons(X4,nil),X5) = X0 ) ) )
& ( nil = X0
| nil != X1 ) ) ) ) ) ),
inference(rectify,[],[f97]) ).
fof(f97,negated_conjecture,
~ ! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ( ( nil = X0
| nil != X1 )
& ( ~ neq(X1,nil)
| ? [X6] :
( ssItem(X6)
& ? [X7] :
( ssList(X7)
& app(X7,cons(X6,nil)) = X1
& app(cons(X6,nil),X7) = X0 ) ) ) )
| ~ ssList(X3)
| ( ! [X4] :
( ssItem(X4)
=> ! [X5] :
( app(X5,cons(X4,nil)) != X3
| app(cons(X4,nil),X5) != X2
| ~ ssList(X5) ) )
& neq(X3,nil) )
| X1 != X3
| ( nil != X2
& nil = X3 )
| X0 != X2 ) ) ) ),
inference(negated_conjecture,[],[f96]) ).
fof(f96,conjecture,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ( ( nil = X0
| nil != X1 )
& ( ~ neq(X1,nil)
| ? [X6] :
( ssItem(X6)
& ? [X7] :
( ssList(X7)
& app(X7,cons(X6,nil)) = X1
& app(cons(X6,nil),X7) = X0 ) ) ) )
| ~ ssList(X3)
| ( ! [X4] :
( ssItem(X4)
=> ! [X5] :
( app(X5,cons(X4,nil)) != X3
| app(cons(X4,nil),X5) != X2
| ~ ssList(X5) ) )
& neq(X3,nil) )
| X1 != X3
| ( nil != X2
& nil = X3 )
| X0 != X2 ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1) ).
fof(f622,plain,
( ~ neq(sK30,nil)
| nil = sK30 ),
inference(resolution,[],[f621,f569]) ).
fof(f569,plain,
( ssItem(sK33)
| ~ neq(sK30,nil) ),
inference(definition_unfolding,[],[f444,f445]) ).
fof(f445,plain,
sK32 = sK30,
inference(cnf_transformation,[],[f286]) ).
fof(f444,plain,
( ssItem(sK33)
| ~ neq(sK32,nil) ),
inference(cnf_transformation,[],[f286]) ).
fof(f621,plain,
( ~ ssItem(sK33)
| nil = sK30 ),
inference(duplicate_literal_removal,[],[f620]) ).
fof(f620,plain,
( ~ ssItem(sK33)
| nil = sK30
| nil = sK30 ),
inference(resolution,[],[f618,f449]) ).
fof(f618,plain,
( ~ neq(sK30,nil)
| ~ ssItem(sK33)
| nil = sK30 ),
inference(resolution,[],[f617,f570]) ).
fof(f570,plain,
( ssList(sK34)
| ~ neq(sK30,nil) ),
inference(definition_unfolding,[],[f443,f445]) ).
fof(f443,plain,
( ssList(sK34)
| ~ neq(sK32,nil) ),
inference(cnf_transformation,[],[f286]) ).
fof(f617,plain,
( ~ ssList(sK34)
| ~ ssItem(sK33)
| nil = sK30 ),
inference(trivial_inequality_removal,[],[f616]) ).
fof(f616,plain,
( ~ ssItem(sK33)
| sK31 != sK31
| ~ ssList(sK34)
| nil = sK30 ),
inference(duplicate_literal_removal,[],[f615]) ).
fof(f615,plain,
( ~ ssList(sK34)
| sK31 != sK31
| ~ ssItem(sK33)
| nil = sK30
| nil = sK30 ),
inference(superposition,[],[f614,f611]) ).
fof(f611,plain,
( sK31 = app(cons(sK33,nil),sK34)
| nil = sK30 ),
inference(resolution,[],[f572,f449]) ).
fof(f572,plain,
( ~ neq(sK30,nil)
| sK31 = app(cons(sK33,nil),sK34) ),
inference(definition_unfolding,[],[f441,f445]) ).
fof(f441,plain,
( sK31 = app(cons(sK33,nil),sK34)
| ~ neq(sK32,nil) ),
inference(cnf_transformation,[],[f286]) ).
fof(f614,plain,
( sK31 != app(cons(sK33,nil),sK34)
| nil = sK30
| ~ ssList(sK34)
| ~ ssItem(sK33) ),
inference(trivial_inequality_removal,[],[f613]) ).
fof(f613,plain,
( sK30 != sK30
| nil = sK30
| ~ ssItem(sK33)
| ~ ssList(sK34)
| sK31 != app(cons(sK33,nil),sK34) ),
inference(duplicate_literal_removal,[],[f612]) ).
fof(f612,plain,
( nil = sK30
| ~ ssItem(sK33)
| nil = sK30
| sK30 != sK30
| ~ ssList(sK34)
| sK31 != app(cons(sK33,nil),sK34) ),
inference(superposition,[],[f566,f609]) ).
fof(f609,plain,
( app(sK34,cons(sK33,nil)) = sK30
| nil = sK30 ),
inference(resolution,[],[f571,f449]) ).
fof(f571,plain,
( ~ neq(sK30,nil)
| app(sK34,cons(sK33,nil)) = sK30 ),
inference(definition_unfolding,[],[f442,f445,f445]) ).
fof(f442,plain,
( app(sK34,cons(sK33,nil)) = sK32
| ~ neq(sK32,nil) ),
inference(cnf_transformation,[],[f286]) ).
fof(f566,plain,
! [X4,X5] :
( app(X5,cons(X4,nil)) != sK30
| nil = sK30
| app(cons(X4,nil),X5) != sK31
| ~ ssList(X5)
| ~ ssItem(X4) ),
inference(definition_unfolding,[],[f450,f446]) ).
fof(f446,plain,
sK29 = sK31,
inference(cnf_transformation,[],[f286]) ).
fof(f450,plain,
! [X4,X5] :
( nil = sK30
| app(cons(X4,nil),X5) != sK29
| app(X5,cons(X4,nil)) != sK30
| ~ ssList(X5)
| ~ ssItem(X4) ),
inference(cnf_transformation,[],[f286]) ).
fof(f564,plain,
( nil != sK30
| nil = sK31 ),
inference(definition_unfolding,[],[f452,f445]) ).
fof(f452,plain,
( nil = sK31
| nil != sK32 ),
inference(cnf_transformation,[],[f286]) ).
fof(f631,plain,
( neq(nil,nil)
| nil != sK31 ),
inference(backward_demodulation,[],[f568,f625]) ).
fof(f568,plain,
( neq(sK30,nil)
| nil != sK31 ),
inference(definition_unfolding,[],[f447,f446]) ).
fof(f447,plain,
( nil != sK29
| neq(sK30,nil) ),
inference(cnf_transformation,[],[f286]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SWC320+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.34 % Computer : n003.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:47:07 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.19/0.49 % (1575)ott+10_1:28_bd=off:bs=on:tgt=ground:i=101:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/101Mi)
% 0.19/0.49 % (1570)dis+10_1:1_fsd=on:sp=occurrence:i=7:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/7Mi)
% 0.19/0.50 % (1563)fmb+10_1:1_bce=on:fmbsr=1.5:nm=4:skr=on:i=191324:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/191324Mi)
% 0.19/0.51 % (1572)ott-1_1:6_av=off:cond=on:fsr=off:nwc=3.0:i=51:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/51Mi)
% 0.19/0.51 % (1579)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.19/0.51 % (1574)ott+10_1:32_bd=off:fsr=off:newcnf=on:tgt=full:i=100:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/100Mi)
% 0.19/0.51 % (1566)ott+10_1:32_bd=off:fsr=off:newcnf=on:tgt=full:i=51:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/51Mi)
% 0.19/0.52 % (1581)ott+10_1:1_tgt=ground:i=100:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/100Mi)
% 0.19/0.52 % (1568)dis+34_1:32_abs=on:add=off:bsr=on:gsp=on:sp=weighted_frequency:i=48:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/48Mi)
% 0.19/0.52 % (1570)Instruction limit reached!
% 0.19/0.52 % (1570)------------------------------
% 0.19/0.52 % (1570)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.19/0.52 % (1570)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.19/0.52 % (1570)Termination reason: Unknown
% 0.19/0.52 % (1570)Termination phase: Function definition elimination
% 0.19/0.52
% 0.19/0.52 % (1570)Memory used [KB]: 1279
% 0.19/0.52 % (1570)Time elapsed: 0.007 s
% 0.19/0.52 % (1570)Instructions burned: 8 (million)
% 0.19/0.52 % (1570)------------------------------
% 0.19/0.52 % (1570)------------------------------
% 0.19/0.52 % (1592)ott+33_1:4_s2a=on:tgt=ground:i=439:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/439Mi)
% 0.19/0.52 % (1583)ott+10_1:8_bsd=on:fsd=on:lcm=predicate:nwc=5.0:s2a=on:s2at=1.5:spb=goal_then_units:i=176:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/176Mi)
% 0.19/0.52 % (1564)ott+10_1:32_abs=on:br=off:urr=ec_only:i=50:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/50Mi)
% 0.19/0.52 % (1567)ott+33_1:4_s2a=on:tgt=ground:i=51:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/51Mi)
% 0.19/0.52 % (1569)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.19/0.52 % (1565)ott+4_1:1_av=off:bd=off:nwc=5.0:s2a=on:s2at=2.0:slsq=on:slsqc=2:slsql=off:slsqr=1,2:sp=frequency:i=37:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/37Mi)
% 0.19/0.53 % (1573)ott+2_1:1_fsr=off:gsp=on:i=50:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/50Mi)
% 0.19/0.53 % (1593)ott+10_7:2_awrs=decay:awrsf=8:bd=preordered:drc=off:fd=preordered:fde=unused:fsr=off:slsq=on:slsqc=2:slsqr=5,8:sp=const_min:spb=units:to=lpo:i=355:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/355Mi)
% 0.19/0.53 % (1571)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.19/0.53 % (1571)Instruction limit reached!
% 0.19/0.53 % (1571)------------------------------
% 0.19/0.53 % (1571)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.19/0.53 % (1571)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.19/0.53 % (1571)Termination reason: Unknown
% 0.19/0.53 % (1571)Termination phase: Preprocessing 3
% 0.19/0.53
% 0.19/0.53 % (1571)Memory used [KB]: 1151
% 0.19/0.53 % (1571)Time elapsed: 0.004 s
% 0.19/0.53 % (1571)Instructions burned: 3 (million)
% 0.19/0.53 % (1571)------------------------------
% 0.19/0.53 % (1571)------------------------------
% 0.19/0.53 % (1577)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.19/0.53 TRYING [1]
% 0.19/0.53 % (1586)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.19/0.53 % (1587)ott+10_1:1_kws=precedence:tgt=ground:i=482:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/482Mi)
% 0.19/0.53 % (1584)ott+3_1:1_gsp=on:lcm=predicate:i=138:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/138Mi)
% 0.19/0.53 TRYING [2]
% 0.19/0.53 % (1585)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.19/0.53 % (1572)First to succeed.
% 0.19/0.54 % (1590)ott+11_2:3_av=off:fde=unused:nwc=5.0:tgt=ground:i=177:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/177Mi)
% 0.19/0.54 % (1572)Refutation found. Thanks to Tanya!
% 0.19/0.54 % SZS status Theorem for theBenchmark
% 0.19/0.54 % SZS output start Proof for theBenchmark
% See solution above
% 0.19/0.54 % (1572)------------------------------
% 0.19/0.54 % (1572)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.19/0.54 % (1572)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.19/0.54 % (1572)Termination reason: Refutation
% 0.19/0.54
% 0.19/0.54 % (1572)Memory used [KB]: 1535
% 0.19/0.54 % (1572)Time elapsed: 0.135 s
% 0.19/0.54 % (1572)Instructions burned: 18 (million)
% 0.19/0.54 % (1572)------------------------------
% 0.19/0.54 % (1572)------------------------------
% 0.19/0.54 % (1562)Success in time 0.191 s
%------------------------------------------------------------------------------