TSTP Solution File: PUZ008-3 by PyRes---1.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : PyRes---1.3
% Problem : PUZ008-3 : TPTP v8.1.0. Released v1.2.0.
% Transfm : none
% Format : tptp:raw
% Command : pyres-fof.py -tifbsVp -nlargest -HPickGiven5 %s
% Computer : n023.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:24:08 EDT 2022
% Result : Unsatisfiable 0.61s 0.78s
% Output : Refutation 0.61s
% Verified :
% SZS Type : ERROR: Analysing output (Could not find formula named input)
% Comments :
%------------------------------------------------------------------------------
cnf(prove_can_get_to_east_bank,negated_conjecture,
~ achievable(west(m(n0),c(n0)),X35,east(m(s(s(s(n0)))),c(s(s(s(n0)))))),
input ).
cnf(no_missionaries_is_safe,axiom,
safe(n0,X2),
input ).
cnf(same_or_more_missionaries_is_safe,axiom,
( ~ greater_or_equal(X5,X4)
| safe(X5,X4) ),
input ).
cnf(great_eq_recursive,axiom,
( greater_or_equal(s(X8),s(X7))
| ~ greater_or_equal(X8,X7) ),
input ).
cnf(great_eq_base,axiom,
greater_or_equal(X3,n0),
input ).
cnf(c1,plain,
greater_or_equal(s(X13),s(n0)),
inference(resolution,status(thm),[great_eq_recursive,great_eq_base]) ).
cnf(c3,plain,
greater_or_equal(s(s(X15)),s(s(n0))),
inference(resolution,status(thm),[c1,great_eq_recursive]) ).
cnf(c5,plain,
greater_or_equal(s(s(s(X17))),s(s(s(n0)))),
inference(resolution,status(thm),[c3,great_eq_recursive]) ).
cnf(c6,plain,
safe(s(s(s(X22))),s(s(s(n0)))),
inference(resolution,status(thm),[c5,same_or_more_missionaries_is_safe]) ).
cnf(missionary_and_cannibal_west_to_east,axiom,
( ~ achievable(west(m(s(X70)),c(s(X69))),boatonwest,east(m(X71),c(X68)))
| ~ safe(X70,X69)
| ~ safe(s(X71),s(X68))
| achievable(west(m(X70),c(X69)),boatoneast,east(m(s(X71)),c(s(X68)))) ),
input ).
cnf(c2,plain,
safe(s(X14),s(n0)),
inference(resolution,status(thm),[c1,same_or_more_missionaries_is_safe]) ).
cnf(c4,plain,
safe(s(s(X16)),s(s(n0))),
inference(resolution,status(thm),[c3,same_or_more_missionaries_is_safe]) ).
cnf(missionary_east_to_west,axiom,
( ~ achievable(west(m(X55),c(X54)),boatoneast,east(m(s(X56)),c(X53)))
| ~ safe(s(X55),X54)
| ~ safe(X56,X53)
| achievable(west(m(s(X55)),c(X54)),boatonwest,east(m(X56),c(X53))) ),
input ).
cnf(two_cannibals_west_to_east,axiom,
( ~ achievable(west(m(X29),c(s(s(X28)))),boatonwest,east(m(X30),c(X27)))
| ~ safe(X29,X28)
| ~ safe(X30,s(s(X27)))
| achievable(west(m(X29),c(X28)),boatoneast,east(m(X30),c(s(s(X27))))) ),
input ).
cnf(c0,plain,
safe(X6,n0),
inference(resolution,status(thm),[same_or_more_missionaries_is_safe,great_eq_base]) ).
cnf(cannibal_east_to_west,axiom,
( ~ achievable(west(m(X20),c(X19)),boatoneast,east(m(X21),c(s(X18))))
| ~ safe(X20,s(X19))
| ~ safe(X21,X18)
| achievable(west(m(X20),c(s(X19))),boatonwest,east(m(X21),c(X18))) ),
input ).
cnf(two_missionaries_west_to_east,axiom,
( ~ achievable(west(m(s(s(X62))),c(X61)),boatonwest,east(m(X63),c(X60)))
| ~ safe(X62,X61)
| ~ safe(s(s(X63)),X60)
| achievable(west(m(X62),c(X61)),boatoneast,east(m(s(s(X63))),c(X60))) ),
input ).
cnf(missionary_and_cannibal_east_to_west,axiom,
( ~ achievable(west(m(X74),c(X73)),boatoneast,east(m(s(X75)),c(s(X72))))
| ~ safe(s(X74),s(X73))
| ~ safe(X75,X72)
| achievable(west(m(s(X74)),c(s(X73))),boatonwest,east(m(X75),c(X72))) ),
input ).
cnf(start_on_west_bank,plain,
achievable(west(m(s(s(s(n0)))),c(s(s(s(n0))))),boatonwest,east(m(n0),c(n0))),
input ).
cnf(c17,plain,
( ~ safe(s(s(s(n0))),s(n0))
| ~ safe(n0,s(s(n0)))
| achievable(west(m(s(s(s(n0)))),c(s(n0))),boatoneast,east(m(n0),c(s(s(n0))))) ),
inference(resolution,status(thm),[start_on_west_bank,two_cannibals_west_to_east]) ).
cnf(c36,plain,
( ~ safe(n0,s(s(n0)))
| achievable(west(m(s(s(s(n0)))),c(s(n0))),boatoneast,east(m(n0),c(s(s(n0))))) ),
inference(resolution,status(thm),[c17,c2]) ).
cnf(c37,plain,
achievable(west(m(s(s(s(n0)))),c(s(n0))),boatoneast,east(m(n0),c(s(s(n0))))),
inference(resolution,status(thm),[c36,no_missionaries_is_safe]) ).
cnf(c39,plain,
( ~ safe(s(s(s(n0))),s(s(n0)))
| ~ safe(n0,s(n0))
| achievable(west(m(s(s(s(n0)))),c(s(s(n0)))),boatonwest,east(m(n0),c(s(n0)))) ),
inference(resolution,status(thm),[c37,cannibal_east_to_west]) ).
cnf(c47,plain,
( ~ safe(n0,s(n0))
| achievable(west(m(s(s(s(n0)))),c(s(s(n0)))),boatonwest,east(m(n0),c(s(n0)))) ),
inference(resolution,status(thm),[c39,c4]) ).
cnf(c48,plain,
achievable(west(m(s(s(s(n0)))),c(s(s(n0)))),boatonwest,east(m(n0),c(s(n0)))),
inference(resolution,status(thm),[c47,no_missionaries_is_safe]) ).
cnf(c51,plain,
( ~ safe(s(s(s(n0))),n0)
| ~ safe(n0,s(s(s(n0))))
| achievable(west(m(s(s(s(n0)))),c(n0)),boatoneast,east(m(n0),c(s(s(s(n0)))))) ),
inference(resolution,status(thm),[c48,two_cannibals_west_to_east]) ).
cnf(c56,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(resolution,status(thm),[c51,no_missionaries_is_safe]) ).
cnf(c57,plain,
achievable(west(m(s(s(s(n0)))),c(n0)),boatoneast,east(m(n0),c(s(s(s(n0)))))),
inference(resolution,status(thm),[c56,c0]) ).
cnf(c59,plain,
( ~ safe(s(s(s(n0))),s(n0))
| ~ safe(n0,s(s(n0)))
| achievable(west(m(s(s(s(n0)))),c(s(n0))),boatonwest,east(m(n0),c(s(s(n0))))) ),
inference(resolution,status(thm),[c57,cannibal_east_to_west]) ).
cnf(c61,plain,
( ~ safe(n0,s(s(n0)))
| achievable(west(m(s(s(s(n0)))),c(s(n0))),boatonwest,east(m(n0),c(s(s(n0))))) ),
inference(resolution,status(thm),[c59,c2]) ).
cnf(c62,plain,
achievable(west(m(s(s(s(n0)))),c(s(n0))),boatonwest,east(m(n0),c(s(s(n0))))),
inference(resolution,status(thm),[c61,no_missionaries_is_safe]) ).
cnf(c66,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(resolution,status(thm),[c62,two_missionaries_west_to_east]) ).
cnf(c67,plain,
( ~ safe(s(n0),s(n0))
| achievable(west(m(s(n0)),c(s(n0))),boatoneast,east(m(s(s(n0))),c(s(s(n0))))) ),
inference(resolution,status(thm),[c66,c4]) ).
cnf(c68,plain,
achievable(west(m(s(n0)),c(s(n0))),boatoneast,east(m(s(s(n0))),c(s(s(n0))))),
inference(resolution,status(thm),[c67,c2]) ).
cnf(c72,plain,
( ~ safe(s(s(n0)),s(s(n0)))
| ~ safe(s(n0),s(n0))
| achievable(west(m(s(s(n0))),c(s(s(n0)))),boatonwest,east(m(s(n0)),c(s(n0)))) ),
inference(resolution,status(thm),[c68,missionary_and_cannibal_east_to_west]) ).
cnf(c76,plain,
( ~ safe(s(n0),s(n0))
| achievable(west(m(s(s(n0))),c(s(s(n0)))),boatonwest,east(m(s(n0)),c(s(n0)))) ),
inference(resolution,status(thm),[c72,c4]) ).
cnf(c77,plain,
achievable(west(m(s(s(n0))),c(s(s(n0)))),boatonwest,east(m(s(n0)),c(s(n0)))),
inference(resolution,status(thm),[c76,c2]) ).
cnf(c82,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(resolution,status(thm),[c77,two_missionaries_west_to_east]) ).
cnf(c86,plain,
( ~ safe(n0,s(s(n0)))
| achievable(west(m(n0),c(s(s(n0)))),boatoneast,east(m(s(s(s(n0)))),c(s(n0)))) ),
inference(resolution,status(thm),[c82,c2]) ).
cnf(c87,plain,
achievable(west(m(n0),c(s(s(n0)))),boatoneast,east(m(s(s(s(n0)))),c(s(n0)))),
inference(resolution,status(thm),[c86,no_missionaries_is_safe]) ).
cnf(c91,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(resolution,status(thm),[c87,cannibal_east_to_west]) ).
cnf(c92,plain,
( ~ safe(n0,s(s(s(n0))))
| achievable(west(m(n0),c(s(s(s(n0))))),boatonwest,east(m(s(s(s(n0)))),c(n0))) ),
inference(resolution,status(thm),[c91,c0]) ).
cnf(c95,plain,
achievable(west(m(n0),c(s(s(s(n0))))),boatonwest,east(m(s(s(s(n0)))),c(n0))),
inference(resolution,status(thm),[c92,no_missionaries_is_safe]) ).
cnf(c97,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(resolution,status(thm),[c95,two_cannibals_west_to_east]) ).
cnf(c98,plain,
( ~ safe(n0,s(n0))
| achievable(west(m(n0),c(s(n0))),boatoneast,east(m(s(s(s(n0)))),c(s(s(n0))))) ),
inference(resolution,status(thm),[c97,c4]) ).
cnf(c99,plain,
achievable(west(m(n0),c(s(n0))),boatoneast,east(m(s(s(s(n0)))),c(s(s(n0))))),
inference(resolution,status(thm),[c98,no_missionaries_is_safe]) ).
cnf(c100,plain,
( ~ safe(s(n0),s(n0))
| ~ safe(s(s(n0)),s(s(n0)))
| achievable(west(m(s(n0)),c(s(n0))),boatonwest,east(m(s(s(n0))),c(s(s(n0))))) ),
inference(resolution,status(thm),[c99,missionary_east_to_west]) ).
cnf(c105,plain,
( ~ safe(s(n0),s(n0))
| achievable(west(m(s(n0)),c(s(n0))),boatonwest,east(m(s(s(n0))),c(s(s(n0))))) ),
inference(resolution,status(thm),[c100,c4]) ).
cnf(c106,plain,
achievable(west(m(s(n0)),c(s(n0))),boatonwest,east(m(s(s(n0))),c(s(s(n0))))),
inference(resolution,status(thm),[c105,c2]) ).
cnf(c108,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(resolution,status(thm),[c106,missionary_and_cannibal_west_to_east]) ).
cnf(c116,plain,
( ~ safe(n0,n0)
| achievable(west(m(n0),c(n0)),boatoneast,east(m(s(s(s(n0)))),c(s(s(s(n0)))))) ),
inference(resolution,status(thm),[c108,c6]) ).
cnf(c117,plain,
achievable(west(m(n0),c(n0)),boatoneast,east(m(s(s(s(n0)))),c(s(s(s(n0)))))),
inference(resolution,status(thm),[c116,no_missionaries_is_safe]) ).
cnf(c119,plain,
$false,
inference(resolution,status(thm),[c117,prove_can_get_to_east_bank]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.11 % Problem : PUZ008-3 : TPTP v8.1.0. Released v1.2.0.
% 0.07/0.12 % Command : pyres-fof.py -tifbsVp -nlargest -HPickGiven5 %s
% 0.12/0.33 % Computer : n023.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:27:57 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.61/0.78 # Version: 1.3
% 0.61/0.78 # SZS status Unsatisfiable
% 0.61/0.78 # SZS output start CNFRefutation
% See solution above
% 0.61/0.78
% 0.61/0.78 # Initial clauses : 16
% 0.61/0.78 # Processed clauses : 108
% 0.61/0.78 # Factors computed : 0
% 0.61/0.78 # Resolvents computed: 125
% 0.61/0.78 # Tautologies deleted: 0
% 0.61/0.78 # Forward subsumed : 21
% 0.61/0.78 # Backward subsumed : 30
% 0.61/0.78 # -------- CPU Time ---------
% 0.61/0.78 # User time : 0.426 s
% 0.61/0.78 # System time : 0.021 s
% 0.61/0.78 # Total time : 0.447 s
%------------------------------------------------------------------------------