TSTP Solution File: PUZ026-1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : PUZ026-1 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n025.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.72s 0.99s
% Output : Refutation 0.72s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.11 % Problem : PUZ026-1 : TPTP v8.1.0. Released v1.0.0.
% 0.06/0.12 % Command : tptp2X_and_run_prover9 %d %s
% 0.12/0.33 % Computer : n025.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 600
% 0.12/0.33 % DateTime : Sat May 28 19:58:41 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.42/0.98 ============================== Prover9 ===============================
% 0.42/0.98 Prover9 (32) version 2009-11A, November 2009.
% 0.42/0.98 Process 7669 was started by sandbox2 on n025.cluster.edu,
% 0.42/0.98 Sat May 28 19:58:41 2022
% 0.42/0.98 The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 300 -f /tmp/Prover9_7516_n025.cluster.edu".
% 0.42/0.98 ============================== end of head ===========================
% 0.42/0.98
% 0.42/0.98 ============================== INPUT =================================
% 0.42/0.98
% 0.42/0.98 % Reading from file /tmp/Prover9_7516_n025.cluster.edu
% 0.42/0.98
% 0.42/0.98 set(prolog_style_variables).
% 0.42/0.98 set(auto2).
% 0.42/0.98 % set(auto2) -> set(auto).
% 0.42/0.98 % set(auto) -> set(auto_inference).
% 0.42/0.98 % set(auto) -> set(auto_setup).
% 0.42/0.98 % set(auto_setup) -> set(predicate_elim).
% 0.42/0.98 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.42/0.98 % set(auto) -> set(auto_limits).
% 0.42/0.98 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.42/0.98 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.42/0.98 % set(auto) -> set(auto_denials).
% 0.42/0.98 % set(auto) -> set(auto_process).
% 0.42/0.98 % set(auto2) -> assign(new_constants, 1).
% 0.42/0.98 % set(auto2) -> assign(fold_denial_max, 3).
% 0.42/0.98 % set(auto2) -> assign(max_weight, "200.000").
% 0.42/0.98 % set(auto2) -> assign(max_hours, 1).
% 0.42/0.98 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.42/0.98 % set(auto2) -> assign(max_seconds, 0).
% 0.42/0.98 % set(auto2) -> assign(max_minutes, 5).
% 0.42/0.98 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.42/0.98 % set(auto2) -> set(sort_initial_sos).
% 0.42/0.98 % set(auto2) -> assign(sos_limit, -1).
% 0.42/0.98 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.42/0.98 % set(auto2) -> assign(max_megs, 400).
% 0.42/0.98 % set(auto2) -> assign(stats, some).
% 0.42/0.98 % set(auto2) -> clear(echo_input).
% 0.42/0.98 % set(auto2) -> set(quiet).
% 0.42/0.98 % set(auto2) -> clear(print_initial_clauses).
% 0.42/0.98 % set(auto2) -> clear(print_given).
% 0.42/0.98 assign(lrs_ticks,-1).
% 0.42/0.98 assign(sos_limit,10000).
% 0.42/0.98 assign(order,kbo).
% 0.42/0.98 set(lex_order_vars).
% 0.42/0.98 clear(print_given).
% 0.42/0.98
% 0.42/0.98 % formulas(sos). % not echoed (23 formulas)
% 0.42/0.98
% 0.42/0.98 ============================== end of input ==========================
% 0.42/0.98
% 0.42/0.98 % From the command line: assign(max_seconds, 300).
% 0.42/0.98
% 0.42/0.98 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.42/0.98
% 0.42/0.98 % Formulas that are not ordinary clauses:
% 0.42/0.98
% 0.42/0.98 ============================== end of process non-clausal formulas ===
% 0.42/0.98
% 0.42/0.98 ============================== PROCESS INITIAL CLAUSES ===============
% 0.42/0.98
% 0.42/0.98 ============================== PREDICATE ELIMINATION =================
% 0.42/0.98 1 -people(A,B,C) | -a_truth(truthteller(A)) | -a_truth(truthteller(B)) # label(not_two_truthtellers1) # label(axiom). [assumption].
% 0.42/0.98 2 people(a,b,c) # label(a_b_c_are_people) # label(hypothesis). [assumption].
% 0.42/0.98 3 people(b,c,a) # label(b_c_a_are_people) # label(hypothesis). [assumption].
% 0.42/0.98 4 people(c,b,a) # label(c_b_a_are_people) # label(hypothesis). [assumption].
% 0.42/0.98 Derived: -a_truth(truthteller(a)) | -a_truth(truthteller(b)). [resolve(1,a,2,a)].
% 0.42/0.98 Derived: -a_truth(truthteller(b)) | -a_truth(truthteller(c)). [resolve(1,a,3,a)].
% 0.42/0.98 5 -people(A,B,C) | -a_truth(truthteller(A)) | -a_truth(truthteller(C)) # label(not_two_truthtellers2) # label(axiom). [assumption].
% 0.42/0.98 Derived: -a_truth(truthteller(a)) | -a_truth(truthteller(c)). [resolve(5,a,2,a)].
% 0.42/0.98 6 -people(A,B,C) | -a_truth(liar(A)) | -a_truth(liar(B)) # label(not_two_liars1) # label(axiom). [assumption].
% 0.42/0.98 Derived: -a_truth(liar(a)) | -a_truth(liar(b)). [resolve(6,a,2,a)].
% 0.42/0.98 Derived: -a_truth(liar(b)) | -a_truth(liar(c)). [resolve(6,a,3,a)].
% 0.42/0.98 7 -people(A,B,C) | -a_truth(liar(A)) | -a_truth(liar(C)) # label(not_two_liars2) # label(axiom). [assumption].
% 0.42/0.98 Derived: -a_truth(liar(a)) | -a_truth(liar(c)). [resolve(7,a,2,a)].
% 0.42/0.98 8 -people(A,B,C) | -a_truth(normal(A)) | -a_truth(normal(B)) # label(not_two_normal1) # label(axiom). [assumption].
% 0.42/0.98 Derived: -a_truth(normal(a)) | -a_truth(normal(b)). [resolve(8,a,2,a)].
% 0.42/0.98 Derived: -a_truth(normal(b)) | -a_truth(normal(c)). [resolve(8,a,3,a)].
% 0.42/0.98 9 -people(A,B,C) | -a_truth(normal(A)) | -a_truth(normal(C)) # label(not_two_normal2) # label(axiom). [assumption].
% 0.42/0.98 Derived: -a_truth(normal(a)) | -a_truth(normal(c)). [resolve(9,a,2,a)].
% 0.42/0.98
% 0.42/0.98 ============================== end predicate elimination =============
% 0.42/0.98
% 0.42/0.98 Auto_denials: (non-Horn, no changes).
% 0.42/0.98
% 0.42/0.98 Term ordering decisions:
% 0.72/0.99 Function symbol KB weights: a=1. c=1. b=1. says=1. normal=1. truthteller=1. liar=1. not_normal=1.
% 0.72/0.99
% 0.72/0.99 ============================== end of process initial clauses ========
% 0.72/0.99
% 0.72/0.99 ============================== CLAUSES FOR SEARCH ====================
% 0.72/0.99
% 0.72/0.99 ============================== end of clauses for search =============
% 0.72/0.99
% 0.72/0.99 ============================== SEARCH ================================
% 0.72/0.99
% 0.72/0.99 % Starting search at 0.01 seconds.
% 0.72/0.99
% 0.72/0.99 ============================== PROOF =================================
% 0.72/0.99 % SZS status Unsatisfiable
% 0.72/0.99 % SZS output start Refutation
% 0.72/0.99
% 0.72/0.99 % Proof 1 at 0.01 (+ 0.00) seconds.
% 0.72/0.99 % Length of proof is 39.
% 0.72/0.99 % Level of proof is 9.
% 0.72/0.99 % Maximum clause weight is 12.000.
% 0.72/0.99 % Given clauses 49.
% 0.72/0.99
% 0.72/0.99 1 -people(A,B,C) | -a_truth(truthteller(A)) | -a_truth(truthteller(B)) # label(not_two_truthtellers1) # label(axiom). [assumption].
% 0.72/0.99 2 people(a,b,c) # label(a_b_c_are_people) # label(hypothesis). [assumption].
% 0.72/0.99 3 people(b,c,a) # label(b_c_a_are_people) # label(hypothesis). [assumption].
% 0.72/0.99 6 -people(A,B,C) | -a_truth(liar(A)) | -a_truth(liar(B)) # label(not_two_liars1) # label(axiom). [assumption].
% 0.72/0.99 8 -people(A,B,C) | -a_truth(normal(A)) | -a_truth(normal(B)) # label(not_two_normal1) # label(axiom). [assumption].
% 0.72/0.99 9 -people(A,B,C) | -a_truth(normal(A)) | -a_truth(normal(C)) # label(not_two_normal2) # label(axiom). [assumption].
% 0.72/0.99 10 a_truth(says(a,normal(a))) # label(a_says_a_normal) # label(hypothesis). [assumption].
% 0.72/0.99 11 a_truth(says(b,normal(a))) # label(b_says_a_normal) # label(hypothesis). [assumption].
% 0.72/0.99 12 a_truth(says(c,not_normal(c))) # label(c_says_c_not_normal) # label(hypothesis). [assumption].
% 0.72/0.99 13 a_truth(not_normal(A)) | a_truth(normal(A)) # label(normal_or_not_normal) # label(axiom). [assumption].
% 0.72/0.99 14 a_truth(truthteller(A)) | a_truth(liar(A)) | a_truth(normal(A)) # label(person_is_one_type) # label(axiom). [assumption].
% 0.72/0.99 19 -a_truth(liar(A)) | -a_truth(says(A,B)) | -a_truth(B) # label(liars_lie) # label(axiom). [assumption].
% 0.72/0.99 20 -a_truth(liar(A)) | -a_truth(normal(B)) | -a_truth(truthteller(C)) # label(prove_one_of_each) # label(negated_conjecture). [assumption].
% 0.72/0.99 22 -a_truth(A) | -a_truth(says(B,A)) | a_truth(truthteller(B)) | a_truth(normal(B)) # label(truthtellers_and_normal_tell_truth) # label(axiom). [assumption].
% 0.72/0.99 23 a_truth(A) | -a_truth(says(B,A)) | a_truth(liar(B)) | a_truth(normal(B)) # label(liars_and_normal_lie) # label(axiom). [assumption].
% 0.72/0.99 25 -a_truth(truthteller(b)) | -a_truth(truthteller(c)). [resolve(1,a,3,a)].
% 0.72/0.99 27 -a_truth(liar(a)) | -a_truth(liar(b)). [resolve(6,a,2,a)].
% 0.72/0.99 30 -a_truth(normal(a)) | -a_truth(normal(b)). [resolve(8,a,2,a)].
% 0.72/0.99 31 -a_truth(normal(b)) | -a_truth(normal(c)). [resolve(8,a,3,a)].
% 0.72/0.99 32 -a_truth(normal(a)) | -a_truth(normal(c)). [resolve(9,a,2,a)].
% 0.72/0.99 36 -a_truth(liar(c)) | -a_truth(not_normal(c)). [resolve(19,b,12,a)].
% 0.72/0.99 43 -a_truth(normal(a)) | a_truth(truthteller(b)) | a_truth(normal(b)). [resolve(22,b,11,a)].
% 0.72/0.99 44 a_truth(normal(a)) | a_truth(liar(b)) | a_truth(normal(b)). [resolve(23,b,11,a)].
% 0.72/0.99 45 a_truth(normal(a)) | a_truth(liar(a)). [resolve(23,b,10,a),merge(c)].
% 0.72/0.99 49 -a_truth(liar(c)) | a_truth(normal(c)). [resolve(36,b,13,a)].
% 0.72/0.99 50 a_truth(normal(a)) | -a_truth(normal(A)) | -a_truth(truthteller(B)). [resolve(45,b,20,a)].
% 0.72/0.99 51 a_truth(normal(c)) | a_truth(truthteller(c)). [resolve(49,a,14,b),merge(c)].
% 0.72/0.99 56 a_truth(normal(a)) | a_truth(normal(b)) | -a_truth(liar(a)). [resolve(44,b,27,b)].
% 0.72/0.99 59 a_truth(normal(a)) | a_truth(normal(b)). [resolve(56,c,45,b),merge(c)].
% 0.72/0.99 62 a_truth(normal(a)) | -a_truth(truthteller(A)). [resolve(59,b,50,b),merge(b)].
% 0.72/0.99 63 a_truth(normal(a)) | -a_truth(normal(c)). [resolve(59,b,31,a)].
% 0.72/0.99 65 a_truth(normal(a)) | a_truth(normal(c)). [resolve(62,b,51,b)].
% 0.72/0.99 66 a_truth(normal(a)). [resolve(65,b,63,b),merge(b)].
% 0.72/0.99 67 a_truth(truthteller(b)) | a_truth(normal(b)). [back_unit_del(43),unit_del(a,66)].
% 0.72/0.99 69 -a_truth(normal(c)). [back_unit_del(32),unit_del(a,66)].
% 0.72/0.99 70 -a_truth(normal(b)). [back_unit_del(30),unit_del(a,66)].
% 0.72/0.99 74 a_truth(truthteller(c)). [back_unit_del(51),unit_del(a,69)].
% 0.72/0.99 76 a_truth(truthteller(b)). [back_unit_del(67),unit_del(b,70)].
% 0.72/0.99 78 $F. [back_unit_del(25),unit_del(a,76),unit_del(b,74)].
% 0.72/0.99
% 0.72/0.99 % SZS output end Refutation
% 0.72/0.99 ============================== end of proof ==========================
% 0.72/0.99
% 0.72/0.99 ============================== STATISTICS ============================
% 0.72/0.99
% 0.72/0.99 Given=49. Generated=102. Kept=68. proofs=1.
% 0.72/0.99 Usable=17. Sos=7. Demods=0. Limbo=4, Disabled=72. Hints=0.
% 0.72/0.99 Megabytes=0.07.
% 0.72/0.99 User_CPU=0.01, System_CPU=0.00, Wall_clock=0.
% 0.72/0.99
% 0.72/0.99 ============================== end of statistics =====================
% 0.72/0.99
% 0.72/0.99 ============================== end of search =========================
% 0.72/0.99
% 0.72/0.99 THEOREM PROVED
% 0.72/0.99 % SZS status Unsatisfiable
% 0.72/0.99
% 0.72/0.99 Exiting with 1 proof.
% 0.72/0.99
% 0.72/0.99 Process 7669 exit (max_proofs) Sat May 28 19:58:41 2022
% 0.72/0.99 Prover9 interrupted
%------------------------------------------------------------------------------