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