TSTP Solution File: PUZ008-2 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : PUZ008-2 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %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:23:49 EDT 2022
% Result : Unsatisfiable 0.45s 0.74s
% Output : Refutation 0.45s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.08 % Problem : PUZ008-2 : TPTP v8.1.0. Released v1.0.0.
% 0.07/0.08 % Command : tptp2X_and_run_prover9 %d %s
% 0.09/0.27 % Computer : n032.cluster.edu
% 0.09/0.27 % Model : x86_64 x86_64
% 0.09/0.27 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.27 % Memory : 8042.1875MB
% 0.09/0.27 % OS : Linux 3.10.0-693.el7.x86_64
% 0.09/0.27 % CPULimit : 300
% 0.09/0.27 % WCLimit : 600
% 0.09/0.27 % DateTime : Sat May 28 19:54:25 EDT 2022
% 0.09/0.28 % CPUTime :
% 0.45/0.74 ============================== Prover9 ===============================
% 0.45/0.74 Prover9 (32) version 2009-11A, November 2009.
% 0.45/0.74 Process 2755 was started by sandbox on n032.cluster.edu,
% 0.45/0.74 Sat May 28 19:54:26 2022
% 0.45/0.74 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_2480_n032.cluster.edu".
% 0.45/0.74 ============================== end of head ===========================
% 0.45/0.74
% 0.45/0.74 ============================== INPUT =================================
% 0.45/0.74
% 0.45/0.74 % Reading from file /tmp/Prover9_2480_n032.cluster.edu
% 0.45/0.74
% 0.45/0.74 set(prolog_style_variables).
% 0.45/0.74 set(auto2).
% 0.45/0.74 % set(auto2) -> set(auto).
% 0.45/0.74 % set(auto) -> set(auto_inference).
% 0.45/0.74 % set(auto) -> set(auto_setup).
% 0.45/0.74 % set(auto_setup) -> set(predicate_elim).
% 0.45/0.74 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.45/0.74 % set(auto) -> set(auto_limits).
% 0.45/0.74 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.45/0.74 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.45/0.74 % set(auto) -> set(auto_denials).
% 0.45/0.74 % set(auto) -> set(auto_process).
% 0.45/0.74 % set(auto2) -> assign(new_constants, 1).
% 0.45/0.74 % set(auto2) -> assign(fold_denial_max, 3).
% 0.45/0.74 % set(auto2) -> assign(max_weight, "200.000").
% 0.45/0.74 % set(auto2) -> assign(max_hours, 1).
% 0.45/0.74 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.45/0.74 % set(auto2) -> assign(max_seconds, 0).
% 0.45/0.74 % set(auto2) -> assign(max_minutes, 5).
% 0.45/0.74 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.45/0.74 % set(auto2) -> set(sort_initial_sos).
% 0.45/0.74 % set(auto2) -> assign(sos_limit, -1).
% 0.45/0.74 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.45/0.74 % set(auto2) -> assign(max_megs, 400).
% 0.45/0.74 % set(auto2) -> assign(stats, some).
% 0.45/0.74 % set(auto2) -> clear(echo_input).
% 0.45/0.74 % set(auto2) -> set(quiet).
% 0.45/0.74 % set(auto2) -> clear(print_initial_clauses).
% 0.45/0.74 % set(auto2) -> clear(print_given).
% 0.45/0.74 assign(lrs_ticks,-1).
% 0.45/0.74 assign(sos_limit,10000).
% 0.45/0.74 assign(order,kbo).
% 0.45/0.74 set(lex_order_vars).
% 0.45/0.74 clear(print_given).
% 0.45/0.74
% 0.45/0.74 % formulas(sos). % not echoed (32 formulas)
% 0.45/0.74
% 0.45/0.74 ============================== end of input ==========================
% 0.45/0.74
% 0.45/0.74 % From the command line: assign(max_seconds, 300).
% 0.45/0.74
% 0.45/0.74 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.45/0.74
% 0.45/0.74 % Formulas that are not ordinary clauses:
% 0.45/0.74
% 0.45/0.74 ============================== end of process non-clausal formulas ===
% 0.45/0.74
% 0.45/0.74 ============================== PROCESS INITIAL CLAUSES ===============
% 0.45/0.74
% 0.45/0.74 ============================== PREDICATE ELIMINATION =================
% 0.45/0.74
% 0.45/0.74 ============================== end predicate elimination =============
% 0.45/0.74
% 0.45/0.74 Auto_denials:
% 0.45/0.74 % copying label prove_can_get_across to answer in negative clause
% 0.45/0.74
% 0.45/0.74 Term ordering decisions:
% 0.45/0.74 Function symbol KB weights: n0=1. n3=1. n1=1. n2=1. boatonwest=1. boatoneast=1. east=1. west=1. c=1. m=1.
% 0.45/0.74
% 0.45/0.74 ============================== end of process initial clauses ========
% 0.45/0.74
% 0.45/0.74 ============================== CLAUSES FOR SEARCH ====================
% 0.45/0.74
% 0.45/0.74 ============================== end of clauses for search =============
% 0.45/0.74
% 0.45/0.74 ============================== SEARCH ================================
% 0.45/0.74
% 0.45/0.74 % Starting search at 0.01 seconds.
% 0.45/0.74
% 0.45/0.74 ============================== PROOF =================================
% 0.45/0.74 % SZS status Unsatisfiable
% 0.45/0.74 % SZS output start Refutation
% 0.45/0.74
% 0.45/0.74 % Proof 1 at 0.01 (+ 0.00) seconds: prove_can_get_across.
% 0.45/0.74 % Length of proof is 25.
% 0.45/0.74 % Level of proof is 8.
% 0.45/0.74 % Maximum clause weight is 24.000.
% 0.45/0.74 % Given clauses 41.
% 0.45/0.74
% 0.45/0.74 1 banks(west(m(n3),c(n3)),east(m(n0),c(n0)),boatonwest) # label(starting_configuration) # label(hypothesis). [assumption].
% 0.45/0.74 2 -banks(west(m(n0),c(n0)),east(m(n3),c(n3)),boatoneast) # label(prove_can_get_across) # label(negated_conjecture) # answer(prove_can_get_across). [assumption].
% 0.45/0.74 8 -banks(west(m(n3),c(n3)),east(m(n0),c(n0)),boatonwest) | banks(west(m(n3),c(n1)),east(m(n0),c(n2)),boatoneast) # label(bmmmccc_x_to_mmmc_bcc) # label(axiom). [assumption].
% 0.45/0.74 9 -banks(west(m(n0),c(n3)),east(m(n3),c(n0)),boatonwest) | banks(west(m(n0),c(n1)),east(m(n3),c(n2)),boatoneast) # label(bccc_mmm_to_c_bmmmcc) # label(axiom). [assumption].
% 0.45/0.74 10 -banks(west(m(n3),c(n2)),east(m(n0),c(n1)),boatonwest) | banks(west(m(n3),c(n0)),east(m(n0),c(n3)),boatoneast) # label(bmmmcc_c_to_mmm_bccc) # label(axiom). [assumption].
% 0.45/0.74 11 -banks(west(m(n0),c(n2)),east(m(n3),c(n1)),boatonwest) | banks(west(m(n0),c(n0)),east(m(n3),c(n3)),boatoneast) # label(bcc_mmmc_to_x_bmmmccc) # label(axiom). [assumption].
% 0.45/0.74 12 -banks(west(m(n0),c(n2)),east(m(n3),c(n1)),boatoneast) | banks(west(m(n0),c(n3)),east(m(n3),c(n0)),boatonwest) # label(cc_bmmmc_to_bccc_mmm) # label(axiom). [assumption].
% 0.45/0.74 13 -banks(west(m(n0),c(n1)),east(m(n3),c(n2)),boatoneast) | banks(west(m(n0),c(n2)),east(m(n3),c(n1)),boatonwest) # label(c_bmmmcc_to_bcc_mmmc) # label(axiom). [assumption].
% 0.45/0.74 14 -banks(west(m(n3),c(n0)),east(m(n0),c(n3)),boatoneast) | banks(west(m(n3),c(n1)),east(m(n0),c(n2)),boatonwest) # label(mmm_bccc_to_bmmmc_cc) # label(axiom). [assumption].
% 0.45/0.74 15 -banks(west(m(n3),c(n1)),east(m(n0),c(n2)),boatoneast) | banks(west(m(n3),c(n2)),east(m(n0),c(n1)),boatonwest) # label(mmmc_bcc_to_bmmmcc_c) # label(axiom). [assumption].
% 0.45/0.74 20 -banks(west(m(n3),c(n1)),east(m(n0),c(n2)),boatonwest) | banks(west(m(n1),c(n1)),east(m(n2),c(n2)),boatoneast) # label(bmmmc_cc_to_mc_bmmcc) # label(axiom). [assumption].
% 0.45/0.74 21 -banks(west(m(n2),c(n2)),east(m(n1),c(n1)),boatonwest) | banks(west(m(n0),c(n2)),east(m(n3),c(n1)),boatoneast) # label(bmmcc_mc_to_cc_bmmmc) # label(axiom). [assumption].
% 0.45/0.74 29 -banks(west(m(n1),c(n1)),east(m(n2),c(n2)),boatoneast) | banks(west(m(n2),c(n2)),east(m(n1),c(n1)),boatonwest) # label(mc_bmmcc_to_bmmcc_mc) # label(axiom). [assumption].
% 0.45/0.74 31 banks(west(m(n3),c(n1)),east(m(n0),c(n2)),boatoneast). [ur(8,a,1,a)].
% 0.45/0.74 32 -banks(west(m(n0),c(n2)),east(m(n3),c(n1)),boatonwest) # answer(prove_can_get_across). [resolve(11,b,2,a)].
% 0.45/0.74 35 -banks(west(m(n0),c(n1)),east(m(n3),c(n2)),boatoneast) # answer(prove_can_get_across). [resolve(32,a,13,b)].
% 0.45/0.74 36 -banks(west(m(n0),c(n3)),east(m(n3),c(n0)),boatonwest) # answer(prove_can_get_across). [resolve(35,a,9,b)].
% 0.45/0.74 37 -banks(west(m(n0),c(n2)),east(m(n3),c(n1)),boatoneast) # answer(prove_can_get_across). [resolve(36,a,12,b)].
% 0.45/0.74 38 banks(west(m(n3),c(n2)),east(m(n0),c(n1)),boatonwest). [ur(15,a,31,a)].
% 0.45/0.74 39 banks(west(m(n3),c(n0)),east(m(n0),c(n3)),boatoneast). [ur(10,a,38,a)].
% 0.45/0.74 40 banks(west(m(n3),c(n1)),east(m(n0),c(n2)),boatonwest). [ur(14,a,39,a)].
% 0.45/0.74 41 -banks(west(m(n2),c(n2)),east(m(n1),c(n1)),boatonwest) # answer(prove_can_get_across). [resolve(37,a,21,b)].
% 0.45/0.74 42 -banks(west(m(n1),c(n1)),east(m(n2),c(n2)),boatoneast) # answer(prove_can_get_across). [resolve(41,a,29,b)].
% 0.45/0.74 43 -banks(west(m(n3),c(n1)),east(m(n0),c(n2)),boatonwest) # answer(prove_can_get_across). [resolve(42,a,20,b)].
% 0.45/0.74 44 $F # answer(prove_can_get_across). [resolve(43,a,40,a)].
% 0.45/0.74
% 0.45/0.74 % SZS output end Refutation
% 0.45/0.74 ============================== end of proof ==========================
% 0.45/0.74
% 0.45/0.74 ============================== STATISTICS ============================
% 0.45/0.74
% 0.45/0.74 Given=41. Generated=54. Kept=43. proofs=1.
% 0.45/0.74 Usable=15. Sos=1. Demods=0. Limbo=0, Disabled=58. Hints=0.
% 0.45/0.74 Megabytes=0.09.
% 0.45/0.74 User_CPU=0.01, System_CPU=0.00, Wall_clock=0.
% 0.45/0.74
% 0.45/0.74 ============================== end of statistics =====================
% 0.45/0.74
% 0.45/0.74 ============================== end of search =========================
% 0.45/0.74
% 0.45/0.74 THEOREM PROVED
% 0.45/0.74 % SZS status Unsatisfiable
% 0.45/0.74
% 0.45/0.74 Exiting with 1 proof.
% 0.45/0.74
% 0.45/0.74 Process 2755 exit (max_proofs) Sat May 28 19:54:26 2022
% 0.45/0.74 Prover9 interrupted
%------------------------------------------------------------------------------