TSTP Solution File: CAT006-4 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : CAT006-4 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n029.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 : Fri Jul 15 00:06:14 EDT 2022
% Result : Unsatisfiable 0.40s 0.96s
% Output : Refutation 0.40s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.11 % Problem : CAT006-4 : TPTP v8.1.0. Released v1.0.0.
% 0.06/0.11 % Command : tptp2X_and_run_prover9 %d %s
% 0.11/0.32 % Computer : n029.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 : Sun May 29 17:59:28 EDT 2022
% 0.11/0.32 % CPUTime :
% 0.40/0.96 ============================== Prover9 ===============================
% 0.40/0.96 Prover9 (32) version 2009-11A, November 2009.
% 0.40/0.96 Process 10076 was started by sandbox on n029.cluster.edu,
% 0.40/0.96 Sun May 29 17:59:29 2022
% 0.40/0.96 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_9909_n029.cluster.edu".
% 0.40/0.96 ============================== end of head ===========================
% 0.40/0.96
% 0.40/0.96 ============================== INPUT =================================
% 0.40/0.96
% 0.40/0.96 % Reading from file /tmp/Prover9_9909_n029.cluster.edu
% 0.40/0.96
% 0.40/0.96 set(prolog_style_variables).
% 0.40/0.96 set(auto2).
% 0.40/0.96 % set(auto2) -> set(auto).
% 0.40/0.96 % set(auto) -> set(auto_inference).
% 0.40/0.96 % set(auto) -> set(auto_setup).
% 0.40/0.96 % set(auto_setup) -> set(predicate_elim).
% 0.40/0.96 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.40/0.96 % set(auto) -> set(auto_limits).
% 0.40/0.96 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.40/0.96 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.40/0.96 % set(auto) -> set(auto_denials).
% 0.40/0.96 % set(auto) -> set(auto_process).
% 0.40/0.96 % set(auto2) -> assign(new_constants, 1).
% 0.40/0.96 % set(auto2) -> assign(fold_denial_max, 3).
% 0.40/0.96 % set(auto2) -> assign(max_weight, "200.000").
% 0.40/0.96 % set(auto2) -> assign(max_hours, 1).
% 0.40/0.96 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.40/0.96 % set(auto2) -> assign(max_seconds, 0).
% 0.40/0.96 % set(auto2) -> assign(max_minutes, 5).
% 0.40/0.96 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.40/0.96 % set(auto2) -> set(sort_initial_sos).
% 0.40/0.96 % set(auto2) -> assign(sos_limit, -1).
% 0.40/0.96 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.40/0.96 % set(auto2) -> assign(max_megs, 400).
% 0.40/0.96 % set(auto2) -> assign(stats, some).
% 0.40/0.96 % set(auto2) -> clear(echo_input).
% 0.40/0.96 % set(auto2) -> set(quiet).
% 0.40/0.96 % set(auto2) -> clear(print_initial_clauses).
% 0.40/0.96 % set(auto2) -> clear(print_given).
% 0.40/0.96 assign(lrs_ticks,-1).
% 0.40/0.96 assign(sos_limit,10000).
% 0.40/0.96 assign(order,kbo).
% 0.40/0.96 set(lex_order_vars).
% 0.40/0.96 clear(print_given).
% 0.40/0.96
% 0.40/0.96 % formulas(sos). % not echoed (15 formulas)
% 0.40/0.96
% 0.40/0.96 ============================== end of input ==========================
% 0.40/0.96
% 0.40/0.96 % From the command line: assign(max_seconds, 300).
% 0.40/0.96
% 0.40/0.96 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.40/0.96
% 0.40/0.96 % Formulas that are not ordinary clauses:
% 0.40/0.96
% 0.40/0.96 ============================== end of process non-clausal formulas ===
% 0.40/0.96
% 0.40/0.96 ============================== PROCESS INITIAL CLAUSES ===============
% 0.40/0.96
% 0.40/0.96 ============================== PREDICATE ELIMINATION =================
% 0.40/0.96 1 -there_exists(A) | A != B | equivalent(A,B) # label(existence_and_equality_implies_equivalence1) # label(axiom). [assumption].
% 0.40/0.96 2 -equivalent(A,B) | there_exists(A) # label(equivalence_implies_existence1) # label(axiom). [assumption].
% 0.40/0.96 3 -equivalent(A,B) | A = B # label(equivalence_implies_existence2) # label(axiom). [assumption].
% 0.40/0.96
% 0.40/0.96 ============================== end predicate elimination =============
% 0.40/0.96
% 0.40/0.96 Auto_denials:
% 0.40/0.96 % copying label prove_codomain_of_a_is_d to answer in negative clause
% 0.40/0.96
% 0.40/0.96 Term ordering decisions:
% 0.40/0.96 Function symbol KB weights: d=1. a=1. compose=1. domain=1. codomain=1.
% 0.40/0.96
% 0.40/0.96 ============================== end of process initial clauses ========
% 0.40/0.96
% 0.40/0.96 ============================== CLAUSES FOR SEARCH ====================
% 0.40/0.96
% 0.40/0.96 ============================== end of clauses for search =============
% 0.40/0.96
% 0.40/0.96 ============================== SEARCH ================================
% 0.40/0.96
% 0.40/0.96 % Starting search at 0.01 seconds.
% 0.40/0.96
% 0.40/0.96 ============================== PROOF =================================
% 0.40/0.96 % SZS status Unsatisfiable
% 0.40/0.96 % SZS output start Refutation
% 0.40/0.96
% 0.40/0.96 % Proof 1 at 0.01 (+ 0.00) seconds: prove_codomain_of_a_is_d.
% 0.40/0.96 % Length of proof is 17.
% 0.40/0.96 % Level of proof is 5.
% 0.40/0.96 % Maximum clause weight is 9.000.
% 0.40/0.96 % Given clauses 39.
% 0.40/0.96
% 0.40/0.96 4 there_exists(compose(d,a)) # label(da_exists) # label(hypothesis). [assumption].
% 0.40/0.96 6 compose(codomain(A),A) = A # label(compose_codomain) # label(axiom). [assumption].
% 0.40/0.96 9 codomain(a) != d # label(prove_codomain_of_a_is_d) # label(negated_conjecture) # answer(prove_codomain_of_a_is_d). [assumption].
% 0.40/0.96 10 -there_exists(domain(A)) | there_exists(A) # label(domain_has_elements) # label(axiom). [assumption].
% 0.40/0.96 12 -there_exists(compose(A,B)) | there_exists(domain(A)) # label(composition_implies_domain) # label(axiom). [assumption].
% 0.40/0.96 13 -there_exists(compose(A,B)) | domain(A) = codomain(B) # label(domain_codomain_composition1) # label(axiom). [assumption].
% 0.40/0.96 14 -there_exists(compose(A,B)) | codomain(B) = domain(A). [copy(13),flip(b)].
% 0.40/0.96 15 -there_exists(compose(A,d)) | compose(A,d) = A # label(xd_equals_x) # label(hypothesis). [assumption].
% 0.40/0.96 22 there_exists(domain(d)). [hyper(12,a,4,a)].
% 0.40/0.96 26 codomain(a) = domain(d). [hyper(14,a,4,a)].
% 0.40/0.96 28 -there_exists(A) | domain(codomain(A)) = codomain(A). [para(6(a,1),14(a,1)),flip(b)].
% 0.40/0.96 30 domain(d) != d # answer(prove_codomain_of_a_is_d). [back_rewrite(9),rewrite([26(2)])].
% 0.40/0.96 31 -there_exists(d) | codomain(d) = d. [para(6(a,1),15(a,1)),rewrite([6(6)]),flip(b)].
% 0.40/0.96 40 there_exists(d). [hyper(10,a,22,a)].
% 0.40/0.96 102 codomain(d) = d. [hyper(31,a,40,a)].
% 0.40/0.96 108 domain(d) = d. [hyper(28,a,40,a),rewrite([102(2),102(4)])].
% 0.40/0.96 109 $F # answer(prove_codomain_of_a_is_d). [resolve(108,a,30,a)].
% 0.40/0.96
% 0.40/0.96 % SZS output end Refutation
% 0.40/0.96 ============================== end of proof ==========================
% 0.40/0.96
% 0.40/0.96 ============================== STATISTICS ============================
% 0.40/0.96
% 0.40/0.96 Given=39. Generated=226. Kept=102. proofs=1.
% 0.40/0.96 Usable=29. Sos=36. Demods=33. Limbo=5, Disabled=46. Hints=0.
% 0.40/0.96 Megabytes=0.10.
% 0.40/0.96 User_CPU=0.01, System_CPU=0.00, Wall_clock=0.
% 0.40/0.96
% 0.40/0.96 ============================== end of statistics =====================
% 0.40/0.96
% 0.40/0.96 ============================== end of search =========================
% 0.40/0.96
% 0.40/0.96 THEOREM PROVED
% 0.40/0.96 % SZS status Unsatisfiable
% 0.40/0.96
% 0.40/0.96 Exiting with 1 proof.
% 0.40/0.96
% 0.40/0.96 Process 10076 exit (max_proofs) Sun May 29 17:59:29 2022
% 0.40/0.96 Prover9 interrupted
%------------------------------------------------------------------------------