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