%------------------------------------------------------------------------------
% File : CSE_E---1.7
% Problem : PUZ008-1 : TPTP v9.2.1. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : /export/starexec/sandbox2/solver/bin/lemma_parallel_prover %s --lemma-prover /export/starexec/sandbox2/solver/bin/cse --final-prover /export/starexec/sandbox2/solver/bin/eprover --proof-time %d --global-time-limit %d
% Computer : n017.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 May 5 05:02:05 PM UTC 2026
% Result : Unsatisfiable 0.26s 1.62s
% Output : CNFRefutation 0.26s
% Verified :
% SZS Type : Refutation
% Derivation depth : 2
% Number of leaves : 16
% Syntax : Number of clauses : 33 ( 13 unt; 0 nHn; 25 RR)
% Number of literals : 53 ( 0 equ; 22 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 : 114 ( 26 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(prove_can_get_to_east_bank,negated_conjecture,
~ achievable(west(m(n0),c(n0)),X1,east(m(s(s(s(n0)))),c(s(s(s(n0)))))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_can_get_to_east_bank) ).
cnf(two_missionaries_east_to_west,axiom,
( achievable(west(m(s(s(X1))),c(X2)),boatonwest,east(m(X3),c(X4)))
| ~ achievable(west(m(X1),c(X2)),boatoneast,east(m(s(s(X3))),c(X4))) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',two_missionaries_east_to_west) ).
cnf(two_cannibals_east_to_west,axiom,
( achievable(west(m(X1),c(s(s(X2)))),boatonwest,east(m(X3),c(X4)))
| ~ achievable(west(m(X1),c(X2)),boatoneast,east(m(X3),c(s(s(X4))))) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',two_cannibals_east_to_west) ).
cnf(two_missionaries_west_to_east,axiom,
( achievable(west(m(X1),c(X2)),boatoneast,east(m(s(s(X3))),c(X4)))
| ~ achievable(west(m(s(s(X1))),c(X2)),boatonwest,east(m(X3),c(X4))) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',two_missionaries_west_to_east) ).
cnf(two_cannibals_west_to_east,axiom,
( achievable(west(m(X1),c(X2)),boatoneast,east(m(X3),c(s(s(X4)))))
| ~ achievable(west(m(X1),c(s(s(X2)))),boatonwest,east(m(X3),c(X4))) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',two_cannibals_west_to_east) ).
cnf(missionary_and_cannibal_east_to_west,axiom,
( achievable(west(m(s(X1)),c(s(X2))),boatonwest,east(m(X3),c(X4)))
| ~ achievable(west(m(X1),c(X2)),boatoneast,east(m(s(X3)),c(s(X4)))) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',missionary_and_cannibal_east_to_west) ).
cnf(missionary_and_cannibal_west_to_east,axiom,
( achievable(west(m(X1),c(X2)),boatoneast,east(m(s(X3)),c(s(X4))))
| ~ achievable(west(m(s(X1)),c(s(X2))),boatonwest,east(m(X3),c(X4))) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',missionary_and_cannibal_west_to_east) ).
cnf(missionary_east_to_west,axiom,
( achievable(west(m(s(X1)),c(X2)),boatonwest,east(m(X3),c(X4)))
| ~ achievable(west(m(X1),c(X2)),boatoneast,east(m(s(X3)),c(X4))) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',missionary_east_to_west) ).
cnf(cannibal_east_to_west,axiom,
( achievable(west(m(X1),c(s(X2))),boatonwest,east(m(X3),c(X4)))
| ~ achievable(west(m(X1),c(X2)),boatoneast,east(m(X3),c(s(X4)))) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cannibal_east_to_west) ).
cnf(missionary_west_to_east,axiom,
( achievable(west(m(X1),c(X2)),boatoneast,east(m(s(X3)),c(X4)))
| ~ achievable(west(m(s(X1)),c(X2)),boatonwest,east(m(X3),c(X4))) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',missionary_west_to_east) ).
cnf(cannibal_west_to_east,axiom,
( achievable(west(m(X1),c(X2)),boatoneast,east(m(X3),c(s(X4))))
| ~ achievable(west(m(X1),c(s(X2))),boatonwest,east(m(X3),c(X4))) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cannibal_west_to_east) ).
cnf(start_on_west_bank,hypothesis,
achievable(west(m(s(s(s(n0)))),c(s(s(s(n0))))),boatonwest,east(m(n0),c(n0))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',start_on_west_bank) ).
cnf(two_extra_cannibals_meal_on_west_bank,axiom,
achievable(west(m(s(X1)),c(s(s(s(X1))))),X2,east(X3,X4)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',two_extra_cannibals_meal_on_west_bank) ).
cnf(two_extra_cannibals_meal_on_east_bank,axiom,
achievable(west(X1,X2),X3,east(m(s(X4)),c(s(s(s(X4)))))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',two_extra_cannibals_meal_on_east_bank) ).
cnf(extra_cannibal_meal_on_west_bank,axiom,
achievable(west(m(s(X1)),c(s(s(X1)))),X2,east(X3,X4)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',extra_cannibal_meal_on_west_bank) ).
cnf(extra_cannibal_meal_on_east_bank,axiom,
achievable(west(X1,X2),X3,east(m(s(X4)),c(s(s(X4))))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',extra_cannibal_meal_on_east_bank) ).
cnf(i_0_16,negated_conjecture,
~ achievable(west(m(n0),c(n0)),X1,east(m(s(s(s(n0)))),c(s(s(s(n0)))))),
prove_can_get_to_east_bank,
[final] ).
cnf(i_0_17,axiom,
( achievable(west(m(s(s(X1))),c(X2)),boatonwest,east(m(X3),c(X4)))
| ~ achievable(west(m(X1),c(X2)),boatoneast,east(m(s(s(X3))),c(X4))) ),
two_missionaries_east_to_west,
[final] ).
cnf(i_0_18,axiom,
( achievable(west(m(X1),c(s(s(X2)))),boatonwest,east(m(X3),c(X4)))
| ~ achievable(west(m(X1),c(X2)),boatoneast,east(m(X3),c(s(s(X4))))) ),
two_cannibals_east_to_west,
[final] ).
cnf(i_0_19,axiom,
( achievable(west(m(X1),c(X2)),boatoneast,east(m(s(s(X3))),c(X4)))
| ~ achievable(west(m(s(s(X1))),c(X2)),boatonwest,east(m(X3),c(X4))) ),
two_missionaries_west_to_east,
[final] ).
cnf(i_0_20,axiom,
( achievable(west(m(X1),c(X2)),boatoneast,east(m(X3),c(s(s(X4)))))
| ~ achievable(west(m(X1),c(s(s(X2)))),boatonwest,east(m(X3),c(X4))) ),
two_cannibals_west_to_east,
[final] ).
cnf(i_0_21,axiom,
( achievable(west(m(s(X1)),c(s(X2))),boatonwest,east(m(X3),c(X4)))
| ~ achievable(west(m(X1),c(X2)),boatoneast,east(m(s(X3)),c(s(X4)))) ),
missionary_and_cannibal_east_to_west,
[final] ).
cnf(i_0_22,axiom,
( achievable(west(m(X1),c(X2)),boatoneast,east(m(s(X3)),c(s(X4))))
| ~ achievable(west(m(s(X1)),c(s(X2))),boatonwest,east(m(X3),c(X4))) ),
missionary_and_cannibal_west_to_east,
[final] ).
cnf(i_0_23,axiom,
( achievable(west(m(s(X1)),c(X2)),boatonwest,east(m(X3),c(X4)))
| ~ achievable(west(m(X1),c(X2)),boatoneast,east(m(s(X3)),c(X4))) ),
missionary_east_to_west,
[final] ).
cnf(i_0_24,axiom,
( achievable(west(m(X1),c(s(X2))),boatonwest,east(m(X3),c(X4)))
| ~ achievable(west(m(X1),c(X2)),boatoneast,east(m(X3),c(s(X4)))) ),
cannibal_east_to_west,
[final] ).
cnf(i_0_25,axiom,
( achievable(west(m(X1),c(X2)),boatoneast,east(m(s(X3)),c(X4)))
| ~ achievable(west(m(s(X1)),c(X2)),boatonwest,east(m(X3),c(X4))) ),
missionary_west_to_east,
[final] ).
cnf(i_0_26,axiom,
( achievable(west(m(X1),c(X2)),boatoneast,east(m(X3),c(s(X4))))
| ~ achievable(west(m(X1),c(s(X2))),boatonwest,east(m(X3),c(X4))) ),
cannibal_west_to_east,
[final] ).
cnf(i_0_27,hypothesis,
achievable(west(m(s(s(s(n0)))),c(s(s(s(n0))))),boatonwest,east(m(n0),c(n0))),
start_on_west_bank,
[final] ).
cnf(i_0_28,axiom,
achievable(west(m(s(X1)),c(s(s(s(X1))))),X2,east(X3,X4)),
two_extra_cannibals_meal_on_west_bank,
[final] ).
cnf(i_0_29,axiom,
achievable(west(X1,X2),X3,east(m(s(X4)),c(s(s(s(X4)))))),
two_extra_cannibals_meal_on_east_bank,
[final] ).
cnf(i_0_30,axiom,
achievable(west(m(s(X1)),c(s(s(X1)))),X2,east(X3,X4)),
extra_cannibal_meal_on_west_bank,
[final] ).
cnf(i_0_31,axiom,
achievable(west(X1,X2),X3,east(m(s(X4)),c(s(s(X4))))),
extra_cannibal_meal_on_east_bank,
[final] ).
cnf(i_0_32,plain,
$false,
inference(scs_inference,[],[i_0_16,i_0_29,i_0_19]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : PUZ008-1 : TPTP v9.2.1. Released v1.0.0.
% 0.00/0.12 % Command : /export/starexec/sandbox2/solver/bin/lemma_parallel_prover %s --lemma-prover /export/starexec/sandbox2/solver/bin/cse --final-prover /export/starexec/sandbox2/solver/bin/eprover --proof-time %d --global-time-limit %d
% 0.15/0.33 % Computer : n017.cluster.edu
% 0.15/0.33 % Model : x86_64 x86_64
% 0.15/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.33 % Memory : 8042.1875MB
% 0.15/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.33 % CPULimit : 300
% 0.15/0.33 % WCLimit : 300
% 0.15/0.33 % DateTime : Tue May 5 01:31:28 EDT 2026
% 0.15/0.33 % CPUTime :
% 0.15/0.34 % start to proof: theBenchmark
% 0.26/1.62 % Version : CSE_E---1.7
% 0.26/1.62 % Problem : theBenchmark.p
% 0.26/1.62 % SZS status Unsatisfiable for theBenchmark.p
% 0.26/1.62 % SZS output start CNFRefutation
% See solution above
% 0.26/1.64 % Total time : 1.273s
%------------------------------------------------------------------------------