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