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