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

View Problem - Process Solution

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

% Computer : n004.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:39 EDT 2022

% Result   : Unsatisfiable 1.42s 1.73s
% Output   : Refutation 1.42s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.14  % Problem  : LCL052-1 : TPTP v8.1.0. Released v1.0.0.
% 0.04/0.14  % Command  : tptp2X_and_run_prover9 %d %s
% 0.14/0.36  % Computer : n004.cluster.edu
% 0.14/0.36  % Model    : x86_64 x86_64
% 0.14/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36  % Memory   : 8042.1875MB
% 0.14/0.36  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36  % CPULimit : 300
% 0.14/0.36  % WCLimit  : 600
% 0.14/0.36  % DateTime : Mon Jul  4 15:43:38 EDT 2022
% 0.14/0.36  % CPUTime  : 
% 1.42/1.73  ============================== Prover9 ===============================
% 1.42/1.73  Prover9 (32) version 2009-11A, November 2009.
% 1.42/1.73  Process 25535 was started by sandbox2 on n004.cluster.edu,
% 1.42/1.73  Mon Jul  4 15:43:38 2022
% 1.42/1.73  The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 300 -f /tmp/Prover9_25382_n004.cluster.edu".
% 1.42/1.73  ============================== end of head ===========================
% 1.42/1.73  
% 1.42/1.73  ============================== INPUT =================================
% 1.42/1.73  
% 1.42/1.73  % Reading from file /tmp/Prover9_25382_n004.cluster.edu
% 1.42/1.73  
% 1.42/1.73  set(prolog_style_variables).
% 1.42/1.73  set(auto2).
% 1.42/1.73      % set(auto2) -> set(auto).
% 1.42/1.73      % set(auto) -> set(auto_inference).
% 1.42/1.73      % set(auto) -> set(auto_setup).
% 1.42/1.73      % set(auto_setup) -> set(predicate_elim).
% 1.42/1.73      % set(auto_setup) -> assign(eq_defs, unfold).
% 1.42/1.73      % set(auto) -> set(auto_limits).
% 1.42/1.73      % set(auto_limits) -> assign(max_weight, "100.000").
% 1.42/1.73      % set(auto_limits) -> assign(sos_limit, 20000).
% 1.42/1.73      % set(auto) -> set(auto_denials).
% 1.42/1.73      % set(auto) -> set(auto_process).
% 1.42/1.73      % set(auto2) -> assign(new_constants, 1).
% 1.42/1.73      % set(auto2) -> assign(fold_denial_max, 3).
% 1.42/1.73      % set(auto2) -> assign(max_weight, "200.000").
% 1.42/1.73      % set(auto2) -> assign(max_hours, 1).
% 1.42/1.73      % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 1.42/1.73      % set(auto2) -> assign(max_seconds, 0).
% 1.42/1.73      % set(auto2) -> assign(max_minutes, 5).
% 1.42/1.73      % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 1.42/1.73      % set(auto2) -> set(sort_initial_sos).
% 1.42/1.73      % set(auto2) -> assign(sos_limit, -1).
% 1.42/1.73      % set(auto2) -> assign(lrs_ticks, 3000).
% 1.42/1.73      % set(auto2) -> assign(max_megs, 400).
% 1.42/1.73      % set(auto2) -> assign(stats, some).
% 1.42/1.73      % set(auto2) -> clear(echo_input).
% 1.42/1.73      % set(auto2) -> set(quiet).
% 1.42/1.73      % set(auto2) -> clear(print_initial_clauses).
% 1.42/1.73      % set(auto2) -> clear(print_given).
% 1.42/1.73  assign(lrs_ticks,-1).
% 1.42/1.73  assign(sos_limit,10000).
% 1.42/1.73  assign(order,kbo).
% 1.42/1.73  set(lex_order_vars).
% 1.42/1.73  clear(print_given).
% 1.42/1.73  
% 1.42/1.73  % formulas(sos).  % not echoed (5 formulas)
% 1.42/1.73  
% 1.42/1.73  ============================== end of input ==========================
% 1.42/1.73  
% 1.42/1.73  % From the command line: assign(max_seconds, 300).
% 1.42/1.73  
% 1.42/1.73  ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 1.42/1.73  
% 1.42/1.73  % Formulas that are not ordinary clauses:
% 1.42/1.73  
% 1.42/1.73  ============================== end of process non-clausal formulas ===
% 1.42/1.73  
% 1.42/1.73  ============================== PROCESS INITIAL CLAUSES ===============
% 1.42/1.73  
% 1.42/1.73  ============================== PREDICATE ELIMINATION =================
% 1.42/1.73  
% 1.42/1.73  ============================== end predicate elimination =============
% 1.42/1.73  
% 1.42/1.73  Auto_denials:
% 1.42/1.73    % copying label prove_cn_24 to answer in negative clause
% 1.42/1.73  
% 1.42/1.73  Term ordering decisions:
% 1.42/1.73  
% 1.42/1.73  % Assigning unary symbol not kb_weight 0 and highest precedence (5).
% 1.42/1.73  Function symbol KB weights:  a=1. b=1. implies=1. not=0.
% 1.42/1.73  
% 1.42/1.73  ============================== end of process initial clauses ========
% 1.42/1.73  
% 1.42/1.73  ============================== CLAUSES FOR SEARCH ====================
% 1.42/1.73  
% 1.42/1.73  ============================== end of clauses for search =============
% 1.42/1.73  
% 1.42/1.73  ============================== SEARCH ================================
% 1.42/1.73  
% 1.42/1.73  % Starting search at 0.01 seconds.
% 1.42/1.73  
% 1.42/1.73  Low Water (keep): wt=35.000, iters=3372
% 1.42/1.73  
% 1.42/1.73  Low Water (keep): wt=33.000, iters=3366
% 1.42/1.73  
% 1.42/1.73  Low Water (keep): wt=31.000, iters=3353
% 1.42/1.73  
% 1.42/1.73  Low Water (keep): wt=27.000, iters=3394
% 1.42/1.73  
% 1.42/1.73  Low Water (keep): wt=26.000, iters=3433
% 1.42/1.73  
% 1.42/1.73  Low Water (keep): wt=25.000, iters=3383
% 1.42/1.73  
% 1.42/1.73  Low Water (keep): wt=23.000, iters=3333
% 1.42/1.73  
% 1.42/1.73  Low Water (keep): wt=22.000, iters=3344
% 1.42/1.73  
% 1.42/1.73  Low Water (keep): wt=21.000, iters=3366
% 1.42/1.73  
% 1.42/1.73  Low Water (keep): wt=20.000, iters=3356
% 1.42/1.73  
% 1.42/1.73  Low Water (keep): wt=19.000, iters=3380
% 1.42/1.73  
% 1.42/1.73  Low Water (keep): wt=18.000, iters=3435
% 1.42/1.73  
% 1.42/1.73  Low Water (keep): wt=17.000, iters=3344
% 1.42/1.73  
% 1.42/1.73  Low Water (displace): id=4352, wt=63.000
% 1.42/1.73  
% 1.42/1.73  Low Water (displace): id=1375, wt=59.000
% 1.42/1.73  
% 1.42/1.73  Low Water (displace): id=4355, wt=57.000
% 1.42/1.73  
% 1.42/1.73  Low Water (displace): id=2941, wt=49.000
% 1.42/1.73  
% 1.42/1.73  Low Water (displace): id=4228, wt=47.000
% 1.42/1.73  
% 1.42/1.73  Low Water (displace): id=10627, wt=14.000
% 1.42/1.73  
% 1.42/1.73  Low Water (displace): id=10634, wt=13.000
% 1.42/1.73  
% 1.42/1.73  Low Water (displace): id=10741, wt=11.000
% 1.42/1.73  
% 1.42/1.73  ============================== PROOF =================================
% 1.42/1.73  % SZS status Unsatisfiable
% 1.42/1.73  % SZS output start Refutation
% 1.42/1.73  
% 1.42/1.73  % Proof 1 at 0.67 (+ 0.03) seconds: prove_cn_24.
% 1.42/1.73  % Length of proof is 32.
% 1.42/1.73  % Level of proof is 18.
% 1.42/1.73  % Maximum clause weight is 17.000.
% 1.42/1.73  % Given clauses 339.
% 1.42/1.73  
% 1.42/1.73  1 is_a_theorem(implies(implies(not(A),A),A)) # label(cn_2) # label(axiom).  [assumption].
% 1.42/1.73  2 is_a_theorem(implies(A,implies(not(A),B))) # label(cn_3) # label(axiom).  [assumption].
% 1.42/1.73  3 is_a_theorem(implies(implies(A,B),implies(implies(B,C),implies(A,C)))) # label(cn_1) # label(axiom).  [assumption].
% 1.42/1.73  4 -is_a_theorem(implies(implies(implies(a,b),a),a)) # label(prove_cn_24) # label(negated_conjecture) # answer(prove_cn_24).  [assumption].
% 1.42/1.73  5 -is_a_theorem(implies(A,B)) | -is_a_theorem(A) | is_a_theorem(B) # label(condensed_detachment) # label(axiom).  [assumption].
% 1.42/1.73  6 is_a_theorem(implies(implies(implies(implies(A,B),implies(C,B)),D),implies(implies(C,A),D))).  [hyper(5,a,3,a,b,3,a)].
% 1.42/1.73  7 is_a_theorem(implies(implies(implies(not(A),B),C),implies(A,C))).  [hyper(5,a,3,a,b,2,a)].
% 1.42/1.73  8 is_a_theorem(implies(implies(A,B),implies(implies(not(A),A),B))).  [hyper(5,a,3,a,b,1,a)].
% 1.42/1.73  12 is_a_theorem(implies(implies(A,implies(B,C)),implies(implies(D,B),implies(A,implies(D,C))))).  [hyper(5,a,6,a,b,6,a)].
% 1.42/1.73  21 is_a_theorem(implies(implies(A,not(B)),implies(B,implies(A,C)))).  [hyper(5,a,6,a,b,7,a)].
% 1.42/1.73  26 is_a_theorem(implies(A,A)).  [hyper(5,a,7,a,b,1,a)].
% 1.42/1.73  27 is_a_theorem(implies(not(implies(A,A)),B)).  [hyper(5,a,2,a,b,26,a)].
% 1.42/1.73  37 is_a_theorem(implies(implies(not(implies(A,B)),implies(A,B)),implies(implies(B,C),implies(A,C)))).  [hyper(5,a,8,a,b,3,a)].
% 1.42/1.73  68 is_a_theorem(implies(A,implies(B,implies(not(A),C)))).  [hyper(5,a,7,a,b,21,a)].
% 1.42/1.73  69 is_a_theorem(implies(implies(implies(A,implies(B,C)),D),implies(implies(B,not(A)),D))).  [hyper(5,a,3,a,b,21,a)].
% 1.42/1.73  72 is_a_theorem(implies(A,implies(not(implies(B,B)),C))).  [hyper(5,a,21,a,b,27,a)].
% 1.42/1.73  81 is_a_theorem(implies(implies(implies(A,implies(not(B),C)),D),implies(B,D))).  [hyper(5,a,3,a,b,68,a)].
% 1.42/1.73  95 is_a_theorem(implies(implies(implies(not(implies(A,A)),B),C),implies(D,C))).  [hyper(5,a,3,a,b,72,a)].
% 1.42/1.73  460 is_a_theorem(implies(A,implies(B,B))).  [hyper(5,a,95,a,b,1,a)].
% 1.42/1.73  469 is_a_theorem(implies(implies(A,B),implies(C,implies(A,B)))).  [hyper(5,a,12,a,b,460,a)].
% 1.42/1.73  550 is_a_theorem(implies(A,implies(implies(not(B),B),B))).  [hyper(5,a,469,a,b,1,a)].
% 1.42/1.73  588 is_a_theorem(implies(implies(A,implies(not(B),B)),implies(C,implies(A,B)))).  [hyper(5,a,12,a,b,550,a)].
% 1.42/1.73  1506 is_a_theorem(implies(A,implies(B,implies(C,A)))).  [hyper(5,a,81,a,b,588,a)].
% 1.42/1.73  1534 is_a_theorem(implies(A,implies(B,implies(C,B)))).  [hyper(5,a,588,a,b,1506,a)].
% 1.42/1.73  1622 is_a_theorem(implies(implies(implies(A,B),C),implies(B,C))).  [hyper(5,a,37,a,b,1534,a)].
% 1.42/1.73  5016 is_a_theorem(implies(implies(not(A),not(B)),implies(C,implies(B,A)))).  [hyper(5,a,69,a,b,588,a)].
% 1.42/1.73  5106 is_a_theorem(implies(not(A),implies(B,implies(A,C)))).  [hyper(5,a,1622,a,b,5016,a)].
% 1.42/1.73  5143 is_a_theorem(implies(A,implies(not(B),implies(B,C)))).  [hyper(5,a,588,a,b,5106,a)].
% 1.42/1.73  5187 is_a_theorem(implies(implies(implies(A,B),C),implies(not(A),C))).  [hyper(5,a,37,a,b,5143,a)].
% 1.42/1.73  10677 is_a_theorem(implies(A,implies(implies(implies(B,C),B),B))).  [hyper(5,a,588,a,b,5187,a)].
% 1.42/1.73  10977 is_a_theorem(implies(implies(implies(A,B),A),A)).  [hyper(5,a,10677,a,b,10677,a)].
% 1.42/1.73  10978 $F # answer(prove_cn_24).  [resolve(10977,a,4,a)].
% 1.42/1.73  
% 1.42/1.73  % SZS output end Refutation
% 1.42/1.73  ============================== end of proof ==========================
% 1.42/1.73  
% 1.42/1.73  ============================== STATISTICS ============================
% 1.42/1.73  
% 1.42/1.73  Given=339. Generated=54155. Kept=10977. proofs=1.
% 1.42/1.73  Usable=328. Sos=9999. Demods=0. Limbo=0, Disabled=654. Hints=0.
% 1.42/1.73  Megabytes=9.95.
% 1.42/1.73  User_CPU=0.67, System_CPU=0.03, Wall_clock=1.
% 1.42/1.73  
% 1.42/1.73  ============================== end of statistics =====================
% 1.42/1.73  
% 1.42/1.73  ============================== end of search =========================
% 1.42/1.73  
% 1.42/1.73  THEOREM PROVED
% 1.42/1.73  % SZS status Unsatisfiable
% 1.42/1.73  
% 1.42/1.73  Exiting with 1 proof.
% 1.42/1.73  
% 1.42/1.73  Process 25535 exit (max_proofs) Mon Jul  4 15:43:39 2022
% 1.42/1.73  Prover9 interrupted
%------------------------------------------------------------------------------