TSTP Solution File: FLD037-3 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : FLD037-3 : 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:18 EDT 2022
% Result : Unsatisfiable 0.69s 1.01s
% Output : Refutation 0.69s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.02/0.10 % Problem : FLD037-3 : TPTP v8.1.0. Bugfixed v2.1.0.
% 0.02/0.10 % Command : tptp2X_and_run_prover9 %d %s
% 0.10/0.30 % Computer : n019.cluster.edu
% 0.10/0.30 % Model : x86_64 x86_64
% 0.10/0.30 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.30 % Memory : 8042.1875MB
% 0.10/0.30 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.31 % CPULimit : 300
% 0.10/0.31 % WCLimit : 600
% 0.10/0.31 % DateTime : Mon Jun 6 11:28:10 EDT 2022
% 0.10/0.31 % CPUTime :
% 0.69/1.01 ============================== Prover9 ===============================
% 0.69/1.01 Prover9 (32) version 2009-11A, November 2009.
% 0.69/1.01 Process 17248 was started by sandbox2 on n019.cluster.edu,
% 0.69/1.01 Mon Jun 6 11:28:11 2022
% 0.69/1.01 The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 300 -f /tmp/Prover9_17095_n019.cluster.edu".
% 0.69/1.01 ============================== end of head ===========================
% 0.69/1.01
% 0.69/1.01 ============================== INPUT =================================
% 0.69/1.01
% 0.69/1.01 % Reading from file /tmp/Prover9_17095_n019.cluster.edu
% 0.69/1.01
% 0.69/1.01 set(prolog_style_variables).
% 0.69/1.01 set(auto2).
% 0.69/1.01 % set(auto2) -> set(auto).
% 0.69/1.01 % set(auto) -> set(auto_inference).
% 0.69/1.01 % set(auto) -> set(auto_setup).
% 0.69/1.01 % set(auto_setup) -> set(predicate_elim).
% 0.69/1.01 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.69/1.01 % set(auto) -> set(auto_limits).
% 0.69/1.01 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.69/1.01 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.69/1.01 % set(auto) -> set(auto_denials).
% 0.69/1.01 % set(auto) -> set(auto_process).
% 0.69/1.01 % set(auto2) -> assign(new_constants, 1).
% 0.69/1.01 % set(auto2) -> assign(fold_denial_max, 3).
% 0.69/1.01 % set(auto2) -> assign(max_weight, "200.000").
% 0.69/1.01 % set(auto2) -> assign(max_hours, 1).
% 0.69/1.01 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.69/1.01 % set(auto2) -> assign(max_seconds, 0).
% 0.69/1.01 % set(auto2) -> assign(max_minutes, 5).
% 0.69/1.01 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.69/1.01 % set(auto2) -> set(sort_initial_sos).
% 0.69/1.01 % set(auto2) -> assign(sos_limit, -1).
% 0.69/1.01 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.69/1.01 % set(auto2) -> assign(max_megs, 400).
% 0.69/1.01 % set(auto2) -> assign(stats, some).
% 0.69/1.01 % set(auto2) -> clear(echo_input).
% 0.69/1.01 % set(auto2) -> set(quiet).
% 0.69/1.01 % set(auto2) -> clear(print_initial_clauses).
% 0.69/1.01 % set(auto2) -> clear(print_given).
% 0.69/1.01 assign(lrs_ticks,-1).
% 0.69/1.01 assign(sos_limit,10000).
% 0.69/1.01 assign(order,kbo).
% 0.69/1.01 set(lex_order_vars).
% 0.69/1.01 clear(print_given).
% 0.69/1.01
% 0.69/1.01 % formulas(sos). % not echoed (31 formulas)
% 0.69/1.01
% 0.69/1.01 ============================== end of input ==========================
% 0.69/1.01
% 0.69/1.01 % From the command line: assign(max_seconds, 300).
% 0.69/1.01
% 0.69/1.01 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.69/1.01
% 0.69/1.01 % Formulas that are not ordinary clauses:
% 0.69/1.01
% 0.69/1.01 ============================== end of process non-clausal formulas ===
% 0.69/1.01
% 0.69/1.01 ============================== PROCESS INITIAL CLAUSES ===============
% 0.69/1.01
% 0.69/1.01 ============================== PREDICATE ELIMINATION =================
% 0.69/1.01
% 0.69/1.01 ============================== end predicate elimination =============
% 0.69/1.01
% 0.69/1.01 Auto_denials: (non-Horn, no changes).
% 0.69/1.01
% 0.69/1.01 Term ordering decisions:
% 0.69/1.01 Function symbol KB weights: additive_identity=1. multiplicative_identity=1. a=1. b=1. add=1. multiply=1. additive_inverse=1. multiplicative_inverse=1.
% 0.69/1.01
% 0.69/1.01 ============================== end of process initial clauses ========
% 0.69/1.01
% 0.69/1.01 ============================== CLAUSES FOR SEARCH ====================
% 0.69/1.01
% 0.69/1.01 ============================== end of clauses for search =============
% 0.69/1.01
% 0.69/1.01 ============================== SEARCH ================================
% 0.69/1.01
% 0.69/1.01 % Starting search at 0.01 seconds.
% 0.69/1.01
% 0.69/1.01 ============================== PROOF =================================
% 0.69/1.01 % SZS status Unsatisfiable
% 0.69/1.01 % SZS output start Refutation
% 0.69/1.01
% 0.69/1.01 % Proof 1 at 0.03 (+ 0.00) seconds.
% 0.69/1.01 % Length of proof is 14.
% 0.69/1.01 % Level of proof is 2.
% 0.69/1.01 % Maximum clause weight is 16.000.
% 0.69/1.01 % Given clauses 78.
% 0.69/1.01
% 0.69/1.01 2 defined(multiplicative_identity) # label(well_definedness_of_multiplicative_identity) # label(axiom). [assumption].
% 0.69/1.01 3 defined(a) # label(a_is_defined) # label(hypothesis). [assumption].
% 0.69/1.01 5 product(multiplicative_identity,a,b) # label(product_4) # label(negated_conjecture). [assumption].
% 0.69/1.01 7 -sum(additive_identity,a,additive_identity) # label(not_sum_3) # label(negated_conjecture). [assumption].
% 0.69/1.01 8 -product(b,multiplicative_inverse(a),multiplicative_identity) # label(not_product_5) # label(negated_conjecture). [assumption].
% 0.69/1.01 11 product(multiplicative_identity,A,A) | -defined(A) # label(existence_of_identity_multiplication) # label(axiom). [assumption].
% 0.69/1.01 14 product(A,B,C) | -product(B,A,C) # label(commutativity_multiplication) # label(axiom). [assumption].
% 0.69/1.01 23 product(multiplicative_inverse(A),A,multiplicative_identity) | sum(additive_identity,A,additive_identity) | -defined(A) # label(existence_of_inverse_multiplication) # label(axiom). [assumption].
% 0.69/1.01 28 product(A,B,C) | -product(A,D,E) | -product(D,F,B) | -product(E,F,C) # label(associativity_multiplication_1) # label(axiom). [assumption].
% 0.69/1.01 65 product(multiplicative_identity,multiplicative_identity,multiplicative_identity). [resolve(11,b,2,a)].
% 0.69/1.01 72 product(a,multiplicative_identity,b). [resolve(14,b,5,a)].
% 0.69/1.01 73 -product(multiplicative_inverse(a),b,multiplicative_identity). [ur(14,a,8,a)].
% 0.69/1.01 118 product(multiplicative_inverse(a),a,multiplicative_identity). [resolve(23,c,3,a),unit_del(b,7)].
% 0.69/1.01 446 $F. [ur(28,a,73,a,c,72,a,d,65,a),unit_del(a,118)].
% 0.69/1.01
% 0.69/1.01 % SZS output end Refutation
% 0.69/1.01 ============================== end of proof ==========================
% 0.69/1.01
% 0.69/1.01 ============================== STATISTICS ============================
% 0.69/1.01
% 0.69/1.01 Given=78. Generated=630. Kept=445. proofs=1.
% 0.69/1.01 Usable=78. Sos=344. Demods=0. Limbo=21, Disabled=33. Hints=0.
% 0.69/1.01 Megabytes=0.31.
% 0.69/1.01 User_CPU=0.03, System_CPU=0.00, Wall_clock=0.
% 0.69/1.01
% 0.69/1.01 ============================== end of statistics =====================
% 0.69/1.01
% 0.69/1.01 ============================== end of search =========================
% 0.69/1.01
% 0.69/1.01 THEOREM PROVED
% 0.69/1.01 % SZS status Unsatisfiable
% 0.69/1.01
% 0.69/1.01 Exiting with 1 proof.
% 0.69/1.01
% 0.69/1.01 Process 17248 exit (max_proofs) Mon Jun 6 11:28:11 2022
% 0.69/1.01 Prover9 interrupted
%------------------------------------------------------------------------------