TSTP Solution File: FLD034-1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : FLD034-1 : TPTP v8.1.0. Bugfixed v2.1.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n019.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 : Sat Jul 16 02:24:17 EDT 2022
% Result : Unsatisfiable 0.72s 1.09s
% Output : Refutation 0.72s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : FLD034-1 : TPTP v8.1.0. Bugfixed v2.1.0.
% 0.06/0.12 % Command : tptp2X_and_run_prover9 %d %s
% 0.12/0.33 % Computer : n019.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 600
% 0.12/0.33 % DateTime : Mon Jun 6 16:10:10 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.72/1.09 ============================== Prover9 ===============================
% 0.72/1.09 Prover9 (32) version 2009-11A, November 2009.
% 0.72/1.09 Process 20190 was started by sandbox on n019.cluster.edu,
% 0.72/1.09 Mon Jun 6 16:10:10 2022
% 0.72/1.09 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_20036_n019.cluster.edu".
% 0.72/1.09 ============================== end of head ===========================
% 0.72/1.09
% 0.72/1.09 ============================== INPUT =================================
% 0.72/1.09
% 0.72/1.09 % Reading from file /tmp/Prover9_20036_n019.cluster.edu
% 0.72/1.09
% 0.72/1.09 set(prolog_style_variables).
% 0.72/1.09 set(auto2).
% 0.72/1.09 % set(auto2) -> set(auto).
% 0.72/1.09 % set(auto) -> set(auto_inference).
% 0.72/1.09 % set(auto) -> set(auto_setup).
% 0.72/1.09 % set(auto_setup) -> set(predicate_elim).
% 0.72/1.09 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.72/1.09 % set(auto) -> set(auto_limits).
% 0.72/1.09 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.72/1.09 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.72/1.09 % set(auto) -> set(auto_denials).
% 0.72/1.09 % set(auto) -> set(auto_process).
% 0.72/1.09 % set(auto2) -> assign(new_constants, 1).
% 0.72/1.09 % set(auto2) -> assign(fold_denial_max, 3).
% 0.72/1.09 % set(auto2) -> assign(max_weight, "200.000").
% 0.72/1.09 % set(auto2) -> assign(max_hours, 1).
% 0.72/1.09 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.72/1.09 % set(auto2) -> assign(max_seconds, 0).
% 0.72/1.09 % set(auto2) -> assign(max_minutes, 5).
% 0.72/1.09 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.72/1.09 % set(auto2) -> set(sort_initial_sos).
% 0.72/1.09 % set(auto2) -> assign(sos_limit, -1).
% 0.72/1.09 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.72/1.09 % set(auto2) -> assign(max_megs, 400).
% 0.72/1.09 % set(auto2) -> assign(stats, some).
% 0.72/1.09 % set(auto2) -> clear(echo_input).
% 0.72/1.09 % set(auto2) -> set(quiet).
% 0.72/1.09 % set(auto2) -> clear(print_initial_clauses).
% 0.72/1.09 % set(auto2) -> clear(print_given).
% 0.72/1.09 assign(lrs_ticks,-1).
% 0.72/1.09 assign(sos_limit,10000).
% 0.72/1.09 assign(order,kbo).
% 0.72/1.09 set(lex_order_vars).
% 0.72/1.09 clear(print_given).
% 0.72/1.09
% 0.72/1.09 % formulas(sos). % not echoed (31 formulas)
% 0.72/1.09
% 0.72/1.09 ============================== end of input ==========================
% 0.72/1.09
% 0.72/1.09 % From the command line: assign(max_seconds, 300).
% 0.72/1.09
% 0.72/1.09 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.72/1.09
% 0.72/1.09 % Formulas that are not ordinary clauses:
% 0.72/1.09
% 0.72/1.09 ============================== end of process non-clausal formulas ===
% 0.72/1.09
% 0.72/1.09 ============================== PROCESS INITIAL CLAUSES ===============
% 0.72/1.09
% 0.72/1.09 ============================== PREDICATE ELIMINATION =================
% 0.72/1.09
% 0.72/1.09 ============================== end predicate elimination =============
% 0.72/1.09
% 0.72/1.09 Auto_denials: (non-Horn, no changes).
% 0.72/1.09
% 0.72/1.09 Term ordering decisions:
% 0.72/1.09 Function symbol KB weights: additive_identity=1. multiplicative_identity=1. m=1. a=1. add=1. multiply=1. additive_inverse=1. multiplicative_inverse=1.
% 0.72/1.09
% 0.72/1.09 ============================== end of process initial clauses ========
% 0.72/1.09
% 0.72/1.09 ============================== CLAUSES FOR SEARCH ====================
% 0.72/1.09
% 0.72/1.09 ============================== end of clauses for search =============
% 0.72/1.09
% 0.72/1.09 ============================== SEARCH ================================
% 0.72/1.09
% 0.72/1.09 % Starting search at 0.01 seconds.
% 0.72/1.09
% 0.72/1.09 ============================== PROOF =================================
% 0.72/1.09 % SZS status Unsatisfiable
% 0.72/1.09 % SZS output start Refutation
% 0.72/1.09
% 0.72/1.09 % Proof 1 at 0.12 (+ 0.00) seconds.
% 0.72/1.09 % Length of proof is 9.
% 0.72/1.09 % Level of proof is 3.
% 0.72/1.09 % Maximum clause weight is 12.000.
% 0.72/1.09 % Given clauses 161.
% 0.72/1.09
% 0.72/1.09 3 defined(a) # label(a_is_defined) # label(hypothesis). [assumption].
% 0.72/1.09 5 equalish(m,multiplicative_identity) # label(m_equals_multiplicative_identity_3) # label(negated_conjecture). [assumption].
% 0.72/1.09 7 -equalish(multiply(m,a),a) # label(multiply_not_equal_to_a_4) # label(negated_conjecture). [assumption].
% 0.72/1.09 12 equalish(multiply(multiplicative_identity,A),A) | -defined(A) # label(existence_of_identity_multiplication) # label(axiom). [assumption].
% 0.72/1.09 19 equalish(A,B) | -equalish(A,C) | -equalish(C,B) # label(transitivity_of_equality) # label(axiom). [assumption].
% 0.72/1.09 28 equalish(multiply(A,B),multiply(C,B)) | -defined(B) | -equalish(A,C) # label(compatibility_of_equality_and_multiplication) # label(axiom). [assumption].
% 0.72/1.09 67 equalish(multiply(multiplicative_identity,a),a). [resolve(12,b,3,a)].
% 0.72/1.09 1345 -equalish(multiply(m,a),multiply(multiplicative_identity,a)). [ur(19,a,7,a,c,67,a)].
% 0.72/1.09 1904 $F. [ur(28,a,1345,a,c,5,a),unit_del(a,3)].
% 0.72/1.09
% 0.72/1.09 % SZS output end Refutation
% 0.72/1.09 ============================== end of proof ==========================
% 0.72/1.09
% 0.72/1.09 ============================== STATISTICS ============================
% 0.72/1.09
% 0.72/1.09 Given=161. Generated=2490. Kept=1903. proofs=1.
% 0.72/1.09 Usable=161. Sos=1738. Demods=0. Limbo=0, Disabled=35. Hints=0.
% 0.72/1.09 Megabytes=1.61.
% 0.72/1.09 User_CPU=0.12, System_CPU=0.00, Wall_clock=1.
% 0.72/1.09
% 0.72/1.09 ============================== end of statistics =====================
% 0.72/1.09
% 0.72/1.09 ============================== end of search =========================
% 0.72/1.09
% 0.72/1.09 THEOREM PROVED
% 0.72/1.09 % SZS status Unsatisfiable
% 0.72/1.09
% 0.72/1.09 Exiting with 1 proof.
% 0.72/1.09
% 0.72/1.09 Process 20190 exit (max_proofs) Mon Jun 6 16:10:11 2022
% 0.72/1.09 Prover9 interrupted
%------------------------------------------------------------------------------