TSTP Solution File: NUM531+2 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : NUM531+2 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n019.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 13:28:34 EDT 2022
% Result : Theorem 0.45s 1.00s
% Output : Refutation 0.45s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : NUM531+2 : TPTP v8.1.0. Released v4.0.0.
% 0.03/0.13 % Command : tptp2X_and_run_prover9 %d %s
% 0.13/0.34 % Computer : n019.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 : Thu Jul 7 04:18:23 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.45/1.00 ============================== Prover9 ===============================
% 0.45/1.00 Prover9 (32) version 2009-11A, November 2009.
% 0.45/1.00 Process 28839 was started by sandbox on n019.cluster.edu,
% 0.45/1.00 Thu Jul 7 04:18:24 2022
% 0.45/1.00 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_28686_n019.cluster.edu".
% 0.45/1.00 ============================== end of head ===========================
% 0.45/1.00
% 0.45/1.00 ============================== INPUT =================================
% 0.45/1.00
% 0.45/1.00 % Reading from file /tmp/Prover9_28686_n019.cluster.edu
% 0.45/1.00
% 0.45/1.00 set(prolog_style_variables).
% 0.45/1.00 set(auto2).
% 0.45/1.00 % set(auto2) -> set(auto).
% 0.45/1.00 % set(auto) -> set(auto_inference).
% 0.45/1.00 % set(auto) -> set(auto_setup).
% 0.45/1.00 % set(auto_setup) -> set(predicate_elim).
% 0.45/1.00 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.45/1.00 % set(auto) -> set(auto_limits).
% 0.45/1.00 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.45/1.00 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.45/1.00 % set(auto) -> set(auto_denials).
% 0.45/1.00 % set(auto) -> set(auto_process).
% 0.45/1.00 % set(auto2) -> assign(new_constants, 1).
% 0.45/1.00 % set(auto2) -> assign(fold_denial_max, 3).
% 0.45/1.00 % set(auto2) -> assign(max_weight, "200.000").
% 0.45/1.00 % set(auto2) -> assign(max_hours, 1).
% 0.45/1.00 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.45/1.00 % set(auto2) -> assign(max_seconds, 0).
% 0.45/1.00 % set(auto2) -> assign(max_minutes, 5).
% 0.45/1.00 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.45/1.00 % set(auto2) -> set(sort_initial_sos).
% 0.45/1.00 % set(auto2) -> assign(sos_limit, -1).
% 0.45/1.00 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.45/1.00 % set(auto2) -> assign(max_megs, 400).
% 0.45/1.00 % set(auto2) -> assign(stats, some).
% 0.45/1.00 % set(auto2) -> clear(echo_input).
% 0.45/1.00 % set(auto2) -> set(quiet).
% 0.45/1.00 % set(auto2) -> clear(print_initial_clauses).
% 0.45/1.00 % set(auto2) -> clear(print_given).
% 0.45/1.00 assign(lrs_ticks,-1).
% 0.45/1.00 assign(sos_limit,10000).
% 0.45/1.00 assign(order,kbo).
% 0.45/1.00 set(lex_order_vars).
% 0.45/1.00 clear(print_given).
% 0.45/1.00
% 0.45/1.00 % formulas(sos). % not echoed (9 formulas)
% 0.45/1.00
% 0.45/1.00 ============================== end of input ==========================
% 0.45/1.00
% 0.45/1.00 % From the command line: assign(max_seconds, 300).
% 0.45/1.00
% 0.45/1.00 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.45/1.00
% 0.45/1.00 % Formulas that are not ordinary clauses:
% 0.45/1.00 1 (all W0 (aSet0(W0) -> $T)) # label(mSetSort) # label(axiom) # label(non_clause). [assumption].
% 0.45/1.00 2 (all W0 (aElement0(W0) -> $T)) # label(mElmSort) # label(axiom) # label(non_clause). [assumption].
% 0.45/1.00 3 (all W0 (aSet0(W0) -> (all W1 (aElementOf0(W1,W0) -> aElement0(W1))))) # label(mEOfElem) # label(axiom) # label(non_clause). [assumption].
% 0.45/1.00 4 (all W0 (aSet0(W0) -> (isFinite0(W0) -> $T))) # label(mFinRel) # label(axiom) # label(non_clause). [assumption].
% 0.45/1.00 5 (all W0 (W0 = slcrc0 <-> aSet0(W0) & -(exists W1 aElementOf0(W1,W0)))) # label(mDefEmp) # label(definition) # label(non_clause). [assumption].
% 0.45/1.00 6 (all W0 (aSet0(W0) -> (isCountable0(W0) -> $T))) # label(mCntRel) # label(axiom) # label(non_clause). [assumption].
% 0.45/1.00 7 (all W0 (aSet0(W0) & isCountable0(W0) -> -isFinite0(W0))) # label(mCountNFin) # label(axiom) # label(non_clause). [assumption].
% 0.45/1.00 8 -(all W0 (aSet0(W0) & isCountable0(W0) -> -(-(exists W1 aElementOf0(W1,W0)) & W0 = slcrc0))) # label(m__) # label(negated_conjecture) # label(non_clause). [assumption].
% 0.45/1.00
% 0.45/1.00 ============================== end of process non-clausal formulas ===
% 0.45/1.00
% 0.45/1.00 ============================== PROCESS INITIAL CLAUSES ===============
% 0.45/1.00
% 0.45/1.00 ============================== PREDICATE ELIMINATION =================
% 0.45/1.00 9 -aSet0(A) | -isCountable0(A) | -isFinite0(A) # label(mCountNFin) # label(axiom). [clausify(7)].
% 0.45/1.00 10 isFinite0(slcrc0) # label(mEmpFin) # label(axiom). [assumption].
% 0.45/1.00 Derived: -aSet0(slcrc0) | -isCountable0(slcrc0). [resolve(9,c,10,a)].
% 0.45/1.00
% 0.45/1.00 ============================== end predicate elimination =============
% 0.45/1.00
% 0.45/1.00 Auto_denials: (non-Horn, no changes).
% 0.45/1.00
% 0.45/1.00 Term ordering decisions:
% 0.45/1.00
% 0.45/1.00 % Assigning unary symbol f1 kb_weight 0 and highest precedence (7).
% 0.45/1.00 Function symbol KB weights: slcrc0=1. c1=1. f1=0.
% 0.45/1.00
% 0.45/1.00 ============================== PROOF =================================
% 0.45/1.00 % SZS status Theorem
% 0.45/1.00 % SZS output start Refutation
% 0.45/1.00
% 0.45/1.00 % Proof 1 at 0.01 (+ 0.00) seconds.
% 0.45/1.00 % Length of proof is 12.
% 0.45/1.00 % Level of proof is 4.
% 0.45/1.00 % Maximum clause weight is 4.000.
% 0.45/1.00 % Given clauses 0.
% 0.45/1.00
% 0.45/1.00 7 (all W0 (aSet0(W0) & isCountable0(W0) -> -isFinite0(W0))) # label(mCountNFin) # label(axiom) # label(non_clause). [assumption].
% 0.45/1.00 8 -(all W0 (aSet0(W0) & isCountable0(W0) -> -(-(exists W1 aElementOf0(W1,W0)) & W0 = slcrc0))) # label(m__) # label(negated_conjecture) # label(non_clause). [assumption].
% 0.45/1.00 9 -aSet0(A) | -isCountable0(A) | -isFinite0(A) # label(mCountNFin) # label(axiom). [clausify(7)].
% 0.45/1.00 10 isFinite0(slcrc0) # label(mEmpFin) # label(axiom). [assumption].
% 0.45/1.00 11 aSet0(c1) # label(m__) # label(negated_conjecture). [clausify(8)].
% 0.45/1.00 12 isCountable0(c1) # label(m__) # label(negated_conjecture). [clausify(8)].
% 0.45/1.00 13 slcrc0 = c1 # label(m__) # label(negated_conjecture). [clausify(8)].
% 0.45/1.00 14 c1 = slcrc0. [copy(13),flip(a)].
% 0.45/1.00 20 -aSet0(slcrc0) | -isCountable0(slcrc0). [resolve(9,c,10,a)].
% 0.45/1.00 21 isCountable0(slcrc0). [back_rewrite(12),rewrite([14(1)])].
% 0.45/1.00 22 aSet0(slcrc0). [back_rewrite(11),rewrite([14(1)])].
% 0.45/1.00 23 $F. [back_unit_del(20),unit_del(a,22),unit_del(b,21)].
% 0.45/1.00
% 0.45/1.00 % SZS output end Refutation
% 0.45/1.00 ============================== end of proof ==========================
% 0.45/1.00
% 0.45/1.00 ============================== STATISTICS ============================
% 0.45/1.00
% 0.45/1.00 Given=0. Generated=11. Kept=10. proofs=1.
% 0.45/1.00 Usable=0. Sos=5. Demods=1. Limbo=2, Disabled=14. Hints=0.
% 0.45/1.00 Megabytes=0.03.
% 0.45/1.00 User_CPU=0.01, System_CPU=0.00, Wall_clock=0.
% 0.45/1.00
% 0.45/1.00 ============================== end of statistics =====================
% 0.45/1.00
% 0.45/1.00 ============================== end of search =========================
% 0.45/1.00
% 0.45/1.00 THEOREM PROVED
% 0.45/1.00 % SZS status Theorem
% 0.45/1.00
% 0.45/1.00 Exiting with 1 proof.
% 0.45/1.00
% 0.45/1.00 Process 28839 exit (max_proofs) Thu Jul 7 04:18:24 2022
% 0.45/1.00 Prover9 interrupted
%------------------------------------------------------------------------------