TSTP Solution File: PUZ008-3 by SNARK---20120808r022
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SNARK---20120808r022
% Problem : PUZ008-3 : TPTP v8.1.0. Released v1.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run-snark %s %d
% Computer : n021.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:22 EDT 2022
% Result : Unsatisfiable 0.18s 0.53s
% Output : Refutation 0.18s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 12
% Syntax : Number of clauses : 30 ( 22 unt; 0 nHn; 21 RR)
% Number of literals : 50 ( 0 equ; 25 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 : 38 ( 10 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(no_missionaries_is_safe,axiom,
safe(n0,X),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',no_missionaries_is_safe) ).
cnf(same_or_more_missionaries_is_safe,axiom,
( ~ greater_or_equal(X,Y)
| safe(X,Y) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',same_or_more_missionaries_is_safe) ).
cnf(great_eq_base,axiom,
greater_or_equal(X,n0),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',great_eq_base) ).
cnf(great_eq_recursive,axiom,
( greater_or_equal(s(X),s(Y))
| ~ greater_or_equal(X,Y) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',great_eq_recursive) ).
cnf(cannibal_east_to_west,axiom,
( ~ achievable(west(m(X),c(Y)),boatoneast,east(m(Z),c(s(U))))
| ~ safe(X,s(Y))
| ~ safe(Z,U)
| achievable(west(m(X),c(s(Y))),boatonwest,east(m(Z),c(U))) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cannibal_east_to_west) ).
cnf(two_cannibals_west_to_east,axiom,
( ~ achievable(west(m(X),c(s(s(Y)))),boatonwest,east(m(Z),c(U)))
| ~ safe(X,Y)
| ~ safe(Z,s(s(U)))
| achievable(west(m(X),c(Y)),boatoneast,east(m(Z),c(s(s(U))))) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',two_cannibals_west_to_east) ).
cnf(missionary_east_to_west,axiom,
( ~ achievable(west(m(X),c(Y)),boatoneast,east(m(s(Z)),c(U)))
| ~ safe(s(X),Y)
| ~ safe(Z,U)
| achievable(west(m(s(X)),c(Y)),boatonwest,east(m(Z),c(U))) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',missionary_east_to_west) ).
cnf(two_missionaries_west_to_east,axiom,
( ~ achievable(west(m(s(s(X))),c(Y)),boatonwest,east(m(Z),c(U)))
| ~ safe(X,Y)
| ~ safe(s(s(Z)),U)
| achievable(west(m(X),c(Y)),boatoneast,east(m(s(s(Z))),c(U))) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',two_missionaries_west_to_east) ).
cnf(missionary_and_cannibal_west_to_east,axiom,
( ~ achievable(west(m(s(X)),c(s(Y))),boatonwest,east(m(Z),c(U)))
| ~ safe(X,Y)
| ~ safe(s(Z),s(U))
| achievable(west(m(X),c(Y)),boatoneast,east(m(s(Z)),c(s(U)))) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',missionary_and_cannibal_west_to_east) ).
cnf(missionary_and_cannibal_east_to_west,axiom,
( ~ achievable(west(m(X),c(Y)),boatoneast,east(m(s(Z)),c(s(U))))
| ~ safe(s(X),s(Y))
| ~ safe(Z,U)
| achievable(west(m(s(X)),c(s(Y))),boatonwest,east(m(Z),c(U))) ),
file('/export/starexec/sandbox2/benchmark/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('/export/starexec/sandbox2/benchmark/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('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_can_get_to_east_bank) ).
cnf(17,plain,
safe(X,n0),
inference('HYPERRESOLVE',[status(thm)],[same_or_more_missionaries_is_safe,great_eq_base]) ).
cnf(18,plain,
greater_or_equal(s(X),s(n0)),
inference('HYPERRESOLVE',[status(thm)],[great_eq_recursive,great_eq_base]) ).
cnf(19,plain,
safe(s(X),s(n0)),
inference('HYPERRESOLVE',[status(thm)],[same_or_more_missionaries_is_safe,18]) ).
cnf(20,plain,
greater_or_equal(s(s(X)),s(s(n0))),
inference('HYPERRESOLVE',[status(thm)],[great_eq_recursive,18]) ).
cnf(21,plain,
achievable(west(m(s(s(s(n0)))),c(s(n0))),boatoneast,east(m(n0),c(s(s(n0))))),
inference('HYPERRESOLVE',[status(thm)],[two_cannibals_west_to_east,19,start_on_west_bank,no_missionaries_is_safe]) ).
cnf(22,plain,
safe(s(s(X)),s(s(n0))),
inference('HYPERRESOLVE',[status(thm)],[same_or_more_missionaries_is_safe,20]) ).
cnf(23,plain,
greater_or_equal(s(s(s(X))),s(s(s(n0)))),
inference('HYPERRESOLVE',[status(thm)],[great_eq_recursive,20]) ).
cnf(26,plain,
safe(s(s(s(X))),s(s(s(n0)))),
inference('HYPERRESOLVE',[status(thm)],[same_or_more_missionaries_is_safe,23]) ).
cnf(28,plain,
~ achievable(west(m(s(n0)),c(s(n0))),boatonwest,east(m(s(s(n0))),c(s(s(n0))))),
inference('UR-RESOLVE',[status(thm)],[missionary_and_cannibal_west_to_east,26,17,prove_can_get_to_east_bank]) ).
cnf(37,plain,
achievable(west(m(s(s(s(n0)))),c(s(s(n0)))),boatonwest,east(m(n0),c(s(n0)))),
inference('HYPERRESOLVE',[status(thm)],[cannibal_east_to_west,21,22,no_missionaries_is_safe]) ).
cnf(38,plain,
~ achievable(west(m(n0),c(s(n0))),boatoneast,east(m(s(s(s(n0)))),c(s(s(n0))))),
inference('UR-RESOLVE',[status(thm)],[missionary_east_to_west,28,19,22]) ).
cnf(42,plain,
achievable(west(m(s(s(s(n0)))),c(n0)),boatoneast,east(m(n0),c(s(s(s(n0)))))),
inference('HYPERRESOLVE',[status(thm)],[two_cannibals_west_to_east,37,17,no_missionaries_is_safe]) ).
cnf(43,plain,
achievable(west(m(s(s(s(n0)))),c(s(n0))),boatonwest,east(m(n0),c(s(s(n0))))),
inference('HYPERRESOLVE',[status(thm)],[cannibal_east_to_west,42,19,no_missionaries_is_safe]) ).
cnf(46,plain,
~ achievable(west(m(n0),c(s(s(s(n0))))),boatonwest,east(m(s(s(s(n0)))),c(n0))),
inference('UR-RESOLVE',[status(thm)],[two_cannibals_west_to_east,38,no_missionaries_is_safe,22]) ).
cnf(47,plain,
achievable(west(m(s(n0)),c(s(n0))),boatoneast,east(m(s(s(n0))),c(s(s(n0))))),
inference('HYPERRESOLVE',[status(thm)],[two_missionaries_west_to_east,43,19,22]) ).
cnf(49,plain,
achievable(west(m(s(s(n0))),c(s(s(n0)))),boatonwest,east(m(s(n0)),c(s(n0)))),
inference('HYPERRESOLVE',[status(thm)],[missionary_and_cannibal_east_to_west,47,22,19]) ).
cnf(52,plain,
~ achievable(west(m(n0),c(s(s(n0)))),boatoneast,east(m(s(s(s(n0)))),c(s(n0)))),
inference('UR-RESOLVE',[status(thm)],[cannibal_east_to_west,46,no_missionaries_is_safe,17]) ).
cnf(53,plain,
$false,
inference('REWRITE',[status(thm)],[inference('HYPERRESOLVE',[status(thm)],[two_missionaries_west_to_east,49,no_missionaries_is_safe,19]),52]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : PUZ008-3 : TPTP v8.1.0. Released v1.2.0.
% 0.06/0.13 % Command : run-snark %s %d
% 0.12/0.33 % Computer : n021.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:01:57 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.18/0.44 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.18/0.45 *
% 0.18/0.45 *
% 0.18/0.46 #<PACKAGE "SNARK-USER">
% 0.18/0.46 *
% 0.18/0.46 SNARK-TPTP-OPTIONS
% 0.18/0.46 *
% 0.18/0.46 ((AGENDA-LENGTH-LIMIT NIL) (AGENDA-LENGTH-BEFORE-SIMPLIFICATION-LIMIT NIL)
% 0.18/0.46 (USE-HYPERRESOLUTION T) (USE-UR-RESOLUTION T) (USE-PARAMODULATION T)
% 0.18/0.46 (USE-FACTORING :POS)
% 0.18/0.46 (USE-LITERAL-ORDERING-WITH-HYPERRESOLUTION 'LITERAL-ORDERING-P)
% 0.18/0.46 (USE-LITERAL-ORDERING-WITH-PARAMODULATION 'LITERAL-ORDERING-P)
% 0.18/0.46 (ORDERING-FUNCTIONS>CONSTANTS T) (ASSERT-CONTEXT :CURRENT)
% 0.18/0.46 (RUN-TIME-LIMIT 300) (LISTEN-FOR-COMMANDS NIL)
% 0.18/0.46 (USE-CLOSURE-WHEN-SATISFIABLE T) (PRINT-ROWS-WHEN-GIVEN NIL)
% 0.18/0.46 (PRINT-ROWS-WHEN-DERIVED NIL) (PRINT-UNORIENTABLE-ROWS NIL)
% 0.18/0.46 (PRINT-ROW-WFFS-PRETTILY NIL) (PRINT-FINAL-ROWS :TPTP)
% 0.18/0.46 (PRINT-OPTIONS-WHEN-STARTING NIL) (USE-VARIABLE-NAME-SORTS NIL)
% 0.18/0.46 (USE-PURITY-TEST T) (USE-RELEVANCE-TEST T) (DECLARE-TPTP-SYMBOLS1)
% 0.18/0.46 (DECLARE-TPTP-SYMBOLS2))
% 0.18/0.46 *
% 0.18/0.46 "."
% 0.18/0.46 *
% 0.18/0.46 ; Begin refute-file /export/starexec/sandbox2/benchmark/theBenchmark.p 2022-05-29T01:01:57
% 0.18/0.46 ; Running SNARK from /davis/home/graph/tptp/Systems/SNARK---20120808r022/Source/snark-system.lisp in SBCL 1.0.12 on n021.cluster.edu at 2022-05-29T01:01:57
% 0.18/0.53
% 0.18/0.53
% 0.18/0.53 #||
% 0.18/0.53 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.18/0.53 % SZS output start Refutation
% See solution above
% 0.18/0.53 ||#
% 0.18/0.53
% 0.18/0.53 ; Summary of computation:
% 0.18/0.53 ; 115 formulas have been input or derived (from 51 formulas).
% 0.18/0.53 ; 53 (46%) were retained. Of these,
% 0.18/0.53 ; 53 (100%) are still being kept.
% 0.18/0.53 ;
% 0.18/0.53 ; Run time in seconds excluding printing time:
% 0.18/0.53 ; 0.006 9% Read assertion file (1 call)
% 0.18/0.53 ; 0.001 2% Assert (16 calls)
% 0.18/0.53 ; 0.005 8% Process new row (76 calls)
% 0.18/0.53 ; 0.022 34% Resolution (100 calls)
% 0.18/0.53 ; 0.002 3% Paramodulation (50 calls)
% 0.18/0.53 ; 0.000 0% Condensing (12 calls)
% 0.18/0.53 ; 0.002 3% Forward subsumption (12 calls)
% 0.18/0.53 ; 0.000 0% Backward subsumption (12 calls)
% 0.18/0.53 ; 0.001 2% Clause clause subsumption (24 calls)
% 0.18/0.53 ; 0.002 3% Forward simplification (76 calls)
% 0.18/0.53 ; 0.001 2% Backward simplification (53 calls)
% 0.18/0.53 ; 0.000 0% Sortal reasoning (32 calls)
% 0.18/0.53 ; 0.000 0% Purity testing (1 call)
% 0.18/0.53 ; 0.023 35% Other
% 0.18/0.53 ; 0.065 Total
% 0.18/0.53 ; 0.070 Real time
% 0.18/0.53 ;
% 0.18/0.53 ; Term-hash-array has 144 terms in all.
% 0.18/0.53 ; Feature-vector-row-index has 12 entries (12 at peak, 12 added, 0 deleted).
% 0.18/0.53 ; Feature-vector-row-index has 92 nodes (92 at peak, 92 added, 0 deleted).
% 0.18/0.53 ; Retrieved 14 possibly forward subsuming rows in 12 calls.
% 0.18/0.53 ; Retrieved 10 possibly backward subsumed rows in 12 calls.
% 0.18/0.53 ; Path-index has 147 entries (147 at peak, 147 added, 0 deleted).
% 0.18/0.53 ; Path-index has 225 nodes (225 at peak, 225 added, 0 deleted).
% 0.18/0.53 ; Trie-index has 147 entries (147 at peak, 147 added, 0 deleted).
% 0.18/0.53 ; Trie-index has 566 nodes (566 at peak, 566 added, 0 deleted).
% 0.18/0.53 ; Retrieved 24 generalization terms in 84 calls.
% 0.18/0.53 ; Retrieved 40 instance terms in 40 calls.
% 0.18/0.53 ; Retrieved 6,209 unifiable terms in 1,891 calls.
% 0.18/0.53 ;
% 0.18/0.53 ; The agenda of rows to give has 2 entries:
% 0.18/0.53 ; 2 with value (4 32)
% 0.18/0.53 Evaluation took:
% 0.18/0.53 0.07 seconds of real time
% 0.18/0.53 0.062215 seconds of user run time
% 0.18/0.53 0.008143 seconds of system run time
% 0.18/0.53 0 calls to %EVAL
% 0.18/0.53 0 page faults and
% 0.18/0.53 7,059,328 bytes consed.
% 0.18/0.53 :PROOF-FOUND
% 0.18/0.53 ; End refute-file /export/starexec/sandbox2/benchmark/theBenchmark.p 2022-05-29T01:01:57
% 0.18/0.53 :PROOF-FOUND
% 0.18/0.53 *
%------------------------------------------------------------------------------