TSTP Solution File: RNG048+1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : RNG048+1 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n017.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:16 EDT 2022
% Result : Timeout 300.03s 300.30s
% Output : None
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : RNG048+1 : TPTP v8.1.0. Released v4.0.0.
% 0.06/0.12 % Command : tptp2X_and_run_prover9 %d %s
% 0.12/0.33 % Computer : n017.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 21:28:25 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.42/1.00 ============================== Prover9 ===============================
% 0.42/1.00 Prover9 (32) version 2009-11A, November 2009.
% 0.42/1.00 Process 6286 was started by sandbox on n017.cluster.edu,
% 0.42/1.00 Mon May 30 21:28:26 2022
% 0.42/1.00 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_6133_n017.cluster.edu".
% 0.42/1.00 ============================== end of head ===========================
% 0.42/1.00
% 0.42/1.00 ============================== INPUT =================================
% 0.42/1.00
% 0.42/1.00 % Reading from file /tmp/Prover9_6133_n017.cluster.edu
% 0.42/1.00
% 0.42/1.00 set(prolog_style_variables).
% 0.42/1.00 set(auto2).
% 0.42/1.00 % set(auto2) -> set(auto).
% 0.42/1.00 % set(auto) -> set(auto_inference).
% 0.42/1.00 % set(auto) -> set(auto_setup).
% 0.42/1.00 % set(auto_setup) -> set(predicate_elim).
% 0.42/1.00 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.42/1.00 % set(auto) -> set(auto_limits).
% 0.42/1.00 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.42/1.00 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.42/1.00 % set(auto) -> set(auto_denials).
% 0.42/1.00 % set(auto) -> set(auto_process).
% 0.42/1.00 % set(auto2) -> assign(new_constants, 1).
% 0.42/1.00 % set(auto2) -> assign(fold_denial_max, 3).
% 0.42/1.00 % set(auto2) -> assign(max_weight, "200.000").
% 0.42/1.00 % set(auto2) -> assign(max_hours, 1).
% 0.42/1.00 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.42/1.00 % set(auto2) -> assign(max_seconds, 0).
% 0.42/1.00 % set(auto2) -> assign(max_minutes, 5).
% 0.42/1.00 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.42/1.00 % set(auto2) -> set(sort_initial_sos).
% 0.42/1.00 % set(auto2) -> assign(sos_limit, -1).
% 0.42/1.00 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.42/1.00 % set(auto2) -> assign(max_megs, 400).
% 0.42/1.00 % set(auto2) -> assign(stats, some).
% 0.42/1.00 % set(auto2) -> clear(echo_input).
% 0.42/1.00 % set(auto2) -> set(quiet).
% 0.42/1.00 % set(auto2) -> clear(print_initial_clauses).
% 0.42/1.00 % set(auto2) -> clear(print_given).
% 0.42/1.00 assign(lrs_ticks,-1).
% 0.42/1.00 assign(sos_limit,10000).
% 0.42/1.00 assign(order,kbo).
% 0.42/1.00 set(lex_order_vars).
% 0.42/1.00 clear(print_given).
% 0.42/1.00
% 0.42/1.00 % formulas(sos). % not echoed (37 formulas)
% 0.42/1.00
% 0.42/1.00 ============================== end of input ==========================
% 0.42/1.00
% 0.42/1.00 % From the command line: assign(max_seconds, 300).
% 0.42/1.00
% 0.42/1.00 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.42/1.00
% 0.42/1.00 % Formulas that are not ordinary clauses:
% 0.42/1.00 1 (all W0 (aNaturalNumber0(W0) -> $T)) # label(mNatSort) # label(axiom) # label(non_clause). [assumption].
% 0.42/1.00 2 (all W0 (aNaturalNumber0(W0) -> aNaturalNumber0(szszuzczcdt0(W0)) & szszuzczcdt0(W0) != sz00)) # label(mSuccNat) # label(axiom) # label(non_clause). [assumption].
% 0.42/1.00 3 (all W0 (aNaturalNumber0(W0) & W0 != sz00 -> (exists W1 (aNaturalNumber0(W1) & W0 = szszuzczcdt0(W1))))) # label(mNatExtr) # label(axiom) # label(non_clause). [assumption].
% 0.42/1.00 4 (all W0 all W1 (aNaturalNumber0(W0) & aNaturalNumber0(W1) -> (szszuzczcdt0(W0) = szszuzczcdt0(W1) -> W0 = W1))) # label(mSuccEqu) # label(axiom) # label(non_clause). [assumption].
% 0.42/1.00 5 (all W0 all W1 (aNaturalNumber0(W0) & aNaturalNumber0(W1) -> (iLess0(W0,W1) -> $T))) # label(mIHOrd) # label(axiom) # label(non_clause). [assumption].
% 0.42/1.00 6 (all W0 (aNaturalNumber0(W0) -> iLess0(W0,szszuzczcdt0(W0)))) # label(mIH) # label(axiom) # label(non_clause). [assumption].
% 0.42/1.00 7 (all W0 (aScalar0(W0) -> $T)) # label(mScSort) # label(axiom) # label(non_clause). [assumption].
% 0.42/1.00 8 (all W0 all W1 (aScalar0(W0) & aScalar0(W1) -> aScalar0(sdtpldt0(W0,W1)))) # label(mSumSc) # label(axiom) # label(non_clause). [assumption].
% 0.42/1.00 9 (all W0 all W1 (aScalar0(W0) & aScalar0(W1) -> aScalar0(sdtasdt0(W0,W1)))) # label(mMulSc) # label(axiom) # label(non_clause). [assumption].
% 0.42/1.00 10 (all W0 (aScalar0(W0) -> aScalar0(smndt0(W0)))) # label(mNegSc) # label(axiom) # label(non_clause). [assumption].
% 0.42/1.00 11 (all W0 (aScalar0(W0) -> sdtpldt0(W0,sz0z00) = W0 & sdtpldt0(sz0z00,W0) = W0 & sdtasdt0(W0,sz0z00) = sz0z00 & sdtasdt0(sz0z00,W0) = sz0z00 & sdtpldt0(W0,smndt0(W0)) = sz0z00 & sdtpldt0(smndt0(W0),W0) = sz0z00 & smndt0(smndt0(W0)) = W0 & smndt0(sz0z00) = sz0z00)) # label(mScZero) # label(axiom) # label(non_clause). [assumption].
% 0.42/1.00 12 (all W0 all W1 all W2 (aScalar0(W0) & aScalar0(W1) & aScalar0(W2) -> sdtpldt0(sdtpldt0(W0,W1),W2) = sdtpldt0(W0,sdtpldt0(W1,W2)) & sdtpldt0(W0,W1) = sdtpldt0(W1,W0) & sdtasdt0(sdtasdt0(W0,W1),W2) = sdtasdt0(W0,sdtasdt0(W1,W2)) & sdtasdt0(W0,W1) = sdtasdt0(W1,W0))) # label(mArith) # label(axiom) # label(non_clause). [assumption].
% 0.42/1.00 13 (all W0 all W1 all W2 (aScalar0(W0) & aScalar0(W1) & aScalar0(W2) -> sdtasdt0(W0,sdtpldt0(W1,W2)) = sdtpldt0(sdtasdt0(W0,W1),sdtasdt0(W0,W2)) & sdtasdt0(sdtpldt0(W0,W1),W2) = sdtpldt0(sdtasdt0(W0,W2),sdtasdt0(W1,W2)))) # label(mDistr) # label(axiom) # label(non_clause). [assumption].
% 0.42/1.00 14 (all W0 all W1 all W2 all W3 (aScalar0(W0) & aScalar0(W1) & aScalar0(W2) & aScalar0(W3) -> sdtasdt0(sdtpldt0(W0,W1),sdtpldt0(W2,W3)) = sdtpldt0(sdtpldt0(sdtasdt0(W0,W2),sdtasdt0(W0,W3)),sdtpldt0(sdtasdt0(W1,W2),sdtasdt0(W1,W3))))) # label(mDistr2) # label(axiom) # label(non_clause). [assumption].
% 0.42/1.00 15 (all W0 all W1 (aScalar0(W0) & aScalar0(W1) -> sdtasdt0(W0,smndt0(W1)) = smndt0(sdtasdt0(W0,W1)) & sdtasdt0(smndt0(W0),W1) = smndt0(sdtasdt0(W0,W1)))) # label(mMNeg) # label(axiom) # label(non_clause). [assumption].
% 0.42/1.00 16 (all W0 all W1 (aScalar0(W0) & aScalar0(W1) -> sdtasdt0(smndt0(W0),smndt0(W1)) = sdtasdt0(W0,W1))) # label(mMDNeg) # label(axiom) # label(non_clause). [assumption].
% 0.42/1.00 17 (all W0 all W1 (aScalar0(W0) & aScalar0(W1) -> (sdtlseqdt0(W0,W1) -> $T))) # label(mLess) # label(axiom) # label(non_clause). [assumption].
% 0.42/1.00 18 (all W0 (aScalar0(W0) -> sdtlseqdt0(W0,W0))) # label(mLERef) # label(axiom) # label(non_clause). [assumption].
% 0.42/1.00 19 (all W0 all W1 (aScalar0(W0) & aScalar0(W1) -> (sdtlseqdt0(W0,W1) & sdtlseqdt0(W1,W0) -> W0 = W1))) # label(mLEASm) # label(axiom) # label(non_clause). [assumption].
% 0.42/1.00 20 (all W0 all W1 all W2 (aScalar0(W0) & aScalar0(W1) & aScalar0(W2) -> (sdtlseqdt0(W0,W1) & sdtlseqdt0(W1,W2) -> sdtlseqdt0(W0,W2)))) # label(mLETrn) # label(axiom) # label(non_clause). [assumption].
% 0.42/1.00 21 (all W0 all W1 all W2 all W3 (aScalar0(W0) & aScalar0(W1) & aScalar0(W2) & aScalar0(W3) -> (sdtlseqdt0(W0,W1) & sdtlseqdt0(W2,W3) -> sdtlseqdt0(sdtpldt0(W0,W2),sdtpldt0(W1,W3))))) # label(mLEMon) # label(axiom) # label(non_clause). [assumption].
% 0.42/1.00 22 (all W0 all W1 all W2 all W3 (aScalar0(W0) & aScalar0(W1) & aScalar0(W2) & aScalar0(W3) -> (sdtlseqdt0(W0,W1) & sdtlseqdt0(sz0z00,W2) & sdtlseqdt0(W2,W3) -> sdtlseqdt0(sdtasdt0(W0,W2),sdtasdt0(W1,W3))))) # label(mLEMonM) # label(axiom) # label(non_clause). [assumption].
% 0.42/1.00 23 (all W0 all W1 (aScalar0(W0) & aScalar0(W1) -> sdtlseqdt0(W0,W1) | sdtlseqdt0(W1,W0))) # label(mLETot) # label(axiom) # label(non_clause). [assumption].
% 0.42/1.00 24 (all W0 all W1 (aScalar0(W0) & aScalar0(W1) -> (sdtlseqdt0(sz0z00,W0) & sdtlseqdt0(sz0z00,W1) -> sdtlseqdt0(sz0z00,sdtpldt0(W0,W1)) & sdtlseqdt0(sz0z00,sdtasdt0(W0,W1))))) # label(mPosMon) # label(axiom) # label(non_clause). [assumption].
% 0.42/1.00 25 (all W0 (aScalar0(W0) -> sdtlseqdt0(sz0z00,sdtasdt0(W0,W0)))) # label(mSqPos) # label(axiom) # label(non_clause). [assumption].
% 0.42/1.00 26 (all W0 all W1 (aScalar0(W0) & aScalar0(W1) -> (sdtlseqdt0(sz0z00,W0) & sdtlseqdt0(sz0z00,W1) & sdtasdt0(W0,W0) = sdtasdt0(W1,W1) -> W0 = W1))) # label(mSqrt) # label(axiom) # label(non_clause). [assumption].
% 0.42/1.00 27 (all W0 (aVector0(W0) -> $T)) # label(mVcSort) # label(axiom) # label(non_clause). [assumption].
% 0.42/1.00 28 (all W0 (aVector0(W0) -> aNaturalNumber0(aDimensionOf0(W0)))) # label(mDimNat) # label(axiom) # label(non_clause). [assumption].
% 0.42/1.00 29 (all W0 all W1 (aVector0(W0) & aNaturalNumber0(W1) -> aScalar0(sdtlbdtrb0(W0,W1)))) # label(mElmSc) # label(axiom) # label(non_clause). [assumption].
% 0.42/1.00 30 (all W0 (aVector0(W0) -> (aDimensionOf0(W0) != sz00 -> (all W1 (W1 = sziznziztdt0(W0) <-> aVector0(W1) & szszuzczcdt0(aDimensionOf0(W1)) = aDimensionOf0(W0) & (all W2 (aNaturalNumber0(W2) -> sdtlbdtrb0(W1,W2) = sdtlbdtrb0(W0,W2)))))))) # label(mDefInit) # label(definition) # label(non_clause). [assumption].
% 0.42/1.00 31 (all W0 all W1 (aVector0(W0) & aVector0(W1) -> (aDimensionOf0(W0) = aDimensionOf0(W1) & aDimensionOf0(W1) != sz00 -> aDimensionOf0(sziznziztdt0(W0)) = aDimensionOf0(sziznziztdt0(W1))))) # label(mEqInit) # label(axiom) # label(non_clause). [assumption].
% 0.42/1.00 32 (all W0 all W1 (aVector0(W0) & aVector0(W1) -> (aDimensionOf0(W0) = aDimensionOf0(W1) -> aScalar0(sdtasasdt0(W0,W1))))) # label(mCputime limit exceeded (core dumped)
%------------------------------------------------------------------------------