TSTP Solution File: SWC046+1 by Vampire-SAT---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire-SAT---4.8
% Problem : SWC046+1 : TPTP v8.2.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : vampire --mode casc_sat -m 16384 --cores 7 -t %d %s
% Computer : n029.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 : Tue May 21 04:41:03 EDT 2024
% Result : Theorem 0.20s 0.41s
% Output : Refutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 20
% Number of leaves : 11
% Syntax : Number of formulae : 52 ( 10 unt; 0 def)
% Number of atoms : 364 ( 98 equ)
% Maximal formula atoms : 34 ( 7 avg)
% Number of connectives : 458 ( 146 ~; 139 |; 144 &)
% ( 2 <=>; 27 =>; 0 <=; 0 <~>)
% Maximal formula depth : 19 ( 7 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 5 con; 0-2 aty)
% Number of variables : 124 ( 73 !; 51 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1173,plain,
$false,
inference(trivial_inequality_removal,[],[f1172]) ).
fof(f1172,plain,
nil != nil,
inference(superposition,[],[f383,f1134]) ).
fof(f1134,plain,
nil = sK18,
inference(backward_demodulation,[],[f382,f1132]) ).
fof(f1132,plain,
nil = sK20,
inference(resolution,[],[f1131,f378]) ).
fof(f378,plain,
ssList(sK20),
inference(cnf_transformation,[],[f256]) ).
fof(f256,plain,
( ! [X4] :
( ( ( ( ! [X5] :
( ~ segmentP(sK21,app(app(cons(X4,nil),X5),cons(X4,nil)))
| ~ ssList(X5) )
& memberP(sK21,X4) )
| ~ memberP(sK20,X4) )
& ( ~ memberP(sK21,X4)
| ( segmentP(sK21,app(app(cons(X4,nil),sK22(X4)),cons(X4,nil)))
& ssList(sK22(X4)) )
| memberP(sK20,X4) ) )
| ~ ssItem(X4) )
& nil != sK18
& sK18 = sK20
& sK19 = sK21
& nil = sK19
& ssList(sK21)
& ssList(sK20)
& ssList(sK19)
& ssList(sK18) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK18,sK19,sK20,sK21,sK22])],[f100,f255,f254,f253,f252,f251]) ).
fof(f251,plain,
( ? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ! [X4] :
( ( ( ( ! [X5] :
( ~ segmentP(X3,app(app(cons(X4,nil),X5),cons(X4,nil)))
| ~ ssList(X5) )
& memberP(X3,X4) )
| ~ memberP(X2,X4) )
& ( ~ memberP(X3,X4)
| ? [X6] :
( segmentP(X3,app(app(cons(X4,nil),X6),cons(X4,nil)))
& ssList(X6) )
| memberP(X2,X4) ) )
| ~ ssItem(X4) )
& nil != X0
& X0 = X2
& X1 = X3
& nil = X1
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) )
=> ( ? [X1] :
( ? [X2] :
( ? [X3] :
( ! [X4] :
( ( ( ( ! [X5] :
( ~ segmentP(X3,app(app(cons(X4,nil),X5),cons(X4,nil)))
| ~ ssList(X5) )
& memberP(X3,X4) )
| ~ memberP(X2,X4) )
& ( ~ memberP(X3,X4)
| ? [X6] :
( segmentP(X3,app(app(cons(X4,nil),X6),cons(X4,nil)))
& ssList(X6) )
| memberP(X2,X4) ) )
| ~ ssItem(X4) )
& nil != sK18
& sK18 = X2
& X1 = X3
& nil = X1
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(sK18) ) ),
introduced(choice_axiom,[]) ).
fof(f252,plain,
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ! [X4] :
( ( ( ( ! [X5] :
( ~ segmentP(X3,app(app(cons(X4,nil),X5),cons(X4,nil)))
| ~ ssList(X5) )
& memberP(X3,X4) )
| ~ memberP(X2,X4) )
& ( ~ memberP(X3,X4)
| ? [X6] :
( segmentP(X3,app(app(cons(X4,nil),X6),cons(X4,nil)))
& ssList(X6) )
| memberP(X2,X4) ) )
| ~ ssItem(X4) )
& nil != sK18
& sK18 = X2
& X1 = X3
& nil = X1
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
=> ( ? [X2] :
( ? [X3] :
( ! [X4] :
( ( ( ( ! [X5] :
( ~ segmentP(X3,app(app(cons(X4,nil),X5),cons(X4,nil)))
| ~ ssList(X5) )
& memberP(X3,X4) )
| ~ memberP(X2,X4) )
& ( ~ memberP(X3,X4)
| ? [X6] :
( segmentP(X3,app(app(cons(X4,nil),X6),cons(X4,nil)))
& ssList(X6) )
| memberP(X2,X4) ) )
| ~ ssItem(X4) )
& nil != sK18
& sK18 = X2
& sK19 = X3
& nil = sK19
& ssList(X3) )
& ssList(X2) )
& ssList(sK19) ) ),
introduced(choice_axiom,[]) ).
fof(f253,plain,
( ? [X2] :
( ? [X3] :
( ! [X4] :
( ( ( ( ! [X5] :
( ~ segmentP(X3,app(app(cons(X4,nil),X5),cons(X4,nil)))
| ~ ssList(X5) )
& memberP(X3,X4) )
| ~ memberP(X2,X4) )
& ( ~ memberP(X3,X4)
| ? [X6] :
( segmentP(X3,app(app(cons(X4,nil),X6),cons(X4,nil)))
& ssList(X6) )
| memberP(X2,X4) ) )
| ~ ssItem(X4) )
& nil != sK18
& sK18 = X2
& sK19 = X3
& nil = sK19
& ssList(X3) )
& ssList(X2) )
=> ( ? [X3] :
( ! [X4] :
( ( ( ( ! [X5] :
( ~ segmentP(X3,app(app(cons(X4,nil),X5),cons(X4,nil)))
| ~ ssList(X5) )
& memberP(X3,X4) )
| ~ memberP(sK20,X4) )
& ( ~ memberP(X3,X4)
| ? [X6] :
( segmentP(X3,app(app(cons(X4,nil),X6),cons(X4,nil)))
& ssList(X6) )
| memberP(sK20,X4) ) )
| ~ ssItem(X4) )
& nil != sK18
& sK18 = sK20
& sK19 = X3
& nil = sK19
& ssList(X3) )
& ssList(sK20) ) ),
introduced(choice_axiom,[]) ).
fof(f254,plain,
( ? [X3] :
( ! [X4] :
( ( ( ( ! [X5] :
( ~ segmentP(X3,app(app(cons(X4,nil),X5),cons(X4,nil)))
| ~ ssList(X5) )
& memberP(X3,X4) )
| ~ memberP(sK20,X4) )
& ( ~ memberP(X3,X4)
| ? [X6] :
( segmentP(X3,app(app(cons(X4,nil),X6),cons(X4,nil)))
& ssList(X6) )
| memberP(sK20,X4) ) )
| ~ ssItem(X4) )
& nil != sK18
& sK18 = sK20
& sK19 = X3
& nil = sK19
& ssList(X3) )
=> ( ! [X4] :
( ( ( ( ! [X5] :
( ~ segmentP(sK21,app(app(cons(X4,nil),X5),cons(X4,nil)))
| ~ ssList(X5) )
& memberP(sK21,X4) )
| ~ memberP(sK20,X4) )
& ( ~ memberP(sK21,X4)
| ? [X6] :
( segmentP(sK21,app(app(cons(X4,nil),X6),cons(X4,nil)))
& ssList(X6) )
| memberP(sK20,X4) ) )
| ~ ssItem(X4) )
& nil != sK18
& sK18 = sK20
& sK19 = sK21
& nil = sK19
& ssList(sK21) ) ),
introduced(choice_axiom,[]) ).
fof(f255,plain,
! [X4] :
( ? [X6] :
( segmentP(sK21,app(app(cons(X4,nil),X6),cons(X4,nil)))
& ssList(X6) )
=> ( segmentP(sK21,app(app(cons(X4,nil),sK22(X4)),cons(X4,nil)))
& ssList(sK22(X4)) ) ),
introduced(choice_axiom,[]) ).
fof(f100,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ! [X4] :
( ( ( ( ! [X5] :
( ~ segmentP(X3,app(app(cons(X4,nil),X5),cons(X4,nil)))
| ~ ssList(X5) )
& memberP(X3,X4) )
| ~ memberP(X2,X4) )
& ( ~ memberP(X3,X4)
| ? [X6] :
( segmentP(X3,app(app(cons(X4,nil),X6),cons(X4,nil)))
& ssList(X6) )
| memberP(X2,X4) ) )
| ~ ssItem(X4) )
& nil != X0
& X0 = X2
& X1 = X3
& nil = X1
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(flattening,[],[f99]) ).
fof(f99,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ! [X4] :
( ( ( ( ! [X5] :
( ~ segmentP(X3,app(app(cons(X4,nil),X5),cons(X4,nil)))
| ~ ssList(X5) )
& memberP(X3,X4) )
| ~ memberP(X2,X4) )
& ( ~ memberP(X3,X4)
| ? [X6] :
( segmentP(X3,app(app(cons(X4,nil),X6),cons(X4,nil)))
& ssList(X6) )
| memberP(X2,X4) ) )
| ~ ssItem(X4) )
& nil != X0
& X0 = X2
& X1 = X3
& nil = X1
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(ennf_transformation,[],[f98]) ).
fof(f98,plain,
~ ! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( ? [X4] :
( ( ( ( ? [X5] :
( segmentP(X3,app(app(cons(X4,nil),X5),cons(X4,nil)))
& ssList(X5) )
| ~ memberP(X3,X4) )
& memberP(X2,X4) )
| ( memberP(X3,X4)
& ! [X6] :
( ssList(X6)
=> ~ segmentP(X3,app(app(cons(X4,nil),X6),cons(X4,nil))) )
& ~ memberP(X2,X4) ) )
& ssItem(X4) )
| nil = X0
| X0 != X2
| X1 != X3
| nil != X1 ) ) ) ) ),
inference(rectify,[],[f97]) ).
fof(f97,negated_conjecture,
~ ! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( ? [X4] :
( ( ( ( ? [X5] :
( segmentP(X3,app(app(cons(X4,nil),X5),cons(X4,nil)))
& ssList(X5) )
| ~ memberP(X3,X4) )
& memberP(X2,X4) )
| ( memberP(X3,X4)
& ! [X5] :
( ssList(X5)
=> ~ segmentP(X3,app(app(cons(X4,nil),X5),cons(X4,nil))) )
& ~ memberP(X2,X4) ) )
& ssItem(X4) )
| nil = X0
| X0 != X2
| X1 != X3
| nil != X1 ) ) ) ) ),
inference(negated_conjecture,[],[f96]) ).
fof(f96,conjecture,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( ? [X4] :
( ( ( ( ? [X5] :
( segmentP(X3,app(app(cons(X4,nil),X5),cons(X4,nil)))
& ssList(X5) )
| ~ memberP(X3,X4) )
& memberP(X2,X4) )
| ( memberP(X3,X4)
& ! [X5] :
( ssList(X5)
=> ~ segmentP(X3,app(app(cons(X4,nil),X5),cons(X4,nil))) )
& ~ memberP(X2,X4) ) )
& ssItem(X4) )
| nil = X0
| X0 != X2
| X1 != X3
| nil != X1 ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1) ).
fof(f1131,plain,
( ~ ssList(sK20)
| nil = sK20 ),
inference(duplicate_literal_removal,[],[f1130]) ).
fof(f1130,plain,
( nil = sK20
| ~ ssList(sK20)
| nil = sK20
| ~ ssList(sK20) ),
inference(resolution,[],[f1129,f460]) ).
fof(f460,plain,
! [X0] :
( ssList(sK23(X0))
| nil = X0
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f278]) ).
fof(f278,plain,
! [X0] :
( ( cons(sK24(X0),sK23(X0)) = X0
& ssItem(sK24(X0))
& ssList(sK23(X0)) )
| nil = X0
| ~ ssList(X0) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK23,sK24])],[f150,f277,f276]) ).
fof(f276,plain,
! [X0] :
( ? [X1] :
( ? [X2] :
( cons(X2,X1) = X0
& ssItem(X2) )
& ssList(X1) )
=> ( ? [X2] :
( cons(X2,sK23(X0)) = X0
& ssItem(X2) )
& ssList(sK23(X0)) ) ),
introduced(choice_axiom,[]) ).
fof(f277,plain,
! [X0] :
( ? [X2] :
( cons(X2,sK23(X0)) = X0
& ssItem(X2) )
=> ( cons(sK24(X0),sK23(X0)) = X0
& ssItem(sK24(X0)) ) ),
introduced(choice_axiom,[]) ).
fof(f150,plain,
! [X0] :
( ? [X1] :
( ? [X2] :
( cons(X2,X1) = X0
& ssItem(X2) )
& ssList(X1) )
| nil = X0
| ~ ssList(X0) ),
inference(flattening,[],[f149]) ).
fof(f149,plain,
! [X0] :
( ? [X1] :
( ? [X2] :
( cons(X2,X1) = X0
& ssItem(X2) )
& ssList(X1) )
| nil = X0
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f20]) ).
fof(f20,axiom,
! [X0] :
( ssList(X0)
=> ( ? [X1] :
( ? [X2] :
( cons(X2,X1) = X0
& ssItem(X2) )
& ssList(X1) )
| nil = X0 ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax20) ).
fof(f1129,plain,
( ~ ssList(sK23(sK20))
| nil = sK20
| ~ ssList(sK20) ),
inference(duplicate_literal_removal,[],[f1128]) ).
fof(f1128,plain,
( ~ ssList(sK23(sK20))
| nil = sK20
| nil = sK20
| ~ ssList(sK20) ),
inference(resolution,[],[f1127,f461]) ).
fof(f461,plain,
! [X0] :
( ssItem(sK24(X0))
| nil = X0
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f278]) ).
fof(f1127,plain,
( ~ ssItem(sK24(sK20))
| ~ ssList(sK23(sK20))
| nil = sK20 ),
inference(duplicate_literal_removal,[],[f1126]) ).
fof(f1126,plain,
( ~ ssList(sK23(sK20))
| ~ ssItem(sK24(sK20))
| nil = sK20
| ~ ssItem(sK24(sK20)) ),
inference(resolution,[],[f1121,f650]) ).
fof(f650,plain,
! [X0] :
( ~ memberP(sK20,X0)
| ~ ssItem(X0) ),
inference(duplicate_literal_removal,[],[f649]) ).
fof(f649,plain,
! [X0] :
( ~ ssItem(X0)
| ~ memberP(sK20,X0)
| ~ ssItem(X0) ),
inference(resolution,[],[f397,f641]) ).
fof(f641,plain,
! [X4] :
( memberP(nil,X4)
| ~ memberP(sK20,X4)
| ~ ssItem(X4) ),
inference(forward_demodulation,[],[f386,f639]) ).
fof(f639,plain,
nil = sK21,
inference(backward_demodulation,[],[f381,f380]) ).
fof(f380,plain,
nil = sK19,
inference(cnf_transformation,[],[f256]) ).
fof(f381,plain,
sK19 = sK21,
inference(cnf_transformation,[],[f256]) ).
fof(f386,plain,
! [X4] :
( memberP(sK21,X4)
| ~ memberP(sK20,X4)
| ~ ssItem(X4) ),
inference(cnf_transformation,[],[f256]) ).
fof(f397,plain,
! [X0] :
( ~ memberP(nil,X0)
| ~ ssItem(X0) ),
inference(cnf_transformation,[],[f101]) ).
fof(f101,plain,
! [X0] :
( ~ memberP(nil,X0)
| ~ ssItem(X0) ),
inference(ennf_transformation,[],[f38]) ).
fof(f38,axiom,
! [X0] :
( ssItem(X0)
=> ~ memberP(nil,X0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax38) ).
fof(f1121,plain,
( memberP(sK20,sK24(sK20))
| ~ ssList(sK23(sK20))
| ~ ssItem(sK24(sK20))
| nil = sK20 ),
inference(superposition,[],[f636,f1090]) ).
fof(f1090,plain,
( sK20 = cons(sK24(sK20),sK23(sK20))
| nil = sK20 ),
inference(resolution,[],[f462,f378]) ).
fof(f462,plain,
! [X0] :
( ~ ssList(X0)
| nil = X0
| cons(sK24(X0),sK23(X0)) = X0 ),
inference(cnf_transformation,[],[f278]) ).
fof(f636,plain,
! [X2,X1] :
( memberP(cons(X1,X2),X1)
| ~ ssList(X2)
| ~ ssItem(X1) ),
inference(duplicate_literal_removal,[],[f607]) ).
fof(f607,plain,
! [X2,X1] :
( memberP(cons(X1,X2),X1)
| ~ ssList(X2)
| ~ ssItem(X1)
| ~ ssItem(X1) ),
inference(equality_resolution,[],[f428]) ).
fof(f428,plain,
! [X2,X0,X1] :
( memberP(cons(X1,X2),X0)
| X0 != X1
| ~ ssList(X2)
| ~ ssItem(X1)
| ~ ssItem(X0) ),
inference(cnf_transformation,[],[f263]) ).
fof(f263,plain,
! [X0] :
( ! [X1] :
( ! [X2] :
( ( ( memberP(cons(X1,X2),X0)
| ( ~ memberP(X2,X0)
& X0 != X1 ) )
& ( memberP(X2,X0)
| X0 = X1
| ~ memberP(cons(X1,X2),X0) ) )
| ~ ssList(X2) )
| ~ ssItem(X1) )
| ~ ssItem(X0) ),
inference(flattening,[],[f262]) ).
fof(f262,plain,
! [X0] :
( ! [X1] :
( ! [X2] :
( ( ( memberP(cons(X1,X2),X0)
| ( ~ memberP(X2,X0)
& X0 != X1 ) )
& ( memberP(X2,X0)
| X0 = X1
| ~ memberP(cons(X1,X2),X0) ) )
| ~ ssList(X2) )
| ~ ssItem(X1) )
| ~ ssItem(X0) ),
inference(nnf_transformation,[],[f136]) ).
fof(f136,plain,
! [X0] :
( ! [X1] :
( ! [X2] :
( ( memberP(cons(X1,X2),X0)
<=> ( memberP(X2,X0)
| X0 = X1 ) )
| ~ ssList(X2) )
| ~ ssItem(X1) )
| ~ ssItem(X0) ),
inference(ennf_transformation,[],[f37]) ).
fof(f37,axiom,
! [X0] :
( ssItem(X0)
=> ! [X1] :
( ssItem(X1)
=> ! [X2] :
( ssList(X2)
=> ( memberP(cons(X1,X2),X0)
<=> ( memberP(X2,X0)
| X0 = X1 ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax37) ).
fof(f382,plain,
sK18 = sK20,
inference(cnf_transformation,[],[f256]) ).
fof(f383,plain,
nil != sK18,
inference(cnf_transformation,[],[f256]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SWC046+1 : TPTP v8.2.0. Released v2.4.0.
% 0.07/0.14 % Command : vampire --mode casc_sat -m 16384 --cores 7 -t %d %s
% 0.14/0.35 % Computer : n029.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Sun May 19 02:50:53 EDT 2024
% 0.14/0.35 % CPUTime :
% 0.14/0.35 % (28044)Running in auto input_syntax mode. Trying TPTP
% 0.14/0.37 % (28047)WARNING: value z3 for option sas not known
% 0.14/0.37 % (28048)fmb+10_1_bce=on:fmbsr=1.5:nm=32_533 on theBenchmark for (533ds/0Mi)
% 0.14/0.37 % (28046)fmb+10_1_bce=on:fmbdsb=on:fmbes=contour:fmbswr=3:fde=none:nm=0_793 on theBenchmark for (793ds/0Mi)
% 0.14/0.37 % (28045)fmb+10_1_bce=on:fmbas=function:fmbsr=1.2:fde=unused:nm=0_846 on theBenchmark for (846ds/0Mi)
% 0.14/0.37 % (28047)dis+2_11_add=large:afr=on:amm=off:bd=off:bce=on:fsd=off:fde=none:gs=on:gsaa=full_model:gsem=off:irw=on:msp=off:nm=4:nwc=1.3:sas=z3:sims=off:sac=on:sp=reverse_arity_569 on theBenchmark for (569ds/0Mi)
% 0.14/0.37 % (28050)ott-10_8_av=off:bd=preordered:bs=on:fsd=off:fsr=off:fde=unused:irw=on:lcm=predicate:lma=on:nm=4:nwc=1.7:sp=frequency_522 on theBenchmark for (522ds/0Mi)
% 0.14/0.37 % (28049)ott+10_10:1_add=off:afr=on:amm=off:anc=all:bd=off:bs=on:fsr=off:irw=on:lma=on:msp=off:nm=4:nwc=4.0:sac=on:sp=reverse_frequency_531 on theBenchmark for (531ds/0Mi)
% 0.14/0.37 % (28051)ott+1_64_av=off:bd=off:bce=on:fsd=off:fde=unused:gsp=on:irw=on:lcm=predicate:lma=on:nm=2:nwc=1.1:sims=off:urr=on_497 on theBenchmark for (497ds/0Mi)
% 0.20/0.39 TRYING [1]
% 0.20/0.39 TRYING [1]
% 0.20/0.39 TRYING [2]
% 0.20/0.39 TRYING [2]
% 0.20/0.40 TRYING [3]
% 0.20/0.40 % (28050)First to succeed.
% 0.20/0.40 TRYING [3]
% 0.20/0.40 % (28050)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-28044"
% 0.20/0.41 % (28050)Refutation found. Thanks to Tanya!
% 0.20/0.41 % SZS status Theorem for theBenchmark
% 0.20/0.41 % SZS output start Proof for theBenchmark
% See solution above
% 0.20/0.41 % (28050)------------------------------
% 0.20/0.41 % (28050)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.20/0.41 % (28050)Termination reason: Refutation
% 0.20/0.41
% 0.20/0.41 % (28050)Memory used [KB]: 1767
% 0.20/0.41 % (28050)Time elapsed: 0.034 s
% 0.20/0.41 % (28050)Instructions burned: 57 (million)
% 0.20/0.41 % (28044)Success in time 0.053 s
%------------------------------------------------------------------------------