TSTP Solution File: PUZ020-1 by Prover9---1109a

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Prover9---1109a
% Problem  : PUZ020-1 : TPTP v8.1.0. Released v1.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : tptp2X_and_run_prover9 %d %s

% Computer : n027.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:51 EDT 2022

% Result   : Unsatisfiable 0.73s 0.99s
% Output   : Refutation 0.73s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem  : PUZ020-1 : TPTP v8.1.0. Released v1.0.0.
% 0.07/0.13  % Command  : tptp2X_and_run_prover9 %d %s
% 0.12/0.34  % Computer : n027.cluster.edu
% 0.12/0.34  % Model    : x86_64 x86_64
% 0.12/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34  % Memory   : 8042.1875MB
% 0.12/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34  % CPULimit : 300
% 0.12/0.34  % WCLimit  : 600
% 0.12/0.34  % DateTime : Sun May 29 01:34:59 EDT 2022
% 0.12/0.34  % CPUTime  : 
% 0.73/0.99  ============================== Prover9 ===============================
% 0.73/0.99  Prover9 (32) version 2009-11A, November 2009.
% 0.73/0.99  Process 3163 was started by sandbox on n027.cluster.edu,
% 0.73/0.99  Sun May 29 01:35:00 2022
% 0.73/0.99  The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_2794_n027.cluster.edu".
% 0.73/0.99  ============================== end of head ===========================
% 0.73/0.99  
% 0.73/0.99  ============================== INPUT =================================
% 0.73/0.99  
% 0.73/0.99  % Reading from file /tmp/Prover9_2794_n027.cluster.edu
% 0.73/0.99  
% 0.73/0.99  set(prolog_style_variables).
% 0.73/0.99  set(auto2).
% 0.73/0.99      % set(auto2) -> set(auto).
% 0.73/0.99      % set(auto) -> set(auto_inference).
% 0.73/0.99      % set(auto) -> set(auto_setup).
% 0.73/0.99      % set(auto_setup) -> set(predicate_elim).
% 0.73/0.99      % set(auto_setup) -> assign(eq_defs, unfold).
% 0.73/0.99      % set(auto) -> set(auto_limits).
% 0.73/0.99      % set(auto_limits) -> assign(max_weight, "100.000").
% 0.73/0.99      % set(auto_limits) -> assign(sos_limit, 20000).
% 0.73/0.99      % set(auto) -> set(auto_denials).
% 0.73/0.99      % set(auto) -> set(auto_process).
% 0.73/0.99      % set(auto2) -> assign(new_constants, 1).
% 0.73/0.99      % set(auto2) -> assign(fold_denial_max, 3).
% 0.73/0.99      % set(auto2) -> assign(max_weight, "200.000").
% 0.73/0.99      % set(auto2) -> assign(max_hours, 1).
% 0.73/0.99      % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.73/0.99      % set(auto2) -> assign(max_seconds, 0).
% 0.73/0.99      % set(auto2) -> assign(max_minutes, 5).
% 0.73/0.99      % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.73/0.99      % set(auto2) -> set(sort_initial_sos).
% 0.73/0.99      % set(auto2) -> assign(sos_limit, -1).
% 0.73/0.99      % set(auto2) -> assign(lrs_ticks, 3000).
% 0.73/0.99      % set(auto2) -> assign(max_megs, 400).
% 0.73/0.99      % set(auto2) -> assign(stats, some).
% 0.73/0.99      % set(auto2) -> clear(echo_input).
% 0.73/0.99      % set(auto2) -> set(quiet).
% 0.73/0.99      % set(auto2) -> clear(print_initial_clauses).
% 0.73/0.99      % set(auto2) -> clear(print_given).
% 0.73/0.99  assign(lrs_ticks,-1).
% 0.73/0.99  assign(sos_limit,10000).
% 0.73/0.99  assign(order,kbo).
% 0.73/0.99  set(lex_order_vars).
% 0.73/0.99  clear(print_given).
% 0.73/0.99  
% 0.73/0.99  % formulas(sos).  % not echoed (19 formulas)
% 0.73/0.99  
% 0.73/0.99  ============================== end of input ==========================
% 0.73/0.99  
% 0.73/0.99  % From the command line: assign(max_seconds, 300).
% 0.73/0.99  
% 0.73/0.99  ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.73/0.99  
% 0.73/0.99  % Formulas that are not ordinary clauses:
% 0.73/0.99  
% 0.73/0.99  ============================== end of process non-clausal formulas ===
% 0.73/0.99  
% 0.73/0.99  ============================== PROCESS INITIAL CLAUSES ===============
% 0.73/0.99  
% 0.73/0.99  ============================== PREDICATE ELIMINATION =================
% 0.73/0.99  1 -person(A) | -knight(A) | -knave(A) # label(not_both_a_knight_and_knave) # label(axiom).  [assumption].
% 0.73/0.99  2 person(husband) # label(husband) # label(hypothesis).  [assumption].
% 0.73/0.99  3 person(wife) # label(wife) # label(hypothesis).  [assumption].
% 0.73/0.99  Derived: -knight(husband) | -knave(husband).  [resolve(1,a,2,a)].
% 0.73/0.99  Derived: -knight(wife) | -knave(wife).  [resolve(1,a,3,a)].
% 0.73/0.99  4 -person(A) | A != statement_by(B) # label(people_do_not_equal_their_statement2) # label(axiom).  [assumption].
% 0.73/0.99  Derived: husband != statement_by(A).  [resolve(4,a,2,a)].
% 0.73/0.99  Derived: wife != statement_by(A).  [resolve(4,a,3,a)].
% 0.73/0.99  5 -person(A) | knight(A) | knave(A) # label(everyone_a_knight_or_knave) # label(axiom).  [assumption].
% 0.73/0.99  Derived: knight(husband) | knave(husband).  [resolve(5,a,2,a)].
% 0.73/0.99  Derived: knight(wife) | knave(wife).  [resolve(5,a,3,a)].
% 0.73/0.99  6 -person(A) | -a_truth(statement_by(A)) | knight(A) # label(knights_make_true_statements) # label(axiom).  [assumption].
% 0.73/0.99  Derived: -a_truth(statement_by(husband)) | knight(husband).  [resolve(6,a,2,a)].
% 0.73/0.99  Derived: -a_truth(statement_by(wife)) | knight(wife).  [resolve(6,a,3,a)].
% 0.73/0.99  7 -person(A) | a_truth(statement_by(A)) | knave(A) # label(knaves_make_false_statements) # label(axiom).  [assumption].
% 0.73/0.99  Derived: a_truth(statement_by(husband)) | knave(husband).  [resolve(7,a,2,a)].
% 0.73/0.99  Derived: a_truth(statement_by(wife)) | knave(wife).  [resolve(7,a,3,a)].
% 0.73/0.99  8 -says(A,B) | A != B # label(people_do_not_equal_their_statements1) # label(axiom).  [assumption].
% 0.73/0.99  9 says(husband,statement_by(husband)) # label(husband_makes_statements) # label(hypothesis).  [assumption].
% 0.73/0.99  10 -knave(A) | -says(A,B) | -a_truth(B) # label(knaves_do_not_say_the_truth) # label(axiom).  [assumption].
% 0.73/0.99  Derived: -knave(husband) | -a_truth(statement_by(husband)).  [resolve(10,b,9,a)].
% 0.73/0.99  11 -says(A,B) | a_truth(B) | -a_truth(B) # label(statements_are_true_or_false) # label(axiom).  [assumption].
% 0.73/0.99  12 -says(A,B) | B = statement_by(A) # label(peoples_statements) # label(axiom).  [assumption].
% 0.73/0.99  Derived: statement_by(husband) = statement_by(husband).  [resolve(12,a,9,a)].
% 0.73/0.99  13 -knight(A) | -says(A,B) | a_truth(B) # label(knights_say_the_truth) # label(axiom).  [assumption].
% 0.73/0.99  Derived: -knight(husband) | a_truth(statement_by(husband)).  [resolve(13,b,9,a)].
% 0.73/0.99  
% 0.73/0.99  ============================== end predicate elimination =============
% 0.73/0.99  
% 0.73/0.99  Auto_denials:  (non-Horn, no changes).
% 0.73/0.99  
% 0.73/0.99  Term ordering decisions:
% 0.73/0.99  
% 0.73/0.99  % Assigning unary symbol statement_by kb_weight 0 and highest precedence (7).
% 0.73/0.99  Function symbol KB weights:  husband=1. wife=1. statement_by=0.
% 0.73/0.99  
% 0.73/0.99  ============================== PROOF =================================
% 0.73/0.99  % SZS status Unsatisfiable
% 0.73/0.99  % SZS output start Refutation
% 0.73/0.99  
% 0.73/0.99  % Proof 1 at 0.01 (+ 0.00) seconds.
% 0.73/0.99  % Length of proof is 9.
% 0.73/0.99  % Level of proof is 4.
% 0.73/0.99  % Maximum clause weight is 5.000.
% 0.73/0.99  % Given clauses 0.
% 0.73/0.99  
% 0.73/0.99  2 person(husband) # label(husband) # label(hypothesis).  [assumption].
% 0.73/0.99  6 -person(A) | -a_truth(statement_by(A)) | knight(A) # label(knights_make_true_statements) # label(axiom).  [assumption].
% 0.73/0.99  14 a_truth(statement_by(husband)) | knight(wife) # label(knight_wife_or_truthful_husband) # label(hypothesis).  [assumption].
% 0.73/0.99  15 -knight(husband) # label(prove_knight_husband) # label(negated_conjecture).  [assumption].
% 0.73/0.99  18 -knight(wife) | a_truth(statement_by(husband)) # label(knight_wife_means_truthful_husband) # label(hypothesis).  [assumption].
% 0.73/0.99  27 -a_truth(statement_by(husband)) | knight(husband).  [resolve(6,a,2,a)].
% 0.73/0.99  28 -a_truth(statement_by(husband)).  [copy(27),unit_del(b,15)].
% 0.73/0.99  34 -knight(wife).  [back_unit_del(18),unit_del(b,28)].
% 0.73/0.99  35 $F.  [back_unit_del(14),unit_del(a,28),unit_del(b,34)].
% 0.73/0.99  
% 0.73/0.99  % SZS output end Refutation
% 0.73/0.99  ============================== end of proof ==========================
% 0.73/0.99  
% 0.73/0.99  ============================== STATISTICS ============================
% 0.73/0.99  
% 0.73/0.99  Given=0. Generated=21. Kept=13. proofs=1.
% 0.73/0.99  Usable=0. Sos=7. Demods=0. Limbo=4, Disabled=34. Hints=0.
% 0.73/0.99  Megabytes=0.03.
% 0.73/0.99  User_CPU=0.01, System_CPU=0.00, Wall_clock=0.
% 0.73/0.99  
% 0.73/0.99  ============================== end of statistics =====================
% 0.73/0.99  
% 0.73/0.99  ============================== end of search =========================
% 0.73/0.99  
% 0.73/0.99  THEOREM PROVED
% 0.73/0.99  % SZS status Unsatisfiable
% 0.73/0.99  
% 0.73/0.99  Exiting with 1 proof.
% 0.73/0.99  
% 0.73/0.99  Process 3163 exit (max_proofs) Sun May 29 01:35:00 2022
% 0.73/0.99  Prover9 interrupted
%------------------------------------------------------------------------------