TSTP Solution File: FLD059-2 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : FLD059-2 : 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:27 EDT 2022
% Result : Unsatisfiable 1.06s 1.35s
% Output : Refutation 1.06s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.09/0.11 % Problem : FLD059-2 : TPTP v8.1.0. Bugfixed v2.1.0.
% 0.09/0.12 % Command : tptp2X_and_run_prover9 %d %s
% 0.13/0.33 % Computer : n022.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % WCLimit : 600
% 0.13/0.33 % DateTime : Mon Jun 6 12:26:05 EDT 2022
% 0.13/0.33 % CPUTime :
% 1.06/1.35 ============================== Prover9 ===============================
% 1.06/1.35 Prover9 (32) version 2009-11A, November 2009.
% 1.06/1.35 Process 12872 was started by sandbox2 on n022.cluster.edu,
% 1.06/1.35 Mon Jun 6 12:26:06 2022
% 1.06/1.35 The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 300 -f /tmp/Prover9_12718_n022.cluster.edu".
% 1.06/1.35 ============================== end of head ===========================
% 1.06/1.35
% 1.06/1.35 ============================== INPUT =================================
% 1.06/1.35
% 1.06/1.35 % Reading from file /tmp/Prover9_12718_n022.cluster.edu
% 1.06/1.35
% 1.06/1.35 set(prolog_style_variables).
% 1.06/1.35 set(auto2).
% 1.06/1.35 % set(auto2) -> set(auto).
% 1.06/1.35 % set(auto) -> set(auto_inference).
% 1.06/1.35 % set(auto) -> set(auto_setup).
% 1.06/1.35 % set(auto_setup) -> set(predicate_elim).
% 1.06/1.35 % set(auto_setup) -> assign(eq_defs, unfold).
% 1.06/1.35 % set(auto) -> set(auto_limits).
% 1.06/1.35 % set(auto_limits) -> assign(max_weight, "100.000").
% 1.06/1.35 % set(auto_limits) -> assign(sos_limit, 20000).
% 1.06/1.35 % set(auto) -> set(auto_denials).
% 1.06/1.35 % set(auto) -> set(auto_process).
% 1.06/1.35 % set(auto2) -> assign(new_constants, 1).
% 1.06/1.35 % set(auto2) -> assign(fold_denial_max, 3).
% 1.06/1.35 % set(auto2) -> assign(max_weight, "200.000").
% 1.06/1.35 % set(auto2) -> assign(max_hours, 1).
% 1.06/1.35 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 1.06/1.35 % set(auto2) -> assign(max_seconds, 0).
% 1.06/1.35 % set(auto2) -> assign(max_minutes, 5).
% 1.06/1.35 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 1.06/1.35 % set(auto2) -> set(sort_initial_sos).
% 1.06/1.35 % set(auto2) -> assign(sos_limit, -1).
% 1.06/1.35 % set(auto2) -> assign(lrs_ticks, 3000).
% 1.06/1.35 % set(auto2) -> assign(max_megs, 400).
% 1.06/1.35 % set(auto2) -> assign(stats, some).
% 1.06/1.35 % set(auto2) -> clear(echo_input).
% 1.06/1.35 % set(auto2) -> set(quiet).
% 1.06/1.35 % set(auto2) -> clear(print_initial_clauses).
% 1.06/1.35 % set(auto2) -> clear(print_given).
% 1.06/1.35 assign(lrs_ticks,-1).
% 1.06/1.35 assign(sos_limit,10000).
% 1.06/1.35 assign(order,kbo).
% 1.06/1.35 set(lex_order_vars).
% 1.06/1.35 clear(print_given).
% 1.06/1.35
% 1.06/1.35 % formulas(sos). % not echoed (32 formulas)
% 1.06/1.35
% 1.06/1.35 ============================== end of input ==========================
% 1.06/1.35
% 1.06/1.35 % From the command line: assign(max_seconds, 300).
% 1.06/1.35
% 1.06/1.35 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 1.06/1.35
% 1.06/1.35 % Formulas that are not ordinary clauses:
% 1.06/1.35
% 1.06/1.35 ============================== end of process non-clausal formulas ===
% 1.06/1.35
% 1.06/1.35 ============================== PROCESS INITIAL CLAUSES ===============
% 1.06/1.35
% 1.06/1.35 ============================== PREDICATE ELIMINATION =================
% 1.06/1.35
% 1.06/1.35 ============================== end predicate elimination =============
% 1.06/1.35
% 1.06/1.35 Auto_denials: (non-Horn, no changes).
% 1.06/1.35
% 1.06/1.35 Term ordering decisions:
% 1.06/1.35 Function symbol KB weights: additive_identity=1. a=1. multiplicative_identity=1. u=1. add=1. multiply=1. additive_inverse=1. multiplicative_inverse=1.
% 1.06/1.35
% 1.06/1.35 ============================== end of process initial clauses ========
% 1.06/1.35
% 1.06/1.35 ============================== CLAUSES FOR SEARCH ====================
% 1.06/1.35
% 1.06/1.35 ============================== end of clauses for search =============
% 1.06/1.35
% 1.06/1.35 ============================== SEARCH ================================
% 1.06/1.35
% 1.06/1.35 % Starting search at 0.01 seconds.
% 1.06/1.35
% 1.06/1.35 Low Water (keep): wt=27.000, iters=3598
% 1.06/1.35
% 1.06/1.35 Low Water (keep): wt=23.000, iters=3352
% 1.06/1.35
% 1.06/1.35 Low Water (keep): wt=21.000, iters=3420
% 1.06/1.35
% 1.06/1.35 Low Water (keep): wt=19.000, iters=3345
% 1.06/1.35
% 1.06/1.35 Low Water (keep): wt=18.000, iters=3396
% 1.06/1.35
% 1.06/1.35 Low Water (keep): wt=15.000, iters=3409
% 1.06/1.35
% 1.06/1.35 Low Water (keep): wt=14.000, iters=3337
% 1.06/1.35
% 1.06/1.35 Low Water (keep): wt=12.000, iters=3341
% 1.06/1.35
% 1.06/1.35 Low Water (keep): wt=11.000, iters=3416
% 1.06/1.35
% 1.06/1.35 Low Water (keep): wt=10.000, iters=3358
% 1.06/1.35
% 1.06/1.35 Low Water (keep): wt=9.000, iters=3341
% 1.06/1.35
% 1.06/1.35 NOTE: Back_subsumption disabled, ratio of kept to back_subsumed is 7175 (0.00 of 0.31 sec).
% 1.06/1.35
% 1.06/1.35 Low Water (keep): wt=7.000, iters=3349
% 1.06/1.35
% 1.06/1.35 ============================== PROOF =================================
% 1.06/1.35 % SZS status Unsatisfiable
% 1.06/1.35 % SZS output start Refutation
% 1.06/1.35
% 1.06/1.35 % Proof 1 at 0.37 (+ 0.02) seconds.
% 1.06/1.35 % Length of proof is 22.
% 1.06/1.35 % Level of proof is 5.
% 1.06/1.35 % Maximum clause weight is 12.000.
% 1.06/1.35 % Given clauses 614.
% 1.06/1.35
% 1.06/1.35 3 defined(a) # label(a_is_defined) # label(hypothesis). [assumption].
% 1.06/1.35 4 defined(u) # label(u_is_defined) # label(hypothesis). [assumption].
% 1.06/1.35 5 less_or_equal(additive_identity,a) # label(less_or_equal_3) # label(negated_conjecture). [assumption].
% 1.06/1.35 6 equalish(add(a,a),u) # label(add_equals_u_4) # label(negated_conjecture). [assumption].
% 1.06/1.35 8 -less_or_equal(additive_identity,u) # label(not_less_or_equal_5) # label(negated_conjecture). [assumption].
% 1.06/1.35 11 equalish(A,B) | -equalish(B,A) # label(symmetry_of_equality) # label(axiom). [assumption].
% 1.06/1.35 12 equalish(add(additive_identity,A),A) | -defined(A) # label(existence_of_identity_addition) # label(axiom). [assumption].
% 1.06/1.35 19 less_or_equal(A,B) | -less_or_equal(A,C) | -less_or_equal(C,B) # label(transitivity_of_order_relation) # label(axiom). [assumption].
% 1.06/1.35 21 less_or_equal(A,B) | -less_or_equal(C,B) | -equalish(C,A) # label(compatibility_of_equality_and_order_relation) # label(axiom). [assumption].
% 1.06/1.35 22 less_or_equal(A,B) | less_or_equal(B,A) | -defined(A) | -defined(B) # label(totality_of_order_relation) # label(axiom). [assumption].
% 1.06/1.35 27 less_or_equal(add(A,B),add(C,B)) | -defined(B) | -less_or_equal(A,C) # label(compatibility_of_order_relation_and_addition) # label(axiom). [assumption].
% 1.06/1.35 60 equalish(u,add(a,a)). [resolve(11,b,6,a)].
% 1.06/1.35 63 equalish(add(additive_identity,a),a). [resolve(12,b,3,a)].
% 1.06/1.35 97 -less_or_equal(a,u). [ur(19,a,8,a,b,5,a)].
% 1.06/1.35 101 less_or_equal(u,A) | less_or_equal(A,u) | -defined(A). [resolve(22,c,4,a)].
% 1.06/1.35 105 less_or_equal(u,u). [factor(101,a,b),unit_del(b,4)].
% 1.06/1.35 130 less_or_equal(add(additive_identity,A),add(a,A)) | -defined(A). [resolve(27,c,5,a)].
% 1.06/1.35 534 less_or_equal(A,u) | -equalish(u,A). [resolve(105,a,21,b)].
% 1.06/1.35 819 -less_or_equal(add(additive_identity,a),u). [ur(21,a,97,a,c,63,a)].
% 1.06/1.35 8104 less_or_equal(add(additive_identity,a),add(a,a)). [resolve(130,b,3,a)].
% 1.06/1.35 8689 less_or_equal(add(a,a),u). [resolve(534,b,60,a)].
% 1.06/1.35 8731 $F. [ur(19,a,819,a,c,8689,a),unit_del(a,8104)].
% 1.06/1.35
% 1.06/1.35 % SZS output end Refutation
% 1.06/1.35 ============================== end of proof ==========================
% 1.06/1.35
% 1.06/1.35 ============================== STATISTICS ============================
% 1.06/1.35
% 1.06/1.35 Given=614. Generated=25525. Kept=8730. proofs=1.
% 1.06/1.35 Usable=614. Sos=8091. Demods=0. Limbo=11, Disabled=46. Hints=0.
% 1.06/1.35 Megabytes=5.51.
% 1.06/1.35 User_CPU=0.37, System_CPU=0.02, Wall_clock=0.
% 1.06/1.35
% 1.06/1.35 ============================== end of statistics =====================
% 1.06/1.35
% 1.06/1.35 ============================== end of search =========================
% 1.06/1.35
% 1.06/1.35 THEOREM PROVED
% 1.06/1.35 % SZS status Unsatisfiable
% 1.06/1.35
% 1.06/1.35 Exiting with 1 proof.
% 1.06/1.35
% 1.06/1.35 Process 12872 exit (max_proofs) Mon Jun 6 12:26:06 2022
% 1.06/1.35 Prover9 interrupted
%------------------------------------------------------------------------------