TSTP Solution File: FLD037-1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : FLD037-1 : TPTP v8.1.0. Bugfixed v2.1.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n017.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:18 EDT 2022
% Result : Unsatisfiable 1.09s 1.36s
% Output : Refutation 1.09s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : FLD037-1 : TPTP v8.1.0. Bugfixed v2.1.0.
% 0.07/0.13 % Command : tptp2X_and_run_prover9 %d %s
% 0.13/0.34 % Computer : n017.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 : Mon Jun 6 13:15:01 EDT 2022
% 0.13/0.34 % CPUTime :
% 1.09/1.36 ============================== Prover9 ===============================
% 1.09/1.36 Prover9 (32) version 2009-11A, November 2009.
% 1.09/1.36 Process 4115 was started by sandbox2 on n017.cluster.edu,
% 1.09/1.36 Mon Jun 6 13:15:02 2022
% 1.09/1.36 The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 300 -f /tmp/Prover9_3961_n017.cluster.edu".
% 1.09/1.36 ============================== end of head ===========================
% 1.09/1.36
% 1.09/1.36 ============================== INPUT =================================
% 1.09/1.36
% 1.09/1.36 % Reading from file /tmp/Prover9_3961_n017.cluster.edu
% 1.09/1.36
% 1.09/1.36 set(prolog_style_variables).
% 1.09/1.36 set(auto2).
% 1.09/1.36 % set(auto2) -> set(auto).
% 1.09/1.36 % set(auto) -> set(auto_inference).
% 1.09/1.36 % set(auto) -> set(auto_setup).
% 1.09/1.36 % set(auto_setup) -> set(predicate_elim).
% 1.09/1.36 % set(auto_setup) -> assign(eq_defs, unfold).
% 1.09/1.36 % set(auto) -> set(auto_limits).
% 1.09/1.36 % set(auto_limits) -> assign(max_weight, "100.000").
% 1.09/1.36 % set(auto_limits) -> assign(sos_limit, 20000).
% 1.09/1.36 % set(auto) -> set(auto_denials).
% 1.09/1.36 % set(auto) -> set(auto_process).
% 1.09/1.36 % set(auto2) -> assign(new_constants, 1).
% 1.09/1.36 % set(auto2) -> assign(fold_denial_max, 3).
% 1.09/1.36 % set(auto2) -> assign(max_weight, "200.000").
% 1.09/1.36 % set(auto2) -> assign(max_hours, 1).
% 1.09/1.36 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 1.09/1.36 % set(auto2) -> assign(max_seconds, 0).
% 1.09/1.36 % set(auto2) -> assign(max_minutes, 5).
% 1.09/1.36 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 1.09/1.36 % set(auto2) -> set(sort_initial_sos).
% 1.09/1.36 % set(auto2) -> assign(sos_limit, -1).
% 1.09/1.36 % set(auto2) -> assign(lrs_ticks, 3000).
% 1.09/1.36 % set(auto2) -> assign(max_megs, 400).
% 1.09/1.36 % set(auto2) -> assign(stats, some).
% 1.09/1.36 % set(auto2) -> clear(echo_input).
% 1.09/1.36 % set(auto2) -> set(quiet).
% 1.09/1.36 % set(auto2) -> clear(print_initial_clauses).
% 1.09/1.36 % set(auto2) -> clear(print_given).
% 1.09/1.36 assign(lrs_ticks,-1).
% 1.09/1.36 assign(sos_limit,10000).
% 1.09/1.36 assign(order,kbo).
% 1.09/1.36 set(lex_order_vars).
% 1.09/1.36 clear(print_given).
% 1.09/1.36
% 1.09/1.36 % formulas(sos). % not echoed (32 formulas)
% 1.09/1.36
% 1.09/1.36 ============================== end of input ==========================
% 1.09/1.36
% 1.09/1.36 % From the command line: assign(max_seconds, 300).
% 1.09/1.36
% 1.09/1.36 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 1.09/1.36
% 1.09/1.36 % Formulas that are not ordinary clauses:
% 1.09/1.36
% 1.09/1.36 ============================== end of process non-clausal formulas ===
% 1.09/1.36
% 1.09/1.36 ============================== PROCESS INITIAL CLAUSES ===============
% 1.09/1.36
% 1.09/1.36 ============================== PREDICATE ELIMINATION =================
% 1.09/1.36
% 1.09/1.36 ============================== end predicate elimination =============
% 1.09/1.36
% 1.09/1.36 Auto_denials: (non-Horn, no changes).
% 1.09/1.36
% 1.09/1.36 Term ordering decisions:
% 1.09/1.36 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.09/1.36
% 1.09/1.36 ============================== end of process initial clauses ========
% 1.09/1.36
% 1.09/1.36 ============================== CLAUSES FOR SEARCH ====================
% 1.09/1.36
% 1.09/1.36 ============================== end of clauses for search =============
% 1.09/1.36
% 1.09/1.36 ============================== SEARCH ================================
% 1.09/1.36
% 1.09/1.36 % Starting search at 0.01 seconds.
% 1.09/1.36
% 1.09/1.36 Low Water (keep): wt=27.000, iters=3647
% 1.09/1.36
% 1.09/1.36 Low Water (keep): wt=23.000, iters=3397
% 1.09/1.36
% 1.09/1.36 Low Water (keep): wt=21.000, iters=3355
% 1.09/1.36
% 1.09/1.36 Low Water (keep): wt=19.000, iters=3400
% 1.09/1.36
% 1.09/1.36 Low Water (keep): wt=18.000, iters=3348
% 1.09/1.36
% 1.09/1.36 Low Water (keep): wt=15.000, iters=3359
% 1.09/1.36
% 1.09/1.36 Low Water (keep): wt=14.000, iters=3359
% 1.09/1.36
% 1.09/1.36 Low Water (keep): wt=12.000, iters=3342
% 1.09/1.36
% 1.09/1.36 Low Water (keep): wt=11.000, iters=3351
% 1.09/1.36
% 1.09/1.36 Low Water (keep): wt=9.000, iters=3847
% 1.09/1.36
% 1.09/1.36 ============================== PROOF =================================
% 1.09/1.36 % SZS status Unsatisfiable
% 1.09/1.36 % SZS output start Refutation
% 1.09/1.36
% 1.09/1.36 % Proof 1 at 0.35 (+ 0.02) seconds.
% 1.09/1.36 % Length of proof is 15.
% 1.09/1.36 % Level of proof is 3.
% 1.09/1.36 % Maximum clause weight is 12.000.
% 1.09/1.36 % Given clauses 458.
% 1.09/1.36
% 1.09/1.36 3 defined(a) # label(a_is_defined) # label(hypothesis). [assumption].
% 1.09/1.36 5 equalish(a,b) # label(a_equals_b_4) # label(negated_conjecture). [assumption].
% 1.09/1.36 7 -equalish(a,additive_identity) # label(a_not_equal_to_additive_identity_3) # label(negated_conjecture). [assumption].
% 1.09/1.36 8 -equalish(multiplicative_identity,multiply(b,multiplicative_inverse(a))) # label(multiplicative_identity_not_equal_to_multiply_5) # label(negated_conjecture). [assumption].
% 1.09/1.36 11 equalish(A,B) | -equalish(B,A) # label(symmetry_of_equality) # label(axiom). [assumption].
% 1.09/1.36 17 defined(multiplicative_inverse(A)) | -defined(A) | equalish(A,additive_identity) # label(well_definedness_of_multiplicative_inverse) # label(axiom). [assumption].
% 1.09/1.36 20 equalish(A,B) | -equalish(A,C) | -equalish(C,B) # label(transitivity_of_equality) # label(axiom). [assumption].
% 1.09/1.36 24 equalish(multiply(A,multiplicative_inverse(A)),multiplicative_identity) | -defined(A) | equalish(A,additive_identity) # label(existence_of_inverse_multiplication) # label(axiom). [assumption].
% 1.09/1.36 29 equalish(multiply(A,B),multiply(C,B)) | -defined(B) | -equalish(A,C) # label(compatibility_of_equality_and_multiplication) # label(axiom). [assumption].
% 1.09/1.36 60 equalish(b,a). [resolve(11,b,5,a)].
% 1.09/1.36 61 -equalish(multiply(b,multiplicative_inverse(a)),multiplicative_identity). [ur(11,a,8,a)].
% 1.09/1.36 93 defined(multiplicative_inverse(a)). [resolve(17,b,3,a),unit_del(b,7)].
% 1.09/1.36 116 equalish(multiply(a,multiplicative_inverse(a)),multiplicative_identity). [resolve(24,b,3,a),unit_del(b,7)].
% 1.09/1.36 8405 -equalish(multiply(b,multiplicative_inverse(a)),multiply(a,multiplicative_inverse(a))). [ur(20,a,61,a,c,116,a)].
% 1.09/1.36 8853 $F. [ur(29,a,8405,a,c,60,a),unit_del(a,93)].
% 1.09/1.36
% 1.09/1.36 % SZS output end Refutation
% 1.09/1.36 ============================== end of proof ==========================
% 1.09/1.36
% 1.09/1.36 ============================== STATISTICS ============================
% 1.09/1.36
% 1.09/1.36 Given=458. Generated=15982. Kept=8852. proofs=1.
% 1.09/1.36 Usable=458. Sos=8390. Demods=0. Limbo=0, Disabled=36. Hints=0.
% 1.09/1.36 Megabytes=5.75.
% 1.09/1.36 User_CPU=0.35, System_CPU=0.02, Wall_clock=0.
% 1.09/1.36
% 1.09/1.36 ============================== end of statistics =====================
% 1.09/1.36
% 1.09/1.36 ============================== end of search =========================
% 1.09/1.36
% 1.09/1.36 THEOREM PROVED
% 1.09/1.36 % SZS status Unsatisfiable
% 1.09/1.36
% 1.09/1.36 Exiting with 1 proof.
% 1.09/1.36
% 1.09/1.36 Process 4115 exit (max_proofs) Mon Jun 6 13:15:02 2022
% 1.09/1.36 Prover9 interrupted
%------------------------------------------------------------------------------