TSTP Solution File: PUZ003-1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : PUZ003-1 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n017.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 1.00s
% Output : Refutation 0.41s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.11 % Problem : PUZ003-1 : TPTP v8.1.0. Released v1.0.0.
% 0.10/0.12 % Command : tptp2X_and_run_prover9 %d %s
% 0.11/0.33 % Computer : n017.cluster.edu
% 0.11/0.33 % Model : x86_64 x86_64
% 0.11/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.33 % Memory : 8042.1875MB
% 0.11/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.33 % CPULimit : 300
% 0.11/0.33 % WCLimit : 600
% 0.11/0.33 % DateTime : Sat May 28 23:35:23 EDT 2022
% 0.11/0.33 % CPUTime :
% 0.41/1.00 ============================== Prover9 ===============================
% 0.41/1.00 Prover9 (32) version 2009-11A, November 2009.
% 0.41/1.00 Process 2590 was started by sandbox2 on n017.cluster.edu,
% 0.41/1.00 Sat May 28 23:35:24 2022
% 0.41/1.00 The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 300 -f /tmp/Prover9_2206_n017.cluster.edu".
% 0.41/1.00 ============================== end of head ===========================
% 0.41/1.00
% 0.41/1.00 ============================== INPUT =================================
% 0.41/1.00
% 0.41/1.00 % Reading from file /tmp/Prover9_2206_n017.cluster.edu
% 0.41/1.00
% 0.41/1.00 set(prolog_style_variables).
% 0.41/1.00 set(auto2).
% 0.41/1.00 % set(auto2) -> set(auto).
% 0.41/1.00 % set(auto) -> set(auto_inference).
% 0.41/1.00 % set(auto) -> set(auto_setup).
% 0.41/1.00 % set(auto_setup) -> set(predicate_elim).
% 0.41/1.00 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.41/1.00 % set(auto) -> set(auto_limits).
% 0.41/1.00 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.41/1.00 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.41/1.00 % set(auto) -> set(auto_denials).
% 0.41/1.00 % set(auto) -> set(auto_process).
% 0.41/1.00 % set(auto2) -> assign(new_constants, 1).
% 0.41/1.00 % set(auto2) -> assign(fold_denial_max, 3).
% 0.41/1.00 % set(auto2) -> assign(max_weight, "200.000").
% 0.41/1.00 % set(auto2) -> assign(max_hours, 1).
% 0.41/1.00 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.41/1.00 % set(auto2) -> assign(max_seconds, 0).
% 0.41/1.00 % set(auto2) -> assign(max_minutes, 5).
% 0.41/1.00 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.41/1.00 % set(auto2) -> set(sort_initial_sos).
% 0.41/1.00 % set(auto2) -> assign(sos_limit, -1).
% 0.41/1.00 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.41/1.00 % set(auto2) -> assign(max_megs, 400).
% 0.41/1.00 % set(auto2) -> assign(stats, some).
% 0.41/1.00 % set(auto2) -> clear(echo_input).
% 0.41/1.00 % set(auto2) -> set(quiet).
% 0.41/1.00 % set(auto2) -> clear(print_initial_clauses).
% 0.41/1.00 % set(auto2) -> clear(print_given).
% 0.41/1.00 assign(lrs_ticks,-1).
% 0.41/1.00 assign(sos_limit,10000).
% 0.41/1.00 assign(order,kbo).
% 0.41/1.00 set(lex_order_vars).
% 0.41/1.00 clear(print_given).
% 0.41/1.00
% 0.41/1.00 % formulas(sos). % not echoed (8 formulas)
% 0.41/1.00
% 0.41/1.00 ============================== end of input ==========================
% 0.41/1.00
% 0.41/1.00 % From the command line: assign(max_seconds, 300).
% 0.41/1.00
% 0.41/1.00 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.41/1.00
% 0.41/1.00 % Formulas that are not ordinary clauses:
% 0.41/1.00
% 0.41/1.00 ============================== end of process non-clausal formulas ===
% 0.41/1.00
% 0.41/1.00 ============================== PROCESS INITIAL CLAUSES ===============
% 0.41/1.00
% 0.41/1.00 ============================== PREDICATE ELIMINATION =================
% 0.41/1.00
% 0.41/1.00 ============================== end predicate elimination =============
% 0.41/1.00
% 0.41/1.00 Auto_denials:
% 0.41/1.00 % copying label prove_petruchio_has_shaved_lorenzo to answer in negative clause
% 0.41/1.00
% 0.41/1.00 Term ordering decisions:
% 0.41/1.00 Function symbol KB weights: cesare=1. guido=1. members=1. lorenzo=1. petruchio=1.
% 0.41/1.00
% 0.41/1.00 ============================== end of process initial clauses ========
% 0.41/1.00
% 0.41/1.00 ============================== CLAUSES FOR SEARCH ====================
% 0.41/1.00
% 0.41/1.00 ============================== end of clauses for search =============
% 0.41/1.00
% 0.41/1.00 ============================== SEARCH ================================
% 0.41/1.00
% 0.41/1.00 % Starting search at 0.01 seconds.
% 0.41/1.00
% 0.41/1.00 ============================== PROOF =================================
% 0.41/1.00 % SZS status Unsatisfiable
% 0.41/1.00 % SZS output start Refutation
% 0.41/1.00
% 0.41/1.00 % Proof 1 at 0.01 (+ 0.00) seconds: prove_petruchio_has_shaved_lorenzo.
% 0.41/1.00 % Length of proof is 13.
% 0.41/1.00 % Level of proof is 4.
% 0.41/1.00 % Maximum clause weight is 10.000.
% 0.41/1.00 % Given clauses 13.
% 0.41/1.00
% 0.41/1.00 1 member(guido) # label(guido) # label(hypothesis). [assumption].
% 0.41/1.00 2 member(lorenzo) # label(lorenzo) # label(hypothesis). [assumption].
% 0.41/1.00 3 member(petruchio) # label(petruchio) # label(hypothesis). [assumption].
% 0.41/1.00 4 member(cesare) # label(cesare) # label(hypothesis). [assumption].
% 0.41/1.00 5 shaved(guido,cesare) # label(guido_has_shaved_cesare) # label(hypothesis). [assumption].
% 0.41/1.00 6 -shaved(petruchio,lorenzo) # label(prove_petruchio_has_shaved_lorenzo) # label(negated_conjecture) # answer(prove_petruchio_has_shaved_lorenzo). [assumption].
% 0.41/1.00 7 -shaved(members,A) | -member(B) | shaved(B,A) # label(all_shaved_then_one_shaved) # label(axiom). [assumption].
% 0.41/1.00 8 -member(A) | -member(B) | -shaved(A,B) | shaved(members,A) # label(one_shaved_then_all_shaved) # label(axiom). [assumption].
% 0.41/1.00 10 -shaved(members,lorenzo) # answer(prove_petruchio_has_shaved_lorenzo). [ur(7,b,3,a,c,6,a)].
% 0.41/1.00 11 shaved(members,guido). [ur(8,a,1,a,b,4,a,c,5,a)].
% 0.41/1.00 16 -shaved(lorenzo,guido) # answer(prove_petruchio_has_shaved_lorenzo). [ur(8,a,2,a,b,1,a,d,10,a)].
% 0.41/1.00 22 -shaved(members,guido) # answer(prove_petruchio_has_shaved_lorenzo). [ur(7,b,2,a,c,16,a)].
% 0.41/1.00 23 $F # answer(prove_petruchio_has_shaved_lorenzo). [resolve(22,a,11,a)].
% 0.41/1.00
% 0.41/1.00 % SZS output end Refutation
% 0.41/1.00 ============================== end of proof ==========================
% 0.41/1.00
% 0.41/1.00 ============================== STATISTICS ============================
% 0.41/1.00
% 0.41/1.00 Given=13. Generated=25. Kept=22. proofs=1.
% 0.41/1.00 Usable=13. Sos=4. Demods=0. Limbo=1, Disabled=11. Hints=0.
% 0.41/1.00 Megabytes=0.03.
% 0.41/1.00 User_CPU=0.01, System_CPU=0.00, Wall_clock=0.
% 0.41/1.00
% 0.41/1.00 ============================== end of statistics =====================
% 0.41/1.00
% 0.41/1.00 ============================== end of search =========================
% 0.41/1.00
% 0.41/1.00 THEOREM PROVED
% 0.41/1.00 % SZS status Unsatisfiable
% 0.41/1.00
% 0.41/1.00 Exiting with 1 proof.
% 0.41/1.00
% 0.41/1.00 Process 2590 exit (max_proofs) Sat May 28 23:35:24 2022
% 0.41/1.00 Prover9 interrupted
%------------------------------------------------------------------------------