TSTP Solution File: SWC051+1 by SnakeForV---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV---1.0
% Problem : SWC051+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_uns --cores 0 -t %d %s
% Computer : n001.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:38:26 EDT 2022
% Result : Theorem 1.42s 0.54s
% Output : Refutation 1.42s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 9
% Syntax : Number of formulae : 38 ( 7 unt; 0 def)
% Number of atoms : 258 ( 54 equ)
% Maximal formula atoms : 32 ( 6 avg)
% Number of connectives : 335 ( 115 ~; 96 |; 108 &)
% ( 3 <=>; 13 =>; 0 <=; 0 <~>)
% Maximal formula depth : 19 ( 6 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 8 ( 6 usr; 4 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 5 con; 0-0 aty)
% Number of variables : 50 ( 24 !; 26 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f263,plain,
$false,
inference(avatar_sat_refutation,[],[f222,f245,f246,f262]) ).
fof(f262,plain,
( ~ spl9_1
| ~ spl9_7 ),
inference(avatar_contradiction_clause,[],[f261]) ).
fof(f261,plain,
( $false
| ~ spl9_1
| ~ spl9_7 ),
inference(subsumption_resolution,[],[f257,f153]) ).
fof(f153,plain,
ssList(sK2),
inference(cnf_transformation,[],[f137]) ).
fof(f137,plain,
( ssList(sK3)
& ssList(sK4)
& ssList(sK5)
& sK4 = sK2
& ( nil != sK5
| nil = sK4 )
& neq(sK3,nil)
& ! [X4] :
( ~ ssList(X4)
| ~ rearsegP(sK2,X4)
| ~ neq(X4,nil)
| ~ rearsegP(sK3,X4) )
& ( ( neq(sK4,nil)
& rearsegP(sK5,sK4) )
| ~ neq(sK5,nil) )
& sK3 = sK5
& ssList(sK2) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK2,sK3,sK4,sK5])],[f101,f136,f135,f134,f133]) ).
fof(f133,plain,
( ? [X0] :
( ? [X1] :
( ssList(X1)
& ? [X2] :
( ssList(X2)
& ? [X3] :
( ssList(X3)
& X0 = X2
& ( nil != X3
| nil = X2 )
& neq(X1,nil)
& ! [X4] :
( ~ ssList(X4)
| ~ rearsegP(X0,X4)
| ~ neq(X4,nil)
| ~ rearsegP(X1,X4) )
& ( ( neq(X2,nil)
& rearsegP(X3,X2) )
| ~ neq(X3,nil) )
& X1 = X3 ) ) )
& ssList(X0) )
=> ( ? [X1] :
( ssList(X1)
& ? [X2] :
( ssList(X2)
& ? [X3] :
( ssList(X3)
& sK2 = X2
& ( nil != X3
| nil = X2 )
& neq(X1,nil)
& ! [X4] :
( ~ ssList(X4)
| ~ rearsegP(sK2,X4)
| ~ neq(X4,nil)
| ~ rearsegP(X1,X4) )
& ( ( neq(X2,nil)
& rearsegP(X3,X2) )
| ~ neq(X3,nil) )
& X1 = X3 ) ) )
& ssList(sK2) ) ),
introduced(choice_axiom,[]) ).
fof(f134,plain,
( ? [X1] :
( ssList(X1)
& ? [X2] :
( ssList(X2)
& ? [X3] :
( ssList(X3)
& sK2 = X2
& ( nil != X3
| nil = X2 )
& neq(X1,nil)
& ! [X4] :
( ~ ssList(X4)
| ~ rearsegP(sK2,X4)
| ~ neq(X4,nil)
| ~ rearsegP(X1,X4) )
& ( ( neq(X2,nil)
& rearsegP(X3,X2) )
| ~ neq(X3,nil) )
& X1 = X3 ) ) )
=> ( ssList(sK3)
& ? [X2] :
( ssList(X2)
& ? [X3] :
( ssList(X3)
& sK2 = X2
& ( nil != X3
| nil = X2 )
& neq(sK3,nil)
& ! [X4] :
( ~ ssList(X4)
| ~ rearsegP(sK2,X4)
| ~ neq(X4,nil)
| ~ rearsegP(sK3,X4) )
& ( ( neq(X2,nil)
& rearsegP(X3,X2) )
| ~ neq(X3,nil) )
& sK3 = X3 ) ) ) ),
introduced(choice_axiom,[]) ).
fof(f135,plain,
( ? [X2] :
( ssList(X2)
& ? [X3] :
( ssList(X3)
& sK2 = X2
& ( nil != X3
| nil = X2 )
& neq(sK3,nil)
& ! [X4] :
( ~ ssList(X4)
| ~ rearsegP(sK2,X4)
| ~ neq(X4,nil)
| ~ rearsegP(sK3,X4) )
& ( ( neq(X2,nil)
& rearsegP(X3,X2) )
| ~ neq(X3,nil) )
& sK3 = X3 ) )
=> ( ssList(sK4)
& ? [X3] :
( ssList(X3)
& sK4 = sK2
& ( nil != X3
| nil = sK4 )
& neq(sK3,nil)
& ! [X4] :
( ~ ssList(X4)
| ~ rearsegP(sK2,X4)
| ~ neq(X4,nil)
| ~ rearsegP(sK3,X4) )
& ( ( neq(sK4,nil)
& rearsegP(X3,sK4) )
| ~ neq(X3,nil) )
& sK3 = X3 ) ) ),
introduced(choice_axiom,[]) ).
fof(f136,plain,
( ? [X3] :
( ssList(X3)
& sK4 = sK2
& ( nil != X3
| nil = sK4 )
& neq(sK3,nil)
& ! [X4] :
( ~ ssList(X4)
| ~ rearsegP(sK2,X4)
| ~ neq(X4,nil)
| ~ rearsegP(sK3,X4) )
& ( ( neq(sK4,nil)
& rearsegP(X3,sK4) )
| ~ neq(X3,nil) )
& sK3 = X3 )
=> ( ssList(sK5)
& sK4 = sK2
& ( nil != sK5
| nil = sK4 )
& neq(sK3,nil)
& ! [X4] :
( ~ ssList(X4)
| ~ rearsegP(sK2,X4)
| ~ neq(X4,nil)
| ~ rearsegP(sK3,X4) )
& ( ( neq(sK4,nil)
& rearsegP(sK5,sK4) )
| ~ neq(sK5,nil) )
& sK3 = sK5 ) ),
introduced(choice_axiom,[]) ).
fof(f101,plain,
? [X0] :
( ? [X1] :
( ssList(X1)
& ? [X2] :
( ssList(X2)
& ? [X3] :
( ssList(X3)
& X0 = X2
& ( nil != X3
| nil = X2 )
& neq(X1,nil)
& ! [X4] :
( ~ ssList(X4)
| ~ rearsegP(X0,X4)
| ~ neq(X4,nil)
| ~ rearsegP(X1,X4) )
& ( ( neq(X2,nil)
& rearsegP(X3,X2) )
| ~ neq(X3,nil) )
& X1 = X3 ) ) )
& ssList(X0) ),
inference(flattening,[],[f100]) ).
fof(f100,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ( neq(X2,nil)
& rearsegP(X3,X2) )
| ~ neq(X3,nil) )
& ( nil != X3
| nil = X2 )
& X1 = X3
& neq(X1,nil)
& ! [X4] :
( ~ ssList(X4)
| ~ rearsegP(X0,X4)
| ~ neq(X4,nil)
| ~ rearsegP(X1,X4) )
& 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)
=> ( ( ( ~ rearsegP(X3,X2)
| ~ neq(X2,nil) )
& neq(X3,nil) )
| ( nil = X3
& nil != X2 )
| X1 != X3
| ~ neq(X1,nil)
| ? [X4] :
( rearsegP(X0,X4)
& neq(X4,nil)
& ssList(X4)
& rearsegP(X1,X4) )
| X0 != X2 ) ) ) ) ),
inference(negated_conjecture,[],[f96]) ).
fof(f96,conjecture,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( ( ( ~ rearsegP(X3,X2)
| ~ neq(X2,nil) )
& neq(X3,nil) )
| ( nil = X3
& nil != X2 )
| X1 != X3
| ~ neq(X1,nil)
| ? [X4] :
( rearsegP(X0,X4)
& neq(X4,nil)
& ssList(X4)
& rearsegP(X1,X4) )
| X0 != X2 ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1) ).
fof(f257,plain,
( ~ ssList(sK2)
| ~ spl9_1
| ~ spl9_7 ),
inference(resolution,[],[f166,f255]) ).
fof(f255,plain,
( ~ rearsegP(sK2,sK2)
| ~ spl9_1
| ~ spl9_7 ),
inference(subsumption_resolution,[],[f254,f153]) ).
fof(f254,plain,
( ~ ssList(sK2)
| ~ rearsegP(sK2,sK2)
| ~ spl9_1
| ~ spl9_7 ),
inference(subsumption_resolution,[],[f253,f217]) ).
fof(f217,plain,
( neq(sK2,nil)
| ~ spl9_1 ),
inference(avatar_component_clause,[],[f215]) ).
fof(f215,plain,
( spl9_1
<=> neq(sK2,nil) ),
introduced(avatar_definition,[new_symbols(naming,[spl9_1])]) ).
fof(f253,plain,
( ~ neq(sK2,nil)
| ~ ssList(sK2)
| ~ rearsegP(sK2,sK2)
| ~ spl9_7 ),
inference(resolution,[],[f202,f244]) ).
fof(f244,plain,
( rearsegP(sK5,sK2)
| ~ spl9_7 ),
inference(avatar_component_clause,[],[f242]) ).
fof(f242,plain,
( spl9_7
<=> rearsegP(sK5,sK2) ),
introduced(avatar_definition,[new_symbols(naming,[spl9_7])]) ).
fof(f202,plain,
! [X4] :
( ~ rearsegP(sK5,X4)
| ~ neq(X4,nil)
| ~ rearsegP(sK2,X4)
| ~ ssList(X4) ),
inference(definition_unfolding,[],[f157,f154]) ).
fof(f154,plain,
sK3 = sK5,
inference(cnf_transformation,[],[f137]) ).
fof(f157,plain,
! [X4] :
( ~ ssList(X4)
| ~ rearsegP(sK2,X4)
| ~ neq(X4,nil)
| ~ rearsegP(sK3,X4) ),
inference(cnf_transformation,[],[f137]) ).
fof(f166,plain,
! [X0] :
( rearsegP(X0,X0)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f117]) ).
fof(f117,plain,
! [X0] :
( ~ ssList(X0)
| rearsegP(X0,X0) ),
inference(ennf_transformation,[],[f49]) ).
fof(f49,axiom,
! [X0] :
( ssList(X0)
=> rearsegP(X0,X0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax49) ).
fof(f246,plain,
spl9_2,
inference(avatar_split_clause,[],[f201,f219]) ).
fof(f219,plain,
( spl9_2
<=> neq(sK5,nil) ),
introduced(avatar_definition,[new_symbols(naming,[spl9_2])]) ).
fof(f201,plain,
neq(sK5,nil),
inference(definition_unfolding,[],[f158,f154]) ).
fof(f158,plain,
neq(sK3,nil),
inference(cnf_transformation,[],[f137]) ).
fof(f245,plain,
( spl9_7
| ~ spl9_2 ),
inference(avatar_split_clause,[],[f204,f219,f242]) ).
fof(f204,plain,
( ~ neq(sK5,nil)
| rearsegP(sK5,sK2) ),
inference(definition_unfolding,[],[f155,f160]) ).
fof(f160,plain,
sK4 = sK2,
inference(cnf_transformation,[],[f137]) ).
fof(f155,plain,
( rearsegP(sK5,sK4)
| ~ neq(sK5,nil) ),
inference(cnf_transformation,[],[f137]) ).
fof(f222,plain,
( spl9_1
| ~ spl9_2 ),
inference(avatar_split_clause,[],[f203,f219,f215]) ).
fof(f203,plain,
( ~ neq(sK5,nil)
| neq(sK2,nil) ),
inference(definition_unfolding,[],[f156,f160]) ).
fof(f156,plain,
( neq(sK4,nil)
| ~ neq(sK5,nil) ),
inference(cnf_transformation,[],[f137]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : SWC051+1 : TPTP v8.1.0. Released v2.4.0.
% 0.06/0.13 % Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_uns --cores 0 -t %d %s
% 0.12/0.33 % Computer : n001.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 300
% 0.12/0.33 % DateTime : Tue Aug 30 18:23:32 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.19/0.49 % (1856)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.19/0.50 % (1865)lrs+1011_1:1_fd=preordered:fsd=on:sos=on:thsq=on:thsqc=64:thsqd=32:uwa=ground:i=50:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/50Mi)
% 0.19/0.51 % (1873)dis+21_1:1_ep=RS:nwc=10.0:s2a=on:s2at=1.5:i=50:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/50Mi)
% 1.32/0.52 % (1855)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)
% 1.32/0.52 % (1855)First to succeed.
% 1.32/0.52 % (1875)lrs+1011_1:1_fd=preordered:fsd=on:sos=on:thsq=on:thsqc=64:thsqd=32:uwa=ground:i=99:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/99Mi)
% 1.32/0.52 % (1878)lrs-11_1:1_nm=0:sac=on:sd=4:ss=axioms:st=3.0:i=24:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/24Mi)
% 1.32/0.52 % (1867)ott+1010_1:1_sd=2:sos=on:sp=occurrence:ss=axioms:urr=on:i=2:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/2Mi)
% 1.32/0.52 % (1851)dis+1002_1:1_aac=none:bd=off:sac=on:sos=on:spb=units:i=3:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/3Mi)
% 1.32/0.52 % (1850)lrs+10_1:1_gsp=on:sd=1:sgt=32:sos=on:ss=axioms:i=13:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/13Mi)
% 1.32/0.52 % (1852)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)
% 1.32/0.52 % (1851)Instruction limit reached!
% 1.32/0.52 % (1851)------------------------------
% 1.32/0.52 % (1851)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 1.32/0.52 % (1851)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 1.32/0.52 % (1851)Termination reason: Unknown
% 1.32/0.52 % (1851)Termination phase: Preprocessing 3
% 1.32/0.52
% 1.32/0.52 % (1851)Memory used [KB]: 1663
% 1.32/0.52 % (1851)Time elapsed: 0.004 s
% 1.32/0.52 % (1851)Instructions burned: 5 (million)
% 1.32/0.52 % (1851)------------------------------
% 1.32/0.52 % (1851)------------------------------
% 1.32/0.53 % (1859)lrs+10_1:1_ep=R:lcm=predicate:lma=on:sos=all:spb=goal:ss=included:i=12:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/12Mi)
% 1.32/0.53 % (1857)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)
% 1.32/0.53 % (1867)Instruction limit reached!
% 1.32/0.53 % (1867)------------------------------
% 1.32/0.53 % (1867)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 1.42/0.53 % (1871)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)
% 1.42/0.53 % (1862)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)
% 1.42/0.53 % (1860)lrs+10_1:2_br=off:nm=4:ss=included:urr=on:i=7:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/7Mi)
% 1.42/0.53 % (1869)dis+1010_1:1_bs=on:ep=RS:erd=off:newcnf=on:nwc=10.0:s2a=on:sgt=32:ss=axioms:i=30:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/30Mi)
% 1.42/0.53 % (1863)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)
% 1.42/0.53 % (1868)dis-10_3:2_amm=sco:ep=RS:fsr=off:nm=10:sd=2:sos=on:ss=axioms:st=3.0:i=11:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/11Mi)
% 1.42/0.53 % (1853)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)
% 1.42/0.53 % (1876)dis+21_1:1_aac=none:abs=on:er=known:fde=none:fsr=off:nwc=5.0:s2a=on:s2at=4.0:sp=const_frequency:to=lpo:urr=ec_only:i=25:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/25Mi)
% 1.42/0.53 % (1863)Instruction limit reached!
% 1.42/0.53 % (1863)------------------------------
% 1.42/0.53 % (1863)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 1.42/0.53 % (1863)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 1.42/0.54 % (1863)Termination reason: Unknown
% 1.42/0.54 % (1863)Termination phase: Preprocessing 3
% 1.42/0.54
% 1.42/0.54 % (1863)Memory used [KB]: 1535
% 1.42/0.54 % (1863)Time elapsed: 0.005 s
% 1.42/0.54 % (1863)Instructions burned: 3 (million)
% 1.42/0.54 % (1863)------------------------------
% 1.42/0.54 % (1863)------------------------------
% 1.42/0.54 % (1870)ott+21_1:1_erd=off:s2a=on:sac=on:sd=1:sgt=64:sos=on:ss=included:st=3.0:to=lpo:urr=on:i=99:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/99Mi)
% 1.42/0.54 % (1854)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)
% 1.42/0.54 % (1867)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 1.42/0.54 % (1867)Termination reason: Unknown
% 1.42/0.54 % (1867)Termination phase: Preprocessing 1
% 1.42/0.54
% 1.42/0.54 % (1867)Memory used [KB]: 1407
% 1.42/0.54 % (1867)Time elapsed: 0.003 s
% 1.42/0.54 % (1867)Instructions burned: 2 (million)
% 1.42/0.54 % (1867)------------------------------
% 1.42/0.54 % (1867)------------------------------
% 1.42/0.54 % (1874)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)
% 1.42/0.54 % (1861)lrs+10_1:4_av=off:bs=unit_only:bsr=unit_only:ep=RS:s2a=on:sos=on:sp=frequency:to=lpo:i=16:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/16Mi)
% 1.42/0.54 % (1849)dis+1002_1:12_drc=off:fd=preordered:tgt=full:i=99978:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/99978Mi)
% 1.42/0.54 % (1860)Instruction limit reached!
% 1.42/0.54 % (1860)------------------------------
% 1.42/0.54 % (1860)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 1.42/0.54 % (1860)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 1.42/0.54 % (1860)Termination reason: Unknown
% 1.42/0.54 % (1860)Termination phase: Saturation
% 1.42/0.54
% 1.42/0.54 % (1860)Memory used [KB]: 6140
% 1.42/0.54 % (1860)Time elapsed: 0.138 s
% 1.42/0.54 % (1860)Instructions burned: 7 (million)
% 1.42/0.54 % (1860)------------------------------
% 1.42/0.54 % (1860)------------------------------
% 1.42/0.54 % (1855)Refutation found. Thanks to Tanya!
% 1.42/0.54 % SZS status Theorem for theBenchmark
% 1.42/0.54 % SZS output start Proof for theBenchmark
% See solution above
% 1.42/0.54 % (1855)------------------------------
% 1.42/0.54 % (1855)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 1.42/0.54 % (1855)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 1.42/0.54 % (1855)Termination reason: Refutation
% 1.42/0.54
% 1.42/0.54 % (1855)Memory used [KB]: 6012
% 1.42/0.54 % (1855)Time elapsed: 0.124 s
% 1.42/0.54 % (1855)Instructions burned: 4 (million)
% 1.42/0.54 % (1855)------------------------------
% 1.42/0.54 % (1855)------------------------------
% 1.42/0.54 % (1848)Success in time 0.192 s
%------------------------------------------------------------------------------