TSTP Solution File: FLD050-4 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : FLD050-4 : TPTP v8.1.0. Bugfixed v2.1.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n022.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:23 EDT 2022
% Result : Unsatisfiable 1.12s 1.41s
% Output : Refutation 1.12s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : FLD050-4 : TPTP v8.1.0. Bugfixed v2.1.0.
% 0.11/0.12 % Command : tptp2X_and_run_prover9 %d %s
% 0.12/0.33 % Computer : n022.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 : Tue Jun 7 04:19:05 EDT 2022
% 0.12/0.34 % CPUTime :
% 1.12/1.41 ============================== Prover9 ===============================
% 1.12/1.41 Prover9 (32) version 2009-11A, November 2009.
% 1.12/1.41 Process 19290 was started by sandbox on n022.cluster.edu,
% 1.12/1.41 Tue Jun 7 04:19:06 2022
% 1.12/1.41 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_19135_n022.cluster.edu".
% 1.12/1.41 ============================== end of head ===========================
% 1.12/1.41
% 1.12/1.41 ============================== INPUT =================================
% 1.12/1.41
% 1.12/1.41 % Reading from file /tmp/Prover9_19135_n022.cluster.edu
% 1.12/1.41
% 1.12/1.41 set(prolog_style_variables).
% 1.12/1.41 set(auto2).
% 1.12/1.41 % set(auto2) -> set(auto).
% 1.12/1.41 % set(auto) -> set(auto_inference).
% 1.12/1.41 % set(auto) -> set(auto_setup).
% 1.12/1.41 % set(auto_setup) -> set(predicate_elim).
% 1.12/1.41 % set(auto_setup) -> assign(eq_defs, unfold).
% 1.12/1.41 % set(auto) -> set(auto_limits).
% 1.12/1.41 % set(auto_limits) -> assign(max_weight, "100.000").
% 1.12/1.41 % set(auto_limits) -> assign(sos_limit, 20000).
% 1.12/1.41 % set(auto) -> set(auto_denials).
% 1.12/1.41 % set(auto) -> set(auto_process).
% 1.12/1.41 % set(auto2) -> assign(new_constants, 1).
% 1.12/1.41 % set(auto2) -> assign(fold_denial_max, 3).
% 1.12/1.41 % set(auto2) -> assign(max_weight, "200.000").
% 1.12/1.41 % set(auto2) -> assign(max_hours, 1).
% 1.12/1.41 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 1.12/1.41 % set(auto2) -> assign(max_seconds, 0).
% 1.12/1.41 % set(auto2) -> assign(max_minutes, 5).
% 1.12/1.41 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 1.12/1.41 % set(auto2) -> set(sort_initial_sos).
% 1.12/1.41 % set(auto2) -> assign(sos_limit, -1).
% 1.12/1.41 % set(auto2) -> assign(lrs_ticks, 3000).
% 1.12/1.41 % set(auto2) -> assign(max_megs, 400).
% 1.12/1.41 % set(auto2) -> assign(stats, some).
% 1.12/1.41 % set(auto2) -> clear(echo_input).
% 1.12/1.41 % set(auto2) -> set(quiet).
% 1.12/1.41 % set(auto2) -> clear(print_initial_clauses).
% 1.12/1.41 % set(auto2) -> clear(print_given).
% 1.12/1.41 assign(lrs_ticks,-1).
% 1.12/1.41 assign(sos_limit,10000).
% 1.12/1.41 assign(order,kbo).
% 1.12/1.41 set(lex_order_vars).
% 1.12/1.41 clear(print_given).
% 1.12/1.41
% 1.12/1.41 % formulas(sos). % not echoed (38 formulas)
% 1.12/1.41
% 1.12/1.41 ============================== end of input ==========================
% 1.12/1.41
% 1.12/1.41 % From the command line: assign(max_seconds, 300).
% 1.12/1.41
% 1.12/1.41 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 1.12/1.41
% 1.12/1.41 % Formulas that are not ordinary clauses:
% 1.12/1.41
% 1.12/1.41 ============================== end of process non-clausal formulas ===
% 1.12/1.41
% 1.12/1.41 ============================== PROCESS INITIAL CLAUSES ===============
% 1.12/1.41
% 1.12/1.41 ============================== PREDICATE ELIMINATION =================
% 1.12/1.41
% 1.12/1.41 ============================== end predicate elimination =============
% 1.12/1.41
% 1.12/1.41 Auto_denials: (non-Horn, no changes).
% 1.12/1.41
% 1.12/1.41 Term ordering decisions:
% 1.12/1.41 Function symbol KB weights: additive_identity=1. a=1. b=1. k=1. multiplicative_identity=1. c=1. d=1. s=1. add=1. multiply=1. multiplicative_inverse=1. additive_inverse=1.
% 1.12/1.41
% 1.12/1.41 ============================== end of process initial clauses ========
% 1.12/1.41
% 1.12/1.41 ============================== CLAUSES FOR SEARCH ====================
% 1.12/1.41
% 1.12/1.41 ============================== end of clauses for search =============
% 1.12/1.41
% 1.12/1.41 ============================== SEARCH ================================
% 1.12/1.41
% 1.12/1.41 % Starting search at 0.02 seconds.
% 1.12/1.41
% 1.12/1.41 Low Water (keep): wt=14.000, iters=3483
% 1.12/1.41
% 1.12/1.41 Low Water (keep): wt=12.000, iters=3352
% 1.12/1.41
% 1.12/1.41 Low Water (keep): wt=11.000, iters=3476
% 1.12/1.41
% 1.12/1.41 Low Water (keep): wt=8.000, iters=3354
% 1.12/1.41
% 1.12/1.41 Low Water (keep): wt=7.000, iters=3358
% 1.12/1.41
% 1.12/1.41 Low Water (keep): wt=6.000, iters=3333
% 1.12/1.41
% 1.12/1.41 NOTE: Back_subsumption disabled, ratio of kept to back_subsumed is 179 (0.00 of 0.34 sec).
% 1.12/1.41
% 1.12/1.41 ============================== PROOF =================================
% 1.12/1.41 % SZS status Unsatisfiable
% 1.12/1.41 % SZS output start Refutation
% 1.12/1.41
% 1.12/1.41 % Proof 1 at 0.42 (+ 0.02) seconds.
% 1.12/1.41 % Length of proof is 27.
% 1.12/1.41 % Level of proof is 4.
% 1.12/1.41 % Maximum clause weight is 16.000.
% 1.12/1.41 % Given clauses 663.
% 1.12/1.41
% 1.12/1.41 4 defined(b) # label(b_is_defined) # label(hypothesis). [assumption].
% 1.12/1.41 5 defined(c) # label(c_is_defined) # label(hypothesis). [assumption].
% 1.12/1.41 6 defined(d) # label(d_is_defined) # label(hypothesis). [assumption].
% 1.12/1.41 8 defined(s) # label(s_is_defined) # label(hypothesis). [assumption].
% 1.12/1.41 9 product(a,d,k) # label(product_10) # label(negated_conjecture). [assumption].
% 1.12/1.41 10 product(b,c,k) # label(product_11) # label(negated_conjecture). [assumption].
% 1.12/1.41 11 product(a,multiplicative_inverse(b),s) # label(product_9) # label(negated_conjecture). [assumption].
% 1.12/1.41 13 -sum(additive_identity,b,additive_identity) # label(not_sum_7) # label(negated_conjecture). [assumption].
% 1.12/1.41 14 -sum(additive_identity,d,additive_identity) # label(not_sum_8) # label(negated_conjecture). [assumption].
% 1.12/1.41 15 -product(c,multiplicative_inverse(d),s) # label(not_product_12) # label(negated_conjecture). [assumption].
% 1.12/1.41 18 product(multiplicative_identity,A,A) | -defined(A) # label(existence_of_identity_multiplication) # label(axiom). [assumption].
% 1.12/1.41 21 product(A,B,C) | -product(B,A,C) # label(commutativity_multiplication) # label(axiom). [assumption].
% 1.12/1.41 30 product(multiplicative_inverse(A),A,multiplicative_identity) | sum(additive_identity,A,additive_identity) | -defined(A) # label(existence_of_inverse_multiplication) # label(axiom). [assumption].
% 1.12/1.41 35 product(A,B,C) | -product(A,D,E) | -product(D,F,B) | -product(E,F,C) # label(associativity_multiplication_1) # label(axiom). [assumption].
% 1.12/1.41 36 product(A,B,C) | -product(D,E,A) | -product(E,B,F) | -product(D,F,C) # label(associativity_multiplication_2) # label(axiom). [assumption].
% 1.12/1.41 78 product(multiplicative_identity,s,s). [resolve(18,b,8,a)].
% 1.12/1.41 81 product(multiplicative_identity,c,c). [resolve(18,b,5,a)].
% 1.12/1.41 97 product(c,b,k). [resolve(21,b,10,a)].
% 1.12/1.41 98 product(d,a,k). [resolve(21,b,9,a)].
% 1.12/1.41 99 -product(multiplicative_inverse(d),c,s). [ur(21,a,15,a)].
% 1.12/1.41 189 product(multiplicative_inverse(d),d,multiplicative_identity). [resolve(30,c,6,a),unit_del(b,14)].
% 1.12/1.41 191 product(multiplicative_inverse(b),b,multiplicative_identity). [resolve(30,c,4,a),unit_del(b,13)].
% 1.12/1.41 651 product(c,multiplicative_identity,c). [resolve(81,a,21,b)].
% 1.12/1.41 5996 -product(d,s,c). [ur(35,a,99,a,b,189,a,d,78,a)].
% 1.12/1.41 5997 product(b,multiplicative_inverse(b),multiplicative_identity). [resolve(191,a,21,b)].
% 1.12/1.41 6029 -product(k,multiplicative_inverse(b),c). [ur(35,a,5996,a,b,98,a,c,11,a)].
% 1.12/1.41 6212 $F. [ur(36,a,6029,a,b,97,a,d,651,a),unit_del(a,5997)].
% 1.12/1.41
% 1.12/1.41 % SZS output end Refutation
% 1.12/1.41 ============================== end of proof ==========================
% 1.12/1.41
% 1.12/1.41 ============================== STATISTICS ============================
% 1.12/1.41
% 1.12/1.41 Given=663. Generated=21629. Kept=6211. proofs=1.
% 1.12/1.41 Usable=646. Sos=5517. Demods=0. Limbo=0, Disabled=86. Hints=0.
% 1.12/1.41 Megabytes=3.10.
% 1.12/1.41 User_CPU=0.42, System_CPU=0.02, Wall_clock=0.
% 1.12/1.41
% 1.12/1.41 ============================== end of statistics =====================
% 1.12/1.41
% 1.12/1.41 ============================== end of search =========================
% 1.12/1.41
% 1.12/1.41 THEOREM PROVED
% 1.12/1.41 % SZS status Unsatisfiable
% 1.12/1.41
% 1.12/1.41 Exiting with 1 proof.
% 1.12/1.41
% 1.12/1.41 Process 19290 exit (max_proofs) Tue Jun 7 04:19:06 2022
% 1.12/1.41 Prover9 interrupted
%------------------------------------------------------------------------------