TSTP Solution File: CAT004-3 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : CAT004-3 : 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:13 EDT 2022
% Result : Unsatisfiable 0.46s 0.79s
% Output : Refutation 0.46s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.08 % Problem : CAT004-3 : TPTP v8.1.0. Released v1.0.0.
% 0.00/0.08 % Command : tptp2X_and_run_prover9 %d %s
% 0.07/0.27 % Computer : n032.cluster.edu
% 0.07/0.27 % Model : x86_64 x86_64
% 0.07/0.27 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.07/0.27 % Memory : 8042.1875MB
% 0.07/0.27 % OS : Linux 3.10.0-693.el7.x86_64
% 0.07/0.27 % CPULimit : 300
% 0.07/0.27 % WCLimit : 600
% 0.07/0.27 % DateTime : Sun May 29 18:36:11 EDT 2022
% 0.07/0.27 % CPUTime :
% 0.46/0.79 ============================== Prover9 ===============================
% 0.46/0.79 Prover9 (32) version 2009-11A, November 2009.
% 0.46/0.79 Process 31085 was started by sandbox2 on n032.cluster.edu,
% 0.46/0.79 Sun May 29 18:36:12 2022
% 0.46/0.79 The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 300 -f /tmp/Prover9_30829_n032.cluster.edu".
% 0.46/0.79 ============================== end of head ===========================
% 0.46/0.79
% 0.46/0.79 ============================== INPUT =================================
% 0.46/0.79
% 0.46/0.79 % Reading from file /tmp/Prover9_30829_n032.cluster.edu
% 0.46/0.79
% 0.46/0.79 set(prolog_style_variables).
% 0.46/0.79 set(auto2).
% 0.46/0.79 % set(auto2) -> set(auto).
% 0.46/0.79 % set(auto) -> set(auto_inference).
% 0.46/0.79 % set(auto) -> set(auto_setup).
% 0.46/0.79 % set(auto_setup) -> set(predicate_elim).
% 0.46/0.79 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.46/0.79 % set(auto) -> set(auto_limits).
% 0.46/0.79 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.46/0.79 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.46/0.79 % set(auto) -> set(auto_denials).
% 0.46/0.79 % set(auto) -> set(auto_process).
% 0.46/0.79 % set(auto2) -> assign(new_constants, 1).
% 0.46/0.79 % set(auto2) -> assign(fold_denial_max, 3).
% 0.46/0.79 % set(auto2) -> assign(max_weight, "200.000").
% 0.46/0.79 % set(auto2) -> assign(max_hours, 1).
% 0.46/0.79 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.46/0.79 % set(auto2) -> assign(max_seconds, 0).
% 0.46/0.79 % set(auto2) -> assign(max_minutes, 5).
% 0.46/0.79 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.46/0.79 % set(auto2) -> set(sort_initial_sos).
% 0.46/0.79 % set(auto2) -> assign(sos_limit, -1).
% 0.46/0.79 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.46/0.79 % set(auto2) -> assign(max_megs, 400).
% 0.46/0.79 % set(auto2) -> assign(stats, some).
% 0.46/0.79 % set(auto2) -> clear(echo_input).
% 0.46/0.79 % set(auto2) -> set(quiet).
% 0.46/0.79 % set(auto2) -> clear(print_initial_clauses).
% 0.46/0.79 % set(auto2) -> clear(print_given).
% 0.46/0.79 assign(lrs_ticks,-1).
% 0.46/0.79 assign(sos_limit,10000).
% 0.46/0.79 assign(order,kbo).
% 0.46/0.79 set(lex_order_vars).
% 0.46/0.79 clear(print_given).
% 0.46/0.79
% 0.46/0.79 % formulas(sos). % not echoed (23 formulas)
% 0.46/0.79
% 0.46/0.79 ============================== end of input ==========================
% 0.46/0.79
% 0.46/0.79 % From the command line: assign(max_seconds, 300).
% 0.46/0.79
% 0.46/0.79 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.46/0.79
% 0.46/0.79 % Formulas that are not ordinary clauses:
% 0.46/0.79
% 0.46/0.79 ============================== end of process non-clausal formulas ===
% 0.46/0.79
% 0.46/0.79 ============================== PROCESS INITIAL CLAUSES ===============
% 0.46/0.79
% 0.46/0.79 ============================== PREDICATE ELIMINATION =================
% 0.46/0.79 1 -there_exists(A) | A != B | equivalent(A,B) # label(existence_and_equality_implies_equivalence1) # label(axiom). [assumption].
% 0.46/0.79 2 -equivalent(A,B) | there_exists(A) # label(equivalence_implies_existence1) # label(axiom). [assumption].
% 0.46/0.79 3 -equivalent(A,B) | there_exists(B) # label(equivalence_implies_existence3) # label(axiom). [assumption].
% 0.46/0.79 4 -equivalent(A,B) | A = B # label(equivalence_implies_existence2) # label(axiom). [assumption].
% 0.46/0.79 Derived: -there_exists(A) | A != B | there_exists(B). [resolve(1,c,3,a)].
% 0.46/0.79 5 -there_exists(A) | -there_exists(B) | A != B | equivalent(A,B) # label(existence_and_equality_implies_equivalence2) # label(axiom). [assumption].
% 0.46/0.79
% 0.46/0.79 ============================== end predicate elimination =============
% 0.46/0.79
% 0.46/0.79 Auto_denials: (non-Horn, no changes).
% 0.46/0.79
% 0.46/0.79 Term ordering decisions:
% 0.46/0.79 Function symbol KB weights: a=1. b=1. h=1. g=1. compose=1. f1=1. domain=1. codomain=1.
% 0.46/0.79
% 0.46/0.79 ============================== end of process initial clauses ========
% 0.46/0.79
% 0.46/0.79 ============================== CLAUSES FOR SEARCH ====================
% 0.46/0.79
% 0.46/0.79 ============================== end of clauses for search =============
% 0.46/0.79
% 0.46/0.79 ============================== SEARCH ================================
% 0.46/0.79
% 0.46/0.79 % Starting search at 0.01 seconds.
% 0.46/0.79
% 0.46/0.79 ============================== PROOF =================================
% 0.46/0.79 % SZS status Unsatisfiable
% 0.46/0.79 % SZS output start Refutation
% 0.46/0.79
% 0.46/0.79 % Proof 1 at 0.01 (+ 0.00) seconds.
% 0.46/0.79 % Length of proof is 11.
% 0.46/0.79 % Level of proof is 3.
% 0.46/0.79 % Maximum clause weight is 13.000.
% 0.46/0.79 % Given clauses 21.
% 0.46/0.79
% 0.46/0.79 9 compose(codomain(A),A) = A # label(compose_codomain) # label(axiom). [assumption].
% 0.46/0.79 11 compose(A,compose(B,C)) = compose(compose(A,B),C) # label(associativity_of_compose) # label(axiom). [assumption].
% 0.46/0.79 12 compose(compose(A,B),C) = compose(A,compose(B,C)). [copy(11),flip(a)].
% 0.46/0.79 13 compose(h,compose(a,b)) = compose(g,compose(a,b)) # label(h_ab_equals_g_ab) # label(hypothesis). [assumption].
% 0.46/0.79 14 compose(g,compose(a,b)) = compose(h,compose(a,b)). [copy(13),flip(a)].
% 0.46/0.79 17 h != g # label(prove_h_equals_g) # label(negated_conjecture). [assumption].
% 0.46/0.79 18 g != h. [copy(17),flip(a)].
% 0.46/0.79 29 compose(A,a) != B | compose(C,a) != B | A = C # label(cancellation_for_product1) # label(hypothesis). [assumption].
% 0.46/0.79 30 compose(A,b) != B | compose(C,b) != B | A = C # label(cancellation_for_product2) # label(hypothesis). [assumption].
% 0.46/0.79 62 compose(g,a) != compose(h,a). [ur(29,b,9,a(flip),c,18,a),rewrite([9(11)])].
% 0.46/0.79 90 $F. [ur(30,b,12,a,c,62,a),rewrite([12(5),14(5)]),xx(a)].
% 0.46/0.79
% 0.46/0.79 % SZS output end Refutation
% 0.46/0.79 ============================== end of proof ==========================
% 0.46/0.79
% 0.46/0.79 ============================== STATISTICS ============================
% 0.46/0.79
% 0.46/0.79 Given=21. Generated=176. Kept=77. proofs=1.
% 0.46/0.79 Usable=21. Sos=56. Demods=11. Limbo=0, Disabled=24. Hints=0.
% 0.46/0.79 Megabytes=0.11.
% 0.46/0.79 User_CPU=0.02, System_CPU=0.00, Wall_clock=0.
% 0.46/0.79
% 0.46/0.79 ============================== end of statistics =====================
% 0.46/0.79
% 0.46/0.79 ============================== end of search =========================
% 0.46/0.79
% 0.46/0.79 THEOREM PROVED
% 0.46/0.79 % SZS status Unsatisfiable
% 0.46/0.79
% 0.46/0.79 Exiting with 1 proof.
% 0.46/0.79
% 0.46/0.79 Process 31085 exit (max_proofs) Sun May 29 18:36:12 2022
% 0.46/0.79 Prover9 interrupted
%------------------------------------------------------------------------------