TSTP Solution File: FLD040-5 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : FLD040-5 : TPTP v8.1.0. Bugfixed v2.1.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n029.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:19 EDT 2022
% Result : Unsatisfiable 0.75s 1.19s
% Output : Refutation 0.75s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12 % Problem : FLD040-5 : TPTP v8.1.0. Bugfixed v2.1.0.
% 0.12/0.13 % Command : tptp2X_and_run_prover9 %d %s
% 0.13/0.34 % Computer : n029.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 600
% 0.13/0.34 % DateTime : Mon Jun 6 20:41:20 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.75/1.19 ============================== Prover9 ===============================
% 0.75/1.19 Prover9 (32) version 2009-11A, November 2009.
% 0.75/1.19 Process 25002 was started by sandbox2 on n029.cluster.edu,
% 0.75/1.19 Mon Jun 6 20:41:20 2022
% 0.75/1.19 The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 300 -f /tmp/Prover9_24838_n029.cluster.edu".
% 0.75/1.19 ============================== end of head ===========================
% 0.75/1.19
% 0.75/1.19 ============================== INPUT =================================
% 0.75/1.19
% 0.75/1.19 % Reading from file /tmp/Prover9_24838_n029.cluster.edu
% 0.75/1.19
% 0.75/1.19 set(prolog_style_variables).
% 0.75/1.19 set(auto2).
% 0.75/1.19 % set(auto2) -> set(auto).
% 0.75/1.19 % set(auto) -> set(auto_inference).
% 0.75/1.19 % set(auto) -> set(auto_setup).
% 0.75/1.19 % set(auto_setup) -> set(predicate_elim).
% 0.75/1.19 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.75/1.19 % set(auto) -> set(auto_limits).
% 0.75/1.19 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.75/1.19 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.75/1.19 % set(auto) -> set(auto_denials).
% 0.75/1.19 % set(auto) -> set(auto_process).
% 0.75/1.19 % set(auto2) -> assign(new_constants, 1).
% 0.75/1.19 % set(auto2) -> assign(fold_denial_max, 3).
% 0.75/1.19 % set(auto2) -> assign(max_weight, "200.000").
% 0.75/1.19 % set(auto2) -> assign(max_hours, 1).
% 0.75/1.19 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.75/1.19 % set(auto2) -> assign(max_seconds, 0).
% 0.75/1.19 % set(auto2) -> assign(max_minutes, 5).
% 0.75/1.19 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.75/1.19 % set(auto2) -> set(sort_initial_sos).
% 0.75/1.19 % set(auto2) -> assign(sos_limit, -1).
% 0.75/1.19 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.75/1.19 % set(auto2) -> assign(max_megs, 400).
% 0.75/1.19 % set(auto2) -> assign(stats, some).
% 0.75/1.19 % set(auto2) -> clear(echo_input).
% 0.75/1.19 % set(auto2) -> set(quiet).
% 0.75/1.19 % set(auto2) -> clear(print_initial_clauses).
% 0.75/1.19 % set(auto2) -> clear(print_given).
% 0.75/1.19 assign(lrs_ticks,-1).
% 0.75/1.19 assign(sos_limit,10000).
% 0.75/1.19 assign(order,kbo).
% 0.75/1.19 set(lex_order_vars).
% 0.75/1.19 clear(print_given).
% 0.75/1.19
% 0.75/1.19 % formulas(sos). % not echoed (29 formulas)
% 0.75/1.19
% 0.75/1.19 ============================== end of input ==========================
% 0.75/1.19
% 0.75/1.19 % From the command line: assign(max_seconds, 300).
% 0.75/1.19
% 0.75/1.19 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.75/1.19
% 0.75/1.19 % Formulas that are not ordinary clauses:
% 0.75/1.19
% 0.75/1.19 ============================== end of process non-clausal formulas ===
% 0.75/1.19
% 0.75/1.19 ============================== PROCESS INITIAL CLAUSES ===============
% 0.75/1.19
% 0.75/1.19 ============================== PREDICATE ELIMINATION =================
% 0.75/1.19
% 0.75/1.19 ============================== end predicate elimination =============
% 0.75/1.19
% 0.75/1.19 Auto_denials: (non-Horn, no changes).
% 0.75/1.19
% 0.75/1.19 Term ordering decisions:
% 0.75/1.19 Function symbol KB weights: additive_identity=1. multiplicative_identity=1. a=1. add=1. multiply=1. multiplicative_inverse=1. additive_inverse=1.
% 0.75/1.19
% 0.75/1.19 ============================== end of process initial clauses ========
% 0.75/1.19
% 0.75/1.19 ============================== CLAUSES FOR SEARCH ====================
% 0.75/1.19
% 0.75/1.19 ============================== end of clauses for search =============
% 0.75/1.19
% 0.75/1.19 ============================== SEARCH ================================
% 0.75/1.19
% 0.75/1.19 % Starting search at 0.01 seconds.
% 0.75/1.19
% 0.75/1.19 ============================== PROOF =================================
% 0.75/1.19 % SZS status Unsatisfiable
% 0.75/1.19 % SZS output start Refutation
% 0.75/1.19
% 0.75/1.19 % Proof 1 at 0.18 (+ 0.01) seconds.
% 0.75/1.19 % Length of proof is 28.
% 0.75/1.19 % Level of proof is 6.
% 0.75/1.19 % Maximum clause weight is 20.000.
% 0.75/1.19 % Given clauses 253.
% 0.75/1.19
% 0.75/1.19 1 defined(additive_identity) # label(well_definedness_of_additive_identity) # label(axiom). [assumption].
% 0.75/1.19 2 defined(multiplicative_identity) # label(well_definedness_of_multiplicative_identity) # label(axiom). [assumption].
% 0.75/1.19 3 defined(a) # label(a_is_defined) # label(hypothesis). [assumption].
% 0.75/1.19 4 sum(additive_identity,multiplicative_inverse(a),additive_identity) # label(sum_3) # label(negated_conjecture). [assumption].
% 0.75/1.19 5 -sum(additive_identity,additive_identity,multiplicative_identity) # label(different_identities) # label(axiom). [assumption].
% 0.75/1.19 6 -sum(additive_identity,a,additive_identity) # label(not_sum_2) # label(negated_conjecture). [assumption].
% 0.75/1.19 8 sum(additive_identity,A,A) | -defined(A) # label(existence_of_identity_addition) # label(axiom). [assumption].
% 0.75/1.19 9 product(multiplicative_identity,A,A) | -defined(A) # label(existence_of_identity_multiplication) # label(axiom). [assumption].
% 0.75/1.19 10 sum(additive_inverse(A),A,additive_identity) | -defined(A) # label(existence_of_inverse_addition) # label(axiom). [assumption].
% 0.75/1.19 11 sum(A,B,C) | -sum(B,A,C) # label(commutativity_addition) # label(axiom). [assumption].
% 0.75/1.19 21 product(multiplicative_inverse(A),A,multiplicative_identity) | sum(additive_identity,A,additive_identity) | -defined(A) # label(existence_of_inverse_multiplication) # label(axiom). [assumption].
% 0.75/1.19 24 sum(A,B,C) | -sum(A,D,E) | -sum(D,F,B) | -sum(E,F,C) # label(associativity_addition_1) # label(axiom). [assumption].
% 0.75/1.19 25 sum(A,B,C) | -sum(D,E,A) | -sum(E,B,F) | -sum(D,F,C) # label(associativity_addition_2) # label(axiom). [assumption].
% 0.75/1.19 28 sum(A,B,C) | -sum(D,E,F) | -product(F,V6,C) | -product(D,V6,A) | -product(E,V6,B) # label(distributivity_1) # label(axiom). [assumption].
% 0.75/1.19 39 sum(A,B,B) | -sum(A,C,C) | -sum(C,D,B). [factor(24,c,d)].
% 0.75/1.19 40 sum(A,B,A) | -sum(C,D,A) | -sum(D,B,D). [factor(25,b,d)].
% 0.75/1.19 47 sum(A,B,B) | -sum(C,D,D) | -product(D,E,B) | -product(C,E,A). [factor(28,c,e)].
% 0.75/1.19 57 sum(additive_identity,multiplicative_identity,multiplicative_identity). [resolve(8,b,2,a)].
% 0.75/1.19 58 sum(additive_identity,additive_identity,additive_identity). [resolve(8,b,1,a)].
% 0.75/1.19 59 product(multiplicative_identity,a,a). [resolve(9,b,3,a)].
% 0.75/1.19 62 sum(additive_inverse(a),a,additive_identity). [resolve(10,b,3,a)].
% 0.75/1.19 65 sum(multiplicative_inverse(a),additive_identity,additive_identity). [resolve(11,b,4,a)].
% 0.75/1.19 99 product(multiplicative_inverse(a),a,multiplicative_identity). [resolve(21,c,3,a),unit_del(b,6)].
% 0.75/1.19 249 -sum(additive_identity,multiplicative_identity,additive_identity). [ur(24,a,5,a,b,58,a,d,57,a)].
% 0.75/1.19 381 -sum(a,multiplicative_identity,a). [ur(40,a,249,a,b,62,a)].
% 0.75/1.19 391 -sum(multiplicative_identity,a,a). [ur(11,a,381,a)].
% 0.75/1.19 907 -sum(multiplicative_inverse(a),multiplicative_identity,multiplicative_identity). [ur(47,a,391,a,c,59,a,d,99,a)].
% 0.75/1.19 3181 $F. [ur(39,a,907,a,c,57,a),unit_del(a,65)].
% 0.75/1.19
% 0.75/1.19 % SZS output end Refutation
% 0.75/1.19 ============================== end of proof ==========================
% 0.75/1.19
% 0.75/1.19 ============================== STATISTICS ============================
% 0.75/1.19
% 0.75/1.19 Given=253. Generated=5282. Kept=3180. proofs=1.
% 0.75/1.19 Usable=251. Sos=2911. Demods=0. Limbo=2, Disabled=45. Hints=0.
% 0.75/1.19 Megabytes=1.86.
% 0.75/1.19 User_CPU=0.18, System_CPU=0.01, Wall_clock=0.
% 0.75/1.19
% 0.75/1.19 ============================== end of statistics =====================
% 0.75/1.19
% 0.75/1.19 ============================== end of search =========================
% 0.75/1.19
% 0.75/1.19 THEOREM PROVED
% 0.75/1.19 % SZS status Unsatisfiable
% 0.75/1.19
% 0.75/1.19 Exiting with 1 proof.
% 0.75/1.19
% 0.75/1.19 Process 25002 exit (max_proofs) Mon Jun 6 20:41:20 2022
% 0.75/1.19 Prover9 interrupted
%------------------------------------------------------------------------------