TSTP Solution File: FLD025-5 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : FLD025-5 : TPTP v8.1.0. Bugfixed v2.1.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:14 EDT 2022
% Result : Unsatisfiable 0.65s 0.97s
% Output : Refutation 0.65s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : FLD025-5 : TPTP v8.1.0. Bugfixed v2.1.0.
% 0.07/0.12 % Command : tptp2X_and_run_prover9 %d %s
% 0.12/0.33 % Computer : n017.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 11:56:46 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.65/0.97 ============================== Prover9 ===============================
% 0.65/0.97 Prover9 (32) version 2009-11A, November 2009.
% 0.65/0.97 Process 15748 was started by sandbox on n017.cluster.edu,
% 0.65/0.97 Mon Jun 6 11:56:47 2022
% 0.65/0.97 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_15595_n017.cluster.edu".
% 0.65/0.97 ============================== end of head ===========================
% 0.65/0.97
% 0.65/0.97 ============================== INPUT =================================
% 0.65/0.97
% 0.65/0.97 % Reading from file /tmp/Prover9_15595_n017.cluster.edu
% 0.65/0.97
% 0.65/0.97 set(prolog_style_variables).
% 0.65/0.97 set(auto2).
% 0.65/0.97 % set(auto2) -> set(auto).
% 0.65/0.97 % set(auto) -> set(auto_inference).
% 0.65/0.97 % set(auto) -> set(auto_setup).
% 0.65/0.97 % set(auto_setup) -> set(predicate_elim).
% 0.65/0.97 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.65/0.97 % set(auto) -> set(auto_limits).
% 0.65/0.97 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.65/0.97 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.65/0.97 % set(auto) -> set(auto_denials).
% 0.65/0.97 % set(auto) -> set(auto_process).
% 0.65/0.97 % set(auto2) -> assign(new_constants, 1).
% 0.65/0.97 % set(auto2) -> assign(fold_denial_max, 3).
% 0.65/0.97 % set(auto2) -> assign(max_weight, "200.000").
% 0.65/0.97 % set(auto2) -> assign(max_hours, 1).
% 0.65/0.97 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.65/0.97 % set(auto2) -> assign(max_seconds, 0).
% 0.65/0.97 % set(auto2) -> assign(max_minutes, 5).
% 0.65/0.97 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.65/0.97 % set(auto2) -> set(sort_initial_sos).
% 0.65/0.97 % set(auto2) -> assign(sos_limit, -1).
% 0.65/0.97 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.65/0.97 % set(auto2) -> assign(max_megs, 400).
% 0.65/0.97 % set(auto2) -> assign(stats, some).
% 0.65/0.97 % set(auto2) -> clear(echo_input).
% 0.65/0.97 % set(auto2) -> set(quiet).
% 0.65/0.97 % set(auto2) -> clear(print_initial_clauses).
% 0.65/0.97 % set(auto2) -> clear(print_given).
% 0.65/0.97 assign(lrs_ticks,-1).
% 0.65/0.97 assign(sos_limit,10000).
% 0.65/0.97 assign(order,kbo).
% 0.65/0.97 set(lex_order_vars).
% 0.65/0.97 clear(print_given).
% 0.65/0.97
% 0.65/0.97 % formulas(sos). % not echoed (37 formulas)
% 0.65/0.97
% 0.65/0.97 ============================== end of input ==========================
% 0.65/0.97
% 0.65/0.97 % From the command line: assign(max_seconds, 300).
% 0.65/0.97
% 0.65/0.97 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.65/0.97
% 0.65/0.97 % Formulas that are not ordinary clauses:
% 0.65/0.97
% 0.65/0.97 ============================== end of process non-clausal formulas ===
% 0.65/0.97
% 0.65/0.97 ============================== PROCESS INITIAL CLAUSES ===============
% 0.65/0.97
% 0.65/0.97 ============================== PREDICATE ELIMINATION =================
% 0.65/0.97
% 0.65/0.97 ============================== end predicate elimination =============
% 0.65/0.97
% 0.65/0.97 Auto_denials: (non-Horn, no changes).
% 0.65/0.97
% 0.65/0.97 Term ordering decisions:
% 0.65/0.97 Function symbol KB weights: additive_identity=1. multiplicative_identity=1. a=1. b=1. c=1. d=1. u=1. v=1. add=1. multiply=1. additive_inverse=1. multiplicative_inverse=1.
% 0.65/0.97
% 0.65/0.97 ============================== end of process initial clauses ========
% 0.65/0.97
% 0.65/0.97 ============================== CLAUSES FOR SEARCH ====================
% 0.65/0.97
% 0.65/0.97 ============================== end of clauses for search =============
% 0.65/0.97
% 0.65/0.97 ============================== SEARCH ================================
% 0.65/0.97
% 0.65/0.97 % Starting search at 0.01 seconds.
% 0.65/0.97
% 0.65/0.97 ============================== PROOF =================================
% 0.65/0.97 % SZS status Unsatisfiable
% 0.65/0.97 % SZS output start Refutation
% 0.65/0.97
% 0.65/0.97 % Proof 1 at 0.01 (+ 0.00) seconds.
% 0.65/0.97 % Length of proof is 14.
% 0.65/0.97 % Level of proof is 3.
% 0.65/0.97 % Maximum clause weight is 16.000.
% 0.65/0.97 % Given clauses 65.
% 0.65/0.97
% 0.65/0.97 7 defined(u) # label(u_is_defined) # label(hypothesis). [assumption].
% 0.65/0.97 9 product(multiplicative_identity,a,b) # label(product_7) # label(negated_conjecture). [assumption].
% 0.65/0.97 10 product(multiplicative_identity,c,d) # label(product_8) # label(negated_conjecture). [assumption].
% 0.65/0.97 11 product(a,c,u) # label(product_9) # label(negated_conjecture). [assumption].
% 0.65/0.97 12 product(d,b,v) # label(product_10) # label(negated_conjecture). [assumption].
% 0.65/0.97 14 -product(multiplicative_identity,u,v) # label(not_product_11) # label(negated_conjecture). [assumption].
% 0.65/0.97 17 product(multiplicative_identity,A,A) | -defined(A) # label(existence_of_identity_multiplication) # label(axiom). [assumption].
% 0.65/0.97 20 product(A,B,C) | -product(B,A,C) # label(commutativity_multiplication) # label(axiom). [assumption].
% 0.65/0.97 34 product(A,B,C) | -product(A,D,E) | -product(D,F,B) | -product(E,F,C) # label(associativity_multiplication_1) # label(axiom). [assumption].
% 0.65/0.97 35 product(A,B,C) | -product(D,E,A) | -product(E,B,F) | -product(D,F,C) # label(associativity_multiplication_2) # label(axiom). [assumption].
% 0.65/0.97 78 product(multiplicative_identity,u,u). [resolve(17,b,7,a)].
% 0.65/0.97 208 -product(c,b,u). [ur(34,a,14,a,b,10,a,d,12,a)].
% 0.65/0.97 282 -product(b,c,u). [ur(20,a,208,a)].
% 0.65/0.97 284 $F. [ur(35,a,282,a,b,9,a,c,11,a),unit_del(a,78)].
% 0.65/0.97
% 0.65/0.97 % SZS output end Refutation
% 0.65/0.97 ============================== end of proof ==========================
% 0.65/0.97
% 0.65/0.97 ============================== STATISTICS ============================
% 0.65/0.97
% 0.65/0.97 Given=65. Generated=332. Kept=283. proofs=1.
% 0.65/0.97 Usable=65. Sos=218. Demods=0. Limbo=0, Disabled=37. Hints=0.
% 0.65/0.97 Megabytes=0.23.
% 0.65/0.97 User_CPU=0.01, System_CPU=0.00, Wall_clock=0.
% 0.65/0.97
% 0.65/0.97 ============================== end of statistics =====================
% 0.65/0.97
% 0.65/0.97 ============================== end of search =========================
% 0.65/0.97
% 0.65/0.97 THEOREM PROVED
% 0.65/0.97 % SZS status Unsatisfiable
% 0.65/0.97
% 0.65/0.97 Exiting with 1 proof.
% 0.65/0.97
% 0.65/0.97 Process 15748 exit (max_proofs) Mon Jun 6 11:56:47 2022
% 0.65/0.97 Prover9 interrupted
%------------------------------------------------------------------------------