%------------------------------------------------------------------------------
% File : hopCoP---0.1
% Problem : PUZ008-3 : TPTP v9.0.0. Released v1.2.0.
% Transfm : none
% Format : tptp:raw
% Command : /export/starexec/sandbox2/solver/bin/execute.py 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% Computer : n026.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 : Fri Jul 25 01:24:25 PM UTC 2025
% Result : Unsatisfiable 0.18s 0.49s
% Output : CNFRefutation 0.18s
% Verified :
% SZS Type : ERROR: Analysing output (Could not find formula named prove_can_get_to_east_bank)
% Comments :
%------------------------------------------------------------------------------
cnf(15,plain,
~ achievable(west(m(n0),c(n0)),X0,east(m(s(s(s(n0)))),c(s(s(s(n0)))))),
inference(cnf,[status(esa)],[prove_can_get_to_east_bank]) ).
cnf(l0,plain,
~ achievable(west(m(n0),c(n0)),boatoneast,east(m(s(s(s(n0)))),c(s(s(s(n0)))))),
inference(instantiation,[status(thm)],[15]) ).
cnf(12,plain,
( ~ safe(X0,X1)
| ~ safe(s(X2),s(X3))
| ~ achievable(west(m(s(X0)),c(s(X1))),boatonwest,east(m(X2),c(X3)))
| achievable(west(m(X0),c(X1)),boatoneast,east(m(s(X2)),c(s(X3)))) ),
inference(cnf,[status(esa)],[missionary_and_cannibal_west_to_east]) ).
cnf(l1,plain,
( ~ safe(n0,n0)
| ~ safe(s(s(s(n0))),s(s(s(n0))))
| ~ achievable(west(m(s(n0)),c(s(n0))),boatonwest,east(m(s(s(n0))),c(s(s(n0)))))
| achievable(west(m(n0),c(n0)),boatoneast,east(m(s(s(s(n0)))),c(s(s(s(n0)))))) ),
inference(instantiation,[status(thm)],[12]) ).
cnf(1,plain,
( ~ greater_or_equal(X0,X1)
| safe(X0,X1) ),
inference(cnf,[status(esa)],[same_or_more_missionaries_is_safe]) ).
cnf(l2,plain,
( ~ greater_or_equal(n0,n0)
| safe(n0,n0) ),
inference(instantiation,[status(thm)],[1]) ).
cnf(9,plain,
( ~ safe(X0,X1)
| ~ safe(s(X2),X3)
| ~ achievable(west(m(X2),c(X3)),boatoneast,east(m(s(X0)),c(X1)))
| achievable(west(m(s(X2)),c(X3)),boatonwest,east(m(X0),c(X1))) ),
inference(cnf,[status(esa)],[missionary_east_to_west]) ).
cnf(l3,plain,
( ~ safe(s(s(n0)),s(s(n0)))
| ~ safe(s(n0),s(n0))
| ~ achievable(west(m(n0),c(s(n0))),boatoneast,east(m(s(s(s(n0)))),c(s(s(n0)))))
| achievable(west(m(s(n0)),c(s(n0))),boatonwest,east(m(s(s(n0))),c(s(s(n0))))) ),
inference(instantiation,[status(thm)],[9]) ).
cnf(l5,plain,
( ~ greater_or_equal(s(s(n0)),s(s(n0)))
| safe(s(s(n0)),s(s(n0))) ),
inference(instantiation,[status(thm)],[1]) ).
cnf(l6,plain,
( ~ greater_or_equal(s(s(s(n0))),s(s(s(n0))))
| safe(s(s(s(n0))),s(s(s(n0)))) ),
inference(instantiation,[status(thm)],[1]) ).
cnf(2,plain,
greater_or_equal(X0,n0),
inference(cnf,[status(esa)],[great_eq_base]) ).
cnf(l4,plain,
greater_or_equal(n0,n0),
inference(instantiation,[status(thm)],[2]) ).
cnf(l7,plain,
( ~ greater_or_equal(s(n0),s(n0))
| safe(s(n0),s(n0)) ),
inference(instantiation,[status(thm)],[1]) ).
cnf(3,plain,
( ~ greater_or_equal(X0,X1)
| greater_or_equal(s(X0),s(X1)) ),
inference(cnf,[status(esa)],[great_eq_recursive]) ).
cnf(l8,plain,
( ~ greater_or_equal(s(s(n0)),s(s(n0)))
| greater_or_equal(s(s(s(n0))),s(s(s(n0)))) ),
inference(instantiation,[status(thm)],[3]) ).
cnf(l9,plain,
( ~ greater_or_equal(s(n0),s(n0))
| greater_or_equal(s(s(n0)),s(s(n0))) ),
inference(instantiation,[status(thm)],[3]) ).
cnf(l10,plain,
( ~ greater_or_equal(s(n0),s(n0))
| greater_or_equal(s(s(n0)),s(s(n0))) ),
inference(instantiation,[status(thm)],[3]) ).
cnf(6,plain,
( ~ safe(X0,X1)
| ~ safe(X2,s(s(X3)))
| ~ achievable(west(m(X0),c(s(s(X1)))),boatonwest,east(m(X2),c(X3)))
| achievable(west(m(X0),c(X1)),boatoneast,east(m(X2),c(s(s(X3))))) ),
inference(cnf,[status(esa)],[two_cannibals_west_to_east]) ).
cnf(l11,plain,
( ~ safe(n0,s(n0))
| ~ safe(s(s(s(n0))),s(s(n0)))
| ~ achievable(west(m(n0),c(s(s(s(n0))))),boatonwest,east(m(s(s(s(n0)))),c(n0)))
| achievable(west(m(n0),c(s(n0))),boatoneast,east(m(s(s(s(n0)))),c(s(s(n0))))) ),
inference(instantiation,[status(thm)],[6]) ).
cnf(5,plain,
( ~ safe(X0,s(X1))
| ~ safe(X2,X3)
| ~ achievable(west(m(X0),c(X1)),boatoneast,east(m(X2),c(s(X3))))
| achievable(west(m(X0),c(s(X1))),boatonwest,east(m(X2),c(X3))) ),
inference(cnf,[status(esa)],[cannibal_east_to_west]) ).
cnf(l18,plain,
( ~ safe(n0,s(s(s(n0))))
| ~ safe(s(s(s(n0))),n0)
| ~ achievable(west(m(n0),c(s(s(n0)))),boatoneast,east(m(s(s(s(n0)))),c(s(n0))))
| achievable(west(m(n0),c(s(s(s(n0))))),boatonwest,east(m(s(s(s(n0)))),c(n0))) ),
inference(instantiation,[status(thm)],[5]) ).
cnf(l15,plain,
( ~ greater_or_equal(s(s(s(n0))),s(s(n0)))
| safe(s(s(s(n0))),s(s(n0))) ),
inference(instantiation,[status(thm)],[1]) ).
cnf(l12,plain,
( ~ greater_or_equal(n0,n0)
| greater_or_equal(s(n0),s(n0)) ),
inference(instantiation,[status(thm)],[3]) ).
cnf(l23,plain,
( ~ greater_or_equal(s(s(n0)),s(n0))
| greater_or_equal(s(s(s(n0))),s(s(n0))) ),
inference(instantiation,[status(thm)],[3]) ).
cnf(0,plain,
safe(n0,X0),
inference(cnf,[status(esa)],[no_missionaries_is_safe]) ).
cnf(l20,plain,
safe(n0,s(s(s(n0)))),
inference(instantiation,[status(thm)],[0]) ).
cnf(l24,plain,
( ~ greater_or_equal(s(n0),n0)
| greater_or_equal(s(s(n0)),s(n0)) ),
inference(instantiation,[status(thm)],[3]) ).
cnf(l22,plain,
greater_or_equal(n0,n0),
inference(instantiation,[status(thm)],[2]) ).
cnf(l17,plain,
safe(n0,s(n0)),
inference(instantiation,[status(thm)],[0]) ).
cnf(l14,plain,
( ~ greater_or_equal(n0,n0)
| greater_or_equal(s(n0),s(n0)) ),
inference(instantiation,[status(thm)],[3]) ).
cnf(l16,plain,
greater_or_equal(n0,n0),
inference(instantiation,[status(thm)],[2]) ).
cnf(l25,plain,
greater_or_equal(s(n0),n0),
inference(instantiation,[status(thm)],[2]) ).
cnf(l13,plain,
( ~ greater_or_equal(n0,n0)
| greater_or_equal(s(n0),s(n0)) ),
inference(instantiation,[status(thm)],[3]) ).
cnf(l21,plain,
greater_or_equal(n0,n0),
inference(instantiation,[status(thm)],[2]) ).
cnf(l19,plain,
( ~ greater_or_equal(s(s(s(n0))),n0)
| safe(s(s(s(n0))),n0) ),
inference(instantiation,[status(thm)],[1]) ).
cnf(l30,plain,
greater_or_equal(s(s(s(n0))),n0),
inference(instantiation,[status(thm)],[2]) ).
cnf(10,plain,
( ~ safe(X0,X1)
| ~ safe(s(s(X2)),X3)
| ~ achievable(west(m(s(s(X0))),c(X1)),boatonwest,east(m(X2),c(X3)))
| achievable(west(m(X0),c(X1)),boatoneast,east(m(s(s(X2))),c(X3))) ),
inference(cnf,[status(esa)],[two_missionaries_west_to_east]) ).
cnf(l27,plain,
( ~ safe(n0,s(s(n0)))
| ~ safe(s(s(s(n0))),s(n0))
| ~ achievable(west(m(s(s(n0))),c(s(s(n0)))),boatonwest,east(m(s(n0)),c(s(n0))))
| achievable(west(m(n0),c(s(s(n0)))),boatoneast,east(m(s(s(s(n0)))),c(s(n0)))) ),
inference(instantiation,[status(thm)],[10]) ).
cnf(l28,plain,
( ~ greater_or_equal(s(s(s(n0))),s(n0))
| safe(s(s(s(n0))),s(n0)) ),
inference(instantiation,[status(thm)],[1]) ).
cnf(l31,plain,
safe(n0,s(s(n0))),
inference(instantiation,[status(thm)],[0]) ).
cnf(13,plain,
( ~ safe(X0,X1)
| ~ safe(s(X2),s(X3))
| ~ achievable(west(m(X2),c(X3)),boatoneast,east(m(s(X0)),c(s(X1))))
| achievable(west(m(s(X2)),c(s(X3))),boatonwest,east(m(X0),c(X1))) ),
inference(cnf,[status(esa)],[missionary_and_cannibal_east_to_west]) ).
cnf(l29,plain,
( ~ safe(s(n0),s(n0))
| ~ safe(s(s(n0)),s(s(n0)))
| ~ achievable(west(m(s(n0)),c(s(n0))),boatoneast,east(m(s(s(n0))),c(s(s(n0)))))
| achievable(west(m(s(s(n0))),c(s(s(n0)))),boatonwest,east(m(s(n0)),c(s(n0)))) ),
inference(instantiation,[status(thm)],[13]) ).
cnf(l32,plain,
( ~ greater_or_equal(s(s(n0)),s(s(n0)))
| safe(s(s(n0)),s(s(n0))) ),
inference(instantiation,[status(thm)],[1]) ).
cnf(l34,plain,
( ~ greater_or_equal(s(s(n0)),n0)
| greater_or_equal(s(s(s(n0))),s(n0)) ),
inference(instantiation,[status(thm)],[3]) ).
cnf(l36,plain,
( ~ greater_or_equal(s(n0),s(n0))
| safe(s(n0),s(n0)) ),
inference(instantiation,[status(thm)],[1]) ).
cnf(l33,plain,
( ~ greater_or_equal(s(n0),s(n0))
| greater_or_equal(s(s(n0)),s(s(n0))) ),
inference(instantiation,[status(thm)],[3]) ).
cnf(l40,plain,
greater_or_equal(s(s(n0)),n0),
inference(instantiation,[status(thm)],[2]) ).
cnf(l39,plain,
( ~ greater_or_equal(n0,n0)
| greater_or_equal(s(n0),s(n0)) ),
inference(instantiation,[status(thm)],[3]) ).
cnf(l52,plain,
greater_or_equal(n0,n0),
inference(instantiation,[status(thm)],[2]) ).
cnf(l37,plain,
( ~ safe(s(n0),s(n0))
| ~ safe(s(s(n0)),s(s(n0)))
| ~ achievable(west(m(s(s(s(n0)))),c(s(n0))),boatonwest,east(m(n0),c(s(s(n0)))))
| achievable(west(m(s(n0)),c(s(n0))),boatoneast,east(m(s(s(n0))),c(s(s(n0))))) ),
inference(instantiation,[status(thm)],[10]) ).
cnf(l53,plain,
( ~ greater_or_equal(n0,n0)
| greater_or_equal(s(n0),s(n0)) ),
inference(instantiation,[status(thm)],[3]) ).
cnf(l54,plain,
greater_or_equal(n0,n0),
inference(instantiation,[status(thm)],[2]) ).
cnf(l42,plain,
( ~ greater_or_equal(s(n0),s(n0))
| safe(s(n0),s(n0)) ),
inference(instantiation,[status(thm)],[1]) ).
cnf(l38,plain,
( ~ greater_or_equal(s(s(n0)),s(s(n0)))
| safe(s(s(n0)),s(s(n0))) ),
inference(instantiation,[status(thm)],[1]) ).
cnf(l45,plain,
( ~ greater_or_equal(n0,n0)
| greater_or_equal(s(n0),s(n0)) ),
inference(instantiation,[status(thm)],[3]) ).
cnf(l41,plain,
( ~ greater_or_equal(s(n0),s(n0))
| greater_or_equal(s(s(n0)),s(s(n0))) ),
inference(instantiation,[status(thm)],[3]) ).
cnf(l43,plain,
( ~ greater_or_equal(n0,n0)
| greater_or_equal(s(n0),s(n0)) ),
inference(instantiation,[status(thm)],[3]) ).
cnf(l44,plain,
greater_or_equal(n0,n0),
inference(instantiation,[status(thm)],[2]) ).
cnf(l46,plain,
greater_or_equal(n0,n0),
inference(instantiation,[status(thm)],[2]) ).
cnf(l47,plain,
( ~ safe(s(s(s(n0))),s(n0))
| ~ safe(n0,s(s(n0)))
| ~ achievable(west(m(s(s(s(n0)))),c(n0)),boatoneast,east(m(n0),c(s(s(s(n0))))))
| achievable(west(m(s(s(s(n0)))),c(s(n0))),boatonwest,east(m(n0),c(s(s(n0))))) ),
inference(instantiation,[status(thm)],[5]) ).
cnf(l51,plain,
( ~ greater_or_equal(s(s(s(n0))),s(n0))
| safe(s(s(s(n0))),s(n0)) ),
inference(instantiation,[status(thm)],[1]) ).
cnf(l48,plain,
( ~ safe(s(s(s(n0))),n0)
| ~ safe(n0,s(s(s(n0))))
| ~ achievable(west(m(s(s(s(n0)))),c(s(s(n0)))),boatonwest,east(m(n0),c(s(n0))))
| achievable(west(m(s(s(s(n0)))),c(n0)),boatoneast,east(m(n0),c(s(s(s(n0)))))) ),
inference(instantiation,[status(thm)],[6]) ).
cnf(l49,plain,
( ~ greater_or_equal(s(s(s(n0))),n0)
| safe(s(s(s(n0))),n0) ),
inference(instantiation,[status(thm)],[1]) ).
cnf(l56,plain,
( ~ greater_or_equal(s(s(n0)),n0)
| greater_or_equal(s(s(s(n0))),s(n0)) ),
inference(instantiation,[status(thm)],[3]) ).
cnf(l60,plain,
safe(n0,s(s(s(n0)))),
inference(instantiation,[status(thm)],[0]) ).
cnf(l59,plain,
( ~ safe(s(s(s(n0))),s(s(n0)))
| ~ safe(n0,s(n0))
| ~ achievable(west(m(s(s(s(n0)))),c(s(n0))),boatoneast,east(m(n0),c(s(s(n0)))))
| achievable(west(m(s(s(s(n0)))),c(s(s(n0)))),boatonwest,east(m(n0),c(s(n0)))) ),
inference(instantiation,[status(thm)],[5]) ).
cnf(l61,plain,
greater_or_equal(s(s(s(n0))),n0),
inference(instantiation,[status(thm)],[2]) ).
cnf(l64,plain,
safe(n0,s(n0)),
inference(instantiation,[status(thm)],[0]) ).
cnf(l65,plain,
( ~ greater_or_equal(s(s(s(n0))),s(s(n0)))
| safe(s(s(s(n0))),s(s(n0))) ),
inference(instantiation,[status(thm)],[1]) ).
cnf(l50,plain,
safe(n0,s(s(n0))),
inference(instantiation,[status(thm)],[0]) ).
cnf(l66,plain,
( ~ safe(s(s(s(n0))),s(n0))
| ~ safe(n0,s(s(n0)))
| ~ achievable(west(m(s(s(s(n0)))),c(s(s(s(n0))))),boatonwest,east(m(n0),c(n0)))
| achievable(west(m(s(s(s(n0)))),c(s(n0))),boatoneast,east(m(n0),c(s(s(n0))))) ),
inference(instantiation,[status(thm)],[6]) ).
cnf(l69,plain,
( ~ greater_or_equal(s(s(s(n0))),s(n0))
| safe(s(s(s(n0))),s(n0)) ),
inference(instantiation,[status(thm)],[1]) ).
cnf(l76,plain,
( ~ greater_or_equal(s(s(n0)),s(n0))
| greater_or_equal(s(s(s(n0))),s(s(n0))) ),
inference(instantiation,[status(thm)],[3]) ).
cnf(l58,plain,
greater_or_equal(s(s(n0)),n0),
inference(instantiation,[status(thm)],[2]) ).
cnf(l68,plain,
safe(n0,s(s(n0))),
inference(instantiation,[status(thm)],[0]) ).
cnf(l72,plain,
( ~ greater_or_equal(s(s(n0)),n0)
| greater_or_equal(s(s(s(n0))),s(n0)) ),
inference(instantiation,[status(thm)],[3]) ).
cnf(l85,plain,
( ~ greater_or_equal(s(n0),n0)
| greater_or_equal(s(s(n0)),s(n0)) ),
inference(instantiation,[status(thm)],[3]) ).
cnf(l74,plain,
greater_or_equal(s(s(n0)),n0),
inference(instantiation,[status(thm)],[2]) ).
cnf(l86,plain,
greater_or_equal(s(n0),n0),
inference(instantiation,[status(thm)],[2]) ).
cnf(14,plain,
achievable(west(m(s(s(s(n0)))),c(s(s(s(n0))))),boatonwest,east(m(n0),c(n0))),
inference(cnf,[status(esa)],[start_on_west_bank]) ).
cnf(l70,plain,
achievable(west(m(s(s(s(n0)))),c(s(s(s(n0))))),boatonwest,east(m(n0),c(n0))),
inference(instantiation,[status(thm)],[14]) ).
cnf(final,plain,
$false,
inference(ground_refutation,[status(thm)],[l0,l1,l2,l3,l5,l6,l4,l7,l8,l9,l10,l11,l18,l15,l12,l23,l20,l24,l22,l17,l14,l16,l25,l13,l21,l19,l30,l27,l28,l31,l29,l32,l34,l36,l33,l40,l39,l52,l37,l53,l54,l42,l38,l45,l41,l43,l44,l46,l47,l51,l48,l49,l56,l60,l59,l61,l64,l65,l50,l66,l69,l76,l58,l68,l72,l85,l74,l86,l70]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11 % Problem : PUZ008-3 : TPTP v9.0.0. Released v1.2.0.
% 0.03/0.12 % Command : /export/starexec/sandbox2/solver/bin/execute.py 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.12/0.33 % Computer : n026.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 300
% 0.12/0.33 % DateTime : Mon Jul 21 15:47:34 EDT 2025
% 0.12/0.33 % CPUTime :
% 0.12/0.33 % launching worker at depth: 5
% 0.12/0.33 % launching worker at depth: 3
% 0.12/0.33 % launching worker at depth: 6
% 0.12/0.33 % launching worker at depth: 4
% 0.12/0.33 % launching worker at depth: 1
% 0.12/0.33 % launching worker at depth: 2
% 0.12/0.33 % launching worker at depth: 7
% 0.12/0.33 % launching worker at depth: 8
% 0.12/0.34 % launching worker at depth: 9
% 0.12/0.34 % launching worker at depth: 10
% 0.12/0.34 % launching worker at depth: 11
% 0.12/0.34 % launching worker at depth: 12
% 0.12/0.34 % launching worker at depth: 13
% 0.18/0.36 % launching worker at depth: 14
% 0.18/0.38 % launching worker at depth: 15
% 0.18/0.40 % launching worker at depth: 16
% 0.18/0.44 % launching worker at depth: 17
% 0.18/0.45 % launching worker at depth: 18
% 0.18/0.49 % SZS status Theorem for theBenchmark
% 0.18/0.49 % SZS output start CNFRefutation
% See solution above
%------------------------------------------------------------------------------