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

View Problem - Process Solution

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

% Computer : n008.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 13.63s 13.88s
% Output   : Refutation 13.63s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem  : LCL114-1 : TPTP v8.1.0. Released v1.0.0.
% 0.07/0.12  % Command  : tptp2X_and_run_prover9 %d %s
% 0.12/0.33  % Computer : n008.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 : Mon Jul  4 04:42:53 EDT 2022
% 0.12/0.33  % CPUTime  : 
% 13.63/13.88  ============================== Prover9 ===============================
% 13.63/13.88  Prover9 (32) version 2009-11A, November 2009.
% 13.63/13.88  Process 4991 was started by sandbox2 on n008.cluster.edu,
% 13.63/13.88  Mon Jul  4 04:42:54 2022
% 13.63/13.88  The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 300 -f /tmp/Prover9_4838_n008.cluster.edu".
% 13.63/13.88  ============================== end of head ===========================
% 13.63/13.88  
% 13.63/13.88  ============================== INPUT =================================
% 13.63/13.88  
% 13.63/13.88  % Reading from file /tmp/Prover9_4838_n008.cluster.edu
% 13.63/13.88  
% 13.63/13.88  set(prolog_style_variables).
% 13.63/13.88  set(auto2).
% 13.63/13.88      % set(auto2) -> set(auto).
% 13.63/13.88      % set(auto) -> set(auto_inference).
% 13.63/13.88      % set(auto) -> set(auto_setup).
% 13.63/13.88      % set(auto_setup) -> set(predicate_elim).
% 13.63/13.88      % set(auto_setup) -> assign(eq_defs, unfold).
% 13.63/13.88      % set(auto) -> set(auto_limits).
% 13.63/13.88      % set(auto_limits) -> assign(max_weight, "100.000").
% 13.63/13.88      % set(auto_limits) -> assign(sos_limit, 20000).
% 13.63/13.88      % set(auto) -> set(auto_denials).
% 13.63/13.88      % set(auto) -> set(auto_process).
% 13.63/13.88      % set(auto2) -> assign(new_constants, 1).
% 13.63/13.88      % set(auto2) -> assign(fold_denial_max, 3).
% 13.63/13.88      % set(auto2) -> assign(max_weight, "200.000").
% 13.63/13.88      % set(auto2) -> assign(max_hours, 1).
% 13.63/13.88      % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 13.63/13.88      % set(auto2) -> assign(max_seconds, 0).
% 13.63/13.88      % set(auto2) -> assign(max_minutes, 5).
% 13.63/13.88      % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 13.63/13.88      % set(auto2) -> set(sort_initial_sos).
% 13.63/13.88      % set(auto2) -> assign(sos_limit, -1).
% 13.63/13.88      % set(auto2) -> assign(lrs_ticks, 3000).
% 13.63/13.88      % set(auto2) -> assign(max_megs, 400).
% 13.63/13.88      % set(auto2) -> assign(stats, some).
% 13.63/13.88      % set(auto2) -> clear(echo_input).
% 13.63/13.88      % set(auto2) -> set(quiet).
% 13.63/13.88      % set(auto2) -> clear(print_initial_clauses).
% 13.63/13.88      % set(auto2) -> clear(print_given).
% 13.63/13.88  assign(lrs_ticks,-1).
% 13.63/13.88  assign(sos_limit,10000).
% 13.63/13.88  assign(order,kbo).
% 13.63/13.88  set(lex_order_vars).
% 13.63/13.88  clear(print_given).
% 13.63/13.88  
% 13.63/13.88  % formulas(sos).  % not echoed (6 formulas)
% 13.63/13.88  
% 13.63/13.88  ============================== end of input ==========================
% 13.63/13.88  
% 13.63/13.88  % From the command line: assign(max_seconds, 300).
% 13.63/13.88  
% 13.63/13.88  ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 13.63/13.88  
% 13.63/13.88  % Formulas that are not ordinary clauses:
% 13.63/13.88  
% 13.63/13.88  ============================== end of process non-clausal formulas ===
% 13.63/13.88  
% 13.63/13.88  ============================== PROCESS INITIAL CLAUSES ===============
% 13.63/13.88  
% 13.63/13.88  ============================== PREDICATE ELIMINATION =================
% 13.63/13.88  
% 13.63/13.88  ============================== end predicate elimination =============
% 13.63/13.88  
% 13.63/13.88  Auto_denials:
% 13.63/13.88    % copying label prove_mv_36 to answer in negative clause
% 13.63/13.88  
% 13.63/13.88  Term ordering decisions:
% 13.63/13.88  
% 13.63/13.88  % Assigning unary symbol not kb_weight 0 and highest precedence (5).
% 13.63/13.88  Function symbol KB weights:  a=1. b=1. implies=1. not=0.
% 13.63/13.88  
% 13.63/13.88  ============================== end of process initial clauses ========
% 13.63/13.88  
% 13.63/13.88  ============================== CLAUSES FOR SEARCH ====================
% 13.63/13.88  
% 13.63/13.88  ============================== end of clauses for search =============
% 13.63/13.88  
% 13.63/13.88  ============================== SEARCH ================================
% 13.63/13.88  
% 13.63/13.88  % Starting search at 0.01 seconds.
% 13.63/13.88  
% 13.63/13.88  Low Water (keep): wt=24.000, iters=3354
% 13.63/13.88  
% 13.63/13.88  Low Water (keep): wt=22.000, iters=3439
% 13.63/13.88  
% 13.63/13.88  Low Water (keep): wt=21.000, iters=3425
% 13.63/13.88  
% 13.63/13.88  Low Water (keep): wt=20.000, iters=3391
% 13.63/13.88  
% 13.63/13.88  Low Water (keep): wt=18.000, iters=3366
% 13.63/13.88  
% 13.63/13.88  Low Water (keep): wt=17.000, iters=3361
% 13.63/13.88  
% 13.63/13.88  Low Water (keep): wt=16.000, iters=3333
% 13.63/13.88  
% 13.63/13.88  NOTE: Back_subsumption disabled, ratio of kept to back_subsumed is 230 (0.00 of 0.75 sec).
% 13.63/13.88  
% 13.63/13.88  Low Water (keep): wt=15.000, iters=3343
% 13.63/13.88  
% 13.63/13.88  Low Water (displace): id=3930, wt=34.000
% 13.63/13.88  
% 13.63/13.88  Low Water (displace): id=3907, wt=32.000
% 13.63/13.88  
% 13.63/13.88  Low Water (displace): id=10835, wt=14.000
% 13.63/13.88  
% 13.63/13.88  Low Water (displace): id=10886, wt=13.000
% 13.63/13.88  
% 13.63/13.88  ============================== PROOF =================================
% 13.63/13.88  % SZS status Unsatisfiable
% 13.63/13.88  % SZS output start Refutation
% 13.63/13.88  
% 13.63/13.88  % Proof 1 at 11.05 (+ 1.88) seconds: prove_mv_36.
% 13.63/13.88  % Length of proof is 31.
% 13.63/13.88  % Level of proof is 14.
% 13.63/13.88  % Maximum clause weight is 16.000.
% 13.63/13.88  % Given clauses 2938.
% 13.63/13.88  
% 13.63/13.88  1 is_a_theorem(implies(A,implies(B,A))) # label(mv_1) # label(axiom).  [assumption].
% 13.63/13.88  2 is_a_theorem(implies(implies(not(A),not(B)),implies(B,A))) # label(mv_5) # label(axiom).  [assumption].
% 13.63/13.88  3 is_a_theorem(implies(implies(A,B),implies(implies(B,C),implies(A,C)))) # label(mv_2) # label(axiom).  [assumption].
% 13.63/13.88  4 is_a_theorem(implies(implies(implies(A,B),B),implies(implies(B,A),A))) # label(mv_3) # label(axiom).  [assumption].
% 13.63/13.88  5 -is_a_theorem(implies(implies(a,b),implies(not(b),not(a)))) # label(prove_mv_36) # label(negated_conjecture) # answer(prove_mv_36).  [assumption].
% 13.63/13.88  6 -is_a_theorem(implies(A,B)) | -is_a_theorem(A) | is_a_theorem(B) # label(condensed_detachment) # label(axiom).  [assumption].
% 13.63/13.88  8 is_a_theorem(implies(implies(implies(implies(A,B),implies(C,B)),D),implies(implies(C,A),D))).  [hyper(6,a,3,a,b,3,a)].
% 13.63/13.88  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)].
% 13.63/13.88  10 is_a_theorem(implies(implies(implies(A,B),C),implies(B,C))).  [hyper(6,a,3,a,b,1,a)].
% 13.63/13.88  14 is_a_theorem(implies(A,implies(B,implies(C,B)))).  [hyper(6,a,1,a,b,1,a)].
% 13.63/13.88  21 is_a_theorem(implies(implies(implies(A,implies(B,A)),C),C)).  [hyper(6,a,4,a,b,14,a)].
% 13.63/13.88  27 is_a_theorem(implies(A,implies(implies(A,B),B))).  [hyper(6,a,10,a,b,4,a)].
% 13.63/13.88  29 is_a_theorem(implies(not(A),implies(A,B))).  [hyper(6,a,10,a,b,2,a)].
% 13.63/13.88  31 is_a_theorem(implies(implies(implies(A,B),C),implies(not(A),C))).  [hyper(6,a,3,a,b,29,a)].
% 13.63/13.88  36 is_a_theorem(implies(implies(implies(implies(A,B),B),C),implies(A,C))).  [hyper(6,a,3,a,b,27,a)].
% 13.63/13.88  44 is_a_theorem(implies(implies(implies(implies(not(A),not(B)),implies(B,A)),C),C)).  [hyper(6,a,27,a,b,2,a)].
% 13.63/13.88  75 is_a_theorem(implies(A,A)).  [hyper(6,a,10,a,b,21,a)].
% 13.63/13.88  80 is_a_theorem(implies(implies(implies(A,A),B),B)).  [hyper(6,a,27,a,b,75,a)].
% 13.63/13.88  107 is_a_theorem(implies(implies(not(A),not(implies(B,B))),A)).  [hyper(6,a,9,a,b,80,a)].
% 13.63/13.88  351 is_a_theorem(implies(not(not(A)),A)).  [hyper(6,a,31,a,b,107,a)].
% 13.63/13.88  395 is_a_theorem(implies(implies(A,B),implies(not(not(A)),B))).  [hyper(6,a,3,a,b,351,a)].
% 13.63/13.88  396 is_a_theorem(implies(A,not(not(A)))).  [hyper(6,a,2,a,b,351,a)].
% 13.63/13.88  414 is_a_theorem(implies(implies(implies(A,not(not(A))),B),B)).  [hyper(6,a,27,a,b,396,a)].
% 13.63/13.88  1294 is_a_theorem(implies(implies(A,implies(B,C)),implies(B,implies(A,C)))).  [hyper(6,a,8,a,b,36,a)].
% 13.63/13.88  1845 is_a_theorem(implies(implies(A,B),implies(A,not(not(B))))).  [hyper(6,a,8,a,b,414,a)].
% 13.63/13.88  2161 is_a_theorem(implies(implies(A,implies(not(B),not(C))),implies(A,implies(C,B)))).  [hyper(6,a,8,a,b,44,a)].
% 13.63/13.88  4785 is_a_theorem(implies(A,implies(implies(A,B),not(not(B))))).  [hyper(6,a,36,a,b,1845,a)].
% 13.63/13.88  6559 is_a_theorem(implies(not(not(A)),implies(implies(A,B),not(not(B))))).  [hyper(6,a,395,a,b,4785,a)].
% 13.63/13.88  11112 is_a_theorem(implies(implies(A,B),implies(not(not(A)),not(not(B))))).  [hyper(6,a,1294,a,b,6559,a)].
% 13.63/13.88  12851 is_a_theorem(implies(implies(A,B),implies(not(B),not(A)))).  [hyper(6,a,2161,a,b,11112,a)].
% 13.63/13.88  12852 $F # answer(prove_mv_36).  [resolve(12851,a,5,a)].
% 13.63/13.88  
% 13.63/13.88  % SZS output end Refutation
% 13.63/13.88  ============================== end of proof ==========================
% 13.63/13.88  
% 13.63/13.88  ============================== STATISTICS ============================
% 13.63/13.88  
% 13.63/13.88  Given=2938. Generated=3806404. Kept=12851. proofs=1.
% 13.63/13.88  Usable=2938. Sos=9467. Demods=0. Limbo=6, Disabled=445. Hints=0.
% 13.63/13.88  Megabytes=9.58.
% 13.63/13.88  User_CPU=11.05, System_CPU=1.88, Wall_clock=12.
% 13.63/13.88  
% 13.63/13.88  ============================== end of statistics =====================
% 13.63/13.88  
% 13.63/13.88  ============================== end of search =========================
% 13.63/13.88  
% 13.63/13.88  THEOREM PROVED
% 13.63/13.88  % SZS status Unsatisfiable
% 13.63/13.88  
% 13.63/13.88  Exiting with 1 proof.
% 13.63/13.88  
% 13.63/13.88  Process 4991 exit (max_proofs) Mon Jul  4 04:43:06 2022
% 13.63/13.88  Prover9 interrupted
%------------------------------------------------------------------------------