TSTP Solution File: CAT019-3 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : CAT019-3 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n025.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.43s 1.03s
% Output : Refutation 0.43s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : CAT019-3 : TPTP v8.1.0. Released v1.0.0.
% 0.07/0.12 % Command : tptp2X_and_run_prover9 %d %s
% 0.13/0.33 % Computer : n025.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % WCLimit : 600
% 0.13/0.33 % DateTime : Sun May 29 19:53:56 EDT 2022
% 0.13/0.33 % CPUTime :
% 0.43/1.03 ============================== Prover9 ===============================
% 0.43/1.03 Prover9 (32) version 2009-11A, November 2009.
% 0.43/1.03 Process 5721 was started by sandbox on n025.cluster.edu,
% 0.43/1.03 Sun May 29 19:53:57 2022
% 0.43/1.03 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_5567_n025.cluster.edu".
% 0.43/1.03 ============================== end of head ===========================
% 0.43/1.03
% 0.43/1.03 ============================== INPUT =================================
% 0.43/1.03
% 0.43/1.03 % Reading from file /tmp/Prover9_5567_n025.cluster.edu
% 0.43/1.03
% 0.43/1.03 set(prolog_style_variables).
% 0.43/1.03 set(auto2).
% 0.43/1.03 % set(auto2) -> set(auto).
% 0.43/1.03 % set(auto) -> set(auto_inference).
% 0.43/1.03 % set(auto) -> set(auto_setup).
% 0.43/1.03 % set(auto_setup) -> set(predicate_elim).
% 0.43/1.03 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.43/1.03 % set(auto) -> set(auto_limits).
% 0.43/1.03 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.43/1.03 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.43/1.03 % set(auto) -> set(auto_denials).
% 0.43/1.03 % set(auto) -> set(auto_process).
% 0.43/1.03 % set(auto2) -> assign(new_constants, 1).
% 0.43/1.03 % set(auto2) -> assign(fold_denial_max, 3).
% 0.43/1.03 % set(auto2) -> assign(max_weight, "200.000").
% 0.43/1.03 % set(auto2) -> assign(max_hours, 1).
% 0.43/1.03 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.43/1.03 % set(auto2) -> assign(max_seconds, 0).
% 0.43/1.03 % set(auto2) -> assign(max_minutes, 5).
% 0.43/1.03 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.43/1.03 % set(auto2) -> set(sort_initial_sos).
% 0.43/1.03 % set(auto2) -> assign(sos_limit, -1).
% 0.43/1.03 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.43/1.03 % set(auto2) -> assign(max_megs, 400).
% 0.43/1.03 % set(auto2) -> assign(stats, some).
% 0.43/1.03 % set(auto2) -> clear(echo_input).
% 0.43/1.03 % set(auto2) -> set(quiet).
% 0.43/1.03 % set(auto2) -> clear(print_initial_clauses).
% 0.43/1.03 % set(auto2) -> clear(print_given).
% 0.43/1.03 assign(lrs_ticks,-1).
% 0.43/1.03 assign(sos_limit,10000).
% 0.43/1.03 assign(order,kbo).
% 0.43/1.03 set(lex_order_vars).
% 0.43/1.03 clear(print_given).
% 0.43/1.03
% 0.43/1.03 % formulas(sos). % not echoed (20 formulas)
% 0.43/1.03
% 0.43/1.03 ============================== end of input ==========================
% 0.43/1.03
% 0.43/1.03 % From the command line: assign(max_seconds, 300).
% 0.43/1.03
% 0.43/1.03 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.43/1.03
% 0.43/1.03 % Formulas that are not ordinary clauses:
% 0.43/1.03
% 0.43/1.03 ============================== end of process non-clausal formulas ===
% 0.43/1.03
% 0.43/1.03 ============================== PROCESS INITIAL CLAUSES ===============
% 0.43/1.03
% 0.43/1.03 ============================== PREDICATE ELIMINATION =================
% 0.43/1.03 1 -there_exists(A) | A != B | equivalent(A,B) # label(existence_and_equality_implies_equivalence1) # label(axiom). [assumption].
% 0.43/1.03 2 -equivalent(A,B) | there_exists(A) # label(equivalence_implies_existence1) # label(axiom). [assumption].
% 0.43/1.03 3 -equivalent(A,B) | there_exists(B) # label(equivalence_implies_existence3) # label(axiom). [assumption].
% 0.43/1.03 4 -equivalent(A,B) | A = B # label(equivalence_implies_existence2) # label(axiom). [assumption].
% 0.43/1.03 Derived: -there_exists(A) | A != B | there_exists(B). [resolve(1,c,3,a)].
% 0.43/1.03 5 -there_exists(A) | -there_exists(B) | A != B | equivalent(A,B) # label(existence_and_equality_implies_equivalence2) # label(axiom). [assumption].
% 0.43/1.03
% 0.43/1.03 ============================== end predicate elimination =============
% 0.43/1.03
% 0.43/1.03 Auto_denials: (non-Horn, no changes).
% 0.43/1.03
% 0.43/1.03 Term ordering decisions:
% 0.43/1.03 Function symbol KB weights: a=1. b=1. compose=1. f1=1. domain=1. codomain=1.
% 0.43/1.03
% 0.43/1.03 ============================== end of process initial clauses ========
% 0.43/1.03
% 0.43/1.03 ============================== CLAUSES FOR SEARCH ====================
% 0.43/1.03
% 0.43/1.03 ============================== end of clauses for search =============
% 0.43/1.03
% 0.43/1.03 ============================== SEARCH ================================
% 0.43/1.03
% 0.43/1.03 % Starting search at 0.01 seconds.
% 0.43/1.03
% 0.43/1.03 ============================== PROOF =================================
% 0.43/1.03 % SZS status Unsatisfiable
% 0.43/1.03 % SZS output start Refutation
% 0.43/1.03
% 0.43/1.03 % Proof 1 at 0.03 (+ 0.00) seconds.
% 0.43/1.03 % Length of proof is 13.
% 0.43/1.03 % Level of proof is 5.
% 0.43/1.03 % Maximum clause weight is 13.000.
% 0.43/1.03 % Given clauses 59.
% 0.43/1.03
% 0.43/1.03 8 there_exists(f1(A,B)) | A = B # label(indiscernibles1) # label(axiom). [assumption].
% 0.43/1.03 11 A = f1(A,B) | B = f1(A,B) | A = B # label(indiscernibles2) # label(axiom). [assumption].
% 0.43/1.03 12 f1(A,B) = A | f1(A,B) = B | A = B. [copy(11),flip(a),flip(b)].
% 0.43/1.03 13 a != b # label(prove_a_equals_b) # label(negated_conjecture). [assumption].
% 0.43/1.03 14 b != a. [copy(13),flip(a)].
% 0.43/1.03 19 -there_exists(A) | a != A | b = A # label(equality_of_a_and_b1) # label(hypothesis). [assumption].
% 0.43/1.03 20 -there_exists(A) | a = A | b != A # label(equality_of_a_and_b2) # label(hypothesis). [assumption].
% 0.43/1.03 31 f1(A,B) = B | A = B | there_exists(A). [para(12(a,1),8(a,1)),merge(d)].
% 0.43/1.03 40 -there_exists(a). [ur(19,b,xx,c,14,a)].
% 0.43/1.03 42 -there_exists(b). [ur(20,b,14,a(flip),c,xx)].
% 0.43/1.03 141 f1(b,A) = A | b = A. [resolve(31,c,42,a)].
% 0.43/1.03 238 b = A | there_exists(A). [para(141(a,1),8(a,1)),merge(c)].
% 0.43/1.03 265 $F. [resolve(238,b,40,a),unit_del(a,14)].
% 0.43/1.03
% 0.43/1.03 % SZS output end Refutation
% 0.43/1.03 ============================== end of proof ==========================
% 0.43/1.03
% 0.43/1.03 ============================== STATISTICS ============================
% 0.43/1.03
% 0.43/1.03 Given=59. Generated=628. Kept=253. proofs=1.
% 0.43/1.03 Usable=59. Sos=170. Demods=40. Limbo=24, Disabled=21. Hints=0.
% 0.43/1.03 Megabytes=0.22.
% 0.43/1.03 User_CPU=0.03, System_CPU=0.00, Wall_clock=0.
% 0.43/1.03
% 0.43/1.03 ============================== end of statistics =====================
% 0.43/1.03
% 0.43/1.03 ============================== end of search =========================
% 0.43/1.03
% 0.43/1.03 THEOREM PROVED
% 0.43/1.03 % SZS status Unsatisfiable
% 0.43/1.03
% 0.43/1.03 Exiting with 1 proof.
% 0.43/1.03
% 0.43/1.03 Process 5721 exit (max_proofs) Sun May 29 19:53:57 2022
% 0.43/1.03 Prover9 interrupted
%------------------------------------------------------------------------------