TSTP Solution File: FLD010-1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : FLD010-1 : TPTP v8.1.0. Bugfixed v2.7.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n017.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:07 EDT 2022
% Result : Unsatisfiable 0.95s 1.23s
% Output : Refutation 0.95s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.14 % Problem : FLD010-1 : TPTP v8.1.0. Bugfixed v2.7.0.
% 0.08/0.14 % Command : tptp2X_and_run_prover9 %d %s
% 0.14/0.36 % Computer : n017.cluster.edu
% 0.14/0.36 % Model : x86_64 x86_64
% 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36 % Memory : 8042.1875MB
% 0.14/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36 % CPULimit : 300
% 0.14/0.36 % WCLimit : 600
% 0.14/0.36 % DateTime : Mon Jun 6 23:51:17 EDT 2022
% 0.14/0.36 % CPUTime :
% 0.95/1.23 ============================== Prover9 ===============================
% 0.95/1.23 Prover9 (32) version 2009-11A, November 2009.
% 0.95/1.23 Process 19395 was started by sandbox2 on n017.cluster.edu,
% 0.95/1.23 Mon Jun 6 23:51:17 2022
% 0.95/1.23 The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 300 -f /tmp/Prover9_19241_n017.cluster.edu".
% 0.95/1.23 ============================== end of head ===========================
% 0.95/1.23
% 0.95/1.23 ============================== INPUT =================================
% 0.95/1.23
% 0.95/1.23 % Reading from file /tmp/Prover9_19241_n017.cluster.edu
% 0.95/1.23
% 0.95/1.23 set(prolog_style_variables).
% 0.95/1.23 set(auto2).
% 0.95/1.23 % set(auto2) -> set(auto).
% 0.95/1.23 % set(auto) -> set(auto_inference).
% 0.95/1.23 % set(auto) -> set(auto_setup).
% 0.95/1.23 % set(auto_setup) -> set(predicate_elim).
% 0.95/1.23 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.95/1.23 % set(auto) -> set(auto_limits).
% 0.95/1.23 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.95/1.23 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.95/1.23 % set(auto) -> set(auto_denials).
% 0.95/1.23 % set(auto) -> set(auto_process).
% 0.95/1.23 % set(auto2) -> assign(new_constants, 1).
% 0.95/1.23 % set(auto2) -> assign(fold_denial_max, 3).
% 0.95/1.23 % set(auto2) -> assign(max_weight, "200.000").
% 0.95/1.23 % set(auto2) -> assign(max_hours, 1).
% 0.95/1.23 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.95/1.23 % set(auto2) -> assign(max_seconds, 0).
% 0.95/1.23 % set(auto2) -> assign(max_minutes, 5).
% 0.95/1.23 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.95/1.23 % set(auto2) -> set(sort_initial_sos).
% 0.95/1.23 % set(auto2) -> assign(sos_limit, -1).
% 0.95/1.23 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.95/1.23 % set(auto2) -> assign(max_megs, 400).
% 0.95/1.23 % set(auto2) -> assign(stats, some).
% 0.95/1.23 % set(auto2) -> clear(echo_input).
% 0.95/1.23 % set(auto2) -> set(quiet).
% 0.95/1.23 % set(auto2) -> clear(print_initial_clauses).
% 0.95/1.23 % set(auto2) -> clear(print_given).
% 0.95/1.23 assign(lrs_ticks,-1).
% 0.95/1.23 assign(sos_limit,10000).
% 0.95/1.23 assign(order,kbo).
% 0.95/1.23 set(lex_order_vars).
% 0.95/1.23 clear(print_given).
% 0.95/1.23
% 0.95/1.23 % formulas(sos). % not echoed (28 formulas)
% 0.95/1.23
% 0.95/1.23 ============================== end of input ==========================
% 0.95/1.23
% 0.95/1.23 % From the command line: assign(max_seconds, 300).
% 0.95/1.23
% 0.95/1.23 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.95/1.23
% 0.95/1.23 % Formulas that are not ordinary clauses:
% 0.95/1.23
% 0.95/1.23 ============================== end of process non-clausal formulas ===
% 0.95/1.23
% 0.95/1.23 ============================== PROCESS INITIAL CLAUSES ===============
% 0.95/1.23
% 0.95/1.23 ============================== PREDICATE ELIMINATION =================
% 0.95/1.23
% 0.95/1.23 ============================== end predicate elimination =============
% 0.95/1.23
% 0.95/1.23 Auto_denials: (non-Horn, no changes).
% 0.95/1.23
% 0.95/1.23 Term ordering decisions:
% 0.95/1.23 Function symbol KB weights: additive_identity=1. multiplicative_identity=1. add=1. multiply=1. additive_inverse=1. multiplicative_inverse=1.
% 0.95/1.23
% 0.95/1.23 ============================== end of process initial clauses ========
% 0.95/1.23
% 0.95/1.23 ============================== CLAUSES FOR SEARCH ====================
% 0.95/1.23
% 0.95/1.23 ============================== end of clauses for search =============
% 0.95/1.23
% 0.95/1.23 ============================== SEARCH ================================
% 0.95/1.23
% 0.95/1.23 % Starting search at 0.01 seconds.
% 0.95/1.23
% 0.95/1.23 ============================== PROOF =================================
% 0.95/1.23 % SZS status Unsatisfiable
% 0.95/1.23 % SZS output start Refutation
% 0.95/1.23
% 0.95/1.23 % Proof 1 at 0.20 (+ 0.00) seconds.
% 0.95/1.23 % Length of proof is 14.
% 0.95/1.23 % Level of proof is 4.
% 0.95/1.23 % Maximum clause weight is 11.000.
% 0.95/1.23 % Given clauses 170.
% 0.95/1.23
% 0.95/1.23 2 defined(multiplicative_identity) # label(well_definedness_of_multiplicative_identity) # label(axiom). [assumption].
% 0.95/1.23 3 -equalish(additive_identity,multiplicative_identity) # label(different_identities) # label(axiom). [assumption].
% 0.95/1.23 4 -equalish(multiplicative_inverse(multiplicative_identity),multiplicative_identity) # label(multiplicative_inv_not_equal_to_multiplicative_id_2) # label(negated_conjecture). [assumption].
% 0.95/1.23 7 equalish(A,B) | -equalish(B,A) # label(symmetry_of_equality) # label(axiom). [assumption].
% 0.95/1.23 9 equalish(multiply(multiplicative_identity,A),A) | -defined(A) # label(existence_of_identity_multiplication) # label(axiom). [assumption].
% 0.95/1.23 13 defined(multiplicative_inverse(A)) | -defined(A) | equalish(A,additive_identity) # label(well_definedness_of_multiplicative_inverse) # label(axiom). [assumption].
% 0.95/1.23 16 equalish(A,B) | -equalish(A,C) | -equalish(C,B) # label(transitivity_of_equality) # label(axiom). [assumption].
% 0.95/1.23 20 equalish(multiply(A,multiplicative_inverse(A)),multiplicative_identity) | -defined(A) | equalish(A,additive_identity) # label(existence_of_inverse_multiplication) # label(axiom). [assumption].
% 0.95/1.23 53 -equalish(multiplicative_identity,additive_identity). [ur(7,a,3,a)].
% 0.95/1.23 68 defined(multiplicative_inverse(multiplicative_identity)). [resolve(13,b,2,a),unit_del(b,53)].
% 0.95/1.23 77 equalish(multiply(multiplicative_identity,multiplicative_inverse(multiplicative_identity)),multiplicative_identity). [resolve(20,b,2,a),unit_del(b,53)].
% 0.95/1.23 303 equalish(multiply(multiplicative_identity,multiplicative_inverse(multiplicative_identity)),multiplicative_inverse(multiplicative_identity)). [resolve(68,a,9,b)].
% 0.95/1.23 3425 -equalish(multiplicative_inverse(multiplicative_identity),multiply(multiplicative_identity,multiplicative_inverse(multiplicative_identity))). [ur(16,a,4,a,c,77,a)].
% 0.95/1.23 3547 $F. [ur(7,a,3425,a),unit_del(a,303)].
% 0.95/1.23
% 0.95/1.23 % SZS output end Refutation
% 0.95/1.23 ============================== end of proof ==========================
% 0.95/1.23
% 0.95/1.23 ============================== STATISTICS ============================
% 0.95/1.23
% 0.95/1.23 Given=170. Generated=4346. Kept=3546. proofs=1.
% 0.95/1.23 Usable=170. Sos=3372. Demods=0. Limbo=0, Disabled=32. Hints=0.
% 0.95/1.23 Megabytes=2.89.
% 0.95/1.23 User_CPU=0.20, System_CPU=0.00, Wall_clock=1.
% 0.95/1.23
% 0.95/1.23 ============================== end of statistics =====================
% 0.95/1.23
% 0.95/1.23 ============================== end of search =========================
% 0.95/1.23
% 0.95/1.23 THEOREM PROVED
% 0.95/1.23 % SZS status Unsatisfiable
% 0.95/1.23
% 0.95/1.23 Exiting with 1 proof.
% 0.95/1.23
% 0.95/1.23 Process 19395 exit (max_proofs) Mon Jun 6 23:51:18 2022
% 0.95/1.24 Prover9 interrupted
%------------------------------------------------------------------------------