TSTP Solution File: SYO691-1.001 by Prover9---1109a

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Prover9---1109a
% Problem  : SYO691-1.001 : TPTP v8.1.0. Released v7.3.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : tptp2X_and_run_prover9 %d %s

% Computer : n027.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 : Thu Jul 21 19:18:03 EDT 2022

% Result   : Unsatisfiable 0.74s 1.04s
% Output   : Refutation 0.74s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem  : SYO691-1.001 : TPTP v8.1.0. Released v7.3.0.
% 0.07/0.13  % Command  : tptp2X_and_run_prover9 %d %s
% 0.13/0.34  % Computer : n027.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 Jul  9 13:33:31 EDT 2022
% 0.13/0.35  % CPUTime  : 
% 0.74/1.04  ============================== Prover9 ===============================
% 0.74/1.04  Prover9 (32) version 2009-11A, November 2009.
% 0.74/1.04  Process 22798 was started by sandbox on n027.cluster.edu,
% 0.74/1.04  Sat Jul  9 13:33:32 2022
% 0.74/1.04  The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_22642_n027.cluster.edu".
% 0.74/1.04  ============================== end of head ===========================
% 0.74/1.04  
% 0.74/1.04  ============================== INPUT =================================
% 0.74/1.04  
% 0.74/1.04  % Reading from file /tmp/Prover9_22642_n027.cluster.edu
% 0.74/1.04  
% 0.74/1.04  set(prolog_style_variables).
% 0.74/1.04  set(auto2).
% 0.74/1.04      % set(auto2) -> set(auto).
% 0.74/1.04      % set(auto) -> set(auto_inference).
% 0.74/1.04      % set(auto) -> set(auto_setup).
% 0.74/1.04      % set(auto_setup) -> set(predicate_elim).
% 0.74/1.04      % set(auto_setup) -> assign(eq_defs, unfold).
% 0.74/1.04      % set(auto) -> set(auto_limits).
% 0.74/1.04      % set(auto_limits) -> assign(max_weight, "100.000").
% 0.74/1.04      % set(auto_limits) -> assign(sos_limit, 20000).
% 0.74/1.04      % set(auto) -> set(auto_denials).
% 0.74/1.04      % set(auto) -> set(auto_process).
% 0.74/1.04      % set(auto2) -> assign(new_constants, 1).
% 0.74/1.04      % set(auto2) -> assign(fold_denial_max, 3).
% 0.74/1.04      % set(auto2) -> assign(max_weight, "200.000").
% 0.74/1.04      % set(auto2) -> assign(max_hours, 1).
% 0.74/1.04      % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.74/1.04      % set(auto2) -> assign(max_seconds, 0).
% 0.74/1.04      % set(auto2) -> assign(max_minutes, 5).
% 0.74/1.04      % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.74/1.04      % set(auto2) -> set(sort_initial_sos).
% 0.74/1.04      % set(auto2) -> assign(sos_limit, -1).
% 0.74/1.04      % set(auto2) -> assign(lrs_ticks, 3000).
% 0.74/1.04      % set(auto2) -> assign(max_megs, 400).
% 0.74/1.04      % set(auto2) -> assign(stats, some).
% 0.74/1.04      % set(auto2) -> clear(echo_input).
% 0.74/1.04      % set(auto2) -> set(quiet).
% 0.74/1.04      % set(auto2) -> clear(print_initial_clauses).
% 0.74/1.04      % set(auto2) -> clear(print_given).
% 0.74/1.04  assign(lrs_ticks,-1).
% 0.74/1.04  assign(sos_limit,10000).
% 0.74/1.04  assign(order,kbo).
% 0.74/1.04  set(lex_order_vars).
% 0.74/1.04  clear(print_given).
% 0.74/1.04  
% 0.74/1.04  % formulas(sos).  % not echoed (7 formulas)
% 0.74/1.04  
% 0.74/1.04  ============================== end of input ==========================
% 0.74/1.04  
% 0.74/1.04  % From the command line: assign(max_seconds, 300).
% 0.74/1.04  
% 0.74/1.04  ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.74/1.04  
% 0.74/1.04  % Formulas that are not ordinary clauses:
% 0.74/1.04  
% 0.74/1.04  ============================== end of process non-clausal formulas ===
% 0.74/1.04  
% 0.74/1.04  ============================== PROCESS INITIAL CLAUSES ===============
% 0.74/1.04  
% 0.74/1.04  ============================== PREDICATE ELIMINATION =================
% 0.74/1.04  1 -top(A,B) | step(A,B) # label(rewrite_top) # label(axiom).  [assumption].
% 0.74/1.04  2 top(f(f(f(A,a),B),f(C,a)),f(f(C,f(f(B,a),a)),A)) # label(rule_1) # label(axiom).  [assumption].
% 0.74/1.04  Derived: step(f(f(f(A,a),B),f(C,a)),f(f(C,f(f(B,a),a)),A)).  [resolve(1,a,2,a)].
% 0.74/1.04  
% 0.74/1.04  ============================== end predicate elimination =============
% 0.74/1.04  
% 0.74/1.04  Auto_denials:
% 0.74/1.04    % copying label prove to answer in negative clause
% 0.74/1.04  
% 0.74/1.04  Term ordering decisions:
% 0.74/1.04  
% 0.74/1.04  % Assigning unary symbol succ kb_weight 0 and highest precedence (6).
% 0.74/1.04  Function symbol KB weights:  a=1. zero=1. f=1. succ=0.
% 0.74/1.04  
% 0.74/1.04  ============================== end of process initial clauses ========
% 0.74/1.04  
% 0.74/1.04  ============================== CLAUSES FOR SEARCH ====================
% 0.74/1.04  
% 0.74/1.04  ============================== end of clauses for search =============
% 0.74/1.04  
% 0.74/1.04  ============================== SEARCH ================================
% 0.74/1.04  
% 0.74/1.04  % Starting search at 0.01 seconds.
% 0.74/1.04  
% 0.74/1.04  ============================== PROOF =================================
% 0.74/1.04  % SZS status Unsatisfiable
% 0.74/1.04  % SZS output start Refutation
% 0.74/1.04  
% 0.74/1.04  % Proof 1 at 0.06 (+ 0.00) seconds: prove.
% 0.74/1.04  % Length of proof is 18.
% 0.74/1.04  % Level of proof is 6.
% 0.74/1.04  % Maximum clause weight is 51.000.
% 0.74/1.04  % Given clauses 26.
% 0.74/1.04  
% 0.74/1.04  1 -top(A,B) | step(A,B) # label(rewrite_top) # label(axiom).  [assumption].
% 0.74/1.04  2 top(f(f(f(A,a),B),f(C,a)),f(f(C,f(f(B,a),a)),A)) # label(rule_1) # label(axiom).  [assumption].
% 0.74/1.04  3 seq(zero,A,A) # label(rewrite_sequence_zero) # label(axiom).  [assumption].
% 0.74/1.04  4 -seq(succ(succ(succ(succ(succ(zero))))),A,A) # label(prove) # label(negated_conjecture) # answer(prove).  [assumption].
% 0.74/1.04  5 -step(A,B) | step(f(A,C),f(B,C)) # label(rewrite_left) # label(axiom).  [assumption].
% 0.74/1.04  6 -step(A,B) | step(f(C,A),f(C,B)) # label(rewrite_right) # label(axiom).  [assumption].
% 0.74/1.04  7 -seq(A,B,C) | -step(C,D) | seq(succ(A),B,D) # label(rewrite_sequence_succ) # label(axiom).  [assumption].
% 0.74/1.04  8 step(f(f(f(A,a),B),f(C,a)),f(f(C,f(f(B,a),a)),A)).  [resolve(1,a,2,a)].
% 0.74/1.04  9 -seq(succ(succ(succ(succ(zero)))),A,B) | -step(B,A) # answer(prove).  [resolve(7,c,4,a)].
% 0.74/1.04  11 step(f(A,f(f(f(B,a),C),f(D,a))),f(A,f(f(D,f(f(C,a),a)),B))).  [ur(6,a,8,a)].
% 0.74/1.04  12 step(f(f(f(f(A,a),B),f(C,a)),D),f(f(f(C,f(f(B,a),a)),A),D)).  [ur(5,a,8,a)].
% 0.74/1.04  14 -step(A,B) | -seq(succ(succ(succ(zero))),B,C) | -step(C,A) # answer(prove).  [resolve(9,a,7,c)].
% 0.74/1.04  20 -step(A,B) | -step(C,A) | -seq(succ(succ(zero)),B,D) | -step(D,C) # answer(prove).  [resolve(14,b,7,c)].
% 0.74/1.04  37 -step(A,B) | -step(C,A) | -step(D,C) | -seq(succ(zero),B,E) | -step(E,D) # answer(prove).  [resolve(20,c,7,c)].
% 0.74/1.04  51 seq(succ(zero),f(A,f(f(f(B,a),C),f(D,a))),f(A,f(f(D,f(f(C,a),a)),B))).  [ur(7,a,3,a,b,11,a)].
% 0.74/1.04  73 step(f(f(f(f(f(A,a),B),f(C,a)),D),E),f(f(f(f(C,f(f(B,a),a)),A),D),E)).  [ur(5,a,12,a)].
% 0.74/1.04  472 -step(f(f(f(f(A,a),f(f(f(f(B,a),a),a),a)),C),f(f(D,f(f(E,a),a)),F)),f(f(f(f(f(f(F,a),E),f(D,a)),a),A),f(f(f(a,a),B),f(f(C,a),a)))) # answer(prove).  [ur(37,b,12,a,c,11,a,d,51,a,e,8,a)].
% 0.74/1.04  473 $F # answer(prove).  [resolve(472,a,73,a)].
% 0.74/1.04  
% 0.74/1.04  % SZS output end Refutation
% 0.74/1.04  ============================== end of proof ==========================
% 0.74/1.04  
% 0.74/1.04  ============================== STATISTICS ============================
% 0.74/1.04  
% 0.74/1.04  Given=26. Generated=912. Kept=470. proofs=1.
% 0.74/1.04  Usable=26. Sos=278. Demods=0. Limbo=165, Disabled=8. Hints=0.
% 0.74/1.04  Megabytes=0.99.
% 0.74/1.04  User_CPU=0.06, System_CPU=0.00, Wall_clock=0.
% 0.74/1.04  
% 0.74/1.04  ============================== end of statistics =====================
% 0.74/1.04  
% 0.74/1.04  ============================== end of search =========================
% 0.74/1.04  
% 0.74/1.04  THEOREM PROVED
% 0.74/1.04  % SZS status Unsatisfiable
% 0.74/1.04  
% 0.74/1.04  Exiting with 1 proof.
% 0.74/1.04  
% 0.74/1.04  Process 22798 exit (max_proofs) Sat Jul  9 13:33:32 2022
% 0.74/1.04  Prover9 interrupted
%------------------------------------------------------------------------------