TSTP Solution File: PUZ008-3 by Vampire-SAT---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire-SAT---4.8
% Problem : PUZ008-3 : TPTP v8.1.2. Released v1.2.0.
% Transfm : none
% Format : tptp:raw
% Command : vampire --mode casc_sat -m 16384 --cores 7 -t %d %s
% Computer : n023.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:44:51 EDT 2024
% Result : Unsatisfiable 0.19s 0.37s
% Output : Refutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 34
% Number of leaves : 12
% Syntax : Number of formulae : 53 ( 23 unt; 0 def)
% Number of atoms : 106 ( 0 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 107 ( 54 ~; 53 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 3 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 : 38 ( 38 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f134,plain,
$false,
inference(subsumption_resolution,[],[f133,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(f133,plain,
achievable(west(m(n0),c(n0)),boatoneast,east(m(s(s(s(n0)))),c(s(s(s(n0)))))),
inference(subsumption_resolution,[],[f132,f1]) ).
fof(f1,axiom,
! [X0] : safe(n0,X0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',no_missionaries_is_safe) ).
fof(f132,plain,
( ~ safe(n0,n0)
| achievable(west(m(n0),c(n0)),boatoneast,east(m(s(s(s(n0)))),c(s(s(s(n0)))))) ),
inference(subsumption_resolution,[],[f129,f24]) ).
fof(f24,plain,
! [X0] : safe(s(s(s(X0))),s(s(s(n0)))),
inference(resolution,[],[f21,f2]) ).
fof(f2,axiom,
! [X0,X1] :
( ~ greater_or_equal(X0,X1)
| safe(X0,X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',same_or_more_missionaries_is_safe) ).
fof(f21,plain,
! [X0] : greater_or_equal(s(s(s(X0))),s(s(s(n0)))),
inference(resolution,[],[f19,f4]) ).
fof(f4,axiom,
! [X0,X1] :
( ~ greater_or_equal(X0,X1)
| greater_or_equal(s(X0),s(X1)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',great_eq_recursive) ).
fof(f19,plain,
! [X0] : greater_or_equal(s(s(X0)),s(s(n0))),
inference(resolution,[],[f18,f4]) ).
fof(f18,plain,
! [X0] : greater_or_equal(s(X0),s(n0)),
inference(resolution,[],[f4,f3]) ).
fof(f3,axiom,
! [X0] : greater_or_equal(X0,n0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',great_eq_base) ).
fof(f129,plain,
( ~ safe(s(s(s(n0))),s(s(s(n0))))
| ~ safe(n0,n0)
| achievable(west(m(n0),c(n0)),boatoneast,east(m(s(s(s(n0)))),c(s(s(s(n0)))))) ),
inference(resolution,[],[f126,f13]) ).
fof(f13,axiom,
! [X2,X3,X0,X1] :
( ~ achievable(west(m(s(X0)),c(s(X1))),boatonwest,east(m(X2),c(X3)))
| ~ safe(s(X2),s(X3))
| ~ safe(X0,X1)
| achievable(west(m(X0),c(X1)),boatoneast,east(m(s(X2)),c(s(X3)))) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',missionary_and_cannibal_west_to_east) ).
fof(f126,plain,
achievable(west(m(s(n0)),c(s(n0))),boatonwest,east(m(s(s(n0))),c(s(s(n0))))),
inference(subsumption_resolution,[],[f125,f22]) ).
fof(f22,plain,
! [X0] : safe(s(s(X0)),s(s(n0))),
inference(resolution,[],[f19,f2]) ).
fof(f125,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))))) ),
inference(subsumption_resolution,[],[f122,f20]) ).
fof(f20,plain,
! [X0] : safe(s(X0),s(n0)),
inference(resolution,[],[f18,f2]) ).
fof(f122,plain,
( ~ safe(s(n0),s(n0))
| ~ 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))))) ),
inference(resolution,[],[f119,f10]) ).
fof(f10,axiom,
! [X2,X3,X0,X1] :
( ~ achievable(west(m(X0),c(X1)),boatoneast,east(m(s(X2)),c(X3)))
| ~ safe(s(X0),X1)
| ~ safe(X2,X3)
| achievable(west(m(s(X0)),c(X1)),boatonwest,east(m(X2),c(X3))) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',missionary_east_to_west) ).
fof(f119,plain,
achievable(west(m(n0),c(s(n0))),boatoneast,east(m(s(s(s(n0)))),c(s(s(n0))))),
inference(subsumption_resolution,[],[f118,f1]) ).
fof(f118,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,[],[f116,f22]) ).
fof(f116,plain,
( ~ safe(s(s(s(n0))),s(s(n0)))
| ~ safe(n0,s(n0))
| achievable(west(m(n0),c(s(n0))),boatoneast,east(m(s(s(s(n0)))),c(s(s(n0))))) ),
inference(resolution,[],[f115,f7]) ).
fof(f7,axiom,
! [X2,X3,X0,X1] :
( ~ achievable(west(m(X0),c(s(s(X1)))),boatonwest,east(m(X2),c(X3)))
| ~ safe(X2,s(s(X3)))
| ~ safe(X0,X1)
| achievable(west(m(X0),c(X1)),boatoneast,east(m(X2),c(s(s(X3))))) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',two_cannibals_west_to_east) ).
fof(f115,plain,
achievable(west(m(n0),c(s(s(s(n0))))),boatonwest,east(m(s(s(s(n0)))),c(n0))),
inference(subsumption_resolution,[],[f114,f17]) ).
fof(f17,plain,
! [X0] : safe(X0,n0),
inference(resolution,[],[f2,f3]) ).
fof(f114,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,[],[f113,f1]) ).
fof(f113,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,f6]) ).
fof(f6,axiom,
! [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))) ),
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,f1]) ).
fof(f108,plain,
( ~ safe(n0,s(s(n0)))
| achievable(west(m(n0),c(s(s(n0)))),boatoneast,east(m(s(s(s(n0)))),c(s(n0)))) ),
inference(subsumption_resolution,[],[f104,f20]) ).
fof(f104,plain,
( ~ safe(s(s(s(n0))),s(n0))
| ~ safe(n0,s(s(n0)))
| achievable(west(m(n0),c(s(s(n0)))),boatoneast,east(m(s(s(s(n0)))),c(s(n0)))) ),
inference(resolution,[],[f102,f11]) ).
fof(f11,axiom,
! [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))) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',two_missionaries_west_to_east) ).
fof(f102,plain,
achievable(west(m(s(s(n0))),c(s(s(n0)))),boatonwest,east(m(s(n0)),c(s(n0)))),
inference(subsumption_resolution,[],[f101,f20]) ).
fof(f101,plain,
( ~ safe(s(n0),s(n0))
| achievable(west(m(s(s(n0))),c(s(s(n0)))),boatonwest,east(m(s(n0)),c(s(n0)))) ),
inference(subsumption_resolution,[],[f100,f22]) ).
fof(f100,plain,
( ~ safe(s(s(n0)),s(s(n0)))
| ~ safe(s(n0),s(n0))
| achievable(west(m(s(s(n0))),c(s(s(n0)))),boatonwest,east(m(s(n0)),c(s(n0)))) ),
inference(resolution,[],[f14,f87]) ).
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,f20]) ).
fof(f86,plain,
( ~ safe(s(n0),s(n0))
| achievable(west(m(s(n0)),c(s(n0))),boatoneast,east(m(s(s(n0))),c(s(s(n0))))) ),
inference(subsumption_resolution,[],[f83,f22]) ).
fof(f83,plain,
( ~ safe(s(s(n0)),s(s(n0)))
| ~ safe(s(n0),s(n0))
| achievable(west(m(s(n0)),c(s(n0))),boatoneast,east(m(s(s(n0))),c(s(s(n0))))) ),
inference(resolution,[],[f11,f73]) ).
fof(f73,plain,
achievable(west(m(s(s(s(n0)))),c(s(n0))),boatonwest,east(m(n0),c(s(s(n0))))),
inference(subsumption_resolution,[],[f72,f1]) ).
fof(f72,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,[],[f71,f20]) ).
fof(f71,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,[],[f67,f6]) ).
fof(f67,plain,
achievable(west(m(s(s(s(n0)))),c(n0)),boatoneast,east(m(n0),c(s(s(s(n0)))))),
inference(subsumption_resolution,[],[f66,f17]) ).
fof(f66,plain,
( ~ safe(s(s(s(n0))),n0)
| achievable(west(m(s(s(s(n0)))),c(n0)),boatoneast,east(m(n0),c(s(s(s(n0)))))) ),
inference(subsumption_resolution,[],[f62,f1]) ).
fof(f62,plain,
( ~ safe(n0,s(s(s(n0))))
| ~ safe(s(s(s(n0))),n0)
| achievable(west(m(s(s(s(n0)))),c(n0)),boatoneast,east(m(n0),c(s(s(s(n0)))))) ),
inference(resolution,[],[f60,f7]) ).
fof(f60,plain,
achievable(west(m(s(s(s(n0)))),c(s(s(n0)))),boatonwest,east(m(n0),c(s(n0)))),
inference(subsumption_resolution,[],[f59,f1]) ).
fof(f59,plain,
( ~ safe(n0,s(n0))
| achievable(west(m(s(s(s(n0)))),c(s(s(n0)))),boatonwest,east(m(n0),c(s(n0)))) ),
inference(subsumption_resolution,[],[f58,f22]) ).
fof(f58,plain,
( ~ safe(s(s(s(n0))),s(s(n0)))
| ~ safe(n0,s(n0))
| achievable(west(m(s(s(s(n0)))),c(s(s(n0)))),boatonwest,east(m(n0),c(s(n0)))) ),
inference(resolution,[],[f57,f6]) ).
fof(f57,plain,
achievable(west(m(s(s(s(n0)))),c(s(n0))),boatoneast,east(m(n0),c(s(s(n0))))),
inference(subsumption_resolution,[],[f56,f20]) ).
fof(f56,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,[],[f55,f1]) ).
fof(f55,plain,
( ~ safe(n0,s(s(n0)))
| ~ 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(resolution,[],[f7,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) ).
fof(f14,axiom,
! [X2,X3,X0,X1] :
( ~ achievable(west(m(X0),c(X1)),boatoneast,east(m(s(X2)),c(s(X3))))
| ~ safe(s(X0),s(X1))
| ~ safe(X2,X3)
| 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) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.12 % Problem : PUZ008-3 : TPTP v8.1.2. Released v1.2.0.
% 0.13/0.13 % Command : vampire --mode casc_sat -m 16384 --cores 7 -t %d %s
% 0.13/0.34 % Computer : n023.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Tue Apr 30 02:13:40 EDT 2024
% 0.13/0.34 % CPUTime :
% 0.13/0.35 % (9278)Running in auto input_syntax mode. Trying TPTP
% 0.19/0.36 % (9282)fmb+10_1_bce=on:fmbas=expand:fmbksg=on:fmbsr=1.3:gsp=on:nm=4_470 on theBenchmark for (470ds/0Mi)
% 0.19/0.37 % (9281)dis-2_2:3_amm=sco:anc=none:bce=on:fsr=off:gsp=on:nm=16:nwc=1.2:nicw=on:sac=on:sp=weighted_frequency_476 on theBenchmark for (476ds/0Mi)
% 0.19/0.37 % (9279)fmb+10_1_fmbas=off:fmbsr=1.3:nm=2_1451 on theBenchmark for (1451ds/0Mi)
% 0.19/0.37 % (9283)dis+1_20_av=off:lcm=predicate:nm=2:nwc=2.0_396 on theBenchmark for (396ds/0Mi)
% 0.19/0.37 % (9284)dis+11_4:5_nm=4_216 on theBenchmark for (216ds/0Mi)
% 0.19/0.37 % (9280)fmb+10_1_bce=on:fmbas=expand:fmbksg=on:fmbsr=1.3_569 on theBenchmark for (569ds/0Mi)
% 0.19/0.37 % (9285)fmb+10_1_fmbas=off:fmbsr=1.3:nm=2:si=on:rtra=on:rawr=on:rp=on:fmbksg=on_1451 on theBenchmark for (1451ds/0Mi)
% 0.19/0.37 % (9283)First to succeed.
% 0.19/0.37 % (9284)Also succeeded, but the first one will report.
% 0.19/0.37 Detected minimum model sizes of [1,1]
% 0.19/0.37 Detected maximum model sizes of [max,2]
% 0.19/0.37 TRYING [1,1]
% 0.19/0.37 % (9281)Also succeeded, but the first one will report.
% 0.19/0.37 % (9283)Refutation found. Thanks to Tanya!
% 0.19/0.37 % SZS status Unsatisfiable for theBenchmark
% 0.19/0.37 % SZS output start Proof for theBenchmark
% See solution above
% 0.19/0.37 % (9283)------------------------------
% 0.19/0.37 % (9283)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.19/0.37 % (9283)Termination reason: Refutation
% 0.19/0.37
% 0.19/0.37 % (9283)Memory used [KB]: 770
% 0.19/0.37 % (9283)Time elapsed: 0.006 s
% 0.19/0.37 % (9283)Instructions burned: 9 (million)
% 0.19/0.37 % (9283)------------------------------
% 0.19/0.37 % (9283)------------------------------
% 0.19/0.37 % (9278)Success in time 0.023 s
%------------------------------------------------------------------------------