TSTP Solution File: SET598+3 by SnakeForV---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV---1.0
% Problem : SET598+3 : TPTP v8.1.0. Released v2.2.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 : n013.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:21:33 EDT 2022
% Result : Theorem 0.21s 0.53s
% Output : Refutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 14
% Syntax : Number of formulae : 84 ( 8 unt; 0 def)
% Number of atoms : 314 ( 44 equ)
% Maximal formula atoms : 24 ( 3 avg)
% Number of connectives : 379 ( 149 ~; 154 |; 55 &)
% ( 12 <=>; 7 =>; 0 <=; 2 <~>)
% Maximal formula depth : 13 ( 5 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 10 ( 8 usr; 8 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 4 con; 0-2 aty)
% Number of variables : 93 ( 69 !; 24 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f182,plain,
$false,
inference(avatar_sat_refutation,[],[f53,f63,f69,f75,f80,f82,f140,f153,f178,f179,f181]) ).
fof(f181,plain,
( ~ spl4_1
| spl4_2 ),
inference(avatar_contradiction_clause,[],[f180]) ).
fof(f180,plain,
( $false
| ~ spl4_1
| spl4_2 ),
inference(subsumption_resolution,[],[f173,f51]) ).
fof(f51,plain,
( ~ subset(sK1,sK0)
| spl4_2 ),
inference(avatar_component_clause,[],[f50]) ).
fof(f50,plain,
( spl4_2
<=> subset(sK1,sK0) ),
introduced(avatar_definition,[new_symbols(naming,[spl4_2])]) ).
fof(f173,plain,
( subset(sK1,sK0)
| ~ spl4_1 ),
inference(superposition,[],[f32,f48]) ).
fof(f48,plain,
( intersection(sK0,sK2) = sK1
| ~ spl4_1 ),
inference(avatar_component_clause,[],[f46]) ).
fof(f46,plain,
( spl4_1
<=> intersection(sK0,sK2) = sK1 ),
introduced(avatar_definition,[new_symbols(naming,[spl4_1])]) ).
fof(f32,plain,
! [X0,X1] : subset(intersection(X0,X1),X0),
inference(cnf_transformation,[],[f1]) ).
fof(f1,axiom,
! [X0,X1] : subset(intersection(X0,X1),X0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',intersection_is_subset) ).
fof(f179,plain,
( spl4_3
| ~ spl4_1 ),
inference(avatar_split_clause,[],[f175,f46,f56]) ).
fof(f56,plain,
( spl4_3
<=> subset(sK1,sK2) ),
introduced(avatar_definition,[new_symbols(naming,[spl4_3])]) ).
fof(f175,plain,
( subset(sK1,sK2)
| ~ spl4_1 ),
inference(superposition,[],[f95,f48]) ).
fof(f95,plain,
! [X0,X1] : subset(intersection(X1,X0),X0),
inference(superposition,[],[f32,f41]) ).
fof(f41,plain,
! [X0,X1] : intersection(X0,X1) = intersection(X1,X0),
inference(cnf_transformation,[],[f28]) ).
fof(f28,plain,
! [X0,X1] : intersection(X0,X1) = intersection(X1,X0),
inference(rectify,[],[f13]) ).
fof(f13,plain,
! [X1,X0] : intersection(X0,X1) = intersection(X1,X0),
inference(rectify,[],[f6]) ).
fof(f6,axiom,
! [X1,X0] : intersection(X0,X1) = intersection(X1,X0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',commutativity_of_intersection) ).
fof(f178,plain,
( spl4_7
| ~ spl4_1 ),
inference(avatar_split_clause,[],[f174,f46,f78]) ).
fof(f78,plain,
( spl4_7
<=> ! [X4] :
( subset(X4,sK1)
| ~ subset(X4,sK0)
| ~ subset(X4,sK2) ) ),
introduced(avatar_definition,[new_symbols(naming,[spl4_7])]) ).
fof(f174,plain,
( ! [X0] :
( ~ subset(X0,sK2)
| subset(X0,sK1)
| ~ subset(X0,sK0) )
| ~ spl4_1 ),
inference(superposition,[],[f33,f48]) ).
fof(f33,plain,
! [X2,X0,X1] :
( subset(X1,intersection(X0,X2))
| ~ subset(X1,X2)
| ~ subset(X1,X0) ),
inference(cnf_transformation,[],[f21]) ).
fof(f21,plain,
! [X0,X1,X2] :
( ~ subset(X1,X2)
| subset(X1,intersection(X0,X2))
| ~ subset(X1,X0) ),
inference(rectify,[],[f18]) ).
fof(f18,plain,
! [X1,X2,X0] :
( ~ subset(X2,X0)
| subset(X2,intersection(X1,X0))
| ~ subset(X2,X1) ),
inference(flattening,[],[f17]) ).
fof(f17,plain,
! [X2,X0,X1] :
( subset(X2,intersection(X1,X0))
| ~ subset(X2,X1)
| ~ subset(X2,X0) ),
inference(ennf_transformation,[],[f14]) ).
fof(f14,plain,
! [X2,X0,X1] :
( ( subset(X2,X1)
& subset(X2,X0) )
=> subset(X2,intersection(X1,X0)) ),
inference(rectify,[],[f2]) ).
fof(f2,axiom,
! [X2,X1,X0] :
( ( subset(X0,X2)
& subset(X0,X1) )
=> subset(X0,intersection(X1,X2)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',intersection_of_subsets) ).
fof(f153,plain,
( spl4_4
| ~ spl4_5
| ~ spl4_6
| ~ spl4_7 ),
inference(avatar_contradiction_clause,[],[f152]) ).
fof(f152,plain,
( $false
| spl4_4
| ~ spl4_5
| ~ spl4_6
| ~ spl4_7 ),
inference(subsumption_resolution,[],[f151,f74]) ).
fof(f74,plain,
( subset(sK3,sK0)
| ~ spl4_6 ),
inference(avatar_component_clause,[],[f72]) ).
fof(f72,plain,
( spl4_6
<=> subset(sK3,sK0) ),
introduced(avatar_definition,[new_symbols(naming,[spl4_6])]) ).
fof(f151,plain,
( ~ subset(sK3,sK0)
| spl4_4
| ~ spl4_5
| ~ spl4_7 ),
inference(subsumption_resolution,[],[f149,f62]) ).
fof(f62,plain,
( ~ subset(sK3,sK1)
| spl4_4 ),
inference(avatar_component_clause,[],[f60]) ).
fof(f60,plain,
( spl4_4
<=> subset(sK3,sK1) ),
introduced(avatar_definition,[new_symbols(naming,[spl4_4])]) ).
fof(f149,plain,
( subset(sK3,sK1)
| ~ subset(sK3,sK0)
| ~ spl4_5
| ~ spl4_7 ),
inference(resolution,[],[f68,f79]) ).
fof(f79,plain,
( ! [X4] :
( ~ subset(X4,sK2)
| ~ subset(X4,sK0)
| subset(X4,sK1) )
| ~ spl4_7 ),
inference(avatar_component_clause,[],[f78]) ).
fof(f68,plain,
( subset(sK3,sK2)
| ~ spl4_5 ),
inference(avatar_component_clause,[],[f66]) ).
fof(f66,plain,
( spl4_5
<=> subset(sK3,sK2) ),
introduced(avatar_definition,[new_symbols(naming,[spl4_5])]) ).
fof(f140,plain,
( spl4_1
| ~ spl4_2
| ~ spl4_3
| ~ spl4_7 ),
inference(avatar_contradiction_clause,[],[f139]) ).
fof(f139,plain,
( $false
| spl4_1
| ~ spl4_2
| ~ spl4_3
| ~ spl4_7 ),
inference(subsumption_resolution,[],[f138,f57]) ).
fof(f57,plain,
( subset(sK1,sK2)
| ~ spl4_3 ),
inference(avatar_component_clause,[],[f56]) ).
fof(f138,plain,
( ~ subset(sK1,sK2)
| spl4_1
| ~ spl4_2
| ~ spl4_7 ),
inference(subsumption_resolution,[],[f135,f52]) ).
fof(f52,plain,
( subset(sK1,sK0)
| ~ spl4_2 ),
inference(avatar_component_clause,[],[f50]) ).
fof(f135,plain,
( ~ subset(sK1,sK0)
| ~ subset(sK1,sK2)
| spl4_1
| ~ spl4_7 ),
inference(resolution,[],[f33,f127]) ).
fof(f127,plain,
( ~ subset(sK1,intersection(sK0,sK2))
| spl4_1
| ~ spl4_7 ),
inference(subsumption_resolution,[],[f111,f47]) ).
fof(f47,plain,
( intersection(sK0,sK2) != sK1
| spl4_1 ),
inference(avatar_component_clause,[],[f46]) ).
fof(f111,plain,
( ~ subset(sK1,intersection(sK0,sK2))
| intersection(sK0,sK2) = sK1
| ~ spl4_7 ),
inference(resolution,[],[f31,f99]) ).
fof(f99,plain,
( subset(intersection(sK0,sK2),sK1)
| ~ spl4_7 ),
inference(resolution,[],[f98,f32]) ).
fof(f98,plain,
( ! [X2] :
( ~ subset(intersection(X2,sK2),sK0)
| subset(intersection(X2,sK2),sK1) )
| ~ spl4_7 ),
inference(superposition,[],[f94,f41]) ).
fof(f94,plain,
( ! [X0] :
( ~ subset(intersection(sK2,X0),sK0)
| subset(intersection(sK2,X0),sK1) )
| ~ spl4_7 ),
inference(resolution,[],[f32,f79]) ).
fof(f31,plain,
! [X0,X1] :
( ~ subset(X1,X0)
| ~ subset(X0,X1)
| X0 = X1 ),
inference(cnf_transformation,[],[f20]) ).
fof(f20,plain,
! [X0,X1] :
( ( X0 = X1
| ~ subset(X1,X0)
| ~ subset(X0,X1) )
& ( ( subset(X1,X0)
& subset(X0,X1) )
| X0 != X1 ) ),
inference(flattening,[],[f19]) ).
fof(f19,plain,
! [X0,X1] :
( ( X0 = X1
| ~ subset(X1,X0)
| ~ subset(X0,X1) )
& ( ( subset(X1,X0)
& subset(X0,X1) )
| X0 != X1 ) ),
inference(nnf_transformation,[],[f12]) ).
fof(f12,plain,
! [X0,X1] :
( X0 = X1
<=> ( subset(X1,X0)
& subset(X0,X1) ) ),
inference(rectify,[],[f5]) ).
fof(f5,axiom,
! [X1,X0] :
( ( subset(X0,X1)
& subset(X1,X0) )
<=> X0 = X1 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',equal_defn) ).
fof(f82,plain,
( spl4_1
| spl4_3 ),
inference(avatar_split_clause,[],[f81,f56,f46]) ).
fof(f81,plain,
( subset(sK1,sK2)
| intersection(sK0,sK2) = sK1 ),
inference(forward_demodulation,[],[f36,f41]) ).
fof(f36,plain,
( subset(sK1,sK2)
| sK1 = intersection(sK2,sK0) ),
inference(cnf_transformation,[],[f27]) ).
fof(f27,plain,
( ( sK1 != intersection(sK2,sK0)
| ~ subset(sK1,sK0)
| ~ subset(sK1,sK2)
| ( subset(sK3,sK0)
& subset(sK3,sK2)
& ~ subset(sK3,sK1) ) )
& ( sK1 = intersection(sK2,sK0)
| ( subset(sK1,sK0)
& subset(sK1,sK2)
& ! [X4] :
( ~ subset(X4,sK0)
| ~ subset(X4,sK2)
| subset(X4,sK1) ) ) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3])],[f24,f26,f25]) ).
fof(f25,plain,
( ? [X0,X1,X2] :
( ( intersection(X2,X0) != X1
| ~ subset(X1,X0)
| ~ subset(X1,X2)
| ? [X3] :
( subset(X3,X0)
& subset(X3,X2)
& ~ subset(X3,X1) ) )
& ( intersection(X2,X0) = X1
| ( subset(X1,X0)
& subset(X1,X2)
& ! [X4] :
( ~ subset(X4,X0)
| ~ subset(X4,X2)
| subset(X4,X1) ) ) ) )
=> ( ( sK1 != intersection(sK2,sK0)
| ~ subset(sK1,sK0)
| ~ subset(sK1,sK2)
| ? [X3] :
( subset(X3,sK0)
& subset(X3,sK2)
& ~ subset(X3,sK1) ) )
& ( sK1 = intersection(sK2,sK0)
| ( subset(sK1,sK0)
& subset(sK1,sK2)
& ! [X4] :
( ~ subset(X4,sK0)
| ~ subset(X4,sK2)
| subset(X4,sK1) ) ) ) ) ),
introduced(choice_axiom,[]) ).
fof(f26,plain,
( ? [X3] :
( subset(X3,sK0)
& subset(X3,sK2)
& ~ subset(X3,sK1) )
=> ( subset(sK3,sK0)
& subset(sK3,sK2)
& ~ subset(sK3,sK1) ) ),
introduced(choice_axiom,[]) ).
fof(f24,plain,
? [X0,X1,X2] :
( ( intersection(X2,X0) != X1
| ~ subset(X1,X0)
| ~ subset(X1,X2)
| ? [X3] :
( subset(X3,X0)
& subset(X3,X2)
& ~ subset(X3,X1) ) )
& ( intersection(X2,X0) = X1
| ( subset(X1,X0)
& subset(X1,X2)
& ! [X4] :
( ~ subset(X4,X0)
| ~ subset(X4,X2)
| subset(X4,X1) ) ) ) ),
inference(rectify,[],[f23]) ).
fof(f23,plain,
? [X1,X0,X2] :
( ( intersection(X2,X1) != X0
| ~ subset(X0,X1)
| ~ subset(X0,X2)
| ? [X3] :
( subset(X3,X1)
& subset(X3,X2)
& ~ subset(X3,X0) ) )
& ( intersection(X2,X1) = X0
| ( subset(X0,X1)
& subset(X0,X2)
& ! [X3] :
( ~ subset(X3,X1)
| ~ subset(X3,X2)
| subset(X3,X0) ) ) ) ),
inference(flattening,[],[f22]) ).
fof(f22,plain,
? [X1,X0,X2] :
( ( intersection(X2,X1) != X0
| ~ subset(X0,X1)
| ~ subset(X0,X2)
| ? [X3] :
( subset(X3,X1)
& subset(X3,X2)
& ~ subset(X3,X0) ) )
& ( intersection(X2,X1) = X0
| ( subset(X0,X1)
& subset(X0,X2)
& ! [X3] :
( ~ subset(X3,X1)
| ~ subset(X3,X2)
| subset(X3,X0) ) ) ) ),
inference(nnf_transformation,[],[f16]) ).
fof(f16,plain,
? [X1,X0,X2] :
( ( subset(X0,X1)
& subset(X0,X2)
& ! [X3] :
( ~ subset(X3,X1)
| ~ subset(X3,X2)
| subset(X3,X0) ) )
<~> intersection(X2,X1) = X0 ),
inference(flattening,[],[f15]) ).
fof(f15,plain,
? [X0,X2,X1] :
( intersection(X2,X1) = X0
<~> ( subset(X0,X2)
& subset(X0,X1)
& ! [X3] :
( subset(X3,X0)
| ~ subset(X3,X2)
| ~ subset(X3,X1) ) ) ),
inference(ennf_transformation,[],[f11]) ).
fof(f11,plain,
~ ! [X0,X2,X1] :
( intersection(X2,X1) = X0
<=> ( subset(X0,X2)
& subset(X0,X1)
& ! [X3] :
( ( subset(X3,X2)
& subset(X3,X1) )
=> subset(X3,X0) ) ) ),
inference(rectify,[],[f10]) ).
fof(f10,negated_conjecture,
~ ! [X0,X2,X1] :
( ( subset(X0,X2)
& subset(X0,X1)
& ! [X3] :
( ( subset(X3,X1)
& subset(X3,X2) )
=> subset(X3,X0) ) )
<=> intersection(X1,X2) = X0 ),
inference(negated_conjecture,[],[f9]) ).
fof(f9,conjecture,
! [X0,X2,X1] :
( ( subset(X0,X2)
& subset(X0,X1)
& ! [X3] :
( ( subset(X3,X1)
& subset(X3,X2) )
=> subset(X3,X0) ) )
<=> intersection(X1,X2) = X0 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_th57) ).
fof(f80,plain,
( spl4_7
| spl4_1 ),
inference(avatar_split_clause,[],[f76,f46,f78]) ).
fof(f76,plain,
! [X4] :
( intersection(sK0,sK2) = sK1
| subset(X4,sK1)
| ~ subset(X4,sK2)
| ~ subset(X4,sK0) ),
inference(forward_demodulation,[],[f35,f41]) ).
fof(f35,plain,
! [X4] :
( ~ subset(X4,sK2)
| sK1 = intersection(sK2,sK0)
| ~ subset(X4,sK0)
| subset(X4,sK1) ),
inference(cnf_transformation,[],[f27]) ).
fof(f75,plain,
( ~ spl4_2
| ~ spl4_3
| ~ spl4_1
| spl4_6 ),
inference(avatar_split_clause,[],[f70,f72,f46,f56,f50]) ).
fof(f70,plain,
( subset(sK3,sK0)
| intersection(sK0,sK2) != sK1
| ~ subset(sK1,sK2)
| ~ subset(sK1,sK0) ),
inference(forward_demodulation,[],[f40,f41]) ).
fof(f40,plain,
( sK1 != intersection(sK2,sK0)
| ~ subset(sK1,sK2)
| subset(sK3,sK0)
| ~ subset(sK1,sK0) ),
inference(cnf_transformation,[],[f27]) ).
fof(f69,plain,
( spl4_5
| ~ spl4_2
| ~ spl4_3
| ~ spl4_1 ),
inference(avatar_split_clause,[],[f64,f46,f56,f50,f66]) ).
fof(f64,plain,
( intersection(sK0,sK2) != sK1
| ~ subset(sK1,sK2)
| ~ subset(sK1,sK0)
| subset(sK3,sK2) ),
inference(forward_demodulation,[],[f39,f41]) ).
fof(f39,plain,
( sK1 != intersection(sK2,sK0)
| ~ subset(sK1,sK0)
| subset(sK3,sK2)
| ~ subset(sK1,sK2) ),
inference(cnf_transformation,[],[f27]) ).
fof(f63,plain,
( ~ spl4_3
| ~ spl4_4
| ~ spl4_1
| ~ spl4_2 ),
inference(avatar_split_clause,[],[f54,f50,f46,f60,f56]) ).
fof(f54,plain,
( ~ subset(sK1,sK0)
| intersection(sK0,sK2) != sK1
| ~ subset(sK3,sK1)
| ~ subset(sK1,sK2) ),
inference(forward_demodulation,[],[f38,f41]) ).
fof(f38,plain,
( ~ subset(sK1,sK0)
| ~ subset(sK3,sK1)
| ~ subset(sK1,sK2)
| sK1 != intersection(sK2,sK0) ),
inference(cnf_transformation,[],[f27]) ).
fof(f53,plain,
( spl4_1
| spl4_2 ),
inference(avatar_split_clause,[],[f44,f50,f46]) ).
fof(f44,plain,
( subset(sK1,sK0)
| intersection(sK0,sK2) = sK1 ),
inference(forward_demodulation,[],[f37,f41]) ).
fof(f37,plain,
( sK1 = intersection(sK2,sK0)
| subset(sK1,sK0) ),
inference(cnf_transformation,[],[f27]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.13 % Problem : SET598+3 : TPTP v8.1.0. Released v2.2.0.
% 0.08/0.14 % Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_uns --cores 0 -t %d %s
% 0.15/0.35 % Computer : n013.cluster.edu
% 0.15/0.35 % Model : x86_64 x86_64
% 0.15/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.35 % Memory : 8042.1875MB
% 0.15/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.35 % CPULimit : 300
% 0.15/0.35 % WCLimit : 300
% 0.15/0.35 % DateTime : Tue Aug 30 14:00:02 EDT 2022
% 0.15/0.35 % CPUTime :
% 0.21/0.51 % (29467)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.21/0.52 % (29468)lrs+10_1:1024_nm=0:nwc=5.0:ss=axioms:i=13:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/13Mi)
% 0.21/0.52 % (29486)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.21/0.52 % (29478)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.21/0.52 % (29477)lrs+10_1:32_br=off:nm=16:sd=2:ss=axioms:st=2.0:urr=on:i=51:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/51Mi)
% 0.21/0.52 % (29472)dis+10_1:1_newcnf=on:sgt=8:sos=on:ss=axioms:to=lpo:urr=on:i=49:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/49Mi)
% 0.21/0.53 % (29478)Instruction limit reached!
% 0.21/0.53 % (29478)------------------------------
% 0.21/0.53 % (29478)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.21/0.53 % (29478)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.21/0.53 % (29478)Termination reason: Unknown
% 0.21/0.53 % (29478)Termination phase: Saturation
% 0.21/0.53
% 0.21/0.53 % (29478)Memory used [KB]: 6012
% 0.21/0.53 % (29478)Time elapsed: 0.005 s
% 0.21/0.53 % (29478)Instructions burned: 3 (million)
% 0.21/0.53 % (29478)------------------------------
% 0.21/0.53 % (29478)------------------------------
% 0.21/0.53 % (29468)First to succeed.
% 0.21/0.53 % (29489)lrs+11_1:1_plsq=on:plsqc=1:plsqr=32,1:ss=included:i=95:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/95Mi)
% 0.21/0.53 % (29470)dis+1010_1:50_awrs=decay:awrsf=128:nwc=10.0:s2pl=no:sp=frequency:ss=axioms:i=39:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/39Mi)
% 0.21/0.53 % (29468)Refutation found. Thanks to Tanya!
% 0.21/0.53 % SZS status Theorem for theBenchmark
% 0.21/0.53 % SZS output start Proof for theBenchmark
% See solution above
% 0.21/0.53 % (29468)------------------------------
% 0.21/0.53 % (29468)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.21/0.53 % (29468)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.21/0.53 % (29468)Termination reason: Refutation
% 0.21/0.53
% 0.21/0.53 % (29468)Memory used [KB]: 6012
% 0.21/0.53 % (29468)Time elapsed: 0.121 s
% 0.21/0.53 % (29468)Instructions burned: 4 (million)
% 0.21/0.53 % (29468)------------------------------
% 0.21/0.53 % (29468)------------------------------
% 0.21/0.53 % (29463)Success in time 0.171 s
%------------------------------------------------------------------------------