TSTP Solution File: LCL258-3 by Prover9---1109a

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Prover9---1109a
% Problem  : LCL258-3 : TPTP v8.1.0. Released v2.3.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : tptp2X_and_run_prover9 %d %s

% Computer : n012.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:45:33 EDT 2022

% Result   : Unsatisfiable 0.71s 0.97s
% Output   : Refutation 0.71s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11  % Problem  : LCL258-3 : TPTP v8.1.0. Released v2.3.0.
% 0.03/0.12  % Command  : tptp2X_and_run_prover9 %d %s
% 0.13/0.33  % Computer : n012.cluster.edu
% 0.13/0.33  % Model    : x86_64 x86_64
% 0.13/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33  % Memory   : 8042.1875MB
% 0.13/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33  % CPULimit : 300
% 0.13/0.33  % WCLimit  : 600
% 0.13/0.33  % DateTime : Mon Jul  4 08:18:46 EDT 2022
% 0.13/0.33  % CPUTime  : 
% 0.71/0.97  ============================== Prover9 ===============================
% 0.71/0.97  Prover9 (32) version 2009-11A, November 2009.
% 0.71/0.97  Process 7416 was started by sandbox on n012.cluster.edu,
% 0.71/0.97  Mon Jul  4 08:18:46 2022
% 0.71/0.97  The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_7263_n012.cluster.edu".
% 0.71/0.97  ============================== end of head ===========================
% 0.71/0.97  
% 0.71/0.97  ============================== INPUT =================================
% 0.71/0.97  
% 0.71/0.97  % Reading from file /tmp/Prover9_7263_n012.cluster.edu
% 0.71/0.97  
% 0.71/0.97  set(prolog_style_variables).
% 0.71/0.97  set(auto2).
% 0.71/0.97      % set(auto2) -> set(auto).
% 0.71/0.97      % set(auto) -> set(auto_inference).
% 0.71/0.97      % set(auto) -> set(auto_setup).
% 0.71/0.97      % set(auto_setup) -> set(predicate_elim).
% 0.71/0.97      % set(auto_setup) -> assign(eq_defs, unfold).
% 0.71/0.97      % set(auto) -> set(auto_limits).
% 0.71/0.97      % set(auto_limits) -> assign(max_weight, "100.000").
% 0.71/0.97      % set(auto_limits) -> assign(sos_limit, 20000).
% 0.71/0.97      % set(auto) -> set(auto_denials).
% 0.71/0.97      % set(auto) -> set(auto_process).
% 0.71/0.97      % set(auto2) -> assign(new_constants, 1).
% 0.71/0.97      % set(auto2) -> assign(fold_denial_max, 3).
% 0.71/0.97      % set(auto2) -> assign(max_weight, "200.000").
% 0.71/0.97      % set(auto2) -> assign(max_hours, 1).
% 0.71/0.97      % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.71/0.97      % set(auto2) -> assign(max_seconds, 0).
% 0.71/0.97      % set(auto2) -> assign(max_minutes, 5).
% 0.71/0.97      % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.71/0.97      % set(auto2) -> set(sort_initial_sos).
% 0.71/0.97      % set(auto2) -> assign(sos_limit, -1).
% 0.71/0.97      % set(auto2) -> assign(lrs_ticks, 3000).
% 0.71/0.97      % set(auto2) -> assign(max_megs, 400).
% 0.71/0.97      % set(auto2) -> assign(stats, some).
% 0.71/0.97      % set(auto2) -> clear(echo_input).
% 0.71/0.97      % set(auto2) -> set(quiet).
% 0.71/0.97      % set(auto2) -> clear(print_initial_clauses).
% 0.71/0.97      % set(auto2) -> clear(print_given).
% 0.71/0.97  assign(lrs_ticks,-1).
% 0.71/0.97  assign(sos_limit,10000).
% 0.71/0.97  assign(order,kbo).
% 0.71/0.97  set(lex_order_vars).
% 0.71/0.97  clear(print_given).
% 0.71/0.97  
% 0.71/0.97  % formulas(sos).  % not echoed (9 formulas)
% 0.71/0.97  
% 0.71/0.97  ============================== end of input ==========================
% 0.71/0.97  
% 0.71/0.97  % From the command line: assign(max_seconds, 300).
% 0.71/0.97  
% 0.71/0.97  ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.71/0.97  
% 0.71/0.97  % Formulas that are not ordinary clauses:
% 0.71/0.97  
% 0.71/0.97  ============================== end of process non-clausal formulas ===
% 0.71/0.97  
% 0.71/0.97  ============================== PROCESS INITIAL CLAUSES ===============
% 0.71/0.97  
% 0.71/0.97  ============================== PREDICATE ELIMINATION =================
% 0.71/0.97  1 theorem(A) | -axiom(A) # label(rule_1) # label(axiom).  [assumption].
% 0.71/0.97  2 axiom(implies(or(A,A),A)) # label(axiom_1_2) # label(axiom).  [assumption].
% 0.71/0.97  3 axiom(implies(A,or(B,A))) # label(axiom_1_3) # label(axiom).  [assumption].
% 0.71/0.97  4 axiom(implies(or(A,B),or(B,A))) # label(axiom_1_4) # label(axiom).  [assumption].
% 0.71/0.97  5 axiom(implies(or(A,or(B,C)),or(B,or(A,C)))) # label(axiom_1_5) # label(axiom).  [assumption].
% 0.71/0.97  6 axiom(implies(implies(A,B),implies(or(C,A),or(C,B)))) # label(axiom_1_6) # label(axiom).  [assumption].
% 0.71/0.97  Derived: theorem(implies(or(A,A),A)).  [resolve(1,b,2,a)].
% 0.71/0.97  Derived: theorem(implies(A,or(B,A))).  [resolve(1,b,3,a)].
% 0.71/0.97  Derived: theorem(implies(or(A,B),or(B,A))).  [resolve(1,b,4,a)].
% 0.71/0.97  Derived: theorem(implies(or(A,or(B,C)),or(B,or(A,C)))).  [resolve(1,b,5,a)].
% 0.71/0.97  Derived: theorem(implies(implies(A,B),implies(or(C,A),or(C,B)))).  [resolve(1,b,6,a)].
% 0.71/0.97  
% 0.71/0.97  ============================== end predicate elimination =============
% 0.71/0.97  
% 0.71/0.97  Auto_denials:
% 0.71/0.97    % copying label prove_this to answer in negative clause
% 0.71/0.97  
% 0.71/0.97  Term ordering decisions:
% 0.71/0.97  
% 0.71/0.97  % Assigning unary symbol not kb_weight 0 and highest precedence (7).
% 0.71/0.97  Function symbol KB weights:  p=1. q=1. or=1. implies=1. not=0.
% 0.71/0.97  
% 0.71/0.97  ============================== end of process initial clauses ========
% 0.71/0.97  
% 0.71/0.97  ============================== CLAUSES FOR SEARCH ====================
% 0.71/0.97  
% 0.71/0.97  ============================== end of clauses for search =============
% 0.71/0.97  
% 0.71/0.97  ============================== SEARCH ================================
% 0.71/0.97  
% 0.71/0.97  % Starting search at 0.01 seconds.
% 0.71/0.97  
% 0.71/0.97  ============================== PROOF =================================
% 0.71/0.97  % SZS status Unsatisfiable
% 0.71/0.97  % SZS output start Refutation
% 0.71/0.97  
% 0.71/0.97  % Proof 1 at 0.02 (+ 0.00) seconds: prove_this.
% 0.71/0.97  % Length of proof is 16.
% 0.71/0.97  % Level of proof is 5.
% 0.71/0.97  % Maximum clause weight is 13.000.
% 0.71/0.97  % Given clauses 16.
% 0.71/0.97  
% 0.71/0.97  1 theorem(A) | -axiom(A) # label(rule_1) # label(axiom).  [assumption].
% 0.71/0.97  3 axiom(implies(A,or(B,A))) # label(axiom_1_3) # label(axiom).  [assumption].
% 0.71/0.97  5 axiom(implies(or(A,or(B,C)),or(B,or(A,C)))) # label(axiom_1_5) # label(axiom).  [assumption].
% 0.71/0.97  7 implies(A,B) = or(not(A),B) # label(implies_definition) # label(axiom).  [assumption].
% 0.71/0.97  8 -theorem(implies(p,implies(implies(p,q),q))) # label(prove_this) # label(negated_conjecture) # answer(prove_this).  [assumption].
% 0.71/0.97  9 -theorem(or(not(p),or(not(or(not(p),q)),q))) # answer(prove_this).  [copy(8),rewrite([7(4),7(7),7(9)])].
% 0.71/0.97  10 theorem(A) | -theorem(implies(B,A)) | -theorem(B) # label(rule_2) # label(axiom).  [assumption].
% 0.71/0.97  11 theorem(A) | -theorem(or(not(B),A)) | -theorem(B).  [copy(10),rewrite([7(2)])].
% 0.71/0.97  14 theorem(implies(A,or(B,A))).  [resolve(1,b,3,a)].
% 0.71/0.97  15 theorem(or(not(A),or(B,A))).  [copy(14),rewrite([7(2)])].
% 0.71/0.97  18 theorem(implies(or(A,or(B,C)),or(B,or(A,C)))).  [resolve(1,b,5,a)].
% 0.71/0.97  19 theorem(or(not(or(A,or(B,C))),or(B,or(A,C)))).  [copy(18),rewrite([7(5)])].
% 0.71/0.97  38 theorem(or(A,or(not(B),B))).  [hyper(11,b,19,a,c,15,a)].
% 0.71/0.97  41 -theorem(or(not(or(not(p),q)),or(not(p),q))) # answer(prove_this).  [ur(11,a,9,a,b,19,a)].
% 0.71/0.97  108 theorem(or(not(A),A)).  [hyper(11,b,38,a,c,38,a)].
% 0.71/0.97  109 $F # answer(prove_this).  [resolve(108,a,41,a)].
% 0.71/0.97  
% 0.71/0.97  % SZS output end Refutation
% 0.71/0.97  ============================== end of proof ==========================
% 0.71/0.97  
% 0.71/0.97  ============================== STATISTICS ============================
% 0.71/0.97  
% 0.71/0.97  Given=16. Generated=107. Kept=95. proofs=1.
% 0.71/0.97  Usable=16. Sos=78. Demods=1. Limbo=0, Disabled=14. Hints=0.
% 0.71/0.97  Megabytes=0.14.
% 0.71/0.97  User_CPU=0.02, System_CPU=0.00, Wall_clock=0.
% 0.71/0.97  
% 0.71/0.97  ============================== end of statistics =====================
% 0.71/0.97  
% 0.71/0.97  ============================== end of search =========================
% 0.71/0.97  
% 0.71/0.97  THEOREM PROVED
% 0.71/0.97  % SZS status Unsatisfiable
% 0.71/0.97  
% 0.71/0.97  Exiting with 1 proof.
% 0.71/0.97  
% 0.71/0.97  Process 7416 exit (max_proofs) Mon Jul  4 08:18:46 2022
% 0.71/0.97  Prover9 interrupted
%------------------------------------------------------------------------------