TSTP Solution File: PUZ025-1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : PUZ025-1 : TPTP v8.1.0. Released v1.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:52 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.10/0.12 % Problem : PUZ025-1 : TPTP v8.1.0. Released v1.0.0.
% 0.10/0.13 % Command : tptp2X_and_run_prover9 %d %s
% 0.14/0.34 % Computer : n022.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 600
% 0.14/0.34 % DateTime : Sat May 28 23:04:53 EDT 2022
% 0.14/0.34 % CPUTime :
% 0.45/1.00 ============================== Prover9 ===============================
% 0.45/1.00 Prover9 (32) version 2009-11A, November 2009.
% 0.45/1.00 Process 20782 was started by sandbox on n022.cluster.edu,
% 0.45/1.00 Sat May 28 23:04:53 2022
% 0.45/1.00 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_20608_n022.cluster.edu".
% 0.45/1.00 ============================== end of head ===========================
% 0.45/1.00
% 0.45/1.00 ============================== INPUT =================================
% 0.45/1.00
% 0.45/1.00 % Reading from file /tmp/Prover9_20608_n022.cluster.edu
% 0.45/1.00
% 0.45/1.00 set(prolog_style_variables).
% 0.45/1.00 set(auto2).
% 0.45/1.00 % set(auto2) -> set(auto).
% 0.45/1.00 % set(auto) -> set(auto_inference).
% 0.45/1.00 % set(auto) -> set(auto_setup).
% 0.45/1.00 % set(auto_setup) -> set(predicate_elim).
% 0.45/1.00 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.45/1.00 % set(auto) -> set(auto_limits).
% 0.45/1.00 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.45/1.00 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.45/1.00 % set(auto) -> set(auto_denials).
% 0.45/1.00 % set(auto) -> set(auto_process).
% 0.45/1.00 % 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 (24 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 -people(A,B,C) | -a_truth(liar(A)) | -a_truth(liar(B)) | a_truth(equal_type(A,B)) # label(two_liars_are_equal) # label(axiom). [assumption].
% 0.45/1.00 2 people(b,c,a) # label(b_c_a_are_people) # label(hypothesis). [assumption].
% 0.45/1.00 3 people(a,b,a) # label(a_b_c_are_people) # label(hypothesis). [assumption].
% 0.45/1.00 4 people(a,c,b) # label(a_c_b_are_people) # label(hypothesis). [assumption].
% 0.45/1.00 5 people(c,b,a) # label(c_b_a_are_people) # label(hypothesis). [assumption].
% 0.45/1.00 Derived: -a_truth(liar(b)) | -a_truth(liar(c)) | a_truth(equal_type(b,c)). [resolve(1,a,2,a)].
% 0.45/1.00 Derived: -a_truth(liar(a)) | -a_truth(liar(b)) | a_truth(equal_type(a,b)). [resolve(1,a,3,a)].
% 0.45/1.00 Derived: -a_truth(liar(a)) | -a_truth(liar(c)) | a_truth(equal_type(a,c)). [resolve(1,a,4,a)].
% 0.45/1.00 Derived: -a_truth(liar(c)) | -a_truth(liar(b)) | a_truth(equal_type(c,b)). [resolve(1,a,5,a)].
% 0.45/1.00 6 -people(A,B,C) | -a_truth(truthteller(A)) | -a_truth(truthteller(B)) | a_truth(equal_type(A,B)) # label(two_truthtellers_are_equal) # label(axiom). [assumption].
% 0.45/1.00 Derived: -a_truth(truthteller(b)) | -a_truth(truthteller(c)) | a_truth(equal_type(b,c)). [resolve(6,a,2,a)].
% 0.45/1.00 Derived: -a_truth(truthteller(a)) | -a_truth(truthteller(b)) | a_truth(equal_type(a,b)). [resolve(6,a,3,a)].
% 0.45/1.00 Derived: -a_truth(truthteller(a)) | -a_truth(truthteller(c)) | a_truth(equal_type(a,c)). [resolve(6,a,4,a)].
% 0.45/1.00 Derived: -a_truth(truthteller(c)) | -a_truth(truthteller(b)) | a_truth(equal_type(c,b)). [resolve(6,a,5,a)].
% 0.45/1.00 7 -ask_1_if_2(A,B) | -a_truth(truthteller(A)) | -a_truth(B) | answer(yes) # label(truthteller_identifies_truths) # label(axiom). [assumption].
% 0.45/1.00 8 ask_1_if_2(c,equal_type(a,b)) # label(ask_c_if_a_and_b_equal) # label(hypothesis). [assumption].
% 0.45/1.00 Derived: -a_truth(truthteller(c)) | -a_truth(equal_type(a,b)) | answer(yes). [resolve(7,a,8,a)].
% 0.45/1.00 9 -ask_1_if_2(A,B) | -a_truth(truthteller(A)) | a_truth(B) | answer(no) # label(truthteller_denies_lies) # label(axiom). [assumption].
% 0.45/1.00 Derived: -a_truth(truthteller(c)) | a_truth(equal_type(a,b)) | answer(no). [resolve(9,a,8,a)].
% 0.45/1.00 10 -ask_1_if_2(A,B) | -a_truth(liar(A)) | -a_truth(B) | answer(no) # label(liar_denies_truths) # label(axiom). [assumption].
% 0.45/1.00 Derived: -a_truth(liar(c)) | -a_truth(equal_type(a,b)) | answer(no). [resolve(10,a,8,a)].
% 0.45/1.00 11 -ask_1_if_2(A,B) | -a_truth(liar(A)) | a_truth(B) | answer(yes) # label(liar_supports_lies) # label(axiom). [assumption].
% 0.45/1.00 Derived: -a_truth(liar(c)) | a_truth(equal_type(a,b)) | answer(yes). [resolve(11,a,8,a)].
% 0.45/1.00 12 -a_truth(truthteller(c)) | -a_truth(equal_type(a,b)) | answer(yes). [resolve(7,a,8,a)].
% 0.45/1.00 13 -answer(A) # label(prove_there_is_an_answer) # label(negated_conjecture). [assumption].
% 0.45/1.00 Derived: -a_truth(truthteller(c)) | -a_truth(equal_type(a,b)). [resolve(12,c,13,a)].
% 0.45/1.00 14 -a_truth(truthteller(c)) | a_truth(equal_type(a,b)) | answer(no). [resolve(9,a,8,a)].
% 0.45/1.00 Derived: -a_truth(truthteller(c)) | a_truth(equal_type(a,b)). [resolve(14,c,13,a)].
% 0.45/1.00 15 -a_truth(liar(c)) | -a_truth(equal_type(a,b)) | answer(no). [resolve(10,a,8,a)].
% 0.45/1.00 Derived: -a_truth(liar(c)) | -a_truth(equal_type(a,b)). [resolve(15,c,13,a)].
% 0.45/1.00 16 -a_truth(liar(c)) | a_truth(equal_type(a,b)) | answer(yes). [resolve(11,a,8,a)].
% 0.45/1.00 Derived: -a_truth(liar(c)) | a_truth(equal_type(a,b)). [resolve(16,c,13,a)].
% 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: b=1. c=1. a=1. equal_type=1. says=1. truthteller=1. liar=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 20.
% 0.45/1.00 % Level of proof is 7.
% 0.45/1.00 % Maximum clause weight is 7.000.
% 0.45/1.00 % Given clauses 34.
% 0.45/1.00
% 0.45/1.00 7 -ask_1_if_2(A,B) | -a_truth(truthteller(A)) | -a_truth(B) | answer(yes) # label(truthteller_identifies_truths) # label(axiom). [assumption].
% 0.45/1.00 8 ask_1_if_2(c,equal_type(a,b)) # label(ask_c_if_a_and_b_equal) # label(hypothesis). [assumption].
% 0.45/1.00 9 -ask_1_if_2(A,B) | -a_truth(truthteller(A)) | a_truth(B) | answer(no) # label(truthteller_denies_lies) # label(axiom). [assumption].
% 0.45/1.00 10 -ask_1_if_2(A,B) | -a_truth(liar(A)) | -a_truth(B) | answer(no) # label(liar_denies_truths) # label(axiom). [assumption].
% 0.45/1.00 11 -ask_1_if_2(A,B) | -a_truth(liar(A)) | a_truth(B) | answer(yes) # label(liar_supports_lies) # label(axiom). [assumption].
% 0.45/1.00 12 -a_truth(truthteller(c)) | -a_truth(equal_type(a,b)) | answer(yes). [resolve(7,a,8,a)].
% 0.45/1.00 13 -answer(A) # label(prove_there_is_an_answer) # label(negated_conjecture). [assumption].
% 0.45/1.00 14 -a_truth(truthteller(c)) | a_truth(equal_type(a,b)) | answer(no). [resolve(9,a,8,a)].
% 0.45/1.00 15 -a_truth(liar(c)) | -a_truth(equal_type(a,b)) | answer(no). [resolve(10,a,8,a)].
% 0.45/1.00 16 -a_truth(liar(c)) | a_truth(equal_type(a,b)) | answer(yes). [resolve(11,a,8,a)].
% 0.45/1.00 17 a_truth(truthteller(A)) | a_truth(liar(A)) # label(truthteller_or_liar) # label(axiom). [assumption].
% 0.45/1.00 37 -a_truth(truthteller(c)) | -a_truth(equal_type(a,b)). [resolve(12,c,13,a)].
% 0.45/1.00 38 -a_truth(truthteller(c)) | a_truth(equal_type(a,b)). [resolve(14,c,13,a)].
% 0.45/1.00 39 -a_truth(liar(c)) | -a_truth(equal_type(a,b)). [resolve(15,c,13,a)].
% 0.45/1.00 40 -a_truth(liar(c)) | a_truth(equal_type(a,b)). [resolve(16,c,13,a)].
% 0.45/1.00 52 a_truth(equal_type(a,b)) | a_truth(truthteller(c)). [resolve(40,a,17,b)].
% 0.45/1.00 60 a_truth(truthteller(c)) | -a_truth(liar(c)). [resolve(52,a,39,b)].
% 0.45/1.00 64 a_truth(truthteller(c)). [resolve(60,b,17,b),merge(b)].
% 0.45/1.00 66 a_truth(equal_type(a,b)). [back_unit_del(38),unit_del(a,64)].
% 0.45/1.00 67 $F. [back_unit_del(37),unit_del(a,64),unit_del(b,66)].
% 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=34. Generated=62. Kept=50. proofs=1.
% 0.45/1.00 Usable=30. Sos=5. Demods=0. Limbo=3, Disabled=52. Hints=0.
% 0.45/1.00 Megabytes=0.07.
% 0.45/1.00 User_CPU=0.01, System_CPU=0.00, Wall_clock=1.
% 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 20782 exit (max_proofs) Sat May 28 23:04:54 2022
% 0.45/1.01 Prover9 interrupted
%------------------------------------------------------------------------------