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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Prover9---1109a
% Problem  : PUZ037-1 : TPTP v8.1.0. Released v2.3.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:54 EDT 2022

% Result   : Unsatisfiable 0.47s 1.03s
% Output   : Refutation 0.47s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem  : PUZ037-1 : TPTP v8.1.0. Released v2.3.0.
% 0.07/0.13  % Command  : tptp2X_and_run_prover9 %d %s
% 0.13/0.34  % Computer : n019.cluster.edu
% 0.13/0.34  % Model    : x86_64 x86_64
% 0.13/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34  % Memory   : 8042.1875MB
% 0.13/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34  % CPULimit : 300
% 0.13/0.34  % WCLimit  : 600
% 0.13/0.34  % DateTime : Sat May 28 19:59:56 EDT 2022
% 0.13/0.34  % CPUTime  : 
% 0.47/1.03  ============================== Prover9 ===============================
% 0.47/1.03  Prover9 (32) version 2009-11A, November 2009.
% 0.47/1.03  Process 6091 was started by sandbox2 on n019.cluster.edu,
% 0.47/1.03  Sat May 28 19:59:56 2022
% 0.47/1.03  The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 300 -f /tmp/Prover9_5710_n019.cluster.edu".
% 0.47/1.03  ============================== end of head ===========================
% 0.47/1.03  
% 0.47/1.03  ============================== INPUT =================================
% 0.47/1.03  
% 0.47/1.03  % Reading from file /tmp/Prover9_5710_n019.cluster.edu
% 0.47/1.03  
% 0.47/1.03  set(prolog_style_variables).
% 0.47/1.03  set(auto2).
% 0.47/1.03      % set(auto2) -> set(auto).
% 0.47/1.03      % set(auto) -> set(auto_inference).
% 0.47/1.03      % set(auto) -> set(auto_setup).
% 0.47/1.03      % set(auto_setup) -> set(predicate_elim).
% 0.47/1.03      % set(auto_setup) -> assign(eq_defs, unfold).
% 0.47/1.03      % set(auto) -> set(auto_limits).
% 0.47/1.03      % set(auto_limits) -> assign(max_weight, "100.000").
% 0.47/1.03      % set(auto_limits) -> assign(sos_limit, 20000).
% 0.47/1.03      % set(auto) -> set(auto_denials).
% 0.47/1.03      % set(auto) -> set(auto_process).
% 0.47/1.03      % set(auto2) -> assign(new_constants, 1).
% 0.47/1.03      % set(auto2) -> assign(fold_denial_max, 3).
% 0.47/1.03      % set(auto2) -> assign(max_weight, "200.000").
% 0.47/1.03      % set(auto2) -> assign(max_hours, 1).
% 0.47/1.03      % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.47/1.03      % set(auto2) -> assign(max_seconds, 0).
% 0.47/1.03      % set(auto2) -> assign(max_minutes, 5).
% 0.47/1.03      % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.47/1.03      % set(auto2) -> set(sort_initial_sos).
% 0.47/1.03      % set(auto2) -> assign(sos_limit, -1).
% 0.47/1.03      % set(auto2) -> assign(lrs_ticks, 3000).
% 0.47/1.03      % set(auto2) -> assign(max_megs, 400).
% 0.47/1.03      % set(auto2) -> assign(stats, some).
% 0.47/1.03      % set(auto2) -> clear(echo_input).
% 0.47/1.03      % set(auto2) -> set(quiet).
% 0.47/1.03      % set(auto2) -> clear(print_initial_clauses).
% 0.47/1.03      % set(auto2) -> clear(print_given).
% 0.47/1.03  assign(lrs_ticks,-1).
% 0.47/1.03  assign(sos_limit,10000).
% 0.47/1.03  assign(order,kbo).
% 0.47/1.03  set(lex_order_vars).
% 0.47/1.03  clear(print_given).
% 0.47/1.03  
% 0.47/1.03  % formulas(sos).  % not echoed (20 formulas)
% 0.47/1.03  
% 0.47/1.03  ============================== end of input ==========================
% 0.47/1.03  
% 0.47/1.03  % From the command line: assign(max_seconds, 300).
% 0.47/1.03  
% 0.47/1.03  ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.47/1.03  
% 0.47/1.03  % Formulas that are not ordinary clauses:
% 0.47/1.03  
% 0.47/1.03  ============================== end of process non-clausal formulas ===
% 0.47/1.03  
% 0.47/1.03  ============================== PROCESS INITIAL CLAUSES ===============
% 0.47/1.03  
% 0.47/1.03  ============================== PREDICATE ELIMINATION =================
% 0.47/1.03  
% 0.47/1.03  ============================== end predicate elimination =============
% 0.47/1.03  
% 0.47/1.03  Auto_denials:
% 0.47/1.03    % copying label make_like_this to answer in negative clause
% 0.47/1.03  
% 0.47/1.03  Term ordering decisions:
% 0.47/1.03  Function symbol KB weights:  b=1. g=1. o=1. r=1. w=1. y=1.
% 0.47/1.03  
% 0.47/1.03  ============================== end of process initial clauses ========
% 0.47/1.03  
% 0.47/1.03  ============================== CLAUSES FOR SEARCH ====================
% 0.47/1.03  
% 0.47/1.03  ============================== end of clauses for search =============
% 0.47/1.03  
% 0.47/1.03  ============================== SEARCH ================================
% 0.47/1.03  
% 0.47/1.03  % Starting search at 0.03 seconds.
% 0.47/1.03  
% 0.47/1.03  ============================== PROOF =================================
% 0.47/1.03  % SZS status Unsatisfiable
% 0.47/1.03  % SZS output start Refutation
% 0.47/1.03  
% 0.47/1.03  % Proof 1 at 0.03 (+ 0.00) seconds: make_like_this.
% 0.47/1.03  % Length of proof is 5.
% 0.47/1.03  % Level of proof is 2.
% 0.47/1.03  % Maximum clause weight is 110.000.
% 0.47/1.03  % Given clauses 13.
% 0.47/1.03  
% 0.47/1.03  1 state(b,b,b,b,b,b,b,b,b,r,r,r,g,g,g,o,o,o,y,y,y,g,g,g,o,o,o,y,y,y,r,r,r,r,r,r,g,g,g,o,o,o,y,y,y,w,w,w,w,w,w,w,w,w) # label(start_with_this) # label(hypothesis).  [assumption].
% 0.47/1.03  2 -state(b,b,b,b,b,b,b,b,b,r,r,r,g,g,g,o,o,o,y,y,y,r,r,r,g,g,g,o,o,o,y,y,y,r,r,r,g,g,g,o,o,o,y,y,y,w,w,w,w,w,w,w,w,w) # label(make_like_this) # label(negated_conjecture) # answer(make_like_this).  [assumption].
% 0.47/1.03  13 -state(A,B,C,D,E,F,V6,V7,V8,V9,V10,V11,V12,V13,V14,V15,V16,V17,V18,V19,V20,V21,V22,V23,V24,V25,V26,V27,V28,V29,V30,V31,V32,V33,V34,V35,V36,V37,V38,V39,V40,V41,V42,V43,V44,V45,V46,V47,V48,V49,V50,V51,V52,V53) | state(A,B,C,D,E,F,V6,V7,V8,V9,V10,V11,V12,V13,V14,V15,V16,V17,V18,V19,V20,V30,V31,V32,V21,V22,V23,V24,V25,V26,V27,V28,V29,V33,V34,V35,V36,V37,V38,V39,V40,V41,V42,V43,V44,V45,V46,V47,V48,V49,V50,V51,V52,V53) # label(myx) # label(axiom).  [assumption].
% 0.47/1.03  41 -state(b,b,b,b,b,b,b,b,b,r,r,r,g,g,g,o,o,o,y,y,y,g,g,g,o,o,o,y,y,y,r,r,r,r,r,r,g,g,g,o,o,o,y,y,y,w,w,w,w,w,w,w,w,w) # answer(make_like_this).  [resolve(13,b,2,a)].
% 0.47/1.03  42 $F # answer(make_like_this).  [resolve(41,a,1,a)].
% 0.47/1.03  
% 0.47/1.03  % SZS output end Refutation
% 0.47/1.03  ============================== end of proof ==========================
% 0.47/1.03  
% 0.47/1.03  ============================== STATISTICS ============================
% 0.47/1.03  
% 0.47/1.03  Given=13. Generated=51. Kept=41. proofs=1.
% 0.47/1.03  Usable=13. Sos=27. Demods=0. Limbo=0, Disabled=20. Hints=0.
% 0.47/1.03  Megabytes=0.20.
% 0.47/1.03  User_CPU=0.03, System_CPU=0.00, Wall_clock=0.
% 0.47/1.03  
% 0.47/1.03  ============================== end of statistics =====================
% 0.47/1.03  
% 0.47/1.03  ============================== end of search =========================
% 0.47/1.03  
% 0.47/1.03  THEOREM PROVED
% 0.47/1.03  % SZS status Unsatisfiable
% 0.47/1.03  
% 0.47/1.03  Exiting with 1 proof.
% 0.47/1.03  
% 0.47/1.03  Process 6091 exit (max_proofs) Sat May 28 19:59:56 2022
% 0.47/1.03  Prover9 interrupted
%------------------------------------------------------------------------------