TSTP Solution File: PUZ008-3 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : PUZ008-3 : TPTP v8.1.0. Released v1.2.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n028.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:23:49 EDT 2022
% Result : Unsatisfiable 0.73s 1.02s
% Output : Refutation 0.73s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : PUZ008-3 : TPTP v8.1.0. Released v1.2.0.
% 0.06/0.13 % Command : tptp2X_and_run_prover9 %d %s
% 0.13/0.34 % Computer : n028.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 600
% 0.13/0.34 % DateTime : Sun May 29 01:13:18 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.73/1.02 ============================== Prover9 ===============================
% 0.73/1.02 Prover9 (32) version 2009-11A, November 2009.
% 0.73/1.02 Process 28553 was started by sandbox on n028.cluster.edu,
% 0.73/1.02 Sun May 29 01:13:18 2022
% 0.73/1.02 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_28212_n028.cluster.edu".
% 0.73/1.02 ============================== end of head ===========================
% 0.73/1.02
% 0.73/1.02 ============================== INPUT =================================
% 0.73/1.02
% 0.73/1.02 % Reading from file /tmp/Prover9_28212_n028.cluster.edu
% 0.73/1.02
% 0.73/1.02 set(prolog_style_variables).
% 0.73/1.02 set(auto2).
% 0.73/1.02 % set(auto2) -> set(auto).
% 0.73/1.02 % set(auto) -> set(auto_inference).
% 0.73/1.02 % set(auto) -> set(auto_setup).
% 0.73/1.02 % set(auto_setup) -> set(predicate_elim).
% 0.73/1.02 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.73/1.02 % set(auto) -> set(auto_limits).
% 0.73/1.02 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.73/1.02 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.73/1.02 % set(auto) -> set(auto_denials).
% 0.73/1.02 % set(auto) -> set(auto_process).
% 0.73/1.02 % set(auto2) -> assign(new_constants, 1).
% 0.73/1.02 % set(auto2) -> assign(fold_denial_max, 3).
% 0.73/1.02 % set(auto2) -> assign(max_weight, "200.000").
% 0.73/1.02 % set(auto2) -> assign(max_hours, 1).
% 0.73/1.02 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.73/1.02 % set(auto2) -> assign(max_seconds, 0).
% 0.73/1.02 % set(auto2) -> assign(max_minutes, 5).
% 0.73/1.02 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.73/1.02 % set(auto2) -> set(sort_initial_sos).
% 0.73/1.02 % set(auto2) -> assign(sos_limit, -1).
% 0.73/1.02 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.73/1.02 % set(auto2) -> assign(max_megs, 400).
% 0.73/1.02 % set(auto2) -> assign(stats, some).
% 0.73/1.02 % set(auto2) -> clear(echo_input).
% 0.73/1.02 % set(auto2) -> set(quiet).
% 0.73/1.02 % set(auto2) -> clear(print_initial_clauses).
% 0.73/1.02 % set(auto2) -> clear(print_given).
% 0.73/1.02 assign(lrs_ticks,-1).
% 0.73/1.02 assign(sos_limit,10000).
% 0.73/1.02 assign(order,kbo).
% 0.73/1.02 set(lex_order_vars).
% 0.73/1.02 clear(print_given).
% 0.73/1.02
% 0.73/1.02 % formulas(sos). % not echoed (16 formulas)
% 0.73/1.02
% 0.73/1.02 ============================== end of input ==========================
% 0.73/1.02
% 0.73/1.02 % From the command line: assign(max_seconds, 300).
% 0.73/1.02
% 0.73/1.02 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.73/1.02
% 0.73/1.02 % Formulas that are not ordinary clauses:
% 0.73/1.02
% 0.73/1.02 ============================== end of process non-clausal formulas ===
% 0.73/1.02
% 0.73/1.02 ============================== PROCESS INITIAL CLAUSES ===============
% 0.73/1.02
% 0.73/1.02 ============================== PREDICATE ELIMINATION =================
% 0.73/1.02
% 0.73/1.02 ============================== end predicate elimination =============
% 0.73/1.02
% 0.73/1.02 Auto_denials:
% 0.73/1.02 % copying label prove_can_get_to_east_bank to answer in negative clause
% 0.73/1.02
% 0.73/1.02 Term ordering decisions:
% 0.73/1.02 Function symbol KB weights: boatonwest=1. boatoneast=1. n0=1. east=1. west=1. s=1. c=1. m=1.
% 0.73/1.02
% 0.73/1.02 ============================== end of process initial clauses ========
% 0.73/1.02
% 0.73/1.02 ============================== CLAUSES FOR SEARCH ====================
% 0.73/1.02
% 0.73/1.02 ============================== end of clauses for search =============
% 0.73/1.02
% 0.73/1.02 ============================== SEARCH ================================
% 0.73/1.02
% 0.73/1.02 % Starting search at 0.01 seconds.
% 0.73/1.02
% 0.73/1.02 ============================== PROOF =================================
% 0.73/1.02 % SZS status Unsatisfiable
% 0.73/1.02 % SZS output start Refutation
% 0.73/1.02
% 0.73/1.02 % Proof 1 at 0.04 (+ 0.00) seconds: prove_can_get_to_east_bank.
% 0.73/1.02 % Length of proof is 31.
% 0.73/1.02 % Level of proof is 12.
% 0.73/1.02 % Maximum clause weight is 36.000.
% 0.73/1.02 % Given clauses 58.
% 0.73/1.02
% 0.73/1.02 1 safe(n0,A) # label(no_missionaries_is_safe) # label(axiom). [assumption].
% 0.73/1.02 2 greater_or_equal(A,n0) # label(great_eq_base) # label(axiom). [assumption].
% 0.73/1.02 3 achievable(west(m(s(s(s(n0)))),c(s(s(s(n0))))),boatonwest,east(m(n0),c(n0))) # label(start_on_west_bank) # label(hypothesis). [assumption].
% 0.73/1.02 4 -achievable(west(m(n0),c(n0)),A,east(m(s(s(s(n0)))),c(s(s(s(n0)))))) # label(prove_can_get_to_east_bank) # label(negated_conjecture) # answer(prove_can_get_to_east_bank). [assumption].
% 0.73/1.02 5 -greater_or_equal(A,B) | safe(A,B) # label(same_or_more_missionaries_is_safe) # label(axiom). [assumption].
% 0.73/1.02 6 greater_or_equal(s(A),s(B)) | -greater_or_equal(A,B) # label(great_eq_recursive) # label(axiom). [assumption].
% 0.73/1.02 8 -achievable(west(m(A),c(B)),boatoneast,east(m(C),c(s(D)))) | -safe(A,s(B)) | -safe(C,D) | achievable(west(m(A),c(s(B))),boatonwest,east(m(C),c(D))) # label(cannibal_east_to_west) # label(axiom). [assumption].
% 0.73/1.02 10 -achievable(west(m(A),c(B)),boatoneast,east(m(s(C)),c(D))) | -safe(s(A),B) | -safe(C,D) | achievable(west(m(s(A)),c(B)),boatonwest,east(m(C),c(D))) # label(missionary_east_to_west) # label(axiom). [assumption].
% 0.73/1.02 11 -achievable(west(m(A),c(s(s(B)))),boatonwest,east(m(C),c(D))) | -safe(A,B) | -safe(C,s(s(D))) | achievable(west(m(A),c(B)),boatoneast,east(m(C),c(s(s(D))))) # label(two_cannibals_west_to_east) # label(axiom). [assumption].
% 0.73/1.02 13 -achievable(west(m(s(s(A))),c(B)),boatonwest,east(m(C),c(D))) | -safe(A,B) | -safe(s(s(C)),D) | achievable(west(m(A),c(B)),boatoneast,east(m(s(s(C))),c(D))) # label(two_missionaries_west_to_east) # label(axiom). [assumption].
% 0.73/1.02 15 -achievable(west(m(s(A)),c(s(B))),boatonwest,east(m(C),c(D))) | -safe(A,B) | -safe(s(C),s(D)) | achievable(west(m(A),c(B)),boatoneast,east(m(s(C)),c(s(D)))) # label(missionary_and_cannibal_west_to_east) # label(axiom). [assumption].
% 0.73/1.02 16 -achievable(west(m(A),c(B)),boatoneast,east(m(s(C)),c(s(D)))) | -safe(s(A),s(B)) | -safe(C,D) | achievable(west(m(s(A)),c(s(B))),boatonwest,east(m(C),c(D))) # label(missionary_and_cannibal_east_to_west) # label(axiom). [assumption].
% 0.73/1.02 17 safe(A,n0). [ur(5,a,2,a)].
% 0.73/1.02 18 greater_or_equal(s(A),s(n0)). [ur(6,b,2,a)].
% 0.73/1.02 29 greater_or_equal(s(s(A)),s(s(n0))). [ur(6,b,18,a)].
% 0.73/1.02 30 safe(s(A),s(n0)). [ur(5,a,18,a)].
% 0.73/1.02 31 achievable(west(m(s(s(s(n0)))),c(s(n0))),boatoneast,east(m(n0),c(s(s(n0))))). [ur(11,a,3,a,b,30,a,c,1,a)].
% 0.73/1.02 33 greater_or_equal(s(s(s(A))),s(s(s(n0)))). [ur(6,b,29,a)].
% 0.73/1.02 34 safe(s(s(A)),s(s(n0))). [ur(5,a,29,a)].
% 0.73/1.02 43 safe(s(s(s(A))),s(s(s(n0)))). [ur(5,a,33,a)].
% 0.73/1.02 44 -achievable(west(m(s(n0)),c(s(n0))),boatonwest,east(m(s(s(n0))),c(s(s(n0))))) # answer(prove_can_get_to_east_bank). [ur(15,b,17,a,c,43,a,d,4,a)].
% 0.73/1.02 49 achievable(west(m(s(s(s(n0)))),c(s(s(n0)))),boatonwest,east(m(n0),c(s(n0)))). [ur(8,a,31,a,b,34,a,c,1,a)].
% 0.73/1.02 52 -achievable(west(m(n0),c(s(n0))),boatoneast,east(m(s(s(s(n0)))),c(s(s(n0))))) # answer(prove_can_get_to_east_bank). [ur(10,b,30,a,c,34,a,d,44,a)].
% 0.73/1.02 63 -achievable(west(m(n0),c(s(s(s(n0))))),boatonwest,east(m(s(s(s(n0)))),c(n0))) # answer(prove_can_get_to_east_bank). [ur(11,b,1,a,c,34,a,d,52,a)].
% 0.73/1.02 70 achievable(west(m(s(s(s(n0)))),c(n0)),boatoneast,east(m(n0),c(s(s(s(n0)))))). [ur(11,a,49,a,b,17,a,c,1,a)].
% 0.73/1.02 72 -achievable(west(m(n0),c(s(s(n0)))),boatoneast,east(m(s(s(s(n0)))),c(s(n0)))) # answer(prove_can_get_to_east_bank). [ur(8,b,1,a,c,17,a,d,63,a)].
% 0.73/1.02 76 -achievable(west(m(s(s(n0))),c(s(s(n0)))),boatonwest,east(m(s(n0)),c(s(n0)))) # answer(prove_can_get_to_east_bank). [ur(13,b,1,a,c,30,a,d,72,a)].
% 0.73/1.02 84 -achievable(west(m(s(n0)),c(s(n0))),boatoneast,east(m(s(s(n0))),c(s(s(n0))))) # answer(prove_can_get_to_east_bank). [ur(16,b,34,a,c,30,a,d,76,a)].
% 0.73/1.02 89 -achievable(west(m(s(s(s(n0)))),c(s(n0))),boatonwest,east(m(n0),c(s(s(n0))))) # answer(prove_can_get_to_east_bank). [ur(13,b,30,a,c,34,a,d,84,a)].
% 0.73/1.02 90 achievable(west(m(s(s(s(n0)))),c(s(n0))),boatonwest,east(m(n0),c(s(s(n0))))). [ur(8,a,70,a,b,30,a,c,1,a)].
% 0.73/1.02 91 $F # answer(prove_can_get_to_east_bank). [resolve(90,a,89,a)].
% 0.73/1.02
% 0.73/1.02 % SZS output end Refutation
% 0.73/1.02 ============================== end of proof ==========================
% 0.73/1.02
% 0.73/1.02 ============================== STATISTICS ============================
% 0.73/1.02
% 0.73/1.02 Given=58. Generated=163. Kept=90. proofs=1.
% 0.73/1.02 Usable=50. Sos=7. Demods=0. Limbo=0, Disabled=48. Hints=0.
% 0.73/1.02 Megabytes=0.14.
% 0.73/1.02 User_CPU=0.04, System_CPU=0.00, Wall_clock=0.
% 0.73/1.02
% 0.73/1.02 ============================== end of statistics =====================
% 0.73/1.02
% 0.73/1.02 ============================== end of search =========================
% 0.73/1.02
% 0.73/1.02 THEOREM PROVED
% 0.73/1.02 % SZS status Unsatisfiable
% 0.73/1.02
% 0.73/1.02 Exiting with 1 proof.
% 0.73/1.02
% 0.73/1.02 Process 28553 exit (max_proofs) Sun May 29 01:13:18 2022
% 0.73/1.03 Prover9 interrupted
%------------------------------------------------------------------------------