TSTP Solution File: SWC016+1 by SnakeForV-SAT---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV-SAT---1.0
% Problem : SWC016+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 : n019.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:41:13 EDT 2022
% Result : Theorem 0.21s 0.56s
% Output : Refutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 27
% Number of leaves : 6
% Syntax : Number of formulae : 58 ( 10 unt; 0 def)
% Number of atoms : 385 ( 110 equ)
% Maximal formula atoms : 40 ( 6 avg)
% Number of connectives : 498 ( 171 ~; 150 |; 162 &)
% ( 0 <=>; 15 =>; 0 <=; 0 <~>)
% Maximal formula depth : 20 ( 6 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 6 con; 0-0 aty)
% Number of variables : 71 ( 29 !; 42 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f645,plain,
$false,
inference(subsumption_resolution,[],[f644,f636]) ).
fof(f636,plain,
neq(nil,nil),
inference(trivial_inequality_removal,[],[f633]) ).
fof(f633,plain,
( neq(nil,nil)
| nil != nil ),
inference(backward_demodulation,[],[f620,f630]) ).
fof(f630,plain,
nil = sK51,
inference(trivial_inequality_removal,[],[f629]) ).
fof(f629,plain,
( nil = sK51
| nil != nil ),
inference(superposition,[],[f608,f622]) ).
fof(f622,plain,
nil = sK54,
inference(backward_demodulation,[],[f550,f617]) ).
fof(f617,plain,
nil = sK52,
inference(subsumption_resolution,[],[f616,f545]) ).
fof(f545,plain,
( neq(sK52,nil)
| nil = sK52 ),
inference(cnf_transformation,[],[f344]) ).
fof(f344,plain,
( ssList(sK53)
& sK54 = sK52
& ssList(sK54)
& ( ( nil != sK51
& nil = sK52 )
| ( ! [X4] :
( ~ frontsegP(sK51,X4)
| ~ ssList(X4)
| ~ neq(X4,nil)
| ~ frontsegP(sK52,X4) )
& neq(sK52,nil) ) )
& ( ~ neq(sK54,nil)
| ( frontsegP(sK54,sK55)
& ssList(sK55)
& neq(sK55,nil)
& frontsegP(sK53,sK55) ) )
& sK51 = sK53
& ( nil = sK53
| nil != sK54 )
& ssList(sK52)
& ssList(sK51) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK51,sK52,sK53,sK54,sK55])],[f338,f343,f342,f341,f340,f339]) ).
fof(f339,plain,
( ? [X0] :
( ? [X1] :
( ? [X2] :
( ssList(X2)
& ? [X3] :
( X1 = X3
& ssList(X3)
& ( ( nil != X0
& nil = X1 )
| ( ! [X4] :
( ~ frontsegP(X0,X4)
| ~ ssList(X4)
| ~ neq(X4,nil)
| ~ frontsegP(X1,X4) )
& neq(X1,nil) ) )
& ( ~ neq(X3,nil)
| ? [X5] :
( frontsegP(X3,X5)
& ssList(X5)
& neq(X5,nil)
& frontsegP(X2,X5) ) )
& X0 = X2
& ( nil = X2
| nil != X3 ) ) )
& ssList(X1) )
& ssList(X0) )
=> ( ? [X1] :
( ? [X2] :
( ssList(X2)
& ? [X3] :
( X1 = X3
& ssList(X3)
& ( ( nil != sK51
& nil = X1 )
| ( ! [X4] :
( ~ frontsegP(sK51,X4)
| ~ ssList(X4)
| ~ neq(X4,nil)
| ~ frontsegP(X1,X4) )
& neq(X1,nil) ) )
& ( ~ neq(X3,nil)
| ? [X5] :
( frontsegP(X3,X5)
& ssList(X5)
& neq(X5,nil)
& frontsegP(X2,X5) ) )
& sK51 = X2
& ( nil = X2
| nil != X3 ) ) )
& ssList(X1) )
& ssList(sK51) ) ),
introduced(choice_axiom,[]) ).
fof(f340,plain,
( ? [X1] :
( ? [X2] :
( ssList(X2)
& ? [X3] :
( X1 = X3
& ssList(X3)
& ( ( nil != sK51
& nil = X1 )
| ( ! [X4] :
( ~ frontsegP(sK51,X4)
| ~ ssList(X4)
| ~ neq(X4,nil)
| ~ frontsegP(X1,X4) )
& neq(X1,nil) ) )
& ( ~ neq(X3,nil)
| ? [X5] :
( frontsegP(X3,X5)
& ssList(X5)
& neq(X5,nil)
& frontsegP(X2,X5) ) )
& sK51 = X2
& ( nil = X2
| nil != X3 ) ) )
& ssList(X1) )
=> ( ? [X2] :
( ssList(X2)
& ? [X3] :
( sK52 = X3
& ssList(X3)
& ( ( nil != sK51
& nil = sK52 )
| ( ! [X4] :
( ~ frontsegP(sK51,X4)
| ~ ssList(X4)
| ~ neq(X4,nil)
| ~ frontsegP(sK52,X4) )
& neq(sK52,nil) ) )
& ( ~ neq(X3,nil)
| ? [X5] :
( frontsegP(X3,X5)
& ssList(X5)
& neq(X5,nil)
& frontsegP(X2,X5) ) )
& sK51 = X2
& ( nil = X2
| nil != X3 ) ) )
& ssList(sK52) ) ),
introduced(choice_axiom,[]) ).
fof(f341,plain,
( ? [X2] :
( ssList(X2)
& ? [X3] :
( sK52 = X3
& ssList(X3)
& ( ( nil != sK51
& nil = sK52 )
| ( ! [X4] :
( ~ frontsegP(sK51,X4)
| ~ ssList(X4)
| ~ neq(X4,nil)
| ~ frontsegP(sK52,X4) )
& neq(sK52,nil) ) )
& ( ~ neq(X3,nil)
| ? [X5] :
( frontsegP(X3,X5)
& ssList(X5)
& neq(X5,nil)
& frontsegP(X2,X5) ) )
& sK51 = X2
& ( nil = X2
| nil != X3 ) ) )
=> ( ssList(sK53)
& ? [X3] :
( sK52 = X3
& ssList(X3)
& ( ( nil != sK51
& nil = sK52 )
| ( ! [X4] :
( ~ frontsegP(sK51,X4)
| ~ ssList(X4)
| ~ neq(X4,nil)
| ~ frontsegP(sK52,X4) )
& neq(sK52,nil) ) )
& ( ~ neq(X3,nil)
| ? [X5] :
( frontsegP(X3,X5)
& ssList(X5)
& neq(X5,nil)
& frontsegP(sK53,X5) ) )
& sK51 = sK53
& ( nil = sK53
| nil != X3 ) ) ) ),
introduced(choice_axiom,[]) ).
fof(f342,plain,
( ? [X3] :
( sK52 = X3
& ssList(X3)
& ( ( nil != sK51
& nil = sK52 )
| ( ! [X4] :
( ~ frontsegP(sK51,X4)
| ~ ssList(X4)
| ~ neq(X4,nil)
| ~ frontsegP(sK52,X4) )
& neq(sK52,nil) ) )
& ( ~ neq(X3,nil)
| ? [X5] :
( frontsegP(X3,X5)
& ssList(X5)
& neq(X5,nil)
& frontsegP(sK53,X5) ) )
& sK51 = sK53
& ( nil = sK53
| nil != X3 ) )
=> ( sK54 = sK52
& ssList(sK54)
& ( ( nil != sK51
& nil = sK52 )
| ( ! [X4] :
( ~ frontsegP(sK51,X4)
| ~ ssList(X4)
| ~ neq(X4,nil)
| ~ frontsegP(sK52,X4) )
& neq(sK52,nil) ) )
& ( ~ neq(sK54,nil)
| ? [X5] :
( frontsegP(sK54,X5)
& ssList(X5)
& neq(X5,nil)
& frontsegP(sK53,X5) ) )
& sK51 = sK53
& ( nil = sK53
| nil != sK54 ) ) ),
introduced(choice_axiom,[]) ).
fof(f343,plain,
( ? [X5] :
( frontsegP(sK54,X5)
& ssList(X5)
& neq(X5,nil)
& frontsegP(sK53,X5) )
=> ( frontsegP(sK54,sK55)
& ssList(sK55)
& neq(sK55,nil)
& frontsegP(sK53,sK55) ) ),
introduced(choice_axiom,[]) ).
fof(f338,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ssList(X2)
& ? [X3] :
( X1 = X3
& ssList(X3)
& ( ( nil != X0
& nil = X1 )
| ( ! [X4] :
( ~ frontsegP(X0,X4)
| ~ ssList(X4)
| ~ neq(X4,nil)
| ~ frontsegP(X1,X4) )
& neq(X1,nil) ) )
& ( ~ neq(X3,nil)
| ? [X5] :
( frontsegP(X3,X5)
& ssList(X5)
& neq(X5,nil)
& frontsegP(X2,X5) ) )
& X0 = X2
& ( nil = X2
| nil != X3 ) ) )
& ssList(X1) )
& ssList(X0) ),
inference(rectify,[],[f120]) ).
fof(f120,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ssList(X2)
& ? [X3] :
( X1 = X3
& ssList(X3)
& ( ( nil != X0
& nil = X1 )
| ( ! [X5] :
( ~ frontsegP(X0,X5)
| ~ ssList(X5)
| ~ neq(X5,nil)
| ~ frontsegP(X1,X5) )
& neq(X1,nil) ) )
& ( ~ neq(X3,nil)
| ? [X4] :
( frontsegP(X3,X4)
& ssList(X4)
& neq(X4,nil)
& frontsegP(X2,X4) ) )
& X0 = X2
& ( nil = X2
| nil != X3 ) ) )
& ssList(X1) )
& ssList(X0) ),
inference(flattening,[],[f119]) ).
fof(f119,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ~ neq(X3,nil)
| ? [X4] :
( neq(X4,nil)
& frontsegP(X2,X4)
& frontsegP(X3,X4)
& ssList(X4) ) )
& X1 = X3
& ( nil = X2
| nil != X3 )
& ( ( nil != X0
& nil = X1 )
| ( ! [X5] :
( ~ frontsegP(X0,X5)
| ~ ssList(X5)
| ~ neq(X5,nil)
| ~ frontsegP(X1,X5) )
& neq(X1,nil) ) )
& X0 = X2
& 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)
=> ( ( neq(X3,nil)
& ! [X4] :
( ssList(X4)
=> ( ~ neq(X4,nil)
| ~ frontsegP(X2,X4)
| ~ frontsegP(X3,X4) ) ) )
| X1 != X3
| ( nil = X3
& nil != X2 )
| ( ( nil != X1
| nil = X0 )
& ( ? [X5] :
( frontsegP(X0,X5)
& neq(X5,nil)
& frontsegP(X1,X5)
& ssList(X5) )
| ~ neq(X1,nil) ) )
| X0 != X2 ) ) ) ) ),
inference(negated_conjecture,[],[f96]) ).
fof(f96,conjecture,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( ( neq(X3,nil)
& ! [X4] :
( ssList(X4)
=> ( ~ neq(X4,nil)
| ~ frontsegP(X2,X4)
| ~ frontsegP(X3,X4) ) ) )
| X1 != X3
| ( nil = X3
& nil != X2 )
| ( ( nil != X1
| nil = X0 )
& ( ? [X5] :
( frontsegP(X0,X5)
& neq(X5,nil)
& frontsegP(X1,X5)
& ssList(X5) )
| ~ neq(X1,nil) ) )
| X0 != X2 ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1) ).
fof(f616,plain,
( nil = sK52
| ~ neq(sK52,nil) ),
inference(resolution,[],[f615,f601]) ).
fof(f601,plain,
( neq(sK55,nil)
| ~ neq(sK52,nil) ),
inference(backward_demodulation,[],[f542,f550]) ).
fof(f542,plain,
( ~ neq(sK54,nil)
| neq(sK55,nil) ),
inference(cnf_transformation,[],[f344]) ).
fof(f615,plain,
( ~ neq(sK55,nil)
| nil = sK52 ),
inference(subsumption_resolution,[],[f614,f545]) ).
fof(f614,plain,
( ~ neq(sK52,nil)
| nil = sK52
| ~ neq(sK55,nil) ),
inference(resolution,[],[f613,f605]) ).
fof(f605,plain,
( frontsegP(sK51,sK55)
| ~ neq(sK52,nil) ),
inference(backward_demodulation,[],[f599,f540]) ).
fof(f540,plain,
sK51 = sK53,
inference(cnf_transformation,[],[f344]) ).
fof(f599,plain,
( frontsegP(sK53,sK55)
| ~ neq(sK52,nil) ),
inference(backward_demodulation,[],[f541,f550]) ).
fof(f541,plain,
( frontsegP(sK53,sK55)
| ~ neq(sK54,nil) ),
inference(cnf_transformation,[],[f344]) ).
fof(f613,plain,
( ~ frontsegP(sK51,sK55)
| ~ neq(sK55,nil)
| nil = sK52 ),
inference(subsumption_resolution,[],[f612,f609]) ).
fof(f609,plain,
( ssList(sK55)
| nil = sK52 ),
inference(resolution,[],[f545,f607]) ).
fof(f607,plain,
( ~ neq(sK52,nil)
| ssList(sK55) ),
inference(forward_demodulation,[],[f543,f550]) ).
fof(f543,plain,
( ssList(sK55)
| ~ neq(sK54,nil) ),
inference(cnf_transformation,[],[f344]) ).
fof(f612,plain,
( ~ neq(sK55,nil)
| ~ frontsegP(sK51,sK55)
| ~ ssList(sK55)
| nil = sK52 ),
inference(subsumption_resolution,[],[f611,f545]) ).
fof(f611,plain,
( ~ neq(sK52,nil)
| ~ frontsegP(sK51,sK55)
| nil = sK52
| ~ neq(sK55,nil)
| ~ ssList(sK55) ),
inference(resolution,[],[f546,f604]) ).
fof(f604,plain,
( frontsegP(sK52,sK55)
| ~ neq(sK52,nil) ),
inference(forward_demodulation,[],[f603,f550]) ).
fof(f603,plain,
( frontsegP(sK54,sK55)
| ~ neq(sK52,nil) ),
inference(forward_demodulation,[],[f544,f550]) ).
fof(f544,plain,
( ~ neq(sK54,nil)
| frontsegP(sK54,sK55) ),
inference(cnf_transformation,[],[f344]) ).
fof(f546,plain,
! [X4] :
( ~ frontsegP(sK52,X4)
| nil = sK52
| ~ neq(X4,nil)
| ~ ssList(X4)
| ~ frontsegP(sK51,X4) ),
inference(cnf_transformation,[],[f344]) ).
fof(f550,plain,
sK54 = sK52,
inference(cnf_transformation,[],[f344]) ).
fof(f608,plain,
( nil != sK54
| nil = sK51 ),
inference(forward_demodulation,[],[f539,f540]) ).
fof(f539,plain,
( nil = sK53
| nil != sK54 ),
inference(cnf_transformation,[],[f344]) ).
fof(f620,plain,
( nil != sK51
| neq(nil,nil) ),
inference(backward_demodulation,[],[f547,f617]) ).
fof(f547,plain,
( nil != sK51
| neq(sK52,nil) ),
inference(cnf_transformation,[],[f344]) ).
fof(f644,plain,
~ neq(nil,nil),
inference(resolution,[],[f643,f624]) ).
fof(f624,plain,
( neq(sK55,nil)
| ~ neq(nil,nil) ),
inference(backward_demodulation,[],[f601,f617]) ).
fof(f643,plain,
~ neq(sK55,nil),
inference(subsumption_resolution,[],[f642,f640]) ).
fof(f640,plain,
ssList(sK55),
inference(resolution,[],[f627,f636]) ).
fof(f627,plain,
( ~ neq(nil,nil)
| ssList(sK55) ),
inference(backward_demodulation,[],[f607,f617]) ).
fof(f642,plain,
( ~ ssList(sK55)
| ~ neq(sK55,nil) ),
inference(subsumption_resolution,[],[f641,f636]) ).
fof(f641,plain,
( ~ neq(nil,nil)
| ~ ssList(sK55)
| ~ neq(sK55,nil) ),
inference(resolution,[],[f639,f628]) ).
fof(f628,plain,
( frontsegP(nil,sK55)
| ~ neq(nil,nil) ),
inference(forward_demodulation,[],[f625,f617]) ).
fof(f625,plain,
( ~ neq(sK52,nil)
| frontsegP(nil,sK55) ),
inference(backward_demodulation,[],[f604,f617]) ).
fof(f639,plain,
! [X4] :
( ~ frontsegP(nil,X4)
| ~ ssList(X4)
| ~ neq(X4,nil) ),
inference(duplicate_literal_removal,[],[f638]) ).
fof(f638,plain,
! [X4] :
( ~ ssList(X4)
| ~ neq(X4,nil)
| ~ frontsegP(nil,X4)
| ~ frontsegP(nil,X4) ),
inference(forward_demodulation,[],[f637,f630]) ).
fof(f637,plain,
! [X4] :
( ~ frontsegP(nil,X4)
| ~ frontsegP(sK51,X4)
| ~ neq(X4,nil)
| ~ ssList(X4) ),
inference(trivial_inequality_removal,[],[f634]) ).
fof(f634,plain,
! [X4] :
( ~ neq(X4,nil)
| ~ ssList(X4)
| ~ frontsegP(sK51,X4)
| nil != nil
| ~ frontsegP(nil,X4) ),
inference(backward_demodulation,[],[f621,f630]) ).
fof(f621,plain,
! [X4] :
( ~ frontsegP(nil,X4)
| nil != sK51
| ~ ssList(X4)
| ~ neq(X4,nil)
| ~ frontsegP(sK51,X4) ),
inference(backward_demodulation,[],[f548,f617]) ).
fof(f548,plain,
! [X4] :
( ~ frontsegP(sK52,X4)
| ~ ssList(X4)
| ~ neq(X4,nil)
| nil != sK51
| ~ frontsegP(sK51,X4) ),
inference(cnf_transformation,[],[f344]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : SWC016+1 : TPTP v8.1.0. Released v2.4.0.
% 0.07/0.14 % Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_sat --cores 0 -t %d %s
% 0.14/0.35 % Computer : n019.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Tue Aug 30 17:58:20 EDT 2022
% 0.14/0.35 % CPUTime :
% 0.21/0.48 % (18639)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.21/0.49 % (18647)ott+10_1:1_kws=precedence:tgt=ground:i=482:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/482Mi)
% 0.21/0.51 % (18631)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.21/0.51 % (18631)Instruction limit reached!
% 0.21/0.51 % (18631)------------------------------
% 0.21/0.51 % (18631)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.21/0.51 % (18631)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.21/0.51 % (18631)Termination reason: Unknown
% 0.21/0.51 % (18631)Termination phase: Preprocessing 1
% 0.21/0.51
% 0.21/0.51 % (18631)Memory used [KB]: 895
% 0.21/0.51 % (18631)Time elapsed: 0.002 s
% 0.21/0.51 % (18631)Instructions burned: 2 (million)
% 0.21/0.51 % (18631)------------------------------
% 0.21/0.51 % (18631)------------------------------
% 0.21/0.51 % (18635)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.21/0.51 % (18625)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.21/0.51 % (18636)ott+10_1:5_bd=off:tgt=full:i=99:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/99Mi)
% 0.21/0.53 % (18648)ott+10_1:5_bd=off:tgt=full:i=500:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/500Mi)
% 0.21/0.53 % (18633)ott+2_1:1_fsr=off:gsp=on:i=50:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/50Mi)
% 0.21/0.53 % (18646)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.21/0.53 % (18624)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.21/0.53 % (18638)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.21/0.53 % (18627)ott+33_1:4_s2a=on:tgt=ground:i=51:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/51Mi)
% 0.21/0.53 % (18628)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.21/0.53 % (18649)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.21/0.53 % (18626)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.21/0.54 % (18634)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.21/0.54 % (18630)dis+10_1:1_fsd=on:sp=occurrence:i=7:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/7Mi)
% 0.21/0.54 % (18640)fmb+10_1:1_bce=on:i=59:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/59Mi)
% 0.21/0.54 % (18641)ott+10_1:1_tgt=ground:i=100:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/100Mi)
% 0.21/0.54 % (18651)ott+33_1:4_s2a=on:tgt=ground:i=439:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/439Mi)
% 0.21/0.54 % (18630)Instruction limit reached!
% 0.21/0.54 % (18630)------------------------------
% 0.21/0.54 % (18630)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.21/0.54 % (18630)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.21/0.54 % (18630)Termination reason: Unknown
% 0.21/0.54 % (18652)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.21/0.54 % (18630)Termination phase: Property scanning
% 0.21/0.54
% 0.21/0.54 % (18630)Memory used [KB]: 1279
% 0.21/0.54 % (18630)Time elapsed: 0.004 s
% 0.21/0.54 % (18630)Instructions burned: 7 (million)
% 0.21/0.54 % (18630)------------------------------
% 0.21/0.54 % (18630)------------------------------
% 0.21/0.55 % (18632)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.21/0.55 % (18650)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.21/0.55 % (18643)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.21/0.55 % (18644)ott+3_1:1_gsp=on:lcm=predicate:i=138:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/138Mi)
% 0.21/0.55 % (18642)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.21/0.55 % (18638)First to succeed.
% 0.21/0.56 % (18638)Refutation found. Thanks to Tanya!
% 0.21/0.56 % SZS status Theorem for theBenchmark
% 0.21/0.56 % SZS output start Proof for theBenchmark
% See solution above
% 0.21/0.56 % (18638)------------------------------
% 0.21/0.56 % (18638)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.21/0.56 % (18638)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.21/0.56 % (18638)Termination reason: Refutation
% 0.21/0.56
% 0.21/0.56 % (18638)Memory used [KB]: 1535
% 0.21/0.56 % (18638)Time elapsed: 0.149 s
% 0.21/0.56 % (18638)Instructions burned: 19 (million)
% 0.21/0.56 % (18638)------------------------------
% 0.21/0.56 % (18638)------------------------------
% 0.21/0.56 % (18622)Success in time 0.204 s
%------------------------------------------------------------------------------