TSTP Solution File: RNG082+1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : RNG082+1 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n020.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 : Mon Jul 18 20:39:20 EDT 2022
% Result : Theorem 1.24s 1.53s
% Output : Refutation 1.24s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : RNG082+1 : TPTP v8.1.0. Released v4.0.0.
% 0.11/0.12 % Command : tptp2X_and_run_prover9 %d %s
% 0.12/0.33 % Computer : n020.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 May 30 05:21:24 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 29517 was started by sandbox on n020.cluster.edu,
% 0.68/0.99 Mon May 30 05:21:24 2022
% 0.68/0.99 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_29364_n020.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_29364_n020.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 (16 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 1 (all W0 (aElement0(W0) -> $T)) # label(mElmSort) # label(axiom) # label(non_clause). [assumption].
% 0.68/0.99 2 (all W0 (aElement0(W0) -> aElement0(smndt0(W0)))) # label(mSortsU) # label(axiom) # label(non_clause). [assumption].
% 0.68/0.99 3 (all W0 all W1 (aElement0(W0) & aElement0(W1) -> aElement0(sdtpldt0(W0,W1)))) # label(mSortsB) # label(axiom) # label(non_clause). [assumption].
% 0.68/0.99 4 (all W0 all W1 (aElement0(W0) & aElement0(W1) -> aElement0(sdtasdt0(W0,W1)))) # label(mSortsB_02) # label(axiom) # label(non_clause). [assumption].
% 0.68/0.99 5 (all W0 all W1 (aElement0(W0) & aElement0(W1) -> sdtpldt0(W0,W1) = sdtpldt0(W1,W0))) # label(mAddComm) # label(axiom) # label(non_clause). [assumption].
% 0.68/0.99 6 (all W0 all W1 all W2 (aElement0(W0) & aElement0(W1) & aElement0(W2) -> sdtpldt0(sdtpldt0(W0,W1),W2) = sdtpldt0(W0,sdtpldt0(W1,W2)))) # label(mAddAsso) # label(axiom) # label(non_clause). [assumption].
% 0.68/0.99 7 (all W0 (aElement0(W0) -> sdtpldt0(W0,sz00) = W0 & W0 = sdtpldt0(sz00,W0))) # label(mAddZero) # label(axiom) # label(non_clause). [assumption].
% 0.68/0.99 8 (all W0 (aElement0(W0) -> sdtpldt0(W0,smndt0(W0)) = sz00 & sz00 = sdtpldt0(smndt0(W0),W0))) # label(mAddInvr) # label(axiom) # label(non_clause). [assumption].
% 0.68/0.99 9 (all W0 all W1 (aElement0(W0) & aElement0(W1) -> sdtasdt0(W0,W1) = sdtasdt0(W1,W0))) # label(mMulComm) # label(axiom) # label(non_clause). [assumption].
% 0.68/0.99 10 (all W0 all W1 all W2 (aElement0(W0) & aElement0(W1) & aElement0(W2) -> sdtasdt0(sdtasdt0(W0,W1),W2) = sdtasdt0(W0,sdtasdt0(W1,W2)))) # label(mMulAsso) # label(axiom) # label(non_clause). [assumption].
% 0.68/0.99 11 (all W0 (aElement0(W0) -> sdtasdt0(W0,sz10) = W0 & W0 = sdtasdt0(sz10,W0))) # label(mMulUnit) # label(axiom) # label(non_clause). [assumption].
% 0.68/0.99 12 (all W0 all W1 all W2 (aElement0(W0) & aElement0(W1) & aElement0(W2) -> sdtasdt0(W0,sdtpldt0(W1,W2)) = sdtpldt0(sdtasdt0(W0,W1),sdtasdt0(W0,W2)) & sdtasdt0(sdtpldt0(W1,W2),W0) = sdtpldt0(sdtasdt0(W1,W0),sdtasdt0(W2,W0)))) # label(mAMDistr) # label(axiom) # label(non_clause). [assumption].
% 1.24/1.53
% 1.24/1.53 ============================== end of process non-clausal formulas ===
% 1.24/1.53
% 1.24/1.53 ============================== PROCESS INITIAL CLAUSES ===============
% 1.24/1.53
% 1.24/1.53 ============================== PREDICATE ELIMINATION =================
% 1.24/1.53
% 1.24/1.53 ============================== end predicate elimination =============
% 1.24/1.53
% 1.24/1.53 Auto_denials:
% 1.24/1.53 % copying label m__ to answer in negative clause
% 1.24/1.53
% 1.24/1.53 Term ordering decisions:
% 1.24/1.53
% 1.24/1.53 % Assigning unary symbol smndt0 kb_weight 0 and highest precedence (8).
% 1.24/1.53 Function symbol KB weights: sz00=1. sz10=1. xx=1. sdtasdt0=1. sdtpldt0=1. smndt0=0.
% 1.24/1.53
% 1.24/1.53 ============================== end of process initial clauses ========
% 1.24/1.53
% 1.24/1.53 ============================== CLAUSES FOR SEARCH ====================
% 1.24/1.53
% 1.24/1.53 ============================== end of clauses for search =============
% 1.24/1.53
% 1.24/1.53 ============================== SEARCH ================================
% 1.24/1.53
% 1.24/1.53 % Starting search at 0.01 seconds.
% 1.24/1.53
% 1.24/1.53 ============================== PROOF =================================
% 1.24/1.53 % SZS status Theorem
% 1.24/1.53 % SZS output start Refutation
% 1.24/1.53
% 1.24/1.53 % Proof 1 at 0.53 (+ 0.01) seconds: m__.
% 1.24/1.53 % Length of proof is 76.
% 1.24/1.53 % Level of proof is 10.
% 1.24/1.53 % Maximum clause weight is 19.000.
% 1.24/1.53 % Given clauses 44.
% 1.24/1.53
% 1.24/1.53 2 (all W0 (aElement0(W0) -> aElement0(smndt0(W0)))) # label(mSortsU) # label(axiom) # label(non_clause). [assumption].
% 1.24/1.53 3 (all W0 all W1 (aElement0(W0) & aElement0(W1) -> aElement0(sdtpldt0(W0,W1)))) # label(mSortsB) # label(axiom) # label(non_clause). [assumption].
% 1.24/1.53 4 (all W0 all W1 (aElement0(W0) & aElement0(W1) -> aElement0(sdtasdt0(W0,W1)))) # label(mSortsB_02) # label(axiom) # label(non_clause). [assumption].
% 1.24/1.53 6 (all W0 all W1 all W2 (aElement0(W0) & aElement0(W1) & aElement0(W2) -> sdtpldt0(sdtpldt0(W0,W1),W2) = sdtpldt0(W0,sdtpldt0(W1,W2)))) # label(mAddAsso) # label(axiom) # label(non_clause). [assumption].
% 1.24/1.53 7 (all W0 (aElement0(W0) -> sdtpldt0(W0,sz00) = W0 & W0 = sdtpldt0(sz00,W0))) # label(mAddZero) # label(axiom) # label(non_clause). [assumption].
% 1.24/1.53 8 (all W0 (aElement0(W0) -> sdtpldt0(W0,smndt0(W0)) = sz00 & sz00 = sdtpldt0(smndt0(W0),W0))) # label(mAddInvr) # label(axiom) # label(non_clause). [assumption].
% 1.24/1.53 9 (all W0 all W1 (aElement0(W0) & aElement0(W1) -> sdtasdt0(W0,W1) = sdtasdt0(W1,W0))) # label(mMulComm) # label(axiom) # label(non_clause). [assumption].
% 1.24/1.53 11 (all W0 (aElement0(W0) -> sdtasdt0(W0,sz10) = W0 & W0 = sdtasdt0(sz10,W0))) # label(mMulUnit) # label(axiom) # label(non_clause). [assumption].
% 1.24/1.53 12 (all W0 all W1 all W2 (aElement0(W0) & aElement0(W1) & aElement0(W2) -> sdtasdt0(W0,sdtpldt0(W1,W2)) = sdtpldt0(sdtasdt0(W0,W1),sdtasdt0(W0,W2)) & sdtasdt0(sdtpldt0(W1,W2),W0) = sdtpldt0(sdtasdt0(W1,W0),sdtasdt0(W2,W0)))) # label(mAMDistr) # label(axiom) # label(non_clause). [assumption].
% 1.24/1.53 13 aElement0(sz00) # label(mSortsC) # label(axiom). [assumption].
% 1.24/1.53 14 aElement0(sz10) # label(mSortsC_01) # label(axiom). [assumption].
% 1.24/1.53 15 aElement0(xx) # label(m__444) # label(hypothesis). [assumption].
% 1.24/1.53 16 sdtasdt0(smndt0(sz10),xx) != smndt0(xx) # label(m__) # label(negated_conjecture) # answer(m__). [assumption].
% 1.24/1.53 17 -aElement0(A) | aElement0(smndt0(A)) # label(mSortsU) # label(axiom). [clausify(2)].
% 1.24/1.53 18 -aElement0(A) | sdtpldt0(A,sz00) = A # label(mAddZero) # label(axiom). [clausify(7)].
% 1.24/1.53 19 -aElement0(A) | sdtpldt0(sz00,A) = A # label(mAddZero) # label(axiom). [clausify(7)].
% 1.24/1.53 20 -aElement0(A) | sdtasdt0(A,sz10) = A # label(mMulUnit) # label(axiom). [clausify(11)].
% 1.24/1.53 21 -aElement0(A) | sdtasdt0(sz10,A) = A # label(mMulUnit) # label(axiom). [clausify(11)].
% 1.24/1.53 22 -aElement0(A) | -aElement0(B) | aElement0(sdtpldt0(A,B)) # label(mSortsB) # label(axiom). [clausify(3)].
% 1.24/1.53 23 -aElement0(A) | -aElement0(B) | aElement0(sdtasdt0(A,B)) # label(mSortsB_02) # label(axiom). [clausify(4)].
% 1.24/1.53 24 -aElement0(A) | sdtpldt0(A,smndt0(A)) = sz00 # label(mAddInvr) # label(axiom). [clausify(8)].
% 1.24/1.53 25 -aElement0(A) | sdtpldt0(smndt0(A),A) = sz00 # label(mAddInvr) # label(axiom). [clausify(8)].
% 1.24/1.53 27 -aElement0(A) | -aElement0(B) | sdtasdt0(B,A) = sdtasdt0(A,B) # label(mMulComm) # label(axiom). [clausify(9)].
% 1.24/1.53 28 -aElement0(A) | -aElement0(B) | -aElement0(C) | sdtpldt0(sdtpldt0(A,B),C) = sdtpldt0(A,sdtpldt0(B,C)) # label(mAddAsso) # label(axiom). [clausify(6)].
% 1.24/1.53 30 -aElement0(A) | -aElement0(B) | -aElement0(C) | sdtasdt0(A,sdtpldt0(B,C)) = sdtpldt0(sdtasdt0(A,B),sdtasdt0(A,C)) # label(mAMDistr) # label(axiom). [clausify(12)].
% 1.24/1.53 31 -aElement0(A) | -aElement0(B) | -aElement0(C) | sdtpldt0(sdtasdt0(A,B),sdtasdt0(A,C)) = sdtasdt0(A,sdtpldt0(B,C)). [copy(30),flip(d)].
% 1.24/1.53 32 -aElement0(A) | -aElement0(B) | -aElement0(C) | sdtasdt0(sdtpldt0(B,C),A) = sdtpldt0(sdtasdt0(B,A),sdtasdt0(C,A)) # label(mAMDistr) # label(axiom). [clausify(12)].
% 1.24/1.53 33 -aElement0(A) | -aElement0(B) | -aElement0(C) | sdtpldt0(sdtasdt0(B,A),sdtasdt0(C,A)) = sdtasdt0(sdtpldt0(B,C),A). [copy(32),flip(d)].
% 1.24/1.53 34 aElement0(smndt0(xx)). [hyper(17,a,15,a)].
% 1.24/1.53 35 aElement0(smndt0(sz10)). [hyper(17,a,14,a)].
% 1.24/1.53 38 sdtpldt0(sz10,sz00) = sz10. [hyper(18,a,14,a)].
% 1.24/1.53 39 sdtpldt0(sz00,sz00) = sz00. [hyper(18,a,13,a)].
% 1.24/1.53 40 sdtpldt0(sz00,xx) = xx. [hyper(19,a,15,a)].
% 1.24/1.53 41 sdtpldt0(sz00,sz10) = sz10. [hyper(19,a,14,a)].
% 1.24/1.53 42 sdtasdt0(xx,sz10) = xx. [hyper(20,a,15,a)].
% 1.24/1.53 44 sdtasdt0(sz00,sz10) = sz00. [hyper(20,a,13,a)].
% 1.24/1.53 46 sdtasdt0(sz10,sz00) = sz00. [hyper(21,a,13,a)].
% 1.24/1.53 47 aElement0(sdtpldt0(xx,xx)). [hyper(22,a,15,a,b,15,a)].
% 1.24/1.53 50 aElement0(sdtpldt0(sz10,sz10)). [hyper(22,a,14,a,b,14,a)].
% 1.24/1.53 55 sdtpldt0(xx,smndt0(xx)) = sz00. [hyper(24,a,15,a)].
% 1.24/1.53 56 sdtpldt0(sz10,smndt0(sz10)) = sz00. [hyper(24,a,14,a)].
% 1.24/1.53 58 sdtpldt0(smndt0(xx),xx) = sz00. [hyper(25,a,15,a)].
% 1.24/1.53 59 sdtpldt0(smndt0(sz10),sz10) = sz00. [hyper(25,a,14,a)].
% 1.24/1.53 62 sdtasdt0(xx,sz00) = sdtasdt0(sz00,xx). [hyper(27,a,15,a,b,13,a),flip(a)].
% 1.24/1.53 105 sdtpldt0(sdtasdt0(sz00,xx),sdtasdt0(sz00,xx)) = sdtasdt0(sz00,xx). [hyper(31,a,15,a,b,13,a,c,13,a),rewrite([62(3),62(6),39(11),62(10)])].
% 1.24/1.53 124 sdtasdt0(sdtpldt0(xx,xx),sz00) = sdtasdt0(sz00,xx). [hyper(33,a,13,a,b,15,a,c,15,a),rewrite([62(3),62(6),105(7)]),flip(a)].
% 1.24/1.53 126 sdtasdt0(sdtpldt0(sz10,sz10),sz00) = sz00. [hyper(33,a,13,a,b,14,a,c,14,a),rewrite([46(3),46(4),39(3)]),flip(a)].
% 1.24/1.53 189 sdtpldt0(sdtasdt0(sz00,smndt0(xx)),sdtasdt0(sz00,xx)) = sdtasdt0(sz00,sz00). [hyper(31,a,13,a,b,34,a,c,15,a),rewrite([58(13)])].
% 1.24/1.53 239 sdtpldt0(smndt0(xx),sz00) = sdtpldt0(sz00,smndt0(xx)). [hyper(28,a,34,a,b,15,a,c,34,a),rewrite([58(4),55(10)]),flip(a)].
% 1.24/1.53 249 sdtpldt0(sz10,sdtpldt0(sz00,smndt0(xx))) = sdtpldt0(sz10,smndt0(xx)). [hyper(28,a,14,a,b,13,a,c,34,a),rewrite([38(3)]),flip(a)].
% 1.24/1.53 257 sdtpldt0(sdtpldt0(sz10,smndt0(xx)),xx) = sz10. [hyper(28,a,14,a,b,34,a,c,15,a),rewrite([58(11),38(9)])].
% 1.24/1.53 259 sdtpldt0(sdtpldt0(sz10,smndt0(xx)),sz00) = sdtpldt0(sz10,smndt0(xx)). [hyper(28,a,14,a,b,34,a,c,13,a),rewrite([239(11),249(12)])].
% 1.24/1.53 263 sdtpldt0(smndt0(xx),sdtpldt0(xx,xx)) = xx. [hyper(28,a,34,a,b,15,a,c,15,a),rewrite([58(4),40(3)]),flip(a)].
% 1.24/1.53 271 sdtasdt0(smndt0(xx),sz00) = sdtasdt0(sz00,smndt0(xx)). [hyper(27,a,13,a,b,34,a)].
% 1.24/1.53 280 aElement0(sdtpldt0(sz10,smndt0(xx))). [hyper(22,a,14,a,b,34,a)].
% 1.24/1.53 283 sdtpldt0(sz00,smndt0(xx)) = smndt0(xx). [hyper(19,a,34,a)].
% 1.24/1.53 418 sdtpldt0(xx,sdtasdt0(xx,smndt0(sz10))) = sdtasdt0(sz00,xx). [hyper(31,a,15,a,b,14,a,c,35,a),rewrite([42(3),56(11),62(9)])].
% 1.24/1.53 419 sdtpldt0(sdtasdt0(sz00,xx),sdtasdt0(xx,smndt0(sz10))) = sdtasdt0(xx,sdtpldt0(sz00,smndt0(sz10))). [hyper(31,a,15,a,b,13,a,c,35,a),rewrite([62(3)])].
% 1.24/1.53 448 sdtpldt0(sdtasdt0(sz00,smndt0(sz10)),sz00) = sdtasdt0(sz00,sz00). [hyper(31,a,13,a,b,35,a,c,14,a),rewrite([44(7),59(11)])].
% 1.24/1.53 577 sdtpldt0(smndt0(sz10),sdtpldt0(sz10,smndt0(xx))) = smndt0(xx). [hyper(28,a,35,a,b,14,a,c,34,a),rewrite([59(4),283(4)]),flip(a)].
% 1.24/1.53 579 sdtpldt0(smndt0(sz10),sdtpldt0(sz10,sz10)) = sz10. [hyper(28,a,35,a,b,14,a,c,14,a),rewrite([59(4),41(3)]),flip(a)].
% 1.24/1.53 583 sdtasdt0(smndt0(sz10),xx) = sdtasdt0(xx,smndt0(sz10)). [hyper(27,a,15,a,b,35,a)].
% 1.24/1.53 585 sdtasdt0(smndt0(sz10),sz00) = sdtasdt0(sz00,smndt0(sz10)). [hyper(27,a,13,a,b,35,a)].
% 1.24/1.53 592 aElement0(sdtasdt0(xx,smndt0(sz10))). [hyper(23,a,15,a,b,35,a)].
% 1.24/1.53 600 sdtpldt0(sz00,smndt0(sz10)) = smndt0(sz10). [hyper(19,a,35,a)].
% 1.24/1.53 646 sdtasdt0(xx,smndt0(sz10)) != smndt0(xx) # answer(m__). [back_rewrite(16),rewrite([583(4)])].
% 1.24/1.53 694 sdtpldt0(sdtasdt0(sz00,xx),sdtasdt0(xx,smndt0(sz10))) = sdtasdt0(xx,smndt0(sz10)). [back_rewrite(419),rewrite([600(13)])].
% 1.24/1.53 1113 sdtasdt0(sz00,xx) = sdtasdt0(sz00,sz00). [hyper(33,a,13,a,b,34,a,c,47,a),rewrite([271(4),124(9),189(8),263(9),62(6)]),flip(a)].
% 1.24/1.53 1314 sdtpldt0(sdtasdt0(sz00,sz00),sdtasdt0(xx,smndt0(sz10))) = sdtasdt0(xx,smndt0(sz10)). [back_rewrite(694),rewrite([1113(3)])].
% 1.24/1.53 1318 sdtpldt0(xx,sdtasdt0(xx,smndt0(sz10))) = sdtasdt0(sz00,sz00). [back_rewrite(418),rewrite([1113(9)])].
% 1.24/1.53 1820 sdtasdt0(sz00,sz00) = sz00. [hyper(33,a,13,a,b,35,a,c,50,a),rewrite([585(4),126(9),448(6),579(9),46(6)])].
% 1.24/1.53 2076 sdtpldt0(xx,sdtasdt0(xx,smndt0(sz10))) = sz00. [back_rewrite(1318),rewrite([1820(9)])].
% 1.24/1.53 2079 sdtpldt0(sz00,sdtasdt0(xx,smndt0(sz10))) = sdtasdt0(xx,smndt0(sz10)). [back_rewrite(1314),rewrite([1820(3)])].
% 1.24/1.53 7937 sdtpldt0(sz10,sdtasdt0(xx,smndt0(sz10))) = sdtpldt0(sz10,smndt0(xx)). [hyper(28,a,280,a,b,15,a,c,592,a),rewrite([257(6),2076(16),259(12)])].
% 1.24/1.53 7993 sdtasdt0(xx,smndt0(sz10)) = smndt0(xx). [hyper(28,a,35,a,b,14,a,c,592,a),rewrite([59(4),2079(6),7937(12),577(11)])].
% 1.24/1.53 7994 $F # answer(m__). [resolve(7993,a,646,a)].
% 1.24/1.53
% 1.24/1.53 % SZS output end Refutation
% 1.24/1.53 ============================== end of proof ==========================
% 1.24/1.53
% 1.24/1.53 ============================== STATISTICS ============================
% 1.24/1.53
% 1.24/1.53 Given=44. Generated=15473. Kept=7979. proofs=1.
% 1.24/1.53 Usable=40. Sos=2799. Demods=3497. Limbo=754, Disabled=4404. Hints=0.
% 1.24/1.53 Megabytes=7.14.
% 1.24/1.53 User_CPU=0.53, System_CPU=0.01, Wall_clock=1.
% 1.24/1.53
% 1.24/1.53 ============================== end of statistics =====================
% 1.24/1.53
% 1.24/1.53 ============================== end of search =========================
% 1.24/1.53
% 1.24/1.53 THEOREM PROVED
% 1.24/1.53 % SZS status Theorem
% 1.24/1.53
% 1.24/1.53 Exiting with 1 proof.
% 1.24/1.53
% 1.24/1.53 Process 29517 exit (max_proofs) Mon May 30 05:21:25 2022
% 1.24/1.53 Prover9 interrupted
%------------------------------------------------------------------------------