%------------------------------------------------------------------------------
% File : CSE_E---1.7
% Problem : PUZ008-3 : TPTP v9.2.1. Released v1.2.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 : n015.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 1.27s 1.71s
% Output : CNFRefutation 1.27s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 10
% Syntax : Number of clauses : 36 ( 13 unt; 0 nHn; 30 RR)
% Number of literals : 91 ( 0 equ; 60 neg)
% Maximal clause size : 6 ( 2 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 : 64 ( 8 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(same_or_more_missionaries_is_safe,axiom,
( safe(X1,X2)
| ~ greater_or_equal(X1,X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',same_or_more_missionaries_is_safe) ).
cnf(great_eq_recursive,axiom,
( greater_or_equal(s(X1),s(X2))
| ~ greater_or_equal(X1,X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',great_eq_recursive) ).
cnf(great_eq_base,axiom,
greater_or_equal(X1,n0),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',great_eq_base) ).
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)))
| ~ safe(X1,X2)
| ~ safe(X3,s(s(X4))) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',two_cannibals_west_to_east) ).
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))))
| ~ safe(X1,s(X2))
| ~ safe(X3,X4) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cannibal_east_to_west) ).
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(no_missionaries_is_safe,axiom,
safe(n0,X1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',no_missionaries_is_safe) ).
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)))
| ~ safe(X1,X2)
| ~ safe(s(s(X3)),X4) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',two_missionaries_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))))
| ~ safe(s(X1),s(X2))
| ~ safe(X3,X4) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',missionary_and_cannibal_east_to_west) ).
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(c_0_10,axiom,
( safe(X1,X2)
| ~ greater_or_equal(X1,X2) ),
same_or_more_missionaries_is_safe ).
cnf(c_0_11,axiom,
( greater_or_equal(s(X1),s(X2))
| ~ greater_or_equal(X1,X2) ),
great_eq_recursive ).
cnf(c_0_12,plain,
( safe(s(X1),s(X2))
| ~ greater_or_equal(X1,X2) ),
inference(spm,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_13,axiom,
greater_or_equal(X1,n0),
great_eq_base ).
cnf(c_0_14,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)))
| ~ safe(X1,X2)
| ~ safe(X3,s(s(X4))) ),
two_cannibals_west_to_east ).
cnf(c_0_15,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))))
| ~ safe(X1,s(X2))
| ~ safe(X3,X4) ),
cannibal_east_to_west ).
cnf(c_0_16,hypothesis,
achievable(west(m(s(s(s(n0)))),c(s(s(s(n0))))),boatonwest,east(m(n0),c(n0))),
start_on_west_bank ).
cnf(c_0_17,axiom,
safe(n0,X1),
no_missionaries_is_safe ).
cnf(c_0_18,plain,
safe(s(X1),s(n0)),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_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)))
| ~ safe(X1,X2)
| ~ safe(s(s(X3)),X4) ),
two_missionaries_west_to_east ).
cnf(c_0_20,plain,
( achievable(west(m(X1),c(X2)),boatoneast,east(m(X3),c(s(s(X4)))))
| ~ achievable(west(m(X1),c(s(X2))),boatoneast,east(m(X3),c(s(X4))))
| ~ safe(X3,s(s(X4)))
| ~ safe(X1,s(s(X2)))
| ~ safe(X1,X2)
| ~ safe(X3,X4) ),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_21,hypothesis,
achievable(west(m(s(s(s(n0)))),c(s(n0))),boatoneast,east(m(n0),c(s(s(n0))))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_16]),c_0_17]),c_0_18])]) ).
cnf(c_0_22,plain,
safe(X1,n0),
inference(spm,[status(thm)],[c_0_10,c_0_13]) ).
cnf(c_0_23,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))))
| ~ safe(s(X1),s(X2))
| ~ safe(X3,X4) ),
missionary_and_cannibal_east_to_west ).
cnf(c_0_24,plain,
( achievable(west(m(X1),c(s(X2))),boatoneast,east(m(s(s(X3))),c(X4)))
| ~ achievable(west(m(s(s(X1))),c(X2)),boatoneast,east(m(X3),c(s(X4))))
| ~ safe(s(s(X1)),s(X2))
| ~ safe(s(s(X3)),X4)
| ~ safe(X1,s(X2))
| ~ safe(X3,X4) ),
inference(spm,[status(thm)],[c_0_19,c_0_15]) ).
cnf(c_0_25,hypothesis,
( achievable(west(m(s(s(s(n0)))),c(n0)),boatoneast,east(m(n0),c(s(s(s(n0))))))
| ~ safe(s(s(s(n0))),s(s(n0))) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_21]),c_0_17]),c_0_22]),c_0_17])]) ).
cnf(c_0_26,plain,
( achievable(west(m(X1),c(s(X2))),boatoneast,east(m(s(s(X3))),c(X4)))
| ~ achievable(west(m(s(X1)),c(X2)),boatoneast,east(m(s(X3)),c(s(X4))))
| ~ safe(s(s(X1)),s(X2))
| ~ safe(s(s(X3)),X4)
| ~ safe(X1,s(X2))
| ~ safe(X3,X4) ),
inference(spm,[status(thm)],[c_0_19,c_0_23]) ).
cnf(c_0_27,hypothesis,
( achievable(west(m(s(n0)),c(s(n0))),boatoneast,east(m(s(s(n0))),c(s(s(n0)))))
| ~ safe(s(s(s(n0))),s(s(n0)))
| ~ safe(s(s(n0)),s(s(n0))) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_25]),c_0_18]),c_0_18]),c_0_17])]) ).
cnf(c_0_28,hypothesis,
( achievable(west(m(n0),c(s(s(n0)))),boatoneast,east(m(s(s(s(n0)))),c(s(n0))))
| ~ safe(s(s(s(n0))),s(s(n0)))
| ~ safe(s(s(n0)),s(s(n0))) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_27]),c_0_18]),c_0_17]),c_0_18])]) ).
cnf(c_0_29,hypothesis,
( 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(s(s(n0)),s(s(n0))) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_28]),c_0_17]),c_0_17]),c_0_22])]) ).
cnf(c_0_30,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 ).
cnf(c_0_31,hypothesis,
( ~ safe(s(s(s(n0))),s(s(s(n0))))
| ~ safe(s(s(s(n0))),s(s(n0)))
| ~ safe(s(s(n0)),s(s(n0))) ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_29]),c_0_17]),c_0_17]),c_0_18])]),c_0_30]) ).
cnf(c_0_32,plain,
( safe(s(s(X1)),s(s(X2)))
| ~ greater_or_equal(X1,X2) ),
inference(spm,[status(thm)],[c_0_12,c_0_11]) ).
cnf(c_0_33,hypothesis,
( ~ greater_or_equal(s(n0),s(n0))
| ~ safe(s(s(s(n0))),s(s(n0))) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_32]),c_0_12]) ).
cnf(c_0_34,hypothesis,
~ safe(s(s(s(n0))),s(s(n0))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_11]),c_0_13])]) ).
cnf(c_0_35,hypothesis,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_32]),c_0_13])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11 % Problem : PUZ008-3 : TPTP v9.2.1. Released v1.2.0.
% 0.00/0.11 % 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.13/0.32 % Computer : n015.cluster.edu
% 0.13/0.32 % Model : x86_64 x86_64
% 0.13/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.32 % Memory : 8042.1875MB
% 0.13/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.32 % CPULimit : 300
% 0.13/0.32 % WCLimit : 300
% 0.13/0.32 % DateTime : Tue May 5 01:33:02 EDT 2026
% 0.13/0.32 % CPUTime :
% 0.13/0.33 % start to proof: theBenchmark
% 1.27/1.71 % Version : CSE_E---1.7
% 1.27/1.71 % Problem : theBenchmark.p
% 1.27/1.71 % SZS status Unsatisfiable for theBenchmark.p
% 1.27/1.71 % SZS output start CNFRefutation
% See solution above
% 1.27/1.71 % Total time : 1.370s
%------------------------------------------------------------------------------