TSTP Solution File: CAT012-4 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : CAT012-4 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n021.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:16 EDT 2022
% Result : Unsatisfiable 0.43s 1.00s
% Output : Refutation 0.43s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : CAT012-4 : TPTP v8.1.0. Released v1.0.0.
% 0.06/0.13 % Command : tptp2X_and_run_prover9 %d %s
% 0.12/0.34 % Computer : n021.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 600
% 0.12/0.34 % DateTime : Sun May 29 20:26:58 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.43/1.00 ============================== Prover9 ===============================
% 0.43/1.00 Prover9 (32) version 2009-11A, November 2009.
% 0.43/1.00 Process 31290 was started by sandbox on n021.cluster.edu,
% 0.43/1.00 Sun May 29 20:26:58 2022
% 0.43/1.00 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_30940_n021.cluster.edu".
% 0.43/1.00 ============================== end of head ===========================
% 0.43/1.00
% 0.43/1.00 ============================== INPUT =================================
% 0.43/1.00
% 0.43/1.00 % Reading from file /tmp/Prover9_30940_n021.cluster.edu
% 0.43/1.00
% 0.43/1.00 set(prolog_style_variables).
% 0.43/1.00 set(auto2).
% 0.43/1.00 % set(auto2) -> set(auto).
% 0.43/1.00 % set(auto) -> set(auto_inference).
% 0.43/1.00 % set(auto) -> set(auto_setup).
% 0.43/1.00 % set(auto_setup) -> set(predicate_elim).
% 0.43/1.00 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.43/1.00 % set(auto) -> set(auto_limits).
% 0.43/1.00 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.43/1.00 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.43/1.00 % set(auto) -> set(auto_denials).
% 0.43/1.00 % set(auto) -> set(auto_process).
% 0.43/1.00 % set(auto2) -> assign(new_constants, 1).
% 0.43/1.00 % set(auto2) -> assign(fold_denial_max, 3).
% 0.43/1.00 % set(auto2) -> assign(max_weight, "200.000").
% 0.43/1.00 % set(auto2) -> assign(max_hours, 1).
% 0.43/1.00 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.43/1.00 % set(auto2) -> assign(max_seconds, 0).
% 0.43/1.00 % set(auto2) -> assign(max_minutes, 5).
% 0.43/1.00 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.43/1.00 % set(auto2) -> set(sort_initial_sos).
% 0.43/1.00 % set(auto2) -> assign(sos_limit, -1).
% 0.43/1.00 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.43/1.00 % set(auto2) -> assign(max_megs, 400).
% 0.43/1.00 % set(auto2) -> assign(stats, some).
% 0.43/1.00 % set(auto2) -> clear(echo_input).
% 0.43/1.00 % set(auto2) -> set(quiet).
% 0.43/1.00 % set(auto2) -> clear(print_initial_clauses).
% 0.43/1.00 % set(auto2) -> clear(print_given).
% 0.43/1.00 assign(lrs_ticks,-1).
% 0.43/1.00 assign(sos_limit,10000).
% 0.43/1.00 assign(order,kbo).
% 0.43/1.00 set(lex_order_vars).
% 0.43/1.00 clear(print_given).
% 0.43/1.00
% 0.43/1.00 % formulas(sos). % not echoed (13 formulas)
% 0.43/1.00
% 0.43/1.00 ============================== end of input ==========================
% 0.43/1.00
% 0.43/1.00 % From the command line: assign(max_seconds, 300).
% 0.43/1.00
% 0.43/1.00 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.43/1.00
% 0.43/1.00 % Formulas that are not ordinary clauses:
% 0.43/1.00
% 0.43/1.00 ============================== end of process non-clausal formulas ===
% 0.43/1.00
% 0.43/1.00 ============================== PROCESS INITIAL CLAUSES ===============
% 0.43/1.00
% 0.43/1.00 ============================== PREDICATE ELIMINATION =================
% 0.43/1.00 1 -there_exists(A) | A != B | equivalent(A,B) # label(existence_and_equality_implies_equivalence1) # label(axiom). [assumption].
% 0.43/1.00 2 -equivalent(A,B) | there_exists(A) # label(equivalence_implies_existence1) # label(axiom). [assumption].
% 0.43/1.00 3 -equivalent(A,B) | A = B # label(equivalence_implies_existence2) # label(axiom). [assumption].
% 0.43/1.00
% 0.43/1.00 ============================== end predicate elimination =============
% 0.43/1.00
% 0.43/1.00 Auto_denials:
% 0.43/1.00 % copying label prove_codomain_of_domain_is_domain to answer in negative clause
% 0.43/1.00
% 0.43/1.00 Term ordering decisions:
% 0.43/1.00 Function symbol KB weights: a=1. compose=1. domain=1. codomain=1.
% 0.43/1.00
% 0.43/1.00 ============================== end of process initial clauses ========
% 0.43/1.00
% 0.43/1.00 ============================== CLAUSES FOR SEARCH ====================
% 0.43/1.00
% 0.43/1.00 ============================== end of clauses for search =============
% 0.43/1.00
% 0.43/1.00 ============================== SEARCH ================================
% 0.43/1.00
% 0.43/1.00 % Starting search at 0.01 seconds.
% 0.43/1.00
% 0.43/1.00 ============================== PROOF =================================
% 0.43/1.00 % SZS status Unsatisfiable
% 0.43/1.00 % SZS output start Refutation
% 0.43/1.00
% 0.43/1.00 % Proof 1 at 0.01 (+ 0.00) seconds: prove_codomain_of_domain_is_domain.
% 0.43/1.00 % Length of proof is 12.
% 0.43/1.00 % Level of proof is 4.
% 0.43/1.00 % Maximum clause weight is 9.000.
% 0.43/1.00 % Given clauses 32.
% 0.43/1.00
% 0.43/1.00 4 there_exists(domain(a)) # label(assume_domain_exists) # label(hypothesis). [assumption].
% 0.43/1.00 5 compose(A,domain(A)) = A # label(compose_domain) # label(axiom). [assumption].
% 0.43/1.00 9 codomain(domain(a)) != domain(a) # label(prove_codomain_of_domain_is_domain) # label(negated_conjecture) # answer(prove_codomain_of_domain_is_domain). [assumption].
% 0.43/1.00 10 -there_exists(domain(A)) | there_exists(A) # label(domain_has_elements) # label(axiom). [assumption].
% 0.43/1.00 13 -there_exists(compose(A,B)) | domain(A) = codomain(B) # label(domain_codomain_composition1) # label(axiom). [assumption].
% 0.43/1.00 14 -there_exists(compose(A,B)) | codomain(B) = domain(A). [copy(13),flip(b)].
% 0.43/1.00 17 codomain(domain(a)) = c_0. [new_symbol(9)].
% 0.43/1.00 18 domain(a) != c_0 # answer(prove_codomain_of_domain_is_domain). [back_rewrite(9),rewrite([17(3)]),flip(a)].
% 0.43/1.00 22 there_exists(a). [hyper(10,a,4,a)].
% 0.43/1.00 26 -there_exists(A) | codomain(domain(A)) = domain(A). [para(5(a,1),14(a,1))].
% 0.43/1.00 89 domain(a) = c_0. [hyper(26,a,22,a),rewrite([17(3)]),flip(a)].
% 0.43/1.00 90 $F # answer(prove_codomain_of_domain_is_domain). [resolve(89,a,18,a)].
% 0.43/1.00
% 0.43/1.00 % SZS output end Refutation
% 0.43/1.00 ============================== end of proof ==========================
% 0.43/1.00
% 0.43/1.00 ============================== STATISTICS ============================
% 0.43/1.00
% 0.43/1.00 Given=32. Generated=167. Kept=83. proofs=1.
% 0.43/1.00 Usable=32. Sos=37. Demods=29. Limbo=12, Disabled=14. Hints=0.
% 0.43/1.00 Megabytes=0.09.
% 0.43/1.00 User_CPU=0.02, System_CPU=0.00, Wall_clock=1.
% 0.43/1.00
% 0.43/1.00 ============================== end of statistics =====================
% 0.43/1.00
% 0.43/1.00 ============================== end of search =========================
% 0.43/1.00
% 0.43/1.00 THEOREM PROVED
% 0.43/1.00 % SZS status Unsatisfiable
% 0.43/1.00
% 0.43/1.00 Exiting with 1 proof.
% 0.43/1.00
% 0.43/1.00 Process 31290 exit (max_proofs) Sun May 29 20:26:59 2022
% 0.43/1.00 Prover9 interrupted
%------------------------------------------------------------------------------