TSTP Solution File: FLD011-3 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : FLD011-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:08 EDT 2022
% Result : Unsatisfiable 0.54s 0.90s
% Output : Refutation 0.54s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.10 % Problem : FLD011-3 : TPTP v8.1.0. Bugfixed v2.1.0.
% 0.03/0.10 % Command : tptp2X_and_run_prover9 %d %s
% 0.10/0.30 % Computer : n032.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.30 % CPULimit : 300
% 0.10/0.30 % WCLimit : 600
% 0.10/0.30 % DateTime : Mon Jun 6 16:55:19 EDT 2022
% 0.10/0.30 % CPUTime :
% 0.54/0.90 ============================== Prover9 ===============================
% 0.54/0.90 Prover9 (32) version 2009-11A, November 2009.
% 0.54/0.90 Process 9648 was started by sandbox on n032.cluster.edu,
% 0.54/0.90 Mon Jun 6 16:55:20 2022
% 0.54/0.90 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_9341_n032.cluster.edu".
% 0.54/0.90 ============================== end of head ===========================
% 0.54/0.90
% 0.54/0.90 ============================== INPUT =================================
% 0.54/0.90
% 0.54/0.90 % Reading from file /tmp/Prover9_9341_n032.cluster.edu
% 0.54/0.90
% 0.54/0.90 set(prolog_style_variables).
% 0.54/0.90 set(auto2).
% 0.54/0.90 % set(auto2) -> set(auto).
% 0.54/0.90 % set(auto) -> set(auto_inference).
% 0.54/0.90 % set(auto) -> set(auto_setup).
% 0.54/0.90 % set(auto_setup) -> set(predicate_elim).
% 0.54/0.90 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.54/0.90 % set(auto) -> set(auto_limits).
% 0.54/0.90 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.54/0.90 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.54/0.90 % set(auto) -> set(auto_denials).
% 0.54/0.90 % set(auto) -> set(auto_process).
% 0.54/0.90 % set(auto2) -> assign(new_constants, 1).
% 0.54/0.90 % set(auto2) -> assign(fold_denial_max, 3).
% 0.54/0.90 % set(auto2) -> assign(max_weight, "200.000").
% 0.54/0.90 % set(auto2) -> assign(max_hours, 1).
% 0.54/0.90 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.54/0.90 % set(auto2) -> assign(max_seconds, 0).
% 0.54/0.90 % set(auto2) -> assign(max_minutes, 5).
% 0.54/0.90 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.54/0.90 % set(auto2) -> set(sort_initial_sos).
% 0.54/0.90 % set(auto2) -> assign(sos_limit, -1).
% 0.54/0.90 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.54/0.90 % set(auto2) -> assign(max_megs, 400).
% 0.54/0.90 % set(auto2) -> assign(stats, some).
% 0.54/0.90 % set(auto2) -> clear(echo_input).
% 0.54/0.90 % set(auto2) -> set(quiet).
% 0.54/0.90 % set(auto2) -> clear(print_initial_clauses).
% 0.54/0.90 % set(auto2) -> clear(print_given).
% 0.54/0.90 assign(lrs_ticks,-1).
% 0.54/0.90 assign(sos_limit,10000).
% 0.54/0.90 assign(order,kbo).
% 0.54/0.90 set(lex_order_vars).
% 0.54/0.90 clear(print_given).
% 0.54/0.90
% 0.54/0.90 % formulas(sos). % not echoed (29 formulas)
% 0.54/0.90
% 0.54/0.90 ============================== end of input ==========================
% 0.54/0.90
% 0.54/0.90 % From the command line: assign(max_seconds, 300).
% 0.54/0.90
% 0.54/0.90 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.54/0.90
% 0.54/0.90 % Formulas that are not ordinary clauses:
% 0.54/0.90
% 0.54/0.90 ============================== end of process non-clausal formulas ===
% 0.54/0.90
% 0.54/0.90 ============================== PROCESS INITIAL CLAUSES ===============
% 0.54/0.90
% 0.54/0.90 ============================== PREDICATE ELIMINATION =================
% 0.54/0.90
% 0.54/0.90 ============================== end predicate elimination =============
% 0.54/0.90
% 0.54/0.90 Auto_denials: (non-Horn, no changes).
% 0.54/0.90
% 0.54/0.90 Term ordering decisions:
% 0.54/0.90 Function symbol KB weights: additive_identity=1. multiplicative_identity=1. a=1. add=1. multiply=1. additive_inverse=1. multiplicative_inverse=1.
% 0.54/0.90
% 0.54/0.90 ============================== end of process initial clauses ========
% 0.54/0.90
% 0.54/0.90 ============================== CLAUSES FOR SEARCH ====================
% 0.54/0.90
% 0.54/0.90 ============================== end of clauses for search =============
% 0.54/0.90
% 0.54/0.90 ============================== SEARCH ================================
% 0.54/0.90
% 0.54/0.90 % Starting search at 0.01 seconds.
% 0.54/0.90
% 0.54/0.90 ============================== PROOF =================================
% 0.54/0.90 % SZS status Unsatisfiable
% 0.54/0.90 % SZS output start Refutation
% 0.54/0.90
% 0.54/0.90 % Proof 1 at 0.09 (+ 0.00) seconds.
% 0.54/0.90 % Length of proof is 34.
% 0.54/0.90 % Level of proof is 5.
% 0.54/0.90 % Maximum clause weight is 20.000.
% 0.54/0.90 % Given clauses 202.
% 0.54/0.90
% 0.54/0.90 1 defined(additive_identity) # label(well_definedness_of_additive_identity) # label(axiom). [assumption].
% 0.54/0.90 2 defined(multiplicative_identity) # label(well_definedness_of_multiplicative_identity) # label(axiom). [assumption].
% 0.54/0.90 3 defined(a) # label(a_is_defined) # label(hypothesis). [assumption].
% 0.54/0.90 4 -sum(additive_identity,additive_identity,multiplicative_identity) # label(different_identities) # label(axiom). [assumption].
% 0.54/0.90 5 -sum(additive_identity,a,additive_identity) # label(not_sum_2) # label(negated_conjecture). [assumption].
% 0.54/0.90 6 -product(multiplicative_identity,multiplicative_inverse(multiplicative_inverse(a)),a) # label(not_product_3) # label(negated_conjecture). [assumption].
% 0.54/0.90 8 sum(additive_identity,A,A) | -defined(A) # label(existence_of_identity_addition) # label(axiom). [assumption].
% 0.54/0.90 9 product(multiplicative_identity,A,A) | -defined(A) # label(existence_of_identity_multiplication) # label(axiom). [assumption].
% 0.54/0.90 10 sum(additive_inverse(A),A,additive_identity) | -defined(A) # label(existence_of_inverse_addition) # label(axiom). [assumption].
% 0.54/0.90 11 sum(A,B,C) | -sum(B,A,C) # label(commutativity_addition) # label(axiom). [assumption].
% 0.54/0.90 12 product(A,B,C) | -product(B,A,C) # label(commutativity_multiplication) # label(axiom). [assumption].
% 0.54/0.90 15 defined(multiplicative_inverse(A)) | -defined(A) | sum(additive_identity,A,additive_identity) # label(well_definedness_of_multiplicative_inverse) # label(axiom). [assumption].
% 0.54/0.90 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.54/0.90 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.54/0.90 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.54/0.90 26 product(A,B,C) | -product(A,D,E) | -product(D,F,B) | -product(E,F,C) # label(associativity_multiplication_1) # label(axiom). [assumption].
% 0.54/0.90 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.54/0.90 40 sum(A,B,A) | -sum(C,D,A) | -sum(D,B,D). [factor(25,b,d)].
% 0.54/0.90 46 sum(A,B,A) | -sum(C,D,C) | -product(C,E,A) | -product(D,E,B). [factor(28,c,d)].
% 0.54/0.90 57 sum(additive_identity,multiplicative_identity,multiplicative_identity). [resolve(8,b,2,a)].
% 0.54/0.90 58 sum(additive_identity,additive_identity,additive_identity). [resolve(8,b,1,a)].
% 0.54/0.90 59 product(multiplicative_identity,a,a). [resolve(9,b,3,a)].
% 0.54/0.90 62 sum(additive_inverse(a),a,additive_identity). [resolve(10,b,3,a)].
% 0.54/0.90 66 -product(multiplicative_inverse(multiplicative_inverse(a)),multiplicative_identity,a). [ur(12,a,6,a)].
% 0.54/0.90 79 defined(multiplicative_inverse(a)). [resolve(15,b,3,a),unit_del(b,5)].
% 0.54/0.90 99 product(multiplicative_inverse(a),a,multiplicative_identity). [resolve(21,c,3,a),unit_del(b,5)].
% 0.54/0.90 178 product(multiplicative_inverse(multiplicative_inverse(a)),multiplicative_inverse(a),multiplicative_identity) | sum(additive_identity,multiplicative_inverse(a),additive_identity). [resolve(79,a,21,c)].
% 0.54/0.90 216 sum(multiplicative_identity,additive_identity,multiplicative_identity). [resolve(57,a,11,b)].
% 0.54/0.90 230 -sum(additive_identity,multiplicative_identity,additive_identity). [ur(24,a,4,a,b,58,a,d,57,a)].
% 0.54/0.90 358 -sum(a,multiplicative_identity,a). [ur(40,a,230,a,b,62,a)].
% 0.54/0.90 1007 -sum(multiplicative_identity,multiplicative_inverse(a),multiplicative_identity). [ur(46,a,358,a,c,59,a,d,99,a)].
% 0.54/0.90 1016 -product(multiplicative_inverse(multiplicative_inverse(a)),multiplicative_inverse(a),multiplicative_identity). [ur(26,a,66,a,c,99,a,d,59,a)].
% 0.54/0.90 1018 sum(additive_identity,multiplicative_inverse(a),additive_identity). [back_unit_del(178),unit_del(a,1016)].
% 0.54/0.90 2139 $F. [ur(40,a,1007,a,b,216,a),unit_del(a,1018)].
% 0.54/0.90
% 0.54/0.90 % SZS output end Refutation
% 0.54/0.90 ============================== end of proof ==========================
% 0.54/0.90
% 0.54/0.90 ============================== STATISTICS ============================
% 0.54/0.90
% 0.54/0.90 Given=202. Generated=3500. Kept=2138. proofs=1.
% 0.54/0.90 Usable=200. Sos=1923. Demods=0. Limbo=0, Disabled=44. Hints=0.
% 0.54/0.90 Megabytes=1.29.
% 0.54/0.90 User_CPU=0.09, System_CPU=0.00, Wall_clock=0.
% 0.54/0.90
% 0.54/0.90 ============================== end of statistics =====================
% 0.54/0.90
% 0.54/0.90 ============================== end of search =========================
% 0.54/0.90
% 0.54/0.90 THEOREM PROVED
% 0.54/0.90 % SZS status Unsatisfiable
% 0.54/0.90
% 0.54/0.90 Exiting with 1 proof.
% 0.54/0.90
% 0.54/0.90 Process 9648 exit (max_proofs) Mon Jun 6 16:55:20 2022
% 0.54/0.90 Prover9 interrupted
%------------------------------------------------------------------------------