TSTP Solution File: SWC325+1 by SnakeForV-SAT---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV-SAT---1.0
% Problem : SWC325+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 : n016.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:10 EDT 2022
% Result : Theorem 0.15s 0.56s
% Output : Refutation 0.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 18
% Number of leaves : 14
% Syntax : Number of formulae : 77 ( 17 unt; 0 def)
% Number of atoms : 377 ( 171 equ)
% Maximal formula atoms : 34 ( 4 avg)
% Number of connectives : 464 ( 164 ~; 145 |; 130 &)
% ( 2 <=>; 23 =>; 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 : 105 ( 53 !; 52 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f926,plain,
$false,
inference(subsumption_resolution,[],[f925,f871]) ).
fof(f871,plain,
ssList(sK57),
inference(subsumption_resolution,[],[f870,f546]) ).
fof(f546,plain,
ssList(sK53),
inference(cnf_transformation,[],[f347]) ).
fof(f347,plain,
( ssList(sK54)
& ssList(sK55)
& sK55 = sK53
& ( nil = sK54
| nil != sK55 )
& sK54 = sK52
& ! [X4] :
( ~ ssList(X4)
| ! [X5] :
( app(X5,X4) != sK52
| ~ ssList(X5)
| app(X4,X5) != sK53 ) )
& ( ( ssItem(sK56)
& ssList(sK57)
& sK55 = app(sK57,cons(sK56,nil))
& sK54 = app(cons(sK56,nil),sK57) )
| ~ neq(sK55,nil) )
& ssList(sK53)
& ssList(sK52) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK52,sK53,sK54,sK55,sK56,sK57])],[f198,f346,f345,f344,f343,f342,f341]) ).
fof(f341,plain,
( ? [X0] :
( ? [X1] :
( ? [X2] :
( ssList(X2)
& ? [X3] :
( ssList(X3)
& X1 = X3
& ( nil = X2
| nil != X3 )
& X0 = X2
& ! [X4] :
( ~ ssList(X4)
| ! [X5] :
( app(X5,X4) != X0
| ~ ssList(X5)
| app(X4,X5) != X1 ) )
& ( ? [X6] :
( ssItem(X6)
& ? [X7] :
( ssList(X7)
& app(X7,cons(X6,nil)) = X3
& app(cons(X6,nil),X7) = X2 ) )
| ~ neq(X3,nil) ) ) )
& ssList(X1) )
& ssList(X0) )
=> ( ? [X1] :
( ? [X2] :
( ssList(X2)
& ? [X3] :
( ssList(X3)
& X1 = X3
& ( nil = X2
| nil != X3 )
& sK52 = X2
& ! [X4] :
( ~ ssList(X4)
| ! [X5] :
( app(X5,X4) != sK52
| ~ ssList(X5)
| app(X4,X5) != X1 ) )
& ( ? [X6] :
( ssItem(X6)
& ? [X7] :
( ssList(X7)
& app(X7,cons(X6,nil)) = X3
& app(cons(X6,nil),X7) = X2 ) )
| ~ neq(X3,nil) ) ) )
& ssList(X1) )
& ssList(sK52) ) ),
introduced(choice_axiom,[]) ).
fof(f342,plain,
( ? [X1] :
( ? [X2] :
( ssList(X2)
& ? [X3] :
( ssList(X3)
& X1 = X3
& ( nil = X2
| nil != X3 )
& sK52 = X2
& ! [X4] :
( ~ ssList(X4)
| ! [X5] :
( app(X5,X4) != sK52
| ~ ssList(X5)
| app(X4,X5) != X1 ) )
& ( ? [X6] :
( ssItem(X6)
& ? [X7] :
( ssList(X7)
& app(X7,cons(X6,nil)) = X3
& app(cons(X6,nil),X7) = X2 ) )
| ~ neq(X3,nil) ) ) )
& ssList(X1) )
=> ( ? [X2] :
( ssList(X2)
& ? [X3] :
( ssList(X3)
& sK53 = X3
& ( nil = X2
| nil != X3 )
& sK52 = X2
& ! [X4] :
( ~ ssList(X4)
| ! [X5] :
( app(X5,X4) != sK52
| ~ ssList(X5)
| app(X4,X5) != sK53 ) )
& ( ? [X6] :
( ssItem(X6)
& ? [X7] :
( ssList(X7)
& app(X7,cons(X6,nil)) = X3
& app(cons(X6,nil),X7) = X2 ) )
| ~ neq(X3,nil) ) ) )
& ssList(sK53) ) ),
introduced(choice_axiom,[]) ).
fof(f343,plain,
( ? [X2] :
( ssList(X2)
& ? [X3] :
( ssList(X3)
& sK53 = X3
& ( nil = X2
| nil != X3 )
& sK52 = X2
& ! [X4] :
( ~ ssList(X4)
| ! [X5] :
( app(X5,X4) != sK52
| ~ ssList(X5)
| app(X4,X5) != sK53 ) )
& ( ? [X6] :
( ssItem(X6)
& ? [X7] :
( ssList(X7)
& app(X7,cons(X6,nil)) = X3
& app(cons(X6,nil),X7) = X2 ) )
| ~ neq(X3,nil) ) ) )
=> ( ssList(sK54)
& ? [X3] :
( ssList(X3)
& sK53 = X3
& ( nil = sK54
| nil != X3 )
& sK54 = sK52
& ! [X4] :
( ~ ssList(X4)
| ! [X5] :
( app(X5,X4) != sK52
| ~ ssList(X5)
| app(X4,X5) != sK53 ) )
& ( ? [X6] :
( ssItem(X6)
& ? [X7] :
( ssList(X7)
& app(X7,cons(X6,nil)) = X3
& app(cons(X6,nil),X7) = sK54 ) )
| ~ neq(X3,nil) ) ) ) ),
introduced(choice_axiom,[]) ).
fof(f344,plain,
( ? [X3] :
( ssList(X3)
& sK53 = X3
& ( nil = sK54
| nil != X3 )
& sK54 = sK52
& ! [X4] :
( ~ ssList(X4)
| ! [X5] :
( app(X5,X4) != sK52
| ~ ssList(X5)
| app(X4,X5) != sK53 ) )
& ( ? [X6] :
( ssItem(X6)
& ? [X7] :
( ssList(X7)
& app(X7,cons(X6,nil)) = X3
& app(cons(X6,nil),X7) = sK54 ) )
| ~ neq(X3,nil) ) )
=> ( ssList(sK55)
& sK55 = sK53
& ( nil = sK54
| nil != sK55 )
& sK54 = sK52
& ! [X4] :
( ~ ssList(X4)
| ! [X5] :
( app(X5,X4) != sK52
| ~ ssList(X5)
| app(X4,X5) != sK53 ) )
& ( ? [X6] :
( ssItem(X6)
& ? [X7] :
( ssList(X7)
& app(X7,cons(X6,nil)) = sK55
& app(cons(X6,nil),X7) = sK54 ) )
| ~ neq(sK55,nil) ) ) ),
introduced(choice_axiom,[]) ).
fof(f345,plain,
( ? [X6] :
( ssItem(X6)
& ? [X7] :
( ssList(X7)
& app(X7,cons(X6,nil)) = sK55
& app(cons(X6,nil),X7) = sK54 ) )
=> ( ssItem(sK56)
& ? [X7] :
( ssList(X7)
& sK55 = app(X7,cons(sK56,nil))
& app(cons(sK56,nil),X7) = sK54 ) ) ),
introduced(choice_axiom,[]) ).
fof(f346,plain,
( ? [X7] :
( ssList(X7)
& sK55 = app(X7,cons(sK56,nil))
& app(cons(sK56,nil),X7) = sK54 )
=> ( ssList(sK57)
& sK55 = app(sK57,cons(sK56,nil))
& sK54 = app(cons(sK56,nil),sK57) ) ),
introduced(choice_axiom,[]) ).
fof(f198,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ssList(X2)
& ? [X3] :
( ssList(X3)
& X1 = X3
& ( nil = X2
| nil != X3 )
& X0 = X2
& ! [X4] :
( ~ ssList(X4)
| ! [X5] :
( app(X5,X4) != X0
| ~ ssList(X5)
| app(X4,X5) != X1 ) )
& ( ? [X6] :
( ssItem(X6)
& ? [X7] :
( ssList(X7)
& app(X7,cons(X6,nil)) = X3
& app(cons(X6,nil),X7) = X2 ) )
| ~ neq(X3,nil) ) ) )
& ssList(X1) )
& ssList(X0) ),
inference(flattening,[],[f197]) ).
fof(f197,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( nil = X2
| nil != X3 )
& ! [X4] :
( ~ ssList(X4)
| ! [X5] :
( app(X5,X4) != X0
| ~ ssList(X5)
| app(X4,X5) != X1 ) )
& X1 = X3
& ( ~ neq(X3,nil)
| ? [X6] :
( ? [X7] :
( app(cons(X6,nil),X7) = X2
& app(X7,cons(X6,nil)) = X3
& ssList(X7) )
& ssItem(X6) ) )
& 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)
=> ( ( nil != X2
& nil = X3 )
| ? [X4] :
( ? [X5] :
( ssList(X5)
& app(X5,X4) = X0
& app(X4,X5) = X1 )
& ssList(X4) )
| X1 != X3
| ( neq(X3,nil)
& ! [X6] :
( ssItem(X6)
=> ! [X7] :
( ssList(X7)
=> ( app(cons(X6,nil),X7) != X2
| app(X7,cons(X6,nil)) != X3 ) ) ) )
| X0 != X2 ) ) ) ) ),
inference(negated_conjecture,[],[f96]) ).
fof(f96,conjecture,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( ( nil != X2
& nil = X3 )
| ? [X4] :
( ? [X5] :
( ssList(X5)
& app(X5,X4) = X0
& app(X4,X5) = X1 )
& ssList(X4) )
| X1 != X3
| ( neq(X3,nil)
& ! [X6] :
( ssItem(X6)
=> ! [X7] :
( ssList(X7)
=> ( app(cons(X6,nil),X7) != X2
| app(X7,cons(X6,nil)) != X3 ) ) ) )
| X0 != X2 ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1) ).
fof(f870,plain,
( ssList(sK57)
| ~ ssList(sK53) ),
inference(subsumption_resolution,[],[f869,f559]) ).
fof(f559,plain,
ssList(nil),
inference(cnf_transformation,[],[f17]) ).
fof(f17,axiom,
ssList(nil),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax17) ).
fof(f869,plain,
( ~ ssList(nil)
| ssList(sK57)
| ~ ssList(sK53) ),
inference(subsumption_resolution,[],[f841,f650]) ).
fof(f650,plain,
nil != sK53,
inference(subsumption_resolution,[],[f649,f611]) ).
fof(f611,plain,
( nil != sK53
| nil = sK52 ),
inference(superposition,[],[f603,f554]) ).
fof(f554,plain,
sK55 = sK53,
inference(cnf_transformation,[],[f347]) ).
fof(f603,plain,
( nil != sK55
| nil = sK52 ),
inference(backward_demodulation,[],[f553,f552]) ).
fof(f552,plain,
sK54 = sK52,
inference(cnf_transformation,[],[f347]) ).
fof(f553,plain,
( nil = sK54
| nil != sK55 ),
inference(cnf_transformation,[],[f347]) ).
fof(f649,plain,
( nil != sK52
| nil != sK53 ),
inference(subsumption_resolution,[],[f648,f559]) ).
fof(f648,plain,
( nil != sK52
| nil != sK53
| ~ ssList(nil) ),
inference(duplicate_literal_removal,[],[f647]) ).
fof(f647,plain,
( nil != sK53
| nil != sK52
| ~ ssList(nil)
| ~ ssList(nil) ),
inference(superposition,[],[f551,f626]) ).
fof(f626,plain,
nil = app(nil,nil),
inference(resolution,[],[f364,f559]) ).
fof(f364,plain,
! [X0] :
( ~ ssList(X0)
| app(nil,X0) = X0 ),
inference(cnf_transformation,[],[f100]) ).
fof(f100,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(f551,plain,
! [X4,X5] :
( app(X5,X4) != sK52
| ~ ssList(X5)
| app(X4,X5) != sK53
| ~ ssList(X4) ),
inference(cnf_transformation,[],[f347]) ).
fof(f841,plain,
( nil = sK53
| ssList(sK57)
| ~ ssList(sK53)
| ~ ssList(nil) ),
inference(resolution,[],[f478,f602]) ).
fof(f602,plain,
( ~ neq(sK53,nil)
| ssList(sK57) ),
inference(forward_demodulation,[],[f549,f554]) ).
fof(f549,plain,
( ~ neq(sK55,nil)
| ssList(sK57) ),
inference(cnf_transformation,[],[f347]) ).
fof(f478,plain,
! [X0,X1] :
( neq(X0,X1)
| ~ ssList(X0)
| ~ ssList(X1)
| X0 = X1 ),
inference(cnf_transformation,[],[f300]) ).
fof(f300,plain,
! [X0] :
( ! [X1] :
( ~ ssList(X1)
| ( ( X0 != X1
| ~ neq(X0,X1) )
& ( neq(X0,X1)
| X0 = X1 ) ) )
| ~ ssList(X0) ),
inference(nnf_transformation,[],[f139]) ).
fof(f139,plain,
! [X0] :
( ! [X1] :
( ~ ssList(X1)
| ( X0 != X1
<=> neq(X0,X1) ) )
| ~ ssList(X0) ),
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(f925,plain,
~ ssList(sK57),
inference(resolution,[],[f868,f873]) ).
fof(f873,plain,
ssList(sF59),
inference(resolution,[],[f859,f696]) ).
fof(f696,plain,
( ~ ssItem(sK56)
| ssList(sF59) ),
inference(subsumption_resolution,[],[f695,f559]) ).
fof(f695,plain,
( ~ ssItem(sK56)
| ~ ssList(nil)
| ssList(sF59) ),
inference(superposition,[],[f357,f588]) ).
fof(f588,plain,
cons(sK56,nil) = sF59,
introduced(function_definition,[]) ).
fof(f357,plain,
! [X0,X1] :
( ssList(cons(X1,X0))
| ~ ssItem(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f178]) ).
fof(f178,plain,
! [X0] :
( ! [X1] :
( ~ ssItem(X1)
| ssList(cons(X1,X0)) )
| ~ 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(f859,plain,
ssItem(sK56),
inference(subsumption_resolution,[],[f858,f559]) ).
fof(f858,plain,
( ssItem(sK56)
| ~ ssList(nil) ),
inference(subsumption_resolution,[],[f857,f546]) ).
fof(f857,plain,
( ~ ssList(sK53)
| ~ ssList(nil)
| ssItem(sK56) ),
inference(subsumption_resolution,[],[f842,f650]) ).
fof(f842,plain,
( nil = sK53
| ~ ssList(sK53)
| ssItem(sK56)
| ~ ssList(nil) ),
inference(resolution,[],[f478,f601]) ).
fof(f601,plain,
( ~ neq(sK53,nil)
| ssItem(sK56) ),
inference(forward_demodulation,[],[f550,f554]) ).
fof(f550,plain,
( ssItem(sK56)
| ~ neq(sK55,nil) ),
inference(cnf_transformation,[],[f347]) ).
fof(f868,plain,
( ~ ssList(sF59)
| ~ ssList(sK57) ),
inference(trivial_inequality_removal,[],[f867]) ).
fof(f867,plain,
( sK52 != sK52
| ~ ssList(sF59)
| ~ ssList(sK57) ),
inference(backward_demodulation,[],[f856,f862]) ).
fof(f862,plain,
sF61 = sK52,
inference(subsumption_resolution,[],[f861,f546]) ).
fof(f861,plain,
( ~ ssList(sK53)
| sF61 = sK52 ),
inference(subsumption_resolution,[],[f860,f559]) ).
fof(f860,plain,
( sF61 = sK52
| ~ ssList(nil)
| ~ ssList(sK53) ),
inference(subsumption_resolution,[],[f840,f650]) ).
fof(f840,plain,
( nil = sK53
| sF61 = sK52
| ~ ssList(nil)
| ~ ssList(sK53) ),
inference(resolution,[],[f478,f607]) ).
fof(f607,plain,
( ~ neq(sK53,nil)
| sF61 = sK52 ),
inference(forward_demodulation,[],[f606,f554]) ).
fof(f606,plain,
( sF61 = sK52
| ~ neq(sK55,nil) ),
inference(forward_demodulation,[],[f592,f552]) ).
fof(f592,plain,
( sF61 = sK54
| ~ neq(sK55,nil) ),
inference(definition_folding,[],[f547,f591,f588]) ).
fof(f591,plain,
sF61 = app(sF59,sK57),
introduced(function_definition,[]) ).
fof(f547,plain,
( sK54 = app(cons(sK56,nil),sK57)
| ~ neq(sK55,nil) ),
inference(cnf_transformation,[],[f347]) ).
fof(f856,plain,
( ~ ssList(sK57)
| sF61 != sK52
| ~ ssList(sF59) ),
inference(trivial_inequality_removal,[],[f852]) ).
fof(f852,plain,
( ~ ssList(sF59)
| sF61 != sK52
| ~ ssList(sK57)
| sK53 != sK53 ),
inference(backward_demodulation,[],[f615,f849]) ).
fof(f849,plain,
sK53 = sF60,
inference(subsumption_resolution,[],[f848,f650]) ).
fof(f848,plain,
( sK53 = sF60
| nil = sK53 ),
inference(subsumption_resolution,[],[f847,f559]) ).
fof(f847,plain,
( sK53 = sF60
| ~ ssList(nil)
| nil = sK53 ),
inference(subsumption_resolution,[],[f839,f546]) ).
fof(f839,plain,
( ~ ssList(sK53)
| nil = sK53
| sK53 = sF60
| ~ ssList(nil) ),
inference(resolution,[],[f478,f610]) ).
fof(f610,plain,
( ~ neq(sK53,nil)
| sK53 = sF60 ),
inference(forward_demodulation,[],[f609,f554]) ).
fof(f609,plain,
( sK55 = sF60
| ~ neq(sK53,nil) ),
inference(forward_demodulation,[],[f590,f554]) ).
fof(f590,plain,
( ~ neq(sK55,nil)
| sK55 = sF60 ),
inference(definition_folding,[],[f548,f589,f588]) ).
fof(f589,plain,
app(sK57,sF59) = sF60,
introduced(function_definition,[]) ).
fof(f548,plain,
( sK55 = app(sK57,cons(sK56,nil))
| ~ neq(sK55,nil) ),
inference(cnf_transformation,[],[f347]) ).
fof(f615,plain,
( ~ ssList(sF59)
| sK53 != sF60
| ~ ssList(sK57)
| sF61 != sK52 ),
inference(forward_demodulation,[],[f614,f589]) ).
fof(f614,plain,
( sK53 != app(sK57,sF59)
| ~ ssList(sF59)
| ~ ssList(sK57)
| sF61 != sK52 ),
inference(superposition,[],[f551,f591]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SWC325+1 : TPTP v8.1.0. Released v2.4.0.
% 0.00/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.10/0.33 % Computer : n016.cluster.edu
% 0.10/0.33 % Model : x86_64 x86_64
% 0.10/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.33 % Memory : 8042.1875MB
% 0.10/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.33 % CPULimit : 300
% 0.10/0.33 % WCLimit : 300
% 0.10/0.33 % DateTime : Tue Aug 30 19:09:31 EDT 2022
% 0.10/0.34 % CPUTime :
% 0.15/0.48 % (10477)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.15/0.49 % (10478)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.15/0.49 % (10469)dis+10_1:1_fsd=on:sp=occurrence:i=7:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/7Mi)
% 0.15/0.49 % (10468)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.15/0.49 % (10476)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.15/0.50 % (10470)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.15/0.50 % (10470)Instruction limit reached!
% 0.15/0.50 % (10470)------------------------------
% 0.15/0.50 % (10470)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.15/0.50 % (10470)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.15/0.50 % (10470)Termination reason: Unknown
% 0.15/0.50 % (10470)Termination phase: Preprocessing 1
% 0.15/0.50
% 0.15/0.50 % (10470)Memory used [KB]: 895
% 0.15/0.50 % (10470)Time elapsed: 0.005 s
% 0.15/0.50 % (10470)Instructions burned: 2 (million)
% 0.15/0.50 % (10470)------------------------------
% 0.15/0.50 % (10470)------------------------------
% 0.15/0.51 % (10485)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.15/0.51 % (10484)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.15/0.51 % (10486)ott+10_1:1_kws=precedence:tgt=ground:i=482:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/482Mi)
% 0.15/0.51 % (10469)Instruction limit reached!
% 0.15/0.51 % (10469)------------------------------
% 0.15/0.51 % (10469)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.15/0.51 % (10469)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.15/0.51 % (10469)Termination reason: Unknown
% 0.15/0.51 % (10469)Termination phase: Function definition elimination
% 0.15/0.51
% 0.15/0.51 % (10469)Memory used [KB]: 1279
% 0.15/0.51 % (10469)Time elapsed: 0.006 s
% 0.15/0.51 % (10469)Instructions burned: 8 (million)
% 0.15/0.51 % (10469)------------------------------
% 0.15/0.51 % (10469)------------------------------
% 0.15/0.53 % (10465)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.15/0.53 % (10475)ott+10_1:5_bd=off:tgt=full:i=99:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/99Mi)
% 0.15/0.54 % (10466)ott+33_1:4_s2a=on:tgt=ground:i=51:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/51Mi)
% 0.15/0.54 TRYING [1]
% 0.15/0.54 TRYING [2]
% 0.15/0.55 % (10467)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.15/0.55 % (10482)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.15/0.55 % (10477)First to succeed.
% 0.15/0.55 % (10473)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.15/0.55 % (10491)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.15/0.56 % (10474)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.15/0.56 % (10484)Also succeeded, but the first one will report.
% 0.15/0.56 % (10479)fmb+10_1:1_bce=on:i=59:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/59Mi)
% 0.15/0.56 % (10477)Refutation found. Thanks to Tanya!
% 0.15/0.56 % SZS status Theorem for theBenchmark
% 0.15/0.56 % SZS output start Proof for theBenchmark
% See solution above
% 0.15/0.56 % (10477)------------------------------
% 0.15/0.56 % (10477)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.15/0.56 % (10477)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.15/0.56 % (10477)Termination reason: Refutation
% 0.15/0.56
% 0.15/0.56 % (10477)Memory used [KB]: 1791
% 0.15/0.56 % (10477)Time elapsed: 0.147 s
% 0.15/0.56 % (10477)Instructions burned: 34 (million)
% 0.15/0.56 % (10477)------------------------------
% 0.15/0.56 % (10477)------------------------------
% 0.15/0.56 % (10461)Success in time 0.216 s
%------------------------------------------------------------------------------