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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Prover9---1109a
% Problem  : LCL041-1 : TPTP v8.1.0. Released v1.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : tptp2X_and_run_prover9 %d %s

% Computer : n007.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:43:34 EDT 2022

% Result   : Unsatisfiable 0.70s 0.96s
% Output   : Refutation 0.70s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11  % Problem  : LCL041-1 : TPTP v8.1.0. Released v1.0.0.
% 0.03/0.12  % Command  : tptp2X_and_run_prover9 %d %s
% 0.12/0.33  % Computer : n007.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  2 18:43:55 EDT 2022
% 0.12/0.33  % CPUTime  : 
% 0.70/0.96  ============================== Prover9 ===============================
% 0.70/0.96  Prover9 (32) version 2009-11A, November 2009.
% 0.70/0.96  Process 5198 was started by sandbox2 on n007.cluster.edu,
% 0.70/0.96  Sat Jul  2 18:43:56 2022
% 0.70/0.96  The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 300 -f /tmp/Prover9_5045_n007.cluster.edu".
% 0.70/0.96  ============================== end of head ===========================
% 0.70/0.96  
% 0.70/0.96  ============================== INPUT =================================
% 0.70/0.96  
% 0.70/0.96  % Reading from file /tmp/Prover9_5045_n007.cluster.edu
% 0.70/0.96  
% 0.70/0.96  set(prolog_style_variables).
% 0.70/0.96  set(auto2).
% 0.70/0.96      % set(auto2) -> set(auto).
% 0.70/0.96      % set(auto) -> set(auto_inference).
% 0.70/0.96      % set(auto) -> set(auto_setup).
% 0.70/0.96      % set(auto_setup) -> set(predicate_elim).
% 0.70/0.96      % set(auto_setup) -> assign(eq_defs, unfold).
% 0.70/0.96      % set(auto) -> set(auto_limits).
% 0.70/0.96      % set(auto_limits) -> assign(max_weight, "100.000").
% 0.70/0.96      % set(auto_limits) -> assign(sos_limit, 20000).
% 0.70/0.96      % set(auto) -> set(auto_denials).
% 0.70/0.96      % set(auto) -> set(auto_process).
% 0.70/0.96      % set(auto2) -> assign(new_constants, 1).
% 0.70/0.96      % set(auto2) -> assign(fold_denial_max, 3).
% 0.70/0.96      % set(auto2) -> assign(max_weight, "200.000").
% 0.70/0.96      % set(auto2) -> assign(max_hours, 1).
% 0.70/0.96      % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.70/0.96      % set(auto2) -> assign(max_seconds, 0).
% 0.70/0.96      % set(auto2) -> assign(max_minutes, 5).
% 0.70/0.96      % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.70/0.96      % set(auto2) -> set(sort_initial_sos).
% 0.70/0.96      % set(auto2) -> assign(sos_limit, -1).
% 0.70/0.96      % set(auto2) -> assign(lrs_ticks, 3000).
% 0.70/0.96      % set(auto2) -> assign(max_megs, 400).
% 0.70/0.96      % set(auto2) -> assign(stats, some).
% 0.70/0.96      % set(auto2) -> clear(echo_input).
% 0.70/0.96      % set(auto2) -> set(quiet).
% 0.70/0.96      % set(auto2) -> clear(print_initial_clauses).
% 0.70/0.96      % set(auto2) -> clear(print_given).
% 0.70/0.96  assign(lrs_ticks,-1).
% 0.70/0.96  assign(sos_limit,10000).
% 0.70/0.96  assign(order,kbo).
% 0.70/0.96  set(lex_order_vars).
% 0.70/0.96  clear(print_given).
% 0.70/0.96  
% 0.70/0.96  % formulas(sos).  % not echoed (7 formulas)
% 0.70/0.96  
% 0.70/0.96  ============================== end of input ==========================
% 0.70/0.96  
% 0.70/0.96  % From the command line: assign(max_seconds, 300).
% 0.70/0.96  
% 0.70/0.96  ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.70/0.96  
% 0.70/0.96  % Formulas that are not ordinary clauses:
% 0.70/0.96  
% 0.70/0.96  ============================== end of process non-clausal formulas ===
% 0.70/0.96  
% 0.70/0.96  ============================== PROCESS INITIAL CLAUSES ===============
% 0.70/0.96  
% 0.70/0.96  ============================== PREDICATE ELIMINATION =================
% 0.70/0.96  
% 0.70/0.96  ============================== end predicate elimination =============
% 0.70/0.96  
% 0.70/0.96  Auto_denials:
% 0.70/0.96    % copying label prove_cn_30 to answer in negative clause
% 0.70/0.96  
% 0.70/0.96  Term ordering decisions:
% 0.70/0.96  
% 0.70/0.96  % Assigning unary symbol not kb_weight 0 and highest precedence (5).
% 0.70/0.96  Function symbol KB weights:  a=1. b=1. implies=1. not=0.
% 0.70/0.96  
% 0.70/0.96  ============================== end of process initial clauses ========
% 0.70/0.96  
% 0.70/0.96  ============================== CLAUSES FOR SEARCH ====================
% 0.70/0.96  
% 0.70/0.96  ============================== end of clauses for search =============
% 0.70/0.96  
% 0.70/0.96  ============================== SEARCH ================================
% 0.70/0.96  
% 0.70/0.96  % Starting search at 0.01 seconds.
% 0.70/0.96  
% 0.70/0.96  ============================== PROOF =================================
% 0.70/0.96  % SZS status Unsatisfiable
% 0.70/0.96  % SZS output start Refutation
% 0.70/0.96  
% 0.70/0.96  % Proof 1 at 0.03 (+ 0.00) seconds: prove_cn_30.
% 0.70/0.96  % Length of proof is 9.
% 0.70/0.96  % Level of proof is 3.
% 0.70/0.96  % Maximum clause weight is 12.000.
% 0.70/0.96  % Given clauses 43.
% 0.70/0.96  
% 0.70/0.96  2 is_a_theorem(implies(A,implies(not(A),B))) # label(cn_3) # label(axiom).  [assumption].
% 0.70/0.96  3 is_a_theorem(implies(implies(A,B),implies(implies(not(A),B),B))) # label(cn_54) # label(axiom).  [assumption].
% 0.70/0.96  4 is_a_theorem(implies(implies(A,implies(B,C)),implies(B,implies(A,C)))) # label(cn_21) # label(axiom).  [assumption].
% 0.70/0.96  6 -is_a_theorem(implies(implies(a,implies(a,b)),implies(a,b))) # label(prove_cn_30) # label(negated_conjecture) # answer(prove_cn_30).  [assumption].
% 0.70/0.96  7 -is_a_theorem(implies(A,B)) | -is_a_theorem(A) | is_a_theorem(B) # label(condensed_detachment) # label(axiom).  [assumption].
% 0.70/0.96  15 is_a_theorem(implies(implies(not(A),B),implies(implies(A,B),B))).  [hyper(7,a,4,a,b,3,a)].
% 0.70/0.96  16 is_a_theorem(implies(not(A),implies(A,B))).  [hyper(7,a,4,a,b,2,a)].
% 0.70/0.96  507 is_a_theorem(implies(implies(A,implies(A,B)),implies(A,B))).  [hyper(7,a,15,a,b,16,a)].
% 0.70/0.96  508 $F # answer(prove_cn_30).  [resolve(507,a,6,a)].
% 0.70/0.96  
% 0.70/0.96  % SZS output end Refutation
% 0.70/0.96  ============================== end of proof ==========================
% 0.70/0.96  
% 0.70/0.96  ============================== STATISTICS ============================
% 0.70/0.96  
% 0.70/0.96  Given=43. Generated=1153. Kept=507. proofs=1.
% 0.70/0.96  Usable=43. Sos=434. Demods=0. Limbo=22, Disabled=14. Hints=0.
% 0.70/0.96  Megabytes=0.43.
% 0.70/0.96  User_CPU=0.03, System_CPU=0.00, Wall_clock=0.
% 0.70/0.96  
% 0.70/0.96  ============================== end of statistics =====================
% 0.70/0.96  
% 0.70/0.96  ============================== end of search =========================
% 0.70/0.96  
% 0.70/0.96  THEOREM PROVED
% 0.70/0.96  % SZS status Unsatisfiable
% 0.70/0.96  
% 0.70/0.96  Exiting with 1 proof.
% 0.70/0.96  
% 0.70/0.96  Process 5198 exit (max_proofs) Sat Jul  2 18:43:56 2022
% 0.70/0.96  Prover9 interrupted
%------------------------------------------------------------------------------