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

View Problem - Process Solution

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

% Computer : n028.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:56 EDT 2022

% Result   : Unsatisfiable 0.72s 1.05s
% Output   : Refutation 0.72s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12  % Problem  : LCL091-1 : TPTP v8.1.0. Released v1.0.0.
% 0.12/0.13  % Command  : tptp2X_and_run_prover9 %d %s
% 0.12/0.33  % Computer : n028.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 15:29:17 EDT 2022
% 0.12/0.34  % CPUTime  : 
% 0.72/1.05  ============================== Prover9 ===============================
% 0.72/1.05  Prover9 (32) version 2009-11A, November 2009.
% 0.72/1.05  Process 5770 was started by sandbox on n028.cluster.edu,
% 0.72/1.05  Sat Jul  2 15:29:18 2022
% 0.72/1.05  The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_5616_n028.cluster.edu".
% 0.72/1.05  ============================== end of head ===========================
% 0.72/1.05  
% 0.72/1.05  ============================== INPUT =================================
% 0.72/1.05  
% 0.72/1.05  % Reading from file /tmp/Prover9_5616_n028.cluster.edu
% 0.72/1.05  
% 0.72/1.05  set(prolog_style_variables).
% 0.72/1.05  set(auto2).
% 0.72/1.05      % set(auto2) -> set(auto).
% 0.72/1.05      % set(auto) -> set(auto_inference).
% 0.72/1.05      % set(auto) -> set(auto_setup).
% 0.72/1.05      % set(auto_setup) -> set(predicate_elim).
% 0.72/1.05      % set(auto_setup) -> assign(eq_defs, unfold).
% 0.72/1.05      % set(auto) -> set(auto_limits).
% 0.72/1.05      % set(auto_limits) -> assign(max_weight, "100.000").
% 0.72/1.05      % set(auto_limits) -> assign(sos_limit, 20000).
% 0.72/1.05      % set(auto) -> set(auto_denials).
% 0.72/1.05      % set(auto) -> set(auto_process).
% 0.72/1.05      % set(auto2) -> assign(new_constants, 1).
% 0.72/1.05      % set(auto2) -> assign(fold_denial_max, 3).
% 0.72/1.05      % set(auto2) -> assign(max_weight, "200.000").
% 0.72/1.05      % set(auto2) -> assign(max_hours, 1).
% 0.72/1.05      % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.72/1.05      % set(auto2) -> assign(max_seconds, 0).
% 0.72/1.05      % set(auto2) -> assign(max_minutes, 5).
% 0.72/1.05      % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.72/1.05      % set(auto2) -> set(sort_initial_sos).
% 0.72/1.05      % set(auto2) -> assign(sos_limit, -1).
% 0.72/1.05      % set(auto2) -> assign(lrs_ticks, 3000).
% 0.72/1.05      % set(auto2) -> assign(max_megs, 400).
% 0.72/1.05      % set(auto2) -> assign(stats, some).
% 0.72/1.05      % set(auto2) -> clear(echo_input).
% 0.72/1.05      % set(auto2) -> set(quiet).
% 0.72/1.05      % set(auto2) -> clear(print_initial_clauses).
% 0.72/1.05      % set(auto2) -> clear(print_given).
% 0.72/1.05  assign(lrs_ticks,-1).
% 0.72/1.05  assign(sos_limit,10000).
% 0.72/1.05  assign(order,kbo).
% 0.72/1.05  set(lex_order_vars).
% 0.72/1.05  clear(print_given).
% 0.72/1.05  
% 0.72/1.05  % formulas(sos).  % not echoed (3 formulas)
% 0.72/1.05  
% 0.72/1.05  ============================== end of input ==========================
% 0.72/1.05  
% 0.72/1.05  % From the command line: assign(max_seconds, 300).
% 0.72/1.05  
% 0.72/1.05  ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.72/1.05  
% 0.72/1.05  % Formulas that are not ordinary clauses:
% 0.72/1.05  
% 0.72/1.05  ============================== end of process non-clausal formulas ===
% 0.72/1.05  
% 0.72/1.05  ============================== PROCESS INITIAL CLAUSES ===============
% 0.72/1.05  
% 0.72/1.05  ============================== PREDICATE ELIMINATION =================
% 0.72/1.05  
% 0.72/1.05  ============================== end predicate elimination =============
% 0.72/1.05  
% 0.72/1.05  Auto_denials:
% 0.72/1.05    % copying label prove_ic_2 to answer in negative clause
% 0.72/1.05  
% 0.72/1.05  Term ordering decisions:
% 0.72/1.05  Function symbol KB weights:  a=1. b=1. implies=1.
% 0.72/1.05  
% 0.72/1.05  ============================== end of process initial clauses ========
% 0.72/1.05  
% 0.72/1.05  ============================== CLAUSES FOR SEARCH ====================
% 0.72/1.05  
% 0.72/1.05  ============================== end of clauses for search =============
% 0.72/1.05  
% 0.72/1.05  ============================== SEARCH ================================
% 0.72/1.05  
% 0.72/1.05  % Starting search at 0.01 seconds.
% 0.72/1.05  
% 0.72/1.05  ============================== PROOF =================================
% 0.72/1.05  % SZS status Unsatisfiable
% 0.72/1.05  % SZS output start Refutation
% 0.72/1.05  
% 0.72/1.05  % Proof 1 at 0.07 (+ 0.01) seconds: prove_ic_2.
% 0.72/1.05  % Length of proof is 23.
% 0.72/1.05  % Level of proof is 20.
% 0.72/1.05  % Maximum clause weight is 24.000.
% 0.72/1.05  % Given clauses 72.
% 0.72/1.05  
% 0.72/1.05  1 is_a_theorem(implies(implies(implies(A,B),implies(C,D)),implies(implies(D,A),implies(E,implies(C,A))))) # label(ic_JLukasiewicz_5) # label(axiom).  [assumption].
% 0.72/1.05  2 -is_a_theorem(implies(a,implies(b,a))) # label(prove_ic_2) # label(negated_conjecture) # answer(prove_ic_2).  [assumption].
% 0.72/1.05  3 -is_a_theorem(implies(A,B)) | -is_a_theorem(A) | is_a_theorem(B) # label(condensed_detachment) # label(axiom).  [assumption].
% 0.72/1.05  4 is_a_theorem(implies(implies(implies(A,implies(B,C)),implies(C,D)),implies(E,implies(implies(F,C),implies(C,D))))).  [hyper(3,a,1,a,b,1,a)].
% 0.72/1.05  5 is_a_theorem(implies(A,implies(implies(B,C),implies(C,implies(implies(D,E),implies(E,C)))))).  [hyper(3,a,4,a,b,4,a)].
% 0.72/1.05  7 is_a_theorem(implies(implies(A,B),implies(B,implies(implies(C,D),implies(D,B))))).  [hyper(3,a,5,a,b,5,a)].
% 0.72/1.05  11 is_a_theorem(implies(implies(implies(implies(A,B),implies(B,C)),D),implies(E,implies(C,D)))).  [hyper(3,a,1,a,b,7,a)].
% 0.72/1.05  18 is_a_theorem(implies(implies(implies(A,B),implies(implies(C,D),implies(D,A))),implies(E,implies(F,implies(implies(C,D),implies(D,A)))))).  [hyper(3,a,1,a,b,11,a)].
% 0.72/1.05  58 is_a_theorem(implies(A,implies(B,implies(implies(C,D),implies(D,implies(D,D)))))).  [hyper(3,a,18,a,b,1,a)].
% 0.72/1.05  105 is_a_theorem(implies(A,implies(implies(B,C),implies(C,implies(C,C))))).  [hyper(3,a,58,a,b,58,a)].
% 0.72/1.05  109 is_a_theorem(implies(implies(A,B),implies(B,implies(B,B)))).  [hyper(3,a,105,a,b,105,a)].
% 0.72/1.05  114 is_a_theorem(implies(implies(implies(A,A),B),implies(C,implies(A,B)))).  [hyper(3,a,1,a,b,109,a)].
% 0.72/1.05  120 is_a_theorem(implies(implies(implies(A,B),implies(A,A)),implies(C,implies(D,implies(A,A))))).  [hyper(3,a,1,a,b,114,a)].
% 0.72/1.05  379 is_a_theorem(implies(A,implies(B,implies(implies(C,C),implies(C,C))))).  [hyper(3,a,120,a,b,114,a)].
% 0.72/1.05  385 is_a_theorem(implies(A,implies(implies(B,B),implies(B,B)))).  [hyper(3,a,379,a,b,379,a)].
% 0.72/1.05  394 is_a_theorem(implies(implies(A,A),implies(A,A))).  [hyper(3,a,385,a,b,385,a)].
% 0.72/1.05  397 is_a_theorem(implies(A,implies(B,implies(C,C)))).  [hyper(3,a,120,a,b,394,a)].
% 0.72/1.05  408 is_a_theorem(implies(A,implies(B,B))).  [hyper(3,a,397,a,b,397,a)].
% 0.72/1.05  417 is_a_theorem(implies(A,A)).  [hyper(3,a,408,a,b,408,a)].
% 0.72/1.05  424 is_a_theorem(implies(A,implies(implies(B,C),implies(C,implies(D,C))))).  [hyper(3,a,4,a,b,417,a)].
% 0.72/1.05  481 is_a_theorem(implies(implies(A,B),implies(B,implies(C,B)))).  [hyper(3,a,424,a,b,424,a)].
% 0.72/1.05  489 is_a_theorem(implies(A,implies(B,A))).  [hyper(3,a,481,a,b,417,a)].
% 0.72/1.05  490 $F # answer(prove_ic_2).  [resolve(489,a,2,a)].
% 0.72/1.05  
% 0.72/1.05  % SZS output end Refutation
% 0.72/1.05  ============================== end of proof ==========================
% 0.72/1.05  
% 0.72/1.05  ============================== STATISTICS ============================
% 0.72/1.05  
% 0.72/1.05  Given=72. Generated=3124. Kept=489. proofs=1.
% 0.72/1.05  Usable=35. Sos=210. Demods=0. Limbo=3, Disabled=243. Hints=0.
% 0.72/1.05  Megabytes=0.47.
% 0.72/1.05  User_CPU=0.07, System_CPU=0.01, Wall_clock=0.
% 0.72/1.05  
% 0.72/1.05  ============================== end of statistics =====================
% 0.72/1.05  
% 0.72/1.05  ============================== end of search =========================
% 0.72/1.05  
% 0.72/1.05  THEOREM PROVED
% 0.72/1.05  % SZS status Unsatisfiable
% 0.72/1.05  
% 0.72/1.05  Exiting with 1 proof.
% 0.72/1.05  
% 0.72/1.05  Process 5770 exit (max_proofs) Sat Jul  2 15:29:18 2022
% 0.72/1.05  Prover9 interrupted
%------------------------------------------------------------------------------