TSTP Solution File: FLD032-1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : FLD032-1 : 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:16 EDT 2022
% Result : Unsatisfiable 13.04s 13.31s
% Output : Refutation 13.04s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : FLD032-1 : TPTP v8.1.0. Bugfixed v2.1.0.
% 0.11/0.13 % Command : tptp2X_and_run_prover9 %d %s
% 0.13/0.34 % Computer : n027.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:30:40 EDT 2022
% 0.13/0.34 % CPUTime :
% 13.04/13.31 ============================== Prover9 ===============================
% 13.04/13.31 Prover9 (32) version 2009-11A, November 2009.
% 13.04/13.31 Process 9057 was started by sandbox on n027.cluster.edu,
% 13.04/13.31 Tue Jun 7 03:30:40 2022
% 13.04/13.31 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_8890_n027.cluster.edu".
% 13.04/13.31 ============================== end of head ===========================
% 13.04/13.31
% 13.04/13.31 ============================== INPUT =================================
% 13.04/13.31
% 13.04/13.31 % Reading from file /tmp/Prover9_8890_n027.cluster.edu
% 13.04/13.31
% 13.04/13.31 set(prolog_style_variables).
% 13.04/13.31 set(auto2).
% 13.04/13.31 % set(auto2) -> set(auto).
% 13.04/13.31 % set(auto) -> set(auto_inference).
% 13.04/13.31 % set(auto) -> set(auto_setup).
% 13.04/13.31 % set(auto_setup) -> set(predicate_elim).
% 13.04/13.31 % set(auto_setup) -> assign(eq_defs, unfold).
% 13.04/13.31 % set(auto) -> set(auto_limits).
% 13.04/13.31 % set(auto_limits) -> assign(max_weight, "100.000").
% 13.04/13.31 % set(auto_limits) -> assign(sos_limit, 20000).
% 13.04/13.31 % set(auto) -> set(auto_denials).
% 13.04/13.31 % set(auto) -> set(auto_process).
% 13.04/13.31 % set(auto2) -> assign(new_constants, 1).
% 13.04/13.31 % set(auto2) -> assign(fold_denial_max, 3).
% 13.04/13.31 % set(auto2) -> assign(max_weight, "200.000").
% 13.04/13.31 % set(auto2) -> assign(max_hours, 1).
% 13.04/13.31 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 13.04/13.31 % set(auto2) -> assign(max_seconds, 0).
% 13.04/13.31 % set(auto2) -> assign(max_minutes, 5).
% 13.04/13.31 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 13.04/13.31 % set(auto2) -> set(sort_initial_sos).
% 13.04/13.31 % set(auto2) -> assign(sos_limit, -1).
% 13.04/13.31 % set(auto2) -> assign(lrs_ticks, 3000).
% 13.04/13.31 % set(auto2) -> assign(max_megs, 400).
% 13.04/13.31 % set(auto2) -> assign(stats, some).
% 13.04/13.31 % set(auto2) -> clear(echo_input).
% 13.04/13.31 % set(auto2) -> set(quiet).
% 13.04/13.31 % set(auto2) -> clear(print_initial_clauses).
% 13.04/13.31 % set(auto2) -> clear(print_given).
% 13.04/13.31 assign(lrs_ticks,-1).
% 13.04/13.31 assign(sos_limit,10000).
% 13.04/13.31 assign(order,kbo).
% 13.04/13.31 set(lex_order_vars).
% 13.04/13.31 clear(print_given).
% 13.04/13.31
% 13.04/13.31 % formulas(sos). % not echoed (31 formulas)
% 13.04/13.31
% 13.04/13.31 ============================== end of input ==========================
% 13.04/13.31
% 13.04/13.31 % From the command line: assign(max_seconds, 300).
% 13.04/13.31
% 13.04/13.31 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 13.04/13.31
% 13.04/13.31 % Formulas that are not ordinary clauses:
% 13.04/13.31
% 13.04/13.31 ============================== end of process non-clausal formulas ===
% 13.04/13.31
% 13.04/13.31 ============================== PROCESS INITIAL CLAUSES ===============
% 13.04/13.31
% 13.04/13.31 ============================== PREDICATE ELIMINATION =================
% 13.04/13.31
% 13.04/13.31 ============================== end predicate elimination =============
% 13.04/13.31
% 13.04/13.31 Auto_denials: (non-Horn, no changes).
% 13.04/13.31
% 13.04/13.31 Term ordering decisions:
% 13.04/13.31 Function symbol KB weights: additive_identity=1. multiplicative_identity=1. a=1. add=1. multiply=1. multiplicative_inverse=1. additive_inverse=1.
% 13.04/13.31
% 13.04/13.31 ============================== end of process initial clauses ========
% 13.04/13.31
% 13.04/13.31 ============================== CLAUSES FOR SEARCH ====================
% 13.04/13.31
% 13.04/13.31 ============================== end of clauses for search =============
% 13.04/13.31
% 13.04/13.31 ============================== SEARCH ================================
% 13.04/13.31
% 13.04/13.31 % Starting search at 0.01 seconds.
% 13.04/13.31
% 13.04/13.31 Low Water (keep): wt=34.000, iters=3826
% 13.04/13.31
% 13.04/13.31 Low Water (keep): wt=29.000, iters=3748
% 13.04/13.31
% 13.04/13.31 Low Water (keep): wt=24.000, iters=3408
% 13.04/13.31
% 13.04/13.31 Low Water (keep): wt=23.000, iters=3382
% 13.04/13.31
% 13.04/13.31 Low Water (keep): wt=21.000, iters=3372
% 13.04/13.31
% 13.04/13.31 Low Water (keep): wt=19.000, iters=3359
% 13.04/13.31
% 13.04/13.31 Low Water (keep): wt=18.000, iters=3429
% 13.04/13.31
% 13.04/13.31 Low Water (keep): wt=15.000, iters=3345
% 13.04/13.31
% 13.04/13.31 Low Water (keep): wt=13.000, iters=4252
% 13.04/13.31
% 13.04/13.31 Low Water (keep): wt=12.000, iters=3594
% 13.04/13.31
% 13.04/13.31 Low Water (keep): wt=11.000, iters=3337
% 13.04/13.31
% 13.04/13.31 NOTE: Back_subsumption disabled, ratio of kept to back_subsumed is 972 (0.00 of 0.44 sec).
% 13.04/13.31
% 13.04/13.31 Low Water (displace): id=5604, wt=34.000
% 13.04/13.31
% 13.04/13.31 Low Water (displace): id=5678, wt=30.000
% 13.04/13.31
% 13.04/13.31 Low Water (displace): id=10658, wt=10.000
% 13.04/13.31
% 13.04/13.31 Low Water (displace): id=10783, wt=8.000
% 13.04/13.31
% 13.04/13.31 Low Water (displace): id=15255, wt=7.000
% 13.04/13.31
% 13.04/13.31 Low Water (keep): wt=10.000, iters=3414
% 13.04/13.31
% 13.04/13.31 Low Water (keep): wt=9.000, iters=5371
% 13.04/13.31
% 13.04/13.31 Low Water (keep): wt=8.000, iters=4334
% 13.04/13.31
% 13.04/13.31 ============================== PROOF =================================
% 13.04/13.31 % SZS status Unsatisfiable
% 13.04/13.31 % SZS output start Refutation
% 13.04/13.31
% 13.04/13.31 % Proof 1 at 11.07 (+ 1.25) seconds.
% 13.04/13.31 % Length of proof is 22.
% 13.04/13.31 % Level of proof is 5.
% 13.04/13.31 % Maximum clause weight is 12.000.
% 13.04/13.31 % Given clauses 5322.
% 13.04/13.31
% 13.04/13.31 3 defined(a) # label(a_is_defined) # label(hypothesis). [assumption].
% 13.04/13.31 4 equalish(multiplicative_inverse(a),multiplicative_identity) # label(multiplicative_inverses_equal) # label(negated_conjecture). [assumption].
% 13.04/13.31 6 -equalish(a,additive_identity) # label(a_not_equal_to_additive_identity_2) # label(negated_conjecture). [assumption].
% 13.04/13.31 7 -equalish(a,multiplicative_identity) # label(a_not_equal_to_multiplicative_identity_4) # label(negated_conjecture). [assumption].
% 13.04/13.31 10 equalish(A,B) | -equalish(B,A) # label(symmetry_of_equality) # label(axiom). [assumption].
% 13.04/13.31 12 equalish(multiply(multiplicative_identity,A),A) | -defined(A) # label(existence_of_identity_multiplication) # label(axiom). [assumption].
% 13.04/13.31 16 defined(multiplicative_inverse(A)) | -defined(A) | equalish(A,additive_identity) # label(well_definedness_of_multiplicative_inverse) # label(axiom). [assumption].
% 13.04/13.31 19 equalish(A,B) | -equalish(A,C) | -equalish(C,B) # label(transitivity_of_equality) # label(axiom). [assumption].
% 13.04/13.31 23 equalish(multiply(A,multiplicative_inverse(A)),multiplicative_identity) | -defined(A) | equalish(A,additive_identity) # label(existence_of_inverse_multiplication) # label(axiom). [assumption].
% 13.04/13.31 24 equalish(multiply(A,B),multiply(B,A)) | -defined(A) | -defined(B) # label(commutativity_multiplication) # label(axiom). [assumption].
% 13.04/13.31 28 equalish(multiply(A,B),multiply(C,B)) | -defined(B) | -equalish(A,C) # label(compatibility_of_equality_and_multiplication) # label(axiom). [assumption].
% 13.04/13.31 64 equalish(multiply(multiplicative_identity,a),a). [resolve(12,b,3,a)].
% 13.04/13.31 82 defined(multiplicative_inverse(a)). [resolve(16,b,3,a),unit_del(b,6)].
% 13.04/13.31 100 equalish(multiply(a,multiplicative_inverse(a)),multiplicative_identity). [resolve(23,b,3,a),unit_del(b,6)].
% 13.04/13.31 102 equalish(multiply(a,A),multiply(A,a)) | -defined(A). [resolve(24,b,3,a)].
% 13.04/13.31 109 equalish(multiply(multiplicative_inverse(a),A),multiply(multiplicative_identity,A)) | -defined(A). [resolve(28,c,4,a)].
% 13.04/13.31 6765 -equalish(a,multiply(a,multiplicative_inverse(a))). [ur(19,a,7,a,c,100,a)].
% 13.04/13.31 6767 -equalish(multiply(a,multiplicative_inverse(a)),a). [ur(10,a,6765,a)].
% 13.04/13.31 6770 -equalish(multiply(a,multiplicative_inverse(a)),multiply(multiplicative_identity,a)). [ur(19,a,6767,a,c,64,a)].
% 13.04/13.31 6984 equalish(multiply(a,multiplicative_inverse(a)),multiply(multiplicative_inverse(a),a)). [resolve(102,b,82,a)].
% 13.04/13.31 7474 equalish(multiply(multiplicative_inverse(a),a),multiply(multiplicative_identity,a)). [resolve(109,b,3,a)].
% 13.04/13.31 31443 $F. [ur(19,a,6770,a,c,7474,a),unit_del(a,6984)].
% 13.04/13.31
% 13.04/13.31 % SZS output end Refutation
% 13.04/13.31 ============================== end of proof ==========================
% 13.04/13.31
% 13.04/13.31 ============================== STATISTICS ============================
% 13.04/13.31
% 13.04/13.31 Given=5322. Generated=2500011. Kept=31442. proofs=1.
% 13.04/13.31 Usable=5322. Sos=9871. Demods=0. Limbo=35, Disabled=16245. Hints=0.
% 13.04/13.31 Megabytes=14.95.
% 13.04/13.31 User_CPU=11.07, System_CPU=1.25, Wall_clock=13.
% 13.04/13.31
% 13.04/13.31 ============================== end of statistics =====================
% 13.04/13.31
% 13.04/13.31 ============================== end of search =========================
% 13.04/13.31
% 13.04/13.31 THEOREM PROVED
% 13.04/13.31 % SZS status Unsatisfiable
% 13.04/13.31
% 13.04/13.31 Exiting with 1 proof.
% 13.04/13.31
% 13.04/13.31 Process 9057 exit (max_proofs) Tue Jun 7 03:30:53 2022
% 13.04/13.31 Prover9 interrupted
%------------------------------------------------------------------------------