TSTP Solution File: PUZ001-1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : PUZ001-1 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n028.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:48 EDT 2022
% Result : Unsatisfiable 0.41s 0.96s
% Output : Refutation 0.41s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.11 % Problem : PUZ001-1 : TPTP v8.1.0. Released v1.0.0.
% 0.10/0.12 % Command : tptp2X_and_run_prover9 %d %s
% 0.12/0.33 % Computer : n028.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 22:31:02 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.41/0.96 ============================== Prover9 ===============================
% 0.41/0.96 Prover9 (32) version 2009-11A, November 2009.
% 0.41/0.96 Process 23345 was started by sandbox on n028.cluster.edu,
% 0.41/0.96 Sat May 28 22:31:03 2022
% 0.41/0.96 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_23192_n028.cluster.edu".
% 0.41/0.96 ============================== end of head ===========================
% 0.41/0.96
% 0.41/0.96 ============================== INPUT =================================
% 0.41/0.96
% 0.41/0.96 % Reading from file /tmp/Prover9_23192_n028.cluster.edu
% 0.41/0.96
% 0.41/0.96 set(prolog_style_variables).
% 0.41/0.96 set(auto2).
% 0.41/0.96 % set(auto2) -> set(auto).
% 0.41/0.96 % set(auto) -> set(auto_inference).
% 0.41/0.96 % set(auto) -> set(auto_setup).
% 0.41/0.96 % set(auto_setup) -> set(predicate_elim).
% 0.41/0.96 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.41/0.96 % set(auto) -> set(auto_limits).
% 0.41/0.96 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.41/0.96 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.41/0.96 % set(auto) -> set(auto_denials).
% 0.41/0.96 % set(auto) -> set(auto_process).
% 0.41/0.96 % set(auto2) -> assign(new_constants, 1).
% 0.41/0.96 % set(auto2) -> assign(fold_denial_max, 3).
% 0.41/0.96 % set(auto2) -> assign(max_weight, "200.000").
% 0.41/0.96 % set(auto2) -> assign(max_hours, 1).
% 0.41/0.96 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.41/0.96 % set(auto2) -> assign(max_seconds, 0).
% 0.41/0.96 % set(auto2) -> assign(max_minutes, 5).
% 0.41/0.96 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.41/0.96 % set(auto2) -> set(sort_initial_sos).
% 0.41/0.96 % set(auto2) -> assign(sos_limit, -1).
% 0.41/0.96 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.41/0.96 % set(auto2) -> assign(max_megs, 400).
% 0.41/0.96 % set(auto2) -> assign(stats, some).
% 0.41/0.96 % set(auto2) -> clear(echo_input).
% 0.41/0.96 % set(auto2) -> set(quiet).
% 0.41/0.96 % set(auto2) -> clear(print_initial_clauses).
% 0.41/0.96 % set(auto2) -> clear(print_given).
% 0.41/0.96 assign(lrs_ticks,-1).
% 0.41/0.96 assign(sos_limit,10000).
% 0.41/0.96 assign(order,kbo).
% 0.41/0.96 set(lex_order_vars).
% 0.41/0.96 clear(print_given).
% 0.41/0.96
% 0.41/0.96 % formulas(sos). % not echoed (12 formulas)
% 0.41/0.96
% 0.41/0.96 ============================== end of input ==========================
% 0.41/0.96
% 0.41/0.96 % From the command line: assign(max_seconds, 300).
% 0.41/0.96
% 0.41/0.96 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.41/0.96
% 0.41/0.96 % Formulas that are not ordinary clauses:
% 0.41/0.96
% 0.41/0.96 ============================== end of process non-clausal formulas ===
% 0.41/0.96
% 0.41/0.96 ============================== PROCESS INITIAL CLAUSES ===============
% 0.41/0.96
% 0.41/0.96 ============================== PREDICATE ELIMINATION =================
% 0.41/0.96 1 -lives(A) | richer(A,agatha) | hates(butler,A) # label(butler_hates_poor) # label(hypothesis). [assumption].
% 0.41/0.96 2 lives(agatha) # label(agatha) # label(hypothesis). [assumption].
% 0.41/0.96 3 lives(butler) # label(butler) # label(hypothesis). [assumption].
% 0.41/0.96 4 lives(charles) # label(charles) # label(hypothesis). [assumption].
% 0.41/0.96 Derived: richer(agatha,agatha) | hates(butler,agatha). [resolve(1,a,2,a)].
% 0.41/0.96 Derived: richer(butler,agatha) | hates(butler,butler). [resolve(1,a,3,a)].
% 0.41/0.96 Derived: richer(charles,agatha) | hates(butler,charles). [resolve(1,a,4,a)].
% 0.41/0.96 5 richer(agatha,agatha) | hates(butler,agatha). [resolve(1,a,2,a)].
% 0.41/0.96 6 -killed(A,B) | -richer(A,B) # label(poorer_killer) # label(hypothesis). [assumption].
% 0.41/0.96 Derived: hates(butler,agatha) | -killed(agatha,agatha). [resolve(5,a,6,b)].
% 0.41/0.96 7 richer(butler,agatha) | hates(butler,butler). [resolve(1,a,3,a)].
% 0.41/0.96 Derived: hates(butler,butler) | -killed(butler,agatha). [resolve(7,a,6,b)].
% 0.41/0.96 8 richer(charles,agatha) | hates(butler,charles). [resolve(1,a,4,a)].
% 0.41/0.96 Derived: hates(butler,charles) | -killed(charles,agatha). [resolve(8,a,6,b)].
% 0.41/0.96
% 0.41/0.96 ============================== end predicate elimination =============
% 0.41/0.96
% 0.41/0.96 Auto_denials: (non-Horn, no changes).
% 0.41/0.96
% 0.41/0.96 Term ordering decisions:
% 0.41/0.96 Function symbol KB weights: agatha=1. butler=1. charles=1.
% 0.41/0.96
% 0.41/0.96 ============================== end of process initial clauses ========
% 0.41/0.96
% 0.41/0.96 ============================== CLAUSES FOR SEARCH ====================
% 0.41/0.96
% 0.41/0.96 ============================== end of clauses for search =============
% 0.41/0.96
% 0.41/0.96 ============================== SEARCH ================================
% 0.41/0.96
% 0.41/0.96 % Starting search at 0.01 seconds.
% 0.41/0.96
% 0.41/0.96 ============================== PROOF =================================
% 0.41/0.96 % SZS status Unsatisfiable
% 0.41/0.96 % SZS output start Refutation
% 0.41/0.96
% 0.41/0.96 % Proof 1 at 0.01 (+ 0.00) seconds.
% 0.41/0.96 % Length of proof is 18.
% 0.41/0.96 % Level of proof is 4.
% 0.41/0.96 % Maximum clause weight is 9.000.
% 0.41/0.96 % Given clauses 15.
% 0.41/0.96
% 0.41/0.96 1 -lives(A) | richer(A,agatha) | hates(butler,A) # label(butler_hates_poor) # label(hypothesis). [assumption].
% 0.41/0.96 3 lives(butler) # label(butler) # label(hypothesis). [assumption].
% 0.41/0.96 6 -killed(A,B) | -richer(A,B) # label(poorer_killer) # label(hypothesis). [assumption].
% 0.41/0.96 7 richer(butler,agatha) | hates(butler,butler). [resolve(1,a,3,a)].
% 0.41/0.96 9 hates(agatha,agatha) # label(agatha_hates_agatha) # label(hypothesis). [assumption].
% 0.41/0.96 10 hates(agatha,charles) # label(agatha_hates_charles) # label(hypothesis). [assumption].
% 0.41/0.96 11 killed(butler,agatha) | killed(charles,agatha) # label(prove_neither_charles_nor_butler_did_it) # label(negated_conjecture). [assumption].
% 0.41/0.96 12 -hates(agatha,A) | -hates(charles,A) # label(different_hates) # label(hypothesis). [assumption].
% 0.41/0.96 13 -hates(A,agatha) | -hates(A,butler) | -hates(A,charles) # label(no_one_hates_everyone) # label(hypothesis). [assumption].
% 0.41/0.96 14 -killed(A,B) | hates(A,B) # label(killer_hates_victim) # label(hypothesis). [assumption].
% 0.41/0.96 15 -hates(agatha,A) | hates(butler,A) # label(same_hates) # label(hypothesis). [assumption].
% 0.41/0.96 17 hates(butler,butler) | -killed(butler,agatha). [resolve(7,a,6,b)].
% 0.41/0.96 20 -hates(charles,agatha). [ur(12,a,9,a)].
% 0.41/0.96 22 killed(butler,agatha). [resolve(14,a,11,b),unit_del(a,20)].
% 0.41/0.96 23 hates(butler,butler). [back_unit_del(17),unit_del(b,22)].
% 0.41/0.96 24 hates(butler,charles). [resolve(15,a,10,a)].
% 0.41/0.96 25 hates(butler,agatha). [resolve(15,a,9,a)].
% 0.41/0.96 29 $F. [resolve(24,a,13,c),unit_del(a,25),unit_del(b,23)].
% 0.41/0.96
% 0.41/0.96 % SZS output end Refutation
% 0.41/0.96 ============================== end of proof ==========================
% 0.41/0.96
% 0.41/0.96 ============================== STATISTICS ============================
% 0.41/0.96
% 0.41/0.96 Given=15. Generated=23. Kept=20. proofs=1.
% 0.41/0.96 Usable=14. Sos=2. Demods=0. Limbo=0, Disabled=22. Hints=0.
% 0.41/0.96 Megabytes=0.03.
% 0.41/0.96 User_CPU=0.01, System_CPU=0.00, Wall_clock=0.
% 0.41/0.96
% 0.41/0.96 ============================== end of statistics =====================
% 0.41/0.96
% 0.41/0.96 ============================== end of search =========================
% 0.41/0.96
% 0.41/0.96 THEOREM PROVED
% 0.41/0.96 % SZS status Unsatisfiable
% 0.41/0.96
% 0.41/0.96 Exiting with 1 proof.
% 0.41/0.96
% 0.41/0.96 Process 23345 exit (max_proofs) Sat May 28 22:31:03 2022
% 0.41/0.96 Prover9 interrupted
%------------------------------------------------------------------------------