TSTP Solution File: PUZ023-1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : PUZ023-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.41s 0.98s
% Output : Refutation 0.41s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : PUZ023-1 : TPTP v8.1.0. Released v1.0.0.
% 0.11/0.12 % Command : tptp2X_and_run_prover9 %d %s
% 0.12/0.33 % Computer : n022.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 21:34:23 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.41/0.98 ============================== Prover9 ===============================
% 0.41/0.98 Prover9 (32) version 2009-11A, November 2009.
% 0.41/0.98 Process 20898 was started by sandbox on n022.cluster.edu,
% 0.41/0.98 Sat May 28 21:34:23 2022
% 0.41/0.98 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_20745_n022.cluster.edu".
% 0.41/0.98 ============================== end of head ===========================
% 0.41/0.98
% 0.41/0.98 ============================== INPUT =================================
% 0.41/0.98
% 0.41/0.98 % Reading from file /tmp/Prover9_20745_n022.cluster.edu
% 0.41/0.98
% 0.41/0.98 set(prolog_style_variables).
% 0.41/0.98 set(auto2).
% 0.41/0.98 % set(auto2) -> set(auto).
% 0.41/0.98 % set(auto) -> set(auto_inference).
% 0.41/0.98 % set(auto) -> set(auto_setup).
% 0.41/0.98 % set(auto_setup) -> set(predicate_elim).
% 0.41/0.98 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.41/0.98 % set(auto) -> set(auto_limits).
% 0.41/0.98 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.41/0.98 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.41/0.98 % set(auto) -> set(auto_denials).
% 0.41/0.98 % set(auto) -> set(auto_process).
% 0.41/0.98 % set(auto2) -> assign(new_constants, 1).
% 0.41/0.98 % set(auto2) -> assign(fold_denial_max, 3).
% 0.41/0.98 % set(auto2) -> assign(max_weight, "200.000").
% 0.41/0.98 % set(auto2) -> assign(max_hours, 1).
% 0.41/0.98 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.41/0.98 % set(auto2) -> assign(max_seconds, 0).
% 0.41/0.98 % set(auto2) -> assign(max_minutes, 5).
% 0.41/0.98 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.41/0.98 % set(auto2) -> set(sort_initial_sos).
% 0.41/0.98 % set(auto2) -> assign(sos_limit, -1).
% 0.41/0.98 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.41/0.98 % set(auto2) -> assign(max_megs, 400).
% 0.41/0.98 % set(auto2) -> assign(stats, some).
% 0.41/0.98 % set(auto2) -> clear(echo_input).
% 0.41/0.98 % set(auto2) -> set(quiet).
% 0.41/0.98 % set(auto2) -> clear(print_initial_clauses).
% 0.41/0.98 % set(auto2) -> clear(print_given).
% 0.41/0.98 assign(lrs_ticks,-1).
% 0.41/0.98 assign(sos_limit,10000).
% 0.41/0.98 assign(order,kbo).
% 0.41/0.98 set(lex_order_vars).
% 0.41/0.98 clear(print_given).
% 0.41/0.98
% 0.41/0.98 % formulas(sos). % not echoed (22 formulas)
% 0.41/0.98
% 0.41/0.98 ============================== end of input ==========================
% 0.41/0.98
% 0.41/0.98 % From the command line: assign(max_seconds, 300).
% 0.41/0.98
% 0.41/0.98 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.41/0.98
% 0.41/0.98 % Formulas that are not ordinary clauses:
% 0.41/0.98
% 0.41/0.98 ============================== end of process non-clausal formulas ===
% 0.41/0.98
% 0.41/0.98 ============================== PROCESS INITIAL CLAUSES ===============
% 0.41/0.98
% 0.41/0.98 ============================== PREDICATE ELIMINATION =================
% 0.41/0.98 1 -people(A,B,C) | -a_truth(truthteller(A)) | -a_truth(truthteller(B)) | -a_truth(one_truthteller) # label(two_truthtellers1) # label(axiom). [assumption].
% 0.41/0.98 2 people(a,b,c) # label(a_b_and_c_are_people) # label(hypothesis). [assumption].
% 0.41/0.98 Derived: -a_truth(truthteller(a)) | -a_truth(truthteller(b)) | -a_truth(one_truthteller). [resolve(1,a,2,a)].
% 0.41/0.98 3 -people(A,B,C) | -a_truth(truthteller(A)) | -a_truth(truthteller(C)) | -a_truth(one_truthteller) # label(two_truthtellers2) # label(axiom). [assumption].
% 0.41/0.98 Derived: -a_truth(truthteller(a)) | -a_truth(truthteller(c)) | -a_truth(one_truthteller). [resolve(3,a,2,a)].
% 0.41/0.98 4 -people(A,B,C) | -a_truth(truthteller(B)) | -a_truth(truthteller(C)) | -a_truth(one_truthteller) # label(two_truthtellers3) # label(axiom). [assumption].
% 0.41/0.98 Derived: -a_truth(truthteller(b)) | -a_truth(truthteller(c)) | -a_truth(one_truthteller). [resolve(4,a,2,a)].
% 0.41/0.98 5 -people(A,B,C) | -a_truth(one_truthteller) | a_truth(truthteller(A)) | a_truth(truthteller(B)) | a_truth(truthteller(C)) # label(one_is_the_truthteller) # label(axiom). [assumption].
% 0.41/0.98 Derived: -a_truth(one_truthteller) | a_truth(truthteller(a)) | a_truth(truthteller(b)) | a_truth(truthteller(c)). [resolve(5,a,2,a)].
% 0.41/0.98 6 -people(A,B,C) | a_truth(one_truthteller) | -a_truth(truthteller(A)) | a_truth(truthteller(B)) | a_truth(truthteller(C)) # label(identify_one_truthteller1) # label(axiom). [assumption].
% 0.41/0.98 Derived: a_truth(one_truthteller) | -a_truth(truthteller(a)) | a_truth(truthteller(b)) | a_truth(truthteller(c)). [resolve(6,a,2,a)].
% 0.41/0.98 7 -people(A,B,C) | a_truth(one_truthteller) | -a_truth(truthteller(B)) | a_truth(truthteller(A)) | a_truth(truthteller(C)) # label(identify_one_truthteller2) # label(axiom). [assumption].
% 0.41/0.98 Derived: a_truth(one_truthteller) | -a_truth(truthteller(b)) | a_truth(truthteller(a)) | a_truth(truthteller(c)). [resolve(7,a,2,a)].
% 0.41/0.98 8 -people(A,B,C) | a_truth(one_truthteller) | -a_truth(truthteller(C)) | a_truth(truthteller(B)) | a_truth(truthteller(A)) # label(identify_one_truthteller3) # label(axiom). [assumption].
% 0.41/0.98 Derived: a_truth(one_truthteller) | -a_truth(truthteller(c)) | a_truth(truthteller(b)) | a_truth(truthteller(a)). [resolve(8,a,2,a)].
% 0.41/0.98 9 -a_truth(liar(b)) | -a_truth(liar(c)) | an_answer(b_and_c_liars) # label(b_and_c_liars) # label(hypothesis). [assumption].
% 0.41/0.98 10 -an_answer(A) # label(prove_there_is_an_answer) # label(negated_conjecture). [assumption].
% 0.41/0.98 Derived: -a_truth(liar(b)) | -a_truth(liar(c)). [resolve(9,c,10,a)].
% 0.41/0.98 11 -a_truth(liar(b)) | -a_truth(truthteller(c)) | an_answer(b_liar_and_c_truthteller) # label(b_liar_and_c_truthteller) # label(hypothesis). [assumption].
% 0.41/0.98 Derived: -a_truth(liar(b)) | -a_truth(truthteller(c)). [resolve(11,c,10,a)].
% 0.41/0.98 12 -a_truth(truthteller(b)) | -a_truth(liar(c)) | an_answer(b_truthteller_and_c_liar) # label(b_truthteller_and_c_liar) # label(hypothesis). [assumption].
% 0.41/0.98 Derived: -a_truth(truthteller(b)) | -a_truth(liar(c)). [resolve(12,c,10,a)].
% 0.41/0.98 13 -a_truth(truthteller(b)) | -a_truth(truthteller(c)) | an_answer(b_and_c_truthtellers) # label(b_and_c_truthtellers) # label(hypothesis). [assumption].
% 0.41/0.98 Derived: -a_truth(truthteller(b)) | -a_truth(truthteller(c)). [resolve(13,c,10,a)].
% 0.41/0.98
% 0.41/0.98 ============================== end predicate elimination =============
% 0.41/0.98
% 0.41/0.98 Auto_denials: (non-Horn, no changes).
% 0.41/0.98
% 0.41/0.98 Term ordering decisions:
% 0.41/0.98 Function symbol KB weights: a=1. b=1. c=1. one_truthteller=1. garbage=1. says=1. truthteller=1. liar=1.
% 0.41/0.98
% 0.41/0.98 ============================== end of process initial clauses ========
% 0.41/0.98
% 0.41/0.98 ============================== CLAUSES FOR SEARCH ====================
% 0.41/0.98
% 0.41/0.98 ============================== end of clauses for search =============
% 0.41/0.98
% 0.41/0.98 ============================== SEARCH ================================
% 0.41/0.98
% 0.41/0.98 % Starting search at 0.01 seconds.
% 0.41/0.98
% 0.41/0.98 ============================== PROOF =================================
% 0.41/0.98 % SZS status Unsatisfiable
% 0.41/0.98 % SZS output start Refutation
% 0.41/0.98
% 0.41/0.98 % Proof 1 at 0.01 (+ 0.00) seconds.
% 0.41/0.98 % Length of proof is 17.
% 0.41/0.98 % Level of proof is 5.
% 0.41/0.98 % Maximum clause weight is 9.000.
% 0.41/0.98 % Given clauses 34.
% 0.41/0.98
% 0.41/0.98 10 -an_answer(A) # label(prove_there_is_an_answer) # label(negated_conjecture). [assumption].
% 0.41/0.98 11 -a_truth(liar(b)) | -a_truth(truthteller(c)) | an_answer(b_liar_and_c_truthteller) # label(b_liar_and_c_truthteller) # label(hypothesis). [assumption].
% 0.41/0.98 12 -a_truth(truthteller(b)) | -a_truth(liar(c)) | an_answer(b_truthteller_and_c_liar) # label(b_truthteller_and_c_liar) # label(hypothesis). [assumption].
% 0.41/0.98 13 -a_truth(truthteller(b)) | -a_truth(truthteller(c)) | an_answer(b_and_c_truthtellers) # label(b_and_c_truthtellers) # label(hypothesis). [assumption].
% 0.41/0.98 15 a_truth(says(c,liar(b))) # label(c_says_b_lies) # label(hypothesis). [assumption].
% 0.41/0.98 16 a_truth(truthteller(A)) | a_truth(liar(A)) # label(truthteller_or_liar) # label(axiom). [assumption].
% 0.41/0.98 21 -a_truth(A) | -a_truth(says(B,A)) | a_truth(truthteller(B)) # label(truths_are_told_by_truthtellers) # label(axiom). [assumption].
% 0.41/0.98 31 -a_truth(liar(b)) | -a_truth(truthteller(c)). [resolve(11,c,10,a)].
% 0.41/0.98 32 -a_truth(truthteller(b)) | -a_truth(liar(c)). [resolve(12,c,10,a)].
% 0.41/0.98 33 -a_truth(truthteller(b)) | -a_truth(truthteller(c)). [resolve(13,c,10,a)].
% 0.41/0.98 42 -a_truth(liar(b)) | a_truth(truthteller(c)). [resolve(21,b,15,a)].
% 0.41/0.98 47 -a_truth(truthteller(c)) | a_truth(truthteller(b)). [resolve(31,a,16,b)].
% 0.41/0.98 48 -a_truth(truthteller(b)) | a_truth(truthteller(c)). [resolve(32,b,16,b)].
% 0.41/0.98 49 a_truth(truthteller(c)) | a_truth(truthteller(b)). [resolve(42,a,16,b)].
% 0.41/0.98 51 a_truth(truthteller(b)). [resolve(49,a,47,a),merge(b)].
% 0.41/0.98 53 a_truth(truthteller(c)). [back_unit_del(48),unit_del(a,51)].
% 0.41/0.98 55 $F. [back_unit_del(33),unit_del(a,51),unit_del(b,53)].
% 0.41/0.98
% 0.41/0.98 % SZS output end Refutation
% 0.41/0.98 ============================== end of proof ==========================
% 0.41/0.98
% 0.41/0.98 ============================== STATISTICS ============================
% 0.41/0.98
% 0.41/0.98 Given=34. Generated=53. Kept=41. proofs=1.
% 0.41/0.98 Usable=24. Sos=1. Demods=0. Limbo=4, Disabled=45. Hints=0.
% 0.41/0.98 Megabytes=0.06.
% 0.41/0.98 User_CPU=0.01, System_CPU=0.00, Wall_clock=0.
% 0.41/0.98
% 0.41/0.98 ============================== end of statistics =====================
% 0.41/0.98
% 0.41/0.98 ============================== end of search =========================
% 0.41/0.98
% 0.41/0.98 THEOREM PROVED
% 0.41/0.98 % SZS status Unsatisfiable
% 0.41/0.98
% 0.41/0.98 Exiting with 1 proof.
% 0.41/0.98
% 0.41/0.98 Process 20898 exit (max_proofs) Sat May 28 21:34:23 2022
% 0.41/0.98 Prover9 interrupted
%------------------------------------------------------------------------------