TSTP Solution File: RNG083+1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : RNG083+1 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n024.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 0.46s 1.03s
% Output : Refutation 0.46s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.13 % Problem : RNG083+1 : TPTP v8.1.0. Released v4.0.0.
% 0.04/0.13 % Command : tptp2X_and_run_prover9 %d %s
% 0.13/0.35 % Computer : n024.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 600
% 0.13/0.35 % DateTime : Mon May 30 22:28:21 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.46/1.01 ============================== Prover9 ===============================
% 0.46/1.01 Prover9 (32) version 2009-11A, November 2009.
% 0.46/1.01 Process 19177 was started by sandbox on n024.cluster.edu,
% 0.46/1.01 Mon May 30 22:28:22 2022
% 0.46/1.01 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_19024_n024.cluster.edu".
% 0.46/1.01 ============================== end of head ===========================
% 0.46/1.01
% 0.46/1.01 ============================== INPUT =================================
% 0.46/1.01
% 0.46/1.01 % Reading from file /tmp/Prover9_19024_n024.cluster.edu
% 0.46/1.01
% 0.46/1.01 set(prolog_style_variables).
% 0.46/1.01 set(auto2).
% 0.46/1.01 % set(auto2) -> set(auto).
% 0.46/1.01 % set(auto) -> set(auto_inference).
% 0.46/1.01 % set(auto) -> set(auto_setup).
% 0.46/1.01 % set(auto_setup) -> set(predicate_elim).
% 0.46/1.01 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.46/1.01 % set(auto) -> set(auto_limits).
% 0.46/1.01 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.46/1.01 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.46/1.01 % set(auto) -> set(auto_denials).
% 0.46/1.01 % set(auto) -> set(auto_process).
% 0.46/1.01 % set(auto2) -> assign(new_constants, 1).
% 0.46/1.01 % set(auto2) -> assign(fold_denial_max, 3).
% 0.46/1.01 % set(auto2) -> assign(max_weight, "200.000").
% 0.46/1.01 % set(auto2) -> assign(max_hours, 1).
% 0.46/1.01 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.46/1.01 % set(auto2) -> assign(max_seconds, 0).
% 0.46/1.01 % set(auto2) -> assign(max_minutes, 5).
% 0.46/1.01 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.46/1.01 % set(auto2) -> set(sort_initial_sos).
% 0.46/1.01 % set(auto2) -> assign(sos_limit, -1).
% 0.46/1.01 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.46/1.01 % set(auto2) -> assign(max_megs, 400).
% 0.46/1.01 % set(auto2) -> assign(stats, some).
% 0.46/1.01 % set(auto2) -> clear(echo_input).
% 0.46/1.01 % set(auto2) -> set(quiet).
% 0.46/1.01 % set(auto2) -> clear(print_initial_clauses).
% 0.46/1.01 % set(auto2) -> clear(print_given).
% 0.46/1.01 assign(lrs_ticks,-1).
% 0.46/1.01 assign(sos_limit,10000).
% 0.46/1.01 assign(order,kbo).
% 0.46/1.01 set(lex_order_vars).
% 0.46/1.01 clear(print_given).
% 0.46/1.01
% 0.46/1.01 % formulas(sos). % not echoed (17 formulas)
% 0.46/1.01
% 0.46/1.01 ============================== end of input ==========================
% 0.46/1.01
% 0.46/1.01 % From the command line: assign(max_seconds, 300).
% 0.46/1.01
% 0.46/1.01 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.46/1.01
% 0.46/1.01 % Formulas that are not ordinary clauses:
% 0.46/1.01 1 (all W0 (aElement0(W0) -> $T)) # label(mElmSort) # label(axiom) # label(non_clause). [assumption].
% 0.46/1.01 2 (all W0 (aElement0(W0) -> aElement0(smndt0(W0)))) # label(mSortsU) # label(axiom) # label(non_clause). [assumption].
% 0.46/1.01 3 (all W0 all W1 (aElement0(W0) & aElement0(W1) -> aElement0(sdtpldt0(W0,W1)))) # label(mSortsB) # label(axiom) # label(non_clause). [assumption].
% 0.46/1.01 4 (all W0 all W1 (aElement0(W0) & aElement0(W1) -> aElement0(sdtasdt0(W0,W1)))) # label(mSortsB_02) # label(axiom) # label(non_clause). [assumption].
% 0.46/1.01 5 (all W0 all W1 (aElement0(W0) & aElement0(W1) -> sdtpldt0(W0,W1) = sdtpldt0(W1,W0))) # label(mAddComm) # label(axiom) # label(non_clause). [assumption].
% 0.46/1.01 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.46/1.01 7 (all W0 (aElement0(W0) -> sdtpldt0(W0,sz00) = W0 & W0 = sdtpldt0(sz00,W0))) # label(mAddZero) # label(axiom) # label(non_clause). [assumption].
% 0.46/1.01 8 (all W0 (aElement0(W0) -> sdtpldt0(W0,smndt0(W0)) = sz00 & sz00 = sdtpldt0(smndt0(W0),W0))) # label(mAddInvr) # label(axiom) # label(non_clause). [assumption].
% 0.46/1.01 9 (all W0 all W1 (aElement0(W0) & aElement0(W1) -> sdtasdt0(W0,W1) = sdtasdt0(W1,W0))) # label(mMulComm) # label(axiom) # label(non_clause). [assumption].
% 0.46/1.01 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.46/1.01 11 (all W0 (aElement0(W0) -> sdtasdt0(W0,sz10) = W0 & W0 = sdtasdt0(sz10,W0))) # label(mMulUnit) # label(axiom) # label(non_clause). [assumption].
% 0.46/1.01 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].
% 0.46/1.03 13 (all W0 (aElement0(W0) -> sdtasdt0(smndt0(sz10),W0) = smndt0(W0) & smndt0(W0) = sdtasdt0(W0,smndt0(sz10)))) # label(mMulMnOne) # label(axiom) # label(non_clause). [assumption].
% 0.46/1.03 14 -(sdtasdt0(xx,sz00) = sz00 & sz00 = sdtasdt0(sz00,xx)) # label(m__) # label(negated_conjecture) # label(non_clause). [assumption].
% 0.46/1.03
% 0.46/1.03 ============================== end of process non-clausal formulas ===
% 0.46/1.03
% 0.46/1.03 ============================== PROCESS INITIAL CLAUSES ===============
% 0.46/1.03
% 0.46/1.03 ============================== PREDICATE ELIMINATION =================
% 0.46/1.03
% 0.46/1.03 ============================== end predicate elimination =============
% 0.46/1.03
% 0.46/1.03 Auto_denials:
% 0.46/1.03 % copying label m__ to answer in negative clause
% 0.46/1.03
% 0.46/1.03 Term ordering decisions:
% 0.46/1.03
% 0.46/1.03 % Assigning unary symbol smndt0 kb_weight 0 and highest precedence (8).
% 0.46/1.03 Function symbol KB weights: sz00=1. sz10=1. xx=1. sdtasdt0=1. sdtpldt0=1. smndt0=0.
% 0.46/1.03
% 0.46/1.03 ============================== end of process initial clauses ========
% 0.46/1.03
% 0.46/1.03 ============================== CLAUSES FOR SEARCH ====================
% 0.46/1.03
% 0.46/1.03 ============================== end of clauses for search =============
% 0.46/1.03
% 0.46/1.03 ============================== SEARCH ================================
% 0.46/1.03
% 0.46/1.03 % Starting search at 0.01 seconds.
% 0.46/1.03
% 0.46/1.03 ============================== PROOF =================================
% 0.46/1.03 % SZS status Theorem
% 0.46/1.03 % SZS output start Refutation
% 0.46/1.03
% 0.46/1.03 % Proof 1 at 0.03 (+ 0.00) seconds: m__.
% 0.46/1.03 % Length of proof is 26.
% 0.46/1.03 % Level of proof is 4.
% 0.46/1.03 % Maximum clause weight is 19.000.
% 0.46/1.03 % Given clauses 24.
% 0.46/1.03
% 0.46/1.03 2 (all W0 (aElement0(W0) -> aElement0(smndt0(W0)))) # label(mSortsU) # label(axiom) # label(non_clause). [assumption].
% 0.46/1.03 8 (all W0 (aElement0(W0) -> sdtpldt0(W0,smndt0(W0)) = sz00 & sz00 = sdtpldt0(smndt0(W0),W0))) # label(mAddInvr) # label(axiom) # label(non_clause). [assumption].
% 0.46/1.03 9 (all W0 all W1 (aElement0(W0) & aElement0(W1) -> sdtasdt0(W0,W1) = sdtasdt0(W1,W0))) # label(mMulComm) # label(axiom) # label(non_clause). [assumption].
% 0.46/1.03 11 (all W0 (aElement0(W0) -> sdtasdt0(W0,sz10) = W0 & W0 = sdtasdt0(sz10,W0))) # label(mMulUnit) # label(axiom) # label(non_clause). [assumption].
% 0.46/1.03 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].
% 0.46/1.03 13 (all W0 (aElement0(W0) -> sdtasdt0(smndt0(sz10),W0) = smndt0(W0) & smndt0(W0) = sdtasdt0(W0,smndt0(sz10)))) # label(mMulMnOne) # label(axiom) # label(non_clause). [assumption].
% 0.46/1.03 14 -(sdtasdt0(xx,sz00) = sz00 & sz00 = sdtasdt0(sz00,xx)) # label(m__) # label(negated_conjecture) # label(non_clause). [assumption].
% 0.46/1.03 15 aElement0(sz00) # label(mSortsC) # label(axiom). [assumption].
% 0.46/1.03 16 aElement0(sz10) # label(mSortsC_01) # label(axiom). [assumption].
% 0.46/1.03 17 aElement0(xx) # label(m__468) # label(hypothesis). [assumption].
% 0.46/1.03 18 sdtasdt0(xx,sz00) != sz00 | sdtasdt0(sz00,xx) != sz00 # label(m__) # label(negated_conjecture) # answer(m__). [clausify(14)].
% 0.46/1.03 19 -aElement0(A) | aElement0(smndt0(A)) # label(mSortsU) # label(axiom). [clausify(2)].
% 0.46/1.03 23 -aElement0(A) | sdtasdt0(sz10,A) = A # label(mMulUnit) # label(axiom). [clausify(11)].
% 0.46/1.03 26 -aElement0(A) | sdtpldt0(A,smndt0(A)) = sz00 # label(mAddInvr) # label(axiom). [clausify(8)].
% 0.46/1.03 28 -aElement0(A) | sdtasdt0(smndt0(sz10),A) = smndt0(A) # label(mMulMnOne) # label(axiom). [clausify(13)].
% 0.46/1.03 31 -aElement0(A) | -aElement0(B) | sdtasdt0(B,A) = sdtasdt0(A,B) # label(mMulComm) # label(axiom). [clausify(9)].
% 0.46/1.03 36 -aElement0(A) | -aElement0(B) | -aElement0(C) | sdtasdt0(sdtpldt0(B,C),A) = sdtpldt0(sdtasdt0(B,A),sdtasdt0(C,A)) # label(mAMDistr) # label(axiom). [clausify(12)].
% 0.46/1.03 37 -aElement0(A) | -aElement0(B) | -aElement0(C) | sdtpldt0(sdtasdt0(B,A),sdtasdt0(C,A)) = sdtasdt0(sdtpldt0(B,C),A). [copy(36),flip(d)].
% 0.46/1.03 39 aElement0(smndt0(sz10)). [hyper(19,a,16,a)].
% 0.46/1.03 49 sdtasdt0(sz10,xx) = xx. [hyper(23,a,17,a)].
% 0.46/1.03 59 sdtpldt0(xx,smndt0(xx)) = sz00. [hyper(26,a,17,a)].
% 0.46/1.03 60 sdtpldt0(sz10,smndt0(sz10)) = sz00. [hyper(26,a,16,a)].
% 0.46/1.03 65 sdtasdt0(smndt0(sz10),xx) = smndt0(xx). [hyper(28,a,17,a)].
% 0.46/1.03 72 sdtasdt0(xx,sz00) = sdtasdt0(sz00,xx). [hyper(31,a,17,a,b,15,a),flip(a)].
% 0.46/1.03 73 sdtasdt0(sz00,xx) != sz00 # answer(m__). [back_rewrite(18),rewrite([72(3)]),merge(b)].
% 0.46/1.03 370 $F # answer(m__). [hyper(37,a,17,a,b,16,a,c,39,a),rewrite([49(3),65(5),59(4),60(5)]),flip(a),unit_del(a,73)].
% 0.46/1.03
% 0.46/1.03 % SZS output end Refutation
% 0.46/1.03 ============================== end of proof ==========================
% 0.46/1.03
% 0.46/1.03 ============================== STATISTICS ============================
% 0.46/1.03
% 0.46/1.03 Given=24. Generated=564. Kept=353. proofs=1.
% 0.46/1.03 Usable=23. Sos=192. Demods=192. Limbo=13, Disabled=146. Hints=0.
% 0.46/1.03 Megabytes=0.30.
% 0.46/1.03 User_CPU=0.03, System_CPU=0.00, Wall_clock=0.
% 0.46/1.03
% 0.46/1.03 ============================== end of statistics =====================
% 0.46/1.03
% 0.46/1.03 ============================== end of search =========================
% 0.46/1.03
% 0.46/1.03 THEOREM PROVED
% 0.46/1.03 % SZS status Theorem
% 0.46/1.03
% 0.46/1.03 Exiting with 1 proof.
% 0.46/1.03
% 0.46/1.03 Process 19177 exit (max_proofs) Mon May 30 22:28:22 2022
% 0.46/1.03 Prover9 interrupted
%------------------------------------------------------------------------------