TSTP Solution File: PUZ021-1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : PUZ021-1 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n019.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.43s 0.99s
% Output : Refutation 0.43s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12 % Problem : PUZ021-1 : TPTP v8.1.0. Released v1.0.0.
% 0.12/0.13 % Command : tptp2X_and_run_prover9 %d %s
% 0.12/0.34 % Computer : n019.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 21:47:41 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.43/0.98 ============================== Prover9 ===============================
% 0.43/0.98 Prover9 (32) version 2009-11A, November 2009.
% 0.43/0.98 Process 23754 was started by sandbox2 on n019.cluster.edu,
% 0.43/0.98 Sat May 28 21:47:41 2022
% 0.43/0.98 The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 300 -f /tmp/Prover9_23601_n019.cluster.edu".
% 0.43/0.98 ============================== end of head ===========================
% 0.43/0.98
% 0.43/0.98 ============================== INPUT =================================
% 0.43/0.98
% 0.43/0.98 % Reading from file /tmp/Prover9_23601_n019.cluster.edu
% 0.43/0.98
% 0.43/0.98 set(prolog_style_variables).
% 0.43/0.98 set(auto2).
% 0.43/0.98 % set(auto2) -> set(auto).
% 0.43/0.98 % set(auto) -> set(auto_inference).
% 0.43/0.98 % set(auto) -> set(auto_setup).
% 0.43/0.98 % set(auto_setup) -> set(predicate_elim).
% 0.43/0.98 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.43/0.98 % set(auto) -> set(auto_limits).
% 0.43/0.98 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.43/0.98 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.43/0.98 % set(auto) -> set(auto_denials).
% 0.43/0.98 % set(auto) -> set(auto_process).
% 0.43/0.98 % set(auto2) -> assign(new_constants, 1).
% 0.43/0.98 % set(auto2) -> assign(fold_denial_max, 3).
% 0.43/0.98 % set(auto2) -> assign(max_weight, "200.000").
% 0.43/0.98 % set(auto2) -> assign(max_hours, 1).
% 0.43/0.98 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.43/0.98 % set(auto2) -> assign(max_seconds, 0).
% 0.43/0.98 % set(auto2) -> assign(max_minutes, 5).
% 0.43/0.98 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.43/0.98 % set(auto2) -> set(sort_initial_sos).
% 0.43/0.98 % set(auto2) -> assign(sos_limit, -1).
% 0.43/0.98 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.43/0.98 % set(auto2) -> assign(max_megs, 400).
% 0.43/0.98 % set(auto2) -> assign(stats, some).
% 0.43/0.98 % set(auto2) -> clear(echo_input).
% 0.43/0.98 % set(auto2) -> set(quiet).
% 0.43/0.98 % set(auto2) -> clear(print_initial_clauses).
% 0.43/0.98 % set(auto2) -> clear(print_given).
% 0.43/0.98 assign(lrs_ticks,-1).
% 0.43/0.98 assign(sos_limit,10000).
% 0.43/0.98 assign(order,kbo).
% 0.43/0.98 set(lex_order_vars).
% 0.43/0.98 clear(print_given).
% 0.43/0.98
% 0.43/0.98 % formulas(sos). % not echoed (13 formulas)
% 0.43/0.98
% 0.43/0.98 ============================== end of input ==========================
% 0.43/0.98
% 0.43/0.98 % From the command line: assign(max_seconds, 300).
% 0.43/0.98
% 0.43/0.98 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.43/0.98
% 0.43/0.98 % Formulas that are not ordinary clauses:
% 0.43/0.98
% 0.43/0.98 ============================== end of process non-clausal formulas ===
% 0.43/0.98
% 0.43/0.98 ============================== PROCESS INITIAL CLAUSES ===============
% 0.43/0.98
% 0.43/0.98 ============================== PREDICATE ELIMINATION =================
% 0.43/0.98 1 -a_truth(knave(A),B) | -says(A,C) | -a_truth(C,B) # label(knaves_lie1) # label(axiom). [assumption].
% 0.43/0.98 2 says(me,A) | a_truth(and(knave(me),rich(me)),A) # label(prove_statement_exists2) # label(negated_conjecture). [assumption].
% 0.43/0.98 Derived: -a_truth(knave(me),A) | -a_truth(B,A) | a_truth(and(knave(me),rich(me)),B). [resolve(1,b,2,a)].
% 0.43/0.98 3 -says(me,A) | -a_truth(and(knave(me),rich(me)),A) # label(prove_statement_exists1) # label(negated_conjecture). [assumption].
% 0.43/0.98 4 -a_truth(knight(A),B) | -says(A,C) | a_truth(C,B) # label(knights_tell_truth1) # label(axiom). [assumption].
% 0.43/0.98 Derived: -a_truth(knight(me),A) | a_truth(B,A) | a_truth(and(knave(me),rich(me)),B). [resolve(4,b,2,a)].
% 0.43/0.98 5 -a_truth(knight(A),B) | says(A,C) | -a_truth(C,B) # label(knights_tell_truth2) # label(axiom). [assumption].
% 0.43/0.98 Derived: -a_truth(knight(A),B) | -a_truth(C,B) | -a_truth(knave(A),D) | -a_truth(C,D). [resolve(5,b,1,b)].
% 0.43/0.98 Derived: -a_truth(knight(me),A) | -a_truth(B,A) | -a_truth(and(knave(me),rich(me)),B). [resolve(5,b,3,a)].
% 0.43/0.98 Derived: -a_truth(knight(A),B) | -a_truth(C,B) | -a_truth(knight(A),D) | a_truth(C,D). [resolve(5,b,4,b)].
% 0.43/0.98 6 -a_truth(knave(A),B) | says(A,C) | a_truth(C,B) # label(knaves_lie2) # label(axiom). [assumption].
% 0.43/0.98 Derived: -a_truth(knave(A),B) | a_truth(C,B) | -a_truth(knave(A),D) | -a_truth(C,D). [resolve(6,b,1,b)].
% 0.43/0.98 Derived: -a_truth(knave(me),A) | a_truth(B,A) | -a_truth(and(knave(me),rich(me)),B). [resolve(6,b,3,a)].
% 0.43/0.98 Derived: -a_truth(knave(A),B) | a_truth(C,B) | -a_truth(knight(A),D) | a_truth(C,D). [resolve(6,b,4,b)].
% 0.43/0.98
% 0.43/0.98 ============================== end predicate elimination =============
% 0.43/0.98
% 0.43/0.98 Auto_denials: (non-Horn, no changes).
% 0.43/0.98
% 0.43/0.98 Term ordering decisions:
% 0.43/0.98 Function symbol KB weights: me=1. and=1. knave=1. knight=1. rich=1. poor=1.
% 0.43/0.99
% 0.43/0.99 ============================== end of process initial clauses ========
% 0.43/0.99
% 0.43/0.99 ============================== CLAUSES FOR SEARCH ====================
% 0.43/0.99
% 0.43/0.99 ============================== end of clauses for search =============
% 0.43/0.99
% 0.43/0.99 ============================== SEARCH ================================
% 0.43/0.99
% 0.43/0.99 % Starting search at 0.01 seconds.
% 0.43/0.99
% 0.43/0.99 ============================== PROOF =================================
% 0.43/0.99 % SZS status Unsatisfiable
% 0.43/0.99 % SZS output start Refutation
% 0.43/0.99
% 0.43/0.99 % Proof 1 at 0.02 (+ 0.00) seconds.
% 0.43/0.99 % Length of proof is 28.
% 0.43/0.99 % Level of proof is 11.
% 0.43/0.99 % Maximum clause weight is 14.000.
% 0.43/0.99 % Given clauses 39.
% 0.43/0.99
% 0.43/0.99 1 -a_truth(knave(A),B) | -says(A,C) | -a_truth(C,B) # label(knaves_lie1) # label(axiom). [assumption].
% 0.43/0.99 2 says(me,A) | a_truth(and(knave(me),rich(me)),A) # label(prove_statement_exists2) # label(negated_conjecture). [assumption].
% 0.43/0.99 3 -says(me,A) | -a_truth(and(knave(me),rich(me)),A) # label(prove_statement_exists1) # label(negated_conjecture). [assumption].
% 0.43/0.99 4 -a_truth(knight(A),B) | -says(A,C) | a_truth(C,B) # label(knights_tell_truth1) # label(axiom). [assumption].
% 0.43/0.99 5 -a_truth(knight(A),B) | says(A,C) | -a_truth(C,B) # label(knights_tell_truth2) # label(axiom). [assumption].
% 0.43/0.99 6 -a_truth(knave(A),B) | says(A,C) | a_truth(C,B) # label(knaves_lie2) # label(axiom). [assumption].
% 0.43/0.99 7 a_truth(knight(A),B) | a_truth(knave(A),B) # label(knight_or_knave) # label(axiom). [assumption].
% 0.43/0.99 11 -a_truth(and(A,B),C) | a_truth(A,C) # label(conjunction1) # label(axiom). [assumption].
% 0.43/0.99 12 -a_truth(and(A,B),C) | a_truth(B,C) # label(conjunction2) # label(axiom). [assumption].
% 0.43/0.99 14 -a_truth(knave(me),A) | -a_truth(B,A) | a_truth(and(knave(me),rich(me)),B). [resolve(1,b,2,a)].
% 0.43/0.99 15 -a_truth(knight(me),A) | a_truth(B,A) | a_truth(and(knave(me),rich(me)),B). [resolve(4,b,2,a)].
% 0.43/0.99 17 -a_truth(knight(me),A) | -a_truth(B,A) | -a_truth(and(knave(me),rich(me)),B). [resolve(5,b,3,a)].
% 0.43/0.99 19 -a_truth(knave(A),B) | a_truth(C,B) | -a_truth(knave(A),D) | -a_truth(C,D). [resolve(6,b,1,b)].
% 0.43/0.99 20 -a_truth(knave(me),A) | a_truth(B,A) | -a_truth(and(knave(me),rich(me)),B). [resolve(6,b,3,a)].
% 0.43/0.99 21 -a_truth(knave(A),B) | a_truth(C,B) | -a_truth(knight(A),D) | a_truth(C,D). [resolve(6,b,4,b)].
% 0.43/0.99 23 -a_truth(knave(me),A) | a_truth(and(knave(me),rich(me)),knave(me)). [factor(14,a,b)].
% 0.43/0.99 33 a_truth(A,B) | a_truth(and(knave(me),rich(me)),A) | a_truth(knave(me),B). [resolve(15,a,7,a)].
% 0.43/0.99 35 a_truth(knave(me),A) | a_truth(and(knave(me),rich(me)),knave(me)). [factor(33,a,c)].
% 0.43/0.99 78 a_truth(and(knave(me),rich(me)),knave(me)). [resolve(35,a,23,a),merge(b)].
% 0.43/0.99 90 a_truth(knave(me),A) | a_truth(knave(me),knave(me)). [resolve(35,b,11,a)].
% 0.43/0.99 91 a_truth(knave(me),knave(me)). [factor(90,a,b)].
% 0.43/0.99 101 -a_truth(knight(me),knave(me)). [resolve(91,a,17,b),unit_del(b,78)].
% 0.43/0.99 114 -a_truth(and(knave(me),rich(me)),knight(me)). [ur(20,a,91,a,b,101,a)].
% 0.43/0.99 116 -a_truth(and(knight(me),A),knave(me)). [ur(11,b,101,a)].
% 0.43/0.99 136 -a_truth(knave(me),knight(me)). [ur(19,b,114,a,c,91,a,d,78,a)].
% 0.43/0.99 177 -a_truth(and(A,knave(me)),knight(me)). [ur(12,b,136,a)].
% 0.43/0.99 182 -a_truth(knight(me),knight(me)). [ur(21,a,91,a,b,116,a,d,177,a)].
% 0.43/0.99 185 $F. [resolve(182,a,7,a),unit_del(a,136)].
% 0.43/0.99
% 0.43/0.99 % SZS output end Refutation
% 0.43/0.99 ============================== end of proof ==========================
% 0.43/0.99
% 0.43/0.99 ============================== STATISTICS ============================
% 0.43/0.99
% 0.43/0.99 Given=39. Generated=322. Kept=178. proofs=1.
% 0.43/0.99 Usable=33. Sos=123. Demods=0. Limbo=0, Disabled=43. Hints=0.
% 0.43/0.99 Megabytes=0.16.
% 0.43/0.99 User_CPU=0.02, System_CPU=0.00, Wall_clock=0.
% 0.43/0.99
% 0.43/0.99 ============================== end of statistics =====================
% 0.43/0.99
% 0.43/0.99 ============================== end of search =========================
% 0.43/0.99
% 0.43/0.99 THEOREM PROVED
% 0.43/0.99 % SZS status Unsatisfiable
% 0.43/0.99
% 0.43/0.99 Exiting with 1 proof.
% 0.43/0.99
% 0.43/0.99 Process 23754 exit (max_proofs) Sat May 28 21:47:41 2022
% 0.43/0.99 Prover9 interrupted
%------------------------------------------------------------------------------