TSTP Solution File: SEU303+1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : SEU303+1 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n013.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 : Tue Jul 19 13:30:48 EDT 2022
% Result : Theorem 0.65s 0.95s
% Output : Refutation 0.65s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.10 % Problem : SEU303+1 : TPTP v8.1.0. Released v3.3.0.
% 0.06/0.11 % Command : tptp2X_and_run_prover9 %d %s
% 0.11/0.32 % Computer : n013.cluster.edu
% 0.11/0.32 % Model : x86_64 x86_64
% 0.11/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.32 % Memory : 8042.1875MB
% 0.11/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.32 % CPULimit : 300
% 0.11/0.32 % WCLimit : 600
% 0.11/0.32 % DateTime : Sat Jun 18 19:19:59 EDT 2022
% 0.11/0.32 % CPUTime :
% 0.65/0.95 ============================== Prover9 ===============================
% 0.65/0.95 Prover9 (32) version 2009-11A, November 2009.
% 0.65/0.95 Process 8687 was started by sandbox on n013.cluster.edu,
% 0.65/0.95 Sat Jun 18 19:19:59 2022
% 0.65/0.95 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_8304_n013.cluster.edu".
% 0.65/0.95 ============================== end of head ===========================
% 0.65/0.95
% 0.65/0.95 ============================== INPUT =================================
% 0.65/0.95
% 0.65/0.95 % Reading from file /tmp/Prover9_8304_n013.cluster.edu
% 0.65/0.95
% 0.65/0.95 set(prolog_style_variables).
% 0.65/0.95 set(auto2).
% 0.65/0.95 % set(auto2) -> set(auto).
% 0.65/0.95 % set(auto) -> set(auto_inference).
% 0.65/0.95 % set(auto) -> set(auto_setup).
% 0.65/0.95 % set(auto_setup) -> set(predicate_elim).
% 0.65/0.95 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.65/0.95 % set(auto) -> set(auto_limits).
% 0.65/0.95 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.65/0.95 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.65/0.95 % set(auto) -> set(auto_denials).
% 0.65/0.95 % set(auto) -> set(auto_process).
% 0.65/0.95 % set(auto2) -> assign(new_constants, 1).
% 0.65/0.95 % set(auto2) -> assign(fold_denial_max, 3).
% 0.65/0.95 % set(auto2) -> assign(max_weight, "200.000").
% 0.65/0.95 % set(auto2) -> assign(max_hours, 1).
% 0.65/0.95 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.65/0.95 % set(auto2) -> assign(max_seconds, 0).
% 0.65/0.95 % set(auto2) -> assign(max_minutes, 5).
% 0.65/0.95 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.65/0.95 % set(auto2) -> set(sort_initial_sos).
% 0.65/0.95 % set(auto2) -> assign(sos_limit, -1).
% 0.65/0.95 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.65/0.95 % set(auto2) -> assign(max_megs, 400).
% 0.65/0.95 % set(auto2) -> assign(stats, some).
% 0.65/0.95 % set(auto2) -> clear(echo_input).
% 0.65/0.95 % set(auto2) -> set(quiet).
% 0.65/0.95 % set(auto2) -> clear(print_initial_clauses).
% 0.65/0.95 % set(auto2) -> clear(print_given).
% 0.65/0.95 assign(lrs_ticks,-1).
% 0.65/0.95 assign(sos_limit,10000).
% 0.65/0.95 assign(order,kbo).
% 0.65/0.95 set(lex_order_vars).
% 0.65/0.95 clear(print_given).
% 0.65/0.95
% 0.65/0.95 % formulas(sos). % not echoed (8 formulas)
% 0.65/0.95
% 0.65/0.95 ============================== end of input ==========================
% 0.65/0.95
% 0.65/0.95 % From the command line: assign(max_seconds, 300).
% 0.65/0.95
% 0.65/0.95 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.65/0.95
% 0.65/0.95 % Formulas that are not ordinary clauses:
% 0.65/0.95 1 $T # label(dt_k1_relat_1) # label(axiom) # label(non_clause). [assumption].
% 0.65/0.95 2 $T # label(dt_k2_relat_1) # label(axiom) # label(non_clause). [assumption].
% 0.65/0.95 3 $T # label(dt_k9_relat_1) # label(axiom) # label(non_clause). [assumption].
% 0.65/0.95 4 (all A all B (relation(A) & function(A) & finite(B) -> finite(relation_image(A,B)))) # label(fc13_finset_1) # label(axiom) # label(non_clause). [assumption].
% 0.65/0.95 5 (exists A (relation(A) & function(A))) # label(rc1_funct_1) # label(axiom) # label(non_clause). [assumption].
% 0.65/0.95 6 (all A (relation(A) -> relation_image(A,relation_dom(A)) = relation_rng(A))) # label(t146_relat_1) # label(axiom) # label(non_clause). [assumption].
% 0.65/0.95 7 (all A all B (relation(B) & function(B) -> (finite(A) -> finite(relation_image(B,A))))) # label(t17_finset_1) # label(axiom) # label(non_clause). [assumption].
% 0.65/0.95 8 -(all A (relation(A) & function(A) -> (finite(relation_dom(A)) -> finite(relation_rng(A))))) # label(t26_finset_1) # label(negated_conjecture) # label(non_clause). [assumption].
% 0.65/0.95
% 0.65/0.95 ============================== end of process non-clausal formulas ===
% 0.65/0.95
% 0.65/0.95 ============================== PROCESS INITIAL CLAUSES ===============
% 0.65/0.95
% 0.65/0.95 ============================== PREDICATE ELIMINATION =================
% 0.65/0.95 9 -relation(A) | relation_rng(A) = relation_image(A,relation_dom(A)) # label(t146_relat_1) # label(axiom). [clausify(6)].
% 0.65/0.95 10 relation(c1) # label(rc1_funct_1) # label(axiom). [clausify(5)].
% 0.65/0.95 11 relation(c2) # label(t26_finset_1) # label(negated_conjecture). [clausify(8)].
% 0.65/0.95 Derived: relation_rng(c1) = relation_image(c1,relation_dom(c1)). [resolve(9,a,10,a)].
% 0.65/0.95 Derived: relation_rng(c2) = relation_image(c2,relation_dom(c2)). [resolve(9,a,11,a)].
% 0.65/0.95 12 -relation(A) | -function(A) | -finite(B) | finite(relation_image(A,B)) # label(fc13_finset_1) # label(axiom). [clausify(4)].
% 0.65/0.95 Derived: -function(c1) | -finite(A) | finite(relation_image(c1,A)). [resolve(12,a,10,a)].
% 0.65/0.95 Derived: -function(c2) | -finite(A) | finite(relation_image(c2,A)). [resolve(12,a,11,a)].
% 0.65/0.95 13 -relation(A) | -function(A) | -finite(B) | finite(relation_image(A,B)) # label(t17_finset_1) # label(axiom). [clausify(7)].
% 0.65/0.95
% 0.65/0.95 ============================== end predicate elimination =============
% 0.65/0.95
% 0.65/0.95 Auto_denials:
% 0.65/0.95 % copying label t26_finset_1 to answer in negative clause
% 0.65/0.95
% 0.65/0.95 Term ordering decisions:
% 0.65/0.95 Function symbol KB weights: c1=1. c2=1. relation_image=1. relation_dom=1. relation_rng=1.
% 0.65/0.95
% 0.65/0.95 ============================== end of process initial clauses ========
% 0.65/0.95
% 0.65/0.95 ============================== CLAUSES FOR SEARCH ====================
% 0.65/0.95
% 0.65/0.95 ============================== end of clauses for search =============
% 0.65/0.95
% 0.65/0.95 ============================== SEARCH ================================
% 0.65/0.95
% 0.65/0.95 % Starting search at 0.01 seconds.
% 0.65/0.95
% 0.65/0.95 ============================== PROOF =================================
% 0.65/0.95 % SZS status Theorem
% 0.65/0.95 % SZS output start Refutation
% 0.65/0.95
% 0.65/0.95 % Proof 1 at 0.01 (+ 0.00) seconds: t26_finset_1.
% 0.65/0.95 % Length of proof is 14.
% 0.65/0.95 % Level of proof is 5.
% 0.65/0.95 % Maximum clause weight is 8.000.
% 0.65/0.95 % Given clauses 8.
% 0.65/0.95
% 0.65/0.95 4 (all A all B (relation(A) & function(A) & finite(B) -> finite(relation_image(A,B)))) # label(fc13_finset_1) # label(axiom) # label(non_clause). [assumption].
% 0.65/0.95 6 (all A (relation(A) -> relation_image(A,relation_dom(A)) = relation_rng(A))) # label(t146_relat_1) # label(axiom) # label(non_clause). [assumption].
% 0.65/0.95 8 -(all A (relation(A) & function(A) -> (finite(relation_dom(A)) -> finite(relation_rng(A))))) # label(t26_finset_1) # label(negated_conjecture) # label(non_clause). [assumption].
% 0.65/0.95 9 -relation(A) | relation_rng(A) = relation_image(A,relation_dom(A)) # label(t146_relat_1) # label(axiom). [clausify(6)].
% 0.65/0.95 11 relation(c2) # label(t26_finset_1) # label(negated_conjecture). [clausify(8)].
% 0.65/0.95 12 -relation(A) | -function(A) | -finite(B) | finite(relation_image(A,B)) # label(fc13_finset_1) # label(axiom). [clausify(4)].
% 0.65/0.95 15 function(c2) # label(t26_finset_1) # label(negated_conjecture). [clausify(8)].
% 0.65/0.95 16 finite(relation_dom(c2)) # label(t26_finset_1) # label(negated_conjecture). [clausify(8)].
% 0.65/0.95 17 -finite(relation_rng(c2)) # label(t26_finset_1) # label(negated_conjecture) # answer(t26_finset_1). [clausify(8)].
% 0.65/0.95 20 relation_rng(c2) = relation_image(c2,relation_dom(c2)). [resolve(9,a,11,a)].
% 0.65/0.95 21 relation_image(c2,relation_dom(c2)) = relation_rng(c2). [copy(20),flip(a)].
% 0.65/0.95 23 -function(c2) | -finite(A) | finite(relation_image(c2,A)). [resolve(12,a,11,a)].
% 0.65/0.95 25 finite(relation_rng(c2)). [hyper(23,a,15,a,b,16,a),rewrite([21(4)])].
% 0.65/0.95 26 $F # answer(t26_finset_1). [resolve(25,a,17,a)].
% 0.65/0.95
% 0.65/0.95 % SZS output end Refutation
% 0.65/0.95 ============================== end of proof ==========================
% 0.65/0.95
% 0.65/0.95 ============================== STATISTICS ============================
% 0.65/0.95
% 0.65/0.95 Given=8. Generated=12. Kept=10. proofs=1.
% 0.65/0.95 Usable=8. Sos=1. Demods=2. Limbo=0, Disabled=13. Hints=0.
% 0.65/0.95 Megabytes=0.04.
% 0.65/0.95 User_CPU=0.01, System_CPU=0.00, Wall_clock=0.
% 0.65/0.95
% 0.65/0.95 ============================== end of statistics =====================
% 0.65/0.95
% 0.65/0.95 ============================== end of search =========================
% 0.65/0.95
% 0.65/0.95 THEOREM PROVED
% 0.65/0.95 % SZS status Theorem
% 0.65/0.95
% 0.65/0.95 Exiting with 1 proof.
% 0.65/0.95
% 0.65/0.95 Process 8687 exit (max_proofs) Sat Jun 18 19:19:59 2022
% 0.65/0.95 Prover9 interrupted
%------------------------------------------------------------------------------