%------------------------------------------------------------------------------
% File     : SATCoP---0.1
% Problem  : PUZ008-3 : TPTP v8.1.0. Released v1.2.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : satcop --statistics %s

% Computer : n032.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:26:08 EDT 2022

% Result   : Unsatisfiable 0.14s 0.37s
% Output   : Proof 0.14s
% Verified : 
% SZS Type : ERROR: Analysing output (MakeTreeStats fails)

% Comments : 
%------------------------------------------------------------------------------
cnf(g0,plain,
    ~ achievable(west(m(n0),c(n0)),boatoneast,east(m(s(s(s(n0)))),c(s(s(s(n0)))))),
    inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_can_get_to_east_bank)]) ).

cnf(g1,plain,
    ( ~ safe(n0,n0)
    | ~ safe(s(s(s(n0))),s(s(s(n0))))
    | ~ achievable(west(m(n0),c(s(s(n0)))),boatonwest,east(m(s(s(s(n0)))),c(s(n0))))
    | achievable(west(m(n0),c(n0)),boatoneast,east(m(s(s(s(n0)))),c(s(s(s(n0)))))) ),
    inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',two_cannibals_west_to_east)]) ).

cnf(g2,plain,
    safe(n0,n0),
    inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',no_missionaries_is_safe)]) ).

cnf(g3,plain,
    ( ~ safe(n0,s(s(n0)))
    | ~ safe(s(s(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(n0),c(s(s(n0)))),boatonwest,east(m(s(s(s(n0)))),c(s(n0)))) ),
    inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cannibal_east_to_west)]) ).

cnf(g4,plain,
    ( ~ greater_or_equal(s(s(s(n0))),s(s(s(n0))))
    | safe(s(s(s(n0))),s(s(s(n0)))) ),
    inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',same_or_more_missionaries_is_safe)]) ).

cnf(g5,plain,
    ( ~ greater_or_equal(s(s(s(n0))),s(n0))
    | safe(s(s(s(n0))),s(n0)) ),
    inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',same_or_more_missionaries_is_safe)]) ).

cnf(g6,plain,
    ( ~ greater_or_equal(s(s(n0)),s(s(n0)))
    | greater_or_equal(s(s(s(n0))),s(s(s(n0)))) ),
    inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',great_eq_recursive)]) ).

cnf(g7,plain,
    ( ~ greater_or_equal(s(n0),s(n0))
    | safe(s(n0),s(n0)) ),
    inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',same_or_more_missionaries_is_safe)]) ).

cnf(g8,plain,
    ( ~ greater_or_equal(s(s(n0)),s(s(n0)))
    | safe(s(s(n0)),s(s(n0))) ),
    inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',same_or_more_missionaries_is_safe)]) ).

cnf(g9,plain,
    ( ~ greater_or_equal(s(s(s(n0))),s(s(n0)))
    | safe(s(s(s(n0))),s(s(n0))) ),
    inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',same_or_more_missionaries_is_safe)]) ).

cnf(g10,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(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',two_cannibals_west_to_east)]) ).

cnf(g11,plain,
    ( ~ greater_or_equal(s(n0),s(n0))
    | greater_or_equal(s(s(n0)),s(s(n0))) ),
    inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',great_eq_recursive)]) ).

cnf(g12,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(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cannibal_east_to_west)]) ).

cnf(g13,plain,
    safe(n0,s(n0)),
    inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',no_missionaries_is_safe)]) ).

cnf(g14,plain,
    ( ~ greater_or_equal(n0,n0)
    | greater_or_equal(s(n0),s(n0)) ),
    inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',great_eq_recursive)]) ).

cnf(g15,plain,
    greater_or_equal(s(s(n0)),n0),
    inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',great_eq_base)]) ).

cnf(g16,plain,
    safe(n0,s(s(n0))),
    inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',no_missionaries_is_safe)]) ).

cnf(g17,plain,
    ( ~ greater_or_equal(s(s(n0)),n0)
    | greater_or_equal(s(s(s(n0))),s(n0)) ),
    inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',great_eq_recursive)]) ).

cnf(g18,plain,
    ( ~ greater_or_equal(s(s(n0)),s(n0))
    | greater_or_equal(s(s(s(n0))),s(s(n0))) ),
    inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',great_eq_recursive)]) ).

cnf(g19,plain,
    safe(n0,s(s(s(n0)))),
    inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',no_missionaries_is_safe)]) ).

cnf(g20,plain,
    ( ~ greater_or_equal(s(s(s(n0))),n0)
    | safe(s(s(s(n0))),n0) ),
    inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',same_or_more_missionaries_is_safe)]) ).

cnf(g21,plain,
    greater_or_equal(n0,n0),
    inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',great_eq_base)]) ).

cnf(g22,plain,
    greater_or_equal(s(n0),n0),
    inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',great_eq_base)]) ).

cnf(g23,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(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',two_missionaries_west_to_east)]) ).

cnf(g24,plain,
    ( ~ greater_or_equal(s(n0),n0)
    | greater_or_equal(s(s(n0)),s(n0)) ),
    inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',great_eq_recursive)]) ).

cnf(g25,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(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',two_missionaries_west_to_east)]) ).

cnf(g26,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(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',missionary_and_cannibal_east_to_west)]) ).

cnf(g27,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(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cannibal_east_to_west)]) ).

cnf(g28,plain,
    greater_or_equal(s(s(s(n0))),n0),
    inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',great_eq_base)]) ).

cnf(g29,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(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',two_cannibals_west_to_east)]) ).

cnf(g30,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(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cannibal_east_to_west)]) ).

cnf(g31,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(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',two_cannibals_west_to_east)]) ).

cnf(g32,plain,
    achievable(west(m(s(s(s(n0)))),c(s(s(s(n0))))),boatonwest,east(m(n0),c(n0))),
    inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',start_on_west_bank)]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.10  % Problem  : PUZ008-3 : TPTP v8.1.0. Released v1.2.0.
% 0.03/0.10  % Command  : satcop --statistics %s
% 0.10/0.30  % Computer : n032.cluster.edu
% 0.10/0.30  % Model    : x86_64 x86_64
% 0.10/0.30  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.30  % Memory   : 8042.1875MB
% 0.10/0.30  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.10/0.30  % CPULimit : 300
% 0.10/0.30  % WCLimit  : 600
% 0.10/0.30  % DateTime : Sun May 29 01:04:26 EDT 2022
% 0.10/0.30  % CPUTime  : 
% 0.14/0.37  % symbols: 13
% 0.14/0.37  % clauses: 16
% 0.14/0.37  % start clauses: 1
% 0.14/0.37  % iterative deepening steps: 203
% 0.14/0.37  % maximum path limit: 9
% 0.14/0.37  % literal attempts: 70271
% 0.14/0.37  % depth failures: 26002
% 0.14/0.37  % regularity failures: 14726
% 0.14/0.37  % tautology failures: 0
% 0.14/0.37  % reductions: 0
% 0.14/0.37  % extensions: 70112
% 0.14/0.37  % SAT variables: 484
% 0.14/0.37  % SAT clauses: 994
% 0.14/0.37  % WalkSAT solutions: 993
% 0.14/0.37  % CDCL solutions: 0
% 0.14/0.37  % SZS status Unsatisfiable for theBenchmark
% 0.14/0.37  % SZS output start ListOfCNF for theBenchmark
% See solution above
%------------------------------------------------------------------------------