TSTP Solution File: SWC415+1 by SnakeForV-SAT---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV-SAT---1.0
% Problem : SWC415+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 : n011.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:43 EDT 2022
% Result : Theorem 2.00s 0.63s
% Output : Refutation 2.00s
% Verified :
% SZS Type : Refutation
% Derivation depth : 23
% Number of leaves : 10
% Syntax : Number of formulae : 57 ( 14 unt; 0 def)
% Number of atoms : 352 ( 124 equ)
% Maximal formula atoms : 34 ( 6 avg)
% Number of connectives : 479 ( 184 ~; 166 |; 111 &)
% ( 2 <=>; 16 =>; 0 <=; 0 <~>)
% Maximal formula depth : 19 ( 6 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 7 con; 0-1 aty)
% Number of variables : 82 ( 50 !; 32 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f855,plain,
$false,
inference(subsumption_resolution,[],[f853,f530]) ).
fof(f530,plain,
ssList(nil),
inference(cnf_transformation,[],[f17]) ).
fof(f17,axiom,
ssList(nil),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax17) ).
fof(f853,plain,
~ ssList(nil),
inference(resolution,[],[f846,f601]) ).
fof(f601,plain,
! [X1] :
( ~ neq(X1,X1)
| ~ ssList(X1) ),
inference(duplicate_literal_removal,[],[f571]) ).
fof(f571,plain,
! [X1] :
( ~ ssList(X1)
| ~ neq(X1,X1)
| ~ ssList(X1) ),
inference(equality_resolution,[],[f422]) ).
fof(f422,plain,
! [X0,X1] :
( ~ ssList(X0)
| X0 != X1
| ~ neq(X0,X1)
| ~ ssList(X1) ),
inference(cnf_transformation,[],[f273]) ).
fof(f273,plain,
! [X0] :
( ~ ssList(X0)
| ! [X1] :
( ( ( X0 != X1
| ~ neq(X0,X1) )
& ( neq(X0,X1)
| X0 = X1 ) )
| ~ ssList(X1) ) ),
inference(nnf_transformation,[],[f121]) ).
fof(f121,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(f846,plain,
neq(nil,nil),
inference(backward_demodulation,[],[f600,f842]) ).
fof(f842,plain,
nil = sK53,
inference(subsumption_resolution,[],[f841,f530]) ).
fof(f841,plain,
( nil = sK53
| ~ ssList(nil) ),
inference(subsumption_resolution,[],[f839,f540]) ).
fof(f540,plain,
ssList(sK53),
inference(cnf_transformation,[],[f343]) ).
fof(f343,plain,
( ssList(sK52)
& ssList(sK54)
& ( ( neq(sK53,nil)
& ! [X4] :
( tl(sK53) != X4
| sK52 != X4
| ~ ssList(X4)
| ~ neq(nil,sK53) )
& ! [X5] :
( ~ neq(nil,sK55)
| ~ ssList(X5)
| sK54 = X5
| tl(sK55) != X5 ) )
| ( ~ neq(sK55,nil)
& neq(sK53,nil) ) )
& sK55 = sK53
& sK54 = sK52
& ssList(sK55)
& ssList(sK53) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK52,sK53,sK54,sK55])],[f338,f342,f341,f340,f339]) ).
fof(f339,plain,
( ? [X0] :
( ssList(X0)
& ? [X1] :
( ? [X2] :
( ssList(X2)
& ? [X3] :
( ( ( neq(X1,nil)
& ! [X4] :
( tl(X1) != X4
| X0 != X4
| ~ ssList(X4)
| ~ neq(nil,X1) )
& ! [X5] :
( ~ neq(nil,X3)
| ~ ssList(X5)
| X2 = X5
| tl(X3) != X5 ) )
| ( ~ neq(X3,nil)
& neq(X1,nil) ) )
& X1 = X3
& X0 = X2
& ssList(X3) ) )
& ssList(X1) ) )
=> ( ssList(sK52)
& ? [X1] :
( ? [X2] :
( ssList(X2)
& ? [X3] :
( ( ( neq(X1,nil)
& ! [X4] :
( tl(X1) != X4
| sK52 != X4
| ~ ssList(X4)
| ~ neq(nil,X1) )
& ! [X5] :
( ~ neq(nil,X3)
| ~ ssList(X5)
| X2 = X5
| tl(X3) != X5 ) )
| ( ~ neq(X3,nil)
& neq(X1,nil) ) )
& X1 = X3
& sK52 = X2
& ssList(X3) ) )
& ssList(X1) ) ) ),
introduced(choice_axiom,[]) ).
fof(f340,plain,
( ? [X1] :
( ? [X2] :
( ssList(X2)
& ? [X3] :
( ( ( neq(X1,nil)
& ! [X4] :
( tl(X1) != X4
| sK52 != X4
| ~ ssList(X4)
| ~ neq(nil,X1) )
& ! [X5] :
( ~ neq(nil,X3)
| ~ ssList(X5)
| X2 = X5
| tl(X3) != X5 ) )
| ( ~ neq(X3,nil)
& neq(X1,nil) ) )
& X1 = X3
& sK52 = X2
& ssList(X3) ) )
& ssList(X1) )
=> ( ? [X2] :
( ssList(X2)
& ? [X3] :
( ( ( neq(sK53,nil)
& ! [X4] :
( tl(sK53) != X4
| sK52 != X4
| ~ ssList(X4)
| ~ neq(nil,sK53) )
& ! [X5] :
( ~ neq(nil,X3)
| ~ ssList(X5)
| X2 = X5
| tl(X3) != X5 ) )
| ( ~ neq(X3,nil)
& neq(sK53,nil) ) )
& sK53 = X3
& sK52 = X2
& ssList(X3) ) )
& ssList(sK53) ) ),
introduced(choice_axiom,[]) ).
fof(f341,plain,
( ? [X2] :
( ssList(X2)
& ? [X3] :
( ( ( neq(sK53,nil)
& ! [X4] :
( tl(sK53) != X4
| sK52 != X4
| ~ ssList(X4)
| ~ neq(nil,sK53) )
& ! [X5] :
( ~ neq(nil,X3)
| ~ ssList(X5)
| X2 = X5
| tl(X3) != X5 ) )
| ( ~ neq(X3,nil)
& neq(sK53,nil) ) )
& sK53 = X3
& sK52 = X2
& ssList(X3) ) )
=> ( ssList(sK54)
& ? [X3] :
( ( ( neq(sK53,nil)
& ! [X4] :
( tl(sK53) != X4
| sK52 != X4
| ~ ssList(X4)
| ~ neq(nil,sK53) )
& ! [X5] :
( ~ neq(nil,X3)
| ~ ssList(X5)
| sK54 = X5
| tl(X3) != X5 ) )
| ( ~ neq(X3,nil)
& neq(sK53,nil) ) )
& sK53 = X3
& sK54 = sK52
& ssList(X3) ) ) ),
introduced(choice_axiom,[]) ).
fof(f342,plain,
( ? [X3] :
( ( ( neq(sK53,nil)
& ! [X4] :
( tl(sK53) != X4
| sK52 != X4
| ~ ssList(X4)
| ~ neq(nil,sK53) )
& ! [X5] :
( ~ neq(nil,X3)
| ~ ssList(X5)
| sK54 = X5
| tl(X3) != X5 ) )
| ( ~ neq(X3,nil)
& neq(sK53,nil) ) )
& sK53 = X3
& sK54 = sK52
& ssList(X3) )
=> ( ( ( neq(sK53,nil)
& ! [X4] :
( tl(sK53) != X4
| sK52 != X4
| ~ ssList(X4)
| ~ neq(nil,sK53) )
& ! [X5] :
( ~ neq(nil,sK55)
| ~ ssList(X5)
| sK54 = X5
| tl(sK55) != X5 ) )
| ( ~ neq(sK55,nil)
& neq(sK53,nil) ) )
& sK55 = sK53
& sK54 = sK52
& ssList(sK55) ) ),
introduced(choice_axiom,[]) ).
fof(f338,plain,
? [X0] :
( ssList(X0)
& ? [X1] :
( ? [X2] :
( ssList(X2)
& ? [X3] :
( ( ( neq(X1,nil)
& ! [X4] :
( tl(X1) != X4
| X0 != X4
| ~ ssList(X4)
| ~ neq(nil,X1) )
& ! [X5] :
( ~ neq(nil,X3)
| ~ ssList(X5)
| X2 = X5
| tl(X3) != X5 ) )
| ( ~ neq(X3,nil)
& neq(X1,nil) ) )
& X1 = X3
& X0 = X2
& ssList(X3) ) )
& ssList(X1) ) ),
inference(rectify,[],[f112]) ).
fof(f112,plain,
? [X0] :
( ssList(X0)
& ? [X1] :
( ? [X2] :
( ssList(X2)
& ? [X3] :
( ( ( neq(X1,nil)
& ! [X5] :
( tl(X1) != X5
| X0 != X5
| ~ ssList(X5)
| ~ neq(nil,X1) )
& ! [X4] :
( ~ neq(nil,X3)
| ~ ssList(X4)
| X2 = X4
| tl(X3) != X4 ) )
| ( ~ neq(X3,nil)
& neq(X1,nil) ) )
& X1 = X3
& X0 = X2
& ssList(X3) ) )
& ssList(X1) ) ),
inference(flattening,[],[f111]) ).
fof(f111,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( X1 = X3
& X0 = X2
& ( ( neq(X1,nil)
& ! [X5] :
( tl(X1) != X5
| X0 != X5
| ~ ssList(X5)
| ~ neq(nil,X1) )
& ! [X4] :
( ~ neq(nil,X3)
| ~ ssList(X4)
| X2 = X4
| tl(X3) != X4 ) )
| ( ~ neq(X3,nil)
& neq(X1,nil) ) )
& 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)
=> ( X1 != X3
| X0 != X2
| ( ( ~ neq(X1,nil)
| neq(X3,nil) )
& ( ~ neq(X1,nil)
| ? [X5] :
( neq(nil,X1)
& X0 = X5
& tl(X1) = X5
& ssList(X5) )
| ? [X4] :
( X2 != X4
& ssList(X4)
& neq(nil,X3)
& tl(X3) = X4 ) ) ) ) ) ) ) ),
inference(negated_conjecture,[],[f96]) ).
fof(f96,conjecture,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( X1 != X3
| X0 != X2
| ( ( ~ neq(X1,nil)
| neq(X3,nil) )
& ( ~ neq(X1,nil)
| ? [X5] :
( neq(nil,X1)
& X0 = X5
& tl(X1) = X5
& ssList(X5) )
| ? [X4] :
( X2 != X4
& ssList(X4)
& neq(nil,X3)
& tl(X3) = X4 ) ) ) ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1) ).
fof(f839,plain,
( nil = sK53
| ~ ssList(sK53)
| ~ ssList(nil) ),
inference(duplicate_literal_removal,[],[f837]) ).
fof(f837,plain,
( nil = sK53
| nil = sK53
| ~ ssList(sK53)
| ~ ssList(nil) ),
inference(resolution,[],[f421,f695]) ).
fof(f695,plain,
( ~ neq(nil,sK53)
| nil = sK53 ),
inference(resolution,[],[f693,f620]) ).
fof(f620,plain,
( ~ ssList(sF57)
| ~ neq(nil,sK53) ),
inference(subsumption_resolution,[],[f619,f610]) ).
fof(f610,plain,
( ~ ssList(sF57)
| ~ neq(nil,sK53)
| sF57 != sK52 ),
inference(subsumption_resolution,[],[f609,f600]) ).
fof(f609,plain,
( ~ ssList(sF57)
| ~ neq(nil,sK53)
| sF57 != sK52
| ~ neq(sK53,nil) ),
inference(forward_demodulation,[],[f592,f543]) ).
fof(f543,plain,
sK55 = sK53,
inference(cnf_transformation,[],[f343]) ).
fof(f592,plain,
( ~ neq(nil,sK53)
| ~ neq(sK55,nil)
| ~ ssList(sF57)
| sF57 != sK52 ),
inference(definition_folding,[],[f585,f591,f591]) ).
fof(f591,plain,
tl(sK53) = sF57,
introduced(function_definition,[]) ).
fof(f585,plain,
( tl(sK53) != sK52
| ~ ssList(tl(sK53))
| ~ neq(nil,sK53)
| ~ neq(sK55,nil) ),
inference(equality_resolution,[],[f547]) ).
fof(f547,plain,
! [X4] :
( tl(sK53) != X4
| sK52 != X4
| ~ ssList(X4)
| ~ neq(nil,sK53)
| ~ neq(sK55,nil) ),
inference(cnf_transformation,[],[f343]) ).
fof(f619,plain,
( sF57 = sK52
| ~ ssList(sF57)
| ~ neq(nil,sK53) ),
inference(forward_demodulation,[],[f618,f543]) ).
fof(f618,plain,
( sF57 = sK52
| ~ neq(nil,sK55)
| ~ ssList(sF57) ),
inference(forward_demodulation,[],[f617,f608]) ).
fof(f608,plain,
sF58 = sF57,
inference(forward_demodulation,[],[f607,f591]) ).
fof(f607,plain,
tl(sK53) = sF58,
inference(backward_demodulation,[],[f594,f543]) ).
fof(f594,plain,
sF58 = tl(sK55),
introduced(function_definition,[]) ).
fof(f617,plain,
( ~ ssList(sF58)
| sF57 = sK52
| ~ neq(nil,sK55) ),
inference(forward_demodulation,[],[f616,f542]) ).
fof(f542,plain,
sK54 = sK52,
inference(cnf_transformation,[],[f343]) ).
fof(f616,plain,
( sK54 = sF57
| ~ ssList(sF58)
| ~ neq(nil,sK55) ),
inference(subsumption_resolution,[],[f615,f600]) ).
fof(f615,plain,
( ~ neq(nil,sK55)
| sK54 = sF57
| ~ neq(sK53,nil)
| ~ ssList(sF58) ),
inference(forward_demodulation,[],[f614,f543]) ).
fof(f614,plain,
( ~ neq(sK55,nil)
| ~ neq(nil,sK55)
| ~ ssList(sF58)
| sK54 = sF57 ),
inference(forward_demodulation,[],[f595,f608]) ).
fof(f595,plain,
( sK54 = sF58
| ~ neq(sK55,nil)
| ~ ssList(sF58)
| ~ neq(nil,sK55) ),
inference(definition_folding,[],[f587,f594,f594]) ).
fof(f587,plain,
( ~ neq(nil,sK55)
| ~ ssList(tl(sK55))
| sK54 = tl(sK55)
| ~ neq(sK55,nil) ),
inference(equality_resolution,[],[f545]) ).
fof(f545,plain,
! [X5] :
( ~ neq(nil,sK55)
| ~ ssList(X5)
| sK54 = X5
| tl(sK55) != X5
| ~ neq(sK55,nil) ),
inference(cnf_transformation,[],[f343]) ).
fof(f693,plain,
( ssList(sF57)
| nil = sK53 ),
inference(subsumption_resolution,[],[f692,f540]) ).
fof(f692,plain,
( nil = sK53
| ~ ssList(sK53)
| ssList(sF57) ),
inference(superposition,[],[f431,f591]) ).
fof(f431,plain,
! [X0] :
( ssList(tl(X0))
| ~ ssList(X0)
| nil = X0 ),
inference(cnf_transformation,[],[f136]) ).
fof(f136,plain,
! [X0] :
( ~ ssList(X0)
| nil = X0
| ssList(tl(X0)) ),
inference(flattening,[],[f135]) ).
fof(f135,plain,
! [X0] :
( ssList(tl(X0))
| nil = X0
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f24]) ).
fof(f24,axiom,
! [X0] :
( ssList(X0)
=> ( nil != X0
=> ssList(tl(X0)) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax24) ).
fof(f421,plain,
! [X0,X1] :
( neq(X0,X1)
| ~ ssList(X1)
| ~ ssList(X0)
| X0 = X1 ),
inference(cnf_transformation,[],[f273]) ).
fof(f600,plain,
neq(sK53,nil),
inference(duplicate_literal_removal,[],[f548]) ).
fof(f548,plain,
( neq(sK53,nil)
| neq(sK53,nil) ),
inference(cnf_transformation,[],[f343]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SWC415+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.13/0.35 % Computer : n011.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:52:10 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.20/0.58 % (28519)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.58 % (28518)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.58 % (28511)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.58 % (28510)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.58 % (28511)Instruction limit reached!
% 0.20/0.58 % (28511)------------------------------
% 0.20/0.58 % (28511)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.20/0.58 % (28511)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.20/0.58 % (28511)Termination reason: Unknown
% 0.20/0.58 % (28511)Termination phase: Naming
% 0.20/0.58
% 0.20/0.58 % (28511)Memory used [KB]: 1023
% 0.20/0.58 % (28511)Time elapsed: 0.005 s
% 0.20/0.58 % (28511)Instructions burned: 3 (million)
% 0.20/0.58 % (28511)------------------------------
% 0.20/0.58 % (28511)------------------------------
% 0.20/0.58 % (28510)Instruction limit reached!
% 0.20/0.58 % (28510)------------------------------
% 0.20/0.58 % (28510)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.20/0.58 % (28527)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.59 % (28510)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.20/0.59 % (28510)Termination reason: Unknown
% 0.20/0.59 % (28510)Termination phase: Property scanning
% 0.20/0.59
% 0.20/0.59 % (28510)Memory used [KB]: 1279
% 0.20/0.59 % (28510)Time elapsed: 0.007 s
% 0.20/0.59 % (28510)Instructions burned: 7 (million)
% 0.20/0.59 % (28510)------------------------------
% 0.20/0.59 % (28510)------------------------------
% 0.20/0.59 % (28526)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.61 % (28507)ott+33_1:4_s2a=on:tgt=ground:i=51:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/51Mi)
% 0.20/0.62 % (28505)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.20/0.62 % (28509)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.62 % (28531)ott+33_1:4_s2a=on:tgt=ground:i=439:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/439Mi)
% 0.20/0.62 % (28514)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.20/0.62 % (28503)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.20/0.62 % (28517)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.62 % (28525)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)
% 2.00/0.62 % (28532)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)
% 2.00/0.62 % (28518)First to succeed.
% 2.00/0.62 % (28512)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)
% 2.00/0.63 % (28523)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)
% 2.00/0.63 % (28520)fmb+10_1:1_bce=on:i=59:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/59Mi)
% 2.00/0.63 % (28516)ott+10_1:5_bd=off:tgt=full:i=99:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/99Mi)
% 2.00/0.63 % (28521)ott+10_1:1_tgt=ground:i=100:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/100Mi)
% 2.00/0.63 % (28518)Refutation found. Thanks to Tanya!
% 2.00/0.63 % SZS status Theorem for theBenchmark
% 2.00/0.63 % SZS output start Proof for theBenchmark
% See solution above
% 2.00/0.63 % (28518)------------------------------
% 2.00/0.63 % (28518)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 2.00/0.63 % (28518)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 2.00/0.63 % (28518)Termination reason: Refutation
% 2.00/0.63
% 2.00/0.63 % (28518)Memory used [KB]: 1663
% 2.00/0.63 % (28518)Time elapsed: 0.191 s
% 2.00/0.63 % (28518)Instructions burned: 31 (million)
% 2.00/0.63 % (28518)------------------------------
% 2.00/0.63 % (28518)------------------------------
% 2.00/0.63 % (28502)Success in time 0.272 s
%------------------------------------------------------------------------------