TSTP Solution File: SET959+1 by SnakeForV---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV---1.0
% Problem : SET959+1 : TPTP v8.1.0. Bugfixed v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_uns --cores 0 -t %d %s
% Computer : n008.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:22:51 EDT 2022
% Result : Theorem 0.14s 0.49s
% Output : Refutation 0.14s
% Verified :
% SZS Type : Refutation
% Derivation depth : 24
% Number of leaves : 8
% Syntax : Number of formulae : 53 ( 11 unt; 0 def)
% Number of atoms : 181 ( 71 equ)
% Maximal formula atoms : 18 ( 3 avg)
% Number of connectives : 202 ( 74 ~; 70 |; 43 &)
% ( 6 <=>; 8 =>; 0 <=; 1 <~>)
% Maximal formula depth : 13 ( 5 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 2 con; 0-2 aty)
% Number of variables : 150 ( 108 !; 42 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f197,plain,
$false,
inference(unit_resulting_resolution,[],[f38,f191,f196,f44]) ).
fof(f44,plain,
! [X0,X1] :
( ~ in(sK8(X0,X1),X1)
| ~ in(sK8(X0,X1),X0)
| X0 = X1 ),
inference(cnf_transformation,[],[f32]) ).
fof(f32,plain,
! [X0,X1] :
( ( ( ~ in(sK8(X0,X1),X1)
| ~ in(sK8(X0,X1),X0) )
& ( in(sK8(X0,X1),X1)
| in(sK8(X0,X1),X0) ) )
| X0 = X1 ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK8])],[f30,f31]) ).
fof(f31,plain,
! [X0,X1] :
( ? [X2] :
( ( ~ in(X2,X1)
| ~ in(X2,X0) )
& ( in(X2,X1)
| in(X2,X0) ) )
=> ( ( ~ in(sK8(X0,X1),X1)
| ~ in(sK8(X0,X1),X0) )
& ( in(sK8(X0,X1),X1)
| in(sK8(X0,X1),X0) ) ) ),
introduced(choice_axiom,[]) ).
fof(f30,plain,
! [X0,X1] :
( ? [X2] :
( ( ~ in(X2,X1)
| ~ in(X2,X0) )
& ( in(X2,X1)
| in(X2,X0) ) )
| X0 = X1 ),
inference(rectify,[],[f29]) ).
fof(f29,plain,
! [X1,X0] :
( ? [X2] :
( ( ~ in(X2,X0)
| ~ in(X2,X1) )
& ( in(X2,X0)
| in(X2,X1) ) )
| X0 = X1 ),
inference(nnf_transformation,[],[f17]) ).
fof(f17,plain,
! [X1,X0] :
( ? [X2] :
( in(X2,X1)
<~> in(X2,X0) )
| X0 = X1 ),
inference(ennf_transformation,[],[f9]) ).
fof(f9,axiom,
! [X1,X0] :
( ! [X2] :
( in(X2,X1)
<=> in(X2,X0) )
=> X0 = X1 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t2_tarski) ).
fof(f196,plain,
in(sK8(sK1,sK2),sK2),
inference(subsumption_resolution,[],[f164,f191]) ).
fof(f164,plain,
( in(sK8(sK1,sK2),sK2)
| ~ in(sK8(sK1,sK2),sK1) ),
inference(superposition,[],[f59,f160]) ).
fof(f160,plain,
unordered_pair(singleton(sK3(sK8(sK1,sK2))),unordered_pair(sK3(sK8(sK1,sK2)),sK4(sK8(sK1,sK2)))) = sK8(sK1,sK2),
inference(subsumption_resolution,[],[f159,f38]) ).
fof(f159,plain,
( sK2 = sK1
| unordered_pair(singleton(sK3(sK8(sK1,sK2))),unordered_pair(sK3(sK8(sK1,sK2)),sK4(sK8(sK1,sK2)))) = sK8(sK1,sK2) ),
inference(duplicate_literal_removal,[],[f157]) ).
fof(f157,plain,
( sK2 = sK1
| unordered_pair(singleton(sK3(sK8(sK1,sK2))),unordered_pair(sK3(sK8(sK1,sK2)),sK4(sK8(sK1,sK2)))) = sK8(sK1,sK2)
| unordered_pair(singleton(sK3(sK8(sK1,sK2))),unordered_pair(sK3(sK8(sK1,sK2)),sK4(sK8(sK1,sK2)))) = sK8(sK1,sK2) ),
inference(resolution,[],[f134,f53]) ).
fof(f53,plain,
! [X0] :
( in(sK8(X0,sK2),X0)
| sK2 = X0
| unordered_pair(singleton(sK3(sK8(X0,sK2))),unordered_pair(sK3(sK8(X0,sK2)),sK4(sK8(X0,sK2)))) = sK8(X0,sK2) ),
inference(resolution,[],[f51,f43]) ).
fof(f43,plain,
! [X0,X1] :
( in(sK8(X0,X1),X1)
| in(sK8(X0,X1),X0)
| X0 = X1 ),
inference(cnf_transformation,[],[f32]) ).
fof(f51,plain,
! [X2] :
( ~ in(X2,sK2)
| unordered_pair(singleton(sK3(X2)),unordered_pair(sK3(X2),sK4(X2))) = X2 ),
inference(forward_demodulation,[],[f47,f45]) ).
fof(f45,plain,
! [X0,X1] : unordered_pair(X0,X1) = unordered_pair(X1,X0),
inference(cnf_transformation,[],[f13]) ).
fof(f13,plain,
! [X0,X1] : unordered_pair(X0,X1) = unordered_pair(X1,X0),
inference(rectify,[],[f2]) ).
fof(f2,axiom,
! [X1,X0] : unordered_pair(X0,X1) = unordered_pair(X1,X0),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',commutativity_k2_tarski) ).
fof(f47,plain,
! [X2] :
( ~ in(X2,sK2)
| unordered_pair(unordered_pair(sK3(X2),sK4(X2)),singleton(sK3(X2))) = X2 ),
inference(definition_unfolding,[],[f41,f33]) ).
fof(f33,plain,
! [X0,X1] : unordered_pair(unordered_pair(X1,X0),singleton(X1)) = ordered_pair(X1,X0),
inference(cnf_transformation,[],[f12]) ).
fof(f12,plain,
! [X0,X1] : unordered_pair(unordered_pair(X1,X0),singleton(X1)) = ordered_pair(X1,X0),
inference(rectify,[],[f3]) ).
fof(f3,axiom,
! [X1,X0] : ordered_pair(X0,X1) = unordered_pair(unordered_pair(X0,X1),singleton(X0)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d5_tarski) ).
fof(f41,plain,
! [X2] :
( ~ in(X2,sK2)
| ordered_pair(sK3(X2),sK4(X2)) = X2 ),
inference(cnf_transformation,[],[f26]) ).
fof(f26,plain,
( ! [X2] :
( ~ in(X2,sK2)
| ordered_pair(sK3(X2),sK4(X2)) = X2 )
& ! [X5,X6] :
( ( in(ordered_pair(X5,X6),sK2)
| ~ in(ordered_pair(X5,X6),sK1) )
& ( in(ordered_pair(X5,X6),sK1)
| ~ in(ordered_pair(X5,X6),sK2) ) )
& sK2 != sK1
& ! [X7] :
( ~ in(X7,sK1)
| ordered_pair(sK5(X7),sK6(X7)) = X7 ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK1,sK2,sK3,sK4,sK5,sK6])],[f22,f25,f24,f23]) ).
fof(f23,plain,
( ? [X0,X1] :
( ! [X2] :
( ~ in(X2,X1)
| ? [X3,X4] : ordered_pair(X3,X4) = X2 )
& ! [X5,X6] :
( ( in(ordered_pair(X5,X6),X1)
| ~ in(ordered_pair(X5,X6),X0) )
& ( in(ordered_pair(X5,X6),X0)
| ~ in(ordered_pair(X5,X6),X1) ) )
& X0 != X1
& ! [X7] :
( ~ in(X7,X0)
| ? [X8,X9] : ordered_pair(X8,X9) = X7 ) )
=> ( ! [X2] :
( ~ in(X2,sK2)
| ? [X3,X4] : ordered_pair(X3,X4) = X2 )
& ! [X6,X5] :
( ( in(ordered_pair(X5,X6),sK2)
| ~ in(ordered_pair(X5,X6),sK1) )
& ( in(ordered_pair(X5,X6),sK1)
| ~ in(ordered_pair(X5,X6),sK2) ) )
& sK2 != sK1
& ! [X7] :
( ~ in(X7,sK1)
| ? [X8,X9] : ordered_pair(X8,X9) = X7 ) ) ),
introduced(choice_axiom,[]) ).
fof(f24,plain,
! [X2] :
( ? [X3,X4] : ordered_pair(X3,X4) = X2
=> ordered_pair(sK3(X2),sK4(X2)) = X2 ),
introduced(choice_axiom,[]) ).
fof(f25,plain,
! [X7] :
( ? [X8,X9] : ordered_pair(X8,X9) = X7
=> ordered_pair(sK5(X7),sK6(X7)) = X7 ),
introduced(choice_axiom,[]) ).
fof(f22,plain,
? [X0,X1] :
( ! [X2] :
( ~ in(X2,X1)
| ? [X3,X4] : ordered_pair(X3,X4) = X2 )
& ! [X5,X6] :
( ( in(ordered_pair(X5,X6),X1)
| ~ in(ordered_pair(X5,X6),X0) )
& ( in(ordered_pair(X5,X6),X0)
| ~ in(ordered_pair(X5,X6),X1) ) )
& X0 != X1
& ! [X7] :
( ~ in(X7,X0)
| ? [X8,X9] : ordered_pair(X8,X9) = X7 ) ),
inference(rectify,[],[f21]) ).
fof(f21,plain,
? [X1,X0] :
( ! [X2] :
( ~ in(X2,X0)
| ? [X3,X4] : ordered_pair(X3,X4) = X2 )
& ! [X9,X8] :
( ( in(ordered_pair(X9,X8),X0)
| ~ in(ordered_pair(X9,X8),X1) )
& ( in(ordered_pair(X9,X8),X1)
| ~ in(ordered_pair(X9,X8),X0) ) )
& X0 != X1
& ! [X5] :
( ~ in(X5,X1)
| ? [X7,X6] : ordered_pair(X7,X6) = X5 ) ),
inference(nnf_transformation,[],[f16]) ).
fof(f16,plain,
? [X1,X0] :
( ! [X2] :
( ~ in(X2,X0)
| ? [X3,X4] : ordered_pair(X3,X4) = X2 )
& ! [X9,X8] :
( in(ordered_pair(X9,X8),X0)
<=> in(ordered_pair(X9,X8),X1) )
& X0 != X1
& ! [X5] :
( ~ in(X5,X1)
| ? [X7,X6] : ordered_pair(X7,X6) = X5 ) ),
inference(flattening,[],[f15]) ).
fof(f15,plain,
? [X0,X1] :
( X0 != X1
& ! [X5] :
( ~ in(X5,X1)
| ? [X7,X6] : ordered_pair(X7,X6) = X5 )
& ! [X9,X8] :
( in(ordered_pair(X9,X8),X0)
<=> in(ordered_pair(X9,X8),X1) )
& ! [X2] :
( ~ in(X2,X0)
| ? [X3,X4] : ordered_pair(X3,X4) = X2 ) ),
inference(ennf_transformation,[],[f11]) ).
fof(f11,plain,
~ ! [X0,X1] :
( ( ! [X5] :
~ ( ! [X6,X7] : ordered_pair(X7,X6) != X5
& in(X5,X1) )
& ! [X9,X8] :
( in(ordered_pair(X9,X8),X0)
<=> in(ordered_pair(X9,X8),X1) )
& ! [X2] :
~ ( ! [X4,X3] : ordered_pair(X3,X4) != X2
& in(X2,X0) ) )
=> X0 = X1 ),
inference(rectify,[],[f8]) ).
fof(f8,negated_conjecture,
~ ! [X1,X0] :
( ( ! [X2] :
~ ( ! [X4,X3] : ordered_pair(X3,X4) != X2
& in(X2,X1) )
& ! [X2] :
~ ( ! [X4,X3] : ordered_pair(X3,X4) != X2
& in(X2,X0) )
& ! [X3,X2] :
( in(ordered_pair(X2,X3),X1)
<=> in(ordered_pair(X2,X3),X0) ) )
=> X0 = X1 ),
inference(negated_conjecture,[],[f7]) ).
fof(f7,conjecture,
! [X1,X0] :
( ( ! [X2] :
~ ( ! [X4,X3] : ordered_pair(X3,X4) != X2
& in(X2,X1) )
& ! [X2] :
~ ( ! [X4,X3] : ordered_pair(X3,X4) != X2
& in(X2,X0) )
& ! [X3,X2] :
( in(ordered_pair(X2,X3),X1)
<=> in(ordered_pair(X2,X3),X0) ) )
=> X0 = X1 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t112_zfmisc_1) ).
fof(f134,plain,
( ~ in(sK8(sK1,sK2),sK1)
| unordered_pair(singleton(sK3(sK8(sK1,sK2))),unordered_pair(sK3(sK8(sK1,sK2)),sK4(sK8(sK1,sK2)))) = sK8(sK1,sK2) ),
inference(subsumption_resolution,[],[f118,f51]) ).
fof(f118,plain,
( in(sK8(sK1,sK2),sK2)
| unordered_pair(singleton(sK3(sK8(sK1,sK2))),unordered_pair(sK3(sK8(sK1,sK2)),sK4(sK8(sK1,sK2)))) = sK8(sK1,sK2)
| ~ in(sK8(sK1,sK2),sK1) ),
inference(superposition,[],[f59,f91]) ).
fof(f91,plain,
( sK8(sK1,sK2) = unordered_pair(singleton(sK5(sK8(sK1,sK2))),unordered_pair(sK5(sK8(sK1,sK2)),sK6(sK8(sK1,sK2))))
| unordered_pair(singleton(sK3(sK8(sK1,sK2))),unordered_pair(sK3(sK8(sK1,sK2)),sK4(sK8(sK1,sK2)))) = sK8(sK1,sK2) ),
inference(subsumption_resolution,[],[f88,f38]) ).
fof(f88,plain,
( sK2 = sK1
| sK8(sK1,sK2) = unordered_pair(singleton(sK5(sK8(sK1,sK2))),unordered_pair(sK5(sK8(sK1,sK2)),sK6(sK8(sK1,sK2))))
| unordered_pair(singleton(sK3(sK8(sK1,sK2))),unordered_pair(sK3(sK8(sK1,sK2)),sK4(sK8(sK1,sK2)))) = sK8(sK1,sK2) ),
inference(resolution,[],[f53,f52]) ).
fof(f52,plain,
! [X7] :
( ~ in(X7,sK1)
| unordered_pair(singleton(sK5(X7)),unordered_pair(sK5(X7),sK6(X7))) = X7 ),
inference(forward_demodulation,[],[f50,f45]) ).
fof(f50,plain,
! [X7] :
( ~ in(X7,sK1)
| unordered_pair(unordered_pair(sK5(X7),sK6(X7)),singleton(sK5(X7))) = X7 ),
inference(definition_unfolding,[],[f37,f33]) ).
fof(f37,plain,
! [X7] :
( ~ in(X7,sK1)
| ordered_pair(sK5(X7),sK6(X7)) = X7 ),
inference(cnf_transformation,[],[f26]) ).
fof(f59,plain,
! [X0,X1] :
( ~ in(unordered_pair(singleton(X0),unordered_pair(X0,X1)),sK1)
| in(unordered_pair(singleton(X0),unordered_pair(X0,X1)),sK2) ),
inference(superposition,[],[f48,f45]) ).
fof(f48,plain,
! [X6,X5] :
( ~ in(unordered_pair(unordered_pair(X5,X6),singleton(X5)),sK1)
| in(unordered_pair(unordered_pair(X5,X6),singleton(X5)),sK2) ),
inference(definition_unfolding,[],[f40,f33,f33]) ).
fof(f40,plain,
! [X6,X5] :
( in(ordered_pair(X5,X6),sK2)
| ~ in(ordered_pair(X5,X6),sK1) ),
inference(cnf_transformation,[],[f26]) ).
fof(f191,plain,
in(sK8(sK1,sK2),sK1),
inference(subsumption_resolution,[],[f190,f38]) ).
fof(f190,plain,
( sK2 = sK1
| in(sK8(sK1,sK2),sK1) ),
inference(duplicate_literal_removal,[],[f189]) ).
fof(f189,plain,
( in(sK8(sK1,sK2),sK1)
| in(sK8(sK1,sK2),sK1)
| sK2 = sK1 ),
inference(resolution,[],[f163,f43]) ).
fof(f163,plain,
( ~ in(sK8(sK1,sK2),sK2)
| in(sK8(sK1,sK2),sK1) ),
inference(superposition,[],[f63,f160]) ).
fof(f63,plain,
! [X0,X1] :
( ~ in(unordered_pair(singleton(X0),unordered_pair(X0,X1)),sK2)
| in(unordered_pair(singleton(X0),unordered_pair(X0,X1)),sK1) ),
inference(superposition,[],[f49,f45]) ).
fof(f49,plain,
! [X6,X5] :
( ~ in(unordered_pair(unordered_pair(X5,X6),singleton(X5)),sK2)
| in(unordered_pair(unordered_pair(X5,X6),singleton(X5)),sK1) ),
inference(definition_unfolding,[],[f39,f33,f33]) ).
fof(f39,plain,
! [X6,X5] :
( in(ordered_pair(X5,X6),sK1)
| ~ in(ordered_pair(X5,X6),sK2) ),
inference(cnf_transformation,[],[f26]) ).
fof(f38,plain,
sK2 != sK1,
inference(cnf_transformation,[],[f26]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.09 % Problem : SET959+1 : TPTP v8.1.0. Bugfixed v4.0.0.
% 0.04/0.10 % Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_uns --cores 0 -t %d %s
% 0.09/0.29 % Computer : n008.cluster.edu
% 0.09/0.29 % Model : x86_64 x86_64
% 0.09/0.29 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.29 % Memory : 8042.1875MB
% 0.09/0.29 % OS : Linux 3.10.0-693.el7.x86_64
% 0.09/0.29 % CPULimit : 300
% 0.09/0.29 % WCLimit : 300
% 0.09/0.29 % DateTime : Tue Aug 30 14:35:55 EDT 2022
% 0.09/0.30 % CPUTime :
% 0.14/0.45 % (25311)dis+21_1:1_av=off:sos=on:sp=frequency:ss=included:to=lpo:i=15:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/15Mi)
% 0.14/0.46 % (25328)dis+1010_2:3_fs=off:fsr=off:nm=0:nwc=5.0:s2a=on:s2agt=32:i=82:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/82Mi)
% 0.14/0.47 % (25329)dis+10_1:1_av=off:sos=on:sp=reverse_arity:ss=included:st=2.0:to=lpo:urr=ec_only:i=45:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/45Mi)
% 0.14/0.47 % (25321)lrs+10_1:1_drc=off:sp=reverse_frequency:spb=goal:to=lpo:i=7:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/7Mi)
% 0.14/0.47 % (25320)lrs+10_1:1_ins=3:sp=reverse_frequency:spb=goal:to=lpo:i=3:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/3Mi)
% 0.14/0.48 % (25313)lrs+2_1:1_lcm=reverse:lma=on:sos=all:spb=goal_then_units:ss=included:urr=on:i=39:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/39Mi)
% 0.14/0.48 % (25320)Instruction limit reached!
% 0.14/0.48 % (25320)------------------------------
% 0.14/0.48 % (25320)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.14/0.48 % (25311)Instruction limit reached!
% 0.14/0.48 % (25311)------------------------------
% 0.14/0.48 % (25311)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.14/0.48 % (25320)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.14/0.48 % (25320)Termination reason: Unknown
% 0.14/0.48 % (25320)Termination phase: Saturation
% 0.14/0.48
% 0.14/0.48 % (25320)Memory used [KB]: 6012
% 0.14/0.48 % (25320)Time elapsed: 0.122 s
% 0.14/0.48 % (25320)Instructions burned: 4 (million)
% 0.14/0.48 % (25320)------------------------------
% 0.14/0.48 % (25320)------------------------------
% 0.14/0.48 % (25321)Instruction limit reached!
% 0.14/0.48 % (25321)------------------------------
% 0.14/0.48 % (25321)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.14/0.48 % (25321)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.14/0.48 % (25311)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.14/0.48 % (25311)Termination reason: Unknown
% 0.14/0.48 % (25311)Termination phase: Saturation
% 0.14/0.48
% 0.14/0.48 % (25311)Memory used [KB]: 1535
% 0.14/0.48 % (25311)Time elapsed: 0.132 s
% 0.14/0.48 % (25311)Instructions burned: 15 (million)
% 0.14/0.48 % (25311)------------------------------
% 0.14/0.48 % (25311)------------------------------
% 0.14/0.49 % (25329)First to succeed.
% 0.14/0.49 % (25321)Termination reason: Unknown
% 0.14/0.49 % (25321)Termination phase: Saturation
% 0.14/0.49
% 0.14/0.49 % (25321)Memory used [KB]: 6012
% 0.14/0.49 % (25321)Time elapsed: 0.068 s
% 0.14/0.49 % (25321)Instructions burned: 7 (million)
% 0.14/0.49 % (25321)------------------------------
% 0.14/0.49 % (25321)------------------------------
% 0.14/0.49 % (25306)dis+1002_1:12_drc=off:fd=preordered:tgt=full:i=99978:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/99978Mi)
% 0.14/0.49 % (25309)lrs+10_5:1_br=off:fde=none:nwc=3.0:sd=1:sgt=10:sos=on:ss=axioms:urr=on:i=51:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/51Mi)
% 0.14/0.49 % (25329)Refutation found. Thanks to Tanya!
% 0.14/0.49 % SZS status Theorem for theBenchmark
% 0.14/0.49 % SZS output start Proof for theBenchmark
% See solution above
% 0.14/0.49 % (25329)------------------------------
% 0.14/0.49 % (25329)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.14/0.49 % (25329)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.14/0.49 % (25329)Termination reason: Refutation
% 0.14/0.49
% 0.14/0.49 % (25329)Memory used [KB]: 1663
% 0.14/0.49 % (25329)Time elapsed: 0.077 s
% 0.14/0.49 % (25329)Instructions burned: 13 (million)
% 0.14/0.49 % (25329)------------------------------
% 0.14/0.49 % (25329)------------------------------
% 0.14/0.49 % (25305)Success in time 0.19 s
%------------------------------------------------------------------------------