TSTP Solution File: PUZ035-4 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : PUZ035-4 : TPTP v8.1.0. Released v2.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:54 EDT 2022
% Result : Unsatisfiable 0.43s 0.96s
% Output : Refutation 0.43s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.11 % Problem : PUZ035-4 : TPTP v8.1.0. Released v2.0.0.
% 0.06/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.11/0.32 % CPULimit : 300
% 0.11/0.32 % WCLimit : 600
% 0.11/0.32 % DateTime : Sat May 28 23:06:17 EDT 2022
% 0.11/0.33 % CPUTime :
% 0.43/0.96 ============================== Prover9 ===============================
% 0.43/0.96 Prover9 (32) version 2009-11A, November 2009.
% 0.43/0.96 Process 4535 was started by sandbox2 on n028.cluster.edu,
% 0.43/0.96 Sat May 28 23:06:18 2022
% 0.43/0.96 The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 300 -f /tmp/Prover9_4380_n028.cluster.edu".
% 0.43/0.96 ============================== end of head ===========================
% 0.43/0.96
% 0.43/0.96 ============================== INPUT =================================
% 0.43/0.96
% 0.43/0.96 % Reading from file /tmp/Prover9_4380_n028.cluster.edu
% 0.43/0.96
% 0.43/0.96 set(prolog_style_variables).
% 0.43/0.96 set(auto2).
% 0.43/0.96 % set(auto2) -> set(auto).
% 0.43/0.96 % set(auto) -> set(auto_inference).
% 0.43/0.96 % set(auto) -> set(auto_setup).
% 0.43/0.96 % set(auto_setup) -> set(predicate_elim).
% 0.43/0.96 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.43/0.96 % set(auto) -> set(auto_limits).
% 0.43/0.96 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.43/0.96 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.43/0.96 % set(auto) -> set(auto_denials).
% 0.43/0.96 % set(auto) -> set(auto_process).
% 0.43/0.96 % set(auto2) -> assign(new_constants, 1).
% 0.43/0.96 % set(auto2) -> assign(fold_denial_max, 3).
% 0.43/0.96 % set(auto2) -> assign(max_weight, "200.000").
% 0.43/0.96 % set(auto2) -> assign(max_hours, 1).
% 0.43/0.96 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.43/0.96 % set(auto2) -> assign(max_seconds, 0).
% 0.43/0.96 % set(auto2) -> assign(max_minutes, 5).
% 0.43/0.96 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.43/0.96 % set(auto2) -> set(sort_initial_sos).
% 0.43/0.96 % set(auto2) -> assign(sos_limit, -1).
% 0.43/0.96 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.43/0.96 % set(auto2) -> assign(max_megs, 400).
% 0.43/0.96 % set(auto2) -> assign(stats, some).
% 0.43/0.96 % set(auto2) -> clear(echo_input).
% 0.43/0.96 % set(auto2) -> set(quiet).
% 0.43/0.96 % set(auto2) -> clear(print_initial_clauses).
% 0.43/0.96 % set(auto2) -> clear(print_given).
% 0.43/0.96 assign(lrs_ticks,-1).
% 0.43/0.96 assign(sos_limit,10000).
% 0.43/0.96 assign(order,kbo).
% 0.43/0.96 set(lex_order_vars).
% 0.43/0.96 clear(print_given).
% 0.43/0.96
% 0.43/0.96 % formulas(sos). % not echoed (14 formulas)
% 0.43/0.96
% 0.43/0.96 ============================== end of input ==========================
% 0.43/0.96
% 0.43/0.96 % From the command line: assign(max_seconds, 300).
% 0.43/0.96
% 0.43/0.96 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.43/0.96
% 0.43/0.96 % Formulas that are not ordinary clauses:
% 0.43/0.96
% 0.43/0.96 ============================== end of process non-clausal formulas ===
% 0.43/0.96
% 0.43/0.96 ============================== PROCESS INITIAL CLAUSES ===============
% 0.43/0.96
% 0.43/0.96 ============================== PREDICATE ELIMINATION =================
% 0.43/0.96 1 -person(A) | truth(isa(A,knight)) | truth(isa(A,knave)) # label(everyone_a_knight_or_knave) # label(axiom). [assumption].
% 0.43/0.96 2 person(asked) # label(asked_person) # label(axiom). [assumption].
% 0.43/0.96 3 person(other) # label(other_person) # label(axiom). [assumption].
% 0.43/0.96 Derived: truth(isa(asked,knight)) | truth(isa(asked,knave)). [resolve(1,a,2,a)].
% 0.43/0.96 Derived: truth(isa(other,knight)) | truth(isa(other,knave)). [resolve(1,a,3,a)].
% 0.43/0.96
% 0.43/0.96 ============================== end predicate elimination =============
% 0.43/0.96
% 0.43/0.96 Auto_denials: (non-Horn, no changes).
% 0.43/0.96
% 0.43/0.96 Term ordering decisions:
% 0.43/0.96
% 0.43/0.96 % Assigning unary symbol not kb_weight 0 and highest precedence (9).
% 0.43/0.96 Function symbol KB weights: knight=1. asked=1. other=1. knave=1. isa=1. or=1. not=0.
% 0.43/0.96
% 0.43/0.96 ============================== end of process initial clauses ========
% 0.43/0.96
% 0.43/0.96 ============================== CLAUSES FOR SEARCH ====================
% 0.43/0.96
% 0.43/0.96 ============================== end of clauses for search =============
% 0.43/0.96
% 0.43/0.96 ============================== SEARCH ================================
% 0.43/0.96
% 0.43/0.96 % Starting search at 0.01 seconds.
% 0.43/0.96
% 0.43/0.96 ============================== PROOF =================================
% 0.43/0.96 % SZS status Unsatisfiable
% 0.43/0.96 % SZS output start Refutation
% 0.43/0.96
% 0.43/0.96 % Proof 1 at 0.01 (+ 0.00) seconds.
% 0.43/0.96 % Length of proof is 25.
% 0.43/0.96 % Level of proof is 14.
% 0.43/0.96 % Maximum clause weight is 22.000.
% 0.43/0.96 % Given clauses 29.
% 0.43/0.96
% 0.43/0.96 1 -person(A) | truth(isa(A,knight)) | truth(isa(A,knave)) # label(everyone_a_knight_or_knave) # label(axiom). [assumption].
% 0.43/0.96 2 person(asked) # label(asked_person) # label(axiom). [assumption].
% 0.43/0.96 3 person(other) # label(other_person) # label(axiom). [assumption].
% 0.43/0.96 4 says(asked,or(isa(asked,knight),isa(other,knight))) | says(asked,not(or(isa(asked,knight),isa(other,knight)))) # label(one_is_knight_answer) # label(axiom). [assumption].
% 0.43/0.96 6 -truth(A) | -truth(not(or(A,B))) # label(not1) # label(axiom). [assumption].
% 0.43/0.96 9 -truth(isa(asked,A)) | -truth(isa(other,B)) | -says(asked,C) # label(prove_answer) # label(negated_conjecture). [assumption].
% 0.43/0.96 12 truth(A) | -says(B,A) | -truth(isa(B,knight)) # label(knights_make_true_statements1) # label(axiom). [assumption].
% 0.43/0.96 15 truth(isa(asked,knight)) | truth(isa(asked,knave)). [resolve(1,a,2,a)].
% 0.43/0.96 16 truth(isa(other,knight)) | truth(isa(other,knave)). [resolve(1,a,3,a)].
% 0.43/0.96 18 -truth(isa(asked,A)) | -truth(isa(other,B)) | says(asked,or(isa(asked,knight),isa(other,knight))). [resolve(9,c,4,b)].
% 0.43/0.96 20 truth(not(or(isa(asked,knight),isa(other,knight)))) | -truth(isa(asked,knight)) | says(asked,or(isa(asked,knight),isa(other,knight))). [resolve(12,b,4,b)].
% 0.43/0.96 23 -truth(isa(other,A)) | says(asked,or(isa(asked,knight),isa(other,knight))) | truth(isa(asked,knight)). [resolve(18,a,15,b)].
% 0.43/0.96 25 says(asked,or(isa(asked,knight),isa(other,knight))) | truth(isa(asked,knight)) | truth(isa(other,knight)). [resolve(23,a,16,b)].
% 0.43/0.96 27 truth(isa(asked,knight)) | truth(isa(other,knight)) | -truth(isa(asked,A)) | -truth(isa(other,B)). [resolve(25,a,9,c)].
% 0.43/0.96 28 truth(isa(asked,knight)) | truth(isa(other,knight)) | -truth(isa(other,A)). [resolve(27,c,15,b),merge(d)].
% 0.43/0.96 34 truth(isa(asked,knight)) | truth(isa(other,knight)). [resolve(28,c,16,b),merge(c)].
% 0.43/0.96 35 truth(isa(asked,knight)) | says(asked,or(isa(asked,knight),isa(other,knight))). [resolve(34,b,23,a),merge(c)].
% 0.43/0.96 38 truth(isa(asked,knight)) | -truth(isa(asked,A)) | -truth(isa(other,B)). [resolve(35,b,9,c)].
% 0.43/0.96 39 truth(isa(asked,knight)) | -truth(isa(other,A)). [resolve(38,b,15,b),merge(c)].
% 0.43/0.96 41 truth(isa(asked,knight)). [resolve(39,b,34,b),merge(b)].
% 0.43/0.96 42 truth(not(or(isa(asked,knight),isa(other,knight)))) | says(asked,or(isa(asked,knight),isa(other,knight))). [back_unit_del(20),unit_del(b,41)].
% 0.43/0.96 47 -truth(not(or(isa(asked,knight),A))). [ur(6,a,41,a)].
% 0.43/0.96 49 says(asked,or(isa(asked,knight),isa(other,knight))). [back_unit_del(42),unit_del(a,47)].
% 0.43/0.96 54 -truth(isa(other,A)). [ur(9,a,41,a,c,49,a)].
% 0.43/0.96 55 $F. [back_unit_del(16),unit_del(a,54),unit_del(b,54)].
% 0.43/0.96
% 0.43/0.96 % SZS output end Refutation
% 0.43/0.96 ============================== end of proof ==========================
% 0.43/0.96
% 0.43/0.96 ============================== STATISTICS ============================
% 0.43/0.96
% 0.43/0.96 Given=29. Generated=63. Kept=51. proofs=1.
% 0.43/0.96 Usable=12. Sos=5. Demods=0. Limbo=1, Disabled=49. Hints=0.
% 0.43/0.96 Megabytes=0.07.
% 0.43/0.96 User_CPU=0.02, System_CPU=0.00, Wall_clock=0.
% 0.43/0.96
% 0.43/0.96 ============================== end of statistics =====================
% 0.43/0.96
% 0.43/0.96 ============================== end of search =========================
% 0.43/0.96
% 0.43/0.96 THEOREM PROVED
% 0.43/0.96 % SZS status Unsatisfiable
% 0.43/0.96
% 0.43/0.96 Exiting with 1 proof.
% 0.43/0.96
% 0.43/0.96 Process 4535 exit (max_proofs) Sat May 28 23:06:18 2022
% 0.43/0.96 Prover9 interrupted
%------------------------------------------------------------------------------