TSTP Solution File: PUZ014-1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : PUZ014-1 : TPTP v8.1.0. Released v1.0.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:50 EDT 2022
% Result : Unsatisfiable 0.64s 0.95s
% Output : Refutation 0.64s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.11 % Problem : PUZ014-1 : TPTP v8.1.0. Released v1.0.0.
% 0.10/0.12 % Command : tptp2X_and_run_prover9 %d %s
% 0.11/0.32 % Computer : n028.cluster.edu
% 0.11/0.32 % Model : x86_64 x86_64
% 0.11/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.32 % Memory : 8042.1875MB
% 0.11/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.18/0.32 % CPULimit : 300
% 0.18/0.32 % WCLimit : 600
% 0.18/0.32 % DateTime : Sun May 29 02:19:33 EDT 2022
% 0.18/0.32 % CPUTime :
% 0.64/0.95 ============================== Prover9 ===============================
% 0.64/0.95 Prover9 (32) version 2009-11A, November 2009.
% 0.64/0.95 Process 16504 was started by sandbox2 on n028.cluster.edu,
% 0.64/0.95 Sun May 29 02:19:33 2022
% 0.64/0.95 The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 300 -f /tmp/Prover9_16267_n028.cluster.edu".
% 0.64/0.95 ============================== end of head ===========================
% 0.64/0.95
% 0.64/0.95 ============================== INPUT =================================
% 0.64/0.95
% 0.64/0.95 % Reading from file /tmp/Prover9_16267_n028.cluster.edu
% 0.64/0.95
% 0.64/0.95 set(prolog_style_variables).
% 0.64/0.95 set(auto2).
% 0.64/0.95 % set(auto2) -> set(auto).
% 0.64/0.95 % set(auto) -> set(auto_inference).
% 0.64/0.95 % set(auto) -> set(auto_setup).
% 0.64/0.95 % set(auto_setup) -> set(predicate_elim).
% 0.64/0.95 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.64/0.95 % set(auto) -> set(auto_limits).
% 0.64/0.95 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.64/0.95 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.64/0.95 % set(auto) -> set(auto_denials).
% 0.64/0.95 % set(auto) -> set(auto_process).
% 0.64/0.95 % set(auto2) -> assign(new_constants, 1).
% 0.64/0.95 % set(auto2) -> assign(fold_denial_max, 3).
% 0.64/0.95 % set(auto2) -> assign(max_weight, "200.000").
% 0.64/0.95 % set(auto2) -> assign(max_hours, 1).
% 0.64/0.95 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.64/0.95 % set(auto2) -> assign(max_seconds, 0).
% 0.64/0.95 % set(auto2) -> assign(max_minutes, 5).
% 0.64/0.95 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.64/0.95 % set(auto2) -> set(sort_initial_sos).
% 0.64/0.95 % set(auto2) -> assign(sos_limit, -1).
% 0.64/0.95 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.64/0.95 % set(auto2) -> assign(max_megs, 400).
% 0.64/0.95 % set(auto2) -> assign(stats, some).
% 0.64/0.95 % set(auto2) -> clear(echo_input).
% 0.64/0.95 % set(auto2) -> set(quiet).
% 0.64/0.95 % set(auto2) -> clear(print_initial_clauses).
% 0.64/0.95 % set(auto2) -> clear(print_given).
% 0.64/0.95 assign(lrs_ticks,-1).
% 0.64/0.95 assign(sos_limit,10000).
% 0.64/0.95 assign(order,kbo).
% 0.64/0.95 set(lex_order_vars).
% 0.64/0.95 clear(print_given).
% 0.64/0.95
% 0.64/0.95 % formulas(sos). % not echoed (20 formulas)
% 0.64/0.95
% 0.64/0.95 ============================== end of input ==========================
% 0.64/0.95
% 0.64/0.95 % From the command line: assign(max_seconds, 300).
% 0.64/0.95
% 0.64/0.95 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.64/0.95
% 0.64/0.95 % Formulas that are not ordinary clauses:
% 0.64/0.95
% 0.64/0.95 ============================== end of process non-clausal formulas ===
% 0.64/0.95
% 0.64/0.95 ============================== PROCESS INITIAL CLAUSES ===============
% 0.64/0.95
% 0.64/0.95 ============================== PREDICATE ELIMINATION =================
% 0.64/0.95
% 0.64/0.95 ============================== end predicate elimination =============
% 0.64/0.95
% 0.64/0.95 Auto_denials: (non-Horn, no changes).
% 0.64/0.95
% 0.64/0.95 Term ordering decisions:
% 0.64/0.95 Function symbol KB weights:
% 0.64/0.95
% 0.64/0.95 ============================== end of process initial clauses ========
% 0.64/0.95
% 0.64/0.95 ============================== CLAUSES FOR SEARCH ====================
% 0.64/0.95
% 0.64/0.95 ============================== end of clauses for search =============
% 0.64/0.95
% 0.64/0.95 ============================== SEARCH ================================
% 0.64/0.95
% 0.64/0.95 % Starting search at 0.01 seconds.
% 0.64/0.95
% 0.64/0.95 ============================== PROOF =================================
% 0.64/0.95 % SZS status Unsatisfiable
% 0.64/0.95 % SZS output start Refutation
% 0.64/0.95
% 0.64/0.95 % Proof 1 at 0.01 (+ 0.00) seconds.
% 0.64/0.95 % Length of proof is 34.
% 0.64/0.95 % Level of proof is 10.
% 0.64/0.95 % Maximum clause weight is 3.000.
% 0.64/0.95 % Given clauses 17.
% 0.64/0.95
% 0.64/0.95 1 some_english_sing # label(c18) # label(axiom). [assumption].
% 0.64/0.95 2 some_scotch_dance_not # label(c19) # label(axiom). [assumption].
% 0.64/0.95 3 some_monitors_are_not_awake # label(prove_all_monitors_are_awake) # label(negated_conjecture). [assumption].
% 0.64/0.95 7 -some_monitors_are_awake | -some_welsh_eat | -some_scotch_dance # label(c7) # label(axiom). [assumption].
% 0.64/0.95 8 -some_germans_play_not | -some_welsh_eat_not | -some_irish_fight # label(c8) # label(axiom). [assumption].
% 0.64/0.95 9 -some_english_sing | -some_english_sing_not | some_monitors_are_awake # label(c1) # label(axiom). [assumption].
% 0.64/0.95 10 -some_english_sing_not | some_monitors_are_awake. [copy(9),unit_del(a,1)].
% 0.64/0.95 11 -some_scotch_dance | -some_irish_fight | some_welsh_eat # label(c2) # label(axiom). [assumption].
% 0.64/0.95 12 -some_germans_play | some_germans_play_not | some_of_the_eleven_are_not_oiling # label(c3) # label(axiom). [assumption].
% 0.64/0.95 13 -some_monitors_are_awake | -some_monitors_are_not_awake | some_irish_fight # label(c4) # label(axiom). [assumption].
% 0.64/0.95 14 -some_monitors_are_awake | some_irish_fight. [copy(13),unit_del(b,3)].
% 0.64/0.95 15 -some_germans_play | some_scotch_dance | some_welsh_eat_not # label(c5) # label(axiom). [assumption].
% 0.64/0.95 16 -some_scotch_dance_not | -some_irish_fight_not | some_germans_play # label(c6) # label(axiom). [assumption].
% 0.64/0.95 17 -some_irish_fight_not | some_germans_play. [copy(16),unit_del(a,2)].
% 0.64/0.95 18 -some_english_sing | -some_monitors_are_not_awake | some_irish_fight_not # label(c10) # label(axiom). [assumption].
% 0.64/0.95 19 some_irish_fight_not. [copy(18),unit_del(a,1),unit_del(b,3)].
% 0.64/0.95 20 -some_monitors_are_awake | -some_of_the_eleven_are_not_oiling | some_scotch_dance # label(c11) # label(axiom). [assumption].
% 0.64/0.95 21 -some_english_sing | some_english_sing_not | -some_scotch_dance_not | -some_germans_play # label(c9) # label(axiom). [assumption].
% 0.64/0.95 22 some_english_sing_not | -some_germans_play. [copy(21),unit_del(a,1),unit_del(c,2)].
% 0.64/0.95 23 some_germans_play. [back_unit_del(17),unit_del(a,19)].
% 0.64/0.95 24 some_english_sing_not. [back_unit_del(22),unit_del(b,23)].
% 0.64/0.95 25 some_scotch_dance | some_welsh_eat_not. [back_unit_del(15),unit_del(a,23)].
% 0.64/0.95 26 some_germans_play_not | some_of_the_eleven_are_not_oiling. [back_unit_del(12),unit_del(a,23)].
% 0.64/0.95 27 some_monitors_are_awake. [back_unit_del(10),unit_del(a,24)].
% 0.64/0.95 28 -some_of_the_eleven_are_not_oiling | some_scotch_dance. [back_unit_del(20),unit_del(a,27)].
% 0.64/0.95 29 some_irish_fight. [back_unit_del(14),unit_del(a,27)].
% 0.64/0.95 30 -some_welsh_eat | -some_scotch_dance. [back_unit_del(7),unit_del(a,27)].
% 0.64/0.95 31 -some_scotch_dance | some_welsh_eat. [back_unit_del(11),unit_del(b,29)].
% 0.64/0.95 32 -some_germans_play_not | -some_welsh_eat_not. [back_unit_del(8),unit_del(c,29)].
% 0.64/0.95 33 some_scotch_dance | some_germans_play_not. [resolve(28,a,26,b)].
% 0.64/0.95 34 -some_germans_play_not | some_scotch_dance. [resolve(32,b,25,b)].
% 0.64/0.95 36 some_scotch_dance. [resolve(34,a,33,b),merge(b)].
% 0.64/0.95 37 some_welsh_eat. [back_unit_del(31),unit_del(a,36)].
% 0.64/0.95 38 $F. [back_unit_del(30),unit_del(a,37),unit_del(b,36)].
% 0.64/0.95
% 0.64/0.95 % SZS output end Refutation
% 0.64/0.95 ============================== end of proof ==========================
% 0.64/0.95
% 0.64/0.95 ============================== STATISTICS ============================
% 0.64/0.95
% 0.64/0.95 Given=17. Generated=36. Kept=32. proofs=1.
% 0.64/0.95 Usable=11. Sos=1. Demods=0. Limbo=2, Disabled=38. Hints=0.
% 0.64/0.95 Megabytes=0.03.
% 0.64/0.95 User_CPU=0.01, System_CPU=0.00, Wall_clock=0.
% 0.64/0.95
% 0.64/0.95 ============================== end of statistics =====================
% 0.64/0.95
% 0.64/0.95 ============================== end of search =========================
% 0.64/0.95
% 0.64/0.95 THEOREM PROVED
% 0.64/0.95 % SZS status Unsatisfiable
% 0.64/0.95
% 0.64/0.95 Exiting with 1 proof.
% 0.64/0.95
% 0.64/0.95 Process 16504 exit (max_proofs) Sun May 29 02:19:33 2022
% 0.64/0.95 Prover9 interrupted
%------------------------------------------------------------------------------