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

View Problem - Process Solution

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

% Computer : n003.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:17:48 EDT 2022

% Result   : Unsatisfiable 25.98s 26.26s
% Output   : Refutation 25.98s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.11  % Problem  : SYO652-1 : TPTP v8.1.0. Released v7.3.0.
% 0.11/0.12  % Command  : tptp2X_and_run_prover9 %d %s
% 0.12/0.33  % Computer : n003.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 : Sat Jul  9 08:48:43 EDT 2022
% 0.12/0.33  % CPUTime  : 
% 25.98/26.26  ============================== Prover9 ===============================
% 25.98/26.26  Prover9 (32) version 2009-11A, November 2009.
% 25.98/26.26  Process 2251 was started by sandbox2 on n003.cluster.edu,
% 25.98/26.26  Sat Jul  9 08:48:44 2022
% 25.98/26.26  The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 300 -f /tmp/Prover9_2095_n003.cluster.edu".
% 25.98/26.26  ============================== end of head ===========================
% 25.98/26.26  
% 25.98/26.26  ============================== INPUT =================================
% 25.98/26.26  
% 25.98/26.26  % Reading from file /tmp/Prover9_2095_n003.cluster.edu
% 25.98/26.26  
% 25.98/26.26  set(prolog_style_variables).
% 25.98/26.26  set(auto2).
% 25.98/26.26      % set(auto2) -> set(auto).
% 25.98/26.26      % set(auto) -> set(auto_inference).
% 25.98/26.26      % set(auto) -> set(auto_setup).
% 25.98/26.26      % set(auto_setup) -> set(predicate_elim).
% 25.98/26.26      % set(auto_setup) -> assign(eq_defs, unfold).
% 25.98/26.26      % set(auto) -> set(auto_limits).
% 25.98/26.26      % set(auto_limits) -> assign(max_weight, "100.000").
% 25.98/26.26      % set(auto_limits) -> assign(sos_limit, 20000).
% 25.98/26.26      % set(auto) -> set(auto_denials).
% 25.98/26.26      % set(auto) -> set(auto_process).
% 25.98/26.26      % set(auto2) -> assign(new_constants, 1).
% 25.98/26.26      % set(auto2) -> assign(fold_denial_max, 3).
% 25.98/26.26      % set(auto2) -> assign(max_weight, "200.000").
% 25.98/26.26      % set(auto2) -> assign(max_hours, 1).
% 25.98/26.26      % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 25.98/26.26      % set(auto2) -> assign(max_seconds, 0).
% 25.98/26.26      % set(auto2) -> assign(max_minutes, 5).
% 25.98/26.26      % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 25.98/26.26      % set(auto2) -> set(sort_initial_sos).
% 25.98/26.26      % set(auto2) -> assign(sos_limit, -1).
% 25.98/26.26      % set(auto2) -> assign(lrs_ticks, 3000).
% 25.98/26.26      % set(auto2) -> assign(max_megs, 400).
% 25.98/26.26      % set(auto2) -> assign(stats, some).
% 25.98/26.26      % set(auto2) -> clear(echo_input).
% 25.98/26.26      % set(auto2) -> set(quiet).
% 25.98/26.26      % set(auto2) -> clear(print_initial_clauses).
% 25.98/26.26      % set(auto2) -> clear(print_given).
% 25.98/26.26  assign(lrs_ticks,-1).
% 25.98/26.26  assign(sos_limit,10000).
% 25.98/26.26  assign(order,kbo).
% 25.98/26.26  set(lex_order_vars).
% 25.98/26.26  clear(print_given).
% 25.98/26.26  
% 25.98/26.26  % formulas(sos).  % not echoed (23 formulas)
% 25.98/26.26  
% 25.98/26.26  ============================== end of input ==========================
% 25.98/26.26  
% 25.98/26.26  % From the command line: assign(max_seconds, 300).
% 25.98/26.26  
% 25.98/26.26  ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 25.98/26.26  
% 25.98/26.26  % Formulas that are not ordinary clauses:
% 25.98/26.26  
% 25.98/26.26  ============================== end of process non-clausal formulas ===
% 25.98/26.26  
% 25.98/26.26  ============================== PROCESS INITIAL CLAUSES ===============
% 25.98/26.26  
% 25.98/26.26  ============================== PREDICATE ELIMINATION =================
% 25.98/26.26  
% 25.98/26.26  ============================== end predicate elimination =============
% 25.98/26.26  
% 25.98/26.26  Auto_denials:  (non-Horn, no changes).
% 25.98/26.26  
% 25.98/26.26  Term ordering decisions:
% 25.98/26.26  Function symbol KB weights:  0=1. z=1. f=1. suc=1. s=1.
% 25.98/26.26  
% 25.98/26.26  ============================== end of process initial clauses ========
% 25.98/26.26  
% 25.98/26.26  ============================== CLAUSES FOR SEARCH ====================
% 25.98/26.26  
% 25.98/26.26  ============================== end of clauses for search =============
% 25.98/26.26  
% 25.98/26.26  ============================== SEARCH ================================
% 25.98/26.26  
% 25.98/26.26  % Starting search at 8.82 seconds.
% 25.98/26.26  
% 25.98/26.26  NOTE: Back_subsumption disabled, ratio of kept to back_subsumed is 213 (0.00 of 8.87 sec).
% 25.98/26.26  
% 25.98/26.26  ============================== PROOF =================================
% 25.98/26.26  % SZS status Unsatisfiable
% 25.98/26.26  % SZS output start Refutation
% 25.98/26.26  
% 25.98/26.26  % Proof 1 at 25.27 (+ 0.02) seconds.
% 25.98/26.26  % Length of proof is 24.
% 25.98/26.26  % Level of proof is 6.
% 25.98/26.26  % Maximum clause weight is 99.000.
% 25.98/26.26  % Given clauses 2983.
% 25.98/26.26  
% 25.98/26.26  1 LE(f(A),s(0)) # label(clause_199) # label(axiom).  [assumption].
% 25.98/26.26  2 -LE(f(z),0) # label(clause_99) # label(axiom).  [assumption].
% 25.98/26.26  3 -E(0,f(suc(A))) | -iLEQ(suc(B),suc(C)) | -E(0,f(suc(suc(A)))) | -E(0,f(suc(D))) | -E(0,f(suc(suc(D)))) | -E(0,f(A)) | -E(0,f(D)) | -E(0,f(C)) | -E(0,f(suc(B))) | -E(f(B),f(suc(B))) | -E(0,f(suc(suc(B)))) | -E(f(D),f(suc(D))) | -E(f(A),f(suc(A))) | -iLEQ(suc(D),suc(A)) | -E(0,f(suc(C))) | -E(0,f(B)) | -E(0,f(suc(suc(C)))) | -E(f(C),f(suc(C))) | -iLEQ(suc(A),suc(B)) # label(clause_96) # label(axiom).  [assumption].
% 25.98/26.26  4 -LE(f(A),s(0)) | E(0,f(A)) | LE(f(A),0) # label(clause_17) # label(axiom).  [assumption].
% 25.98/26.26  5 E(0,f(A)) | LE(f(A),0).  [copy(4),unit_del(a,1)].
% 25.98/26.26  6 -LE(f(suc(A)),s(0)) | E(0,f(suc(A))) | LE(f(A),0) # label(clause_191) # label(axiom).  [assumption].
% 25.98/26.26  7 E(0,f(suc(A))) | LE(f(A),0).  [copy(6),unit_del(a,1)].
% 25.98/26.26  8 -LE(f(suc(suc(A))),s(0)) | E(0,f(suc(suc(A)))) | LE(f(A),0) # label(clause_3) # label(axiom).  [assumption].
% 25.98/26.26  9 E(0,f(suc(suc(A)))) | LE(f(A),0).  [copy(8),unit_del(a,1)].
% 25.98/26.26  10 -E(0,f(A)) | -E(0,f(suc(A))) | E(f(A),f(suc(A))) | iLEQ(suc(A),suc(A)) # label(clause_44) # label(axiom).  [assumption].
% 25.98/26.26  11 -E(0,f(suc(suc(A)))) | -E(0,f(suc(A))) | -E(f(A),f(suc(A))) | -E(0,f(A)) | iLEQ(suc(A),suc(A)) # label(clause_149) # label(axiom).  [assumption].
% 25.98/26.26  12 -E(0,f(suc(A))) | -iLEQ(suc(B),suc(C)) | -E(0,f(suc(D))) | -E(0,f(A)) | -E(0,f(D)) | -E(0,f(C)) | -E(0,f(suc(B))) | -iLEQ(suc(D),suc(A)) | -E(0,f(suc(C))) | -E(0,f(B)) | -iLEQ(suc(A),suc(B)) | E(f(D),f(suc(D))) | E(f(A),f(suc(A))) | E(f(B),f(suc(B))) | E(f(C),f(suc(C))) # label(clause_16) # label(axiom).  [assumption].
% 25.98/26.26  27 -E(0,f(suc(A))) | -iLEQ(suc(B),suc(C)) | -E(0,f(suc(suc(A)))) | -E(0,f(A)) | -E(0,f(C)) | -E(0,f(suc(B))) | -E(f(B),f(suc(B))) | -E(0,f(suc(suc(B)))) | -E(f(A),f(suc(A))) | -iLEQ(suc(A),suc(A)) | -E(0,f(suc(C))) | -E(0,f(B)) | -E(0,f(suc(suc(C)))) | -E(f(C),f(suc(C))) | -iLEQ(suc(A),suc(B)).  [factor(3,a,d),merge(d),merge(f),merge(l)].
% 25.98/26.26  55 -E(0,f(suc(A))) | -iLEQ(suc(B),suc(C)) | -E(0,f(A)) | -E(0,f(C)) | -E(0,f(suc(B))) | -iLEQ(suc(A),suc(A)) | -E(0,f(suc(C))) | -E(0,f(B)) | -iLEQ(suc(A),suc(B)) | E(f(A),f(suc(A))) | E(f(B),f(suc(B))) | E(f(C),f(suc(C))).  [factor(12,a,c),merge(d),merge(l)].
% 25.98/26.26  336 -E(0,f(suc(A))) | -iLEQ(suc(A),suc(A)) | -E(0,f(suc(suc(A)))) | -E(0,f(A)) | -E(f(A),f(suc(A))).  [factor(27,b,j),merge(e),merge(f),merge(h),merge(i),merge(j),merge(k),merge(l),merge(m),merge(n)].
% 25.98/26.26  487 -E(0,f(suc(A))) | -iLEQ(suc(A),suc(A)) | -E(0,f(A)) | E(f(A),f(suc(A))).  [factor(55,b,f),merge(d),merge(e),merge(f),merge(g),merge(h),merge(j),merge(k)].
% 25.98/26.26  2996 E(0,f(z)).  [resolve(5,b,2,a)].
% 25.98/26.26  2997 E(0,f(suc(z))).  [resolve(7,b,2,a)].
% 25.98/26.26  2998 E(0,f(suc(suc(z)))).  [resolve(9,b,2,a)].
% 25.98/26.26  2999 E(f(z),f(suc(z))) | iLEQ(suc(z),suc(z)).  [resolve(2997,a,10,b),unit_del(a,2996)].
% 25.98/26.26  3000 -E(f(z),f(suc(z))) | iLEQ(suc(z),suc(z)).  [resolve(2998,a,11,a),unit_del(a,2997),unit_del(c,2996)].
% 25.98/26.26  3028 E(f(z),f(suc(z))).  [resolve(2999,b,487,b),merge(d),unit_del(b,2997),unit_del(c,2996)].
% 25.98/26.26  3029 iLEQ(suc(z),suc(z)).  [back_unit_del(3000),unit_del(a,3028)].
% 25.98/26.26  3090 $F.  [resolve(3029,a,336,b),unit_del(a,2997),unit_del(b,2998),unit_del(c,2996),unit_del(d,3028)].
% 25.98/26.26  
% 25.98/26.26  % SZS output end Refutation
% 25.98/26.26  ============================== end of proof ==========================
% 25.98/26.26  
% 25.98/26.26  ============================== STATISTICS ============================
% 25.98/26.26  
% 25.98/26.26  Given=2983. Generated=30408. Kept=3086. proofs=1.
% 25.98/26.26  Usable=2983. Sos=28. Demods=0. Limbo=60, Disabled=38. Hints=0.
% 25.98/26.26  Megabytes=8.54.
% 25.98/26.26  User_CPU=25.27, System_CPU=0.02, Wall_clock=25.
% 25.98/26.26  
% 25.98/26.26  ============================== end of statistics =====================
% 25.98/26.26  
% 25.98/26.26  ============================== end of search =========================
% 25.98/26.26  
% 25.98/26.26  THEOREM PROVED
% 25.98/26.26  % SZS status Unsatisfiable
% 25.98/26.26  
% 25.98/26.26  Exiting with 1 proof.
% 25.98/26.26  
% 25.98/26.26  Process 2251 exit (max_proofs) Sat Jul  9 08:49:09 2022
% 25.98/26.26  Prover9 interrupted
%------------------------------------------------------------------------------