TSTP Solution File: CAT019-1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : CAT019-1 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n032.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:18 EDT 2022
% Result : Unsatisfiable 0.51s 0.78s
% Output : Refutation 0.51s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.05/0.10 % Problem : CAT019-1 : TPTP v8.1.0. Released v1.0.0.
% 0.05/0.10 % Command : tptp2X_and_run_prover9 %d %s
% 0.10/0.29 % Computer : n032.cluster.edu
% 0.10/0.29 % Model : x86_64 x86_64
% 0.10/0.29 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.29 % Memory : 8042.1875MB
% 0.10/0.29 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.29 % CPULimit : 300
% 0.10/0.29 % WCLimit : 600
% 0.10/0.29 % DateTime : Sun May 29 23:27:27 EDT 2022
% 0.10/0.29 % CPUTime :
% 0.51/0.78 ============================== Prover9 ===============================
% 0.51/0.78 Prover9 (32) version 2009-11A, November 2009.
% 0.51/0.78 Process 14659 was started by sandbox on n032.cluster.edu,
% 0.51/0.78 Sun May 29 23:27:27 2022
% 0.51/0.78 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_14506_n032.cluster.edu".
% 0.51/0.78 ============================== end of head ===========================
% 0.51/0.78
% 0.51/0.78 ============================== INPUT =================================
% 0.51/0.78
% 0.51/0.78 % Reading from file /tmp/Prover9_14506_n032.cluster.edu
% 0.51/0.78
% 0.51/0.78 set(prolog_style_variables).
% 0.51/0.78 set(auto2).
% 0.51/0.78 % set(auto2) -> set(auto).
% 0.51/0.78 % set(auto) -> set(auto_inference).
% 0.51/0.78 % set(auto) -> set(auto_setup).
% 0.51/0.78 % set(auto_setup) -> set(predicate_elim).
% 0.51/0.78 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.51/0.78 % set(auto) -> set(auto_limits).
% 0.51/0.78 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.51/0.78 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.51/0.78 % set(auto) -> set(auto_denials).
% 0.51/0.78 % set(auto) -> set(auto_process).
% 0.51/0.78 % set(auto2) -> assign(new_constants, 1).
% 0.51/0.78 % set(auto2) -> assign(fold_denial_max, 3).
% 0.51/0.78 % set(auto2) -> assign(max_weight, "200.000").
% 0.51/0.78 % set(auto2) -> assign(max_hours, 1).
% 0.51/0.78 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.51/0.78 % set(auto2) -> assign(max_seconds, 0).
% 0.51/0.78 % set(auto2) -> assign(max_minutes, 5).
% 0.51/0.78 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.51/0.78 % set(auto2) -> set(sort_initial_sos).
% 0.51/0.78 % set(auto2) -> assign(sos_limit, -1).
% 0.51/0.78 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.51/0.78 % set(auto2) -> assign(max_megs, 400).
% 0.51/0.78 % set(auto2) -> assign(stats, some).
% 0.51/0.78 % set(auto2) -> clear(echo_input).
% 0.51/0.78 % set(auto2) -> set(quiet).
% 0.51/0.78 % set(auto2) -> clear(print_initial_clauses).
% 0.51/0.78 % set(auto2) -> clear(print_given).
% 0.51/0.78 assign(lrs_ticks,-1).
% 0.51/0.78 assign(sos_limit,10000).
% 0.51/0.78 assign(order,kbo).
% 0.51/0.78 set(lex_order_vars).
% 0.51/0.78 clear(print_given).
% 0.51/0.78
% 0.51/0.78 % formulas(sos). % not echoed (21 formulas)
% 0.51/0.78
% 0.51/0.78 ============================== end of input ==========================
% 0.51/0.78
% 0.51/0.78 % From the command line: assign(max_seconds, 300).
% 0.51/0.78
% 0.51/0.78 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.51/0.78
% 0.51/0.78 % Formulas that are not ordinary clauses:
% 0.51/0.78
% 0.51/0.78 ============================== end of process non-clausal formulas ===
% 0.51/0.78
% 0.51/0.78 ============================== PROCESS INITIAL CLAUSES ===============
% 0.51/0.78
% 0.51/0.78 ============================== PREDICATE ELIMINATION =================
% 0.51/0.78 1 -defined(A,B) | -identity_map(A) | product(A,B,B) # label(identity1) # label(axiom). [assumption].
% 0.51/0.78 2 identity_map(domain(A)) # label(domain_is_an_identity_map) # label(axiom). [assumption].
% 0.51/0.78 3 identity_map(codomain(A)) # label(codomain_is_an_identity_map) # label(axiom). [assumption].
% 0.51/0.78 Derived: -defined(domain(A),B) | product(domain(A),B,B). [resolve(1,b,2,a)].
% 0.51/0.78 Derived: -defined(codomain(A),B) | product(codomain(A),B,B). [resolve(1,b,3,a)].
% 0.51/0.78 4 -defined(A,B) | -identity_map(B) | product(A,B,A) # label(identity2) # label(axiom). [assumption].
% 0.51/0.78 Derived: -defined(A,domain(B)) | product(A,domain(B),A). [resolve(4,b,2,a)].
% 0.51/0.78 Derived: -defined(A,codomain(B)) | product(A,codomain(B),A). [resolve(4,b,3,a)].
% 0.51/0.78 5 -defined(A,B) | -defined(B,C) | -identity_map(B) | defined(A,C) # label(category_theory_axiom6) # label(axiom). [assumption].
% 0.51/0.78 Derived: -defined(A,domain(B)) | -defined(domain(B),C) | defined(A,C). [resolve(5,c,2,a)].
% 0.51/0.78 Derived: -defined(A,codomain(B)) | -defined(codomain(B),C) | defined(A,C). [resolve(5,c,3,a)].
% 0.51/0.78
% 0.51/0.78 ============================== end predicate elimination =============
% 0.51/0.78
% 0.51/0.78 Auto_denials:
% 0.51/0.78 % copying label prove_c1_equals_c2 to answer in negative clause
% 0.51/0.78
% 0.51/0.78 Term ordering decisions:
% 0.51/0.78 Function symbol KB weights: c1=1. c2=1. compose=1. codomain=1. domain=1.
% 0.51/0.78
% 0.51/0.78 ============================== end of process initial clauses ========
% 0.51/0.78
% 0.51/0.78 ============================== CLAUSES FOR SEARCH ====================
% 0.51/0.78
% 0.51/0.78 ============================== end of clauses for search =============
% 0.51/0.78
% 0.51/0.78 ============================== SEARCH ================================
% 0.51/0.78
% 0.51/0.78 % Starting search at 0.01 seconds.
% 0.51/0.78
% 0.51/0.78 ============================== PROOF =================================
% 0.51/0.78 % SZS status Unsatisfiable
% 0.51/0.78 % SZS output start Refutation
% 0.51/0.78
% 0.51/0.78 % Proof 1 at 0.01 (+ 0.00) seconds: prove_c1_equals_c2.
% 0.51/0.78 % Length of proof is 4.
% 0.51/0.78 % Level of proof is 2.
% 0.51/0.78 % Maximum clause weight is 6.000.
% 0.51/0.78 % Given clauses 6.
% 0.51/0.78
% 0.51/0.78 10 c2 != c1 # label(prove_c1_equals_c2) # label(negated_conjecture) # answer(prove_c1_equals_c2). [assumption].
% 0.51/0.78 11 c2 != A | c1 = A # label(equality_to_c1_and_c2_1) # label(hypothesis). [assumption].
% 0.51/0.78 28 c2 = c1. [hyper(11,a,xx),flip(a)].
% 0.51/0.78 29 $F # answer(prove_c1_equals_c2). [resolve(28,a,10,a)].
% 0.51/0.78
% 0.51/0.78 % SZS output end Refutation
% 0.51/0.78 ============================== end of proof ==========================
% 0.51/0.78
% 0.51/0.78 ============================== STATISTICS ============================
% 0.51/0.78
% 0.51/0.78 Given=6. Generated=23. Kept=23. proofs=1.
% 0.51/0.78 Usable=6. Sos=16. Demods=0. Limbo=0, Disabled=27. Hints=0.
% 0.51/0.78 Megabytes=0.04.
% 0.51/0.78 User_CPU=0.01, System_CPU=0.00, Wall_clock=0.
% 0.51/0.78
% 0.51/0.78 ============================== end of statistics =====================
% 0.51/0.78
% 0.51/0.78 ============================== end of search =========================
% 0.51/0.78
% 0.51/0.78 THEOREM PROVED
% 0.51/0.78 % SZS status Unsatisfiable
% 0.51/0.78
% 0.51/0.78 Exiting with 1 proof.
% 0.51/0.78
% 0.51/0.78 Process 14659 exit (max_proofs) Sun May 29 23:27:27 2022
% 0.51/0.78 Prover9 interrupted
%------------------------------------------------------------------------------