TSTP Solution File: PUZ035-2 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : PUZ035-2 : TPTP v8.1.0. Released v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n022.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 0.96s
% Output : Refutation 0.71s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : PUZ035-2 : TPTP v8.1.0. Released v2.0.0.
% 0.03/0.12 % Command : tptp2X_and_run_prover9 %d %s
% 0.13/0.33 % Computer : n022.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % WCLimit : 600
% 0.13/0.33 % DateTime : Sun May 29 02:17:23 EDT 2022
% 0.13/0.33 % CPUTime :
% 0.44/0.96 ============================== Prover9 ===============================
% 0.44/0.96 Prover9 (32) version 2009-11A, November 2009.
% 0.44/0.96 Process 3437 was started by sandbox on n022.cluster.edu,
% 0.44/0.96 Sun May 29 02:17:23 2022
% 0.44/0.96 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_3284_n022.cluster.edu".
% 0.44/0.96 ============================== end of head ===========================
% 0.44/0.96
% 0.44/0.96 ============================== INPUT =================================
% 0.44/0.96
% 0.44/0.96 % Reading from file /tmp/Prover9_3284_n022.cluster.edu
% 0.44/0.96
% 0.44/0.96 set(prolog_style_variables).
% 0.44/0.96 set(auto2).
% 0.44/0.96 % set(auto2) -> set(auto).
% 0.44/0.96 % set(auto) -> set(auto_inference).
% 0.44/0.96 % set(auto) -> set(auto_setup).
% 0.44/0.96 % set(auto_setup) -> set(predicate_elim).
% 0.44/0.96 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.44/0.96 % set(auto) -> set(auto_limits).
% 0.44/0.96 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.44/0.96 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.44/0.96 % set(auto) -> set(auto_denials).
% 0.44/0.96 % set(auto) -> set(auto_process).
% 0.44/0.96 % set(auto2) -> assign(new_constants, 1).
% 0.44/0.96 % set(auto2) -> assign(fold_denial_max, 3).
% 0.44/0.96 % set(auto2) -> assign(max_weight, "200.000").
% 0.44/0.96 % set(auto2) -> assign(max_hours, 1).
% 0.44/0.96 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.44/0.96 % set(auto2) -> assign(max_seconds, 0).
% 0.44/0.96 % set(auto2) -> assign(max_minutes, 5).
% 0.44/0.96 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.44/0.96 % set(auto2) -> set(sort_initial_sos).
% 0.44/0.96 % set(auto2) -> assign(sos_limit, -1).
% 0.44/0.96 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.44/0.96 % set(auto2) -> assign(max_megs, 400).
% 0.44/0.96 % set(auto2) -> assign(stats, some).
% 0.44/0.96 % set(auto2) -> clear(echo_input).
% 0.44/0.96 % set(auto2) -> set(quiet).
% 0.44/0.96 % set(auto2) -> clear(print_initial_clauses).
% 0.44/0.96 % set(auto2) -> clear(print_given).
% 0.44/0.96 assign(lrs_ticks,-1).
% 0.44/0.96 assign(sos_limit,10000).
% 0.44/0.96 assign(order,kbo).
% 0.44/0.96 set(lex_order_vars).
% 0.44/0.96 clear(print_given).
% 0.44/0.96
% 0.44/0.96 % formulas(sos). % not echoed (16 formulas)
% 0.44/0.96
% 0.44/0.96 ============================== end of input ==========================
% 0.44/0.96
% 0.44/0.96 % From the command line: assign(max_seconds, 300).
% 0.44/0.96
% 0.44/0.96 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.44/0.96
% 0.44/0.96 % Formulas that are not ordinary clauses:
% 0.44/0.96
% 0.44/0.96 ============================== end of process non-clausal formulas ===
% 0.44/0.96
% 0.44/0.96 ============================== PROCESS INITIAL CLAUSES ===============
% 0.44/0.96
% 0.44/0.96 ============================== PREDICATE ELIMINATION =================
% 0.44/0.96 1 -person(A) | tell_the_truth(A) | lies(A) # label(statements_are_true_or_false2) # label(axiom). [assumption].
% 0.44/0.96 2 person(asked) # label(asked_person) # label(axiom). [assumption].
% 0.44/0.96 3 person(other) # label(other_person) # label(axiom). [assumption].
% 0.44/0.96 Derived: tell_the_truth(asked) | lies(asked). [resolve(1,a,2,a)].
% 0.44/0.96 Derived: tell_the_truth(other) | lies(other). [resolve(1,a,3,a)].
% 0.44/0.96 4 -person(A) | isa(A,knight) | isa(A,knave) # label(everyone_a_knight_or_knave) # label(axiom). [assumption].
% 0.44/0.96 Derived: isa(asked,knight) | isa(asked,knave). [resolve(4,a,2,a)].
% 0.44/0.96 Derived: isa(other,knight) | isa(other,knave). [resolve(4,a,3,a)].
% 0.44/0.96 5 -isa(A,knight) | tell_the_truth(A) # label(knights_make_true_statements) # label(axiom). [assumption].
% 0.44/0.96 6 -tell_the_truth(A) | -lies(A) # label(statements_are_true_or_false) # label(axiom). [assumption].
% 0.44/0.96 7 -response(no) | -tell_the_truth(asked) | -isa(A,knight) # label(knight_answers2) # label(axiom). [assumption].
% 0.44/0.96 Derived: -isa(A,knight) | -lies(A). [resolve(5,b,6,a)].
% 0.44/0.96 Derived: -isa(asked,knight) | -response(no) | -isa(A,knight). [resolve(5,b,7,b)].
% 0.44/0.96 8 response(yes) | -tell_the_truth(asked) | -isa(A,knight) # label(knight_answers3) # label(axiom). [assumption].
% 0.44/0.96 Derived: response(yes) | -isa(A,knight) | -isa(asked,knight). [resolve(8,b,5,b)].
% 0.44/0.96 9 isa(asked,knight) | isa(other,knight) | -response(yes) | -tell_the_truth(asked) # label(true_one_is_a_knight) # label(axiom). [assumption].
% 0.44/0.96 10 response(no) | isa(asked,knight) | isa(other,knight) | -tell_the_truth(asked) # label(truthful_answer) # label(axiom). [assumption].
% 0.44/0.96 11 tell_the_truth(asked) | lies(asked). [resolve(1,a,2,a)].
% 0.44/0.96 Derived: lies(asked) | -response(no) | -isa(A,knight). [resolve(11,a,7,b)].
% 0.44/0.96 Derived: lies(asked) | response(yes) | -isa(A,knight). [resolve(11,a,8,b)].
% 0.71/0.96 Derived: lies(asked) | isa(asked,knight) | isa(other,knight) | -response(yes). [resolve(11,a,9,d)].
% 0.71/0.96 Derived: lies(asked) | response(no) | isa(asked,knight) | isa(other,knight). [resolve(11,a,10,d)].
% 0.71/0.96 12 tell_the_truth(other) | lies(other). [resolve(1,a,3,a)].
% 0.71/0.96 13 -isa(A,knave) | lies(A) # label(knaves_make_false_statements) # label(axiom). [assumption].
% 0.71/0.96 14 -response(yes) | -lies(asked) | -isa(A,knight) # label(knight_answers1) # label(axiom). [assumption].
% 0.71/0.96 Derived: -isa(asked,knave) | -response(yes) | -isa(A,knight). [resolve(13,b,14,b)].
% 0.71/0.96 15 isa(asked,knight) | isa(other,knight) | -response(no) | -lies(asked) # label(lie_one_is_a_knight) # label(axiom). [assumption].
% 0.71/0.96 Derived: isa(asked,knight) | isa(other,knight) | -response(no) | -isa(asked,knave). [resolve(15,d,13,b)].
% 0.71/0.96 16 -isa(A,knight) | -lies(A). [resolve(5,b,6,a)].
% 0.71/0.96 Derived: -isa(A,knight) | -isa(A,knave). [resolve(16,b,13,b)].
% 0.71/0.96 17 lies(asked) | -response(no) | -isa(A,knight). [resolve(11,a,7,b)].
% 0.71/0.96 Derived: -response(no) | -isa(A,knight) | -response(yes) | -isa(B,knight). [resolve(17,a,14,b)].
% 0.71/0.96 Derived: -response(no) | -isa(A,knight) | isa(asked,knight) | isa(other,knight) | -response(no). [resolve(17,a,15,d)].
% 0.71/0.96 Derived: -response(no) | -isa(A,knight) | -isa(asked,knight). [resolve(17,a,16,b)].
% 0.71/0.96 18 lies(asked) | response(yes) | -isa(A,knight). [resolve(11,a,8,b)].
% 0.71/0.96 Derived: response(yes) | -isa(A,knight) | -isa(asked,knight). [resolve(18,a,16,b)].
% 0.71/0.96 19 lies(asked) | isa(asked,knight) | isa(other,knight) | -response(yes). [resolve(11,a,9,d)].
% 0.71/0.96 Derived: isa(asked,knight) | isa(other,knight) | -response(yes) | -response(yes) | -isa(A,knight). [resolve(19,a,14,b)].
% 0.71/0.96 Derived: isa(asked,knight) | isa(other,knight) | -response(yes) | isa(asked,knight) | isa(other,knight) | -response(no). [resolve(19,a,15,d)].
% 0.71/0.96 20 lies(asked) | response(no) | isa(asked,knight) | isa(other,knight). [resolve(11,a,10,d)].
% 0.71/0.96
% 0.71/0.96 ============================== end predicate elimination =============
% 0.71/0.96
% 0.71/0.96 Auto_denials: (non-Horn, no changes).
% 0.71/0.96
% 0.71/0.96 Term ordering decisions:
% 0.71/0.96 Function symbol KB weights: knight=1. asked=1. other=1. yes=1. no=1. knave=1.
% 0.71/0.96
% 0.71/0.96 ============================== end of process initial clauses ========
% 0.71/0.96
% 0.71/0.96 ============================== CLAUSES FOR SEARCH ====================
% 0.71/0.96
% 0.71/0.96 ============================== end of clauses for search =============
% 0.71/0.96
% 0.71/0.96 ============================== SEARCH ================================
% 0.71/0.96
% 0.71/0.96 % Starting search at 0.01 seconds.
% 0.71/0.96
% 0.71/0.96 ============================== PROOF =================================
% 0.71/0.96 % SZS status Unsatisfiable
% 0.71/0.96 % SZS output start Refutation
% 0.71/0.96
% 0.71/0.96 % Proof 1 at 0.01 (+ 0.00) seconds.
% 0.71/0.96 % Length of proof is 29.
% 0.71/0.96 % Level of proof is 12.
% 0.71/0.96 % Maximum clause weight is 8.000.
% 0.71/0.96 % Given clauses 24.
% 0.71/0.96
% 0.71/0.96 2 person(asked) # label(asked_person) # label(axiom). [assumption].
% 0.71/0.96 3 person(other) # label(other_person) # label(axiom). [assumption].
% 0.71/0.96 4 -person(A) | isa(A,knight) | isa(A,knave) # label(everyone_a_knight_or_knave) # label(axiom). [assumption].
% 0.71/0.96 5 -isa(A,knight) | tell_the_truth(A) # label(knights_make_true_statements) # label(axiom). [assumption].
% 0.71/0.96 8 response(yes) | -tell_the_truth(asked) | -isa(A,knight) # label(knight_answers3) # label(axiom). [assumption].
% 0.71/0.96 13 -isa(A,knave) | lies(A) # label(knaves_make_false_statements) # label(axiom). [assumption].
% 0.71/0.96 14 -response(yes) | -lies(asked) | -isa(A,knight) # label(knight_answers1) # label(axiom). [assumption].
% 0.71/0.96 21 response(yes) | response(no) # label(two_answers) # label(axiom). [assumption].
% 0.71/0.96 23 -response(A) | -isa(asked,B) | -isa(other,C) # label(prove_answer) # label(negated_conjecture). [assumption].
% 0.71/0.96 24 isa(asked,knight) | isa(asked,knave). [resolve(4,a,2,a)].
% 0.71/0.96 25 isa(other,knight) | isa(other,knave). [resolve(4,a,3,a)].
% 0.71/0.96 27 response(yes) | -isa(A,knight) | -isa(asked,knight). [resolve(8,b,5,b)].
% 0.71/0.96 28 -isa(asked,knave) | -response(yes) | -isa(A,knight). [resolve(13,b,14,b)].
% 0.71/0.96 38 response(yes) | -isa(asked,knight). [factor(27,b,c)].
% 0.71/0.96 40 isa(asked,knight) | -response(A) | -isa(other,B). [resolve(24,b,23,b)].
% 0.71/0.96 41 isa(other,knight) | -response(A) | -isa(asked,B). [resolve(25,b,23,c)].
% 0.71/0.96 42 -response(yes) | -isa(A,knight) | isa(asked,knight). [resolve(28,a,24,b)].
% 0.71/0.97 43 isa(asked,knight) | -response(A) | isa(other,knight). [resolve(40,c,25,b)].
% 0.71/0.97 44 isa(asked,knight) | isa(other,knight) | response(yes). [resolve(43,b,21,b)].
% 0.71/0.97 45 isa(asked,knight) | response(yes) | -response(A). [resolve(44,b,40,c),merge(c)].
% 0.71/0.97 46 isa(asked,knight) | response(yes). [resolve(45,c,21,b),merge(c)].
% 0.71/0.97 48 response(yes). [resolve(46,a,38,b),merge(b)].
% 0.71/0.97 49 -isa(A,knight) | isa(asked,knight). [back_unit_del(42),unit_del(a,48)].
% 0.71/0.97 52 isa(asked,knight) | isa(other,knight). [resolve(48,a,43,b)].
% 0.71/0.97 53 isa(asked,knight). [resolve(52,b,49,a),merge(b)].
% 0.71/0.97 56 isa(other,knight) | -response(A). [resolve(53,a,41,c)].
% 0.71/0.97 58 -isa(other,A). [ur(23,a,48,a,b,53,a)].
% 0.71/0.97 59 -response(A). [back_unit_del(56),unit_del(a,58)].
% 0.71/0.97 60 $F. [resolve(59,a,48,a)].
% 0.71/0.97
% 0.71/0.97 % SZS output end Refutation
% 0.71/0.97 ============================== end of proof ==========================
% 0.71/0.97
% 0.71/0.97 ============================== STATISTICS ============================
% 0.71/0.97
% 0.71/0.97 Given=24. Generated=57. Kept=36. proofs=1.
% 0.71/0.97 Usable=4. Sos=2. Demods=0. Limbo=1, Disabled=64. Hints=0.
% 0.71/0.97 Megabytes=0.05.
% 0.71/0.97 User_CPU=0.01, System_CPU=0.00, Wall_clock=0.
% 0.71/0.97
% 0.71/0.97 ============================== end of statistics =====================
% 0.71/0.97
% 0.71/0.97 ============================== end of search =========================
% 0.71/0.97
% 0.71/0.97 THEOREM PROVED
% 0.71/0.97 % SZS status Unsatisfiable
% 0.71/0.97
% 0.71/0.97 Exiting with 1 proof.
% 0.71/0.97
% 0.71/0.97 Process 3437 exit (max_proofs) Sun May 29 02:17:23 2022
% 0.71/0.97 Prover9 interrupted
%------------------------------------------------------------------------------