%------------------------------------------------------------------------------
% File : LisaST---0.9
% Problem : PUZ008-1 : TPTP v9.3.1. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : casc-portfolio.sh -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% Computer : n017.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 : Sun Sep 27 08:21:32 AM UTC 2026
% Result : Unsatisfiable 11.23s 6.85s
% Output : CNFRefutation 11.23s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 5
% Syntax : Number of clauses : 14 ( 8 unt; 0 nHn; 9 RR)
% Number of literals : 20 ( 0 equ; 8 neg)
% Maximal clause size : 2 ( 1 avg)
% Maximal term depth : 6 ( 2 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 : 43 ( 14 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(cannibal_east_to_west,axiom,
( 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)))) ) ).
cnf(two_cannibals_west_to_east,axiom,
( achievable(west(m(X0),c(X1)),boatoneast,east(m(X2),c(s(s(X3)))))
| ~ achievable(west(m(X0),c(s(s(X1)))),boatonwest,east(m(X2),c(X3))) ) ).
cnf(missionary_and_cannibal_west_to_east,axiom,
( 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))) ) ).
cnf(extra_cannibal_meal_on_west_bank,axiom,
achievable(west(m(s(X0)),c(s(s(X0)))),X1,east(X2,X3)) ).
cnf(prove_can_get_to_east_bank,negated_conjecture,
~ achievable(west(m(n0),c(n0)),X0,east(m(s(s(s(n0)))),c(s(s(s(n0)))))) ).
cnf(c1,plain,
( 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)))) ),
inference(clausification,[status(esa)],[cannibal_east_to_west]) ).
cnf(c2,plain,
( achievable(west(m(X0),c(X1)),boatoneast,east(m(X2),c(s(s(X3)))))
| ~ achievable(west(m(X0),c(s(s(X1)))),boatonwest,east(m(X2),c(X3))) ),
inference(clausification,[status(esa)],[two_cannibals_west_to_east]) ).
cnf(c8,plain,
( 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(clausification,[status(esa)],[missionary_and_cannibal_west_to_east]) ).
cnf(c10,plain,
achievable(west(m(s(X0)),c(s(s(X0)))),X1,east(X2,X3)),
inference(clausification,[status(esa)],[extra_cannibal_meal_on_west_bank]) ).
cnf(c15,plain,
~ achievable(west(m(n0),c(n0)),X0,east(m(s(s(s(n0)))),c(s(s(s(n0)))))),
inference(clausification,[status(esa)],[prove_can_get_to_east_bank]) ).
cnf(d0,plain,
achievable(west(m(s(X0)),c(X0)),boatoneast,east(m(X1),c(s(s(X2))))),
inference(resolution,[status(thm)],[c2,c10]) ).
cnf(d1,plain,
achievable(west(m(s(X0)),c(s(X0))),boatonwest,east(m(X1),c(s(X2)))),
inference(resolution,[status(thm)],[d0,c1]) ).
cnf(d2,plain,
achievable(west(m(X0),c(X0)),boatoneast,east(m(s(X1)),c(s(s(X2))))),
inference(resolution,[status(thm)],[d1,c8]) ).
cnf(d3,plain,
$false,
inference(resolution,[status(thm)],[d2,c15]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : PUZ008-1 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.04 % Command : casc-portfolio.sh -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.10/5.37 % Computer : n017.cluster.edu
% 0.10/5.37 % Model : x86_64 x86_64
% 0.10/5.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/5.37 % Memory : 8046.5625MB
% 0.10/5.37 % OS : Linux 6.8.0-71-generic
% 0.10/5.37 % CPULimit : 300
% 0.10/5.37 % WCLimit : 300
% 0.10/5.37 % DateTime : Sat Sep 26 04:58:38 UTC 2026
% 0.10/5.37 % CPUTime :
% 0.10/5.37 Running casc-portfolio.sh -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 11.23/6.85 % SZS status Unsatisfiable for theBenchmark.p
% 11.23/6.85 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
%------------------------------------------------------------------------------