TSTP Solution File: FLD041-3 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : FLD041-3 : TPTP v8.1.0. Bugfixed v2.1.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n027.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.77s 1.15s
% Output : Refutation 0.77s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.13 % Problem : FLD041-3 : TPTP v8.1.0. Bugfixed v2.1.0.
% 0.08/0.14 % Command : tptp2X_and_run_prover9 %d %s
% 0.14/0.35 % Computer : n027.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 600
% 0.14/0.35 % DateTime : Tue Jun 7 01:17:40 EDT 2022
% 0.14/0.35 % CPUTime :
% 0.77/1.15 ============================== Prover9 ===============================
% 0.77/1.15 Prover9 (32) version 2009-11A, November 2009.
% 0.77/1.15 Process 31602 was started by sandbox2 on n027.cluster.edu,
% 0.77/1.15 Tue Jun 7 01:17:40 2022
% 0.77/1.15 The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 300 -f /tmp/Prover9_31449_n027.cluster.edu".
% 0.77/1.15 ============================== end of head ===========================
% 0.77/1.15
% 0.77/1.15 ============================== INPUT =================================
% 0.77/1.15
% 0.77/1.15 % Reading from file /tmp/Prover9_31449_n027.cluster.edu
% 0.77/1.15
% 0.77/1.15 set(prolog_style_variables).
% 0.77/1.15 set(auto2).
% 0.77/1.15 % set(auto2) -> set(auto).
% 0.77/1.15 % set(auto) -> set(auto_inference).
% 0.77/1.15 % set(auto) -> set(auto_setup).
% 0.77/1.15 % set(auto_setup) -> set(predicate_elim).
% 0.77/1.15 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.77/1.15 % set(auto) -> set(auto_limits).
% 0.77/1.15 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.77/1.15 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.77/1.15 % set(auto) -> set(auto_denials).
% 0.77/1.15 % set(auto) -> set(auto_process).
% 0.77/1.15 % set(auto2) -> assign(new_constants, 1).
% 0.77/1.15 % set(auto2) -> assign(fold_denial_max, 3).
% 0.77/1.15 % set(auto2) -> assign(max_weight, "200.000").
% 0.77/1.15 % set(auto2) -> assign(max_hours, 1).
% 0.77/1.15 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.77/1.15 % set(auto2) -> assign(max_seconds, 0).
% 0.77/1.15 % set(auto2) -> assign(max_minutes, 5).
% 0.77/1.15 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.77/1.15 % set(auto2) -> set(sort_initial_sos).
% 0.77/1.15 % set(auto2) -> assign(sos_limit, -1).
% 0.77/1.15 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.77/1.15 % set(auto2) -> assign(max_megs, 400).
% 0.77/1.15 % set(auto2) -> assign(stats, some).
% 0.77/1.15 % set(auto2) -> clear(echo_input).
% 0.77/1.15 % set(auto2) -> set(quiet).
% 0.77/1.15 % set(auto2) -> clear(print_initial_clauses).
% 0.77/1.15 % set(auto2) -> clear(print_given).
% 0.77/1.15 assign(lrs_ticks,-1).
% 0.77/1.15 assign(sos_limit,10000).
% 0.77/1.15 assign(order,kbo).
% 0.77/1.15 set(lex_order_vars).
% 0.77/1.15 clear(print_given).
% 0.77/1.15
% 0.77/1.15 % formulas(sos). % not echoed (31 formulas)
% 0.77/1.15
% 0.77/1.15 ============================== end of input ==========================
% 0.77/1.15
% 0.77/1.15 % From the command line: assign(max_seconds, 300).
% 0.77/1.15
% 0.77/1.15 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.77/1.15
% 0.77/1.15 % Formulas that are not ordinary clauses:
% 0.77/1.15
% 0.77/1.15 ============================== end of process non-clausal formulas ===
% 0.77/1.15
% 0.77/1.15 ============================== PROCESS INITIAL CLAUSES ===============
% 0.77/1.15
% 0.77/1.15 ============================== PREDICATE ELIMINATION =================
% 0.77/1.15
% 0.77/1.15 ============================== end predicate elimination =============
% 0.77/1.15
% 0.77/1.15 Auto_denials: (non-Horn, no changes).
% 0.77/1.15
% 0.77/1.15 Term ordering decisions:
% 0.77/1.15 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.77/1.15
% 0.77/1.15 ============================== end of process initial clauses ========
% 0.77/1.15
% 0.77/1.15 ============================== CLAUSES FOR SEARCH ====================
% 0.77/1.15
% 0.77/1.15 ============================== end of clauses for search =============
% 0.77/1.15
% 0.77/1.15 ============================== SEARCH ================================
% 0.77/1.15
% 0.77/1.15 % Starting search at 0.01 seconds.
% 0.77/1.15
% 0.77/1.15 ============================== PROOF =================================
% 0.77/1.15 % SZS status Unsatisfiable
% 0.77/1.15 % SZS output start Refutation
% 0.77/1.15
% 0.77/1.15 % Proof 1 at 0.12 (+ 0.01) seconds.
% 0.77/1.15 % Length of proof is 26.
% 0.77/1.15 % Level of proof is 5.
% 0.77/1.15 % Maximum clause weight is 20.000.
% 0.77/1.15 % Given clauses 171.
% 0.77/1.15
% 0.77/1.15 1 defined(additive_identity) # label(well_definedness_of_additive_identity) # label(axiom). [assumption].
% 0.77/1.15 3 defined(a) # label(a_is_defined) # label(hypothesis). [assumption].
% 0.77/1.15 4 defined(b) # label(b_is_defined) # label(hypothesis). [assumption].
% 0.77/1.15 5 product(a,b,additive_identity) # label(product_5) # label(negated_conjecture). [assumption].
% 0.77/1.15 7 -sum(additive_identity,a,additive_identity) # label(not_sum_3) # label(negated_conjecture). [assumption].
% 0.77/1.15 8 -sum(additive_identity,b,additive_identity) # label(not_sum_4) # label(negated_conjecture). [assumption].
% 0.77/1.15 10 sum(additive_identity,A,A) | -defined(A) # label(existence_of_identity_addition) # label(axiom). [assumption].
% 0.77/1.15 11 product(multiplicative_identity,A,A) | -defined(A) # label(existence_of_identity_multiplication) # label(axiom). [assumption].
% 0.77/1.15 12 sum(additive_inverse(A),A,additive_identity) | -defined(A) # label(existence_of_inverse_addition) # label(axiom). [assumption].
% 0.77/1.15 14 product(A,B,C) | -product(B,A,C) # label(commutativity_multiplication) # label(axiom). [assumption].
% 0.77/1.15 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.77/1.15 27 sum(A,B,C) | -sum(D,E,A) | -sum(E,B,F) | -sum(D,F,C) # label(associativity_addition_2) # label(axiom). [assumption].
% 0.77/1.15 29 product(A,B,C) | -product(D,E,A) | -product(E,B,F) | -product(D,F,C) # label(associativity_multiplication_2) # label(axiom). [assumption].
% 0.77/1.15 30 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.77/1.15 42 sum(A,B,A) | -sum(C,D,A) | -sum(D,B,D). [factor(27,b,d)].
% 0.77/1.15 48 sum(A,B,A) | -sum(C,D,C) | -product(C,E,A) | -product(D,E,B). [factor(30,c,d)].
% 0.77/1.15 53 sum(A,A,A) | -sum(B,B,B) | -product(B,C,A). [factor(48,c,d)].
% 0.77/1.15 62 sum(additive_identity,additive_identity,additive_identity). [resolve(10,b,1,a)].
% 0.77/1.15 64 product(multiplicative_identity,a,a). [resolve(11,b,3,a)].
% 0.77/1.15 68 sum(additive_inverse(a),a,additive_identity). [resolve(12,b,3,a)].
% 0.77/1.15 117 product(multiplicative_inverse(b),b,multiplicative_identity). [resolve(23,c,4,a),unit_del(b,8)].
% 0.77/1.15 406 product(a,multiplicative_identity,a). [resolve(64,a,14,b)].
% 0.77/1.15 599 -sum(a,a,a). [ur(42,a,7,a,b,68,a)].
% 0.77/1.15 1072 -product(additive_identity,A,a). [ur(53,a,599,a,b,62,a)].
% 0.77/1.15 1485 -product(b,A,multiplicative_identity). [ur(29,a,1072,a,b,5,a,d,406,a)].
% 0.77/1.15 1659 $F. [resolve(117,a,14,b),unit_del(a,1485)].
% 0.77/1.15
% 0.77/1.15 % SZS output end Refutation
% 0.77/1.15 ============================== end of proof ==========================
% 0.77/1.15
% 0.77/1.15 ============================== STATISTICS ============================
% 0.77/1.15
% 0.77/1.15 Given=171. Generated=2829. Kept=1658. proofs=1.
% 0.77/1.15 Usable=154. Sos=1443. Demods=0. Limbo=22, Disabled=70. Hints=0.
% 0.77/1.15 Megabytes=1.00.
% 0.77/1.15 User_CPU=0.12, System_CPU=0.01, Wall_clock=0.
% 0.77/1.15
% 0.77/1.15 ============================== end of statistics =====================
% 0.77/1.15
% 0.77/1.15 ============================== end of search =========================
% 0.77/1.15
% 0.77/1.15 THEOREM PROVED
% 0.77/1.15 % SZS status Unsatisfiable
% 0.77/1.15
% 0.77/1.15 Exiting with 1 proof.
% 0.77/1.15
% 0.77/1.15 Process 31602 exit (max_proofs) Tue Jun 7 01:17:40 2022
% 0.77/1.15 Prover9 interrupted
%------------------------------------------------------------------------------