TSTP Solution File: CAT011-3 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : CAT011-3 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n017.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:15 EDT 2022
% Result : Unsatisfiable 0.74s 1.02s
% Output : Refutation 0.74s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : CAT011-3 : TPTP v8.1.0. Released v1.0.0.
% 0.11/0.13 % Command : tptp2X_and_run_prover9 %d %s
% 0.12/0.34 % Computer : n017.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 14:52:09 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.74/1.02 ============================== Prover9 ===============================
% 0.74/1.02 Prover9 (32) version 2009-11A, November 2009.
% 0.74/1.02 Process 8712 was started by sandbox on n017.cluster.edu,
% 0.74/1.02 Sun May 29 14:52:10 2022
% 0.74/1.02 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_8352_n017.cluster.edu".
% 0.74/1.02 ============================== end of head ===========================
% 0.74/1.02
% 0.74/1.02 ============================== INPUT =================================
% 0.74/1.02
% 0.74/1.02 % Reading from file /tmp/Prover9_8352_n017.cluster.edu
% 0.74/1.02
% 0.74/1.02 set(prolog_style_variables).
% 0.74/1.02 set(auto2).
% 0.74/1.02 % set(auto2) -> set(auto).
% 0.74/1.02 % set(auto) -> set(auto_inference).
% 0.74/1.02 % set(auto) -> set(auto_setup).
% 0.74/1.02 % set(auto_setup) -> set(predicate_elim).
% 0.74/1.02 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.74/1.02 % set(auto) -> set(auto_limits).
% 0.74/1.02 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.74/1.02 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.74/1.02 % set(auto) -> set(auto_denials).
% 0.74/1.02 % set(auto) -> set(auto_process).
% 0.74/1.02 % set(auto2) -> assign(new_constants, 1).
% 0.74/1.02 % set(auto2) -> assign(fold_denial_max, 3).
% 0.74/1.02 % set(auto2) -> assign(max_weight, "200.000").
% 0.74/1.02 % set(auto2) -> assign(max_hours, 1).
% 0.74/1.02 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.74/1.02 % set(auto2) -> assign(max_seconds, 0).
% 0.74/1.02 % set(auto2) -> assign(max_minutes, 5).
% 0.74/1.02 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.74/1.02 % set(auto2) -> set(sort_initial_sos).
% 0.74/1.02 % set(auto2) -> assign(sos_limit, -1).
% 0.74/1.02 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.74/1.02 % set(auto2) -> assign(max_megs, 400).
% 0.74/1.02 % set(auto2) -> assign(stats, some).
% 0.74/1.02 % set(auto2) -> clear(echo_input).
% 0.74/1.02 % set(auto2) -> set(quiet).
% 0.74/1.02 % set(auto2) -> clear(print_initial_clauses).
% 0.74/1.02 % set(auto2) -> clear(print_given).
% 0.74/1.02 assign(lrs_ticks,-1).
% 0.74/1.02 assign(sos_limit,10000).
% 0.74/1.02 assign(order,kbo).
% 0.74/1.02 set(lex_order_vars).
% 0.74/1.02 clear(print_given).
% 0.74/1.02
% 0.74/1.02 % formulas(sos). % not echoed (19 formulas)
% 0.74/1.02
% 0.74/1.02 ============================== end of input ==========================
% 0.74/1.02
% 0.74/1.02 % From the command line: assign(max_seconds, 300).
% 0.74/1.02
% 0.74/1.02 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.74/1.02
% 0.74/1.02 % Formulas that are not ordinary clauses:
% 0.74/1.02
% 0.74/1.02 ============================== end of process non-clausal formulas ===
% 0.74/1.02
% 0.74/1.02 ============================== PROCESS INITIAL CLAUSES ===============
% 0.74/1.02
% 0.74/1.02 ============================== PREDICATE ELIMINATION =================
% 0.74/1.02 1 -there_exists(A) | A != B | equivalent(A,B) # label(existence_and_equality_implies_equivalence1) # label(axiom). [assumption].
% 0.74/1.02 2 -equivalent(A,B) | there_exists(A) # label(equivalence_implies_existence1) # label(axiom). [assumption].
% 0.74/1.02 3 -equivalent(A,B) | there_exists(B) # label(equivalence_implies_existence3) # label(axiom). [assumption].
% 0.74/1.02 4 -equivalent(A,B) | A = B # label(equivalence_implies_existence2) # label(axiom). [assumption].
% 0.74/1.02 Derived: -there_exists(A) | A != B | there_exists(B). [resolve(1,c,3,a)].
% 0.74/1.02 5 -there_exists(A) | -there_exists(B) | A != B | equivalent(A,B) # label(existence_and_equality_implies_equivalence2) # label(axiom). [assumption].
% 0.74/1.02
% 0.74/1.02 ============================== end predicate elimination =============
% 0.74/1.02
% 0.74/1.02 Auto_denials: (non-Horn, no changes).
% 0.74/1.02
% 0.74/1.02 Term ordering decisions:
% 0.74/1.02 Function symbol KB weights: a=1. compose=1. f1=1. domain=1. codomain=1.
% 0.74/1.02
% 0.74/1.02 ============================== end of process initial clauses ========
% 0.74/1.02
% 0.74/1.02 ============================== CLAUSES FOR SEARCH ====================
% 0.74/1.02
% 0.74/1.02 ============================== end of clauses for search =============
% 0.74/1.02
% 0.74/1.02 ============================== SEARCH ================================
% 0.74/1.02
% 0.74/1.02 % Starting search at 0.01 seconds.
% 0.74/1.02
% 0.74/1.02 ============================== PROOF =================================
% 0.74/1.02 % SZS status Unsatisfiable
% 0.74/1.02 % SZS output start Refutation
% 0.74/1.02
% 0.74/1.02 % Proof 1 at 0.03 (+ 0.00) seconds.
% 0.74/1.02 % Length of proof is 14.
% 0.74/1.02 % Level of proof is 4.
% 0.74/1.02 % Maximum clause weight is 9.000.
% 0.74/1.02 % Given clauses 67.
% 0.74/1.02
% 0.74/1.02 6 there_exists(domain(a)) # label(assume_domain_exists) # label(hypothesis). [assumption].
% 0.74/1.02 7 compose(A,domain(A)) = A # label(compose_domain) # label(axiom). [assumption].
% 0.74/1.02 8 compose(codomain(A),A) = A # label(compose_codomain) # label(axiom). [assumption].
% 0.74/1.02 14 domain(domain(a)) != domain(a) # label(prove_domain_is_idempotent) # label(negated_conjecture). [assumption].
% 0.74/1.02 15 -there_exists(domain(A)) | there_exists(A) # label(domain_has_elements) # label(axiom). [assumption].
% 0.74/1.02 19 -there_exists(compose(A,B)) | domain(A) = codomain(B) # label(domain_codomain_composition1) # label(axiom). [assumption].
% 0.74/1.02 20 -there_exists(compose(A,B)) | codomain(B) = domain(A). [copy(19),flip(b)].
% 0.74/1.02 26 domain(domain(a)) = c_0. [new_symbol(14)].
% 0.74/1.02 27 domain(a) != c_0. [back_rewrite(14),rewrite([26(3)]),flip(a)].
% 0.74/1.02 33 there_exists(a). [resolve(15,a,6,a)].
% 0.74/1.02 40 -there_exists(A) | codomain(domain(A)) = domain(A). [para(7(a,1),20(a,1))].
% 0.74/1.02 41 -there_exists(A) | domain(codomain(A)) = codomain(A). [para(8(a,1),20(a,1)),flip(b)].
% 0.74/1.02 262 codomain(domain(a)) = domain(a). [resolve(40,a,33,a)].
% 0.74/1.02 286 $F. [resolve(41,a,6,a),rewrite([262(3),26(3),262(4)]),flip(a),unit_del(a,27)].
% 0.74/1.02
% 0.74/1.02 % SZS output end Refutation
% 0.74/1.02 ============================== end of proof ==========================
% 0.74/1.02
% 0.74/1.02 ============================== STATISTICS ============================
% 0.74/1.02
% 0.74/1.02 Given=67. Generated=601. Kept=275. proofs=1.
% 0.74/1.02 Usable=45. Sos=91. Demods=37. Limbo=11, Disabled=148. Hints=0.
% 0.74/1.02 Megabytes=0.21.
% 0.74/1.02 User_CPU=0.03, System_CPU=0.00, Wall_clock=0.
% 0.74/1.02
% 0.74/1.02 ============================== end of statistics =====================
% 0.74/1.02
% 0.74/1.02 ============================== end of search =========================
% 0.74/1.02
% 0.74/1.02 THEOREM PROVED
% 0.74/1.02 % SZS status Unsatisfiable
% 0.74/1.02
% 0.74/1.02 Exiting with 1 proof.
% 0.74/1.02
% 0.74/1.02 Process 8712 exit (max_proofs) Sun May 29 14:52:10 2022
% 0.74/1.02 Prover9 interrupted
%------------------------------------------------------------------------------