TSTP Solution File: PUZ129+2 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : PUZ129+2 : TPTP v8.1.2. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% Computer : n017.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 May 1 03:39:04 EDT 2024
% Result : Theorem 0.61s 0.79s
% Output : Refutation 0.61s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 9
% Syntax : Number of formulae : 43 ( 18 unt; 0 def)
% Number of atoms : 331 ( 96 equ)
% Maximal formula atoms : 36 ( 7 avg)
% Number of connectives : 406 ( 118 ~; 89 |; 158 &)
% ( 0 <=>; 41 =>; 0 <=; 0 <~>)
% Maximal formula depth : 17 ( 5 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-3 aty)
% Number of functors : 14 ( 14 usr; 8 con; 0-1 aty)
% Number of variables : 159 ( 95 !; 64 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f56,plain,
$false,
inference(subsumption_resolution,[],[f55,f45]) ).
fof(f45,plain,
~ property1(sK1,healthy,pos),
inference(unit_resulting_resolution,[],[f34,f37]) ).
fof(f37,plain,
! [X17] :
( ~ property1(X17,healthy,pos)
| ~ grocer(X17) ),
inference(equality_resolution,[],[f18]) ).
fof(f18,plain,
! [X16,X17] :
( X16 != X17
| ~ property1(X17,healthy,pos)
| ~ grocer(X16) ),
inference(cnf_transformation,[],[f15]) ).
fof(f15,plain,
( sK0 = sK1
& cyclist(sK1)
& grocer(sK0)
& ! [X2] :
( ( sK2(X2) = X2
& person(sK2(X2)) )
| ~ cyclist(X2) )
& ! [X4] :
( ( sK3(X4) = X4
& person(sK3(X4)) )
| ~ grocer(X4) )
& ! [X6] :
( ! [X7] :
( X6 != X7
| ~ property1(X7,dishonest,pos) )
| ~ property1(X6,honest,pos)
| ~ person(X6) )
& ! [X8] :
( ! [X9] :
( X8 != X9
| ~ property1(X9,unhealthy,pos) )
| ~ property1(X8,healthy,pos)
| ~ person(X8) )
& ! [X10] :
( ( sK4(X10) = X10
& property1(sK4(X10),dishonest,pos) )
| ~ property1(X10,unhealthy,pos)
| ~ cyclist(X10) )
& ! [X12] :
( ( sK5(X12) = X12
& property1(sK5(X12),industrious,pos) )
| ~ cyclist(X12) )
& ! [X14] :
( ( sK6(X14) = X14
& property1(sK6(X14),honest,pos) )
| ~ property1(X14,industrious,pos)
| ~ grocer(X14) )
& ! [X16] :
( ! [X17] :
( X16 != X17
| ~ property1(X17,healthy,pos) )
| ~ grocer(X16) )
& ! [X18] :
( ( sK7(X18) = X18
& property1(sK7(X18),healthy,pos) )
| ~ property1(X18,industrious,pos)
| ~ property1(X18,honest,pos)
| ~ person(X18) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3,sK4,sK5,sK6,sK7])],[f6,f14,f13,f12,f11,f10,f9,f8,f7]) ).
fof(f7,plain,
( ? [X0] :
( ? [X1] :
( X0 = X1
& cyclist(X1) )
& grocer(X0) )
=> ( ? [X1] :
( sK0 = X1
& cyclist(X1) )
& grocer(sK0) ) ),
introduced(choice_axiom,[]) ).
fof(f8,plain,
( ? [X1] :
( sK0 = X1
& cyclist(X1) )
=> ( sK0 = sK1
& cyclist(sK1) ) ),
introduced(choice_axiom,[]) ).
fof(f9,plain,
! [X2] :
( ? [X3] :
( X2 = X3
& person(X3) )
=> ( sK2(X2) = X2
& person(sK2(X2)) ) ),
introduced(choice_axiom,[]) ).
fof(f10,plain,
! [X4] :
( ? [X5] :
( X4 = X5
& person(X5) )
=> ( sK3(X4) = X4
& person(sK3(X4)) ) ),
introduced(choice_axiom,[]) ).
fof(f11,plain,
! [X10] :
( ? [X11] :
( X10 = X11
& property1(X11,dishonest,pos) )
=> ( sK4(X10) = X10
& property1(sK4(X10),dishonest,pos) ) ),
introduced(choice_axiom,[]) ).
fof(f12,plain,
! [X12] :
( ? [X13] :
( X12 = X13
& property1(X13,industrious,pos) )
=> ( sK5(X12) = X12
& property1(sK5(X12),industrious,pos) ) ),
introduced(choice_axiom,[]) ).
fof(f13,plain,
! [X14] :
( ? [X15] :
( X14 = X15
& property1(X15,honest,pos) )
=> ( sK6(X14) = X14
& property1(sK6(X14),honest,pos) ) ),
introduced(choice_axiom,[]) ).
fof(f14,plain,
! [X18] :
( ? [X19] :
( X18 = X19
& property1(X19,healthy,pos) )
=> ( sK7(X18) = X18
& property1(sK7(X18),healthy,pos) ) ),
introduced(choice_axiom,[]) ).
fof(f6,plain,
( ? [X0] :
( ? [X1] :
( X0 = X1
& cyclist(X1) )
& grocer(X0) )
& ! [X2] :
( ? [X3] :
( X2 = X3
& person(X3) )
| ~ cyclist(X2) )
& ! [X4] :
( ? [X5] :
( X4 = X5
& person(X5) )
| ~ grocer(X4) )
& ! [X6] :
( ! [X7] :
( X6 != X7
| ~ property1(X7,dishonest,pos) )
| ~ property1(X6,honest,pos)
| ~ person(X6) )
& ! [X8] :
( ! [X9] :
( X8 != X9
| ~ property1(X9,unhealthy,pos) )
| ~ property1(X8,healthy,pos)
| ~ person(X8) )
& ! [X10] :
( ? [X11] :
( X10 = X11
& property1(X11,dishonest,pos) )
| ~ property1(X10,unhealthy,pos)
| ~ cyclist(X10) )
& ! [X12] :
( ? [X13] :
( X12 = X13
& property1(X13,industrious,pos) )
| ~ cyclist(X12) )
& ! [X14] :
( ? [X15] :
( X14 = X15
& property1(X15,honest,pos) )
| ~ property1(X14,industrious,pos)
| ~ grocer(X14) )
& ! [X16] :
( ! [X17] :
( X16 != X17
| ~ property1(X17,healthy,pos) )
| ~ grocer(X16) )
& ! [X18] :
( ? [X19] :
( X18 = X19
& property1(X19,healthy,pos) )
| ~ property1(X18,industrious,pos)
| ~ property1(X18,honest,pos)
| ~ person(X18) ) ),
inference(rectify,[],[f5]) ).
fof(f5,plain,
( ? [X18] :
( ? [X19] :
( X18 = X19
& cyclist(X19) )
& grocer(X18) )
& ! [X0] :
( ? [X1] :
( X0 = X1
& person(X1) )
| ~ cyclist(X0) )
& ! [X2] :
( ? [X3] :
( X2 = X3
& person(X3) )
| ~ grocer(X2) )
& ! [X4] :
( ! [X5] :
( X4 != X5
| ~ property1(X5,dishonest,pos) )
| ~ property1(X4,honest,pos)
| ~ person(X4) )
& ! [X6] :
( ! [X7] :
( X6 != X7
| ~ property1(X7,unhealthy,pos) )
| ~ property1(X6,healthy,pos)
| ~ person(X6) )
& ! [X8] :
( ? [X9] :
( X8 = X9
& property1(X9,dishonest,pos) )
| ~ property1(X8,unhealthy,pos)
| ~ cyclist(X8) )
& ! [X10] :
( ? [X11] :
( X10 = X11
& property1(X11,industrious,pos) )
| ~ cyclist(X10) )
& ! [X12] :
( ? [X13] :
( X12 = X13
& property1(X13,honest,pos) )
| ~ property1(X12,industrious,pos)
| ~ grocer(X12) )
& ! [X14] :
( ! [X15] :
( X14 != X15
| ~ property1(X15,healthy,pos) )
| ~ grocer(X14) )
& ! [X16] :
( ? [X17] :
( X16 = X17
& property1(X17,healthy,pos) )
| ~ property1(X16,industrious,pos)
| ~ property1(X16,honest,pos)
| ~ person(X16) ) ),
inference(flattening,[],[f4]) ).
fof(f4,plain,
( ? [X18] :
( ? [X19] :
( X18 = X19
& cyclist(X19) )
& grocer(X18) )
& ! [X0] :
( ? [X1] :
( X0 = X1
& person(X1) )
| ~ cyclist(X0) )
& ! [X2] :
( ? [X3] :
( X2 = X3
& person(X3) )
| ~ grocer(X2) )
& ! [X4] :
( ! [X5] :
( X4 != X5
| ~ property1(X5,dishonest,pos) )
| ~ property1(X4,honest,pos)
| ~ person(X4) )
& ! [X6] :
( ! [X7] :
( X6 != X7
| ~ property1(X7,unhealthy,pos) )
| ~ property1(X6,healthy,pos)
| ~ person(X6) )
& ! [X8] :
( ? [X9] :
( X8 = X9
& property1(X9,dishonest,pos) )
| ~ property1(X8,unhealthy,pos)
| ~ cyclist(X8) )
& ! [X10] :
( ? [X11] :
( X10 = X11
& property1(X11,industrious,pos) )
| ~ cyclist(X10) )
& ! [X12] :
( ? [X13] :
( X12 = X13
& property1(X13,honest,pos) )
| ~ property1(X12,industrious,pos)
| ~ grocer(X12) )
& ! [X14] :
( ! [X15] :
( X14 != X15
| ~ property1(X15,healthy,pos) )
| ~ grocer(X14) )
& ! [X16] :
( ? [X17] :
( X16 = X17
& property1(X17,healthy,pos) )
| ~ property1(X16,industrious,pos)
| ~ property1(X16,honest,pos)
| ~ person(X16) ) ),
inference(ennf_transformation,[],[f3]) ).
fof(f3,plain,
~ ( ( ! [X0] :
( cyclist(X0)
=> ? [X1] :
( X0 = X1
& person(X1) ) )
& ! [X2] :
( grocer(X2)
=> ? [X3] :
( X2 = X3
& person(X3) ) )
& ! [X4] :
( ( property1(X4,honest,pos)
& person(X4) )
=> ~ ? [X5] :
( X4 = X5
& property1(X5,dishonest,pos) ) )
& ! [X6] :
( ( property1(X6,healthy,pos)
& person(X6) )
=> ~ ? [X7] :
( X6 = X7
& property1(X7,unhealthy,pos) ) )
& ! [X8] :
( ( property1(X8,unhealthy,pos)
& cyclist(X8) )
=> ? [X9] :
( X8 = X9
& property1(X9,dishonest,pos) ) )
& ! [X10] :
( cyclist(X10)
=> ? [X11] :
( X10 = X11
& property1(X11,industrious,pos) ) )
& ! [X12] :
( ( property1(X12,industrious,pos)
& grocer(X12) )
=> ? [X13] :
( X12 = X13
& property1(X13,honest,pos) ) )
& ! [X14] :
( grocer(X14)
=> ~ ? [X15] :
( X14 = X15
& property1(X15,healthy,pos) ) )
& ! [X16] :
( ( property1(X16,industrious,pos)
& property1(X16,honest,pos)
& person(X16) )
=> ? [X17] :
( X16 = X17
& property1(X17,healthy,pos) ) ) )
=> ! [X18] :
( grocer(X18)
=> ~ ? [X19] :
( X18 = X19
& cyclist(X19) ) ) ),
inference(rectify,[],[f2]) ).
fof(f2,negated_conjecture,
~ ( ( ! [X16] :
( cyclist(X16)
=> ? [X17] :
( X16 = X17
& person(X17) ) )
& ! [X14] :
( grocer(X14)
=> ? [X15] :
( X14 = X15
& person(X15) ) )
& ! [X12] :
( ( property1(X12,honest,pos)
& person(X12) )
=> ~ ? [X13] :
( X12 = X13
& property1(X13,dishonest,pos) ) )
& ! [X10] :
( ( property1(X10,healthy,pos)
& person(X10) )
=> ~ ? [X11] :
( X10 = X11
& property1(X11,unhealthy,pos) ) )
& ! [X8] :
( ( property1(X8,unhealthy,pos)
& cyclist(X8) )
=> ? [X9] :
( X8 = X9
& property1(X9,dishonest,pos) ) )
& ! [X6] :
( cyclist(X6)
=> ? [X7] :
( X6 = X7
& property1(X7,industrious,pos) ) )
& ! [X4] :
( ( property1(X4,industrious,pos)
& grocer(X4) )
=> ? [X5] :
( X4 = X5
& property1(X5,honest,pos) ) )
& ! [X2] :
( grocer(X2)
=> ~ ? [X3] :
( X2 = X3
& property1(X3,healthy,pos) ) )
& ! [X0] :
( ( property1(X0,industrious,pos)
& property1(X0,honest,pos)
& person(X0) )
=> ? [X1] :
( X0 = X1
& property1(X1,healthy,pos) ) ) )
=> ! [X18] :
( grocer(X18)
=> ~ ? [X19] :
( X18 = X19
& cyclist(X19) ) ) ),
inference(negated_conjecture,[],[f1]) ).
fof(f1,conjecture,
( ( ! [X16] :
( cyclist(X16)
=> ? [X17] :
( X16 = X17
& person(X17) ) )
& ! [X14] :
( grocer(X14)
=> ? [X15] :
( X14 = X15
& person(X15) ) )
& ! [X12] :
( ( property1(X12,honest,pos)
& person(X12) )
=> ~ ? [X13] :
( X12 = X13
& property1(X13,dishonest,pos) ) )
& ! [X10] :
( ( property1(X10,healthy,pos)
& person(X10) )
=> ~ ? [X11] :
( X10 = X11
& property1(X11,unhealthy,pos) ) )
& ! [X8] :
( ( property1(X8,unhealthy,pos)
& cyclist(X8) )
=> ? [X9] :
( X8 = X9
& property1(X9,dishonest,pos) ) )
& ! [X6] :
( cyclist(X6)
=> ? [X7] :
( X6 = X7
& property1(X7,industrious,pos) ) )
& ! [X4] :
( ( property1(X4,industrious,pos)
& grocer(X4) )
=> ? [X5] :
( X4 = X5
& property1(X5,honest,pos) ) )
& ! [X2] :
( grocer(X2)
=> ~ ? [X3] :
( X2 = X3
& property1(X3,healthy,pos) ) )
& ! [X0] :
( ( property1(X0,industrious,pos)
& property1(X0,honest,pos)
& person(X0) )
=> ? [X1] :
( X0 = X1
& property1(X1,healthy,pos) ) ) )
=> ! [X18] :
( grocer(X18)
=> ~ ? [X19] :
( X18 = X19
& cyclist(X19) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.jk6wvLdrUo/Vampire---4.8_17709',prove) ).
fof(f34,plain,
grocer(sK1),
inference(definition_unfolding,[],[f31,f33]) ).
fof(f33,plain,
sK0 = sK1,
inference(cnf_transformation,[],[f15]) ).
fof(f31,plain,
grocer(sK0),
inference(cnf_transformation,[],[f15]) ).
fof(f55,plain,
property1(sK1,healthy,pos),
inference(forward_demodulation,[],[f53,f52]) ).
fof(f52,plain,
sK1 = sK7(sK1),
inference(unit_resulting_resolution,[],[f42,f50,f47,f17]) ).
fof(f17,plain,
! [X18] :
( sK7(X18) = X18
| ~ property1(X18,industrious,pos)
| ~ property1(X18,honest,pos)
| ~ person(X18) ),
inference(cnf_transformation,[],[f15]) ).
fof(f47,plain,
property1(sK1,industrious,pos),
inference(forward_demodulation,[],[f46,f40]) ).
fof(f40,plain,
sK1 = sK5(sK1),
inference(unit_resulting_resolution,[],[f32,f22]) ).
fof(f22,plain,
! [X12] :
( sK5(X12) = X12
| ~ cyclist(X12) ),
inference(cnf_transformation,[],[f15]) ).
fof(f32,plain,
cyclist(sK1),
inference(cnf_transformation,[],[f15]) ).
fof(f46,plain,
property1(sK5(sK1),industrious,pos),
inference(unit_resulting_resolution,[],[f32,f21]) ).
fof(f21,plain,
! [X12] :
( property1(sK5(X12),industrious,pos)
| ~ cyclist(X12) ),
inference(cnf_transformation,[],[f15]) ).
fof(f50,plain,
property1(sK1,honest,pos),
inference(forward_demodulation,[],[f49,f48]) ).
fof(f48,plain,
sK1 = sK6(sK1),
inference(unit_resulting_resolution,[],[f34,f47,f20]) ).
fof(f20,plain,
! [X14] :
( sK6(X14) = X14
| ~ property1(X14,industrious,pos)
| ~ grocer(X14) ),
inference(cnf_transformation,[],[f15]) ).
fof(f49,plain,
property1(sK6(sK1),honest,pos),
inference(unit_resulting_resolution,[],[f34,f47,f19]) ).
fof(f19,plain,
! [X14] :
( property1(sK6(X14),honest,pos)
| ~ property1(X14,industrious,pos)
| ~ grocer(X14) ),
inference(cnf_transformation,[],[f15]) ).
fof(f42,plain,
person(sK1),
inference(backward_demodulation,[],[f38,f41]) ).
fof(f41,plain,
sK1 = sK3(sK1),
inference(unit_resulting_resolution,[],[f34,f28]) ).
fof(f28,plain,
! [X4] :
( sK3(X4) = X4
| ~ grocer(X4) ),
inference(cnf_transformation,[],[f15]) ).
fof(f38,plain,
person(sK3(sK1)),
inference(unit_resulting_resolution,[],[f34,f27]) ).
fof(f27,plain,
! [X4] :
( person(sK3(X4))
| ~ grocer(X4) ),
inference(cnf_transformation,[],[f15]) ).
fof(f53,plain,
property1(sK7(sK1),healthy,pos),
inference(unit_resulting_resolution,[],[f42,f50,f47,f16]) ).
fof(f16,plain,
! [X18] :
( property1(sK7(X18),healthy,pos)
| ~ property1(X18,industrious,pos)
| ~ property1(X18,honest,pos)
| ~ person(X18) ),
inference(cnf_transformation,[],[f15]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.05/0.10 % Problem : PUZ129+2 : TPTP v8.1.2. Released v4.0.0.
% 0.05/0.11 % Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% 0.10/0.31 % Computer : n017.cluster.edu
% 0.10/0.31 % Model : x86_64 x86_64
% 0.10/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.31 % Memory : 8042.1875MB
% 0.10/0.31 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.31 % CPULimit : 300
% 0.10/0.31 % WCLimit : 300
% 0.10/0.31 % DateTime : Tue Apr 30 16:59:04 EDT 2024
% 0.10/0.31 % CPUTime :
% 0.10/0.31 This is a FOF_THM_RFO_SEQ problem
% 0.10/0.31 Running vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t 300 /export/starexec/sandbox/tmp/tmp.jk6wvLdrUo/Vampire---4.8_17709
% 0.61/0.79 % (17824)lrs+2_1:1_sil=16000:fde=none:sos=all:nwc=5.0:i=34:ep=RS:s2pl=on:lma=on:afp=100000_0 on Vampire---4 for (2995ds/34Mi)
% 0.61/0.79 % (17823)ott+1011_1:1_sil=2000:urr=on:i=33:sd=1:kws=inv_frequency:ss=axioms:sup=off_0 on Vampire---4 for (2995ds/33Mi)
% 0.61/0.79 % (17825)lrs+1002_1:16_to=lpo:sil=32000:sp=unary_frequency:sos=on:i=45:bd=off:ss=axioms_0 on Vampire---4 for (2995ds/45Mi)
% 0.61/0.79 % (17820)dis-1011_2:1_sil=2000:lsd=20:nwc=5.0:flr=on:mep=off:st=3.0:i=34:sd=1:ep=RS:ss=axioms_0 on Vampire---4 for (2995ds/34Mi)
% 0.61/0.79 % (17821)lrs+1011_461:32768_sil=16000:irw=on:sp=frequency:lsd=20:fd=preordered:nwc=10.0:s2agt=32:alpa=false:cond=fast:s2a=on:i=51:s2at=3.0:awrs=decay:awrsf=691:bd=off:nm=20:fsr=off:amm=sco:uhcvi=on:rawr=on_0 on Vampire---4 for (2995ds/51Mi)
% 0.61/0.79 % (17822)lrs+1011_1:1_sil=8000:sp=occurrence:nwc=10.0:i=78:ss=axioms:sgt=8_0 on Vampire---4 for (2995ds/78Mi)
% 0.61/0.79 % (17826)lrs+21_1:5_sil=2000:sos=on:urr=on:newcnf=on:slsq=on:i=83:slsql=off:bd=off:nm=2:ss=axioms:st=1.5:sp=const_min:gsp=on:rawr=on_0 on Vampire---4 for (2995ds/83Mi)
% 0.61/0.79 % (17827)lrs-21_1:1_to=lpo:sil=2000:sp=frequency:sos=on:lma=on:i=56:sd=2:ss=axioms:ep=R_0 on Vampire---4 for (2995ds/56Mi)
% 0.61/0.79 % (17820)Refutation not found, incomplete strategy% (17820)------------------------------
% 0.61/0.79 % (17820)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.61/0.79 % (17820)Termination reason: Refutation not found, incomplete strategy
% 0.61/0.79
% 0.61/0.79 % (17820)Memory used [KB]: 1025
% 0.61/0.79 % (17820)Time elapsed: 0.004 s
% 0.61/0.79 % (17820)Instructions burned: 3 (million)
% 0.61/0.79 % (17820)------------------------------
% 0.61/0.79 % (17820)------------------------------
% 0.61/0.79 % (17824)Refutation not found, incomplete strategy% (17824)------------------------------
% 0.61/0.79 % (17824)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.61/0.79 % (17824)Termination reason: Refutation not found, incomplete strategy
% 0.61/0.79
% 0.61/0.79 % (17824)Memory used [KB]: 1042
% 0.61/0.79 % (17824)Time elapsed: 0.004 s
% 0.61/0.79 % (17824)Instructions burned: 3 (million)
% 0.61/0.79 % (17824)------------------------------
% 0.61/0.79 % (17824)------------------------------
% 0.61/0.79 % (17827)Refutation not found, incomplete strategy% (17827)------------------------------
% 0.61/0.79 % (17827)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.61/0.79 % (17827)Termination reason: Refutation not found, incomplete strategy
% 0.61/0.79
% 0.61/0.79 % (17827)Memory used [KB]: 1035
% 0.61/0.79 % (17827)Time elapsed: 0.003 s
% 0.61/0.79 % (17827)Instructions burned: 4 (million)
% 0.61/0.79 % (17827)------------------------------
% 0.61/0.79 % (17827)------------------------------
% 0.61/0.79 % (17823)First to succeed.
% 0.61/0.79 % (17822)Also succeeded, but the first one will report.
% 0.61/0.79 % (17821)Also succeeded, but the first one will report.
% 0.61/0.79 % (17823)Refutation found. Thanks to Tanya!
% 0.61/0.79 % SZS status Theorem for Vampire---4
% 0.61/0.79 % SZS output start Proof for Vampire---4
% See solution above
% 0.61/0.79 % (17823)------------------------------
% 0.61/0.79 % (17823)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.61/0.79 % (17823)Termination reason: Refutation
% 0.61/0.79
% 0.61/0.79 % (17823)Memory used [KB]: 1045
% 0.61/0.79 % (17823)Time elapsed: 0.005 s
% 0.61/0.79 % (17823)Instructions burned: 6 (million)
% 0.61/0.79 % (17823)------------------------------
% 0.61/0.79 % (17823)------------------------------
% 0.61/0.79 % (17818)Success in time 0.48 s
% 0.61/0.80 % Vampire---4.8 exiting
%------------------------------------------------------------------------------