TSTP Solution File: PUZ008-3 by SnakeForV-SAT---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV-SAT---1.0
% Problem : PUZ008-3 : TPTP v8.1.0. Released v1.2.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 : n005.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:11:29 EDT 2022
% Result : Unsatisfiable 0.20s 0.58s
% Output : Refutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 33
% Number of leaves : 12
% Syntax : Number of formulae : 65 ( 24 unt; 0 def)
% Number of atoms : 141 ( 0 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 155 ( 79 ~; 76 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 4 avg)
% Maximal term depth : 6 ( 2 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-3 aty)
% Number of functors : 8 ( 8 usr; 3 con; 0-2 aty)
% Number of variables : 78 ( 78 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f143,plain,
$false,
inference(subsumption_resolution,[],[f142,f30]) ).
fof(f30,plain,
! [X0] : safe(n0,X0),
inference(literal_reordering,[],[f1]) ).
fof(f1,axiom,
! [X0] : safe(n0,X0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',no_missionaries_is_safe) ).
fof(f142,plain,
~ safe(n0,n0),
inference(subsumption_resolution,[],[f138,f29]) ).
fof(f29,plain,
! [X0] : ~ achievable(west(m(n0),c(n0)),X0,east(m(s(s(s(n0)))),c(s(s(s(n0)))))),
inference(literal_reordering,[],[f16]) ).
fof(f16,axiom,
! [X0] : ~ achievable(west(m(n0),c(n0)),X0,east(m(s(s(s(n0)))),c(s(s(s(n0)))))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_can_get_to_east_bank) ).
fof(f138,plain,
( achievable(west(m(n0),c(n0)),boatoneast,east(m(s(s(s(n0)))),c(s(s(s(n0))))))
| ~ safe(n0,n0) ),
inference(resolution,[],[f135,f78]) ).
fof(f78,plain,
! [X3,X4,X5] :
( ~ achievable(west(m(s(X3)),c(s(X4))),boatonwest,east(m(s(s(X5))),c(s(s(n0)))))
| ~ safe(X3,X4)
| achievable(west(m(X3),c(X4)),boatoneast,east(m(s(s(s(X5)))),c(s(s(s(n0)))))) ),
inference(resolution,[],[f67,f24]) ).
fof(f24,plain,
! [X2,X3,X0,X1] :
( ~ safe(s(X2),s(X3))
| ~ safe(X0,X1)
| ~ achievable(west(m(s(X0)),c(s(X1))),boatonwest,east(m(X2),c(X3)))
| achievable(west(m(X0),c(X1)),boatoneast,east(m(s(X2)),c(s(X3)))) ),
inference(literal_reordering,[],[f13]) ).
fof(f13,axiom,
! [X2,X3,X0,X1] :
( achievable(west(m(X0),c(X1)),boatoneast,east(m(s(X2)),c(s(X3))))
| ~ achievable(west(m(s(X0)),c(s(X1))),boatonwest,east(m(X2),c(X3)))
| ~ safe(X0,X1)
| ~ safe(s(X2),s(X3)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',missionary_and_cannibal_west_to_east) ).
fof(f67,plain,
! [X0] : safe(s(s(s(X0))),s(s(s(n0)))),
inference(resolution,[],[f49,f25]) ).
fof(f25,plain,
! [X0] : greater_or_equal(X0,n0),
inference(literal_reordering,[],[f3]) ).
fof(f3,axiom,
! [X0] : greater_or_equal(X0,n0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',great_eq_base) ).
fof(f49,plain,
! [X2,X1] :
( ~ greater_or_equal(X1,X2)
| safe(s(s(s(X1))),s(s(s(X2)))) ),
inference(resolution,[],[f42,f26]) ).
fof(f26,plain,
! [X0,X1] :
( greater_or_equal(s(X0),s(X1))
| ~ greater_or_equal(X0,X1) ),
inference(literal_reordering,[],[f4]) ).
fof(f4,axiom,
! [X0,X1] :
( greater_or_equal(s(X0),s(X1))
| ~ greater_or_equal(X0,X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',great_eq_recursive) ).
fof(f42,plain,
! [X2,X1] :
( ~ greater_or_equal(X1,X2)
| safe(s(s(X1)),s(s(X2))) ),
inference(resolution,[],[f34,f26]) ).
fof(f34,plain,
! [X0,X1] :
( ~ greater_or_equal(X0,X1)
| safe(s(X0),s(X1)) ),
inference(resolution,[],[f26,f22]) ).
fof(f22,plain,
! [X0,X1] :
( ~ greater_or_equal(X0,X1)
| safe(X0,X1) ),
inference(literal_reordering,[],[f2]) ).
fof(f2,axiom,
! [X0,X1] :
( safe(X0,X1)
| ~ greater_or_equal(X0,X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',same_or_more_missionaries_is_safe) ).
fof(f135,plain,
achievable(west(m(s(n0)),c(s(n0))),boatonwest,east(m(s(s(n0))),c(s(s(n0))))),
inference(subsumption_resolution,[],[f134,f41]) ).
fof(f41,plain,
! [X0] : safe(s(X0),s(n0)),
inference(resolution,[],[f34,f25]) ).
fof(f134,plain,
( ~ safe(s(n0),s(n0))
| achievable(west(m(s(n0)),c(s(n0))),boatonwest,east(m(s(s(n0))),c(s(s(n0))))) ),
inference(subsumption_resolution,[],[f131,f48]) ).
fof(f48,plain,
! [X0] : safe(s(s(X0)),s(s(n0))),
inference(resolution,[],[f42,f25]) ).
fof(f131,plain,
( ~ safe(s(s(n0)),s(s(n0)))
| achievable(west(m(s(n0)),c(s(n0))),boatonwest,east(m(s(s(n0))),c(s(s(n0)))))
| ~ safe(s(n0),s(n0)) ),
inference(resolution,[],[f127,f19]) ).
fof(f19,plain,
! [X2,X3,X0,X1] :
( ~ achievable(west(m(X0),c(X1)),boatoneast,east(m(s(X2)),c(X3)))
| achievable(west(m(s(X0)),c(X1)),boatonwest,east(m(X2),c(X3)))
| ~ safe(X2,X3)
| ~ safe(s(X0),X1) ),
inference(literal_reordering,[],[f10]) ).
fof(f10,axiom,
! [X2,X3,X0,X1] :
( ~ safe(s(X0),X1)
| achievable(west(m(s(X0)),c(X1)),boatonwest,east(m(X2),c(X3)))
| ~ safe(X2,X3)
| ~ achievable(west(m(X0),c(X1)),boatoneast,east(m(s(X2)),c(X3))) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',missionary_east_to_west) ).
fof(f127,plain,
achievable(west(m(n0),c(s(n0))),boatoneast,east(m(s(s(s(n0)))),c(s(s(n0))))),
inference(subsumption_resolution,[],[f126,f30]) ).
fof(f126,plain,
( ~ safe(n0,s(n0))
| achievable(west(m(n0),c(s(n0))),boatoneast,east(m(s(s(s(n0)))),c(s(s(n0))))) ),
inference(subsumption_resolution,[],[f124,f48]) ).
fof(f124,plain,
( achievable(west(m(n0),c(s(n0))),boatoneast,east(m(s(s(s(n0)))),c(s(s(n0)))))
| ~ safe(s(s(s(n0))),s(s(n0)))
| ~ safe(n0,s(n0)) ),
inference(resolution,[],[f119,f23]) ).
fof(f23,plain,
! [X2,X3,X0,X1] :
( ~ achievable(west(m(X0),c(s(s(X1)))),boatonwest,east(m(X2),c(X3)))
| achievable(west(m(X0),c(X1)),boatoneast,east(m(X2),c(s(s(X3)))))
| ~ safe(X0,X1)
| ~ safe(X2,s(s(X3))) ),
inference(literal_reordering,[],[f7]) ).
fof(f7,axiom,
! [X2,X3,X0,X1] :
( achievable(west(m(X0),c(X1)),boatoneast,east(m(X2),c(s(s(X3)))))
| ~ safe(X0,X1)
| ~ achievable(west(m(X0),c(s(s(X1)))),boatonwest,east(m(X2),c(X3)))
| ~ safe(X2,s(s(X3))) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',two_cannibals_west_to_east) ).
fof(f119,plain,
achievable(west(m(n0),c(s(s(s(n0))))),boatonwest,east(m(s(s(s(n0)))),c(n0))),
inference(subsumption_resolution,[],[f118,f33]) ).
fof(f33,plain,
! [X0] : safe(X0,n0),
inference(resolution,[],[f22,f25]) ).
fof(f118,plain,
( ~ safe(s(s(s(n0))),n0)
| achievable(west(m(n0),c(s(s(s(n0))))),boatonwest,east(m(s(s(s(n0)))),c(n0))) ),
inference(subsumption_resolution,[],[f117,f30]) ).
fof(f117,plain,
( ~ safe(n0,s(s(s(n0))))
| ~ safe(s(s(s(n0))),n0)
| achievable(west(m(n0),c(s(s(s(n0))))),boatonwest,east(m(s(s(s(n0)))),c(n0))) ),
inference(resolution,[],[f109,f21]) ).
fof(f21,plain,
! [X2,X3,X0,X1] :
( ~ achievable(west(m(X0),c(X1)),boatoneast,east(m(X2),c(s(X3))))
| ~ safe(X0,s(X1))
| ~ safe(X2,X3)
| achievable(west(m(X0),c(s(X1))),boatonwest,east(m(X2),c(X3))) ),
inference(literal_reordering,[],[f6]) ).
fof(f6,axiom,
! [X2,X3,X0,X1] :
( ~ safe(X0,s(X1))
| ~ safe(X2,X3)
| achievable(west(m(X0),c(s(X1))),boatonwest,east(m(X2),c(X3)))
| ~ achievable(west(m(X0),c(X1)),boatoneast,east(m(X2),c(s(X3)))) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cannibal_east_to_west) ).
fof(f109,plain,
achievable(west(m(n0),c(s(s(n0)))),boatoneast,east(m(s(s(s(n0)))),c(s(n0)))),
inference(subsumption_resolution,[],[f108,f41]) ).
fof(f108,plain,
( ~ safe(s(s(s(n0))),s(n0))
| achievable(west(m(n0),c(s(s(n0)))),boatoneast,east(m(s(s(s(n0)))),c(s(n0)))) ),
inference(subsumption_resolution,[],[f104,f30]) ).
fof(f104,plain,
( ~ safe(n0,s(s(n0)))
| ~ safe(s(s(s(n0))),s(n0))
| achievable(west(m(n0),c(s(s(n0)))),boatoneast,east(m(s(s(s(n0)))),c(s(n0)))) ),
inference(resolution,[],[f96,f28]) ).
fof(f28,plain,
! [X2,X3,X0,X1] :
( ~ achievable(west(m(s(s(X0))),c(X1)),boatonwest,east(m(X2),c(X3)))
| ~ safe(s(s(X2)),X3)
| ~ safe(X0,X1)
| achievable(west(m(X0),c(X1)),boatoneast,east(m(s(s(X2))),c(X3))) ),
inference(literal_reordering,[],[f11]) ).
fof(f11,axiom,
! [X2,X3,X0,X1] :
( ~ safe(s(s(X2)),X3)
| achievable(west(m(X0),c(X1)),boatoneast,east(m(s(s(X2))),c(X3)))
| ~ safe(X0,X1)
| ~ achievable(west(m(s(s(X0))),c(X1)),boatonwest,east(m(X2),c(X3))) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',two_missionaries_west_to_east) ).
fof(f96,plain,
achievable(west(m(s(s(n0))),c(s(s(n0)))),boatonwest,east(m(s(n0)),c(s(n0)))),
inference(subsumption_resolution,[],[f91,f41]) ).
fof(f91,plain,
( achievable(west(m(s(s(n0))),c(s(s(n0)))),boatonwest,east(m(s(n0)),c(s(n0))))
| ~ safe(s(n0),s(n0)) ),
inference(resolution,[],[f87,f55]) ).
fof(f55,plain,
! [X2,X0,X1] :
( ~ achievable(west(m(s(X2)),c(s(n0))),boatoneast,east(m(s(X0)),c(s(X1))))
| achievable(west(m(s(s(X2))),c(s(s(n0)))),boatonwest,east(m(X0),c(X1)))
| ~ safe(X0,X1) ),
inference(resolution,[],[f48,f32]) ).
fof(f32,plain,
! [X2,X3,X0,X1] :
( ~ safe(s(X0),s(X1))
| ~ safe(X2,X3)
| ~ achievable(west(m(X0),c(X1)),boatoneast,east(m(s(X2)),c(s(X3))))
| achievable(west(m(s(X0)),c(s(X1))),boatonwest,east(m(X2),c(X3))) ),
inference(literal_reordering,[],[f14]) ).
fof(f14,axiom,
! [X2,X3,X0,X1] :
( ~ safe(X2,X3)
| ~ achievable(west(m(X0),c(X1)),boatoneast,east(m(s(X2)),c(s(X3))))
| ~ safe(s(X0),s(X1))
| achievable(west(m(s(X0)),c(s(X1))),boatonwest,east(m(X2),c(X3))) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',missionary_and_cannibal_east_to_west) ).
fof(f87,plain,
achievable(west(m(s(n0)),c(s(n0))),boatoneast,east(m(s(s(n0))),c(s(s(n0))))),
inference(subsumption_resolution,[],[f86,f41]) ).
fof(f86,plain,
( achievable(west(m(s(n0)),c(s(n0))),boatoneast,east(m(s(s(n0))),c(s(s(n0)))))
| ~ safe(s(n0),s(n0)) ),
inference(subsumption_resolution,[],[f83,f48]) ).
fof(f83,plain,
( achievable(west(m(s(n0)),c(s(n0))),boatoneast,east(m(s(s(n0))),c(s(s(n0)))))
| ~ safe(s(s(n0)),s(s(n0)))
| ~ safe(s(n0),s(n0)) ),
inference(resolution,[],[f75,f28]) ).
fof(f75,plain,
achievable(west(m(s(s(s(n0)))),c(s(n0))),boatonwest,east(m(n0),c(s(s(n0))))),
inference(subsumption_resolution,[],[f74,f30]) ).
fof(f74,plain,
( ~ safe(n0,s(s(n0)))
| achievable(west(m(s(s(s(n0)))),c(s(n0))),boatonwest,east(m(n0),c(s(s(n0))))) ),
inference(subsumption_resolution,[],[f73,f41]) ).
fof(f73,plain,
( ~ safe(s(s(s(n0))),s(n0))
| ~ safe(n0,s(s(n0)))
| achievable(west(m(s(s(s(n0)))),c(s(n0))),boatonwest,east(m(n0),c(s(s(n0))))) ),
inference(resolution,[],[f66,f21]) ).
fof(f66,plain,
achievable(west(m(s(s(s(n0)))),c(n0)),boatoneast,east(m(n0),c(s(s(s(n0)))))),
inference(subsumption_resolution,[],[f65,f30]) ).
fof(f65,plain,
( achievable(west(m(s(s(s(n0)))),c(n0)),boatoneast,east(m(n0),c(s(s(s(n0))))))
| ~ safe(n0,s(s(s(n0)))) ),
inference(subsumption_resolution,[],[f60,f33]) ).
fof(f60,plain,
( achievable(west(m(s(s(s(n0)))),c(n0)),boatoneast,east(m(n0),c(s(s(s(n0))))))
| ~ safe(s(s(s(n0))),n0)
| ~ safe(n0,s(s(s(n0)))) ),
inference(resolution,[],[f53,f23]) ).
fof(f53,plain,
achievable(west(m(s(s(s(n0)))),c(s(s(n0)))),boatonwest,east(m(n0),c(s(n0)))),
inference(subsumption_resolution,[],[f52,f48]) ).
fof(f52,plain,
( ~ safe(s(s(s(n0))),s(s(n0)))
| achievable(west(m(s(s(s(n0)))),c(s(s(n0)))),boatonwest,east(m(n0),c(s(n0)))) ),
inference(subsumption_resolution,[],[f51,f30]) ).
fof(f51,plain,
( achievable(west(m(s(s(s(n0)))),c(s(s(n0)))),boatonwest,east(m(n0),c(s(n0))))
| ~ safe(s(s(s(n0))),s(s(n0)))
| ~ safe(n0,s(n0)) ),
inference(resolution,[],[f45,f21]) ).
fof(f45,plain,
achievable(west(m(s(s(s(n0)))),c(s(n0))),boatoneast,east(m(n0),c(s(s(n0))))),
inference(subsumption_resolution,[],[f40,f41]) ).
fof(f40,plain,
( ~ safe(s(s(s(n0))),s(n0))
| achievable(west(m(s(s(s(n0)))),c(s(n0))),boatoneast,east(m(n0),c(s(s(n0))))) ),
inference(subsumption_resolution,[],[f39,f30]) ).
fof(f39,plain,
( ~ safe(n0,s(s(n0)))
| achievable(west(m(s(s(s(n0)))),c(s(n0))),boatoneast,east(m(n0),c(s(s(n0)))))
| ~ safe(s(s(s(n0))),s(n0)) ),
inference(resolution,[],[f23,f17]) ).
fof(f17,plain,
achievable(west(m(s(s(s(n0)))),c(s(s(s(n0))))),boatonwest,east(m(n0),c(n0))),
inference(literal_reordering,[],[f15]) ).
fof(f15,axiom,
achievable(west(m(s(s(s(n0)))),c(s(s(s(n0))))),boatonwest,east(m(n0),c(n0))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',start_on_west_bank) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : PUZ008-3 : TPTP v8.1.0. Released v1.2.0.
% 0.07/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.13/0.35 % Computer : n005.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Tue Aug 30 10:35:48 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.20/0.54 % (25822)ins+10_1:1_awrs=decay:awrsf=30:bsr=unit_only:foolp=on:igrr=8/457:igs=10:igwr=on:nwc=1.5:sp=weighted_frequency:to=lpo:uhcvi=on:i=68:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/68Mi)
% 0.20/0.55 % (25831)ott+11_1:1_drc=off:nwc=5.0:slsq=on:slsqc=1:spb=goal_then_units:to=lpo:i=467:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/467Mi)
% 0.20/0.55 % (25823)ott+11_2:3_av=off:fde=unused:nwc=5.0:tgt=ground:i=75:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/75Mi)
% 0.20/0.56 % (25822)First to succeed.
% 0.20/0.56 % (25814)fmb+10_1:1_fmbsr=2.0:nm=4:skr=on:i=51:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/51Mi)
% 0.20/0.56 % (25815)dis+10_1:1_fsd=on:sp=occurrence:i=7:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/7Mi)
% 0.20/0.58 % (25830)dis+21_1:1_av=off:er=filter:slsq=on:slsqc=0:slsqr=1,1:sp=frequency:to=lpo:i=498:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/498Mi)
% 0.20/0.58 % (25815)Also succeeded, but the first one will report.
% 0.20/0.58 % (25822)Refutation found. Thanks to Tanya!
% 0.20/0.58 % SZS status Unsatisfiable for theBenchmark
% 0.20/0.58 % SZS output start Proof for theBenchmark
% See solution above
% 0.20/0.58 % (25822)------------------------------
% 0.20/0.58 % (25822)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.20/0.58 % (25822)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.20/0.58 % (25822)Termination reason: Refutation
% 0.20/0.58
% 0.20/0.58 % (25822)Memory used [KB]: 5884
% 0.20/0.58 % (25822)Time elapsed: 0.013 s
% 0.20/0.58 % (25822)Instructions burned: 12 (million)
% 0.20/0.58 % (25822)------------------------------
% 0.20/0.58 % (25822)------------------------------
% 0.20/0.58 % (25807)Success in time 0.227 s
%------------------------------------------------------------------------------