TSTP Solution File: LCL110-2 by Prover9---1109a

View Problem - Process Solution

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

% Computer : n021.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:06 EDT 2022

% Result   : Unsatisfiable 0.68s 0.99s
% Output   : Refutation 0.68s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11  % Problem  : LCL110-2 : TPTP v8.1.0. Released v1.0.0.
% 0.03/0.12  % Command  : tptp2X_and_run_prover9 %d %s
% 0.12/0.33  % Computer : n021.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 19:37:47 EDT 2022
% 0.12/0.33  % CPUTime  : 
% 0.68/0.99  ============================== Prover9 ===============================
% 0.68/0.99  Prover9 (32) version 2009-11A, November 2009.
% 0.68/0.99  Process 2271 was started by sandbox2 on n021.cluster.edu,
% 0.68/0.99  Mon Jul  4 19:37:47 2022
% 0.68/0.99  The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 300 -f /tmp/Prover9_2117_n021.cluster.edu".
% 0.68/0.99  ============================== end of head ===========================
% 0.68/0.99  
% 0.68/0.99  ============================== INPUT =================================
% 0.68/0.99  
% 0.68/0.99  % Reading from file /tmp/Prover9_2117_n021.cluster.edu
% 0.68/0.99  
% 0.68/0.99  set(prolog_style_variables).
% 0.68/0.99  set(auto2).
% 0.68/0.99      % set(auto2) -> set(auto).
% 0.68/0.99      % set(auto) -> set(auto_inference).
% 0.68/0.99      % set(auto) -> set(auto_setup).
% 0.68/0.99      % set(auto_setup) -> set(predicate_elim).
% 0.68/0.99      % set(auto_setup) -> assign(eq_defs, unfold).
% 0.68/0.99      % set(auto) -> set(auto_limits).
% 0.68/0.99      % set(auto_limits) -> assign(max_weight, "100.000").
% 0.68/0.99      % set(auto_limits) -> assign(sos_limit, 20000).
% 0.68/0.99      % set(auto) -> set(auto_denials).
% 0.68/0.99      % set(auto) -> set(auto_process).
% 0.68/0.99      % set(auto2) -> assign(new_constants, 1).
% 0.68/0.99      % set(auto2) -> assign(fold_denial_max, 3).
% 0.68/0.99      % set(auto2) -> assign(max_weight, "200.000").
% 0.68/0.99      % set(auto2) -> assign(max_hours, 1).
% 0.68/0.99      % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.68/0.99      % set(auto2) -> assign(max_seconds, 0).
% 0.68/0.99      % set(auto2) -> assign(max_minutes, 5).
% 0.68/0.99      % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.68/0.99      % set(auto2) -> set(sort_initial_sos).
% 0.68/0.99      % set(auto2) -> assign(sos_limit, -1).
% 0.68/0.99      % set(auto2) -> assign(lrs_ticks, 3000).
% 0.68/0.99      % set(auto2) -> assign(max_megs, 400).
% 0.68/0.99      % set(auto2) -> assign(stats, some).
% 0.68/0.99      % set(auto2) -> clear(echo_input).
% 0.68/0.99      % set(auto2) -> set(quiet).
% 0.68/0.99      % set(auto2) -> clear(print_initial_clauses).
% 0.68/0.99      % set(auto2) -> clear(print_given).
% 0.68/0.99  assign(lrs_ticks,-1).
% 0.68/0.99  assign(sos_limit,10000).
% 0.68/0.99  assign(order,kbo).
% 0.68/0.99  set(lex_order_vars).
% 0.68/0.99  clear(print_given).
% 0.68/0.99  
% 0.68/0.99  % formulas(sos).  % not echoed (5 formulas)
% 0.68/0.99  
% 0.68/0.99  ============================== end of input ==========================
% 0.68/0.99  
% 0.68/0.99  % From the command line: assign(max_seconds, 300).
% 0.68/0.99  
% 0.68/0.99  ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.68/0.99  
% 0.68/0.99  % Formulas that are not ordinary clauses:
% 0.68/0.99  
% 0.68/0.99  ============================== end of process non-clausal formulas ===
% 0.68/0.99  
% 0.68/0.99  ============================== PROCESS INITIAL CLAUSES ===============
% 0.68/0.99  
% 0.68/0.99  ============================== PREDICATE ELIMINATION =================
% 0.68/0.99  
% 0.68/0.99  ============================== end predicate elimination =============
% 0.68/0.99  
% 0.68/0.99  Auto_denials:
% 0.68/0.99    % copying label prove_mv_24 to answer in negative clause
% 0.68/0.99  
% 0.68/0.99  Term ordering decisions:
% 0.68/0.99  
% 0.68/0.99  % Assigning unary symbol not kb_weight 0 and highest precedence (5).
% 0.68/0.99  Function symbol KB weights:  truth=1. x=1. implies=1. not=0.
% 0.68/0.99  
% 0.68/0.99  ============================== end of process initial clauses ========
% 0.68/0.99  
% 0.68/0.99  ============================== CLAUSES FOR SEARCH ====================
% 0.68/0.99  
% 0.68/0.99  ============================== end of clauses for search =============
% 0.68/0.99  
% 0.68/0.99  ============================== SEARCH ================================
% 0.68/0.99  
% 0.68/0.99  % Starting search at 0.01 seconds.
% 0.68/0.99  
% 0.68/0.99  ============================== PROOF =================================
% 0.68/0.99  % SZS status Unsatisfiable
% 0.68/0.99  % SZS output start Refutation
% 0.68/0.99  
% 0.68/0.99  % Proof 1 at 0.03 (+ 0.00) seconds: prove_mv_24.
% 0.68/0.99  % Length of proof is 24.
% 0.68/0.99  % Level of proof is 12.
% 0.68/0.99  % Maximum clause weight is 15.000.
% 0.68/0.99  % Given clauses 28.
% 0.68/0.99  
% 0.68/0.99  1 implies(truth,A) = A # label(wajsberg_1) # label(axiom).  [assumption].
% 0.68/0.99  2 implies(implies(A,B),B) = implies(implies(B,A),A) # label(wajsberg_3) # label(axiom).  [assumption].
% 0.68/0.99  3 implies(implies(not(A),not(B)),implies(B,A)) = truth # label(wajsberg_4) # label(axiom).  [assumption].
% 0.68/0.99  4 implies(implies(A,B),implies(implies(B,C),implies(A,C))) = truth # label(wajsberg_2) # label(axiom).  [assumption].
% 0.68/0.99  5 implies(not(not(x)),x) != truth # label(prove_mv_24) # label(negated_conjecture) # answer(prove_mv_24).  [assumption].
% 0.68/0.99  6 implies(implies(A,truth),truth) = implies(A,A).  [para(1(a,1),2(a,1,1)),flip(a)].
% 0.68/0.99  7 implies(implies(implies(A,B),B),B) = implies(implies(implies(B,A),A),B).  [para(2(a,1),2(a,1,1)),rewrite([2(7)]),flip(a)].
% 0.68/0.99  8 implies(implies(not(A),not(truth)),A) = truth.  [para(1(a,1),3(a,1,2))].
% 0.68/0.99  10 implies(implies(not(A),not(implies(B,A))),implies(implies(A,B),B)) = truth.  [para(2(a,1),3(a,1,2))].
% 0.68/0.99  12 implies(A,implies(implies(A,B),B)) = truth.  [para(1(a,1),4(a,1,1)),rewrite([1(3)])].
% 0.68/0.99  13 implies(implies(A,truth),implies(B,implies(A,B))) = truth.  [para(1(a,1),4(a,1,2,1))].
% 0.68/0.99  46 implies(A,A) = truth.  [para(12(a,1),1(a,1)),rewrite([1(3)]),flip(a)].
% 0.68/0.99  55 implies(A,truth) = truth.  [para(6(a,1),12(a,1,2)),rewrite([46(1)])].
% 0.68/0.99  56 implies(A,implies(B,A)) = truth.  [back_rewrite(13),rewrite([55(2),1(4)])].
% 0.68/0.99  57 implies(implies(implies(A,B),B),A) = implies(B,A).  [para(7(a,1),2(a,1)),rewrite([56(5),1(6)])].
% 0.68/0.99  74 implies(implies(implies(A,B),C),implies(B,C)) = truth.  [para(56(a,1),4(a,1,1)),rewrite([1(6)])].
% 0.68/0.99  76 implies(not(truth),not(not(truth))) = not(not(truth)).  [para(8(a,1),57(a,1,1)),rewrite([1(5)]),flip(a)].
% 0.68/0.99  95 implies(not(truth),A) = truth.  [para(8(a,1),74(a,1,1)),rewrite([1(5)])].
% 0.68/0.99  104 not(not(truth)) = truth.  [back_rewrite(76),rewrite([95(6)]),flip(a)].
% 0.68/0.99  115 implies(not(implies(A,not(truth))),A) = truth.  [para(104(a,1),10(a,1,1,1)),rewrite([1(6),95(7),1(6)])].
% 0.68/0.99  135 implies(A,implies(not(A),not(truth))) = truth.  [para(115(a,1),3(a,1,1)),rewrite([1(7)])].
% 0.68/0.99  172 implies(not(A),not(truth)) = A.  [para(135(a,1),2(a,1,1)),rewrite([1(6),8(9),1(6)])].
% 0.68/0.99  174 implies(not(not(A)),A) = truth.  [para(172(a,1),3(a,1,2)),rewrite([104(3),1(4)])].
% 0.68/0.99  175 $F # answer(prove_mv_24).  [resolve(174,a,5,a)].
% 0.68/0.99  
% 0.68/0.99  % SZS output end Refutation
% 0.68/0.99  ============================== end of proof ==========================
% 0.68/0.99  
% 0.68/0.99  ============================== STATISTICS ============================
% 0.68/0.99  
% 0.68/0.99  Given=28. Generated=977. Kept=174. proofs=1.
% 0.68/0.99  Usable=22. Sos=91. Demods=109. Limbo=1, Disabled=64. Hints=0.
% 0.68/0.99  Megabytes=0.21.
% 0.68/0.99  User_CPU=0.03, System_CPU=0.00, Wall_clock=0.
% 0.68/0.99  
% 0.68/0.99  ============================== end of statistics =====================
% 0.68/0.99  
% 0.68/0.99  ============================== end of search =========================
% 0.68/0.99  
% 0.68/0.99  THEOREM PROVED
% 0.68/0.99  % SZS status Unsatisfiable
% 0.68/0.99  
% 0.68/0.99  Exiting with 1 proof.
% 0.68/0.99  
% 0.68/0.99  Process 2271 exit (max_proofs) Mon Jul  4 19:37:47 2022
% 0.68/0.99  Prover9 interrupted
%------------------------------------------------------------------------------