TSTP Solution File: FLD026-3 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : FLD026-3 : TPTP v8.1.0. Bugfixed v2.1.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n020.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:14 EDT 2022
% Result : Unsatisfiable 1.20s 1.51s
% Output : Refutation 1.20s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : FLD026-3 : TPTP v8.1.0. Bugfixed v2.1.0.
% 0.03/0.13 % Command : tptp2X_and_run_prover9 %d %s
% 0.13/0.34 % Computer : n020.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 : Tue Jun 7 03:21:22 EDT 2022
% 0.13/0.35 % CPUTime :
% 1.20/1.51 ============================== Prover9 ===============================
% 1.20/1.51 Prover9 (32) version 2009-11A, November 2009.
% 1.20/1.51 Process 14489 was started by sandbox2 on n020.cluster.edu,
% 1.20/1.51 Tue Jun 7 03:21:22 2022
% 1.20/1.51 The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 300 -f /tmp/Prover9_14140_n020.cluster.edu".
% 1.20/1.51 ============================== end of head ===========================
% 1.20/1.51
% 1.20/1.51 ============================== INPUT =================================
% 1.20/1.51
% 1.20/1.51 % Reading from file /tmp/Prover9_14140_n020.cluster.edu
% 1.20/1.51
% 1.20/1.51 set(prolog_style_variables).
% 1.20/1.51 set(auto2).
% 1.20/1.51 % set(auto2) -> set(auto).
% 1.20/1.51 % set(auto) -> set(auto_inference).
% 1.20/1.51 % set(auto) -> set(auto_setup).
% 1.20/1.51 % set(auto_setup) -> set(predicate_elim).
% 1.20/1.51 % set(auto_setup) -> assign(eq_defs, unfold).
% 1.20/1.51 % set(auto) -> set(auto_limits).
% 1.20/1.51 % set(auto_limits) -> assign(max_weight, "100.000").
% 1.20/1.51 % set(auto_limits) -> assign(sos_limit, 20000).
% 1.20/1.51 % set(auto) -> set(auto_denials).
% 1.20/1.51 % set(auto) -> set(auto_process).
% 1.20/1.51 % set(auto2) -> assign(new_constants, 1).
% 1.20/1.51 % set(auto2) -> assign(fold_denial_max, 3).
% 1.20/1.51 % set(auto2) -> assign(max_weight, "200.000").
% 1.20/1.51 % set(auto2) -> assign(max_hours, 1).
% 1.20/1.51 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 1.20/1.51 % set(auto2) -> assign(max_seconds, 0).
% 1.20/1.51 % set(auto2) -> assign(max_minutes, 5).
% 1.20/1.51 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 1.20/1.51 % set(auto2) -> set(sort_initial_sos).
% 1.20/1.51 % set(auto2) -> assign(sos_limit, -1).
% 1.20/1.51 % set(auto2) -> assign(lrs_ticks, 3000).
% 1.20/1.51 % set(auto2) -> assign(max_megs, 400).
% 1.20/1.51 % set(auto2) -> assign(stats, some).
% 1.20/1.51 % set(auto2) -> clear(echo_input).
% 1.20/1.51 % set(auto2) -> set(quiet).
% 1.20/1.51 % set(auto2) -> clear(print_initial_clauses).
% 1.20/1.51 % set(auto2) -> clear(print_given).
% 1.20/1.51 assign(lrs_ticks,-1).
% 1.20/1.51 assign(sos_limit,10000).
% 1.20/1.51 assign(order,kbo).
% 1.20/1.51 set(lex_order_vars).
% 1.20/1.51 clear(print_given).
% 1.20/1.51
% 1.20/1.51 % formulas(sos). % not echoed (31 formulas)
% 1.20/1.51
% 1.20/1.51 ============================== end of input ==========================
% 1.20/1.51
% 1.20/1.51 % From the command line: assign(max_seconds, 300).
% 1.20/1.51
% 1.20/1.51 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 1.20/1.51
% 1.20/1.51 % Formulas that are not ordinary clauses:
% 1.20/1.51
% 1.20/1.51 ============================== end of process non-clausal formulas ===
% 1.20/1.51
% 1.20/1.51 ============================== PROCESS INITIAL CLAUSES ===============
% 1.20/1.51
% 1.20/1.51 ============================== PREDICATE ELIMINATION =================
% 1.20/1.51
% 1.20/1.51 ============================== end predicate elimination =============
% 1.20/1.51
% 1.20/1.51 Auto_denials: (non-Horn, no changes).
% 1.20/1.51
% 1.20/1.51 Term ordering decisions:
% 1.20/1.51 Function symbol KB weights: additive_identity=1. multiplicative_identity=1. a=1. b=1. add=1. multiply=1. additive_inverse=1. multiplicative_inverse=1.
% 1.20/1.51
% 1.20/1.51 ============================== end of process initial clauses ========
% 1.20/1.51
% 1.20/1.51 ============================== CLAUSES FOR SEARCH ====================
% 1.20/1.51
% 1.20/1.51 ============================== end of clauses for search =============
% 1.20/1.51
% 1.20/1.51 ============================== SEARCH ================================
% 1.20/1.51
% 1.20/1.51 % Starting search at 0.01 seconds.
% 1.20/1.51
% 1.20/1.51 Low Water (keep): wt=18.000, iters=3564
% 1.20/1.51
% 1.20/1.51 Low Water (keep): wt=14.000, iters=3376
% 1.20/1.51
% 1.20/1.51 Low Water (keep): wt=13.000, iters=3360
% 1.20/1.51
% 1.20/1.51 Low Water (keep): wt=12.000, iters=3353
% 1.20/1.51
% 1.20/1.51 Low Water (keep): wt=11.000, iters=3340
% 1.20/1.51
% 1.20/1.51 Low Water (keep): wt=10.000, iters=3337
% 1.20/1.51
% 1.20/1.51 Low Water (keep): wt=9.000, iters=3342
% 1.20/1.51
% 1.20/1.51 Low Water (keep): wt=8.000, iters=3370
% 1.20/1.51
% 1.20/1.51 NOTE: Back_subsumption disabled, ratio of kept to back_subsumed is 229 (0.00 of 0.26 sec).
% 1.20/1.51
% 1.20/1.51 Low Water (keep): wt=7.000, iters=3333
% 1.20/1.51
% 1.20/1.51 ============================== PROOF =================================
% 1.20/1.51 % SZS status Unsatisfiable
% 1.20/1.51 % SZS output start Refutation
% 1.20/1.51
% 1.20/1.51 % Proof 1 at 0.48 (+ 0.02) seconds.
% 1.20/1.51 % Length of proof is 44.
% 1.20/1.51 % Level of proof is 8.
% 1.20/1.51 % Maximum clause weight is 20.000.
% 1.20/1.51 % Given clauses 882.
% 1.20/1.51
% 1.20/1.51 1 defined(additive_identity) # label(well_definedness_of_additive_identity) # label(axiom). [assumption].
% 1.20/1.51 3 defined(a) # label(a_is_defined) # label(hypothesis). [assumption].
% 1.20/1.51 4 defined(b) # label(b_is_defined) # label(hypothesis). [assumption].
% 1.20/1.51 5 product(multiplicative_identity,a,b) # label(product_4) # label(negated_conjecture). [assumption].
% 1.20/1.51 7 -sum(additive_identity,a,additive_identity) # label(not_sum_3) # label(negated_conjecture). [assumption].
% 1.20/1.51 8 -product(multiplicative_identity,multiplicative_inverse(a),multiplicative_inverse(b)) # label(not_product_5) # label(negated_conjecture). [assumption].
% 1.20/1.51 10 sum(additive_identity,A,A) | -defined(A) # label(existence_of_identity_addition) # label(axiom). [assumption].
% 1.20/1.51 11 product(multiplicative_identity,A,A) | -defined(A) # label(existence_of_identity_multiplication) # label(axiom). [assumption].
% 1.20/1.51 12 sum(additive_inverse(A),A,additive_identity) | -defined(A) # label(existence_of_inverse_addition) # label(axiom). [assumption].
% 1.20/1.51 14 product(A,B,C) | -product(B,A,C) # label(commutativity_multiplication) # label(axiom). [assumption].
% 1.20/1.51 17 defined(multiplicative_inverse(A)) | -defined(A) | sum(additive_identity,A,additive_identity) # label(well_definedness_of_multiplicative_inverse) # label(axiom). [assumption].
% 1.20/1.51 23 product(multiplicative_inverse(A),A,multiplicative_identity) | sum(additive_identity,A,additive_identity) | -defined(A) # label(existence_of_inverse_multiplication) # label(axiom). [assumption].
% 1.20/1.51 27 sum(A,B,C) | -sum(D,E,A) | -sum(E,B,F) | -sum(D,F,C) # label(associativity_addition_2) # label(axiom). [assumption].
% 1.20/1.51 28 product(A,B,C) | -product(A,D,E) | -product(D,F,B) | -product(E,F,C) # label(associativity_multiplication_1) # label(axiom). [assumption].
% 1.20/1.51 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].
% 1.20/1.51 31 product(A,B,C) | -sum(D,E,A) | -product(D,B,F) | -product(E,B,V6) | -sum(F,V6,C) # label(distributivity_2) # label(axiom). [assumption].
% 1.20/1.51 42 sum(A,B,A) | -sum(C,D,A) | -sum(D,B,D). [factor(27,b,d)].
% 1.20/1.51 59 sum(additive_identity,b,b). [resolve(10,b,4,a)].
% 1.20/1.51 60 sum(additive_identity,a,a). [resolve(10,b,3,a)].
% 1.20/1.51 63 product(multiplicative_identity,b,b). [resolve(11,b,4,a)].
% 1.20/1.51 64 product(multiplicative_identity,a,a). [resolve(11,b,3,a)].
% 1.20/1.51 66 product(multiplicative_identity,additive_identity,additive_identity). [resolve(11,b,1,a)].
% 1.20/1.51 67 sum(additive_inverse(b),b,additive_identity). [resolve(12,b,4,a)].
% 1.20/1.51 72 product(a,multiplicative_identity,b). [resolve(14,b,5,a)].
% 1.20/1.51 73 -product(multiplicative_inverse(a),multiplicative_identity,multiplicative_inverse(b)). [ur(14,a,8,a)].
% 1.20/1.51 90 defined(multiplicative_inverse(b)) | sum(additive_identity,b,additive_identity). [resolve(17,b,4,a)].
% 1.20/1.51 91 defined(multiplicative_inverse(a)). [resolve(17,b,3,a),unit_del(b,7)].
% 1.20/1.51 117 product(multiplicative_inverse(b),b,multiplicative_identity) | sum(additive_identity,b,additive_identity). [resolve(23,c,4,a)].
% 1.20/1.51 118 product(multiplicative_inverse(a),a,multiplicative_identity). [resolve(23,c,3,a),unit_del(b,7)].
% 1.20/1.51 122 product(A,b,B) | -product(A,multiplicative_identity,C) | -product(C,a,B). [resolve(28,c,5,a)].
% 1.20/1.51 255 product(multiplicative_identity,multiplicative_inverse(a),multiplicative_inverse(a)). [resolve(91,a,11,b)].
% 1.20/1.51 350 product(b,multiplicative_identity,b). [resolve(63,a,14,b)].
% 1.20/1.51 373 product(a,multiplicative_identity,a). [resolve(64,a,14,b)].
% 1.20/1.51 421 product(additive_identity,multiplicative_identity,additive_identity). [resolve(66,a,14,b)].
% 1.20/1.51 477 -sum(b,a,b). [ur(42,a,7,a,b,67,a)].
% 1.20/1.51 960 -product(additive_identity,multiplicative_identity,b). [ur(30,a,477,a,b,60,a,c,72,a,e,373,a)].
% 1.20/1.51 1288 -sum(additive_identity,b,additive_identity). [ur(31,a,960,a,c,421,a,d,350,a,e,59,a)].
% 1.20/1.51 1292 product(multiplicative_inverse(b),b,multiplicative_identity). [back_unit_del(117),unit_del(b,1288)].
% 1.20/1.51 1293 defined(multiplicative_inverse(b)). [back_unit_del(90),unit_del(b,1288)].
% 1.20/1.51 1320 product(multiplicative_identity,multiplicative_inverse(b),multiplicative_inverse(b)). [resolve(1293,a,11,b)].
% 1.20/1.51 4637 product(b,multiplicative_inverse(b),multiplicative_identity). [resolve(1292,a,14,b)].
% 1.20/1.51 6617 product(multiplicative_inverse(a),multiplicative_identity,multiplicative_inverse(a)). [resolve(255,a,14,b)].
% 1.20/1.51 6874 -product(multiplicative_inverse(a),b,multiplicative_identity). [ur(28,a,73,a,c,4637,a,d,1320,a)].
% 1.20/1.51 6891 $F. [ur(122,a,6874,a,c,118,a),unit_del(a,6617)].
% 1.20/1.51
% 1.20/1.51 % SZS output end Refutation
% 1.20/1.51 ============================== end of proof ==========================
% 1.20/1.51
% 1.20/1.51 ============================== STATISTICS ============================
% 1.20/1.51
% 1.20/1.51 Given=882. Generated=32591. Kept=6890. proofs=1.
% 1.20/1.51 Usable=873. Sos=5968. Demods=0. Limbo=0, Disabled=80. Hints=0.
% 1.20/1.51 Megabytes=3.62.
% 1.20/1.51 User_CPU=0.48, System_CPU=0.02, Wall_clock=1.
% 1.20/1.51
% 1.20/1.51 ============================== end of statistics =====================
% 1.20/1.51
% 1.20/1.51 ============================== end of search =========================
% 1.20/1.51
% 1.20/1.51 THEOREM PROVED
% 1.20/1.51 % SZS status Unsatisfiable
% 1.20/1.51
% 1.20/1.51 Exiting with 1 proof.
% 1.20/1.51
% 1.20/1.51 Process 14489 exit (max_proofs) Tue Jun 7 03:21:23 2022
% 1.20/1.51 Prover9 interrupted
%------------------------------------------------------------------------------