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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Prover9---1109a
% Problem  : LAT083-1 : TPTP v8.1.0. Released v2.6.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : tptp2X_and_run_prover9 %d %s

% Computer : n007.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:29 EDT 2022

% Result   : Unsatisfiable 1.39s 1.68s
% Output   : Refutation 1.39s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.14  % Problem  : LAT083-1 : TPTP v8.1.0. Released v2.6.0.
% 0.08/0.15  % Command  : tptp2X_and_run_prover9 %d %s
% 0.15/0.36  % Computer : n007.cluster.edu
% 0.15/0.36  % Model    : x86_64 x86_64
% 0.15/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.36  % Memory   : 8042.1875MB
% 0.15/0.36  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.15/0.36  % CPULimit : 300
% 0.15/0.36  % WCLimit  : 600
% 0.15/0.36  % DateTime : Wed Jun 29 09:58:52 EDT 2022
% 0.15/0.37  % CPUTime  : 
% 1.39/1.68  ============================== Prover9 ===============================
% 1.39/1.68  Prover9 (32) version 2009-11A, November 2009.
% 1.39/1.68  Process 16656 was started by sandbox on n007.cluster.edu,
% 1.39/1.68  Wed Jun 29 09:58:53 2022
% 1.39/1.68  The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_16503_n007.cluster.edu".
% 1.39/1.68  ============================== end of head ===========================
% 1.39/1.68  
% 1.39/1.68  ============================== INPUT =================================
% 1.39/1.68  
% 1.39/1.68  % Reading from file /tmp/Prover9_16503_n007.cluster.edu
% 1.39/1.68  
% 1.39/1.68  set(prolog_style_variables).
% 1.39/1.68  set(auto2).
% 1.39/1.68      % set(auto2) -> set(auto).
% 1.39/1.68      % set(auto) -> set(auto_inference).
% 1.39/1.68      % set(auto) -> set(auto_setup).
% 1.39/1.68      % set(auto_setup) -> set(predicate_elim).
% 1.39/1.68      % set(auto_setup) -> assign(eq_defs, unfold).
% 1.39/1.68      % set(auto) -> set(auto_limits).
% 1.39/1.68      % set(auto_limits) -> assign(max_weight, "100.000").
% 1.39/1.68      % set(auto_limits) -> assign(sos_limit, 20000).
% 1.39/1.68      % set(auto) -> set(auto_denials).
% 1.39/1.68      % set(auto) -> set(auto_process).
% 1.39/1.68      % set(auto2) -> assign(new_constants, 1).
% 1.39/1.68      % set(auto2) -> assign(fold_denial_max, 3).
% 1.39/1.68      % set(auto2) -> assign(max_weight, "200.000").
% 1.39/1.68      % set(auto2) -> assign(max_hours, 1).
% 1.39/1.68      % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 1.39/1.68      % set(auto2) -> assign(max_seconds, 0).
% 1.39/1.68      % set(auto2) -> assign(max_minutes, 5).
% 1.39/1.68      % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 1.39/1.68      % set(auto2) -> set(sort_initial_sos).
% 1.39/1.68      % set(auto2) -> assign(sos_limit, -1).
% 1.39/1.68      % set(auto2) -> assign(lrs_ticks, 3000).
% 1.39/1.68      % set(auto2) -> assign(max_megs, 400).
% 1.39/1.68      % set(auto2) -> assign(stats, some).
% 1.39/1.68      % set(auto2) -> clear(echo_input).
% 1.39/1.68      % set(auto2) -> set(quiet).
% 1.39/1.68      % set(auto2) -> clear(print_initial_clauses).
% 1.39/1.68      % set(auto2) -> clear(print_given).
% 1.39/1.68  assign(lrs_ticks,-1).
% 1.39/1.68  assign(sos_limit,10000).
% 1.39/1.68  assign(order,kbo).
% 1.39/1.68  set(lex_order_vars).
% 1.39/1.68  clear(print_given).
% 1.39/1.68  
% 1.39/1.68  % formulas(sos).  % not echoed (2 formulas)
% 1.39/1.68  
% 1.39/1.68  ============================== end of input ==========================
% 1.39/1.68  
% 1.39/1.68  % From the command line: assign(max_seconds, 300).
% 1.39/1.68  
% 1.39/1.68  ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 1.39/1.68  
% 1.39/1.68  % Formulas that are not ordinary clauses:
% 1.39/1.68  
% 1.39/1.68  ============================== end of process non-clausal formulas ===
% 1.39/1.68  
% 1.39/1.68  ============================== PROCESS INITIAL CLAUSES ===============
% 1.39/1.68  
% 1.39/1.68  ============================== PREDICATE ELIMINATION =================
% 1.39/1.68  
% 1.39/1.68  ============================== end predicate elimination =============
% 1.39/1.68  
% 1.39/1.68  Auto_denials:
% 1.39/1.68    % copying label prove_normal_axioms_4 to answer in negative clause
% 1.39/1.68  
% 1.39/1.68  Term ordering decisions:
% 1.39/1.68  Function symbol KB weights:  a=1. join=1. meet=1.
% 1.39/1.68  
% 1.39/1.68  ============================== end of process initial clauses ========
% 1.39/1.68  
% 1.39/1.68  ============================== CLAUSES FOR SEARCH ====================
% 1.39/1.68  
% 1.39/1.68  ============================== end of clauses for search =============
% 1.39/1.68  
% 1.39/1.68  ============================== SEARCH ================================
% 1.39/1.68  
% 1.39/1.68  % Starting search at 0.01 seconds.
% 1.39/1.68  
% 1.39/1.68  ============================== PROOF =================================
% 1.39/1.68  % SZS status Unsatisfiable
% 1.39/1.68  % SZS output start Refutation
% 1.39/1.68  
% 1.39/1.68  % Proof 1 at 0.61 (+ 0.01) seconds: prove_normal_axioms_4.
% 1.39/1.68  % Length of proof is 26.
% 1.39/1.68  % Level of proof is 15.
% 1.39/1.68  % Maximum clause weight is 167.000.
% 1.39/1.68  % Given clauses 44.
% 1.39/1.68  
% 1.39/1.68  1 join(meet(join(meet(A,B),meet(B,join(A,B))),C),meet(join(meet(A,join(join(meet(D,B),meet(B,E)),B)),meet(join(meet(B,meet(meet(join(D,join(B,E)),join(F,B)),B)),meet(V6,join(B,meet(meet(join(D,join(B,E)),join(F,B)),B)))),join(A,join(join(meet(D,B),meet(B,E)),B)))),join(join(meet(A,B),meet(B,join(A,B))),C))) = B # label(single_axiom) # label(axiom).  [assumption].
% 1.39/1.68  2 join(a,a) != a # label(prove_normal_axioms_4) # label(negated_conjecture) # answer(prove_normal_axioms_4).  [assumption].
% 1.39/1.68  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(E,join(meet(B,C),meet(C,join(B,C)))),meet(join(meet(B,C),meet(C,join(B,C))),F)),join(meet(B,C),meet(C,join(B,C))))),meet(C,join(A,join(join(meet(E,join(meet(B,C),meet(C,join(B,C)))),meet(join(meet(B,C),meet(C,join(B,C))),F)),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.39/1.68  4 join(meet(join(meet(A,B),meet(B,join(A,B))),C),meet(join(meet(A,join(join(meet(D,B),meet(B,E)),B)),meet(join(meet(F,join(join(meet(V6,B),meet(B,V7)),B)),meet(join(meet(B,meet(meet(join(V6,join(B,V7)),join(V8,B)),B)),meet(V9,join(B,meet(meet(join(V6,join(B,V7)),join(V8,B)),B)))),join(F,join(join(meet(V6,B),meet(B,V7)),B)))),join(A,join(join(meet(D,B),meet(B,E)),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(91),1(91),1(95),1(96),1(98),1(126),1(127),1(129),1(133),1(134),1(134),1(140)])].
% 1.39/1.68  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.39/1.68  6 join(meet(join(meet(A,B),meet(B,join(A,B))),C),meet(join(meet(A,join(join(meet(D,B),meet(B,E)),B)),meet(join(meet(F,join(join(meet(V6,B),meet(B,V7)),B)),meet(join(meet(V8,join(join(meet(V9,B),meet(B,V10)),B)),meet(join(meet(B,meet(meet(join(V9,join(B,V10)),join(V11,B)),B)),meet(V12,join(B,meet(meet(join(V9,join(B,V10)),join(V11,B)),B)))),join(V8,join(join(meet(V9,B),meet(B,V10)),B)))),join(F,join(join(meet(V6,B),meet(B,V7)),B)))),join(A,join(join(meet(D,B),meet(B,E)),B)))),join(join(meet(A,B),meet(B,join(A,B))),C))) = B.  [para(4(a,1),3(a,1,1,1,1,2)),rewrite([4(127),4(127),4(131),4(132),4(134),4(174),4(175),4(177),4(181),4(182),4(182),4(188)])].
% 1.39/1.68  8 join(meet(join(meet(A,B),meet(B,join(A,B))),C),meet(join(meet(A,join(B,B)),meet(join(meet(B,meet(meet(join(join(meet(join(meet(D,B),meet(B,join(D,B))),B),meet(B,join(join(meet(D,B),meet(B,join(D,B))),B))),join(B,join(join(meet(join(meet(D,B),meet(B,join(D,B))),B),meet(B,join(join(meet(D,B),meet(B,join(D,B))),B))),B))),join(E,B)),B)),meet(F,join(B,meet(meet(join(join(meet(join(meet(D,B),meet(B,join(D,B))),B),meet(B,join(join(meet(D,B),meet(B,join(D,B))),B))),join(B,join(join(meet(join(meet(D,B),meet(B,join(D,B))),B),meet(B,join(join(meet(D,B),meet(B,join(D,B))),B))),B))),join(E,B)),B)))),join(A,join(B,B)))),join(join(meet(A,B),meet(B,join(A,B))),C))) = B.  [para(5(a,1),1(a,1,2,1,1,2,1)),rewrite([5(99)])].
% 1.39/1.68  9 join(meet(join(meet(A,B),meet(B,join(A,B))),C),meet(join(meet(A,join(join(meet(D,B),meet(B,E)),B)),meet(B,join(A,join(join(meet(D,B),meet(B,E)),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.39/1.68  10 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(B,C),meet(C,join(B,C))),join(meet(B,C),meet(C,join(B,C))))),meet(C,join(A,join(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(5(a,1),3(a,1,2,1,1,2,1)),rewrite([5(139)])].
% 1.39/1.68  17 join(meet(A,B),meet(A,join(A,B))) = A.  [para(5(a,1),5(a,1,1,1)),rewrite([5(29)])].
% 1.39/1.68  32 join(meet(join(meet(A,B),meet(B,join(A,B))),C),meet(join(meet(A,join(join(meet(D,B),meet(B,E)),B)),meet(join(meet(F,join(join(meet(V6,B),meet(B,V7)),B)),meet(join(meet(V8,join(join(meet(V9,B),meet(B,V10)),B)),meet(join(meet(V11,join(join(meet(V12,B),meet(B,V13)),B)),meet(join(meet(B,meet(meet(join(V12,join(B,V13)),join(V14,B)),B)),meet(V15,join(B,meet(meet(join(V12,join(B,V13)),join(V14,B)),B)))),join(V11,join(join(meet(V12,B),meet(B,V13)),B)))),join(V8,join(join(meet(V9,B),meet(B,V10)),B)))),join(F,join(join(meet(V6,B),meet(B,V7)),B)))),join(A,join(join(meet(D,B),meet(B,E)),B)))),join(join(meet(A,B),meet(B,join(A,B))),C))) = B.  [para(6(a,1),3(a,1,1,1,1,2)),rewrite([6(163),6(163),6(167),6(168),6(170),6(222),6(223),6(225),6(229),6(230),6(230),6(236)])].
% 1.39/1.68  49 join(meet(A,join(join(meet(B,C),meet(C,D)),C)),meet(join(meet(E,join(join(meet(F,C),meet(C,V6)),C)),meet(join(meet(V7,join(join(meet(V8,C),meet(C,V9)),C)),meet(join(meet(C,meet(meet(join(V8,join(C,V9)),join(V10,C)),C)),meet(V11,join(C,meet(meet(join(V8,join(C,V9)),join(V10,C)),C)))),join(V7,join(join(meet(V8,C),meet(C,V9)),C)))),join(E,join(join(meet(F,C),meet(C,V6)),C)))),join(A,join(join(meet(B,C),meet(C,D)),C)))) = C.  [para(6(a,1),9(a,1,1,1)),rewrite([6(371),6(163),17(4)]),flip(a)].
% 1.39/1.68  53 join(meet(A,join(join(meet(B,C),meet(C,D)),C)),meet(C,join(A,join(join(meet(B,C),meet(C,D)),C)))) = C.  [para(9(a,1),9(a,1,1,1)),rewrite([9(105),9(49),17(4)]),flip(a)].
% 1.39/1.68  60 join(meet(join(meet(A,B),meet(B,join(A,B))),C),meet(B,join(join(meet(A,B),meet(B,join(A,B))),C))) = B.  [back_rewrite(32),rewrite([49(60),53(17)])].
% 1.39/1.68  65 join(meet(join(meet(A,B),meet(B,join(A,B))),C),meet(join(meet(A,join(B,B)),meet(join(meet(B,meet(meet(join(B,join(B,join(B,B))),join(D,B)),B)),meet(E,join(B,meet(meet(join(B,join(B,join(B,B))),join(D,B)),B)))),join(A,join(B,B)))),join(join(meet(A,B),meet(B,join(A,B))),C))) = B.  [back_rewrite(8),rewrite([60(19),60(19),60(26),60(26)])].
% 1.39/1.68  68 join(meet(A,join(B,B)),meet(B,join(A,join(B,B)))) = B.  [para(17(a,1),53(a,1,1,2,1)),rewrite([17(6)])].
% 1.39/1.68  75 join(meet(A,B),meet(B,join(A,B))) = B.  [para(17(a,1),10(a,1,1,1)),rewrite([60(35),17(29),60(12)]),flip(a)].
% 1.39/1.68  79 join(meet(A,B),meet(join(meet(C,join(A,A)),meet(join(meet(A,meet(meet(join(A,join(A,join(A,A))),join(D,A)),A)),meet(E,join(A,meet(meet(join(A,join(A,join(A,A))),join(D,A)),A)))),join(C,join(A,A)))),join(A,B))) = A.  [back_rewrite(65),rewrite([75(4),75(27)])].
% 1.39/1.68  217 join(meet(A,B),meet(join(meet(A,meet(meet(join(A,join(A,join(A,A))),join(C,A)),A)),meet(D,join(A,meet(meet(join(A,join(A,join(A,A))),join(C,A)),A)))),join(A,B))) = A.  [para(17(a,1),79(a,1,2,1))].
% 1.39/1.68  224 join(meet(A,B),meet(join(meet(C,join(A,A)),meet(meet(meet(join(A,join(A,join(A,A))),join(D,A)),A),join(C,join(A,A)))),join(A,B))) = A.  [para(75(a,1),79(a,1,2,1,2,1))].
% 1.39/1.68  229 join(meet(A,B),meet(meet(meet(join(A,join(A,join(A,A))),join(C,A)),A),join(A,B))) = A.  [para(17(a,1),224(a,1,2,1))].
% 1.39/1.68  254 meet(meet(join(A,join(A,join(A,A))),join(B,A)),A) = A.  [para(229(a,1),53(a,1)),flip(a)].
% 1.39/1.68  262 join(meet(A,B),meet(join(meet(A,A),meet(C,join(A,A))),join(A,B))) = A.  [back_rewrite(217),rewrite([254(7),254(8)])].
% 1.39/1.68  315 join(meet(A,A),meet(B,join(A,A))) = A.  [para(262(a,1),53(a,1)),flip(a)].
% 1.39/1.68  325 join(A,A) = A.  [para(315(a,1),68(a,1))].
% 1.39/1.68  326 $F # answer(prove_normal_axioms_4).  [resolve(325,a,2,a)].
% 1.39/1.68  
% 1.39/1.68  % SZS output end Refutation
% 1.39/1.68  ============================== end of proof ==========================
% 1.39/1.68  
% 1.39/1.68  ============================== STATISTICS ============================
% 1.39/1.68  
% 1.39/1.68  Given=44. Generated=3966. Kept=325. proofs=1.
% 1.39/1.68  Usable=32. Sos=159. Demods=194. Limbo=4, Disabled=131. Hints=0.
% 1.39/1.68  Megabytes=2.13.
% 1.39/1.68  User_CPU=0.61, System_CPU=0.01, Wall_clock=0.
% 1.39/1.68  
% 1.39/1.68  ============================== end of statistics =====================
% 1.39/1.68  
% 1.39/1.68  ============================== end of search =========================
% 1.39/1.68  
% 1.39/1.68  THEOREM PROVED
% 1.39/1.68  % SZS status Unsatisfiable
% 1.39/1.68  
% 1.39/1.68  Exiting with 1 proof.
% 1.39/1.68  
% 1.39/1.68  Process 16656 exit (max_proofs) Wed Jun 29 09:58:53 2022
% 1.39/1.68  Prover9 interrupted
%------------------------------------------------------------------------------