%------------------------------------------------------------------------------
% File : ConnectPP---0.7.2
% Problem : PUZ008-1 : TPTP v9.3.1. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : /export/starexec/sandbox2/solver/bin/connect++ --verbosity 1 --no-colour --tptp-proof --schedule default --timeout 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% Computer : n012.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8046.5625MB
% OS : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Thu Sep 24 08:54:16 AM UTC 2026
% Result : Unsatisfiable 0.03s 0.32s
% Output : Proof 0.03s
% Verified :
% SZS Type : Refutation
% Derivation depth : 2
% Number of leaves : 3
% Syntax : Number of clauses : 8 ( 6 unt; 0 nHn; 7 RR)
% Number of literals : 10 ( 0 equ; 4 neg)
% Maximal clause size : 2 ( 1 avg)
% Maximal term depth : 6 ( 3 avg)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-3 aty)
% Number of functors : 8 ( 8 usr; 3 con; 0-2 aty)
% Number of variables : 9 ( 4 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(two_missionaries_west_to_east,axiom,
( achievable(west(m(X),c(Y)),boatoneast,east(m(s(s(Z))),c(W)))
| ~ achievable(west(m(s(s(X))),c(Y)),boatonwest,east(m(Z),c(W))) ),
file('theBenchmark.p',two_missionaries_west_to_east) ).
cnf(two_extra_cannibals_meal_on_east_bank,axiom,
achievable(west(X,Y),Z,east(m(s(W)),c(s(s(s(W)))))),
file('theBenchmark.p',two_extra_cannibals_meal_on_east_bank) ).
cnf(prove_can_get_to_east_bank,negated_conjecture,
~ achievable(west(m(n0),c(n0)),X,east(m(s(s(s(n0)))),c(s(s(s(n0)))))),
file('theBenchmark.p',prove_can_get_to_east_bank) ).
cnf(t1,plain,
~ achievable(west(m(n0),c(n0)),boatoneast,east(m(s(s(s(n0)))),c(s(s(s(n0)))))),
inference(start,[status(thm),parent(0:0)],[prove_can_get_to_east_bank]) ).
cnf(t2,plain,
( ~ achievable(west(m(s(s(n0))),c(n0)),boatonwest,east(m(s(n0)),c(s(s(s(n0))))))
| achievable(west(m(n0),c(n0)),boatoneast,east(m(s(s(s(n0)))),c(s(s(s(n0)))))) ),
inference(extension,[status(thm),parent(t1:1)],[two_missionaries_west_to_east]) ).
cnf(t3,plain,
$false,
inference(connection,[status(thm),parent(t2:1)],[t2:1,t1:1]) ).
cnf(t4,plain,
achievable(west(m(s(s(n0))),c(n0)),boatonwest,east(m(s(n0)),c(s(s(s(n0)))))),
inference(extension,[status(thm),parent(t2:2)],[two_extra_cannibals_meal_on_east_bank]) ).
cnf(t5,plain,
$false,
inference(connection,[status(thm),parent(t4:1)],[t4:1,t2:2]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.01 % Problem : PUZ008-1 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.01 This is a CNF_UNS_RFO_NEQ_HRN problem
% 0.00/0.02 % Command : /export/starexec/sandbox2/solver/bin/connect++ --verbosity 1 --no-colour --tptp-proof --schedule default --timeout 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.03/0.30 % Computer : n012.cluster.edu
% 0.03/0.30 % Model : x86_64 x86_64
% 0.03/0.30 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.03/0.30 % Memory : 8046.5625MB
% 0.03/0.30 % OS : Linux 6.8.0-71-generic
% 0.03/0.30 % CPULimit : 300
% 0.03/0.30 % WCLimit : 300
% 0.03/0.30 % DateTime : Sat Sep 19 19:54:38 UTC 2026
% 0.03/0.30 % CPUTime :
% 0.03/0.32 % SZS status Unsatisfiable for theBenchmark
% 0.03/0.32 % SZS output start Proof for theBenchmark
% See solution above
%------------------------------------------------------------------------------