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

View Problem - Process Solution

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

% Computer : n015.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:44:09 EDT 2022

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

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.13  % Problem  : LCL115-1 : TPTP v8.1.0. Released v1.0.0.
% 0.12/0.13  % Command  : tptp2X_and_run_prover9 %d %s
% 0.14/0.35  % Computer : n015.cluster.edu
% 0.14/0.35  % Model    : x86_64 x86_64
% 0.14/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35  % Memory   : 8042.1875MB
% 0.14/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35  % CPULimit : 300
% 0.14/0.35  % WCLimit  : 600
% 0.14/0.35  % DateTime : Sat Jul  2 13:23:29 EDT 2022
% 0.14/0.35  % CPUTime  : 
% 0.96/1.24  ============================== Prover9 ===============================
% 0.96/1.24  Prover9 (32) version 2009-11A, November 2009.
% 0.96/1.24  Process 13859 was started by sandbox2 on n015.cluster.edu,
% 0.96/1.24  Sat Jul  2 13:23:30 2022
% 0.96/1.24  The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 300 -f /tmp/Prover9_13706_n015.cluster.edu".
% 0.96/1.24  ============================== end of head ===========================
% 0.96/1.24  
% 0.96/1.24  ============================== INPUT =================================
% 0.96/1.24  
% 0.96/1.24  % Reading from file /tmp/Prover9_13706_n015.cluster.edu
% 0.96/1.24  
% 0.96/1.24  set(prolog_style_variables).
% 0.96/1.24  set(auto2).
% 0.96/1.24      % set(auto2) -> set(auto).
% 0.96/1.24      % set(auto) -> set(auto_inference).
% 0.96/1.24      % set(auto) -> set(auto_setup).
% 0.96/1.24      % set(auto_setup) -> set(predicate_elim).
% 0.96/1.24      % set(auto_setup) -> assign(eq_defs, unfold).
% 0.96/1.24      % set(auto) -> set(auto_limits).
% 0.96/1.24      % set(auto_limits) -> assign(max_weight, "100.000").
% 0.96/1.24      % set(auto_limits) -> assign(sos_limit, 20000).
% 0.96/1.24      % set(auto) -> set(auto_denials).
% 0.96/1.24      % set(auto) -> set(auto_process).
% 0.96/1.24      % set(auto2) -> assign(new_constants, 1).
% 0.96/1.24      % set(auto2) -> assign(fold_denial_max, 3).
% 0.96/1.24      % set(auto2) -> assign(max_weight, "200.000").
% 0.96/1.24      % set(auto2) -> assign(max_hours, 1).
% 0.96/1.24      % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.96/1.24      % set(auto2) -> assign(max_seconds, 0).
% 0.96/1.24      % set(auto2) -> assign(max_minutes, 5).
% 0.96/1.24      % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.96/1.24      % set(auto2) -> set(sort_initial_sos).
% 0.96/1.24      % set(auto2) -> assign(sos_limit, -1).
% 0.96/1.24      % set(auto2) -> assign(lrs_ticks, 3000).
% 0.96/1.24      % set(auto2) -> assign(max_megs, 400).
% 0.96/1.24      % set(auto2) -> assign(stats, some).
% 0.96/1.24      % set(auto2) -> clear(echo_input).
% 0.96/1.24      % set(auto2) -> set(quiet).
% 0.96/1.24      % set(auto2) -> clear(print_initial_clauses).
% 0.96/1.24      % set(auto2) -> clear(print_given).
% 0.96/1.24  assign(lrs_ticks,-1).
% 0.96/1.24  assign(sos_limit,10000).
% 0.96/1.24  assign(order,kbo).
% 0.96/1.24  set(lex_order_vars).
% 0.96/1.24  clear(print_given).
% 0.96/1.24  
% 0.96/1.24  % formulas(sos).  % not echoed (6 formulas)
% 0.96/1.24  
% 0.96/1.24  ============================== end of input ==========================
% 0.96/1.24  
% 0.96/1.24  % From the command line: assign(max_seconds, 300).
% 0.96/1.24  
% 0.96/1.24  ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.96/1.24  
% 0.96/1.24  % Formulas that are not ordinary clauses:
% 0.96/1.24  
% 0.96/1.24  ============================== end of process non-clausal formulas ===
% 0.96/1.24  
% 0.96/1.24  ============================== PROCESS INITIAL CLAUSES ===============
% 0.96/1.24  
% 0.96/1.24  ============================== PREDICATE ELIMINATION =================
% 0.96/1.24  
% 0.96/1.24  ============================== end predicate elimination =============
% 0.96/1.24  
% 0.96/1.24  Auto_denials:
% 0.96/1.24    % copying label prove_mv_39 to answer in negative clause
% 0.96/1.24  
% 0.96/1.24  Term ordering decisions:
% 0.96/1.24  
% 0.96/1.24  % Assigning unary symbol not kb_weight 0 and highest precedence (5).
% 0.96/1.24  Function symbol KB weights:  a=1. b=1. implies=1. not=0.
% 0.96/1.24  
% 0.96/1.24  ============================== end of process initial clauses ========
% 0.96/1.24  
% 0.96/1.24  ============================== CLAUSES FOR SEARCH ====================
% 0.96/1.24  
% 0.96/1.24  ============================== end of clauses for search =============
% 0.96/1.24  
% 0.96/1.24  ============================== SEARCH ================================
% 0.96/1.24  
% 0.96/1.24  % Starting search at 0.01 seconds.
% 0.96/1.24  
% 0.96/1.24  ============================== PROOF =================================
% 0.96/1.24  % SZS status Unsatisfiable
% 0.96/1.25  % SZS output start Refutation
% 0.96/1.25  
% 0.96/1.25  % Proof 1 at 0.22 (+ 0.01) seconds: prove_mv_39.
% 0.96/1.25  % Length of proof is 23.
% 0.96/1.25  % Level of proof is 11.
% 0.96/1.25  % Maximum clause weight is 14.000.
% 0.96/1.25  % Given clauses 156.
% 0.96/1.25  
% 0.96/1.25  1 is_a_theorem(implies(A,implies(B,A))) # label(mv_1) # label(axiom).  [assumption].
% 0.96/1.25  2 is_a_theorem(implies(implies(not(A),not(B)),implies(B,A))) # label(mv_5) # label(axiom).  [assumption].
% 0.96/1.25  3 is_a_theorem(implies(implies(A,B),implies(implies(B,C),implies(A,C)))) # label(mv_2) # label(axiom).  [assumption].
% 0.96/1.25  4 is_a_theorem(implies(implies(implies(A,B),B),implies(implies(B,A),A))) # label(mv_3) # label(axiom).  [assumption].
% 0.96/1.25  5 -is_a_theorem(implies(not(implies(a,b)),not(b))) # label(prove_mv_39) # label(negated_conjecture) # answer(prove_mv_39).  [assumption].
% 0.96/1.25  6 -is_a_theorem(implies(A,B)) | -is_a_theorem(A) | is_a_theorem(B) # label(condensed_detachment) # label(axiom).  [assumption].
% 0.96/1.25  9 is_a_theorem(implies(implies(implies(A,B),C),implies(implies(not(B),not(A)),C))).  [hyper(6,a,3,a,b,2,a)].
% 0.96/1.25  10 is_a_theorem(implies(implies(implies(A,B),C),implies(B,C))).  [hyper(6,a,3,a,b,1,a)].
% 0.96/1.25  14 is_a_theorem(implies(A,implies(B,implies(C,B)))).  [hyper(6,a,1,a,b,1,a)].
% 0.96/1.25  21 is_a_theorem(implies(implies(implies(A,implies(B,A)),C),C)).  [hyper(6,a,4,a,b,14,a)].
% 0.96/1.25  27 is_a_theorem(implies(A,implies(implies(A,B),B))).  [hyper(6,a,10,a,b,4,a)].
% 0.96/1.25  29 is_a_theorem(implies(not(A),implies(A,B))).  [hyper(6,a,10,a,b,2,a)].
% 0.96/1.25  31 is_a_theorem(implies(implies(implies(A,B),C),implies(not(A),C))).  [hyper(6,a,3,a,b,29,a)].
% 0.96/1.25  75 is_a_theorem(implies(A,A)).  [hyper(6,a,10,a,b,21,a)].
% 0.96/1.25  80 is_a_theorem(implies(implies(implies(A,A),B),B)).  [hyper(6,a,27,a,b,75,a)].
% 0.96/1.25  107 is_a_theorem(implies(implies(not(A),not(implies(B,B))),A)).  [hyper(6,a,9,a,b,80,a)].
% 0.96/1.25  351 is_a_theorem(implies(not(not(A)),A)).  [hyper(6,a,31,a,b,107,a)].
% 0.96/1.25  395 is_a_theorem(implies(implies(A,B),implies(not(not(A)),B))).  [hyper(6,a,3,a,b,351,a)].
% 0.96/1.25  396 is_a_theorem(implies(A,not(not(A)))).  [hyper(6,a,2,a,b,351,a)].
% 0.96/1.25  417 is_a_theorem(implies(A,not(not(implies(B,A))))).  [hyper(6,a,10,a,b,396,a)].
% 0.96/1.25  1336 is_a_theorem(implies(not(not(A)),not(not(implies(B,A))))).  [hyper(6,a,395,a,b,417,a)].
% 0.96/1.25  3830 is_a_theorem(implies(not(implies(A,B)),not(B))).  [hyper(6,a,2,a,b,1336,a)].
% 0.96/1.25  3831 $F # answer(prove_mv_39).  [resolve(3830,a,5,a)].
% 0.96/1.25  
% 0.96/1.25  % SZS output end Refutation
% 0.96/1.25  ============================== end of proof ==========================
% 0.96/1.25  
% 0.96/1.25  ============================== STATISTICS ============================
% 0.96/1.25  
% 0.96/1.25  Given=156. Generated=12225. Kept=3830. proofs=1.
% 0.96/1.25  Usable=156. Sos=3636. Demods=0. Limbo=24, Disabled=19. Hints=0.
% 0.96/1.25  Megabytes=3.31.
% 0.96/1.25  User_CPU=0.22, System_CPU=0.01, Wall_clock=0.
% 0.96/1.25  
% 0.96/1.25  ============================== end of statistics =====================
% 0.96/1.25  
% 0.96/1.25  ============================== end of search =========================
% 0.96/1.25  
% 0.96/1.25  THEOREM PROVED
% 0.96/1.25  % SZS status Unsatisfiable
% 0.96/1.25  
% 0.96/1.25  Exiting with 1 proof.
% 0.96/1.25  
% 0.96/1.25  Process 13859 exit (max_proofs) Sat Jul  2 13:23:30 2022
% 0.96/1.25  Prover9 interrupted
%------------------------------------------------------------------------------