TSTP Solution File: MGT014+1 by SnakeForV-SAT---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV-SAT---1.0
% Problem : MGT014+1 : TPTP v8.1.0. Released v2.0.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 : n014.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 17:51:22 EDT 2022
% Result : Theorem 0.23s 0.52s
% Output : Refutation 0.23s
% Verified :
% SZS Type : Refutation
% Derivation depth : 20
% Number of leaves : 9
% Syntax : Number of formulae : 80 ( 18 unt; 0 def)
% Number of atoms : 341 ( 31 equ)
% Maximal formula atoms : 18 ( 4 avg)
% Number of connectives : 420 ( 159 ~; 145 |; 100 &)
% ( 0 <=>; 16 =>; 0 <=; 0 <~>)
% Maximal formula depth : 17 ( 7 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 8 ( 6 usr; 1 prp; 0-3 aty)
% Number of functors : 7 ( 7 usr; 7 con; 0-0 aty)
% Number of variables : 209 ( 181 !; 28 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f136,plain,
$false,
inference(subsumption_resolution,[],[f135,f58]) ).
fof(f58,plain,
! [X1] : ~ greater(X1,X1),
inference(equality_resolution,[],[f56]) ).
fof(f56,plain,
! [X0,X1] :
( X0 != X1
| ~ greater(X0,X1) ),
inference(cnf_transformation,[],[f24]) ).
fof(f24,plain,
! [X0,X1] :
( X0 != X1
| ~ greater(X0,X1) ),
inference(ennf_transformation,[],[f1]) ).
fof(f1,axiom,
! [X1,X0] :
~ ( greater(X0,X1)
& X0 = X1 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mp6_1) ).
fof(f135,plain,
greater(sK0,sK0),
inference(backward_demodulation,[],[f45,f129]) ).
fof(f129,plain,
sK0 = sK4,
inference(resolution,[],[f109,f93]) ).
fof(f93,plain,
! [X1] :
( ~ size(sK5,X1,sK2)
| sK4 = X1 ),
inference(subsumption_resolution,[],[f91,f52]) ).
fof(f52,plain,
organization(sK5,sK2),
inference(cnf_transformation,[],[f36]) ).
fof(f36,plain,
( organization(sK5,sK2)
& reorganization_free(sK5,sK2,sK6)
& complexity(sK5,sK1,sK6)
& organization(sK5,sK6)
& complexity(sK5,sK3,sK2)
& size(sK5,sK4,sK2)
& size(sK5,sK0,sK6)
& greater(sK0,sK4)
& greater(sK3,sK1) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3,sK4,sK5,sK6])],[f34,f35]) ).
fof(f35,plain,
( ? [X0,X1,X2,X3,X4,X5,X6] :
( organization(X5,X2)
& reorganization_free(X5,X2,X6)
& complexity(X5,X1,X6)
& organization(X5,X6)
& complexity(X5,X3,X2)
& size(X5,X4,X2)
& size(X5,X0,X6)
& greater(X0,X4)
& greater(X3,X1) )
=> ( organization(sK5,sK2)
& reorganization_free(sK5,sK2,sK6)
& complexity(sK5,sK1,sK6)
& organization(sK5,sK6)
& complexity(sK5,sK3,sK2)
& size(sK5,sK4,sK2)
& size(sK5,sK0,sK6)
& greater(sK0,sK4)
& greater(sK3,sK1) ) ),
introduced(choice_axiom,[]) ).
fof(f34,plain,
? [X0,X1,X2,X3,X4,X5,X6] :
( organization(X5,X2)
& reorganization_free(X5,X2,X6)
& complexity(X5,X1,X6)
& organization(X5,X6)
& complexity(X5,X3,X2)
& size(X5,X4,X2)
& size(X5,X0,X6)
& greater(X0,X4)
& greater(X3,X1) ),
inference(rectify,[],[f28]) ).
fof(f28,plain,
? [X2,X0,X5,X6,X1,X4,X3] :
( organization(X4,X5)
& reorganization_free(X4,X5,X3)
& complexity(X4,X0,X3)
& organization(X4,X3)
& complexity(X4,X6,X5)
& size(X4,X1,X5)
& size(X4,X2,X3)
& greater(X2,X1)
& greater(X6,X0) ),
inference(flattening,[],[f27]) ).
fof(f27,plain,
? [X1,X4,X6,X3,X2,X0,X5] :
( greater(X6,X0)
& size(X4,X2,X3)
& complexity(X4,X6,X5)
& complexity(X4,X0,X3)
& reorganization_free(X4,X5,X3)
& organization(X4,X3)
& size(X4,X1,X5)
& greater(X2,X1)
& organization(X4,X5) ),
inference(ennf_transformation,[],[f16]) ).
fof(f16,plain,
~ ! [X1,X4,X6,X3,X2,X0,X5] :
( ( size(X4,X2,X3)
& complexity(X4,X6,X5)
& complexity(X4,X0,X3)
& reorganization_free(X4,X5,X3)
& organization(X4,X3)
& size(X4,X1,X5)
& greater(X2,X1)
& organization(X4,X5) )
=> ~ greater(X6,X0) ),
inference(rectify,[],[f10]) ).
fof(f10,negated_conjecture,
~ ! [X8,X5,X6,X4,X0,X3,X7] :
( ( reorganization_free(X0,X3,X4)
& complexity(X0,X7,X3)
& organization(X0,X4)
& greater(X6,X5)
& organization(X0,X3)
& size(X0,X6,X4)
& complexity(X0,X8,X4)
& size(X0,X5,X3) )
=> ~ greater(X7,X8) ),
inference(negated_conjecture,[],[f9]) ).
fof(f9,conjecture,
! [X8,X5,X6,X4,X0,X3,X7] :
( ( reorganization_free(X0,X3,X4)
& complexity(X0,X7,X3)
& organization(X0,X4)
& greater(X6,X5)
& organization(X0,X3)
& size(X0,X6,X4)
& complexity(X0,X8,X4)
& size(X0,X5,X3) )
=> ~ greater(X7,X8) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t14_FOL) ).
fof(f91,plain,
! [X1] :
( ~ size(sK5,X1,sK2)
| sK4 = X1
| ~ organization(sK5,sK2) ),
inference(resolution,[],[f59,f47]) ).
fof(f47,plain,
size(sK5,sK4,sK2),
inference(cnf_transformation,[],[f36]) ).
fof(f59,plain,
! [X2,X3,X1,X4] :
( ~ size(X4,X3,X2)
| ~ size(X4,X1,X2)
| X1 = X3
| ~ organization(X4,X2) ),
inference(duplicate_literal_removal,[],[f57]) ).
fof(f57,plain,
! [X2,X3,X1,X4] :
( ~ size(X4,X1,X2)
| ~ organization(X4,X2)
| X1 = X3
| ~ organization(X4,X2)
| ~ size(X4,X3,X2) ),
inference(equality_resolution,[],[f54]) ).
fof(f54,plain,
! [X2,X3,X0,X1,X4] :
( X1 = X3
| ~ organization(X4,X0)
| ~ size(X4,X3,X2)
| ~ organization(X4,X2)
| ~ size(X4,X1,X0)
| X0 != X2 ),
inference(cnf_transformation,[],[f38]) ).
fof(f38,plain,
! [X0,X1,X2,X3,X4] :
( X1 = X3
| ~ organization(X4,X0)
| ~ size(X4,X3,X2)
| ~ organization(X4,X2)
| ~ size(X4,X1,X0)
| X0 != X2 ),
inference(rectify,[],[f22]) ).
fof(f22,plain,
! [X3,X0,X2,X4,X1] :
( X0 = X4
| ~ organization(X1,X3)
| ~ size(X1,X4,X2)
| ~ organization(X1,X2)
| ~ size(X1,X0,X3)
| X2 != X3 ),
inference(flattening,[],[f21]) ).
fof(f21,plain,
! [X2,X0,X4,X1,X3] :
( X0 = X4
| X2 != X3
| ~ size(X1,X0,X3)
| ~ organization(X1,X3)
| ~ organization(X1,X2)
| ~ size(X1,X4,X2) ),
inference(ennf_transformation,[],[f15]) ).
fof(f15,plain,
! [X2,X0,X4,X1,X3] :
( ( X2 = X3
& size(X1,X0,X3)
& organization(X1,X3)
& organization(X1,X2)
& size(X1,X4,X2) )
=> X0 = X4 ),
inference(rectify,[],[f6]) ).
fof(f6,axiom,
! [X6,X0,X3,X4,X5] :
( ( organization(X0,X3)
& size(X0,X5,X3)
& organization(X0,X4)
& X3 = X4
& size(X0,X6,X4) )
=> X5 = X6 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mp19) ).
fof(f109,plain,
size(sK5,sK0,sK2),
inference(backward_demodulation,[],[f46,f103]) ).
fof(f103,plain,
sK6 = sK2,
inference(subsumption_resolution,[],[f102,f77]) ).
fof(f77,plain,
~ greater(sK6,sK2),
inference(subsumption_resolution,[],[f76,f51]) ).
fof(f51,plain,
reorganization_free(sK5,sK2,sK6),
inference(cnf_transformation,[],[f36]) ).
fof(f76,plain,
( ~ greater(sK6,sK2)
| ~ reorganization_free(sK5,sK2,sK6) ),
inference(subsumption_resolution,[],[f75,f49]) ).
fof(f49,plain,
organization(sK5,sK6),
inference(cnf_transformation,[],[f36]) ).
fof(f75,plain,
( ~ organization(sK5,sK6)
| ~ greater(sK6,sK2)
| ~ reorganization_free(sK5,sK2,sK6) ),
inference(subsumption_resolution,[],[f73,f44]) ).
fof(f44,plain,
greater(sK3,sK1),
inference(cnf_transformation,[],[f36]) ).
fof(f73,plain,
( ~ greater(sK3,sK1)
| ~ greater(sK6,sK2)
| ~ reorganization_free(sK5,sK2,sK6)
| ~ organization(sK5,sK6) ),
inference(resolution,[],[f63,f50]) ).
fof(f50,plain,
complexity(sK5,sK1,sK6),
inference(cnf_transformation,[],[f36]) ).
fof(f63,plain,
! [X0,X1] :
( ~ complexity(sK5,X1,X0)
| ~ greater(X0,sK2)
| ~ greater(sK3,X1)
| ~ organization(sK5,X0)
| ~ reorganization_free(sK5,sK2,X0) ),
inference(subsumption_resolution,[],[f60,f52]) ).
fof(f60,plain,
! [X0,X1] :
( ~ greater(X0,sK2)
| ~ reorganization_free(sK5,sK2,X0)
| ~ organization(sK5,sK2)
| ~ greater(sK3,X1)
| ~ complexity(sK5,X1,X0)
| ~ organization(sK5,X0) ),
inference(resolution,[],[f40,f48]) ).
fof(f48,plain,
complexity(sK5,sK3,sK2),
inference(cnf_transformation,[],[f36]) ).
fof(f40,plain,
! [X2,X3,X0,X1,X4] :
( ~ complexity(X1,X4,X3)
| ~ reorganization_free(X1,X3,X0)
| ~ complexity(X1,X2,X0)
| ~ greater(X0,X3)
| ~ organization(X1,X3)
| ~ organization(X1,X0)
| ~ greater(X4,X2) ),
inference(cnf_transformation,[],[f32]) ).
fof(f32,plain,
! [X0,X1,X2,X3,X4] :
( ~ organization(X1,X0)
| ~ organization(X1,X3)
| ~ greater(X0,X3)
| ~ complexity(X1,X2,X0)
| ~ complexity(X1,X4,X3)
| ~ greater(X4,X2)
| ~ reorganization_free(X1,X3,X0) ),
inference(rectify,[],[f31]) ).
fof(f31,plain,
! [X1,X3,X0,X2,X4] :
( ~ organization(X3,X1)
| ~ organization(X3,X2)
| ~ greater(X1,X2)
| ~ complexity(X3,X0,X1)
| ~ complexity(X3,X4,X2)
| ~ greater(X4,X0)
| ~ reorganization_free(X3,X2,X1) ),
inference(flattening,[],[f30]) ).
fof(f30,plain,
! [X0,X4,X3,X1,X2] :
( ~ greater(X4,X0)
| ~ organization(X3,X2)
| ~ complexity(X3,X0,X1)
| ~ complexity(X3,X4,X2)
| ~ greater(X1,X2)
| ~ reorganization_free(X3,X2,X1)
| ~ organization(X3,X1) ),
inference(ennf_transformation,[],[f12]) ).
fof(f12,plain,
! [X0,X4,X3,X1,X2] :
( ( organization(X3,X2)
& complexity(X3,X0,X1)
& complexity(X3,X4,X2)
& greater(X1,X2)
& reorganization_free(X3,X2,X1)
& organization(X3,X1) )
=> ~ greater(X4,X0) ),
inference(rectify,[],[f8]) ).
fof(f8,axiom,
! [X8,X4,X3,X0,X7] :
( ( greater(X4,X3)
& complexity(X0,X7,X3)
& complexity(X0,X8,X4)
& organization(X0,X3)
& organization(X0,X4)
& reorganization_free(X0,X3,X4) )
=> ~ greater(X7,X8) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t12_FOL) ).
fof(f102,plain,
( greater(sK6,sK2)
| sK6 = sK2 ),
inference(subsumption_resolution,[],[f100,f88]) ).
fof(f88,plain,
~ greater(sK2,sK6),
inference(subsumption_resolution,[],[f87,f45]) ).
fof(f87,plain,
( ~ greater(sK2,sK6)
| ~ greater(sK0,sK4) ),
inference(resolution,[],[f86,f47]) ).
fof(f86,plain,
! [X0] :
( ~ size(sK5,X0,sK2)
| ~ greater(sK0,X0)
| ~ greater(sK2,sK6) ),
inference(resolution,[],[f85,f46]) ).
fof(f85,plain,
! [X0,X1] :
( ~ size(sK5,X0,sK6)
| ~ greater(sK2,sK6)
| ~ size(sK5,X1,sK2)
| ~ greater(X0,X1) ),
inference(subsumption_resolution,[],[f84,f49]) ).
fof(f84,plain,
! [X0,X1] :
( ~ greater(sK2,sK6)
| ~ size(sK5,X1,sK2)
| ~ organization(sK5,sK6)
| ~ greater(X0,X1)
| ~ size(sK5,X0,sK6) ),
inference(subsumption_resolution,[],[f83,f52]) ).
fof(f83,plain,
! [X0,X1] :
( ~ size(sK5,X0,sK6)
| ~ organization(sK5,sK2)
| ~ greater(sK2,sK6)
| ~ organization(sK5,sK6)
| ~ size(sK5,X1,sK2)
| ~ greater(X0,X1) ),
inference(resolution,[],[f80,f55]) ).
fof(f55,plain,
! [X2,X3,X0,X1,X4] :
( ~ reorganization_free(X2,X0,X3)
| ~ organization(X2,X3)
| ~ size(X2,X4,X0)
| ~ greater(X4,X1)
| ~ organization(X2,X0)
| ~ size(X2,X1,X3)
| ~ greater(X3,X0) ),
inference(cnf_transformation,[],[f39]) ).
fof(f39,plain,
! [X0,X1,X2,X3,X4] :
( ~ greater(X4,X1)
| ~ size(X2,X1,X3)
| ~ greater(X3,X0)
| ~ organization(X2,X0)
| ~ size(X2,X4,X0)
| ~ reorganization_free(X2,X0,X3)
| ~ organization(X2,X3) ),
inference(rectify,[],[f19]) ).
fof(f19,plain,
! [X2,X3,X4,X1,X0] :
( ~ greater(X0,X3)
| ~ size(X4,X3,X1)
| ~ greater(X1,X2)
| ~ organization(X4,X2)
| ~ size(X4,X0,X2)
| ~ reorganization_free(X4,X2,X1)
| ~ organization(X4,X1) ),
inference(flattening,[],[f18]) ).
fof(f18,plain,
! [X0,X1,X2,X3,X4] :
( ~ greater(X0,X3)
| ~ organization(X4,X1)
| ~ greater(X1,X2)
| ~ size(X4,X0,X2)
| ~ size(X4,X3,X1)
| ~ organization(X4,X2)
| ~ reorganization_free(X4,X2,X1) ),
inference(ennf_transformation,[],[f13]) ).
fof(f13,plain,
! [X0,X1,X2,X3,X4] :
( ( organization(X4,X1)
& greater(X1,X2)
& size(X4,X0,X2)
& size(X4,X3,X1)
& organization(X4,X2)
& reorganization_free(X4,X2,X1) )
=> ~ greater(X0,X3) ),
inference(rectify,[],[f7]) ).
fof(f7,axiom,
! [X5,X4,X3,X6,X0] :
( ( size(X0,X6,X4)
& reorganization_free(X0,X3,X4)
& organization(X0,X3)
& organization(X0,X4)
& greater(X4,X3)
& size(X0,X5,X3) )
=> ~ greater(X5,X6) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t11_FOL) ).
fof(f80,plain,
reorganization_free(sK5,sK6,sK2),
inference(resolution,[],[f53,f51]) ).
fof(f53,plain,
! [X2,X0,X1] :
( ~ reorganization_free(X1,X0,X2)
| reorganization_free(X1,X2,X0) ),
inference(cnf_transformation,[],[f37]) ).
fof(f37,plain,
! [X0,X1,X2] :
( ~ reorganization_free(X1,X0,X2)
| reorganization_free(X1,X2,X0) ),
inference(rectify,[],[f20]) ).
fof(f20,plain,
! [X2,X0,X1] :
( ~ reorganization_free(X0,X2,X1)
| reorganization_free(X0,X1,X2) ),
inference(ennf_transformation,[],[f17]) ).
fof(f17,plain,
! [X2,X0,X1] :
( reorganization_free(X0,X2,X1)
=> reorganization_free(X0,X1,X2) ),
inference(rectify,[],[f5]) ).
fof(f5,axiom,
! [X0,X4,X3] :
( reorganization_free(X0,X3,X4)
=> reorganization_free(X0,X4,X3) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mp17) ).
fof(f100,plain,
( greater(sK2,sK6)
| greater(sK6,sK2)
| sK6 = sK2 ),
inference(resolution,[],[f97,f52]) ).
fof(f97,plain,
! [X0,X1] :
( ~ organization(X1,X0)
| sK6 = X0
| greater(sK6,X0)
| greater(X0,sK6) ),
inference(resolution,[],[f96,f49]) ).
fof(f96,plain,
! [X2,X3,X0,X1] :
( ~ organization(X3,X1)
| greater(X1,X0)
| X0 = X1
| greater(X0,X1)
| ~ organization(X2,X0) ),
inference(resolution,[],[f89,f41]) ).
fof(f41,plain,
! [X0,X1] :
( time(X0)
| ~ organization(X1,X0) ),
inference(cnf_transformation,[],[f29]) ).
fof(f29,plain,
! [X0,X1] :
( ~ organization(X1,X0)
| time(X0) ),
inference(ennf_transformation,[],[f14]) ).
fof(f14,plain,
! [X1,X0] :
( organization(X1,X0)
=> time(X0) ),
inference(rectify,[],[f3]) ).
fof(f3,axiom,
! [X2,X0] :
( organization(X0,X2)
=> time(X2) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mp15) ).
fof(f89,plain,
! [X2,X0,X1] :
( ~ time(X0)
| greater(X1,X0)
| X0 = X1
| greater(X0,X1)
| ~ organization(X2,X1) ),
inference(resolution,[],[f43,f41]) ).
fof(f43,plain,
! [X0,X1] :
( ~ time(X1)
| greater(X0,X1)
| ~ time(X0)
| X0 = X1
| greater(X1,X0) ),
inference(cnf_transformation,[],[f26]) ).
fof(f26,plain,
! [X0,X1] :
( greater(X1,X0)
| greater(X0,X1)
| X0 = X1
| ~ time(X0)
| ~ time(X1) ),
inference(flattening,[],[f25]) ).
fof(f25,plain,
! [X0,X1] :
( X0 = X1
| greater(X0,X1)
| greater(X1,X0)
| ~ time(X0)
| ~ time(X1) ),
inference(ennf_transformation,[],[f11]) ).
fof(f11,plain,
! [X0,X1] :
( ( time(X0)
& time(X1) )
=> ( X0 = X1
| greater(X0,X1)
| greater(X1,X0) ) ),
inference(rectify,[],[f4]) ).
fof(f4,axiom,
! [X3,X4] :
( ( time(X4)
& time(X3) )
=> ( greater(X4,X3)
| greater(X3,X4)
| X3 = X4 ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mp16) ).
fof(f46,plain,
size(sK5,sK0,sK6),
inference(cnf_transformation,[],[f36]) ).
fof(f45,plain,
greater(sK0,sK4),
inference(cnf_transformation,[],[f36]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.13 % Problem : MGT014+1 : TPTP v8.1.0. Released v2.0.0.
% 0.08/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.36 % Computer : n014.cluster.edu
% 0.14/0.36 % Model : x86_64 x86_64
% 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36 % Memory : 8042.1875MB
% 0.14/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36 % CPULimit : 300
% 0.14/0.36 % WCLimit : 300
% 0.14/0.36 % DateTime : Tue Aug 30 03:12:48 EDT 2022
% 0.14/0.36 % CPUTime :
% 0.23/0.49 % (12798)fmb+10_1:1_bce=on:i=59:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/59Mi)
% 0.23/0.51 Detected maximum model sizes of [7]
% 0.23/0.51 TRYING [1]
% 0.23/0.51 TRYING [2]
% 0.23/0.51 TRYING [3]
% 0.23/0.51 % (12803)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.23/0.52 % (12802)ott+3_1:1_gsp=on:lcm=predicate:i=138:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/138Mi)
% 0.23/0.52 % (12803)First to succeed.
% 0.23/0.52 TRYING [4]
% 0.23/0.52 % (12795)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.23/0.52 % (12790)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.23/0.52 % (12803)Refutation found. Thanks to Tanya!
% 0.23/0.52 % SZS status Theorem for theBenchmark
% 0.23/0.52 % SZS output start Proof for theBenchmark
% See solution above
% 0.23/0.52 % (12803)------------------------------
% 0.23/0.52 % (12803)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.23/0.52 % (12803)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.23/0.52 % (12803)Termination reason: Refutation
% 0.23/0.52
% 0.23/0.52 % (12803)Memory used [KB]: 1023
% 0.23/0.52 % (12803)Time elapsed: 0.120 s
% 0.23/0.52 % (12803)Instructions burned: 5 (million)
% 0.23/0.52 % (12803)------------------------------
% 0.23/0.52 % (12803)------------------------------
% 0.23/0.52 % (12780)Success in time 0.155 s
%------------------------------------------------------------------------------