TSTP Solution File: CAT013-3 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : CAT013-3 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n023.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.76s 1.06s
% Output : Refutation 0.76s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : CAT013-3 : TPTP v8.1.0. Released v1.0.0.
% 0.07/0.14 % Command : tptp2X_and_run_prover9 %d %s
% 0.14/0.35 % Computer : n023.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 600
% 0.14/0.35 % DateTime : Sun May 29 23:57:42 EDT 2022
% 0.14/0.35 % CPUTime :
% 0.76/1.06 ============================== Prover9 ===============================
% 0.76/1.06 Prover9 (32) version 2009-11A, November 2009.
% 0.76/1.06 Process 27897 was started by sandbox2 on n023.cluster.edu,
% 0.76/1.06 Sun May 29 23:57:43 2022
% 0.76/1.06 The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 300 -f /tmp/Prover9_27693_n023.cluster.edu".
% 0.76/1.06 ============================== end of head ===========================
% 0.76/1.06
% 0.76/1.06 ============================== INPUT =================================
% 0.76/1.06
% 0.76/1.06 % Reading from file /tmp/Prover9_27693_n023.cluster.edu
% 0.76/1.06
% 0.76/1.06 set(prolog_style_variables).
% 0.76/1.06 set(auto2).
% 0.76/1.06 % set(auto2) -> set(auto).
% 0.76/1.06 % set(auto) -> set(auto_inference).
% 0.76/1.06 % set(auto) -> set(auto_setup).
% 0.76/1.06 % set(auto_setup) -> set(predicate_elim).
% 0.76/1.06 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.76/1.06 % set(auto) -> set(auto_limits).
% 0.76/1.06 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.76/1.06 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.76/1.06 % set(auto) -> set(auto_denials).
% 0.76/1.06 % set(auto) -> set(auto_process).
% 0.76/1.06 % set(auto2) -> assign(new_constants, 1).
% 0.76/1.06 % set(auto2) -> assign(fold_denial_max, 3).
% 0.76/1.06 % set(auto2) -> assign(max_weight, "200.000").
% 0.76/1.06 % set(auto2) -> assign(max_hours, 1).
% 0.76/1.06 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.76/1.06 % set(auto2) -> assign(max_seconds, 0).
% 0.76/1.06 % set(auto2) -> assign(max_minutes, 5).
% 0.76/1.06 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.76/1.06 % set(auto2) -> set(sort_initial_sos).
% 0.76/1.06 % set(auto2) -> assign(sos_limit, -1).
% 0.76/1.06 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.76/1.06 % set(auto2) -> assign(max_megs, 400).
% 0.76/1.06 % set(auto2) -> assign(stats, some).
% 0.76/1.06 % set(auto2) -> clear(echo_input).
% 0.76/1.06 % set(auto2) -> set(quiet).
% 0.76/1.06 % set(auto2) -> clear(print_initial_clauses).
% 0.76/1.06 % set(auto2) -> clear(print_given).
% 0.76/1.06 assign(lrs_ticks,-1).
% 0.76/1.06 assign(sos_limit,10000).
% 0.76/1.06 assign(order,kbo).
% 0.76/1.06 set(lex_order_vars).
% 0.76/1.06 clear(print_given).
% 0.76/1.06
% 0.76/1.06 % formulas(sos). % not echoed (19 formulas)
% 0.76/1.06
% 0.76/1.06 ============================== end of input ==========================
% 0.76/1.06
% 0.76/1.06 % From the command line: assign(max_seconds, 300).
% 0.76/1.06
% 0.76/1.06 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.76/1.06
% 0.76/1.06 % Formulas that are not ordinary clauses:
% 0.76/1.06
% 0.76/1.06 ============================== end of process non-clausal formulas ===
% 0.76/1.06
% 0.76/1.06 ============================== PROCESS INITIAL CLAUSES ===============
% 0.76/1.06
% 0.76/1.06 ============================== PREDICATE ELIMINATION =================
% 0.76/1.06 1 -there_exists(A) | A != B | equivalent(A,B) # label(existence_and_equality_implies_equivalence1) # label(axiom). [assumption].
% 0.76/1.06 2 -equivalent(A,B) | there_exists(A) # label(equivalence_implies_existence1) # label(axiom). [assumption].
% 0.76/1.06 3 -equivalent(A,B) | there_exists(B) # label(equivalence_implies_existence3) # label(axiom). [assumption].
% 0.76/1.06 4 -equivalent(A,B) | A = B # label(equivalence_implies_existence2) # label(axiom). [assumption].
% 0.76/1.06 Derived: -there_exists(A) | A != B | there_exists(B). [resolve(1,c,3,a)].
% 0.76/1.06 5 -there_exists(A) | -there_exists(B) | A != B | equivalent(A,B) # label(existence_and_equality_implies_equivalence2) # label(axiom). [assumption].
% 0.76/1.06
% 0.76/1.06 ============================== end predicate elimination =============
% 0.76/1.06
% 0.76/1.06 Auto_denials: (non-Horn, no changes).
% 0.76/1.06
% 0.76/1.06 Term ordering decisions:
% 0.76/1.06 Function symbol KB weights: a=1. compose=1. f1=1. codomain=1. domain=1.
% 0.76/1.06
% 0.76/1.06 ============================== end of process initial clauses ========
% 0.76/1.06
% 0.76/1.06 ============================== CLAUSES FOR SEARCH ====================
% 0.76/1.06
% 0.76/1.06 ============================== end of clauses for search =============
% 0.76/1.06
% 0.76/1.06 ============================== SEARCH ================================
% 0.76/1.06
% 0.76/1.06 % Starting search at 0.01 seconds.
% 0.76/1.06
% 0.76/1.06 ============================== PROOF =================================
% 0.76/1.06 % SZS status Unsatisfiable
% 0.76/1.06 % SZS output start Refutation
% 0.76/1.06
% 0.76/1.06 % Proof 1 at 0.03 (+ 0.00) seconds.
% 0.76/1.06 % Length of proof is 11.
% 0.76/1.06 % Level of proof is 3.
% 0.76/1.06 % Maximum clause weight is 9.000.
% 0.76/1.06 % Given clauses 67.
% 0.76/1.06
% 0.76/1.06 6 there_exists(codomain(a)) # label(assume_codomain_exists) # label(hypothesis). [assumption].
% 0.76/1.06 8 compose(codomain(A),A) = A # label(compose_codomain) # label(axiom). [assumption].
% 0.76/1.06 14 domain(codomain(a)) != codomain(a) # label(prove_domain_of_codomain_is_codomain) # label(negated_conjecture). [assumption].
% 0.76/1.06 16 -there_exists(codomain(A)) | there_exists(A) # label(codomain_has_elements) # label(axiom). [assumption].
% 0.76/1.06 19 -there_exists(compose(A,B)) | domain(A) = codomain(B) # label(domain_codomain_composition1) # label(axiom). [assumption].
% 0.76/1.06 20 -there_exists(compose(A,B)) | codomain(B) = domain(A). [copy(19),flip(b)].
% 0.76/1.06 26 domain(codomain(a)) = c_0. [new_symbol(14)].
% 0.76/1.06 27 codomain(a) != c_0. [back_rewrite(14),rewrite([26(3)]),flip(a)].
% 0.76/1.06 33 there_exists(a). [resolve(16,a,6,a)].
% 0.76/1.06 41 -there_exists(A) | domain(codomain(A)) = codomain(A). [para(8(a,1),20(a,1)),flip(b)].
% 0.76/1.06 283 $F. [resolve(41,a,33,a),rewrite([26(3)]),flip(a),unit_del(a,27)].
% 0.76/1.06
% 0.76/1.06 % SZS output end Refutation
% 0.76/1.06 ============================== end of proof ==========================
% 0.76/1.06
% 0.76/1.06 ============================== STATISTICS ============================
% 0.76/1.06
% 0.76/1.06 Given=67. Generated=594. Kept=272. proofs=1.
% 0.76/1.06 Usable=46. Sos=94. Demods=38. Limbo=8, Disabled=144. Hints=0.
% 0.76/1.06 Megabytes=0.21.
% 0.76/1.06 User_CPU=0.03, System_CPU=0.00, Wall_clock=0.
% 0.76/1.06
% 0.76/1.06 ============================== end of statistics =====================
% 0.76/1.06
% 0.76/1.06 ============================== end of search =========================
% 0.76/1.06
% 0.76/1.06 THEOREM PROVED
% 0.76/1.06 % SZS status Unsatisfiable
% 0.76/1.06
% 0.76/1.06 Exiting with 1 proof.
% 0.76/1.06
% 0.76/1.06 Process 27897 exit (max_proofs) Sun May 29 23:57:43 2022
% 0.76/1.06 Prover9 interrupted
%------------------------------------------------------------------------------