TSTP Solution File: FLD015-3 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : FLD015-3 : TPTP v8.1.0. Bugfixed v2.1.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n032.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:10 EDT 2022
% Result : Unsatisfiable 0.48s 0.83s
% Output : Refutation 0.48s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.02/0.08 % Problem : FLD015-3 : TPTP v8.1.0. Bugfixed v2.1.0.
% 0.02/0.08 % Command : tptp2X_and_run_prover9 %d %s
% 0.07/0.27 % Computer : n032.cluster.edu
% 0.07/0.27 % Model : x86_64 x86_64
% 0.07/0.27 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.07/0.27 % Memory : 8042.1875MB
% 0.07/0.27 % OS : Linux 3.10.0-693.el7.x86_64
% 0.07/0.27 % CPULimit : 300
% 0.07/0.27 % WCLimit : 600
% 0.07/0.27 % DateTime : Mon Jun 6 14:51:34 EDT 2022
% 0.07/0.27 % CPUTime :
% 0.48/0.83 ============================== Prover9 ===============================
% 0.48/0.83 Prover9 (32) version 2009-11A, November 2009.
% 0.48/0.83 Process 32245 was started by sandbox2 on n032.cluster.edu,
% 0.48/0.83 Mon Jun 6 14:51:35 2022
% 0.48/0.83 The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 300 -f /tmp/Prover9_32001_n032.cluster.edu".
% 0.48/0.83 ============================== end of head ===========================
% 0.48/0.83
% 0.48/0.83 ============================== INPUT =================================
% 0.48/0.83
% 0.48/0.83 % Reading from file /tmp/Prover9_32001_n032.cluster.edu
% 0.48/0.83
% 0.48/0.83 set(prolog_style_variables).
% 0.48/0.83 set(auto2).
% 0.48/0.83 % set(auto2) -> set(auto).
% 0.48/0.83 % set(auto) -> set(auto_inference).
% 0.48/0.83 % set(auto) -> set(auto_setup).
% 0.48/0.83 % set(auto_setup) -> set(predicate_elim).
% 0.48/0.83 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.48/0.83 % set(auto) -> set(auto_limits).
% 0.48/0.83 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.48/0.83 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.48/0.83 % set(auto) -> set(auto_denials).
% 0.48/0.83 % set(auto) -> set(auto_process).
% 0.48/0.83 % set(auto2) -> assign(new_constants, 1).
% 0.48/0.83 % set(auto2) -> assign(fold_denial_max, 3).
% 0.48/0.83 % set(auto2) -> assign(max_weight, "200.000").
% 0.48/0.83 % set(auto2) -> assign(max_hours, 1).
% 0.48/0.83 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.48/0.83 % set(auto2) -> assign(max_seconds, 0).
% 0.48/0.83 % set(auto2) -> assign(max_minutes, 5).
% 0.48/0.83 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.48/0.83 % set(auto2) -> set(sort_initial_sos).
% 0.48/0.83 % set(auto2) -> assign(sos_limit, -1).
% 0.48/0.83 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.48/0.83 % set(auto2) -> assign(max_megs, 400).
% 0.48/0.83 % set(auto2) -> assign(stats, some).
% 0.48/0.83 % set(auto2) -> clear(echo_input).
% 0.48/0.83 % set(auto2) -> set(quiet).
% 0.48/0.83 % set(auto2) -> clear(print_initial_clauses).
% 0.48/0.83 % set(auto2) -> clear(print_given).
% 0.48/0.83 assign(lrs_ticks,-1).
% 0.48/0.83 assign(sos_limit,10000).
% 0.48/0.83 assign(order,kbo).
% 0.48/0.83 set(lex_order_vars).
% 0.48/0.83 clear(print_given).
% 0.48/0.83
% 0.48/0.83 % formulas(sos). % not echoed (30 formulas)
% 0.48/0.83
% 0.48/0.83 ============================== end of input ==========================
% 0.48/0.83
% 0.48/0.83 % From the command line: assign(max_seconds, 300).
% 0.48/0.83
% 0.48/0.83 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.48/0.83
% 0.48/0.83 % Formulas that are not ordinary clauses:
% 0.48/0.83
% 0.48/0.83 ============================== end of process non-clausal formulas ===
% 0.48/0.83
% 0.48/0.83 ============================== PROCESS INITIAL CLAUSES ===============
% 0.48/0.83
% 0.48/0.83 ============================== PREDICATE ELIMINATION =================
% 0.48/0.83
% 0.48/0.83 ============================== end predicate elimination =============
% 0.48/0.83
% 0.48/0.83 Auto_denials: (non-Horn, no changes).
% 0.48/0.83
% 0.48/0.83 Term ordering decisions:
% 0.48/0.83 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.48/0.83
% 0.48/0.83 ============================== end of process initial clauses ========
% 0.48/0.83
% 0.48/0.83 ============================== CLAUSES FOR SEARCH ====================
% 0.48/0.83
% 0.48/0.83 ============================== end of clauses for search =============
% 0.48/0.83
% 0.48/0.83 ============================== SEARCH ================================
% 0.48/0.83
% 0.48/0.83 % Starting search at 0.01 seconds.
% 0.48/0.83
% 0.48/0.83 ============================== PROOF =================================
% 0.48/0.83 % SZS status Unsatisfiable
% 0.48/0.83 % SZS output start Refutation
% 0.48/0.83
% 0.48/0.83 % Proof 1 at 0.07 (+ 0.00) seconds.
% 0.48/0.83 % Length of proof is 18.
% 0.48/0.83 % Level of proof is 3.
% 0.48/0.83 % Maximum clause weight is 16.000.
% 0.48/0.83 % Given clauses 125.
% 0.48/0.83
% 0.48/0.83 1 defined(additive_identity) # label(well_definedness_of_additive_identity) # label(axiom). [assumption].
% 0.48/0.83 3 defined(a) # label(a_is_defined) # label(hypothesis). [assumption].
% 0.48/0.83 4 defined(b) # label(b_is_defined) # label(hypothesis). [assumption].
% 0.48/0.83 5 sum(additive_identity,additive_inverse(a),additive_inverse(b)) # label(sum_3) # label(negated_conjecture). [assumption].
% 0.48/0.83 7 -sum(additive_identity,a,b) # label(not_sum_4) # label(negated_conjecture). [assumption].
% 0.48/0.83 9 sum(additive_identity,A,A) | -defined(A) # label(existence_of_identity_addition) # label(axiom). [assumption].
% 0.48/0.83 11 sum(additive_inverse(A),A,additive_identity) | -defined(A) # label(existence_of_inverse_addition) # label(axiom). [assumption].
% 0.48/0.83 12 sum(A,B,C) | -sum(B,A,C) # label(commutativity_addition) # label(axiom). [assumption].
% 0.48/0.83 25 sum(A,B,C) | -sum(A,D,E) | -sum(D,F,B) | -sum(E,F,C) # label(associativity_addition_1) # label(axiom). [assumption].
% 0.48/0.83 58 sum(additive_identity,b,b). [resolve(9,b,4,a)].
% 0.48/0.83 61 sum(additive_identity,additive_identity,additive_identity). [resolve(9,b,1,a)].
% 0.48/0.83 66 sum(additive_inverse(b),b,additive_identity). [resolve(11,b,4,a)].
% 0.48/0.83 67 sum(additive_inverse(a),a,additive_identity). [resolve(11,b,3,a)].
% 0.48/0.83 70 sum(additive_inverse(a),additive_identity,additive_inverse(b)). [resolve(12,b,5,a)].
% 0.48/0.83 71 -sum(a,additive_identity,b). [ur(12,a,7,a)].
% 0.48/0.83 466 -sum(a,additive_inverse(b),additive_identity). [ur(25,a,71,a,c,66,a,d,58,a)].
% 0.48/0.83 560 sum(a,additive_inverse(a),additive_identity). [resolve(67,a,12,b)].
% 0.48/0.83 913 $F. [ur(25,a,466,a,c,70,a,d,61,a),unit_del(a,560)].
% 0.48/0.83
% 0.48/0.83 % SZS output end Refutation
% 0.48/0.83 ============================== end of proof ==========================
% 0.48/0.83
% 0.48/0.83 ============================== STATISTICS ============================
% 0.48/0.83
% 0.48/0.83 Given=125. Generated=1517. Kept=912. proofs=1.
% 0.48/0.83 Usable=120. Sos=778. Demods=0. Limbo=1, Disabled=43. Hints=0.
% 0.48/0.83 Megabytes=0.63.
% 0.48/0.83 User_CPU=0.07, System_CPU=0.00, Wall_clock=0.
% 0.48/0.83
% 0.48/0.83 ============================== end of statistics =====================
% 0.48/0.83
% 0.48/0.83 ============================== end of search =========================
% 0.48/0.83
% 0.48/0.83 THEOREM PROVED
% 0.48/0.83 % SZS status Unsatisfiable
% 0.48/0.83
% 0.48/0.83 Exiting with 1 proof.
% 0.48/0.83
% 0.48/0.83 Process 32245 exit (max_proofs) Mon Jun 6 14:51:35 2022
% 0.48/0.83 Prover9 interrupted
%------------------------------------------------------------------------------