TSTP Solution File: PUZ001-2 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : PUZ001-2 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n024.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.76s 1.04s
% Output : Refutation 0.76s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : PUZ001-2 : TPTP v8.1.0. Released v1.0.0.
% 0.03/0.13 % Command : tptp2X_and_run_prover9 %d %s
% 0.12/0.34 % Computer : n024.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 : Sun May 29 02:59:21 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.76/1.03 ============================== Prover9 ===============================
% 0.76/1.03 Prover9 (32) version 2009-11A, November 2009.
% 0.76/1.03 Process 20107 was started by sandbox2 on n024.cluster.edu,
% 0.76/1.03 Sun May 29 02:59:22 2022
% 0.76/1.03 The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 300 -f /tmp/Prover9_19724_n024.cluster.edu".
% 0.76/1.03 ============================== end of head ===========================
% 0.76/1.03
% 0.76/1.03 ============================== INPUT =================================
% 0.76/1.03
% 0.76/1.03 % Reading from file /tmp/Prover9_19724_n024.cluster.edu
% 0.76/1.03
% 0.76/1.03 set(prolog_style_variables).
% 0.76/1.03 set(auto2).
% 0.76/1.03 % set(auto2) -> set(auto).
% 0.76/1.03 % set(auto) -> set(auto_inference).
% 0.76/1.03 % set(auto) -> set(auto_setup).
% 0.76/1.03 % set(auto_setup) -> set(predicate_elim).
% 0.76/1.03 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.76/1.03 % set(auto) -> set(auto_limits).
% 0.76/1.03 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.76/1.03 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.76/1.03 % set(auto) -> set(auto_denials).
% 0.76/1.03 % set(auto) -> set(auto_process).
% 0.76/1.03 % set(auto2) -> assign(new_constants, 1).
% 0.76/1.03 % set(auto2) -> assign(fold_denial_max, 3).
% 0.76/1.03 % set(auto2) -> assign(max_weight, "200.000").
% 0.76/1.03 % set(auto2) -> assign(max_hours, 1).
% 0.76/1.03 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.76/1.03 % set(auto2) -> assign(max_seconds, 0).
% 0.76/1.03 % set(auto2) -> assign(max_minutes, 5).
% 0.76/1.03 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.76/1.03 % set(auto2) -> set(sort_initial_sos).
% 0.76/1.03 % set(auto2) -> assign(sos_limit, -1).
% 0.76/1.03 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.76/1.03 % set(auto2) -> assign(max_megs, 400).
% 0.76/1.03 % set(auto2) -> assign(stats, some).
% 0.76/1.03 % set(auto2) -> clear(echo_input).
% 0.76/1.03 % set(auto2) -> set(quiet).
% 0.76/1.03 % set(auto2) -> clear(print_initial_clauses).
% 0.76/1.03 % set(auto2) -> clear(print_given).
% 0.76/1.03 assign(lrs_ticks,-1).
% 0.76/1.03 assign(sos_limit,10000).
% 0.76/1.03 assign(order,kbo).
% 0.76/1.03 set(lex_order_vars).
% 0.76/1.03 clear(print_given).
% 0.76/1.03
% 0.76/1.03 % formulas(sos). % not echoed (15 formulas)
% 0.76/1.03
% 0.76/1.03 ============================== end of input ==========================
% 0.76/1.03
% 0.76/1.03 % From the command line: assign(max_seconds, 300).
% 0.76/1.03
% 0.76/1.03 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.76/1.03
% 0.76/1.03 % Formulas that are not ordinary clauses:
% 0.76/1.03
% 0.76/1.03 ============================== end of process non-clausal formulas ===
% 0.76/1.03
% 0.76/1.03 ============================== PROCESS INITIAL CLAUSES ===============
% 0.76/1.03
% 0.76/1.03 ============================== PREDICATE ELIMINATION =================
% 0.76/1.03 1 -lives_at_dreadsbury(A) | A = aunt_agatha | A = butler | A = charles # label(noone_else_lives_at_mansion) # label(axiom). [assumption].
% 0.76/1.03 2 lives_at_dreadsbury(someone) # label(someone_in_mansion) # label(axiom). [assumption].
% 0.76/1.03 3 lives_at_dreadsbury(aunt_agatha) # label(agatha_lives_at_mansion) # label(axiom). [assumption].
% 0.76/1.03 4 lives_at_dreadsbury(butler) # label(butler_lives_at_mansion) # label(axiom). [assumption].
% 0.76/1.03 5 lives_at_dreadsbury(charles) # label(charles_lives_at_mansion) # label(axiom). [assumption].
% 0.76/1.03 Derived: someone = aunt_agatha | someone = butler | someone = charles. [resolve(1,a,2,a)].
% 0.76/1.03 Derived: aunt_agatha = aunt_agatha | aunt_agatha = butler | aunt_agatha = charles. [resolve(1,a,3,a)].
% 0.76/1.03 Derived: butler = aunt_agatha | butler = butler | butler = charles. [resolve(1,a,4,a)].
% 0.76/1.03 Derived: charles = aunt_agatha | charles = butler | charles = charles. [resolve(1,a,5,a)].
% 0.76/1.03 6 -killed(A,B) | -richer(A,B) # label(killer_poorer_than_victim) # label(axiom). [assumption].
% 0.76/1.03 7 richer(A,aunt_agatha) | hates(butler,A) # label(butler_hates_poor_people) # label(axiom). [assumption].
% 0.76/1.03 Derived: -killed(A,aunt_agatha) | hates(butler,A). [resolve(6,b,7,a)].
% 0.76/1.03
% 0.76/1.03 ============================== end predicate elimination =============
% 0.76/1.03
% 0.76/1.03 Auto_denials: (non-Horn, no changes).
% 0.76/1.03
% 0.76/1.03 Term ordering decisions:
% 0.76/1.03
% 0.76/1.03 % Assigning unary symbol every_one_but kb_weight 0 and highest precedence (8).
% 0.76/1.03 Function symbol KB weights: aunt_agatha=1. butler=1. charles=1. someone=1. every_one_but=0.
% 0.76/1.03
% 0.76/1.03 ============================== end of process initial clauses ========
% 0.76/1.03
% 0.76/1.03 ============================== CLAUSES FOR SEARCH ====================
% 0.76/1.03
% 0.76/1.03 ============================== end of clauses for search =============
% 0.76/1.03
% 0.76/1.03 ============================== SEARCH ================================
% 0.76/1.04
% 0.76/1.04 % Starting search at 0.01 seconds.
% 0.76/1.04
% 0.76/1.04 ============================== PROOF =================================
% 0.76/1.04 % SZS status Unsatisfiable
% 0.76/1.04 % SZS output start Refutation
% 0.76/1.04
% 0.76/1.04 % Proof 1 at 0.01 (+ 0.00) seconds.
% 0.76/1.04 % Length of proof is 26.
% 0.76/1.04 % Level of proof is 6.
% 0.76/1.04 % Maximum clause weight is 9.000.
% 0.76/1.04 % Given clauses 27.
% 0.76/1.04
% 0.76/1.04 1 -lives_at_dreadsbury(A) | A = aunt_agatha | A = butler | A = charles # label(noone_else_lives_at_mansion) # label(axiom). [assumption].
% 0.76/1.04 2 lives_at_dreadsbury(someone) # label(someone_in_mansion) # label(axiom). [assumption].
% 0.76/1.04 6 -killed(A,B) | -richer(A,B) # label(killer_poorer_than_victim) # label(axiom). [assumption].
% 0.76/1.04 7 richer(A,aunt_agatha) | hates(butler,A) # label(butler_hates_poor_people) # label(axiom). [assumption].
% 0.76/1.04 8 killed(someone,aunt_agatha) # label(someone_killed_agatha) # label(axiom). [assumption].
% 0.76/1.04 9 A = butler | hates(aunt_agatha,A) # label(agatha_likes_only_butler) # label(axiom). [assumption].
% 0.76/1.04 10 butler = A | hates(aunt_agatha,A). [copy(9),flip(a)].
% 0.76/1.04 11 aunt_agatha != butler # label(agatha_is_not_the_butler) # label(axiom). [assumption].
% 0.76/1.04 12 butler != aunt_agatha. [copy(11),flip(a)].
% 0.76/1.04 13 -killed(aunt_agatha,aunt_agatha) # label(prove_agatha_killed_herself) # label(negated_conjecture). [assumption].
% 0.76/1.04 14 -hates(A,every_one_but(A)) # label(noone_hates_everyone) # label(axiom). [assumption].
% 0.76/1.04 15 -hates(aunt_agatha,A) | -hates(charles,A) # label(charles_and_agatha_hate_different_people) # label(axiom). [assumption].
% 0.76/1.04 16 -killed(A,B) | hates(A,B) # label(killer_hates_victim) # label(axiom). [assumption].
% 0.76/1.04 17 -hates(aunt_agatha,A) | hates(butler,A) # label(butler_and_agatha_hate_the_same_people) # label(axiom). [assumption].
% 0.76/1.04 18 someone = aunt_agatha | someone = butler | someone = charles. [resolve(1,a,2,a)].
% 0.76/1.04 21 -killed(A,aunt_agatha) | hates(butler,A). [resolve(6,b,7,a)].
% 0.76/1.04 23 hates(someone,aunt_agatha). [resolve(16,a,8,a)].
% 0.76/1.04 26 -hates(aunt_agatha,every_one_but(butler)). [ur(17,b,14,a)].
% 0.76/1.04 29 -killed(every_one_but(butler),aunt_agatha). [ur(21,b,14,a)].
% 0.76/1.04 32 every_one_but(butler) = butler. [resolve(26,a,10,b),flip(a)].
% 0.76/1.04 33 -killed(butler,aunt_agatha). [back_rewrite(29),rewrite([32(2)])].
% 0.76/1.04 34 someone = aunt_agatha | someone = butler | hates(charles,aunt_agatha). [para(18(c,1),23(a,1))].
% 0.76/1.04 38 someone = aunt_agatha | someone = butler | -hates(aunt_agatha,aunt_agatha). [resolve(34,c,15,b)].
% 0.76/1.04 39 someone = aunt_agatha | someone = butler. [resolve(38,c,10,b),unit_del(c,12)].
% 0.76/1.04 40 someone = aunt_agatha. [para(39(b,1),8(a,1)),unit_del(b,33)].
% 0.76/1.04 43 $F. [back_rewrite(8),rewrite([40(1)]),unit_del(a,13)].
% 0.76/1.04
% 0.76/1.04 % SZS output end Refutation
% 0.76/1.04 ============================== end of proof ==========================
% 0.76/1.04
% 0.76/1.04 ============================== STATISTICS ============================
% 0.76/1.04
% 0.76/1.04 Given=27. Generated=52. Kept=31. proofs=1.
% 0.76/1.04 Usable=17. Sos=0. Demods=3. Limbo=3, Disabled=31. Hints=0.
% 0.76/1.04 Megabytes=0.04.
% 0.76/1.04 User_CPU=0.01, System_CPU=0.00, Wall_clock=0.
% 0.76/1.04
% 0.76/1.04 ============================== end of statistics =====================
% 0.76/1.04
% 0.76/1.04 ============================== end of search =========================
% 0.76/1.04
% 0.76/1.04 THEOREM PROVED
% 0.76/1.04 % SZS status Unsatisfiable
% 0.76/1.04
% 0.76/1.04 Exiting with 1 proof.
% 0.76/1.04
% 0.76/1.04 Process 20107 exit (max_proofs) Sun May 29 02:59:22 2022
% 0.76/1.04 Prover9 interrupted
%------------------------------------------------------------------------------