TSTP Solution File: PUZ129+2 by Vampire-SAT---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire-SAT---4.8
% Problem : PUZ129+2 : TPTP v8.1.2. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : vampire --mode casc_sat -m 16384 --cores 7 -t %d %s
% Computer : n016.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 Apr 30 14:45:52 EDT 2024
% Result : Theorem 0.15s 0.32s
% Output : Refutation 0.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 15
% 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(f68,plain,
$false,
inference(subsumption_resolution,[],[f67,f50]) ).
fof(f50,plain,
~ property1(sK0,healthy,pos),
inference(unit_resulting_resolution,[],[f31,f36]) ).
fof(f36,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/benchmark/theBenchmark.p',prove) ).
fof(f31,plain,
grocer(sK0),
inference(cnf_transformation,[],[f15]) ).
fof(f67,plain,
property1(sK0,healthy,pos),
inference(forward_demodulation,[],[f65,f63]) ).
fof(f63,plain,
sK0 = sK7(sK0),
inference(unit_resulting_resolution,[],[f46,f59,f53,f17]) ).
fof(f17,plain,
! [X18] :
( ~ property1(X18,industrious,pos)
| sK7(X18) = X18
| ~ property1(X18,honest,pos)
| ~ person(X18) ),
inference(cnf_transformation,[],[f15]) ).
fof(f53,plain,
property1(sK0,industrious,pos),
inference(forward_demodulation,[],[f51,f42]) ).
fof(f42,plain,
sK0 = sK5(sK0),
inference(unit_resulting_resolution,[],[f37,f22]) ).
fof(f22,plain,
! [X12] :
( ~ cyclist(X12)
| sK5(X12) = X12 ),
inference(cnf_transformation,[],[f15]) ).
fof(f37,plain,
cyclist(sK0),
inference(forward_demodulation,[],[f32,f33]) ).
fof(f33,plain,
sK0 = sK1,
inference(cnf_transformation,[],[f15]) ).
fof(f32,plain,
cyclist(sK1),
inference(cnf_transformation,[],[f15]) ).
fof(f51,plain,
property1(sK5(sK0),industrious,pos),
inference(unit_resulting_resolution,[],[f37,f21]) ).
fof(f21,plain,
! [X12] :
( ~ cyclist(X12)
| property1(sK5(X12),industrious,pos) ),
inference(cnf_transformation,[],[f15]) ).
fof(f59,plain,
property1(sK0,honest,pos),
inference(forward_demodulation,[],[f57,f55]) ).
fof(f55,plain,
sK0 = sK6(sK0),
inference(unit_resulting_resolution,[],[f31,f53,f20]) ).
fof(f20,plain,
! [X14] :
( ~ property1(X14,industrious,pos)
| sK6(X14) = X14
| ~ grocer(X14) ),
inference(cnf_transformation,[],[f15]) ).
fof(f57,plain,
property1(sK6(sK0),honest,pos),
inference(unit_resulting_resolution,[],[f31,f53,f19]) ).
fof(f19,plain,
! [X14] :
( ~ property1(X14,industrious,pos)
| property1(sK6(X14),honest,pos)
| ~ grocer(X14) ),
inference(cnf_transformation,[],[f15]) ).
fof(f46,plain,
person(sK0),
inference(superposition,[],[f38,f44]) ).
fof(f44,plain,
sK0 = sK3(sK0),
inference(unit_resulting_resolution,[],[f31,f28]) ).
fof(f28,plain,
! [X4] :
( ~ grocer(X4)
| sK3(X4) = X4 ),
inference(cnf_transformation,[],[f15]) ).
fof(f38,plain,
person(sK3(sK0)),
inference(unit_resulting_resolution,[],[f31,f27]) ).
fof(f27,plain,
! [X4] :
( ~ grocer(X4)
| person(sK3(X4)) ),
inference(cnf_transformation,[],[f15]) ).
fof(f65,plain,
property1(sK7(sK0),healthy,pos),
inference(unit_resulting_resolution,[],[f46,f59,f53,f16]) ).
fof(f16,plain,
! [X18] :
( ~ property1(X18,industrious,pos)
| property1(sK7(X18),healthy,pos)
| ~ property1(X18,honest,pos)
| ~ person(X18) ),
inference(cnf_transformation,[],[f15]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.02/0.09 % Problem : PUZ129+2 : TPTP v8.1.2. Released v4.0.0.
% 0.02/0.10 % Command : vampire --mode casc_sat -m 16384 --cores 7 -t %d %s
% 0.09/0.30 % Computer : n016.cluster.edu
% 0.09/0.30 % Model : x86_64 x86_64
% 0.09/0.30 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.30 % Memory : 8042.1875MB
% 0.09/0.30 % OS : Linux 3.10.0-693.el7.x86_64
% 0.09/0.30 % CPULimit : 300
% 0.09/0.30 % WCLimit : 300
% 0.09/0.30 % DateTime : Tue Apr 30 02:33:55 EDT 2024
% 0.09/0.30 % CPUTime :
% 0.09/0.30 % (28883)Running in auto input_syntax mode. Trying TPTP
% 0.15/0.32 % (28886)WARNING: value z3 for option sas not known
% 0.15/0.32 % (28884)fmb+10_1_bce=on:fmbas=function:fmbsr=1.2:fde=unused:nm=0_846 on theBenchmark for (846ds/0Mi)
% 0.15/0.32 % (28885)fmb+10_1_bce=on:fmbdsb=on:fmbes=contour:fmbswr=3:fde=none:nm=0_793 on theBenchmark for (793ds/0Mi)
% 0.15/0.32 % (28887)fmb+10_1_bce=on:fmbsr=1.5:nm=32_533 on theBenchmark for (533ds/0Mi)
% 0.15/0.32 % (28888)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.15/0.32 % (28889)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.15/0.32 % (28886)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.15/0.32 % (28890)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.15/0.32 TRYING [1]
% 0.15/0.32 TRYING [1]
% 0.15/0.32 % (28890)First to succeed.
% 0.15/0.32 TRYING [2]
% 0.15/0.32 TRYING [2]
% 0.15/0.32 TRYING [3]
% 0.15/0.32 TRYING [3]
% 0.15/0.32 % (28889)Also succeeded, but the first one will report.
% 0.15/0.32 TRYING [1]
% 0.15/0.32 TRYING [2]
% 0.15/0.32 % (28884)Also succeeded, but the first one will report.
% 0.15/0.32 % (28890)Refutation found. Thanks to Tanya!
% 0.15/0.32 % SZS status Theorem for theBenchmark
% 0.15/0.32 % SZS output start Proof for theBenchmark
% See solution above
% 0.15/0.32 % (28890)------------------------------
% 0.15/0.32 % (28890)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.15/0.32 % (28890)Termination reason: Refutation
% 0.15/0.32
% 0.15/0.32 % (28890)Memory used [KB]: 818
% 0.15/0.32 % (28890)Time elapsed: 0.004 s
% 0.15/0.32 % (28890)Instructions burned: 7 (million)
% 0.15/0.32 % (28890)------------------------------
% 0.15/0.32 % (28890)------------------------------
% 0.15/0.32 % (28883)Success in time 0.02 s
%------------------------------------------------------------------------------