TSTP Solution File: SWC419+1 by SnakeForV-SAT---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV-SAT---1.0
% Problem : SWC419+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:45 EDT 2022
% Result : Theorem 2.17s 0.66s
% Output : Refutation 2.17s
% Verified :
% SZS Type : Refutation
% Derivation depth : 16
% Number of leaves : 14
% Syntax : Number of formulae : 62 ( 22 unt; 0 def)
% Number of atoms : 328 ( 144 equ)
% Maximal formula atoms : 38 ( 5 avg)
% Number of connectives : 404 ( 138 ~; 118 |; 130 &)
% ( 0 <=>; 18 =>; 0 <=; 0 <~>)
% Maximal formula depth : 22 ( 5 avg)
% Maximal term depth : 4 ( 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 : 111 ( 63 !; 48 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f729,plain,
$false,
inference(subsumption_resolution,[],[f728,f614]) ).
fof(f614,plain,
sK7 = app(sF59,sK11),
inference(backward_demodulation,[],[f591,f613]) ).
fof(f613,plain,
sF61 = sK7,
inference(resolution,[],[f603,f378]) ).
fof(f378,plain,
neq(sK7,nil),
inference(cnf_transformation,[],[f241]) ).
fof(f241,plain,
( ssList(sK6)
& ssList(sK7)
& ssList(sK8)
& sK7 = sK9
& neq(sK7,nil)
& ! [X4] :
( ! [X5] :
( ! [X6] :
( app(app(X5,cons(X4,nil)),X6) != sK7
| app(app(X6,cons(X4,nil)),X5) != sK6
| ~ ssList(X6) )
| ~ ssList(X5) )
| ~ ssItem(X4) )
& ( nil = sK8
| nil != sK9 )
& ssList(sK9)
& ( ~ neq(sK9,nil)
| ( ssItem(sK10)
& ssList(sK11)
& sK8 = app(sK11,cons(sK10,nil))
& app(cons(sK10,nil),sK11) = sK9 ) )
& sK6 = sK8 ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK6,sK7,sK8,sK9,sK10,sK11])],[f150,f240,f239,f238,f237,f236,f235]) ).
fof(f235,plain,
( ? [X0] :
( ssList(X0)
& ? [X1] :
( ssList(X1)
& ? [X2] :
( ssList(X2)
& ? [X3] :
( X1 = X3
& neq(X1,nil)
& ! [X4] :
( ! [X5] :
( ! [X6] :
( app(app(X5,cons(X4,nil)),X6) != X1
| app(app(X6,cons(X4,nil)),X5) != X0
| ~ ssList(X6) )
| ~ ssList(X5) )
| ~ ssItem(X4) )
& ( nil = X2
| nil != X3 )
& ssList(X3)
& ( ~ neq(X3,nil)
| ? [X7] :
( ssItem(X7)
& ? [X8] :
( ssList(X8)
& app(X8,cons(X7,nil)) = X2
& app(cons(X7,nil),X8) = X3 ) ) )
& X0 = X2 ) ) ) )
=> ( ssList(sK6)
& ? [X1] :
( ssList(X1)
& ? [X2] :
( ssList(X2)
& ? [X3] :
( X1 = X3
& neq(X1,nil)
& ! [X4] :
( ! [X5] :
( ! [X6] :
( app(app(X5,cons(X4,nil)),X6) != X1
| app(app(X6,cons(X4,nil)),X5) != sK6
| ~ ssList(X6) )
| ~ ssList(X5) )
| ~ ssItem(X4) )
& ( nil = X2
| nil != X3 )
& ssList(X3)
& ( ~ neq(X3,nil)
| ? [X7] :
( ssItem(X7)
& ? [X8] :
( ssList(X8)
& app(X8,cons(X7,nil)) = X2
& app(cons(X7,nil),X8) = X3 ) ) )
& sK6 = X2 ) ) ) ) ),
introduced(choice_axiom,[]) ).
fof(f236,plain,
( ? [X1] :
( ssList(X1)
& ? [X2] :
( ssList(X2)
& ? [X3] :
( X1 = X3
& neq(X1,nil)
& ! [X4] :
( ! [X5] :
( ! [X6] :
( app(app(X5,cons(X4,nil)),X6) != X1
| app(app(X6,cons(X4,nil)),X5) != sK6
| ~ ssList(X6) )
| ~ ssList(X5) )
| ~ ssItem(X4) )
& ( nil = X2
| nil != X3 )
& ssList(X3)
& ( ~ neq(X3,nil)
| ? [X7] :
( ssItem(X7)
& ? [X8] :
( ssList(X8)
& app(X8,cons(X7,nil)) = X2
& app(cons(X7,nil),X8) = X3 ) ) )
& sK6 = X2 ) ) )
=> ( ssList(sK7)
& ? [X2] :
( ssList(X2)
& ? [X3] :
( sK7 = X3
& neq(sK7,nil)
& ! [X4] :
( ! [X5] :
( ! [X6] :
( app(app(X5,cons(X4,nil)),X6) != sK7
| app(app(X6,cons(X4,nil)),X5) != sK6
| ~ ssList(X6) )
| ~ ssList(X5) )
| ~ ssItem(X4) )
& ( nil = X2
| nil != X3 )
& ssList(X3)
& ( ~ neq(X3,nil)
| ? [X7] :
( ssItem(X7)
& ? [X8] :
( ssList(X8)
& app(X8,cons(X7,nil)) = X2
& app(cons(X7,nil),X8) = X3 ) ) )
& sK6 = X2 ) ) ) ),
introduced(choice_axiom,[]) ).
fof(f237,plain,
( ? [X2] :
( ssList(X2)
& ? [X3] :
( sK7 = X3
& neq(sK7,nil)
& ! [X4] :
( ! [X5] :
( ! [X6] :
( app(app(X5,cons(X4,nil)),X6) != sK7
| app(app(X6,cons(X4,nil)),X5) != sK6
| ~ ssList(X6) )
| ~ ssList(X5) )
| ~ ssItem(X4) )
& ( nil = X2
| nil != X3 )
& ssList(X3)
& ( ~ neq(X3,nil)
| ? [X7] :
( ssItem(X7)
& ? [X8] :
( ssList(X8)
& app(X8,cons(X7,nil)) = X2
& app(cons(X7,nil),X8) = X3 ) ) )
& sK6 = X2 ) )
=> ( ssList(sK8)
& ? [X3] :
( sK7 = X3
& neq(sK7,nil)
& ! [X4] :
( ! [X5] :
( ! [X6] :
( app(app(X5,cons(X4,nil)),X6) != sK7
| app(app(X6,cons(X4,nil)),X5) != sK6
| ~ ssList(X6) )
| ~ ssList(X5) )
| ~ ssItem(X4) )
& ( nil = sK8
| nil != X3 )
& ssList(X3)
& ( ~ neq(X3,nil)
| ? [X7] :
( ssItem(X7)
& ? [X8] :
( ssList(X8)
& app(X8,cons(X7,nil)) = sK8
& app(cons(X7,nil),X8) = X3 ) ) )
& sK6 = sK8 ) ) ),
introduced(choice_axiom,[]) ).
fof(f238,plain,
( ? [X3] :
( sK7 = X3
& neq(sK7,nil)
& ! [X4] :
( ! [X5] :
( ! [X6] :
( app(app(X5,cons(X4,nil)),X6) != sK7
| app(app(X6,cons(X4,nil)),X5) != sK6
| ~ ssList(X6) )
| ~ ssList(X5) )
| ~ ssItem(X4) )
& ( nil = sK8
| nil != X3 )
& ssList(X3)
& ( ~ neq(X3,nil)
| ? [X7] :
( ssItem(X7)
& ? [X8] :
( ssList(X8)
& app(X8,cons(X7,nil)) = sK8
& app(cons(X7,nil),X8) = X3 ) ) )
& sK6 = sK8 )
=> ( sK7 = sK9
& neq(sK7,nil)
& ! [X4] :
( ! [X5] :
( ! [X6] :
( app(app(X5,cons(X4,nil)),X6) != sK7
| app(app(X6,cons(X4,nil)),X5) != sK6
| ~ ssList(X6) )
| ~ ssList(X5) )
| ~ ssItem(X4) )
& ( nil = sK8
| nil != sK9 )
& ssList(sK9)
& ( ~ neq(sK9,nil)
| ? [X7] :
( ssItem(X7)
& ? [X8] :
( ssList(X8)
& app(X8,cons(X7,nil)) = sK8
& app(cons(X7,nil),X8) = sK9 ) ) )
& sK6 = sK8 ) ),
introduced(choice_axiom,[]) ).
fof(f239,plain,
( ? [X7] :
( ssItem(X7)
& ? [X8] :
( ssList(X8)
& app(X8,cons(X7,nil)) = sK8
& app(cons(X7,nil),X8) = sK9 ) )
=> ( ssItem(sK10)
& ? [X8] :
( ssList(X8)
& sK8 = app(X8,cons(sK10,nil))
& sK9 = app(cons(sK10,nil),X8) ) ) ),
introduced(choice_axiom,[]) ).
fof(f240,plain,
( ? [X8] :
( ssList(X8)
& sK8 = app(X8,cons(sK10,nil))
& sK9 = app(cons(sK10,nil),X8) )
=> ( ssList(sK11)
& sK8 = app(sK11,cons(sK10,nil))
& app(cons(sK10,nil),sK11) = sK9 ) ),
introduced(choice_axiom,[]) ).
fof(f150,plain,
? [X0] :
( ssList(X0)
& ? [X1] :
( ssList(X1)
& ? [X2] :
( ssList(X2)
& ? [X3] :
( X1 = X3
& neq(X1,nil)
& ! [X4] :
( ! [X5] :
( ! [X6] :
( app(app(X5,cons(X4,nil)),X6) != X1
| app(app(X6,cons(X4,nil)),X5) != X0
| ~ ssList(X6) )
| ~ ssList(X5) )
| ~ ssItem(X4) )
& ( nil = X2
| nil != X3 )
& ssList(X3)
& ( ~ neq(X3,nil)
| ? [X7] :
( ssItem(X7)
& ? [X8] :
( ssList(X8)
& app(X8,cons(X7,nil)) = X2
& app(cons(X7,nil),X8) = X3 ) ) )
& X0 = X2 ) ) ) ),
inference(ennf_transformation,[],[f97]) ).
fof(f97,negated_conjecture,
~ ! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ( nil != X2
& nil = X3 )
| ? [X4] :
( ssItem(X4)
& ? [X5] :
( ssList(X5)
& ? [X6] :
( ssList(X6)
& app(app(X5,cons(X4,nil)),X6) = X1
& app(app(X6,cons(X4,nil)),X5) = X0 ) ) )
| ~ ssList(X3)
| X1 != X3
| X0 != X2
| ( neq(X3,nil)
& ! [X7] :
( ssItem(X7)
=> ! [X8] :
( app(cons(X7,nil),X8) != X3
| app(X8,cons(X7,nil)) != X2
| ~ ssList(X8) ) ) )
| ~ neq(X1,nil) ) ) ) ),
inference(negated_conjecture,[],[f96]) ).
fof(f96,conjecture,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ( nil != X2
& nil = X3 )
| ? [X4] :
( ssItem(X4)
& ? [X5] :
( ssList(X5)
& ? [X6] :
( ssList(X6)
& app(app(X5,cons(X4,nil)),X6) = X1
& app(app(X6,cons(X4,nil)),X5) = X0 ) ) )
| ~ ssList(X3)
| X1 != X3
| X0 != X2
| ( neq(X3,nil)
& ! [X7] :
( ssItem(X7)
=> ! [X8] :
( app(cons(X7,nil),X8) != X3
| app(X8,cons(X7,nil)) != X2
| ~ ssList(X8) ) ) )
| ~ neq(X1,nil) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1) ).
fof(f603,plain,
( ~ neq(sK7,nil)
| sF61 = sK7 ),
inference(forward_demodulation,[],[f602,f379]) ).
fof(f379,plain,
sK7 = sK9,
inference(cnf_transformation,[],[f241]) ).
fof(f602,plain,
( ~ neq(sK9,nil)
| sF61 = sK7 ),
inference(forward_demodulation,[],[f592,f379]) ).
fof(f592,plain,
( sF61 = sK9
| ~ neq(sK9,nil) ),
inference(definition_folding,[],[f371,f591,f588]) ).
fof(f588,plain,
cons(sK10,nil) = sF59,
introduced(function_definition,[]) ).
fof(f371,plain,
( ~ neq(sK9,nil)
| app(cons(sK10,nil),sK11) = sK9 ),
inference(cnf_transformation,[],[f241]) ).
fof(f591,plain,
sF61 = app(sF59,sK11),
introduced(function_definition,[]) ).
fof(f728,plain,
sK7 != app(sF59,sK11),
inference(backward_demodulation,[],[f657,f726]) ).
fof(f726,plain,
sF59 = app(nil,sF59),
inference(resolution,[],[f723,f453]) ).
fof(f453,plain,
! [X0] :
( ~ ssList(X0)
| app(nil,X0) = X0 ),
inference(cnf_transformation,[],[f191]) ).
fof(f191,plain,
! [X0] :
( ~ ssList(X0)
| app(nil,X0) = X0 ),
inference(ennf_transformation,[],[f28]) ).
fof(f28,axiom,
! [X0] :
( ssList(X0)
=> app(nil,X0) = X0 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax28) ).
fof(f723,plain,
ssList(sF59),
inference(subsumption_resolution,[],[f722,f611]) ).
fof(f611,plain,
ssItem(sK10),
inference(resolution,[],[f604,f378]) ).
fof(f604,plain,
( ~ neq(sK7,nil)
| ssItem(sK10) ),
inference(forward_demodulation,[],[f374,f379]) ).
fof(f374,plain,
( ~ neq(sK9,nil)
| ssItem(sK10) ),
inference(cnf_transformation,[],[f241]) ).
fof(f722,plain,
( ~ ssItem(sK10)
| ssList(sF59) ),
inference(subsumption_resolution,[],[f721,f368]) ).
fof(f368,plain,
ssList(nil),
inference(cnf_transformation,[],[f17]) ).
fof(f17,axiom,
ssList(nil),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax17) ).
fof(f721,plain,
( ssList(sF59)
| ~ ssList(nil)
| ~ ssItem(sK10) ),
inference(superposition,[],[f426,f588]) ).
fof(f426,plain,
! [X0,X1] :
( ssList(cons(X1,X0))
| ~ ssList(X0)
| ~ ssItem(X1) ),
inference(cnf_transformation,[],[f140]) ).
fof(f140,plain,
! [X0] :
( ! [X1] :
( ssList(cons(X1,X0))
| ~ ssItem(X1) )
| ~ ssList(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(f657,plain,
sK7 != app(app(nil,sF59),sK11),
inference(subsumption_resolution,[],[f656,f368]) ).
fof(f656,plain,
( sK7 != app(app(nil,sF59),sK11)
| ~ ssList(nil) ),
inference(trivial_inequality_removal,[],[f655]) ).
fof(f655,plain,
( sK6 != sK6
| ~ ssList(nil)
| sK7 != app(app(nil,sF59),sK11) ),
inference(superposition,[],[f621,f640]) ).
fof(f640,plain,
sK6 = app(sK6,nil),
inference(resolution,[],[f353,f600]) ).
fof(f600,plain,
ssList(sK6),
inference(forward_demodulation,[],[f380,f370]) ).
fof(f370,plain,
sK6 = sK8,
inference(cnf_transformation,[],[f241]) ).
fof(f380,plain,
ssList(sK8),
inference(cnf_transformation,[],[f241]) ).
fof(f353,plain,
! [X0] :
( ~ ssList(X0)
| app(X0,nil) = X0 ),
inference(cnf_transformation,[],[f128]) ).
fof(f128,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(f621,plain,
! [X0] :
( sK6 != app(sK6,X0)
| app(app(X0,sF59),sK11) != sK7
| ~ ssList(X0) ),
inference(subsumption_resolution,[],[f620,f612]) ).
fof(f612,plain,
ssList(sK11),
inference(resolution,[],[f605,f378]) ).
fof(f605,plain,
( ~ neq(sK7,nil)
| ssList(sK11) ),
inference(forward_demodulation,[],[f373,f379]) ).
fof(f373,plain,
( ssList(sK11)
| ~ neq(sK9,nil) ),
inference(cnf_transformation,[],[f241]) ).
fof(f620,plain,
! [X0] :
( app(app(X0,sF59),sK11) != sK7
| sK6 != app(sK6,X0)
| ~ ssList(sK11)
| ~ ssList(X0) ),
inference(superposition,[],[f619,f616]) ).
fof(f616,plain,
sK6 = app(sK11,sF59),
inference(backward_demodulation,[],[f589,f615]) ).
fof(f615,plain,
sF60 = sK6,
inference(resolution,[],[f607,f378]) ).
fof(f607,plain,
( ~ neq(sK7,nil)
| sF60 = sK6 ),
inference(forward_demodulation,[],[f606,f379]) ).
fof(f606,plain,
( sF60 = sK6
| ~ neq(sK9,nil) ),
inference(forward_demodulation,[],[f590,f370]) ).
fof(f590,plain,
( sF60 = sK8
| ~ neq(sK9,nil) ),
inference(definition_folding,[],[f372,f589,f588]) ).
fof(f372,plain,
( ~ neq(sK9,nil)
| sK8 = app(sK11,cons(sK10,nil)) ),
inference(cnf_transformation,[],[f241]) ).
fof(f589,plain,
sF60 = app(sK11,sF59),
introduced(function_definition,[]) ).
fof(f619,plain,
! [X0,X1] :
( sK6 != app(app(X0,sF59),X1)
| ~ ssList(X0)
| ~ ssList(X1)
| app(app(X1,sF59),X0) != sK7 ),
inference(subsumption_resolution,[],[f618,f611]) ).
fof(f618,plain,
! [X0,X1] :
( ~ ssList(X0)
| sK6 != app(app(X0,sF59),X1)
| app(app(X1,sF59),X0) != sK7
| ~ ssItem(sK10)
| ~ ssList(X1) ),
inference(superposition,[],[f377,f588]) ).
fof(f377,plain,
! [X6,X4,X5] :
( app(app(X6,cons(X4,nil)),X5) != sK6
| ~ ssList(X5)
| app(app(X5,cons(X4,nil)),X6) != sK7
| ~ ssList(X6)
| ~ ssItem(X4) ),
inference(cnf_transformation,[],[f241]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SWC419+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:25 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.20/0.56 % (29742)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 % (29743)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 % (29744)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 % (29744)Instruction limit reached!
% 0.20/0.56 % (29744)------------------------------
% 0.20/0.56 % (29744)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.20/0.56 % (29744)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.20/0.56 % (29744)Termination reason: Unknown
% 0.20/0.56 % (29744)Termination phase: Preprocessing 2
% 0.20/0.56
% 0.20/0.56 % (29744)Memory used [KB]: 1023
% 0.20/0.56 % (29744)Time elapsed: 0.003 s
% 0.20/0.56 % (29744)Instructions burned: 2 (million)
% 0.20/0.56 % (29744)------------------------------
% 0.20/0.56 % (29744)------------------------------
% 0.20/0.56 % (29743)Instruction limit reached!
% 0.20/0.56 % (29743)------------------------------
% 0.20/0.56 % (29743)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.20/0.56 % (29760)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 % (29759)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 % (29743)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.20/0.57 % (29743)Termination reason: Unknown
% 0.20/0.57 % (29743)Termination phase: Function definition elimination
% 0.20/0.57
% 0.20/0.57 % (29743)Memory used [KB]: 1279
% 0.20/0.57 % (29743)Time elapsed: 0.009 s
% 0.20/0.57 % (29743)Instructions burned: 8 (million)
% 0.20/0.57 % (29743)------------------------------
% 0.20/0.57 % (29743)------------------------------
% 0.20/0.57 % (29752)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 % (29750)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 % (29758)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 % (29751)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.60 TRYING [1]
% 0.20/0.60 TRYING [2]
% 0.20/0.61 % (29740)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.61 % (29738)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.61 % (29747)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.61 % (29739)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.20/0.62 % (29737)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.20/0.62 % (29755)ott+4_1:1_av=off:bd=off:nwc=5.0:rp=on:s2a=on:s2at=2.0:slsq=on:slsqc=2:slsql=off:slsqr=1,2:sp=frequency:i=100:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/100Mi)
% 0.20/0.62 % (29754)ott+10_1:1_tgt=ground:i=100:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/100Mi)
% 0.20/0.62 % (29756)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)
% 1.97/0.62 % (29761)ott+10_1:5_bd=off:tgt=full:i=500:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/500Mi)
% 1.97/0.63 % (29763)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)
% 1.97/0.63 % (29746)ott+2_1:1_fsr=off:gsp=on:i=50:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/50Mi)
% 1.97/0.63 % (29764)ott+33_1:4_s2a=on:tgt=ground:i=439:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/439Mi)
% 1.97/0.63 % (29753)fmb+10_1:1_bce=on:i=59:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/59Mi)
% 1.97/0.64 % (29742)Instruction limit reached!
% 1.97/0.64 % (29742)------------------------------
% 1.97/0.64 % (29742)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 1.97/0.64 % (29742)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 1.97/0.64 % (29742)Termination reason: Unknown
% 1.97/0.64 % (29742)Termination phase: Finite model building SAT solving
% 1.97/0.64
% 1.97/0.64 % (29742)Memory used [KB]: 7164
% 1.97/0.64 % (29742)Time elapsed: 0.185 s
% 1.97/0.64 % (29742)Instructions burned: 51 (million)
% 1.97/0.64 % (29742)------------------------------
% 1.97/0.64 % (29742)------------------------------
% 1.97/0.64 % (29745)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)
% 1.97/0.64 % (29751)First to succeed.
% 1.97/0.64 % (29748)ott+10_1:28_bd=off:bs=on:tgt=ground:i=101:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/101Mi)
% 1.97/0.64 % (29762)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)
% 2.17/0.66 % (29751)Refutation found. Thanks to Tanya!
% 2.17/0.66 % SZS status Theorem for theBenchmark
% 2.17/0.66 % SZS output start Proof for theBenchmark
% See solution above
% 2.17/0.66 % (29751)------------------------------
% 2.17/0.66 % (29751)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 2.17/0.66 % (29751)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 2.17/0.66 % (29751)Termination reason: Refutation
% 2.17/0.66
% 2.17/0.66 % (29751)Memory used [KB]: 1535
% 2.17/0.66 % (29751)Time elapsed: 0.192 s
% 2.17/0.66 % (29751)Instructions burned: 24 (million)
% 2.17/0.66 % (29751)------------------------------
% 2.17/0.66 % (29751)------------------------------
% 2.17/0.66 % (29735)Success in time 0.29 s
%------------------------------------------------------------------------------