TSTP Solution File: FLD071-2 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : FLD071-2 : TPTP v8.1.0. Bugfixed v2.1.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n021.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:32 EDT 2022
% Result : Unsatisfiable 1.15s 1.42s
% Output : Refutation 1.15s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : FLD071-2 : TPTP v8.1.0. Bugfixed v2.1.0.
% 0.11/0.13 % Command : tptp2X_and_run_prover9 %d %s
% 0.12/0.34 % Computer : n021.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 600
% 0.12/0.34 % DateTime : Tue Jun 7 02:43:21 EDT 2022
% 0.12/0.34 % CPUTime :
% 1.15/1.42 ============================== Prover9 ===============================
% 1.15/1.42 Prover9 (32) version 2009-11A, November 2009.
% 1.15/1.42 Process 28798 was started by sandbox on n021.cluster.edu,
% 1.15/1.42 Tue Jun 7 02:43:21 2022
% 1.15/1.42 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_28645_n021.cluster.edu".
% 1.15/1.42 ============================== end of head ===========================
% 1.15/1.42
% 1.15/1.42 ============================== INPUT =================================
% 1.15/1.42
% 1.15/1.42 % Reading from file /tmp/Prover9_28645_n021.cluster.edu
% 1.15/1.42
% 1.15/1.42 set(prolog_style_variables).
% 1.15/1.42 set(auto2).
% 1.15/1.42 % set(auto2) -> set(auto).
% 1.15/1.42 % set(auto) -> set(auto_inference).
% 1.15/1.42 % set(auto) -> set(auto_setup).
% 1.15/1.42 % set(auto_setup) -> set(predicate_elim).
% 1.15/1.42 % set(auto_setup) -> assign(eq_defs, unfold).
% 1.15/1.42 % set(auto) -> set(auto_limits).
% 1.15/1.42 % set(auto_limits) -> assign(max_weight, "100.000").
% 1.15/1.42 % set(auto_limits) -> assign(sos_limit, 20000).
% 1.15/1.42 % set(auto) -> set(auto_denials).
% 1.15/1.42 % set(auto) -> set(auto_process).
% 1.15/1.42 % set(auto2) -> assign(new_constants, 1).
% 1.15/1.42 % set(auto2) -> assign(fold_denial_max, 3).
% 1.15/1.42 % set(auto2) -> assign(max_weight, "200.000").
% 1.15/1.42 % set(auto2) -> assign(max_hours, 1).
% 1.15/1.42 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 1.15/1.42 % set(auto2) -> assign(max_seconds, 0).
% 1.15/1.42 % set(auto2) -> assign(max_minutes, 5).
% 1.15/1.42 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 1.15/1.42 % set(auto2) -> set(sort_initial_sos).
% 1.15/1.42 % set(auto2) -> assign(sos_limit, -1).
% 1.15/1.42 % set(auto2) -> assign(lrs_ticks, 3000).
% 1.15/1.42 % set(auto2) -> assign(max_megs, 400).
% 1.15/1.42 % set(auto2) -> assign(stats, some).
% 1.15/1.42 % set(auto2) -> clear(echo_input).
% 1.15/1.42 % set(auto2) -> set(quiet).
% 1.15/1.42 % set(auto2) -> clear(print_initial_clauses).
% 1.15/1.42 % set(auto2) -> clear(print_given).
% 1.15/1.42 assign(lrs_ticks,-1).
% 1.15/1.42 assign(sos_limit,10000).
% 1.15/1.42 assign(order,kbo).
% 1.15/1.42 set(lex_order_vars).
% 1.15/1.42 clear(print_given).
% 1.15/1.42
% 1.15/1.42 % formulas(sos). % not echoed (34 formulas)
% 1.15/1.42
% 1.15/1.42 ============================== end of input ==========================
% 1.15/1.42
% 1.15/1.42 % From the command line: assign(max_seconds, 300).
% 1.15/1.42
% 1.15/1.42 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 1.15/1.42
% 1.15/1.42 % Formulas that are not ordinary clauses:
% 1.15/1.42
% 1.15/1.42 ============================== end of process non-clausal formulas ===
% 1.15/1.42
% 1.15/1.42 ============================== PROCESS INITIAL CLAUSES ===============
% 1.15/1.42
% 1.15/1.42 ============================== PREDICATE ELIMINATION =================
% 1.15/1.42
% 1.15/1.42 ============================== end predicate elimination =============
% 1.15/1.42
% 1.15/1.42 Auto_denials: (non-Horn, no changes).
% 1.15/1.42
% 1.15/1.42 Term ordering decisions:
% 1.15/1.42 Function symbol KB weights: additive_identity=1. a=1. b=1. multiplicative_identity=1. u=1. multiply=1. add=1. additive_inverse=1. multiplicative_inverse=1.
% 1.15/1.42
% 1.15/1.42 ============================== end of process initial clauses ========
% 1.15/1.42
% 1.15/1.42 ============================== CLAUSES FOR SEARCH ====================
% 1.15/1.42
% 1.15/1.42 ============================== end of clauses for search =============
% 1.15/1.42
% 1.15/1.42 ============================== SEARCH ================================
% 1.15/1.42
% 1.15/1.42 % Starting search at 0.02 seconds.
% 1.15/1.42
% 1.15/1.42 Low Water (keep): wt=34.000, iters=3656
% 1.15/1.42
% 1.15/1.42 Low Water (keep): wt=29.000, iters=3636
% 1.15/1.42
% 1.15/1.42 Low Water (keep): wt=24.000, iters=3443
% 1.15/1.42
% 1.15/1.42 Low Water (keep): wt=23.000, iters=3436
% 1.15/1.42
% 1.15/1.42 Low Water (keep): wt=21.000, iters=3406
% 1.15/1.42
% 1.15/1.42 Low Water (keep): wt=19.000, iters=3333
% 1.15/1.42
% 1.15/1.42 Low Water (keep): wt=17.000, iters=3448
% 1.15/1.42
% 1.15/1.42 Low Water (keep): wt=15.000, iters=3350
% 1.15/1.42
% 1.15/1.42 Low Water (keep): wt=14.000, iters=3451
% 1.15/1.42
% 1.15/1.42 Low Water (keep): wt=12.000, iters=3361
% 1.15/1.42
% 1.15/1.42 Low Water (keep): wt=11.000, iters=3422
% 1.15/1.42
% 1.15/1.42 Low Water (keep): wt=10.000, iters=3456
% 1.15/1.42
% 1.15/1.42 Low Water (keep): wt=9.000, iters=3360
% 1.15/1.42
% 1.15/1.42 Low Water (keep): wt=7.000, iters=3339
% 1.15/1.42
% 1.15/1.42 NOTE: Back_subsumption disabled, ratio of kept to back_subsumed is 2147483647 (0.00 of 0.32 sec).
% 1.15/1.42
% 1.15/1.42 ============================== PROOF =================================
% 1.15/1.42 % SZS status Unsatisfiable
% 1.15/1.42 % SZS output start Refutation
% 1.15/1.42
% 1.15/1.42 % Proof 1 at 0.43 (+ 0.02) seconds.
% 1.15/1.42 % Length of proof is 24.
% 1.15/1.42 % Level of proof is 5.
% 1.15/1.42 % Maximum clause weight is 11.000.
% 1.15/1.42 % Given clauses 726.
% 1.15/1.42
% 1.15/1.42 3 defined(a) # label(a_is_defined) # label(hypothesis). [assumption].
% 1.15/1.42 4 defined(b) # label(b_is_defined) # label(hypothesis). [assumption].
% 1.15/1.42 5 defined(u) # label(u_is_defined) # label(hypothesis). [assumption].
% 1.15/1.42 6 less_or_equal(additive_identity,a) # label(less_or_equal_4) # label(negated_conjecture). [assumption].
% 1.15/1.42 7 less_or_equal(additive_identity,b) # label(less_or_equal_5) # label(negated_conjecture). [assumption].
% 1.15/1.42 8 equalish(multiply(a,b),u) # label(multiply_equals_u_6) # label(negated_conjecture). [assumption].
% 1.15/1.42 10 -less_or_equal(additive_identity,u) # label(not_less_or_equal_7) # label(negated_conjecture). [assumption].
% 1.15/1.42 13 equalish(A,B) | -equalish(B,A) # label(symmetry_of_equality) # label(axiom). [assumption].
% 1.15/1.42 21 less_or_equal(A,B) | -less_or_equal(A,C) | -less_or_equal(C,B) # label(transitivity_of_order_relation) # label(axiom). [assumption].
% 1.15/1.42 22 equalish(A,B) | -equalish(A,C) | -equalish(C,B) # label(transitivity_of_equality) # label(axiom). [assumption].
% 1.15/1.42 23 less_or_equal(A,B) | -less_or_equal(C,B) | -equalish(C,A) # label(compatibility_of_equality_and_order_relation) # label(axiom). [assumption].
% 1.15/1.42 24 less_or_equal(A,B) | less_or_equal(B,A) | -defined(A) | -defined(B) # label(totality_of_order_relation) # label(axiom). [assumption].
% 1.15/1.42 27 equalish(multiply(A,B),multiply(B,A)) | -defined(A) | -defined(B) # label(commutativity_multiplication) # label(axiom). [assumption].
% 1.15/1.42 28 less_or_equal(additive_identity,multiply(A,B)) | -less_or_equal(additive_identity,A) | -less_or_equal(additive_identity,B) # label(compatibility_of_order_relation_and_multiplication) # label(axiom). [assumption].
% 1.15/1.42 64 equalish(u,multiply(a,b)). [resolve(13,b,8,a)].
% 1.15/1.42 119 less_or_equal(u,A) | less_or_equal(A,u) | -defined(A). [resolve(24,c,5,a)].
% 1.15/1.42 124 less_or_equal(u,u). [factor(119,a,b),unit_del(b,5)].
% 1.15/1.42 149 equalish(multiply(A,b),multiply(b,A)) | -defined(A). [resolve(27,c,4,a)].
% 1.15/1.42 153 less_or_equal(additive_identity,multiply(b,A)) | -less_or_equal(additive_identity,A). [resolve(28,b,7,a)].
% 1.15/1.42 8859 equalish(multiply(a,b),multiply(b,a)). [resolve(149,b,3,a)].
% 1.15/1.42 9371 less_or_equal(additive_identity,multiply(b,a)). [resolve(153,b,6,a)].
% 1.15/1.42 9559 -less_or_equal(multiply(b,a),u). [ur(21,a,10,a,b,9371,a)].
% 1.15/1.42 9562 -equalish(u,multiply(b,a)). [ur(23,a,9559,a,b,124,a)].
% 1.15/1.42 9574 $F. [ur(22,a,9562,a,b,64,a),unit_del(a,8859)].
% 1.15/1.42
% 1.15/1.42 % SZS output end Refutation
% 1.15/1.42 ============================== end of proof ==========================
% 1.15/1.42
% 1.15/1.42 ============================== STATISTICS ============================
% 1.15/1.42
% 1.15/1.42 Given=726. Generated=29539. Kept=9573. proofs=1.
% 1.15/1.42 Usable=726. Sos=8840. Demods=0. Limbo=2, Disabled=39. Hints=0.
% 1.15/1.42 Megabytes=5.86.
% 1.15/1.42 User_CPU=0.43, System_CPU=0.02, Wall_clock=1.
% 1.15/1.42
% 1.15/1.42 ============================== end of statistics =====================
% 1.15/1.42
% 1.15/1.42 ============================== end of search =========================
% 1.15/1.42
% 1.15/1.42 THEOREM PROVED
% 1.15/1.42 % SZS status Unsatisfiable
% 1.15/1.42
% 1.15/1.42 Exiting with 1 proof.
% 1.15/1.42
% 1.15/1.42 Process 28798 exit (max_proofs) Tue Jun 7 02:43:22 2022
% 1.15/1.42 Prover9 interrupted
%------------------------------------------------------------------------------