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

View Problem - Process Solution

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

% Computer : n024.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 : Sun Jul 17 13:46:22 EDT 2022

% Result   : Unsatisfiable 0.71s 0.97s
% Output   : Refutation 0.71s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.12  % Problem  : LCL398-1 : TPTP v8.1.0. Released v2.3.0.
% 0.04/0.13  % Command  : tptp2X_and_run_prover9 %d %s
% 0.12/0.34  % Computer : n024.cluster.edu
% 0.12/0.34  % Model    : x86_64 x86_64
% 0.12/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34  % Memory   : 8042.1875MB
% 0.12/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34  % CPULimit : 300
% 0.12/0.34  % WCLimit  : 600
% 0.12/0.34  % DateTime : Sat Jul  2 23:12:30 EDT 2022
% 0.12/0.34  % CPUTime  : 
% 0.71/0.97  ============================== Prover9 ===============================
% 0.71/0.97  Prover9 (32) version 2009-11A, November 2009.
% 0.71/0.97  Process 19440 was started by sandbox on n024.cluster.edu,
% 0.71/0.97  Sat Jul  2 23:12:30 2022
% 0.71/0.97  The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_19285_n024.cluster.edu".
% 0.71/0.97  ============================== end of head ===========================
% 0.71/0.97  
% 0.71/0.97  ============================== INPUT =================================
% 0.71/0.97  
% 0.71/0.97  % Reading from file /tmp/Prover9_19285_n024.cluster.edu
% 0.71/0.97  
% 0.71/0.97  set(prolog_style_variables).
% 0.71/0.97  set(auto2).
% 0.71/0.97      % set(auto2) -> set(auto).
% 0.71/0.97      % set(auto) -> set(auto_inference).
% 0.71/0.97      % set(auto) -> set(auto_setup).
% 0.71/0.97      % set(auto_setup) -> set(predicate_elim).
% 0.71/0.97      % set(auto_setup) -> assign(eq_defs, unfold).
% 0.71/0.97      % set(auto) -> set(auto_limits).
% 0.71/0.97      % set(auto_limits) -> assign(max_weight, "100.000").
% 0.71/0.97      % set(auto_limits) -> assign(sos_limit, 20000).
% 0.71/0.97      % set(auto) -> set(auto_denials).
% 0.71/0.97      % set(auto) -> set(auto_process).
% 0.71/0.97      % set(auto2) -> assign(new_constants, 1).
% 0.71/0.97      % set(auto2) -> assign(fold_denial_max, 3).
% 0.71/0.97      % set(auto2) -> assign(max_weight, "200.000").
% 0.71/0.97      % set(auto2) -> assign(max_hours, 1).
% 0.71/0.97      % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.71/0.97      % set(auto2) -> assign(max_seconds, 0).
% 0.71/0.97      % set(auto2) -> assign(max_minutes, 5).
% 0.71/0.97      % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.71/0.97      % set(auto2) -> set(sort_initial_sos).
% 0.71/0.97      % set(auto2) -> assign(sos_limit, -1).
% 0.71/0.97      % set(auto2) -> assign(lrs_ticks, 3000).
% 0.71/0.97      % set(auto2) -> assign(max_megs, 400).
% 0.71/0.97      % set(auto2) -> assign(stats, some).
% 0.71/0.97      % set(auto2) -> clear(echo_input).
% 0.71/0.97      % set(auto2) -> set(quiet).
% 0.71/0.97      % set(auto2) -> clear(print_initial_clauses).
% 0.71/0.97      % set(auto2) -> clear(print_given).
% 0.71/0.97  assign(lrs_ticks,-1).
% 0.71/0.97  assign(sos_limit,10000).
% 0.71/0.97  assign(order,kbo).
% 0.71/0.97  set(lex_order_vars).
% 0.71/0.97  clear(print_given).
% 0.71/0.97  
% 0.71/0.97  % formulas(sos).  % not echoed (5 formulas)
% 0.71/0.97  
% 0.71/0.97  ============================== end of input ==========================
% 0.71/0.97  
% 0.71/0.97  % From the command line: assign(max_seconds, 300).
% 0.71/0.97  
% 0.71/0.97  ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.71/0.97  
% 0.71/0.97  % Formulas that are not ordinary clauses:
% 0.71/0.97  
% 0.71/0.97  ============================== end of process non-clausal formulas ===
% 0.71/0.97  
% 0.71/0.97  ============================== PROCESS INITIAL CLAUSES ===============
% 0.71/0.97  
% 0.71/0.97  ============================== PREDICATE ELIMINATION =================
% 0.71/0.97  
% 0.71/0.97  ============================== end predicate elimination =============
% 0.71/0.97  
% 0.71/0.97  Auto_denials:
% 0.71/0.97    % copying label prove_cn_64 to answer in negative clause
% 0.71/0.97  
% 0.71/0.97  Term ordering decisions:
% 0.71/0.97  
% 0.71/0.97  % Assigning unary symbol not kb_weight 0 and highest precedence (5).
% 0.71/0.97  Function symbol KB weights:  x=1. y=1. implies=1. not=0.
% 0.71/0.97  
% 0.71/0.97  ============================== end of process initial clauses ========
% 0.71/0.97  
% 0.71/0.97  ============================== CLAUSES FOR SEARCH ====================
% 0.71/0.97  
% 0.71/0.97  ============================== end of clauses for search =============
% 0.71/0.97  
% 0.71/0.97  ============================== SEARCH ================================
% 0.71/0.97  
% 0.71/0.97  % Starting search at 0.01 seconds.
% 0.71/0.97  
% 0.71/0.97  ============================== PROOF =================================
% 0.71/0.97  % SZS status Unsatisfiable
% 0.71/0.97  % SZS output start Refutation
% 0.71/0.97  
% 0.71/0.97  % Proof 1 at 0.01 (+ 0.00) seconds: prove_cn_64.
% 0.71/0.97  % Length of proof is 9.
% 0.71/0.97  % Level of proof is 4.
% 0.71/0.97  % Maximum clause weight is 12.000.
% 0.71/0.97  % Given clauses 10.
% 0.71/0.97  
% 0.71/0.97  1 is_a_theorem(implies(implies(not(A),A),A)) # label(cn_2) # label(axiom).  [assumption].
% 0.71/0.97  2 is_a_theorem(implies(A,implies(not(A),B))) # label(cn_3) # label(axiom).  [assumption].
% 0.71/0.97  3 is_a_theorem(implies(implies(A,B),implies(implies(B,C),implies(A,C)))) # label(cn_1) # label(axiom).  [assumption].
% 0.71/0.97  4 -is_a_theorem(implies(not(implies(x,x)),y)) # label(prove_cn_64) # label(negated_conjecture) # answer(prove_cn_64).  [assumption].
% 0.71/0.97  5 -is_a_theorem(implies(A,B)) | -is_a_theorem(A) | is_a_theorem(B) # label(condensed_detachment) # label(axiom).  [assumption].
% 0.71/0.97  7 is_a_theorem(implies(implies(implies(not(A),B),C),implies(A,C))).  [hyper(5,a,3,a,b,2,a)].
% 0.71/0.97  26 is_a_theorem(implies(A,A)).  [hyper(5,a,7,a,b,1,a)].
% 0.71/0.97  27 is_a_theorem(implies(not(implies(A,A)),B)).  [hyper(5,a,2,a,b,26,a)].
% 0.71/0.97  28 $F # answer(prove_cn_64).  [resolve(27,a,4,a)].
% 0.71/0.97  
% 0.71/0.97  % SZS output end Refutation
% 0.71/0.97  ============================== end of proof ==========================
% 0.71/0.97  
% 0.71/0.97  ============================== STATISTICS ============================
% 0.71/0.97  
% 0.71/0.97  Given=10. Generated=34. Kept=27. proofs=1.
% 0.71/0.97  Usable=10. Sos=16. Demods=0. Limbo=0, Disabled=5. Hints=0.
% 0.71/0.97  Megabytes=0.06.
% 0.71/0.97  User_CPU=0.01, System_CPU=0.00, Wall_clock=0.
% 0.71/0.97  
% 0.71/0.97  ============================== end of statistics =====================
% 0.71/0.97  
% 0.71/0.97  ============================== end of search =========================
% 0.71/0.97  
% 0.71/0.97  THEOREM PROVED
% 0.71/0.97  % SZS status Unsatisfiable
% 0.71/0.97  
% 0.71/0.97  Exiting with 1 proof.
% 0.71/0.97  
% 0.71/0.97  Process 19440 exit (max_proofs) Sat Jul  2 23:12:30 2022
% 0.71/0.97  Prover9 interrupted
%------------------------------------------------------------------------------