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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Prover9---1109a
% Problem  : LAT094-1 : TPTP v8.1.0. Released v2.6.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 06:25:32 EDT 2022

% Result   : Unsatisfiable 1.06s 1.35s
% Output   : Refutation 1.06s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12  % Problem  : LAT094-1 : TPTP v8.1.0. Released v2.6.0.
% 0.11/0.13  % Command  : tptp2X_and_run_prover9 %d %s
% 0.13/0.34  % Computer : n004.cluster.edu
% 0.13/0.34  % Model    : x86_64 x86_64
% 0.13/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34  % Memory   : 8042.1875MB
% 0.13/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34  % CPULimit : 300
% 0.13/0.34  % WCLimit  : 600
% 0.13/0.34  % DateTime : Wed Jun 29 00:16:53 EDT 2022
% 0.13/0.34  % CPUTime  : 
% 1.06/1.35  ============================== Prover9 ===============================
% 1.06/1.35  Prover9 (32) version 2009-11A, November 2009.
% 1.06/1.35  Process 8440 was started by sandbox2 on n004.cluster.edu,
% 1.06/1.35  Wed Jun 29 00:16:53 2022
% 1.06/1.35  The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 300 -f /tmp/Prover9_8287_n004.cluster.edu".
% 1.06/1.35  ============================== end of head ===========================
% 1.06/1.35  
% 1.06/1.35  ============================== INPUT =================================
% 1.06/1.35  
% 1.06/1.35  % Reading from file /tmp/Prover9_8287_n004.cluster.edu
% 1.06/1.35  
% 1.06/1.35  set(prolog_style_variables).
% 1.06/1.35  set(auto2).
% 1.06/1.35      % set(auto2) -> set(auto).
% 1.06/1.35      % set(auto) -> set(auto_inference).
% 1.06/1.35      % set(auto) -> set(auto_setup).
% 1.06/1.35      % set(auto_setup) -> set(predicate_elim).
% 1.06/1.35      % set(auto_setup) -> assign(eq_defs, unfold).
% 1.06/1.35      % set(auto) -> set(auto_limits).
% 1.06/1.35      % set(auto_limits) -> assign(max_weight, "100.000").
% 1.06/1.35      % set(auto_limits) -> assign(sos_limit, 20000).
% 1.06/1.35      % set(auto) -> set(auto_denials).
% 1.06/1.35      % set(auto) -> set(auto_process).
% 1.06/1.35      % set(auto2) -> assign(new_constants, 1).
% 1.06/1.35      % set(auto2) -> assign(fold_denial_max, 3).
% 1.06/1.35      % set(auto2) -> assign(max_weight, "200.000").
% 1.06/1.35      % set(auto2) -> assign(max_hours, 1).
% 1.06/1.35      % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 1.06/1.35      % set(auto2) -> assign(max_seconds, 0).
% 1.06/1.35      % set(auto2) -> assign(max_minutes, 5).
% 1.06/1.35      % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 1.06/1.35      % set(auto2) -> set(sort_initial_sos).
% 1.06/1.35      % set(auto2) -> assign(sos_limit, -1).
% 1.06/1.35      % set(auto2) -> assign(lrs_ticks, 3000).
% 1.06/1.35      % set(auto2) -> assign(max_megs, 400).
% 1.06/1.35      % set(auto2) -> assign(stats, some).
% 1.06/1.35      % set(auto2) -> clear(echo_input).
% 1.06/1.35      % set(auto2) -> set(quiet).
% 1.06/1.35      % set(auto2) -> clear(print_initial_clauses).
% 1.06/1.35      % set(auto2) -> clear(print_given).
% 1.06/1.35  assign(lrs_ticks,-1).
% 1.06/1.35  assign(sos_limit,10000).
% 1.06/1.35  assign(order,kbo).
% 1.06/1.35  set(lex_order_vars).
% 1.06/1.35  clear(print_given).
% 1.06/1.35  
% 1.06/1.35  % formulas(sos).  % not echoed (2 formulas)
% 1.06/1.35  
% 1.06/1.35  ============================== end of input ==========================
% 1.06/1.35  
% 1.06/1.35  % From the command line: assign(max_seconds, 300).
% 1.06/1.35  
% 1.06/1.35  ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 1.06/1.35  
% 1.06/1.35  % Formulas that are not ordinary clauses:
% 1.06/1.35  
% 1.06/1.35  ============================== end of process non-clausal formulas ===
% 1.06/1.35  
% 1.06/1.35  ============================== PROCESS INITIAL CLAUSES ===============
% 1.06/1.35  
% 1.06/1.35  ============================== PREDICATE ELIMINATION =================
% 1.06/1.35  
% 1.06/1.35  ============================== end predicate elimination =============
% 1.06/1.35  
% 1.06/1.35  Auto_denials:
% 1.06/1.35    % copying label prove_wal_axioms_3 to answer in negative clause
% 1.06/1.35  
% 1.06/1.35  Term ordering decisions:
% 1.06/1.35  Function symbol KB weights:  a=1. join=1. meet=1.
% 1.06/1.35  
% 1.06/1.35  ============================== end of process initial clauses ========
% 1.06/1.35  
% 1.06/1.35  ============================== CLAUSES FOR SEARCH ====================
% 1.06/1.35  
% 1.06/1.35  ============================== end of clauses for search =============
% 1.06/1.35  
% 1.06/1.35  ============================== SEARCH ================================
% 1.06/1.35  
% 1.06/1.35  % Starting search at 0.01 seconds.
% 1.06/1.35  
% 1.06/1.35  ============================== PROOF =================================
% 1.06/1.35  % SZS status Unsatisfiable
% 1.06/1.35  % SZS output start Refutation
% 1.06/1.35  
% 1.06/1.35  % Proof 1 at 0.37 (+ 0.01) seconds: prove_wal_axioms_3.
% 1.06/1.35  % Length of proof is 27.
% 1.06/1.35  % Level of proof is 16.
% 1.06/1.35  % Maximum clause weight is 155.000.
% 1.06/1.35  % Given clauses 34.
% 1.06/1.35  
% 1.06/1.35  1 join(meet(join(meet(A,B),meet(B,join(A,B))),C),meet(join(meet(A,join(join(meet(B,D),meet(E,B)),B)),meet(join(meet(B,meet(meet(join(B,D),join(E,B)),B)),meet(F,join(B,meet(meet(join(B,D),join(E,B)),B)))),join(A,join(join(meet(B,D),meet(E,B)),B)))),join(join(meet(A,B),meet(B,join(A,B))),C))) = B # label(single_axiom) # label(axiom).  [assumption].
% 1.06/1.35  2 join(a,a) != a # label(prove_wal_axioms_3) # label(negated_conjecture) # answer(prove_wal_axioms_3).  [assumption].
% 1.06/1.35  3 join(meet(join(meet(A,join(meet(B,C),meet(C,join(B,C)))),meet(join(meet(B,C),meet(C,join(B,C))),join(A,join(meet(B,C),meet(C,join(B,C)))))),D),meet(join(meet(A,join(join(meet(join(meet(B,C),meet(C,join(B,C))),E),meet(F,join(meet(B,C),meet(C,join(B,C))))),join(meet(B,C),meet(C,join(B,C))))),meet(C,join(A,join(join(meet(join(meet(B,C),meet(C,join(B,C))),E),meet(F,join(meet(B,C),meet(C,join(B,C))))),join(meet(B,C),meet(C,join(B,C))))))),join(join(meet(A,join(meet(B,C),meet(C,join(B,C)))),meet(join(meet(B,C),meet(C,join(B,C))),join(A,join(meet(B,C),meet(C,join(B,C)))))),D))) = join(meet(B,C),meet(C,join(B,C))).  [para(1(a,1),1(a,1,2,1,2,1))].
% 1.06/1.35  4 join(meet(join(meet(A,B),meet(B,join(A,B))),C),meet(join(meet(A,join(join(meet(B,D),meet(E,B)),B)),meet(join(meet(F,join(join(meet(B,V6),meet(V7,B)),B)),meet(join(meet(B,meet(meet(join(B,V6),join(V7,B)),B)),meet(V8,join(B,meet(meet(join(B,V6),join(V7,B)),B)))),join(F,join(join(meet(B,V6),meet(V7,B)),B)))),join(A,join(join(meet(B,D),meet(E,B)),B)))),join(join(meet(A,B),meet(B,join(A,B))),C))) = B.  [para(1(a,1),3(a,1,1,1,1,2)),rewrite([1(85),1(85),1(89),1(90),1(92),1(118),1(119),1(121),1(125),1(126),1(126),1(132)])].
% 1.06/1.35  5 join(meet(join(meet(join(meet(A,B),meet(B,join(A,B))),B),meet(B,join(join(meet(A,B),meet(B,join(A,B))),B))),C),meet(B,join(join(meet(join(meet(A,B),meet(B,join(A,B))),B),meet(B,join(join(meet(A,B),meet(B,join(A,B))),B))),C))) = B.  [para(1(a,1),4(a,1,2,1))].
% 1.06/1.35  8 join(meet(join(meet(A,B),meet(B,join(A,B))),C),meet(join(meet(A,join(join(meet(B,D),meet(E,B)),B)),meet(B,join(A,join(join(meet(B,D),meet(E,B)),B)))),join(join(meet(A,B),meet(B,join(A,B))),C))) = B.  [para(5(a,1),3(a,1,1,1,1,2)),rewrite([5(29),5(29),5(33),5(34),5(36),5(38),5(39),5(41),5(45),5(46),5(46),5(52)])].
% 1.06/1.35  11 join(meet(join(meet(A,B),meet(B,join(A,B))),C),meet(join(meet(A,join(join(meet(B,D),meet(E,B)),B)),meet(join(meet(B,meet(meet(join(B,F),join(V6,B)),B)),meet(V7,join(B,meet(meet(join(B,F),join(V6,B)),B)))),join(A,join(join(meet(B,D),meet(E,B)),B)))),join(join(meet(A,B),meet(B,join(A,B))),C))) = B.  [para(5(a,1),4(a,1,2,1,2,1))].
% 1.06/1.35  13 join(meet(A,B),meet(A,join(A,B))) = A.  [para(5(a,1),5(a,1,1,1)),rewrite([5(29)])].
% 1.06/1.35  15 join(meet(join(meet(A,join(meet(B,A),meet(A,join(B,A)))),meet(join(meet(B,A),meet(A,join(B,A))),join(A,join(meet(B,A),meet(A,join(B,A)))))),C),meet(A,join(join(meet(A,join(meet(B,A),meet(A,join(B,A)))),meet(join(meet(B,A),meet(A,join(B,A))),join(A,join(meet(B,A),meet(A,join(B,A)))))),C))) = join(meet(B,A),meet(A,join(B,A))).  [para(13(a,1),3(a,1,2,1))].
% 1.06/1.35  42 join(meet(A,join(join(meet(B,C),meet(D,B)),B)),meet(B,join(A,join(join(meet(B,C),meet(D,B)),B)))) = B.  [para(8(a,1),8(a,1,1,1)),rewrite([8(105),8(49),13(4)]),flip(a)].
% 1.06/1.35  69 join(meet(A,join(join(meet(B,C),meet(D,B)),B)),meet(join(meet(B,meet(meet(join(B,E),join(F,B)),B)),meet(V6,join(B,meet(meet(join(B,E),join(F,B)),B)))),join(A,join(join(meet(B,C),meet(D,B)),B)))) = B.  [para(11(a,1),42(a,1)),flip(a)].
% 1.06/1.35  76 join(meet(A,meet(meet(join(A,B),join(C,A)),A)),meet(D,join(A,meet(meet(join(A,B),join(C,A)),A)))) = A.  [para(69(a,1),13(a,1)),flip(a)].
% 1.06/1.35  85 join(meet(A,B),meet(B,join(A,B))) = B.  [para(15(a,1),42(a,1))].
% 1.06/1.35  134 meet(meet(join(A,B),join(C,A)),A) = A.  [para(76(a,1),85(a,1)),flip(a)].
% 1.06/1.35  154 join(meet(A,A),meet(B,join(A,A))) = A.  [back_rewrite(76),rewrite([134(4),134(5)])].
% 1.06/1.35  181 join(join(meet(A,B),meet(C,A)),A) = A.  [para(154(a,1),42(a,1))].
% 1.06/1.35  183 join(meet(A,A),join(A,A)) = A.  [para(134(a,1),154(a,1,2))].
% 1.06/1.35  185 join(meet(meet(A,A),join(A,A)),meet(meet(A,A),A)) = meet(A,A).  [para(183(a,1),13(a,1,2,2))].
% 1.06/1.35  188 join(meet(meet(A,A),join(A,A)),meet(join(A,A),A)) = join(A,A).  [para(183(a,1),85(a,1,2,2))].
% 1.06/1.35  202 meet(meet(join(A,B),A),A) = A.  [para(181(a,1),134(a,1,1,2))].
% 1.06/1.35  206 meet(meet(A,meet(A,B)),meet(A,B)) = meet(A,B).  [para(13(a,1),202(a,1,1,1))].
% 1.06/1.35  238 meet(A,A) = A.  [para(134(a,1),206(a,1,1,2)),rewrite([134(4),134(4),134(5)])].
% 1.06/1.35  259 join(meet(A,join(A,A)),meet(join(A,A),A)) = join(A,A).  [back_rewrite(188),rewrite([238(1)])].
% 1.06/1.35  262 join(meet(A,join(A,A)),A) = A.  [back_rewrite(185),rewrite([238(1),238(3),238(3),238(4)])].
% 1.06/1.35  287 meet(join(A,A),A) = A.  [para(238(a,1),134(a,1,1))].
% 1.06/1.35  290 join(A,A) = A.  [back_rewrite(259),rewrite([287(4),262(3)]),flip(a)].
% 1.06/1.35  291 $F # answer(prove_wal_axioms_3).  [resolve(290,a,2,a)].
% 1.06/1.35  
% 1.06/1.35  % SZS output end Refutation
% 1.06/1.35  ============================== end of proof ==========================
% 1.06/1.35  
% 1.06/1.35  ============================== STATISTICS ============================
% 1.06/1.35  
% 1.06/1.35  Given=34. Generated=1971. Kept=290. proofs=1.
% 1.06/1.35  Usable=17. Sos=117. Demods=136. Limbo=3, Disabled=154. Hints=0.
% 1.06/1.35  Megabytes=1.24.
% 1.06/1.35  User_CPU=0.37, System_CPU=0.01, Wall_clock=1.
% 1.06/1.35  
% 1.06/1.35  ============================== end of statistics =====================
% 1.06/1.35  
% 1.06/1.35  ============================== end of search =========================
% 1.06/1.35  
% 1.06/1.35  THEOREM PROVED
% 1.06/1.35  % SZS status Unsatisfiable
% 1.06/1.35  
% 1.06/1.35  Exiting with 1 proof.
% 1.06/1.35  
% 1.06/1.35  Process 8440 exit (max_proofs) Wed Jun 29 00:16:54 2022
% 1.06/1.35  Prover9 interrupted
%------------------------------------------------------------------------------