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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Prover9---1109a
% Problem  : LCL083-1 : TPTP v8.1.0. Released v1.0.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 : Sun Jul 17 13:43:52 EDT 2022

% Result   : Unsatisfiable 0.81s 1.15s
% Output   : Refutation 0.81s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.09  % Problem  : LCL083-1 : TPTP v8.1.0. Released v1.0.0.
% 0.03/0.10  % Command  : tptp2X_and_run_prover9 %d %s
% 0.11/0.31  % Computer : n026.cluster.edu
% 0.11/0.31  % Model    : x86_64 x86_64
% 0.11/0.31  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.31  % Memory   : 8042.1875MB
% 0.11/0.31  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.11/0.31  % CPULimit : 300
% 0.11/0.31  % WCLimit  : 600
% 0.11/0.31  % DateTime : Sun Jul  3 19:20:51 EDT 2022
% 0.17/0.31  % CPUTime  : 
% 0.81/1.15  ============================== Prover9 ===============================
% 0.81/1.15  Prover9 (32) version 2009-11A, November 2009.
% 0.81/1.15  Process 4747 was started by sandbox2 on n026.cluster.edu,
% 0.81/1.15  Sun Jul  3 19:20:52 2022
% 0.81/1.15  The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 300 -f /tmp/Prover9_4591_n026.cluster.edu".
% 0.81/1.15  ============================== end of head ===========================
% 0.81/1.15  
% 0.81/1.15  ============================== INPUT =================================
% 0.81/1.15  
% 0.81/1.15  % Reading from file /tmp/Prover9_4591_n026.cluster.edu
% 0.81/1.15  
% 0.81/1.15  set(prolog_style_variables).
% 0.81/1.15  set(auto2).
% 0.81/1.15      % set(auto2) -> set(auto).
% 0.81/1.15      % set(auto) -> set(auto_inference).
% 0.81/1.15      % set(auto) -> set(auto_setup).
% 0.81/1.15      % set(auto_setup) -> set(predicate_elim).
% 0.81/1.15      % set(auto_setup) -> assign(eq_defs, unfold).
% 0.81/1.15      % set(auto) -> set(auto_limits).
% 0.81/1.15      % set(auto_limits) -> assign(max_weight, "100.000").
% 0.81/1.15      % set(auto_limits) -> assign(sos_limit, 20000).
% 0.81/1.15      % set(auto) -> set(auto_denials).
% 0.81/1.15      % set(auto) -> set(auto_process).
% 0.81/1.15      % set(auto2) -> assign(new_constants, 1).
% 0.81/1.15      % set(auto2) -> assign(fold_denial_max, 3).
% 0.81/1.15      % set(auto2) -> assign(max_weight, "200.000").
% 0.81/1.15      % set(auto2) -> assign(max_hours, 1).
% 0.81/1.15      % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.81/1.15      % set(auto2) -> assign(max_seconds, 0).
% 0.81/1.15      % set(auto2) -> assign(max_minutes, 5).
% 0.81/1.15      % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.81/1.15      % set(auto2) -> set(sort_initial_sos).
% 0.81/1.15      % set(auto2) -> assign(sos_limit, -1).
% 0.81/1.15      % set(auto2) -> assign(lrs_ticks, 3000).
% 0.81/1.15      % set(auto2) -> assign(max_megs, 400).
% 0.81/1.15      % set(auto2) -> assign(stats, some).
% 0.81/1.15      % set(auto2) -> clear(echo_input).
% 0.81/1.15      % set(auto2) -> set(quiet).
% 0.81/1.15      % set(auto2) -> clear(print_initial_clauses).
% 0.81/1.15      % set(auto2) -> clear(print_given).
% 0.81/1.15  assign(lrs_ticks,-1).
% 0.81/1.15  assign(sos_limit,10000).
% 0.81/1.15  assign(order,kbo).
% 0.81/1.15  set(lex_order_vars).
% 0.81/1.15  clear(print_given).
% 0.81/1.15  
% 0.81/1.15  % formulas(sos).  % not echoed (3 formulas)
% 0.81/1.15  
% 0.81/1.15  ============================== end of input ==========================
% 0.81/1.15  
% 0.81/1.15  % From the command line: assign(max_seconds, 300).
% 0.81/1.15  
% 0.81/1.15  ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.81/1.15  
% 0.81/1.15  % Formulas that are not ordinary clauses:
% 0.81/1.15  
% 0.81/1.15  ============================== end of process non-clausal formulas ===
% 0.81/1.15  
% 0.81/1.15  ============================== PROCESS INITIAL CLAUSES ===============
% 0.81/1.15  
% 0.81/1.15  ============================== PREDICATE ELIMINATION =================
% 0.81/1.15  
% 0.81/1.15  ============================== end predicate elimination =============
% 0.81/1.15  
% 0.81/1.15  Auto_denials:
% 0.81/1.15    % copying label prove_ic_3 to answer in negative clause
% 0.81/1.15  
% 0.81/1.15  Term ordering decisions:
% 0.81/1.15  Function symbol KB weights:  a=1. b=1. implies=1.
% 0.81/1.15  
% 0.81/1.15  ============================== end of process initial clauses ========
% 0.81/1.15  
% 0.81/1.15  ============================== CLAUSES FOR SEARCH ====================
% 0.81/1.15  
% 0.81/1.15  ============================== end of clauses for search =============
% 0.81/1.15  
% 0.81/1.15  ============================== SEARCH ================================
% 0.81/1.15  
% 0.81/1.15  % Starting search at 0.01 seconds.
% 0.81/1.15  
% 0.81/1.15  ============================== PROOF =================================
% 0.81/1.15  % SZS status Unsatisfiable
% 0.81/1.15  % SZS output start Refutation
% 0.81/1.15  
% 0.81/1.15  % Proof 1 at 0.20 (+ 0.02) seconds: prove_ic_3.
% 0.81/1.15  % Length of proof is 20.
% 0.81/1.15  % Level of proof is 16.
% 0.81/1.15  % Maximum clause weight is 24.000.
% 0.81/1.15  % Given clauses 170.
% 0.81/1.15  
% 0.81/1.15  1 is_a_theorem(implies(implies(implies(A,B),C),implies(implies(C,A),implies(D,A)))) # label(ic_JLukasiewicz) # label(axiom).  [assumption].
% 0.81/1.15  2 -is_a_theorem(implies(implies(implies(a,b),a),a)) # label(prove_ic_3) # label(negated_conjecture) # answer(prove_ic_3).  [assumption].
% 0.81/1.15  3 -is_a_theorem(implies(A,B)) | -is_a_theorem(A) | is_a_theorem(B) # label(condensed_detachment) # label(axiom).  [assumption].
% 0.81/1.15  4 is_a_theorem(implies(implies(implies(implies(A,B),implies(C,B)),implies(B,D)),implies(E,implies(B,D)))).  [hyper(3,a,1,a,b,1,a)].
% 0.81/1.15  5 is_a_theorem(implies(A,implies(implies(B,C),implies(C,implies(B,C))))).  [hyper(3,a,4,a,b,4,a)].
% 0.81/1.15  6 is_a_theorem(implies(implies(implies(A,implies(B,C)),implies(implies(D,B),implies(E,B))),implies(F,implies(implies(D,B),implies(E,B))))).  [hyper(3,a,1,a,b,4,a)].
% 0.81/1.15  7 is_a_theorem(implies(implies(A,B),implies(B,implies(A,B)))).  [hyper(3,a,5,a,b,5,a)].
% 0.81/1.15  9 is_a_theorem(implies(implies(implies(A,implies(B,A)),B),implies(C,B))).  [hyper(3,a,1,a,b,7,a)].
% 0.81/1.15  24 is_a_theorem(implies(A,implies(implies(B,C),implies(C,C)))).  [hyper(3,a,6,a,b,9,a)].
% 0.81/1.15  26 is_a_theorem(implies(implies(A,B),implies(B,B))).  [hyper(3,a,24,a,b,24,a)].
% 0.81/1.15  31 is_a_theorem(implies(implies(A,B),implies(A,B))).  [hyper(3,a,26,a,b,9,a)].
% 0.81/1.15  33 is_a_theorem(implies(implies(implies(A,B),A),implies(C,A))).  [hyper(3,a,1,a,b,31,a)].
% 0.81/1.15  56 is_a_theorem(implies(implies(implies(A,B),implies(B,C)),implies(D,implies(B,C)))).  [hyper(3,a,1,a,b,33,a)].
% 0.81/1.15  103 is_a_theorem(implies(implies(implies(A,implies(B,C)),implies(D,B)),implies(E,implies(D,B)))).  [hyper(3,a,1,a,b,56,a)].
% 0.81/1.15  491 is_a_theorem(implies(A,implies(implies(implies(implies(B,C),D),C),implies(B,C)))).  [hyper(3,a,103,a,b,1,a)].
% 0.81/1.15  492 is_a_theorem(implies(implies(implies(implies(A,B),C),B),implies(A,B))).  [hyper(3,a,491,a,b,491,a)].
% 0.81/1.15  501 is_a_theorem(implies(implies(implies(A,B),implies(implies(A,B),C)),implies(D,implies(implies(A,B),C)))).  [hyper(3,a,1,a,b,492,a)].
% 0.81/1.15  1155 is_a_theorem(implies(A,implies(implies(implies(B,C),B),B))).  [hyper(3,a,501,a,b,33,a)].
% 0.81/1.15  1171 is_a_theorem(implies(implies(implies(A,B),A),A)).  [hyper(3,a,1155,a,b,1155,a)].
% 0.81/1.15  1172 $F # answer(prove_ic_3).  [resolve(1171,a,2,a)].
% 0.81/1.15  
% 0.81/1.15  % SZS output end Refutation
% 0.81/1.15  ============================== end of proof ==========================
% 0.81/1.15  
% 0.81/1.15  ============================== STATISTICS ============================
% 0.81/1.15  
% 0.81/1.15  Given=170. Generated=21740. Kept=1171. proofs=1.
% 0.81/1.15  Usable=150. Sos=819. Demods=0. Limbo=0, Disabled=204. Hints=0.
% 0.81/1.15  Megabytes=1.33.
% 0.81/1.15  User_CPU=0.20, System_CPU=0.02, Wall_clock=0.
% 0.81/1.15  
% 0.81/1.15  ============================== end of statistics =====================
% 0.81/1.15  
% 0.81/1.15  ============================== end of search =========================
% 0.81/1.15  
% 0.81/1.15  THEOREM PROVED
% 0.81/1.15  % SZS status Unsatisfiable
% 0.81/1.15  
% 0.81/1.15  Exiting with 1 proof.
% 0.81/1.15  
% 0.81/1.15  Process 4747 exit (max_proofs) Sun Jul  3 19:20:52 2022
% 0.81/1.15  Prover9 interrupted
%------------------------------------------------------------------------------