TSTP Solution File: PUZ035-7 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : PUZ035-7 : TPTP v8.1.0. Released v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n024.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.71s 1.01s
% Output : Refutation 0.71s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.11 % Problem : PUZ035-7 : TPTP v8.1.0. Released v2.0.0.
% 0.07/0.12 % Command : tptp2X_and_run_prover9 %d %s
% 0.13/0.32 % Computer : n024.cluster.edu
% 0.13/0.32 % Model : x86_64 x86_64
% 0.13/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.32 % Memory : 8042.1875MB
% 0.13/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.32 % CPULimit : 300
% 0.13/0.32 % WCLimit : 600
% 0.13/0.32 % DateTime : Sat May 28 20:24:21 EDT 2022
% 0.13/0.33 % CPUTime :
% 0.71/1.01 ============================== Prover9 ===============================
% 0.71/1.01 Prover9 (32) version 2009-11A, November 2009.
% 0.71/1.01 Process 21407 was started by sandbox2 on n024.cluster.edu,
% 0.71/1.01 Sat May 28 20:24:22 2022
% 0.71/1.01 The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 300 -f /tmp/Prover9_21046_n024.cluster.edu".
% 0.71/1.01 ============================== end of head ===========================
% 0.71/1.01
% 0.71/1.01 ============================== INPUT =================================
% 0.71/1.01
% 0.71/1.01 % Reading from file /tmp/Prover9_21046_n024.cluster.edu
% 0.71/1.01
% 0.71/1.01 set(prolog_style_variables).
% 0.71/1.01 set(auto2).
% 0.71/1.01 % set(auto2) -> set(auto).
% 0.71/1.01 % set(auto) -> set(auto_inference).
% 0.71/1.01 % set(auto) -> set(auto_setup).
% 0.71/1.01 % set(auto_setup) -> set(predicate_elim).
% 0.71/1.01 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.71/1.01 % set(auto) -> set(auto_limits).
% 0.71/1.01 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.71/1.01 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.71/1.01 % set(auto) -> set(auto_denials).
% 0.71/1.01 % set(auto) -> set(auto_process).
% 0.71/1.01 % set(auto2) -> assign(new_constants, 1).
% 0.71/1.01 % set(auto2) -> assign(fold_denial_max, 3).
% 0.71/1.01 % set(auto2) -> assign(max_weight, "200.000").
% 0.71/1.01 % set(auto2) -> assign(max_hours, 1).
% 0.71/1.01 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.71/1.01 % set(auto2) -> assign(max_seconds, 0).
% 0.71/1.01 % set(auto2) -> assign(max_minutes, 5).
% 0.71/1.01 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.71/1.01 % set(auto2) -> set(sort_initial_sos).
% 0.71/1.01 % set(auto2) -> assign(sos_limit, -1).
% 0.71/1.01 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.71/1.01 % set(auto2) -> assign(max_megs, 400).
% 0.71/1.01 % set(auto2) -> assign(stats, some).
% 0.71/1.01 % set(auto2) -> clear(echo_input).
% 0.71/1.01 % set(auto2) -> set(quiet).
% 0.71/1.01 % set(auto2) -> clear(print_initial_clauses).
% 0.71/1.01 % set(auto2) -> clear(print_given).
% 0.71/1.01 assign(lrs_ticks,-1).
% 0.71/1.01 assign(sos_limit,10000).
% 0.71/1.01 assign(order,kbo).
% 0.71/1.01 set(lex_order_vars).
% 0.71/1.01 clear(print_given).
% 0.71/1.01
% 0.71/1.01 % formulas(sos). % not echoed (14 formulas)
% 0.71/1.01
% 0.71/1.01 ============================== end of input ==========================
% 0.71/1.01
% 0.71/1.01 % From the command line: assign(max_seconds, 300).
% 0.71/1.01
% 0.71/1.01 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.71/1.01
% 0.71/1.01 % Formulas that are not ordinary clauses:
% 0.71/1.01
% 0.71/1.01 ============================== end of process non-clausal formulas ===
% 0.71/1.01
% 0.71/1.01 ============================== PROCESS INITIAL CLAUSES ===============
% 0.71/1.01
% 0.71/1.01 ============================== PREDICATE ELIMINATION =================
% 0.71/1.01
% 0.71/1.01 ============================== end predicate elimination =============
% 0.71/1.01
% 0.71/1.01 Auto_denials: (non-Horn, no changes).
% 0.71/1.01
% 0.71/1.01 Term ordering decisions:
% 0.71/1.01
% 0.71/1.01 % Assigning unary symbol not kb_weight 0 and highest precedence (11).
% 0.71/1.01 Function symbol KB weights: knight=1. yes=1. knave=1. no=1. asked=1. other=1. isa=1. or=1. not=0.
% 0.71/1.01
% 0.71/1.01 ============================== end of process initial clauses ========
% 0.71/1.01
% 0.71/1.01 ============================== CLAUSES FOR SEARCH ====================
% 0.71/1.01
% 0.71/1.01 ============================== end of clauses for search =============
% 0.71/1.01
% 0.71/1.01 ============================== SEARCH ================================
% 0.71/1.01
% 0.71/1.01 % Starting search at 0.01 seconds.
% 0.71/1.01
% 0.71/1.01 ============================== PROOF =================================
% 0.71/1.01 % SZS status Unsatisfiable
% 0.71/1.01 % SZS output start Refutation
% 0.71/1.01
% 0.71/1.01 % Proof 1 at 0.05 (+ 0.00) seconds.
% 0.71/1.01 % Length of proof is 24.
% 0.71/1.01 % Level of proof is 11.
% 0.71/1.01 % Maximum clause weight is 20.000.
% 0.71/1.01 % Given clauses 152.
% 0.71/1.01
% 0.71/1.01 2 truth(isa(A,knight)) | truth(isa(A,knave)) # label(everyone_a_knight_or_knave) # label(axiom). [assumption].
% 0.71/1.01 3 reply(A,B,yes) | reply(A,B,no) # label(yes_or_no) # label(axiom). [assumption].
% 0.71/1.01 4 truth(A) | truth(isa(B,knight)) | reply(B,A,yes) # label(knights_make_true_statements4) # label(axiom). [assumption].
% 0.71/1.01 8 -reply(asked,or(isa(asked,knight),isa(other,knight)),A) | -truth(isa(asked,B)) | -truth(isa(other,C)) # label(prove_answer) # label(negated_conjecture). [assumption].
% 0.71/1.01 9 truth(or(A,B)) | -truth(A) # label(or2) # label(axiom). [assumption].
% 0.71/1.01 10 truth(or(A,B)) | -truth(B) # label(or3) # label(axiom). [assumption].
% 0.71/1.01 11 truth(A) | truth(B) | -truth(or(A,B)) # label(or1) # label(axiom). [assumption].
% 0.71/1.01 13 -truth(A) | truth(isa(B,knight)) | -reply(B,A,yes) # label(knights_make_true_statements2) # label(axiom). [assumption].
% 0.71/1.01 14 -truth(A) | -truth(isa(B,knight)) | reply(B,A,yes) # label(knights_make_true_statements3) # label(axiom). [assumption].
% 0.71/1.01 18 -truth(isa(asked,A)) | -truth(isa(other,B)) | truth(or(isa(asked,knight),isa(other,knight))) | truth(isa(asked,knight)). [resolve(8,a,4,c)].
% 0.71/1.01 19 -truth(isa(asked,A)) | -truth(isa(other,B)) | reply(asked,or(isa(asked,knight),isa(other,knight)),yes). [resolve(8,a,3,b)].
% 0.71/1.01 26 -truth(isa(other,A)) | truth(or(isa(asked,knight),isa(other,knight))) | truth(isa(asked,knight)). [resolve(18,a,2,b),merge(d)].
% 0.71/1.01 40 -truth(isa(other,A)) | reply(asked,or(isa(asked,knight),isa(other,knight)),yes) | truth(isa(asked,knight)). [resolve(19,a,2,b)].
% 0.71/1.01 63 truth(or(isa(asked,knight),isa(other,knight))) | truth(isa(asked,knight)) | truth(isa(other,knight)). [resolve(26,a,2,b)].
% 0.71/1.01 234 truth(isa(asked,knight)) | truth(isa(other,knight)). [resolve(63,a,11,c),merge(c),merge(d)].
% 0.71/1.01 242 truth(isa(asked,knight)) | reply(asked,or(isa(asked,knight),isa(other,knight)),yes). [resolve(234,b,40,a),merge(c)].
% 0.71/1.01 253 truth(isa(asked,knight)) | truth(or(A,isa(other,knight))). [resolve(234,b,10,b)].
% 0.71/1.01 404 truth(isa(asked,knight)) | -truth(or(isa(asked,knight),isa(other,knight))). [resolve(242,b,13,c),merge(c)].
% 0.71/1.01 406 truth(isa(asked,knight)). [resolve(404,b,253,b),merge(b)].
% 0.71/1.01 428 -truth(A) | reply(asked,A,yes). [resolve(406,a,14,b)].
% 0.71/1.01 431 truth(or(isa(asked,knight),A)). [resolve(406,a,9,b)].
% 0.71/1.01 497 reply(asked,or(isa(asked,knight),A),yes). [resolve(431,a,428,a)].
% 0.71/1.01 540 -truth(isa(other,A)). [ur(8,a,497,a,b,406,a)].
% 0.71/1.01 542 $F. [resolve(540,a,2,b),unit_del(a,540)].
% 0.71/1.01
% 0.71/1.01 % SZS output end Refutation
% 0.71/1.01 ============================== end of proof ==========================
% 0.71/1.01
% 0.71/1.01 ============================== STATISTICS ============================
% 0.71/1.01
% 0.71/1.01 Given=152. Generated=805. Kept=541. proofs=1.
% 0.71/1.01 Usable=123. Sos=231. Demods=0. Limbo=0, Disabled=201. Hints=0.
% 0.71/1.01 Megabytes=0.47.
% 0.71/1.01 User_CPU=0.05, System_CPU=0.00, Wall_clock=0.
% 0.71/1.01
% 0.71/1.01 ============================== end of statistics =====================
% 0.71/1.01
% 0.71/1.01 ============================== end of search =========================
% 0.71/1.01
% 0.71/1.01 THEOREM PROVED
% 0.71/1.01 % SZS status Unsatisfiable
% 0.71/1.01
% 0.71/1.01 Exiting with 1 proof.
% 0.71/1.01
% 0.71/1.01 Process 21407 exit (max_proofs) Sat May 28 20:24:22 2022
% 0.71/1.01 Prover9 interrupted
%------------------------------------------------------------------------------