TSTP Solution File: PUZ129+2 by SnakeForV-SAT---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV-SAT---1.0
% Problem : PUZ129+2 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_sat --cores 0 -t %d %s
% Computer : n011.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:12:09 EDT 2022
% Result : Theorem 0.21s 0.50s
% Output : Refutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 15
% Number of leaves : 9
% Syntax : Number of formulae : 43 ( 8 unt; 0 def)
% Number of atoms : 353 ( 93 equ)
% Maximal formula atoms : 36 ( 8 avg)
% Number of connectives : 452 ( 142 ~; 111 |; 158 &)
% ( 0 <=>; 41 =>; 0 <=; 0 <~>)
% Maximal formula depth : 17 ( 6 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 : 167 ( 103 !; 64 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f64,plain,
$false,
inference(subsumption_resolution,[],[f63,f42]) ).
fof(f42,plain,
person(sK5),
inference(subsumption_resolution,[],[f41,f34]) ).
fof(f34,plain,
grocer(sK5),
inference(definition_unfolding,[],[f23,f21]) ).
fof(f21,plain,
sK4 = sK5,
inference(cnf_transformation,[],[f15]) ).
fof(f15,plain,
( ! [X0] :
( ! [X1] :
( ~ property1(X1,healthy,pos)
| X0 != X1 )
| ~ grocer(X0) )
& ! [X2] :
( ~ cyclist(X2)
| ( sK0(X2) = X2
& person(sK0(X2)) ) )
& ! [X4] :
( ~ property1(X4,industrious,pos)
| ( sK1(X4) = X4
& property1(sK1(X4),honest,pos) )
| ~ grocer(X4) )
& ! [X6] :
( ~ property1(X6,honest,pos)
| ~ person(X6)
| ! [X7] :
( X6 != X7
| ~ property1(X7,dishonest,pos) ) )
& ! [X8] :
( ( sK2(X8) = X8
& property1(sK2(X8),industrious,pos) )
| ~ cyclist(X8) )
& ! [X10] :
( ~ grocer(X10)
| ( sK3(X10) = X10
& person(sK3(X10)) ) )
& grocer(sK4)
& cyclist(sK5)
& sK4 = sK5
& ! [X14] :
( ~ cyclist(X14)
| ~ property1(X14,unhealthy,pos)
| ( property1(sK6(X14),dishonest,pos)
& sK6(X14) = X14 ) )
& ! [X16] :
( ! [X17] :
( ~ property1(X17,unhealthy,pos)
| X16 != X17 )
| ~ property1(X16,healthy,pos)
| ~ person(X16) )
& ! [X18] :
( ~ property1(X18,honest,pos)
| ( sK7(X18) = X18
& property1(sK7(X18),healthy,pos) )
| ~ person(X18)
| ~ property1(X18,industrious,pos) ) ),
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,
! [X2] :
( ? [X3] :
( X2 = X3
& person(X3) )
=> ( sK0(X2) = X2
& person(sK0(X2)) ) ),
introduced(choice_axiom,[]) ).
fof(f8,plain,
! [X4] :
( ? [X5] :
( X4 = X5
& property1(X5,honest,pos) )
=> ( sK1(X4) = X4
& property1(sK1(X4),honest,pos) ) ),
introduced(choice_axiom,[]) ).
fof(f9,plain,
! [X8] :
( ? [X9] :
( X8 = X9
& property1(X9,industrious,pos) )
=> ( sK2(X8) = X8
& property1(sK2(X8),industrious,pos) ) ),
introduced(choice_axiom,[]) ).
fof(f10,plain,
! [X10] :
( ? [X11] :
( X10 = X11
& person(X11) )
=> ( sK3(X10) = X10
& person(sK3(X10)) ) ),
introduced(choice_axiom,[]) ).
fof(f11,plain,
( ? [X12] :
( grocer(X12)
& ? [X13] :
( cyclist(X13)
& X12 = X13 ) )
=> ( grocer(sK4)
& ? [X13] :
( cyclist(X13)
& sK4 = X13 ) ) ),
introduced(choice_axiom,[]) ).
fof(f12,plain,
( ? [X13] :
( cyclist(X13)
& sK4 = X13 )
=> ( cyclist(sK5)
& sK4 = sK5 ) ),
introduced(choice_axiom,[]) ).
fof(f13,plain,
! [X14] :
( ? [X15] :
( property1(X15,dishonest,pos)
& X14 = X15 )
=> ( property1(sK6(X14),dishonest,pos)
& sK6(X14) = X14 ) ),
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] :
( ~ property1(X1,healthy,pos)
| X0 != X1 )
| ~ grocer(X0) )
& ! [X2] :
( ~ cyclist(X2)
| ? [X3] :
( X2 = X3
& person(X3) ) )
& ! [X4] :
( ~ property1(X4,industrious,pos)
| ? [X5] :
( X4 = X5
& property1(X5,honest,pos) )
| ~ grocer(X4) )
& ! [X6] :
( ~ property1(X6,honest,pos)
| ~ person(X6)
| ! [X7] :
( X6 != X7
| ~ property1(X7,dishonest,pos) ) )
& ! [X8] :
( ? [X9] :
( X8 = X9
& property1(X9,industrious,pos) )
| ~ cyclist(X8) )
& ! [X10] :
( ~ grocer(X10)
| ? [X11] :
( X10 = X11
& person(X11) ) )
& ? [X12] :
( grocer(X12)
& ? [X13] :
( cyclist(X13)
& X12 = X13 ) )
& ! [X14] :
( ~ cyclist(X14)
| ~ property1(X14,unhealthy,pos)
| ? [X15] :
( property1(X15,dishonest,pos)
& X14 = X15 ) )
& ! [X16] :
( ! [X17] :
( ~ property1(X17,unhealthy,pos)
| X16 != X17 )
| ~ property1(X16,healthy,pos)
| ~ person(X16) )
& ! [X18] :
( ~ property1(X18,honest,pos)
| ? [X19] :
( X18 = X19
& property1(X19,healthy,pos) )
| ~ person(X18)
| ~ property1(X18,industrious,pos) ) ),
inference(rectify,[],[f5]) ).
fof(f5,plain,
( ! [X14] :
( ! [X15] :
( ~ property1(X15,healthy,pos)
| X14 != X15 )
| ~ grocer(X14) )
& ! [X4] :
( ~ cyclist(X4)
| ? [X5] :
( X4 = X5
& person(X5) ) )
& ! [X0] :
( ~ property1(X0,industrious,pos)
| ? [X1] :
( X0 = X1
& property1(X1,honest,pos) )
| ~ grocer(X0) )
& ! [X6] :
( ~ property1(X6,honest,pos)
| ~ person(X6)
| ! [X7] :
( X6 != X7
| ~ property1(X7,dishonest,pos) ) )
& ! [X16] :
( ? [X17] :
( X16 = X17
& property1(X17,industrious,pos) )
| ~ cyclist(X16) )
& ! [X2] :
( ~ grocer(X2)
| ? [X3] :
( X2 = X3
& person(X3) ) )
& ? [X18] :
( grocer(X18)
& ? [X19] :
( cyclist(X19)
& X18 = X19 ) )
& ! [X12] :
( ~ cyclist(X12)
| ~ property1(X12,unhealthy,pos)
| ? [X13] :
( property1(X13,dishonest,pos)
& X12 = X13 ) )
& ! [X8] :
( ! [X9] :
( ~ property1(X9,unhealthy,pos)
| X8 != X9 )
| ~ property1(X8,healthy,pos)
| ~ person(X8) )
& ! [X10] :
( ~ property1(X10,honest,pos)
| ? [X11] :
( X10 = X11
& property1(X11,healthy,pos) )
| ~ person(X10)
| ~ property1(X10,industrious,pos) ) ),
inference(flattening,[],[f4]) ).
fof(f4,plain,
( ? [X18] :
( grocer(X18)
& ? [X19] :
( cyclist(X19)
& X18 = X19 ) )
& ! [X2] :
( ~ grocer(X2)
| ? [X3] :
( X2 = X3
& person(X3) ) )
& ! [X0] :
( ? [X1] :
( X0 = X1
& property1(X1,honest,pos) )
| ~ property1(X0,industrious,pos)
| ~ grocer(X0) )
& ! [X8] :
( ! [X9] :
( ~ property1(X9,unhealthy,pos)
| X8 != X9 )
| ~ property1(X8,healthy,pos)
| ~ person(X8) )
& ! [X4] :
( ~ cyclist(X4)
| ? [X5] :
( X4 = X5
& person(X5) ) )
& ! [X16] :
( ? [X17] :
( X16 = X17
& property1(X17,industrious,pos) )
| ~ cyclist(X16) )
& ! [X12] :
( ? [X13] :
( property1(X13,dishonest,pos)
& X12 = X13 )
| ~ cyclist(X12)
| ~ property1(X12,unhealthy,pos) )
& ! [X6] :
( ! [X7] :
( X6 != X7
| ~ property1(X7,dishonest,pos) )
| ~ person(X6)
| ~ property1(X6,honest,pos) )
& ! [X10] :
( ? [X11] :
( X10 = X11
& property1(X11,healthy,pos) )
| ~ property1(X10,honest,pos)
| ~ property1(X10,industrious,pos)
| ~ person(X10) )
& ! [X14] :
( ! [X15] :
( ~ property1(X15,healthy,pos)
| X14 != X15 )
| ~ grocer(X14) ) ),
inference(ennf_transformation,[],[f3]) ).
fof(f3,plain,
~ ( ( ! [X2] :
( grocer(X2)
=> ? [X3] :
( X2 = X3
& person(X3) ) )
& ! [X0] :
( ( property1(X0,industrious,pos)
& grocer(X0) )
=> ? [X1] :
( X0 = X1
& property1(X1,honest,pos) ) )
& ! [X8] :
( ( property1(X8,healthy,pos)
& person(X8) )
=> ~ ? [X9] :
( X8 = X9
& property1(X9,unhealthy,pos) ) )
& ! [X4] :
( cyclist(X4)
=> ? [X5] :
( X4 = X5
& person(X5) ) )
& ! [X16] :
( cyclist(X16)
=> ? [X17] :
( X16 = X17
& property1(X17,industrious,pos) ) )
& ! [X12] :
( ( cyclist(X12)
& property1(X12,unhealthy,pos) )
=> ? [X13] :
( property1(X13,dishonest,pos)
& X12 = X13 ) )
& ! [X6] :
( ( person(X6)
& property1(X6,honest,pos) )
=> ~ ? [X7] :
( X6 = X7
& property1(X7,dishonest,pos) ) )
& ! [X10] :
( ( property1(X10,honest,pos)
& property1(X10,industrious,pos)
& person(X10) )
=> ? [X11] :
( X10 = X11
& property1(X11,healthy,pos) ) )
& ! [X14] :
( grocer(X14)
=> ~ ? [X15] :
( property1(X15,healthy,pos)
& X14 = X15 ) ) )
=> ! [X18] :
( grocer(X18)
=> ~ ? [X19] :
( cyclist(X19)
& X18 = X19 ) ) ),
inference(rectify,[],[f2]) ).
fof(f2,negated_conjecture,
~ ( ( ! [X4] :
( ( property1(X4,industrious,pos)
& grocer(X4) )
=> ? [X5] :
( X4 = X5
& property1(X5,honest,pos) ) )
& ! [X14] :
( grocer(X14)
=> ? [X15] :
( person(X15)
& X14 = X15 ) )
& ! [X16] :
( cyclist(X16)
=> ? [X17] :
( X16 = X17
& person(X17) ) )
& ! [X12] :
( ( property1(X12,honest,pos)
& person(X12) )
=> ~ ? [X13] :
( X12 = X13
& property1(X13,dishonest,pos) ) )
& ! [X10] :
( ( person(X10)
& property1(X10,healthy,pos) )
=> ~ ? [X11] :
( X10 = X11
& property1(X11,unhealthy,pos) ) )
& ! [X0] :
( ( property1(X0,honest,pos)
& person(X0)
& property1(X0,industrious,pos) )
=> ? [X1] :
( X0 = X1
& property1(X1,healthy,pos) ) )
& ! [X8] :
( ( property1(X8,unhealthy,pos)
& cyclist(X8) )
=> ? [X9] :
( X8 = X9
& property1(X9,dishonest,pos) ) )
& ! [X2] :
( grocer(X2)
=> ~ ? [X3] :
( X2 = X3
& property1(X3,healthy,pos) ) )
& ! [X6] :
( cyclist(X6)
=> ? [X7] :
( X6 = X7
& property1(X7,industrious,pos) ) ) )
=> ! [X18] :
( grocer(X18)
=> ~ ? [X19] :
( cyclist(X19)
& X18 = X19 ) ) ),
inference(negated_conjecture,[],[f1]) ).
fof(f1,conjecture,
( ( ! [X4] :
( ( property1(X4,industrious,pos)
& grocer(X4) )
=> ? [X5] :
( X4 = X5
& property1(X5,honest,pos) ) )
& ! [X14] :
( grocer(X14)
=> ? [X15] :
( person(X15)
& X14 = X15 ) )
& ! [X16] :
( cyclist(X16)
=> ? [X17] :
( X16 = X17
& person(X17) ) )
& ! [X12] :
( ( property1(X12,honest,pos)
& person(X12) )
=> ~ ? [X13] :
( X12 = X13
& property1(X13,dishonest,pos) ) )
& ! [X10] :
( ( person(X10)
& property1(X10,healthy,pos) )
=> ~ ? [X11] :
( X10 = X11
& property1(X11,unhealthy,pos) ) )
& ! [X0] :
( ( property1(X0,honest,pos)
& person(X0)
& property1(X0,industrious,pos) )
=> ? [X1] :
( X0 = X1
& property1(X1,healthy,pos) ) )
& ! [X8] :
( ( property1(X8,unhealthy,pos)
& cyclist(X8) )
=> ? [X9] :
( X8 = X9
& property1(X9,dishonest,pos) ) )
& ! [X2] :
( grocer(X2)
=> ~ ? [X3] :
( X2 = X3
& property1(X3,healthy,pos) ) )
& ! [X6] :
( cyclist(X6)
=> ? [X7] :
( X6 = X7
& property1(X7,industrious,pos) ) ) )
=> ! [X18] :
( grocer(X18)
=> ~ ? [X19] :
( cyclist(X19)
& X18 = X19 ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove) ).
fof(f23,plain,
grocer(sK4),
inference(cnf_transformation,[],[f15]) ).
fof(f41,plain,
( person(sK5)
| ~ grocer(sK5) ),
inference(superposition,[],[f24,f38]) ).
fof(f38,plain,
sK3(sK5) = sK5,
inference(resolution,[],[f25,f34]) ).
fof(f25,plain,
! [X10] :
( ~ grocer(X10)
| sK3(X10) = X10 ),
inference(cnf_transformation,[],[f15]) ).
fof(f24,plain,
! [X10] :
( person(sK3(X10))
| ~ grocer(X10) ),
inference(cnf_transformation,[],[f15]) ).
fof(f63,plain,
~ person(sK5),
inference(subsumption_resolution,[],[f62,f34]) ).
fof(f62,plain,
( ~ grocer(sK5)
| ~ person(sK5) ),
inference(resolution,[],[f61,f22]) ).
fof(f22,plain,
cyclist(sK5),
inference(cnf_transformation,[],[f15]) ).
fof(f61,plain,
! [X0] :
( ~ cyclist(X0)
| ~ grocer(X0)
| ~ person(X0) ),
inference(subsumption_resolution,[],[f60,f35]) ).
fof(f35,plain,
! [X1] :
( ~ property1(X1,healthy,pos)
| ~ grocer(X1) ),
inference(equality_resolution,[],[f33]) ).
fof(f33,plain,
! [X0,X1] :
( ~ property1(X1,healthy,pos)
| X0 != X1
| ~ grocer(X0) ),
inference(cnf_transformation,[],[f15]) ).
fof(f60,plain,
! [X0] :
( property1(X0,healthy,pos)
| ~ person(X0)
| ~ grocer(X0)
| ~ cyclist(X0) ),
inference(duplicate_literal_removal,[],[f59]) ).
fof(f59,plain,
! [X0] :
( ~ cyclist(X0)
| ~ person(X0)
| ~ grocer(X0)
| property1(X0,healthy,pos)
| ~ cyclist(X0) ),
inference(resolution,[],[f53,f50]) ).
fof(f50,plain,
! [X0] :
( property1(X0,honest,pos)
| ~ cyclist(X0)
| ~ grocer(X0) ),
inference(resolution,[],[f49,f44]) ).
fof(f44,plain,
! [X8] :
( property1(X8,industrious,pos)
| ~ cyclist(X8) ),
inference(forward_subsumption_demodulation,[],[f26,f27]) ).
fof(f27,plain,
! [X8] :
( ~ cyclist(X8)
| sK2(X8) = X8 ),
inference(cnf_transformation,[],[f15]) ).
fof(f26,plain,
! [X8] :
( property1(sK2(X8),industrious,pos)
| ~ cyclist(X8) ),
inference(cnf_transformation,[],[f15]) ).
fof(f49,plain,
! [X4] :
( ~ property1(X4,industrious,pos)
| ~ grocer(X4)
| property1(X4,honest,pos) ),
inference(forward_subsumption_demodulation,[],[f29,f30]) ).
fof(f30,plain,
! [X4] :
( ~ property1(X4,industrious,pos)
| sK1(X4) = X4
| ~ grocer(X4) ),
inference(cnf_transformation,[],[f15]) ).
fof(f29,plain,
! [X4] :
( property1(sK1(X4),honest,pos)
| ~ property1(X4,industrious,pos)
| ~ grocer(X4) ),
inference(cnf_transformation,[],[f15]) ).
fof(f53,plain,
! [X0] :
( ~ property1(X0,honest,pos)
| ~ cyclist(X0)
| ~ person(X0)
| property1(X0,healthy,pos) ),
inference(resolution,[],[f52,f44]) ).
fof(f52,plain,
! [X18] :
( ~ property1(X18,industrious,pos)
| property1(X18,healthy,pos)
| ~ person(X18)
| ~ property1(X18,honest,pos) ),
inference(forward_subsumption_demodulation,[],[f16,f17]) ).
fof(f17,plain,
! [X18] :
( ~ property1(X18,industrious,pos)
| ~ property1(X18,honest,pos)
| ~ person(X18)
| sK7(X18) = X18 ),
inference(cnf_transformation,[],[f15]) ).
fof(f16,plain,
! [X18] :
( property1(sK7(X18),healthy,pos)
| ~ property1(X18,honest,pos)
| ~ property1(X18,industrious,pos)
| ~ person(X18) ),
inference(cnf_transformation,[],[f15]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.13 % Problem : PUZ129+2 : TPTP v8.1.0. Released v4.0.0.
% 0.08/0.13 % Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_sat --cores 0 -t %d %s
% 0.15/0.35 % Computer : n011.cluster.edu
% 0.15/0.35 % Model : x86_64 x86_64
% 0.15/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.35 % Memory : 8042.1875MB
% 0.15/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.35 % CPULimit : 300
% 0.15/0.35 % WCLimit : 300
% 0.15/0.35 % DateTime : Tue Aug 30 11:09:25 EDT 2022
% 0.15/0.35 % CPUTime :
% 0.21/0.49 % (25759)dis+10_1:1_fsd=on:sp=occurrence:i=7:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/7Mi)
% 0.21/0.49 % (25759)First to succeed.
% 0.21/0.50 % (25768)dis+34_1:32_abs=on:add=off:bsr=on:gsp=on:sp=weighted_frequency:i=99:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/99Mi)
% 0.21/0.50 % (25759)Refutation found. Thanks to Tanya!
% 0.21/0.50 % SZS status Theorem for theBenchmark
% 0.21/0.50 % SZS output start Proof for theBenchmark
% See solution above
% 0.21/0.50 % (25759)------------------------------
% 0.21/0.50 % (25759)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.21/0.50 % (25759)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.21/0.50 % (25759)Termination reason: Refutation
% 0.21/0.50
% 0.21/0.50 % (25759)Memory used [KB]: 5500
% 0.21/0.50 % (25759)Time elapsed: 0.069 s
% 0.21/0.50 % (25759)Instructions burned: 4 (million)
% 0.21/0.50 % (25759)------------------------------
% 0.21/0.50 % (25759)------------------------------
% 0.21/0.50 % (25751)Success in time 0.145 s
%------------------------------------------------------------------------------