TSTP Solution File: PLA002-1 by Prover9---1109a

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Prover9---1109a
% Problem  : PLA002-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 17:31:21 EDT 2022

% Result   : Unsatisfiable 0.43s 0.98s
% Output   : Refutation 0.43s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem  : PLA002-1 : TPTP v8.1.0. Released v1.0.0.
% 0.07/0.13  % 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 : Tue May 31 18:43:36 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 13690 was started by sandbox on n028.cluster.edu,
% 0.43/0.98  Tue May 31 18:43:37 2022
% 0.43/0.98  The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_13389_n028.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_13389_n028.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 (17 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 -warm(A) | -at(b,A) | at(d,climb(d,A)) # label(climb_mountain_b_to_d) # label(hypothesis).  [assumption].
% 0.43/0.98  2 warm(A) | cold(B) # label(warm_or_cold) # label(hypothesis).  [assumption].
% 0.43/0.98  Derived: -at(b,A) | at(d,climb(d,A)) | cold(B).  [resolve(1,a,2,a)].
% 0.43/0.98  3 -warm(A) | -at(d,A) | at(b,climb(b,A)) # label(climb_mountain_d_to_b) # label(hypothesis).  [assumption].
% 0.43/0.98  Derived: -at(d,A) | at(b,climb(b,A)) | cold(B).  [resolve(3,a,2,a)].
% 0.43/0.98  4 -at(b,A) | at(d,climb(d,A)) | cold(B).  [resolve(1,a,2,a)].
% 0.43/0.98  5 -cold(A) | -at(b,A) | at(c,skate(c,A)) # label(cross_river_b_to_c) # label(hypothesis).  [assumption].
% 0.43/0.98  6 -cold(A) | -at(c,A) | at(b,skate(b,A)) # label(cross_river_c_to_b) # label(hypothesis).  [assumption].
% 0.43/0.98  Derived: -at(b,A) | at(d,climb(d,A)) | -at(b,B) | at(c,skate(c,B)).  [resolve(4,c,5,a)].
% 0.43/0.98  Derived: -at(b,A) | at(d,climb(d,A)) | -at(c,B) | at(b,skate(b,B)).  [resolve(4,c,6,a)].
% 0.43/0.98  7 -at(d,A) | at(b,climb(b,A)) | cold(B).  [resolve(3,a,2,a)].
% 0.43/0.98  Derived: -at(d,A) | at(b,climb(b,A)) | -at(b,B) | at(c,skate(c,B)).  [resolve(7,c,5,a)].
% 0.43/0.98  Derived: -at(d,A) | at(b,climb(b,A)) | -at(c,B) | at(b,skate(b,B)).  [resolve(7,c,6,a)].
% 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:  b=1. c=1. d=1. a=1. f=1. e=1. s0=1. go=1. climb=1. skate=1. drive=1. walk=1.
% 0.43/0.98  
% 0.43/0.98  ============================== end of process initial clauses ========
% 0.43/0.98  
% 0.43/0.98  ============================== CLAUSES FOR SEARCH ====================
% 0.43/0.98  
% 0.43/0.98  ============================== end of clauses for search =============
% 0.43/0.98  
% 0.43/0.98  ============================== SEARCH ================================
% 0.43/0.98  
% 0.43/0.98  % Starting search at 0.01 seconds.
% 0.43/0.98  
% 0.43/0.98  ============================== PROOF =================================
% 0.43/0.98  % SZS status Unsatisfiable
% 0.43/0.98  % SZS output start Refutation
% 0.43/0.98  
% 0.43/0.98  % Proof 1 at 0.01 (+ 0.00) seconds.
% 0.43/0.98  % Length of proof is 15.
% 0.43/0.98  % Level of proof is 5.
% 0.43/0.98  % Maximum clause weight is 8.000.
% 0.43/0.98  % Given clauses 11.
% 0.43/0.98  
% 0.43/0.98  2 warm(A) | cold(B) # label(warm_or_cold) # label(hypothesis).  [assumption].
% 0.43/0.98  3 -warm(A) | -at(d,A) | at(b,climb(b,A)) # label(climb_mountain_d_to_b) # label(hypothesis).  [assumption].
% 0.43/0.98  6 -cold(A) | -at(c,A) | at(b,skate(b,A)) # label(cross_river_c_to_b) # label(hypothesis).  [assumption].
% 0.43/0.98  7 -at(d,A) | at(b,climb(b,A)) | cold(B).  [resolve(3,a,2,a)].
% 0.43/0.98  8 at(f,s0) # label(initial) # label(hypothesis).  [assumption].
% 0.43/0.98  9 -at(a,A) # label(prove_you_can_get_to_a) # label(negated_conjecture).  [assumption].
% 0.43/0.98  10 -at(b,A) | at(a,walk(a,A)) # label(walk_b_to_a) # label(hypothesis).  [assumption].
% 0.43/0.98  11 -at(b,A).  [copy(10),unit_del(b,9)].
% 0.43/0.98  14 -at(d,A) | at(c,go(c,A)) # label(go_d_to_c) # label(hypothesis).  [assumption].
% 0.43/0.98  18 -at(f,A) | at(d,go(d,A)) # label(go_f_to_d) # label(hypothesis).  [assumption].
% 0.43/0.98  21 -at(d,A) | at(b,climb(b,A)) | -at(c,B) | at(b,skate(b,B)).  [resolve(7,c,6,a)].
% 0.43/0.98  22 -at(d,A) | -at(c,B).  [copy(21),unit_del(b,11),unit_del(d,11)].
% 0.43/0.98  23 at(d,go(d,s0)).  [resolve(18,a,8,a)].
% 0.43/0.98  24 -at(c,A).  [resolve(23,a,22,a)].
% 0.43/0.98  26 $F.  [resolve(23,a,14,a),unit_del(a,24)].
% 0.43/0.98  
% 0.43/0.98  % SZS output end Refutation
% 0.43/0.98  ============================== end of proof ==========================
% 0.43/0.98  
% 0.43/0.98  ============================== STATISTICS ============================
% 0.43/0.98  
% 0.43/0.98  Given=11. Generated=20. Kept=13. proofs=1.
% 0.43/0.98  Usable=11. Sos=0. Demods=0. Limbo=2, Disabled=23. Hints=0.
% 0.43/0.98  Megabytes=0.04.
% 0.43/0.98  User_CPU=0.01, System_CPU=0.00, Wall_clock=0.
% 0.43/0.98  
% 0.43/0.98  ============================== end of statistics =====================
% 0.43/0.98  
% 0.43/0.98  ============================== end of search =========================
% 0.43/0.98  
% 0.43/0.98  THEOREM PROVED
% 0.43/0.98  % SZS status Unsatisfiable
% 0.43/0.98  
% 0.43/0.98  Exiting with 1 proof.
% 0.43/0.98  
% 0.43/0.98  Process 13690 exit (max_proofs) Tue May 31 18:43:37 2022
% 0.43/0.98  Prover9 interrupted
%------------------------------------------------------------------------------