TSTP Solution File: PUZ008-3 by Metis---2.4

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Metis---2.4
% Problem  : PUZ008-3 : TPTP v8.1.0. Released v1.2.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : metis --show proof --show saturation %s

% Computer : n029.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  : 600s
% DateTime : Mon Jul 18 18:20:25 EDT 2022

% Result   : Unsatisfiable 0.12s 0.38s
% Output   : CNFRefutation 0.18s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   37
%            Number of leaves      :   10
% Syntax   : Number of clauses     :   85 (  39 unt;   0 nHn;  71 RR)
%            Number of literals    :  172 (   0 equ;  89 neg)
%            Maximal clause size   :    4 (   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   :   42 (  15 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(no_missionaries_is_safe,axiom,
    safe(n0,X) ).

cnf(same_or_more_missionaries_is_safe,axiom,
    ( ~ greater_or_equal(X,Y)
    | safe(X,Y) ) ).

cnf(great_eq_base,axiom,
    greater_or_equal(X,n0) ).

cnf(great_eq_recursive,axiom,
    ( greater_or_equal(s(X),s(Y))
    | ~ greater_or_equal(X,Y) ) ).

cnf(cannibal_east_to_west,axiom,
    ( ~ achievable(west(m(X),c(Y)),boatoneast,east(m(Z),c(s(W))))
    | ~ safe(X,s(Y))
    | ~ safe(Z,W)
    | achievable(west(m(X),c(s(Y))),boatonwest,east(m(Z),c(W))) ) ).

cnf(two_cannibals_west_to_east,axiom,
    ( ~ achievable(west(m(X),c(s(s(Y)))),boatonwest,east(m(Z),c(W)))
    | ~ safe(X,Y)
    | ~ safe(Z,s(s(W)))
    | achievable(west(m(X),c(Y)),boatoneast,east(m(Z),c(s(s(W))))) ) ).

cnf(two_missionaries_west_to_east,axiom,
    ( ~ achievable(west(m(s(s(X))),c(Y)),boatonwest,east(m(Z),c(W)))
    | ~ safe(X,Y)
    | ~ safe(s(s(Z)),W)
    | achievable(west(m(X),c(Y)),boatoneast,east(m(s(s(Z))),c(W))) ) ).

cnf(missionary_and_cannibal_east_to_west,axiom,
    ( ~ achievable(west(m(X),c(Y)),boatoneast,east(m(s(Z)),c(s(W))))
    | ~ safe(s(X),s(Y))
    | ~ safe(Z,W)
    | achievable(west(m(s(X)),c(s(Y))),boatonwest,east(m(Z),c(W))) ) ).

cnf(start_on_west_bank,hypothesis,
    achievable(west(m(s(s(s(n0)))),c(s(s(s(n0))))),boatonwest,east(m(n0),c(n0))) ).

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)))))) ).

cnf(refute_0_0,plain,
    ( ~ achievable(west(m(n0),c(s(s(n0)))),boatonwest,east(m(s(s(s(n0)))),c(s(n0))))
    | ~ safe(n0,n0)
    | ~ safe(s(s(s(n0))),s(s(s(n0))))
    | achievable(west(m(n0),c(n0)),boatoneast,east(m(s(s(s(n0)))),c(s(s(s(n0)))))) ),
    inference(subst,[],[two_cannibals_west_to_east:[bind(W,$fot(s(n0))),bind(X,$fot(n0)),bind(Y,$fot(n0)),bind(Z,$fot(s(s(s(n0)))))]]) ).

cnf(refute_0_1,plain,
    ( ~ achievable(west(m(n0),c(s(n0))),boatoneast,east(m(s(s(s(n0)))),c(s(s(n0)))))
    | ~ safe(n0,s(s(n0)))
    | ~ safe(s(s(s(n0))),s(n0))
    | achievable(west(m(n0),c(s(s(n0)))),boatonwest,east(m(s(s(s(n0)))),c(s(n0)))) ),
    inference(subst,[],[cannibal_east_to_west:[bind(W,$fot(s(n0))),bind(X,$fot(n0)),bind(Y,$fot(s(n0))),bind(Z,$fot(s(s(s(n0)))))]]) ).

cnf(refute_0_2,plain,
    ( ~ achievable(west(m(n0),c(s(s(s(n0))))),boatonwest,east(m(s(s(s(n0)))),c(n0)))
    | ~ safe(n0,s(n0))
    | ~ safe(s(s(s(n0))),s(s(n0)))
    | achievable(west(m(n0),c(s(n0))),boatoneast,east(m(s(s(s(n0)))),c(s(s(n0))))) ),
    inference(subst,[],[two_cannibals_west_to_east:[bind(W,$fot(n0)),bind(X,$fot(n0)),bind(Y,$fot(s(n0))),bind(Z,$fot(s(s(s(n0)))))]]) ).

cnf(refute_0_3,plain,
    ( ~ achievable(west(m(n0),c(s(s(n0)))),boatoneast,east(m(s(s(s(n0)))),c(s(n0))))
    | ~ safe(n0,s(s(s(n0))))
    | ~ safe(s(s(s(n0))),n0)
    | achievable(west(m(n0),c(s(s(s(n0))))),boatonwest,east(m(s(s(s(n0)))),c(n0))) ),
    inference(subst,[],[cannibal_east_to_west:[bind(W,$fot(n0)),bind(X,$fot(n0)),bind(Y,$fot(s(s(n0)))),bind(Z,$fot(s(s(s(n0)))))]]) ).

cnf(refute_0_4,plain,
    ( ~ achievable(west(m(s(s(n0))),c(s(s(n0)))),boatonwest,east(m(s(n0)),c(s(n0))))
    | ~ safe(n0,s(s(n0)))
    | ~ safe(s(s(s(n0))),s(n0))
    | achievable(west(m(n0),c(s(s(n0)))),boatoneast,east(m(s(s(s(n0)))),c(s(n0)))) ),
    inference(subst,[],[two_missionaries_west_to_east:[bind(W,$fot(s(n0))),bind(X,$fot(n0)),bind(Y,$fot(s(s(n0)))),bind(Z,$fot(s(n0)))]]) ).

cnf(refute_0_5,plain,
    ( ~ achievable(west(m(s(s(s(n0)))),c(n0)),boatoneast,east(m(n0),c(s(s(s(n0))))))
    | ~ safe(n0,s(s(n0)))
    | ~ safe(s(s(s(n0))),s(n0))
    | achievable(west(m(s(s(s(n0)))),c(s(n0))),boatonwest,east(m(n0),c(s(s(n0))))) ),
    inference(subst,[],[cannibal_east_to_west:[bind(W,$fot(s(s(n0)))),bind(X,$fot(s(s(s(n0))))),bind(Y,$fot(n0)),bind(Z,$fot(n0))]]) ).

cnf(refute_0_6,plain,
    ( ~ achievable(west(m(s(s(s(n0)))),c(s(s(n0)))),boatonwest,east(m(n0),c(s(n0))))
    | ~ safe(n0,s(s(s(n0))))
    | ~ safe(s(s(s(n0))),n0)
    | achievable(west(m(s(s(s(n0)))),c(n0)),boatoneast,east(m(n0),c(s(s(s(n0)))))) ),
    inference(subst,[],[two_cannibals_west_to_east:[bind(W,$fot(s(n0))),bind(X,$fot(s(s(s(n0))))),bind(Y,$fot(n0)),bind(Z,$fot(n0))]]) ).

cnf(refute_0_7,plain,
    ( ~ achievable(west(m(s(s(s(n0)))),c(s(n0))),boatoneast,east(m(n0),c(s(s(n0)))))
    | ~ safe(n0,s(n0))
    | ~ safe(s(s(s(n0))),s(s(n0)))
    | achievable(west(m(s(s(s(n0)))),c(s(s(n0)))),boatonwest,east(m(n0),c(s(n0)))) ),
    inference(subst,[],[cannibal_east_to_west:[bind(W,$fot(s(n0))),bind(X,$fot(s(s(s(n0))))),bind(Y,$fot(s(n0))),bind(Z,$fot(n0))]]) ).

cnf(refute_0_8,plain,
    ( ~ achievable(west(m(s(s(s(n0)))),c(s(s(s(n0))))),boatonwest,east(m(n0),c(n0)))
    | ~ safe(n0,s(s(n0)))
    | ~ safe(s(s(s(n0))),s(n0))
    | achievable(west(m(s(s(s(n0)))),c(s(n0))),boatoneast,east(m(n0),c(s(s(n0))))) ),
    inference(subst,[],[two_cannibals_west_to_east:[bind(W,$fot(n0)),bind(X,$fot(s(s(s(n0))))),bind(Y,$fot(s(n0))),bind(Z,$fot(n0))]]) ).

cnf(refute_0_9,plain,
    ( ~ safe(n0,s(s(n0)))
    | ~ safe(s(s(s(n0))),s(n0))
    | achievable(west(m(s(s(s(n0)))),c(s(n0))),boatoneast,east(m(n0),c(s(s(n0))))) ),
    inference(resolve,[$cnf( achievable(west(m(s(s(s(n0)))),c(s(s(s(n0))))),boatonwest,east(m(n0),c(n0))) )],[start_on_west_bank,refute_0_8]) ).

cnf(refute_0_10,plain,
    safe(n0,s(s(n0))),
    inference(subst,[],[no_missionaries_is_safe:[bind(X,$fot(s(s(n0))))]]) ).

cnf(refute_0_11,plain,
    ( ~ safe(s(s(s(n0))),s(n0))
    | achievable(west(m(s(s(s(n0)))),c(s(n0))),boatoneast,east(m(n0),c(s(s(n0))))) ),
    inference(resolve,[$cnf( safe(n0,s(s(n0))) )],[refute_0_10,refute_0_9]) ).

cnf(refute_0_12,plain,
    ( ~ greater_or_equal(s(X_8),s(n0))
    | safe(s(X_8),s(n0)) ),
    inference(subst,[],[same_or_more_missionaries_is_safe:[bind(X,$fot(s(X_8))),bind(Y,$fot(s(n0)))]]) ).

cnf(refute_0_13,plain,
    greater_or_equal(X_6,n0),
    inference(subst,[],[great_eq_base:[bind(X,$fot(X_6))]]) ).

cnf(refute_0_14,plain,
    ( ~ greater_or_equal(X_6,n0)
    | greater_or_equal(s(X_6),s(n0)) ),
    inference(subst,[],[great_eq_recursive:[bind(X,$fot(X_6)),bind(Y,$fot(n0))]]) ).

cnf(refute_0_15,plain,
    greater_or_equal(s(X_6),s(n0)),
    inference(resolve,[$cnf( greater_or_equal(X_6,n0) )],[refute_0_13,refute_0_14]) ).

cnf(refute_0_16,plain,
    greater_or_equal(s(X_8),s(n0)),
    inference(subst,[],[refute_0_15:[bind(X_6,$fot(X_8))]]) ).

cnf(refute_0_17,plain,
    safe(s(X_8),s(n0)),
    inference(resolve,[$cnf( greater_or_equal(s(X_8),s(n0)) )],[refute_0_16,refute_0_12]) ).

cnf(refute_0_18,plain,
    safe(s(s(s(n0))),s(n0)),
    inference(subst,[],[refute_0_17:[bind(X_8,$fot(s(s(n0))))]]) ).

cnf(refute_0_19,plain,
    achievable(west(m(s(s(s(n0)))),c(s(n0))),boatoneast,east(m(n0),c(s(s(n0))))),
    inference(resolve,[$cnf( safe(s(s(s(n0))),s(n0)) )],[refute_0_18,refute_0_11]) ).

cnf(refute_0_20,plain,
    ( ~ safe(n0,s(n0))
    | ~ safe(s(s(s(n0))),s(s(n0)))
    | achievable(west(m(s(s(s(n0)))),c(s(s(n0)))),boatonwest,east(m(n0),c(s(n0)))) ),
    inference(resolve,[$cnf( achievable(west(m(s(s(s(n0)))),c(s(n0))),boatoneast,east(m(n0),c(s(s(n0))))) )],[refute_0_19,refute_0_7]) ).

cnf(refute_0_21,plain,
    safe(n0,s(n0)),
    inference(subst,[],[no_missionaries_is_safe:[bind(X,$fot(s(n0)))]]) ).

cnf(refute_0_22,plain,
    ( ~ safe(s(s(s(n0))),s(s(n0)))
    | achievable(west(m(s(s(s(n0)))),c(s(s(n0)))),boatonwest,east(m(n0),c(s(n0)))) ),
    inference(resolve,[$cnf( safe(n0,s(n0)) )],[refute_0_21,refute_0_20]) ).

cnf(refute_0_23,plain,
    ( ~ greater_or_equal(s(s(X_10)),s(s(n0)))
    | safe(s(s(X_10)),s(s(n0))) ),
    inference(subst,[],[same_or_more_missionaries_is_safe:[bind(X,$fot(s(s(X_10)))),bind(Y,$fot(s(s(n0))))]]) ).

cnf(refute_0_24,plain,
    ( ~ greater_or_equal(s(X_8),s(n0))
    | greater_or_equal(s(s(X_8)),s(s(n0))) ),
    inference(subst,[],[great_eq_recursive:[bind(X,$fot(s(X_8))),bind(Y,$fot(s(n0)))]]) ).

cnf(refute_0_25,plain,
    greater_or_equal(s(s(X_8)),s(s(n0))),
    inference(resolve,[$cnf( greater_or_equal(s(X_8),s(n0)) )],[refute_0_16,refute_0_24]) ).

cnf(refute_0_26,plain,
    greater_or_equal(s(s(X_10)),s(s(n0))),
    inference(subst,[],[refute_0_25:[bind(X_8,$fot(X_10))]]) ).

cnf(refute_0_27,plain,
    safe(s(s(X_10)),s(s(n0))),
    inference(resolve,[$cnf( greater_or_equal(s(s(X_10)),s(s(n0))) )],[refute_0_26,refute_0_23]) ).

cnf(refute_0_28,plain,
    safe(s(s(s(n0))),s(s(n0))),
    inference(subst,[],[refute_0_27:[bind(X_10,$fot(s(n0)))]]) ).

cnf(refute_0_29,plain,
    achievable(west(m(s(s(s(n0)))),c(s(s(n0)))),boatonwest,east(m(n0),c(s(n0)))),
    inference(resolve,[$cnf( safe(s(s(s(n0))),s(s(n0))) )],[refute_0_28,refute_0_22]) ).

cnf(refute_0_30,plain,
    ( ~ safe(n0,s(s(s(n0))))
    | ~ safe(s(s(s(n0))),n0)
    | achievable(west(m(s(s(s(n0)))),c(n0)),boatoneast,east(m(n0),c(s(s(s(n0)))))) ),
    inference(resolve,[$cnf( achievable(west(m(s(s(s(n0)))),c(s(s(n0)))),boatonwest,east(m(n0),c(s(n0)))) )],[refute_0_29,refute_0_6]) ).

cnf(refute_0_31,plain,
    safe(n0,s(s(s(n0)))),
    inference(subst,[],[no_missionaries_is_safe:[bind(X,$fot(s(s(s(n0)))))]]) ).

cnf(refute_0_32,plain,
    ( ~ safe(s(s(s(n0))),n0)
    | achievable(west(m(s(s(s(n0)))),c(n0)),boatoneast,east(m(n0),c(s(s(s(n0)))))) ),
    inference(resolve,[$cnf( safe(n0,s(s(s(n0)))) )],[refute_0_31,refute_0_30]) ).

cnf(refute_0_33,plain,
    greater_or_equal(X_3,n0),
    inference(subst,[],[great_eq_base:[bind(X,$fot(X_3))]]) ).

cnf(refute_0_34,plain,
    ( ~ greater_or_equal(X_3,n0)
    | safe(X_3,n0) ),
    inference(subst,[],[same_or_more_missionaries_is_safe:[bind(X,$fot(X_3)),bind(Y,$fot(n0))]]) ).

cnf(refute_0_35,plain,
    safe(X_3,n0),
    inference(resolve,[$cnf( greater_or_equal(X_3,n0) )],[refute_0_33,refute_0_34]) ).

cnf(refute_0_36,plain,
    safe(s(s(s(n0))),n0),
    inference(subst,[],[refute_0_35:[bind(X_3,$fot(s(s(s(n0)))))]]) ).

cnf(refute_0_37,plain,
    achievable(west(m(s(s(s(n0)))),c(n0)),boatoneast,east(m(n0),c(s(s(s(n0)))))),
    inference(resolve,[$cnf( safe(s(s(s(n0))),n0) )],[refute_0_36,refute_0_32]) ).

cnf(refute_0_38,plain,
    ( ~ safe(n0,s(s(n0)))
    | ~ safe(s(s(s(n0))),s(n0))
    | achievable(west(m(s(s(s(n0)))),c(s(n0))),boatonwest,east(m(n0),c(s(s(n0))))) ),
    inference(resolve,[$cnf( achievable(west(m(s(s(s(n0)))),c(n0)),boatoneast,east(m(n0),c(s(s(s(n0)))))) )],[refute_0_37,refute_0_5]) ).

cnf(refute_0_39,plain,
    ( ~ safe(s(s(s(n0))),s(n0))
    | achievable(west(m(s(s(s(n0)))),c(s(n0))),boatonwest,east(m(n0),c(s(s(n0))))) ),
    inference(resolve,[$cnf( safe(n0,s(s(n0))) )],[refute_0_10,refute_0_38]) ).

cnf(refute_0_40,plain,
    achievable(west(m(s(s(s(n0)))),c(s(n0))),boatonwest,east(m(n0),c(s(s(n0))))),
    inference(resolve,[$cnf( safe(s(s(s(n0))),s(n0)) )],[refute_0_18,refute_0_39]) ).

cnf(refute_0_41,plain,
    ( ~ achievable(west(m(s(s(s(n0)))),c(s(n0))),boatonwest,east(m(n0),c(s(s(n0)))))
    | ~ 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))))) ),
    inference(subst,[],[two_missionaries_west_to_east:[bind(W,$fot(s(s(n0)))),bind(X,$fot(s(n0))),bind(Y,$fot(s(n0))),bind(Z,$fot(n0))]]) ).

cnf(refute_0_42,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))))) ),
    inference(resolve,[$cnf( achievable(west(m(s(s(s(n0)))),c(s(n0))),boatonwest,east(m(n0),c(s(s(n0))))) )],[refute_0_40,refute_0_41]) ).

cnf(refute_0_43,plain,
    safe(s(n0),s(n0)),
    inference(subst,[],[refute_0_17:[bind(X_8,$fot(n0))]]) ).

cnf(refute_0_44,plain,
    ( ~ 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))))) ),
    inference(resolve,[$cnf( safe(s(n0),s(n0)) )],[refute_0_43,refute_0_42]) ).

cnf(refute_0_45,plain,
    safe(s(s(n0)),s(s(n0))),
    inference(subst,[],[refute_0_27:[bind(X_10,$fot(n0))]]) ).

cnf(refute_0_46,plain,
    achievable(west(m(s(n0)),c(s(n0))),boatoneast,east(m(s(s(n0))),c(s(s(n0))))),
    inference(resolve,[$cnf( safe(s(s(n0)),s(s(n0))) )],[refute_0_45,refute_0_44]) ).

cnf(refute_0_47,plain,
    ( ~ achievable(west(m(s(n0)),c(s(n0))),boatoneast,east(m(s(s(n0))),c(s(s(n0)))))
    | ~ safe(s(n0),s(n0))
    | ~ safe(s(s(n0)),s(s(n0)))
    | achievable(west(m(s(s(n0))),c(s(s(n0)))),boatonwest,east(m(s(n0)),c(s(n0)))) ),
    inference(subst,[],[missionary_and_cannibal_east_to_west:[bind(W,$fot(s(n0))),bind(X,$fot(s(n0))),bind(Y,$fot(s(n0))),bind(Z,$fot(s(n0)))]]) ).

cnf(refute_0_48,plain,
    ( ~ safe(s(n0),s(n0))
    | ~ safe(s(s(n0)),s(s(n0)))
    | achievable(west(m(s(s(n0))),c(s(s(n0)))),boatonwest,east(m(s(n0)),c(s(n0)))) ),
    inference(resolve,[$cnf( achievable(west(m(s(n0)),c(s(n0))),boatoneast,east(m(s(s(n0))),c(s(s(n0))))) )],[refute_0_46,refute_0_47]) ).

cnf(refute_0_49,plain,
    ( ~ safe(s(s(n0)),s(s(n0)))
    | achievable(west(m(s(s(n0))),c(s(s(n0)))),boatonwest,east(m(s(n0)),c(s(n0)))) ),
    inference(resolve,[$cnf( safe(s(n0),s(n0)) )],[refute_0_43,refute_0_48]) ).

cnf(refute_0_50,plain,
    achievable(west(m(s(s(n0))),c(s(s(n0)))),boatonwest,east(m(s(n0)),c(s(n0)))),
    inference(resolve,[$cnf( safe(s(s(n0)),s(s(n0))) )],[refute_0_45,refute_0_49]) ).

cnf(refute_0_51,plain,
    ( ~ safe(n0,s(s(n0)))
    | ~ safe(s(s(s(n0))),s(n0))
    | achievable(west(m(n0),c(s(s(n0)))),boatoneast,east(m(s(s(s(n0)))),c(s(n0)))) ),
    inference(resolve,[$cnf( achievable(west(m(s(s(n0))),c(s(s(n0)))),boatonwest,east(m(s(n0)),c(s(n0)))) )],[refute_0_50,refute_0_4]) ).

cnf(refute_0_52,plain,
    ( ~ safe(s(s(s(n0))),s(n0))
    | achievable(west(m(n0),c(s(s(n0)))),boatoneast,east(m(s(s(s(n0)))),c(s(n0)))) ),
    inference(resolve,[$cnf( safe(n0,s(s(n0))) )],[refute_0_10,refute_0_51]) ).

cnf(refute_0_53,plain,
    achievable(west(m(n0),c(s(s(n0)))),boatoneast,east(m(s(s(s(n0)))),c(s(n0)))),
    inference(resolve,[$cnf( safe(s(s(s(n0))),s(n0)) )],[refute_0_18,refute_0_52]) ).

cnf(refute_0_54,plain,
    ( ~ safe(n0,s(s(s(n0))))
    | ~ safe(s(s(s(n0))),n0)
    | achievable(west(m(n0),c(s(s(s(n0))))),boatonwest,east(m(s(s(s(n0)))),c(n0))) ),
    inference(resolve,[$cnf( achievable(west(m(n0),c(s(s(n0)))),boatoneast,east(m(s(s(s(n0)))),c(s(n0)))) )],[refute_0_53,refute_0_3]) ).

cnf(refute_0_55,plain,
    ( ~ safe(s(s(s(n0))),n0)
    | achievable(west(m(n0),c(s(s(s(n0))))),boatonwest,east(m(s(s(s(n0)))),c(n0))) ),
    inference(resolve,[$cnf( safe(n0,s(s(s(n0)))) )],[refute_0_31,refute_0_54]) ).

cnf(refute_0_56,plain,
    achievable(west(m(n0),c(s(s(s(n0))))),boatonwest,east(m(s(s(s(n0)))),c(n0))),
    inference(resolve,[$cnf( safe(s(s(s(n0))),n0) )],[refute_0_36,refute_0_55]) ).

cnf(refute_0_57,plain,
    ( ~ safe(n0,s(n0))
    | ~ safe(s(s(s(n0))),s(s(n0)))
    | achievable(west(m(n0),c(s(n0))),boatoneast,east(m(s(s(s(n0)))),c(s(s(n0))))) ),
    inference(resolve,[$cnf( achievable(west(m(n0),c(s(s(s(n0))))),boatonwest,east(m(s(s(s(n0)))),c(n0))) )],[refute_0_56,refute_0_2]) ).

cnf(refute_0_58,plain,
    ( ~ safe(s(s(s(n0))),s(s(n0)))
    | achievable(west(m(n0),c(s(n0))),boatoneast,east(m(s(s(s(n0)))),c(s(s(n0))))) ),
    inference(resolve,[$cnf( safe(n0,s(n0)) )],[refute_0_21,refute_0_57]) ).

cnf(refute_0_59,plain,
    achievable(west(m(n0),c(s(n0))),boatoneast,east(m(s(s(s(n0)))),c(s(s(n0))))),
    inference(resolve,[$cnf( safe(s(s(s(n0))),s(s(n0))) )],[refute_0_28,refute_0_58]) ).

cnf(refute_0_60,plain,
    ( ~ safe(n0,s(s(n0)))
    | ~ safe(s(s(s(n0))),s(n0))
    | achievable(west(m(n0),c(s(s(n0)))),boatonwest,east(m(s(s(s(n0)))),c(s(n0)))) ),
    inference(resolve,[$cnf( achievable(west(m(n0),c(s(n0))),boatoneast,east(m(s(s(s(n0)))),c(s(s(n0))))) )],[refute_0_59,refute_0_1]) ).

cnf(refute_0_61,plain,
    ( ~ safe(s(s(s(n0))),s(n0))
    | achievable(west(m(n0),c(s(s(n0)))),boatonwest,east(m(s(s(s(n0)))),c(s(n0)))) ),
    inference(resolve,[$cnf( safe(n0,s(s(n0))) )],[refute_0_10,refute_0_60]) ).

cnf(refute_0_62,plain,
    achievable(west(m(n0),c(s(s(n0)))),boatonwest,east(m(s(s(s(n0)))),c(s(n0)))),
    inference(resolve,[$cnf( safe(s(s(s(n0))),s(n0)) )],[refute_0_18,refute_0_61]) ).

cnf(refute_0_63,plain,
    ( ~ safe(n0,n0)
    | ~ safe(s(s(s(n0))),s(s(s(n0))))
    | achievable(west(m(n0),c(n0)),boatoneast,east(m(s(s(s(n0)))),c(s(s(s(n0)))))) ),
    inference(resolve,[$cnf( achievable(west(m(n0),c(s(s(n0)))),boatonwest,east(m(s(s(s(n0)))),c(s(n0)))) )],[refute_0_62,refute_0_0]) ).

cnf(refute_0_64,plain,
    safe(n0,n0),
    inference(subst,[],[refute_0_35:[bind(X_3,$fot(n0))]]) ).

cnf(refute_0_65,plain,
    ( ~ safe(s(s(s(n0))),s(s(s(n0))))
    | achievable(west(m(n0),c(n0)),boatoneast,east(m(s(s(s(n0)))),c(s(s(s(n0)))))) ),
    inference(resolve,[$cnf( safe(n0,n0) )],[refute_0_64,refute_0_63]) ).

cnf(refute_0_66,plain,
    ( ~ greater_or_equal(s(s(s(X_12))),s(s(s(n0))))
    | safe(s(s(s(X_12))),s(s(s(n0)))) ),
    inference(subst,[],[same_or_more_missionaries_is_safe:[bind(X,$fot(s(s(s(X_12))))),bind(Y,$fot(s(s(s(n0)))))]]) ).

cnf(refute_0_67,plain,
    ( ~ greater_or_equal(s(s(X_10)),s(s(n0)))
    | greater_or_equal(s(s(s(X_10))),s(s(s(n0)))) ),
    inference(subst,[],[great_eq_recursive:[bind(X,$fot(s(s(X_10)))),bind(Y,$fot(s(s(n0))))]]) ).

cnf(refute_0_68,plain,
    greater_or_equal(s(s(s(X_10))),s(s(s(n0)))),
    inference(resolve,[$cnf( greater_or_equal(s(s(X_10)),s(s(n0))) )],[refute_0_26,refute_0_67]) ).

cnf(refute_0_69,plain,
    greater_or_equal(s(s(s(X_12))),s(s(s(n0)))),
    inference(subst,[],[refute_0_68:[bind(X_10,$fot(X_12))]]) ).

cnf(refute_0_70,plain,
    safe(s(s(s(X_12))),s(s(s(n0)))),
    inference(resolve,[$cnf( greater_or_equal(s(s(s(X_12))),s(s(s(n0)))) )],[refute_0_69,refute_0_66]) ).

cnf(refute_0_71,plain,
    safe(s(s(s(n0))),s(s(s(n0)))),
    inference(subst,[],[refute_0_70:[bind(X_12,$fot(n0))]]) ).

cnf(refute_0_72,plain,
    achievable(west(m(n0),c(n0)),boatoneast,east(m(s(s(s(n0)))),c(s(s(s(n0)))))),
    inference(resolve,[$cnf( safe(s(s(s(n0))),s(s(s(n0)))) )],[refute_0_71,refute_0_65]) ).

cnf(refute_0_73,plain,
    ~ achievable(west(m(n0),c(n0)),boatoneast,east(m(s(s(s(n0)))),c(s(s(s(n0)))))),
    inference(subst,[],[prove_can_get_to_east_bank:[bind(X,$fot(boatoneast))]]) ).

cnf(refute_0_74,plain,
    $false,
    inference(resolve,[$cnf( achievable(west(m(n0),c(n0)),boatoneast,east(m(s(s(s(n0)))),c(s(s(s(n0)))))) )],[refute_0_72,refute_0_73]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.11  % Problem  : PUZ008-3 : TPTP v8.1.0. Released v1.2.0.
% 0.07/0.12  % Command  : metis --show proof --show saturation %s
% 0.12/0.33  % Computer : n029.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  : 600
% 0.12/0.33  % DateTime : Sun May 29 01:14:58 EDT 2022
% 0.12/0.33  % CPUTime  : 
% 0.12/0.33  %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
% 0.12/0.38  % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.12/0.38  
% 0.12/0.38  % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 0.18/0.40  
%------------------------------------------------------------------------------