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