%------------------------------------------------------------------------------
% File : ConnectPP---0.7.2
% Problem : PUZ008-3 : TPTP v9.3.1. Released v1.2.0.
% Transfm : none
% Format : tptp:raw
% Command : /export/starexec/sandbox/solver/bin/connect++ --verbosity 1 --no-colour --tptp-proof --schedule default --timeout 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% Computer : n003.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:17 AM UTC 2026
% Result : Unsatisfiable 27.15s 27.46s
% Output : Proof 27.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 2
% Number of leaves : 12
% Syntax : Number of clauses : 149 ( 96 unt; 0 nHn; 147 RR)
% Number of literals : 236 ( 0 equ; 89 neg)
% Maximal clause size : 4 ( 1 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 : 31 ( 3 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(no_missionaries_is_safe,axiom,
safe(n0,X),
file('theBenchmark.p',no_missionaries_is_safe) ).
cnf(same_or_more_missionaries_is_safe,axiom,
( safe(X,Y)
| ~ greater_or_equal(X,Y) ),
file('theBenchmark.p',same_or_more_missionaries_is_safe) ).
cnf(great_eq_base,axiom,
greater_or_equal(X,n0),
file('theBenchmark.p',great_eq_base) ).
cnf(great_eq_recursive,axiom,
( ~ greater_or_equal(X,Y)
| greater_or_equal(s(X),s(Y)) ),
file('theBenchmark.p',great_eq_recursive) ).
cnf(cannibal_east_to_west,axiom,
( achievable(west(m(X),c(s(Y))),boatonwest,east(m(Z),c(W)))
| ~ safe(Z,W)
| ~ safe(X,s(Y))
| ~ achievable(west(m(X),c(Y)),boatoneast,east(m(Z),c(s(W)))) ),
file('theBenchmark.p',cannibal_east_to_west) ).
cnf(two_cannibals_west_to_east,axiom,
( achievable(west(m(X),c(Y)),boatoneast,east(m(Z),c(s(s(W)))))
| ~ safe(Z,s(s(W)))
| ~ safe(X,Y)
| ~ achievable(west(m(X),c(s(s(Y)))),boatonwest,east(m(Z),c(W))) ),
file('theBenchmark.p',two_cannibals_west_to_east) ).
cnf(missionary_east_to_west,axiom,
( achievable(west(m(s(X)),c(Y)),boatonwest,east(m(Z),c(W)))
| ~ safe(Z,W)
| ~ safe(s(X),Y)
| ~ achievable(west(m(X),c(Y)),boatoneast,east(m(s(Z)),c(W))) ),
file('theBenchmark.p',missionary_east_to_west) ).
cnf(two_missionaries_west_to_east,axiom,
( achievable(west(m(X),c(Y)),boatoneast,east(m(s(s(Z))),c(W)))
| ~ safe(s(s(Z)),W)
| ~ safe(X,Y)
| ~ achievable(west(m(s(s(X))),c(Y)),boatonwest,east(m(Z),c(W))) ),
file('theBenchmark.p',two_missionaries_west_to_east) ).
cnf(missionary_and_cannibal_west_to_east,axiom,
( achievable(west(m(X),c(Y)),boatoneast,east(m(s(Z)),c(s(W))))
| ~ safe(s(Z),s(W))
| ~ safe(X,Y)
| ~ achievable(west(m(s(X)),c(s(Y))),boatonwest,east(m(Z),c(W))) ),
file('theBenchmark.p',missionary_and_cannibal_west_to_east) ).
cnf(missionary_and_cannibal_east_to_west,axiom,
( achievable(west(m(s(X)),c(s(Y))),boatonwest,east(m(Z),c(W)))
| ~ safe(Z,W)
| ~ safe(s(X),s(Y))
| ~ achievable(west(m(X),c(Y)),boatoneast,east(m(s(Z)),c(s(W)))) ),
file('theBenchmark.p',missionary_and_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('theBenchmark.p',start_on_west_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,
( ~ 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(extension,[status(thm),parent(t1:1)],[missionary_and_cannibal_west_to_east]) ).
cnf(t3,plain,
$false,
inference(connection,[status(thm),parent(t2:1)],[t2:1,t1:1]) ).
cnf(t4,plain,
( ~ safe(s(n0),s(n0))
| ~ safe(s(s(n0)),s(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(extension,[status(thm),parent(t2:2)],[missionary_east_to_west]) ).
cnf(t5,plain,
$false,
inference(connection,[status(thm),parent(t4:1)],[t4:1,t2:2]) ).
cnf(t6,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(extension,[status(thm),parent(t4:2)],[two_cannibals_west_to_east]) ).
cnf(t7,plain,
$false,
inference(connection,[status(thm),parent(t6:1)],[t6:1,t4:2]) ).
cnf(t8,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(extension,[status(thm),parent(t6:2)],[cannibal_east_to_west]) ).
cnf(t9,plain,
$false,
inference(connection,[status(thm),parent(t8:1)],[t8:1,t6:2]) ).
cnf(t10,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(extension,[status(thm),parent(t8:2)],[two_missionaries_west_to_east]) ).
cnf(t11,plain,
$false,
inference(connection,[status(thm),parent(t10:1)],[t10:1,t8:2]) ).
cnf(t12,plain,
( ~ safe(s(s(n0)),s(s(n0)))
| ~ safe(s(n0),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(extension,[status(thm),parent(t10:2)],[missionary_and_cannibal_east_to_west]) ).
cnf(t13,plain,
$false,
inference(connection,[status(thm),parent(t12:1)],[t12:1,t10:2]) ).
cnf(t14,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(extension,[status(thm),parent(t12:2)],[two_missionaries_west_to_east]) ).
cnf(t15,plain,
$false,
inference(connection,[status(thm),parent(t14:1)],[t14:1,t12:2]) ).
cnf(t16,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(extension,[status(thm),parent(t14:2)],[cannibal_east_to_west]) ).
cnf(t17,plain,
$false,
inference(connection,[status(thm),parent(t16:1)],[t16:1,t14:2]) ).
cnf(t18,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(extension,[status(thm),parent(t16:2)],[two_cannibals_west_to_east]) ).
cnf(t19,plain,
$false,
inference(connection,[status(thm),parent(t18:1)],[t18:1,t16:2]) ).
cnf(t20,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(extension,[status(thm),parent(t18:2)],[cannibal_east_to_west]) ).
cnf(t21,plain,
$false,
inference(connection,[status(thm),parent(t20:1)],[t20:1,t18:2]) ).
cnf(t22,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(extension,[status(thm),parent(t20:2)],[two_cannibals_west_to_east]) ).
cnf(t23,plain,
$false,
inference(connection,[status(thm),parent(t22:1)],[t22:1,t20:2]) ).
cnf(t24,plain,
achievable(west(m(s(s(s(n0)))),c(s(s(s(n0))))),boatonwest,east(m(n0),c(n0))),
inference(extension,[status(thm),parent(t22:2)],[start_on_west_bank]) ).
cnf(t25,plain,
$false,
inference(connection,[status(thm),parent(t24:1)],[t24:1,t22:2]) ).
cnf(t26,plain,
safe(n0,s(s(n0))),
inference(extension,[status(thm),parent(t22:3)],[no_missionaries_is_safe]) ).
cnf(t27,plain,
$false,
inference(connection,[status(thm),parent(t26:1)],[t26:1,t22:3]) ).
cnf(t28,plain,
( ~ greater_or_equal(s(s(s(n0))),s(n0))
| safe(s(s(s(n0))),s(n0)) ),
inference(extension,[status(thm),parent(t22:4)],[same_or_more_missionaries_is_safe]) ).
cnf(t29,plain,
$false,
inference(connection,[status(thm),parent(t28:1)],[t28:1,t22:4]) ).
cnf(t30,plain,
( ~ greater_or_equal(s(s(n0)),n0)
| greater_or_equal(s(s(s(n0))),s(n0)) ),
inference(extension,[status(thm),parent(t28:2)],[great_eq_recursive]) ).
cnf(t31,plain,
$false,
inference(connection,[status(thm),parent(t30:1)],[t30:1,t28:2]) ).
cnf(t32,plain,
greater_or_equal(s(s(n0)),n0),
inference(extension,[status(thm),parent(t30:2)],[great_eq_base]) ).
cnf(t33,plain,
$false,
inference(connection,[status(thm),parent(t32:1)],[t32:1,t30:2]) ).
cnf(t34,plain,
safe(n0,s(n0)),
inference(extension,[status(thm),parent(t20:3)],[no_missionaries_is_safe]) ).
cnf(t35,plain,
$false,
inference(connection,[status(thm),parent(t34:1)],[t34:1,t20:3]) ).
cnf(t36,plain,
( ~ greater_or_equal(s(s(s(n0))),s(s(n0)))
| safe(s(s(s(n0))),s(s(n0))) ),
inference(extension,[status(thm),parent(t20:4)],[same_or_more_missionaries_is_safe]) ).
cnf(t37,plain,
$false,
inference(connection,[status(thm),parent(t36:1)],[t36:1,t20:4]) ).
cnf(t38,plain,
( ~ greater_or_equal(s(s(n0)),s(n0))
| greater_or_equal(s(s(s(n0))),s(s(n0))) ),
inference(extension,[status(thm),parent(t36:2)],[great_eq_recursive]) ).
cnf(t39,plain,
$false,
inference(connection,[status(thm),parent(t38:1)],[t38:1,t36:2]) ).
cnf(t40,plain,
( ~ greater_or_equal(s(n0),n0)
| greater_or_equal(s(s(n0)),s(n0)) ),
inference(extension,[status(thm),parent(t38:2)],[great_eq_recursive]) ).
cnf(t41,plain,
$false,
inference(connection,[status(thm),parent(t40:1)],[t40:1,t38:2]) ).
cnf(t42,plain,
greater_or_equal(s(n0),n0),
inference(extension,[status(thm),parent(t40:2)],[great_eq_base]) ).
cnf(t43,plain,
$false,
inference(connection,[status(thm),parent(t42:1)],[t42:1,t40:2]) ).
cnf(t44,plain,
safe(n0,s(s(s(n0)))),
inference(extension,[status(thm),parent(t18:3)],[no_missionaries_is_safe]) ).
cnf(t45,plain,
$false,
inference(connection,[status(thm),parent(t44:1)],[t44:1,t18:3]) ).
cnf(t46,plain,
( ~ greater_or_equal(s(s(s(n0))),n0)
| safe(s(s(s(n0))),n0) ),
inference(extension,[status(thm),parent(t18:4)],[same_or_more_missionaries_is_safe]) ).
cnf(t47,plain,
$false,
inference(connection,[status(thm),parent(t46:1)],[t46:1,t18:4]) ).
cnf(t48,plain,
greater_or_equal(s(s(s(n0))),n0),
inference(extension,[status(thm),parent(t46:2)],[great_eq_base]) ).
cnf(t49,plain,
$false,
inference(connection,[status(thm),parent(t48:1)],[t48:1,t46:2]) ).
cnf(t50,plain,
safe(n0,s(s(n0))),
inference(extension,[status(thm),parent(t16:3)],[no_missionaries_is_safe]) ).
cnf(t51,plain,
$false,
inference(connection,[status(thm),parent(t50:1)],[t50:1,t16:3]) ).
cnf(t52,plain,
( ~ greater_or_equal(s(s(s(n0))),s(n0))
| safe(s(s(s(n0))),s(n0)) ),
inference(extension,[status(thm),parent(t16:4)],[same_or_more_missionaries_is_safe]) ).
cnf(t53,plain,
$false,
inference(connection,[status(thm),parent(t52:1)],[t52:1,t16:4]) ).
cnf(t54,plain,
( ~ greater_or_equal(s(s(n0)),n0)
| greater_or_equal(s(s(s(n0))),s(n0)) ),
inference(extension,[status(thm),parent(t52:2)],[great_eq_recursive]) ).
cnf(t55,plain,
$false,
inference(connection,[status(thm),parent(t54:1)],[t54:1,t52:2]) ).
cnf(t56,plain,
greater_or_equal(s(s(n0)),n0),
inference(extension,[status(thm),parent(t54:2)],[great_eq_base]) ).
cnf(t57,plain,
$false,
inference(connection,[status(thm),parent(t56:1)],[t56:1,t54:2]) ).
cnf(t58,plain,
( ~ greater_or_equal(s(s(n0)),s(s(n0)))
| safe(s(s(n0)),s(s(n0))) ),
inference(extension,[status(thm),parent(t14:3)],[same_or_more_missionaries_is_safe]) ).
cnf(t59,plain,
$false,
inference(connection,[status(thm),parent(t58:1)],[t58:1,t14:3]) ).
cnf(t60,plain,
( ~ greater_or_equal(s(n0),s(n0))
| greater_or_equal(s(s(n0)),s(s(n0))) ),
inference(extension,[status(thm),parent(t58:2)],[great_eq_recursive]) ).
cnf(t61,plain,
$false,
inference(connection,[status(thm),parent(t60:1)],[t60:1,t58:2]) ).
cnf(t62,plain,
( ~ greater_or_equal(n0,n0)
| greater_or_equal(s(n0),s(n0)) ),
inference(extension,[status(thm),parent(t60:2)],[great_eq_recursive]) ).
cnf(t63,plain,
$false,
inference(connection,[status(thm),parent(t62:1)],[t62:1,t60:2]) ).
cnf(t64,plain,
greater_or_equal(n0,n0),
inference(extension,[status(thm),parent(t62:2)],[great_eq_base]) ).
cnf(t65,plain,
$false,
inference(connection,[status(thm),parent(t64:1)],[t64:1,t62:2]) ).
cnf(t66,plain,
( ~ greater_or_equal(s(n0),s(n0))
| safe(s(n0),s(n0)) ),
inference(extension,[status(thm),parent(t14:4)],[same_or_more_missionaries_is_safe]) ).
cnf(t67,plain,
$false,
inference(connection,[status(thm),parent(t66:1)],[t66:1,t14:4]) ).
cnf(t68,plain,
( ~ greater_or_equal(n0,n0)
| greater_or_equal(s(n0),s(n0)) ),
inference(extension,[status(thm),parent(t66:2)],[great_eq_recursive]) ).
cnf(t69,plain,
$false,
inference(connection,[status(thm),parent(t68:1)],[t68:1,t66:2]) ).
cnf(t70,plain,
greater_or_equal(n0,n0),
inference(extension,[status(thm),parent(t68:2)],[great_eq_base]) ).
cnf(t71,plain,
$false,
inference(connection,[status(thm),parent(t70:1)],[t70:1,t68:2]) ).
cnf(t72,plain,
( ~ greater_or_equal(s(n0),s(n0))
| safe(s(n0),s(n0)) ),
inference(extension,[status(thm),parent(t12:3)],[same_or_more_missionaries_is_safe]) ).
cnf(t73,plain,
$false,
inference(connection,[status(thm),parent(t72:1)],[t72:1,t12:3]) ).
cnf(t74,plain,
( ~ greater_or_equal(n0,n0)
| greater_or_equal(s(n0),s(n0)) ),
inference(extension,[status(thm),parent(t72:2)],[great_eq_recursive]) ).
cnf(t75,plain,
$false,
inference(connection,[status(thm),parent(t74:1)],[t74:1,t72:2]) ).
cnf(t76,plain,
greater_or_equal(n0,n0),
inference(extension,[status(thm),parent(t74:2)],[great_eq_base]) ).
cnf(t77,plain,
$false,
inference(connection,[status(thm),parent(t76:1)],[t76:1,t74:2]) ).
cnf(t78,plain,
( ~ greater_or_equal(s(s(n0)),s(s(n0)))
| safe(s(s(n0)),s(s(n0))) ),
inference(extension,[status(thm),parent(t12:4)],[same_or_more_missionaries_is_safe]) ).
cnf(t79,plain,
$false,
inference(connection,[status(thm),parent(t78:1)],[t78:1,t12:4]) ).
cnf(t80,plain,
( ~ greater_or_equal(s(n0),s(n0))
| greater_or_equal(s(s(n0)),s(s(n0))) ),
inference(extension,[status(thm),parent(t78:2)],[great_eq_recursive]) ).
cnf(t81,plain,
$false,
inference(connection,[status(thm),parent(t80:1)],[t80:1,t78:2]) ).
cnf(t82,plain,
( ~ greater_or_equal(n0,n0)
| greater_or_equal(s(n0),s(n0)) ),
inference(extension,[status(thm),parent(t80:2)],[great_eq_recursive]) ).
cnf(t83,plain,
$false,
inference(connection,[status(thm),parent(t82:1)],[t82:1,t80:2]) ).
cnf(t84,plain,
greater_or_equal(n0,n0),
inference(extension,[status(thm),parent(t82:2)],[great_eq_base]) ).
cnf(t85,plain,
$false,
inference(connection,[status(thm),parent(t84:1)],[t84:1,t82:2]) ).
cnf(t86,plain,
( ~ greater_or_equal(s(s(s(n0))),s(n0))
| safe(s(s(s(n0))),s(n0)) ),
inference(extension,[status(thm),parent(t10:3)],[same_or_more_missionaries_is_safe]) ).
cnf(t87,plain,
$false,
inference(connection,[status(thm),parent(t86:1)],[t86:1,t10:3]) ).
cnf(t88,plain,
( ~ greater_or_equal(s(s(n0)),n0)
| greater_or_equal(s(s(s(n0))),s(n0)) ),
inference(extension,[status(thm),parent(t86:2)],[great_eq_recursive]) ).
cnf(t89,plain,
$false,
inference(connection,[status(thm),parent(t88:1)],[t88:1,t86:2]) ).
cnf(t90,plain,
greater_or_equal(s(s(n0)),n0),
inference(extension,[status(thm),parent(t88:2)],[great_eq_base]) ).
cnf(t91,plain,
$false,
inference(connection,[status(thm),parent(t90:1)],[t90:1,t88:2]) ).
cnf(t92,plain,
safe(n0,s(s(n0))),
inference(extension,[status(thm),parent(t10:4)],[no_missionaries_is_safe]) ).
cnf(t93,plain,
$false,
inference(connection,[status(thm),parent(t92:1)],[t92:1,t10:4]) ).
cnf(t94,plain,
( ~ greater_or_equal(s(s(s(n0))),n0)
| safe(s(s(s(n0))),n0) ),
inference(extension,[status(thm),parent(t8:3)],[same_or_more_missionaries_is_safe]) ).
cnf(t95,plain,
$false,
inference(connection,[status(thm),parent(t94:1)],[t94:1,t8:3]) ).
cnf(t96,plain,
greater_or_equal(s(s(s(n0))),n0),
inference(extension,[status(thm),parent(t94:2)],[great_eq_base]) ).
cnf(t97,plain,
$false,
inference(connection,[status(thm),parent(t96:1)],[t96:1,t94:2]) ).
cnf(t98,plain,
safe(n0,s(s(s(n0)))),
inference(extension,[status(thm),parent(t8:4)],[no_missionaries_is_safe]) ).
cnf(t99,plain,
$false,
inference(connection,[status(thm),parent(t98:1)],[t98:1,t8:4]) ).
cnf(t100,plain,
( ~ greater_or_equal(s(s(s(n0))),s(s(n0)))
| safe(s(s(s(n0))),s(s(n0))) ),
inference(extension,[status(thm),parent(t6:3)],[same_or_more_missionaries_is_safe]) ).
cnf(t101,plain,
$false,
inference(connection,[status(thm),parent(t100:1)],[t100:1,t6:3]) ).
cnf(t102,plain,
( ~ greater_or_equal(s(s(n0)),s(n0))
| greater_or_equal(s(s(s(n0))),s(s(n0))) ),
inference(extension,[status(thm),parent(t100:2)],[great_eq_recursive]) ).
cnf(t103,plain,
$false,
inference(connection,[status(thm),parent(t102:1)],[t102:1,t100:2]) ).
cnf(t104,plain,
( ~ greater_or_equal(s(n0),n0)
| greater_or_equal(s(s(n0)),s(n0)) ),
inference(extension,[status(thm),parent(t102:2)],[great_eq_recursive]) ).
cnf(t105,plain,
$false,
inference(connection,[status(thm),parent(t104:1)],[t104:1,t102:2]) ).
cnf(t106,plain,
greater_or_equal(s(n0),n0),
inference(extension,[status(thm),parent(t104:2)],[great_eq_base]) ).
cnf(t107,plain,
$false,
inference(connection,[status(thm),parent(t106:1)],[t106:1,t104:2]) ).
cnf(t108,plain,
safe(n0,s(n0)),
inference(extension,[status(thm),parent(t6:4)],[no_missionaries_is_safe]) ).
cnf(t109,plain,
$false,
inference(connection,[status(thm),parent(t108:1)],[t108:1,t6:4]) ).
cnf(t110,plain,
( ~ greater_or_equal(s(s(n0)),s(s(n0)))
| safe(s(s(n0)),s(s(n0))) ),
inference(extension,[status(thm),parent(t4:3)],[same_or_more_missionaries_is_safe]) ).
cnf(t111,plain,
$false,
inference(connection,[status(thm),parent(t110:1)],[t110:1,t4:3]) ).
cnf(t112,plain,
( ~ greater_or_equal(s(n0),s(n0))
| greater_or_equal(s(s(n0)),s(s(n0))) ),
inference(extension,[status(thm),parent(t110:2)],[great_eq_recursive]) ).
cnf(t113,plain,
$false,
inference(connection,[status(thm),parent(t112:1)],[t112:1,t110:2]) ).
cnf(t114,plain,
( ~ greater_or_equal(n0,n0)
| greater_or_equal(s(n0),s(n0)) ),
inference(extension,[status(thm),parent(t112:2)],[great_eq_recursive]) ).
cnf(t115,plain,
$false,
inference(connection,[status(thm),parent(t114:1)],[t114:1,t112:2]) ).
cnf(t116,plain,
greater_or_equal(n0,n0),
inference(extension,[status(thm),parent(t114:2)],[great_eq_base]) ).
cnf(t117,plain,
$false,
inference(connection,[status(thm),parent(t116:1)],[t116:1,t114:2]) ).
cnf(t118,plain,
( ~ greater_or_equal(s(n0),s(n0))
| safe(s(n0),s(n0)) ),
inference(extension,[status(thm),parent(t4:4)],[same_or_more_missionaries_is_safe]) ).
cnf(t119,plain,
$false,
inference(connection,[status(thm),parent(t118:1)],[t118:1,t4:4]) ).
cnf(t120,plain,
( ~ greater_or_equal(n0,n0)
| greater_or_equal(s(n0),s(n0)) ),
inference(extension,[status(thm),parent(t118:2)],[great_eq_recursive]) ).
cnf(t121,plain,
$false,
inference(connection,[status(thm),parent(t120:1)],[t120:1,t118:2]) ).
cnf(t122,plain,
greater_or_equal(n0,n0),
inference(extension,[status(thm),parent(t120:2)],[great_eq_base]) ).
cnf(t123,plain,
$false,
inference(connection,[status(thm),parent(t122:1)],[t122:1,t120:2]) ).
cnf(t124,plain,
( ~ greater_or_equal(s(s(s(n0))),s(s(s(n0))))
| safe(s(s(s(n0))),s(s(s(n0)))) ),
inference(extension,[status(thm),parent(t2:3)],[same_or_more_missionaries_is_safe]) ).
cnf(t125,plain,
$false,
inference(connection,[status(thm),parent(t124:1)],[t124:1,t2:3]) ).
cnf(t126,plain,
( ~ greater_or_equal(s(s(n0)),s(s(n0)))
| greater_or_equal(s(s(s(n0))),s(s(s(n0)))) ),
inference(extension,[status(thm),parent(t124:2)],[great_eq_recursive]) ).
cnf(t127,plain,
$false,
inference(connection,[status(thm),parent(t126:1)],[t126:1,t124:2]) ).
cnf(t128,plain,
( ~ greater_or_equal(s(n0),s(n0))
| greater_or_equal(s(s(n0)),s(s(n0))) ),
inference(extension,[status(thm),parent(t126:2)],[great_eq_recursive]) ).
cnf(t129,plain,
$false,
inference(connection,[status(thm),parent(t128:1)],[t128:1,t126:2]) ).
cnf(t130,plain,
( ~ greater_or_equal(n0,n0)
| greater_or_equal(s(n0),s(n0)) ),
inference(extension,[status(thm),parent(t128:2)],[great_eq_recursive]) ).
cnf(t131,plain,
$false,
inference(connection,[status(thm),parent(t130:1)],[t130:1,t128:2]) ).
cnf(t132,plain,
greater_or_equal(n0,n0),
inference(extension,[status(thm),parent(t130:2)],[great_eq_base]) ).
cnf(t133,plain,
$false,
inference(connection,[status(thm),parent(t132:1)],[t132:1,t130:2]) ).
cnf(t134,plain,
( ~ greater_or_equal(n0,n0)
| safe(n0,n0) ),
inference(extension,[status(thm),parent(t2:4)],[same_or_more_missionaries_is_safe]) ).
cnf(t135,plain,
$false,
inference(connection,[status(thm),parent(t134:1)],[t134:1,t2:4]) ).
cnf(t136,plain,
greater_or_equal(n0,n0),
inference(extension,[status(thm),parent(t134:2)],[great_eq_base]) ).
cnf(t137,plain,
$false,
inference(connection,[status(thm),parent(t136:1)],[t136:1,t134:2]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : PUZ008-3 : TPTP v9.3.1. Released v1.2.0.
% 0.00/0.03 This is a CNF_UNS_RFO_NEQ_HRN problem
% 0.00/0.04 % Command : /export/starexec/sandbox/solver/bin/connect++ --verbosity 1 --no-colour --tptp-proof --schedule default --timeout 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.09/0.36 % Computer : n003.cluster.edu
% 0.09/0.36 % Model : x86_64 x86_64
% 0.09/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.36 % Memory : 8046.5625MB
% 0.09/0.36 % OS : Linux 6.8.0-71-generic
% 0.09/0.36 % CPULimit : 300
% 0.09/0.36 % WCLimit : 300
% 0.09/0.36 % DateTime : Sat Sep 19 19:56:44 UTC 2026
% 0.09/0.37 % CPUTime :
% 27.15/27.46 % SZS status Unsatisfiable for theBenchmark
% 27.15/27.46 % SZS output start Proof for theBenchmark
% See solution above
%------------------------------------------------------------------------------