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 : n006.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 : Sun May 5 08:49:21 EDT 2024
% Result : Theorem 0.53s 0.75s
% Output : Refutation 0.53s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 1
% Syntax : Number of formulae : 33 ( 18 unt; 0 def)
% Number of atoms : 225 ( 60 equ)
% Maximal formula atoms : 36 ( 6 avg)
% Number of connectives : 268 ( 76 ~; 53 |; 106 &)
% ( 0 <=>; 33 =>; 0 <=; 0 <~>)
% Maximal formula depth : 16 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-3 aty)
% Number of functors : 12 ( 12 usr; 8 con; 0-1 aty)
% Number of variables : 111 ( 65 !; 46 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f59,plain,
$false,
inference(subsumption_resolution,[],[f58,f40]) ).
fof(f40,plain,
~ property1(sK7,healthy,pos),
inference(unit_resulting_resolution,[],[f24,f25]) ).
fof(f25,plain,
! [X15] :
( ~ property1(X15,healthy,pos)
| ~ grocer(X15) ),
inference(equality_resolution,[],[f20]) ).
fof(f20,plain,
! [X14,X15] :
( ~ grocer(X14)
| ~ property1(X15,healthy,pos)
| X14 != X15 ),
inference(cnf_transformation,[],[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.fWcHe8sLNo/Vampire---4.8_7865',prove) ).
fof(f24,plain,
grocer(sK7),
inference(definition_unfolding,[],[f23,f7]) ).
fof(f7,plain,
sK0 = sK7,
inference(cnf_transformation,[],[f5]) ).
fof(f23,plain,
grocer(sK0),
inference(cnf_transformation,[],[f5]) ).
fof(f58,plain,
property1(sK7,healthy,pos),
inference(forward_demodulation,[],[f56,f53]) ).
fof(f53,plain,
sK7 = sK1(sK7),
inference(unit_resulting_resolution,[],[f34,f50,f43,f22]) ).
fof(f22,plain,
! [X16] :
( ~ property1(X16,industrious,pos)
| ~ property1(X16,honest,pos)
| ~ person(X16)
| sK1(X16) = X16 ),
inference(cnf_transformation,[],[f5]) ).
fof(f43,plain,
property1(sK7,industrious,pos),
inference(forward_demodulation,[],[f41,f38]) ).
fof(f38,plain,
sK7 = sK3(sK7),
inference(unit_resulting_resolution,[],[f6,f17]) ).
fof(f17,plain,
! [X10] :
( ~ cyclist(X10)
| sK3(X10) = X10 ),
inference(cnf_transformation,[],[f5]) ).
fof(f6,plain,
cyclist(sK7),
inference(cnf_transformation,[],[f5]) ).
fof(f41,plain,
property1(sK3(sK7),industrious,pos),
inference(unit_resulting_resolution,[],[f6,f16]) ).
fof(f16,plain,
! [X10] :
( property1(sK3(X10),industrious,pos)
| ~ cyclist(X10) ),
inference(cnf_transformation,[],[f5]) ).
fof(f50,plain,
property1(sK7,honest,pos),
inference(forward_demodulation,[],[f48,f44]) ).
fof(f44,plain,
sK7 = sK2(sK7),
inference(unit_resulting_resolution,[],[f24,f43,f19]) ).
fof(f19,plain,
! [X12] :
( ~ property1(X12,industrious,pos)
| ~ grocer(X12)
| sK2(X12) = X12 ),
inference(cnf_transformation,[],[f5]) ).
fof(f48,plain,
property1(sK2(sK7),honest,pos),
inference(unit_resulting_resolution,[],[f24,f43,f18]) ).
fof(f18,plain,
! [X12] :
( property1(sK2(X12),honest,pos)
| ~ property1(X12,industrious,pos)
| ~ grocer(X12) ),
inference(cnf_transformation,[],[f5]) ).
fof(f34,plain,
person(sK7),
inference(superposition,[],[f28,f30]) ).
fof(f30,plain,
sK7 = sK6(sK7),
inference(unit_resulting_resolution,[],[f6,f9]) ).
fof(f9,plain,
! [X0] :
( ~ cyclist(X0)
| sK6(X0) = X0 ),
inference(cnf_transformation,[],[f5]) ).
fof(f28,plain,
person(sK6(sK7)),
inference(unit_resulting_resolution,[],[f6,f8]) ).
fof(f8,plain,
! [X0] :
( person(sK6(X0))
| ~ cyclist(X0) ),
inference(cnf_transformation,[],[f5]) ).
fof(f56,plain,
property1(sK1(sK7),healthy,pos),
inference(unit_resulting_resolution,[],[f34,f43,f50,f21]) ).
fof(f21,plain,
! [X16] :
( property1(sK1(X16),healthy,pos)
| ~ property1(X16,honest,pos)
| ~ property1(X16,industrious,pos)
| ~ person(X16) ),
inference(cnf_transformation,[],[f5]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : PUZ129+2 : TPTP v8.1.2. Released v4.0.0.
% 0.07/0.15 % 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.15/0.36 % Computer : n006.cluster.edu
% 0.15/0.36 % Model : x86_64 x86_64
% 0.15/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.36 % Memory : 8042.1875MB
% 0.15/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.36 % CPULimit : 300
% 0.15/0.36 % WCLimit : 300
% 0.15/0.36 % DateTime : Fri May 3 18:01:23 EDT 2024
% 0.15/0.36 % CPUTime :
% 0.15/0.36 This is a FOF_THM_RFO_SEQ problem
% 0.15/0.36 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.fWcHe8sLNo/Vampire---4.8_7865
% 0.53/0.74 % (8121)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 (2996ds/83Mi)
% 0.53/0.74 % (8115)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 (2996ds/34Mi)
% 0.53/0.74 % (8116)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 (2996ds/51Mi)
% 0.53/0.74 % (8118)ott+1011_1:1_sil=2000:urr=on:i=33:sd=1:kws=inv_frequency:ss=axioms:sup=off_0 on Vampire---4 for (2996ds/33Mi)
% 0.53/0.74 % (8117)lrs+1011_1:1_sil=8000:sp=occurrence:nwc=10.0:i=78:ss=axioms:sgt=8_0 on Vampire---4 for (2996ds/78Mi)
% 0.53/0.74 % (8119)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 (2996ds/34Mi)
% 0.53/0.74 % (8120)lrs+1002_1:16_to=lpo:sil=32000:sp=unary_frequency:sos=on:i=45:bd=off:ss=axioms_0 on Vampire---4 for (2996ds/45Mi)
% 0.53/0.75 % (8121)First to succeed.
% 0.53/0.75 % (8121)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-8111"
% 0.53/0.75 % (8115)Refutation not found, incomplete strategy% (8115)------------------------------
% 0.53/0.75 % (8115)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.53/0.75 % (8115)Termination reason: Refutation not found, incomplete strategy
% 0.53/0.75
% 0.53/0.75 % (8115)Memory used [KB]: 1025
% 0.53/0.75 % (8115)Time elapsed: 0.003 s
% 0.53/0.75 % (8115)Instructions burned: 3 (million)
% 0.53/0.75 % (8121)Refutation found. Thanks to Tanya!
% 0.53/0.75 % SZS status Theorem for Vampire---4
% 0.53/0.75 % SZS output start Proof for Vampire---4
% See solution above
% 0.53/0.75 % (8121)------------------------------
% 0.53/0.75 % (8121)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.53/0.75 % (8121)Termination reason: Refutation
% 0.53/0.75
% 0.53/0.75 % (8121)Memory used [KB]: 1034
% 0.53/0.75 % (8121)Time elapsed: 0.003 s
% 0.53/0.75 % (8121)Instructions burned: 6 (million)
% 0.53/0.75 % (8111)Success in time 0.376 s
% 0.53/0.75 % Vampire---4.8 exiting
%------------------------------------------------------------------------------