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