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

View Problem - Process Solution

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

% Computer : n026.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 : Thu Jul 21 21:33:56 EDT 2022

% Result   : Unsatisfiable 0.75s 1.03s
% Output   : Refutation 0.75s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem  : TOP051-1 : TPTP v8.1.0. Released v8.1.0.
% 0.07/0.13  % Command  : tptp2X_and_run_prover9 %d %s
% 0.13/0.34  % Computer : n026.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 : Sun May 29 14:34:09 EDT 2022
% 0.13/0.34  % CPUTime  : 
% 0.75/1.03  ============================== Prover9 ===============================
% 0.75/1.03  Prover9 (32) version 2009-11A, November 2009.
% 0.75/1.03  Process 18104 was started by sandbox on n026.cluster.edu,
% 0.75/1.03  Sun May 29 14:34:10 2022
% 0.75/1.03  The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_17951_n026.cluster.edu".
% 0.75/1.03  ============================== end of head ===========================
% 0.75/1.03  
% 0.75/1.03  ============================== INPUT =================================
% 0.75/1.03  
% 0.75/1.03  % Reading from file /tmp/Prover9_17951_n026.cluster.edu
% 0.75/1.03  
% 0.75/1.03  set(prolog_style_variables).
% 0.75/1.03  set(auto2).
% 0.75/1.03      % set(auto2) -> set(auto).
% 0.75/1.03      % set(auto) -> set(auto_inference).
% 0.75/1.03      % set(auto) -> set(auto_setup).
% 0.75/1.03      % set(auto_setup) -> set(predicate_elim).
% 0.75/1.03      % set(auto_setup) -> assign(eq_defs, unfold).
% 0.75/1.03      % set(auto) -> set(auto_limits).
% 0.75/1.03      % set(auto_limits) -> assign(max_weight, "100.000").
% 0.75/1.03      % set(auto_limits) -> assign(sos_limit, 20000).
% 0.75/1.03      % set(auto) -> set(auto_denials).
% 0.75/1.03      % set(auto) -> set(auto_process).
% 0.75/1.03      % set(auto2) -> assign(new_constants, 1).
% 0.75/1.03      % set(auto2) -> assign(fold_denial_max, 3).
% 0.75/1.03      % set(auto2) -> assign(max_weight, "200.000").
% 0.75/1.03      % set(auto2) -> assign(max_hours, 1).
% 0.75/1.03      % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.75/1.03      % set(auto2) -> assign(max_seconds, 0).
% 0.75/1.03      % set(auto2) -> assign(max_minutes, 5).
% 0.75/1.03      % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.75/1.03      % set(auto2) -> set(sort_initial_sos).
% 0.75/1.03      % set(auto2) -> assign(sos_limit, -1).
% 0.75/1.03      % set(auto2) -> assign(lrs_ticks, 3000).
% 0.75/1.03      % set(auto2) -> assign(max_megs, 400).
% 0.75/1.03      % set(auto2) -> assign(stats, some).
% 0.75/1.03      % set(auto2) -> clear(echo_input).
% 0.75/1.03      % set(auto2) -> set(quiet).
% 0.75/1.03      % set(auto2) -> clear(print_initial_clauses).
% 0.75/1.03      % set(auto2) -> clear(print_given).
% 0.75/1.03  assign(lrs_ticks,-1).
% 0.75/1.03  assign(sos_limit,10000).
% 0.75/1.03  assign(order,kbo).
% 0.75/1.03  set(lex_order_vars).
% 0.75/1.03  clear(print_given).
% 0.75/1.03  
% 0.75/1.03  % formulas(sos).  % not echoed (14 formulas)
% 0.75/1.03  
% 0.75/1.03  ============================== end of input ==========================
% 0.75/1.03  
% 0.75/1.03  % From the command line: assign(max_seconds, 300).
% 0.75/1.03  
% 0.75/1.03  ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.75/1.03  
% 0.75/1.03  % Formulas that are not ordinary clauses:
% 0.75/1.03  
% 0.75/1.03  ============================== end of process non-clausal formulas ===
% 0.75/1.03  
% 0.75/1.03  ============================== PROCESS INITIAL CLAUSES ===============
% 0.75/1.03  
% 0.75/1.03  ============================== PREDICATE ELIMINATION =================
% 0.75/1.03  
% 0.75/1.03  ============================== end predicate elimination =============
% 0.75/1.03  
% 0.75/1.03  Auto_denials:
% 0.75/1.03    % copying label goal to answer in negative clause
% 0.75/1.03  
% 0.75/1.03  Term ordering decisions:
% 0.75/1.03  Function symbol KB weights:  a6=1. a10=1. a2=1. a3=1. a4=1. a5=1. a7=1. a9=1. a1=1. a8=1. a11=1. product=1. tuple=1.
% 0.75/1.03  
% 0.75/1.03  ============================== end of process initial clauses ========
% 0.75/1.03  
% 0.75/1.03  ============================== CLAUSES FOR SEARCH ====================
% 0.75/1.03  
% 0.75/1.03  ============================== end of clauses for search =============
% 0.75/1.03  
% 0.75/1.03  ============================== SEARCH ================================
% 0.75/1.03  
% 0.75/1.03  % Starting search at 0.01 seconds.
% 0.75/1.03  
% 0.75/1.03  ============================== PROOF =================================
% 0.75/1.03  % SZS status Unsatisfiable
% 0.75/1.03  % SZS output start Refutation
% 0.75/1.03  
% 0.75/1.03  % Proof 1 at 0.03 (+ 0.01) seconds: goal.
% 0.75/1.03  % Length of proof is 69.
% 0.75/1.03  % Level of proof is 16.
% 0.75/1.03  % Maximum clause weight is 23.000.
% 0.75/1.03  % Given clauses 61.
% 0.75/1.03  
% 0.75/1.03  1 product(A,A) = A # label(involutory_quandle) # label(axiom).  [assumption].
% 0.75/1.03  2 product(a1,a6) = a2 # label(knot) # label(axiom).  [assumption].
% 0.75/1.03  3 product(a2,a7) = a3 # label(knot_03) # label(axiom).  [assumption].
% 0.75/1.03  4 product(a3,a1) = a4 # label(knot_04) # label(axiom).  [assumption].
% 0.75/1.03  5 product(a4,a10) = a5 # label(knot_05) # label(axiom).  [assumption].
% 0.75/1.03  6 product(a5,a9) = a6 # label(knot_06) # label(axiom).  [assumption].
% 0.75/1.03  7 product(a6,a2) = a7 # label(knot_07) # label(axiom).  [assumption].
% 0.75/1.03  8 product(a7,a3) = a8 # label(knot_08) # label(axiom).  [assumption].
% 0.75/1.03  9 product(a8,a6) = a9 # label(knot_09) # label(axiom).  [assumption].
% 0.75/1.03  10 product(a9,a4) = a10 # label(knot_10) # label(axiom).  [assumption].
% 0.75/1.03  11 product(a10,a5) = a11 # label(knot_11) # label(axiom).  [assumption].
% 0.75/1.03  12 product(product(A,B),B) = A # label(involutory_quandle_01) # label(axiom).  [assumption].
% 0.75/1.03  13 product(product(A,B),C) = product(product(A,C),product(B,C)) # label(involutory_quandle_02) # label(axiom).  [assumption].
% 0.75/1.03  14 product(product(A,B),product(C,B)) = product(product(A,C),B).  [copy(13),flip(a)].
% 0.75/1.03  15 tuple(a1,a6,a5,a2,a7,a3,a4,a9,a10,a8) != tuple(a2,a7,a6,a3,a8,a4,a5,a10,a11,a9) # label(goal) # label(negated_conjecture) # answer(goal).  [assumption].
% 0.75/1.03  16 product(a2,a6) = a1.  [para(2(a,1),12(a,1,1))].
% 0.75/1.03  17 product(a3,a7) = a2.  [para(3(a,1),12(a,1,1))].
% 0.75/1.03  20 product(a6,a9) = a5.  [para(6(a,1),12(a,1,1))].
% 0.75/1.03  21 product(a7,a2) = a6.  [para(7(a,1),12(a,1,1))].
% 0.75/1.03  26 product(product(A,B),A) = product(A,product(B,A)).  [para(1(a,1),14(a,1,1)),flip(a)].
% 0.75/1.03  27 product(product(a1,A),a6) = product(a2,product(A,a6)).  [para(2(a,1),14(a,1,1)),flip(a)].
% 0.75/1.03  29 product(product(a2,A),a7) = product(a3,product(A,a7)).  [para(3(a,1),14(a,1,1)),flip(a)].
% 0.75/1.03  31 product(product(a3,A),a1) = product(a4,product(A,a1)).  [para(4(a,1),14(a,1,1)),flip(a)].
% 0.75/1.03  32 product(product(A,a1),a4) = product(product(A,a3),a1).  [para(4(a,1),14(a,1,2))].
% 0.75/1.03  52 product(product(a2,A),a6) = product(a1,product(A,a6)).  [para(16(a,1),14(a,1,1)),flip(a)].
% 0.75/1.03  60 product(product(a6,A),a9) = product(a5,product(A,a9)).  [para(20(a,1),14(a,1,1)),flip(a)].
% 0.75/1.03  74 product(a1,product(a6,a1)) = product(a2,a1).  [para(2(a,1),26(a,1,1)),flip(a)].
% 0.75/1.03  76 product(a6,a7) = a8.  [para(3(a,1),26(a,2,2)),rewrite([21(3),8(6)])].
% 0.75/1.03  81 product(a7,a6) = product(a6,a1).  [para(7(a,1),26(a,1,1)),rewrite([16(7)])].
% 0.75/1.03  82 product(a1,a2) = a3.  [para(7(a,1),26(a,2,2)),rewrite([16(3),3(6)])].
% 0.75/1.03  84 product(a3,a8) = product(a2,a3).  [para(8(a,1),26(a,2,2)),rewrite([17(3)]),flip(a)].
% 0.75/1.03  86 product(a9,product(a4,a9)) = product(a10,a9).  [para(10(a,1),26(a,1,1)),flip(a)].
% 0.75/1.03  104 product(a6,product(a6,a1)) = a9.  [para(76(a,1),26(a,1,1)),rewrite([9(3),81(5)]),flip(a)].
% 0.75/1.03  111 product(a1,product(a2,a1)) = a4.  [para(82(a,1),26(a,1,1)),rewrite([4(3)]),flip(a)].
% 0.75/1.03  114 product(a3,a6) = product(a2,a1).  [para(16(a,1),27(a,2,2)),rewrite([82(3)])].
% 0.75/1.03  144 product(a1,a7) = product(a2,a3).  [para(16(a,1),29(a,1,1)),rewrite([76(7),84(6)])].
% 0.75/1.03  146 product(a9,product(a6,a1)) = a6.  [para(104(a,1),12(a,1,1))].
% 0.75/1.03  149 product(a7,product(a6,a1)) = product(a5,product(a1,a9)).  [para(104(a,1),26(a,2,2)),rewrite([26(5),2(4),7(3),60(10)])].
% 0.75/1.03  153 product(product(a2,a3),a1) = product(a2,product(a2,a1)).  [para(111(a,1),26(a,2,2)),rewrite([12(5),32(10)]),flip(a)].
% 0.75/1.03  162 product(a4,product(a7,a1)) = product(a2,a1).  [para(17(a,1),31(a,1,1)),flip(a)].
% 0.75/1.03  165 product(a4,product(a8,a1)) = product(a2,product(a2,a1)).  [para(84(a,1),31(a,1,1)),rewrite([153(5)]),flip(a)].
% 0.75/1.03  166 product(a4,product(a6,a1)) = a2.  [para(114(a,1),31(a,1,1)),rewrite([12(5)]),flip(a)].
% 0.75/1.03  169 product(a1,product(a7,a1)) = product(a2,product(a2,a1)).  [para(144(a,1),26(a,1,1)),rewrite([153(5)]),flip(a)].
% 0.75/1.03  170 product(a2,product(a6,a1)) = a4.  [para(144(a,1),27(a,1,1)),rewrite([52(5),114(4),111(5),81(5)]),flip(a)].
% 0.75/1.03  174 product(product(a5,product(a1,a9)),product(a6,a1)) = a7.  [para(146(a,1),26(a,2,2)),rewrite([60(5),26(14),2(13),7(12)])].
% 0.75/1.03  213 product(a7,a1) = a9.  [para(74(a,1),26(a,2,2)),rewrite([12(5),104(5),14(8),7(4)]),flip(a)].
% 0.75/1.03  214 product(a2,product(a2,a1)) = product(a1,a9).  [back_rewrite(169),rewrite([213(4)]),flip(a)].
% 0.75/1.03  215 product(a4,a9) = product(a2,a1).  [back_rewrite(162),rewrite([213(4)])].
% 0.75/1.03  217 product(a4,product(a8,a1)) = product(a1,a9).  [back_rewrite(165),rewrite([214(10)])].
% 0.75/1.03  221 product(a9,product(a2,a1)) = product(a10,a9).  [back_rewrite(86),rewrite([215(4)])].
% 0.75/1.03  223 product(a9,a1) = a7.  [para(213(a,1),12(a,1,1))].
% 0.75/1.03  227 product(a8,a1) = a10.  [para(213(a,1),32(a,1,1)),rewrite([10(3),8(4)]),flip(a)].
% 0.75/1.03  228 product(a1,a9) = a5.  [back_rewrite(217),rewrite([227(4),5(3)]),flip(a)].
% 0.75/1.03  232 product(a5,product(a6,a1)) = a7.  [back_rewrite(174),rewrite([228(4),1(3)])].
% 0.75/1.03  234 product(a7,product(a6,a1)) = a5.  [back_rewrite(149),rewrite([228(9),1(8)])].
% 0.75/1.03  252 product(a10,a1) = a8.  [para(227(a,1),12(a,1,1))].
% 0.75/1.03  265 a1 = a6.  [para(228(a,1),12(a,1,1)),rewrite([6(3)]),flip(a)].
% 0.75/1.03  274 product(a10,a6) = a8.  [back_rewrite(252),rewrite([265(2)])].
% 0.75/1.03  284 a5 = a6.  [back_rewrite(234),rewrite([265(3),1(4),81(3),265(2),1(3)]),flip(a)].
% 0.75/1.03  285 a7 = a6.  [back_rewrite(232),rewrite([284(1),265(3),1(4),1(3)]),flip(a)].
% 0.75/1.03  288 a9 = a10.  [back_rewrite(227),rewrite([265(2),9(3)])].
% 0.75/1.03  291 a8 = a6.  [back_rewrite(223),rewrite([288(1),265(2),274(3),285(2)])].
% 0.75/1.03  293 a10 = a6.  [back_rewrite(221),rewrite([288(1),265(3),16(4),265(2),274(3),291(1),288(3),1(4)]),flip(a)].
% 0.75/1.03  303 a4 = a6.  [back_rewrite(170),rewrite([265(3),1(4),16(3),265(1)]),flip(a)].
% 0.75/1.03  304 a2 = a6.  [back_rewrite(166),rewrite([303(1),265(3),1(4),1(3)]),flip(a)].
% 0.75/1.03  310 a3 = a6.  [back_rewrite(82),rewrite([265(1),304(2),1(3)]),flip(a)].
% 0.75/1.03  311 tuple(a6,a6,a6,a6,a6,a6,a6,a6,a11,a6) != tuple(a6,a6,a6,a6,a6,a6,a6,a6,a6,a6) # answer(goal).  [back_rewrite(15),rewrite([265(1),284(3),304(4),285(5),310(6),303(7),288(8),293(8),293(9),291(10),304(12),285(13),310(15),291(16),303(17),284(18),293(19),288(21),293(21)]),flip(a)].
% 0.75/1.03  319 a11 = a6.  [back_rewrite(11),rewrite([293(1),284(2),1(3)]),flip(a)].
% 0.75/1.03  321 $F # answer(goal).  [back_rewrite(311),rewrite([319(9)]),xx(a)].
% 0.75/1.03  
% 0.75/1.03  % SZS output end Refutation
% 0.75/1.03  ============================== end of proof ==========================
% 0.75/1.03  
% 0.75/1.03  ============================== STATISTICS ============================
% 0.75/1.03  
% 0.75/1.03  Given=61. Generated=892. Kept=319. proofs=1.
% 0.75/1.03  Usable=4. Sos=16. Demods=22. Limbo=2, Disabled=311. Hints=0.
% 0.75/1.03  Megabytes=0.23.
% 0.75/1.03  User_CPU=0.03, System_CPU=0.01, Wall_clock=0.
% 0.75/1.03  
% 0.75/1.03  ============================== end of statistics =====================
% 0.75/1.03  
% 0.75/1.03  ============================== end of search =========================
% 0.75/1.03  
% 0.75/1.03  THEOREM PROVED
% 0.75/1.03  % SZS status Unsatisfiable
% 0.75/1.03  
% 0.75/1.03  Exiting with 1 proof.
% 0.75/1.03  
% 0.75/1.03  Process 18104 exit (max_proofs) Sun May 29 14:34:10 2022
% 0.75/1.03  Prover9 interrupted
%------------------------------------------------------------------------------