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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Prover9---1109a
% Problem  : PUZ037-3 : TPTP v8.1.0. Released v2.3.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : tptp2X_and_run_prover9 %d %s

% Computer : n026.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:55 EDT 2022

% Result   : Unsatisfiable 1.29s 1.54s
% Output   : Refutation 1.29s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12  % Problem  : PUZ037-3 : TPTP v8.1.0. Released v2.3.0.
% 0.06/0.13  % Command  : tptp2X_and_run_prover9 %d %s
% 0.13/0.34  % Computer : n026.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:56:24 EDT 2022
% 0.13/0.34  % CPUTime  : 
% 1.29/1.54  ============================== Prover9 ===============================
% 1.29/1.54  Prover9 (32) version 2009-11A, November 2009.
% 1.29/1.54  Process 30201 was started by sandbox on n026.cluster.edu,
% 1.29/1.54  Sat May 28 19:56:24 2022
% 1.29/1.54  The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_29863_n026.cluster.edu".
% 1.29/1.54  ============================== end of head ===========================
% 1.29/1.54  
% 1.29/1.54  ============================== INPUT =================================
% 1.29/1.54  
% 1.29/1.54  % Reading from file /tmp/Prover9_29863_n026.cluster.edu
% 1.29/1.54  
% 1.29/1.54  set(prolog_style_variables).
% 1.29/1.54  set(auto2).
% 1.29/1.54      % set(auto2) -> set(auto).
% 1.29/1.54      % set(auto) -> set(auto_inference).
% 1.29/1.54      % set(auto) -> set(auto_setup).
% 1.29/1.54      % set(auto_setup) -> set(predicate_elim).
% 1.29/1.54      % set(auto_setup) -> assign(eq_defs, unfold).
% 1.29/1.54      % set(auto) -> set(auto_limits).
% 1.29/1.54      % set(auto_limits) -> assign(max_weight, "100.000").
% 1.29/1.54      % set(auto_limits) -> assign(sos_limit, 20000).
% 1.29/1.54      % set(auto) -> set(auto_denials).
% 1.29/1.54      % set(auto) -> set(auto_process).
% 1.29/1.54      % set(auto2) -> assign(new_constants, 1).
% 1.29/1.54      % set(auto2) -> assign(fold_denial_max, 3).
% 1.29/1.54      % set(auto2) -> assign(max_weight, "200.000").
% 1.29/1.54      % set(auto2) -> assign(max_hours, 1).
% 1.29/1.54      % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 1.29/1.54      % set(auto2) -> assign(max_seconds, 0).
% 1.29/1.54      % set(auto2) -> assign(max_minutes, 5).
% 1.29/1.54      % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 1.29/1.54      % set(auto2) -> set(sort_initial_sos).
% 1.29/1.54      % set(auto2) -> assign(sos_limit, -1).
% 1.29/1.54      % set(auto2) -> assign(lrs_ticks, 3000).
% 1.29/1.54      % set(auto2) -> assign(max_megs, 400).
% 1.29/1.54      % set(auto2) -> assign(stats, some).
% 1.29/1.54      % set(auto2) -> clear(echo_input).
% 1.29/1.54      % set(auto2) -> set(quiet).
% 1.29/1.54      % set(auto2) -> clear(print_initial_clauses).
% 1.29/1.54      % set(auto2) -> clear(print_given).
% 1.29/1.54  assign(lrs_ticks,-1).
% 1.29/1.54  assign(sos_limit,10000).
% 1.29/1.54  assign(order,kbo).
% 1.29/1.54  set(lex_order_vars).
% 1.29/1.54  clear(print_given).
% 1.29/1.54  
% 1.29/1.54  % formulas(sos).  % not echoed (20 formulas)
% 1.29/1.54  
% 1.29/1.54  ============================== end of input ==========================
% 1.29/1.54  
% 1.29/1.54  % From the command line: assign(max_seconds, 300).
% 1.29/1.54  
% 1.29/1.54  ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 1.29/1.54  
% 1.29/1.54  % Formulas that are not ordinary clauses:
% 1.29/1.54  
% 1.29/1.54  ============================== end of process non-clausal formulas ===
% 1.29/1.54  
% 1.29/1.54  ============================== PROCESS INITIAL CLAUSES ===============
% 1.29/1.54  
% 1.29/1.54  ============================== PREDICATE ELIMINATION =================
% 1.29/1.54  
% 1.29/1.54  ============================== end predicate elimination =============
% 1.29/1.54  
% 1.29/1.54  Auto_denials:
% 1.29/1.54    % copying label make_like_this to answer in negative clause
% 1.29/1.54  
% 1.29/1.54  Term ordering decisions:
% 1.29/1.54  Function symbol KB weights:  b=1. g=1. o=1. r=1. w=1. y=1.
% 1.29/1.54  
% 1.29/1.54  ============================== end of process initial clauses ========
% 1.29/1.54  
% 1.29/1.54  ============================== CLAUSES FOR SEARCH ====================
% 1.29/1.54  
% 1.29/1.54  ============================== end of clauses for search =============
% 1.29/1.54  
% 1.29/1.54  ============================== SEARCH ================================
% 1.29/1.54  
% 1.29/1.54  % Starting search at 0.02 seconds.
% 1.29/1.54  
% 1.29/1.54  ============================== PROOF =================================
% 1.29/1.54  % SZS status Unsatisfiable
% 1.29/1.54  % SZS output start Refutation
% 1.29/1.54  
% 1.29/1.54  % Proof 1 at 0.47 (+ 0.01) seconds: make_like_this.
% 1.29/1.54  % Length of proof is 12.
% 1.29/1.54  % Level of proof is 4.
% 1.29/1.54  % Maximum clause weight is 110.000.
% 1.29/1.54  % Given clauses 226.
% 1.29/1.54  
% 1.29/1.54  1 state(b,r,r,w,w,w,y,b,b,g,y,r,b,g,g,o,g,y,w,w,r,g,o,r,b,g,g,o,r,b,y,y,r,g,o,g,o,o,o,y,r,b,y,y,r,w,w,w,b,b,y,w,o,o) # label(start_with_this) # label(hypothesis).  [assumption].
% 1.29/1.54  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].
% 1.29/1.54  7 -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,V16,V28,V40,V6,V7,V8,V9,F,V11,V12,V13,V14,V15,V50,V17,V18,V19,V20,V21,E,V23,V24,V25,V26,V27,V49,V29,V30,V31,V32,V33,D,V35,V36,V37,V38,V39,V48,V41,V42,V43,V44,V45,V46,V47,V10,V22,V34,V51,V52,V53) # label(mzy) # label(axiom).  [assumption].
% 1.29/1.54  8 -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(V17,V29,V41,D,E,F,V6,V7,V8,C,V10,V11,V12,V13,V14,V15,V16,V53,V42,V30,V18,B,V22,V23,V24,V25,V26,V27,V28,V52,V43,V31,V19,A,V34,V35,V36,V37,V38,V39,V40,V51,V44,V32,V20,V45,V46,V47,V48,V49,V50,V9,V21,V33) # label(bzy) # label(axiom).  [assumption].
% 1.29/1.54  9 -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(V12,B,C,V24,E,F,V36,V7,V8,V11,V23,V35,V45,V13,V14,V15,V16,V17,V18,V19,V6,V10,V22,V34,V48,V25,V26,V27,V28,V29,V30,V31,D,V9,V21,V33,V51,V37,V38,V39,V40,V41,V42,V43,A,V44,V46,V47,V32,V49,V50,V20,V52,V53) # label(lzx) # label(axiom).  [assumption].
% 1.29/1.54  14 -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,V21,V22,V23,V24,V25,V26,V27,V28,V29,V30,V31,V32,V42,V43,V44,V33,V34,V35,V36,V37,V38,V39,V40,V41,V51,V48,V45,V52,V49,V46,V53,V50,V47) # label(byx) # label(axiom).  [assumption].
% 1.29/1.54  30 state(b,r,r,g,r,r,y,b,b,g,w,r,b,g,g,o,y,y,w,w,r,g,w,r,b,g,g,o,b,b,y,y,r,g,w,g,o,o,o,y,b,b,y,y,r,w,w,w,y,o,o,w,o,o).  [ur(7,a,1,a)].
% 1.29/1.54  33 -state(y,b,b,y,b,b,y,b,b,r,r,r,b,g,g,o,o,o,y,y,w,r,r,r,b,g,g,o,o,o,y,y,w,r,r,r,b,g,g,o,o,o,y,y,w,g,w,w,g,w,w,g,w,w) # answer(make_like_this).  [resolve(9,b,2,a)].
% 1.29/1.54  214 state(y,b,b,g,r,r,y,b,b,r,w,r,b,g,g,o,y,o,y,y,w,r,w,r,b,g,g,o,b,o,y,y,w,b,w,g,o,o,o,y,b,w,r,r,r,w,w,w,y,o,o,g,g,g).  [ur(8,a,30,a)].
% 1.29/1.54  239 -state(y,b,b,y,b,b,y,b,b,r,r,r,b,g,g,o,o,o,y,y,w,r,r,r,b,g,g,o,o,o,y,y,w,b,g,g,o,o,o,y,y,w,r,r,r,w,w,w,w,w,w,g,g,g) # answer(make_like_this).  [resolve(33,a,14,b)].
% 1.29/1.54  3012 state(y,b,b,y,b,b,y,b,b,r,r,r,b,g,g,o,o,o,y,y,w,r,r,r,b,g,g,o,o,o,y,y,w,b,g,g,o,o,o,y,y,w,r,r,r,w,w,w,w,w,w,g,g,g).  [ur(7,a,214,a)].
% 1.29/1.54  3013 $F # answer(make_like_this).  [resolve(3012,a,239,a)].
% 1.29/1.54  
% 1.29/1.54  % SZS output end Refutation
% 1.29/1.54  ============================== end of proof ==========================
% 1.29/1.54  
% 1.29/1.54  ============================== STATISTICS ============================
% 1.29/1.54  
% 1.29/1.54  Given=226. Generated=5776. Kept=3012. proofs=1.
% 1.29/1.54  Usable=226. Sos=2776. Demods=0. Limbo=9, Disabled=20. Hints=0.
% 1.29/1.54  Megabytes=8.37.
% 1.29/1.54  User_CPU=0.47, System_CPU=0.01, Wall_clock=1.
% 1.29/1.54  
% 1.29/1.54  ============================== end of statistics =====================
% 1.29/1.54  
% 1.29/1.54  ============================== end of search =========================
% 1.29/1.54  
% 1.29/1.54  THEOREM PROVED
% 1.29/1.54  % SZS status Unsatisfiable
% 1.29/1.54  
% 1.29/1.54  Exiting with 1 proof.
% 1.29/1.54  
% 1.29/1.54  Process 30201 exit (max_proofs) Sat May 28 19:56:25 2022
% 1.29/1.54  Prover9 interrupted
%------------------------------------------------------------------------------