TSTP Solution File: FLD065-1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : FLD065-1 : TPTP v8.1.0. Bugfixed v2.1.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n025.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:29 EDT 2022
% Result : Unsatisfiable 12.64s 12.97s
% Output : Refutation 12.64s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : FLD065-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 : n025.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:18 EDT 2022
% 0.13/0.34 % CPUTime :
% 12.64/12.97 ============================== Prover9 ===============================
% 12.64/12.97 Prover9 (32) version 2009-11A, November 2009.
% 12.64/12.97 Process 21001 was started by sandbox2 on n025.cluster.edu,
% 12.64/12.97 Tue Jun 7 03:21:19 2022
% 12.64/12.97 The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 300 -f /tmp/Prover9_20848_n025.cluster.edu".
% 12.64/12.97 ============================== end of head ===========================
% 12.64/12.97
% 12.64/12.97 ============================== INPUT =================================
% 12.64/12.97
% 12.64/12.97 % Reading from file /tmp/Prover9_20848_n025.cluster.edu
% 12.64/12.97
% 12.64/12.97 set(prolog_style_variables).
% 12.64/12.97 set(auto2).
% 12.64/12.97 % set(auto2) -> set(auto).
% 12.64/12.97 % set(auto) -> set(auto_inference).
% 12.64/12.97 % set(auto) -> set(auto_setup).
% 12.64/12.97 % set(auto_setup) -> set(predicate_elim).
% 12.64/12.97 % set(auto_setup) -> assign(eq_defs, unfold).
% 12.64/12.97 % set(auto) -> set(auto_limits).
% 12.64/12.97 % set(auto_limits) -> assign(max_weight, "100.000").
% 12.64/12.97 % set(auto_limits) -> assign(sos_limit, 20000).
% 12.64/12.97 % set(auto) -> set(auto_denials).
% 12.64/12.97 % set(auto) -> set(auto_process).
% 12.64/12.97 % set(auto2) -> assign(new_constants, 1).
% 12.64/12.97 % set(auto2) -> assign(fold_denial_max, 3).
% 12.64/12.97 % set(auto2) -> assign(max_weight, "200.000").
% 12.64/12.97 % set(auto2) -> assign(max_hours, 1).
% 12.64/12.97 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 12.64/12.97 % set(auto2) -> assign(max_seconds, 0).
% 12.64/12.97 % set(auto2) -> assign(max_minutes, 5).
% 12.64/12.97 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 12.64/12.97 % set(auto2) -> set(sort_initial_sos).
% 12.64/12.97 % set(auto2) -> assign(sos_limit, -1).
% 12.64/12.97 % set(auto2) -> assign(lrs_ticks, 3000).
% 12.64/12.97 % set(auto2) -> assign(max_megs, 400).
% 12.64/12.97 % set(auto2) -> assign(stats, some).
% 12.64/12.97 % set(auto2) -> clear(echo_input).
% 12.64/12.97 % set(auto2) -> set(quiet).
% 12.64/12.97 % set(auto2) -> clear(print_initial_clauses).
% 12.64/12.97 % set(auto2) -> clear(print_given).
% 12.64/12.97 assign(lrs_ticks,-1).
% 12.64/12.97 assign(sos_limit,10000).
% 12.64/12.97 assign(order,kbo).
% 12.64/12.97 set(lex_order_vars).
% 12.64/12.97 clear(print_given).
% 12.64/12.97
% 12.64/12.97 % formulas(sos). % not echoed (30 formulas)
% 12.64/12.97
% 12.64/12.97 ============================== end of input ==========================
% 12.64/12.97
% 12.64/12.97 % From the command line: assign(max_seconds, 300).
% 12.64/12.97
% 12.64/12.97 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 12.64/12.97
% 12.64/12.97 % Formulas that are not ordinary clauses:
% 12.64/12.97
% 12.64/12.97 ============================== end of process non-clausal formulas ===
% 12.64/12.97
% 12.64/12.97 ============================== PROCESS INITIAL CLAUSES ===============
% 12.64/12.97
% 12.64/12.97 ============================== PREDICATE ELIMINATION =================
% 12.64/12.97
% 12.64/12.97 ============================== end predicate elimination =============
% 12.64/12.97
% 12.64/12.97 Auto_denials: (non-Horn, no changes).
% 12.64/12.97
% 12.64/12.97 Term ordering decisions:
% 12.64/12.97 Function symbol KB weights: additive_identity=1. multiplicative_identity=1. a=1. add=1. multiply=1. additive_inverse=1. multiplicative_inverse=1.
% 12.64/12.97
% 12.64/12.97 ============================== end of process initial clauses ========
% 12.64/12.97
% 12.64/12.97 ============================== CLAUSES FOR SEARCH ====================
% 12.64/12.97
% 12.64/12.97 ============================== end of clauses for search =============
% 12.64/12.97
% 12.64/12.97 ============================== SEARCH ================================
% 12.64/12.97
% 12.64/12.97 % Starting search at 0.01 seconds.
% 12.64/12.97
% 12.64/12.97 Low Water (keep): wt=34.000, iters=3764
% 12.64/12.97
% 12.64/12.97 Low Water (keep): wt=29.000, iters=3683
% 12.64/12.97
% 12.64/12.97 Low Water (keep): wt=24.000, iters=3335
% 12.64/12.97
% 12.64/12.97 Low Water (keep): wt=23.000, iters=3418
% 12.64/12.97
% 12.64/12.97 Low Water (keep): wt=21.000, iters=3360
% 12.64/12.97
% 12.64/12.97 Low Water (keep): wt=19.000, iters=3418
% 12.64/12.97
% 12.64/12.97 Low Water (keep): wt=12.000, iters=3919
% 12.64/12.97
% 12.64/12.97 Low Water (keep): wt=11.000, iters=3397
% 12.64/12.97
% 12.64/12.97 Low Water (keep): wt=10.000, iters=3340
% 12.64/12.97
% 12.64/12.97 NOTE: Back_subsumption disabled, ratio of kept to back_subsumed is 1159 (0.00 of 0.50 sec).
% 12.64/12.97
% 12.64/12.97 Low Water (displace): id=5599, wt=34.000
% 12.64/12.97
% 12.64/12.97 Low Water (displace): id=10569, wt=10.000
% 12.64/12.97
% 12.64/12.97 Low Water (displace): id=10843, wt=8.000
% 12.64/12.97
% 12.64/12.97 Low Water (displace): id=15473, wt=7.000
% 12.64/12.97
% 12.64/12.97 Low Water (keep): wt=9.000, iters=5198
% 12.64/12.97
% 12.64/12.97 Low Water (keep): wt=8.000, iters=4035
% 12.64/12.97
% 12.64/12.97 ============================== PROOF =================================
% 12.64/12.97 % SZS status Unsatisfiable
% 12.64/12.97 % SZS output start Refutation
% 12.64/12.97
% 12.64/12.97 % Proof 1 at 10.78 (+ 1.17) seconds.
% 12.64/12.97 % Length of proof is 27.
% 12.64/12.97 % Level of proof is 6.
% 12.64/12.97 % Maximum clause weight is 12.000.
% 12.64/12.97 % Given clauses 5088.
% 12.64/12.97
% 12.64/12.97 3 defined(a) # label(a_is_defined) # label(hypothesis). [assumption].
% 12.64/12.97 4 less_or_equal(additive_inverse(a),additive_identity) # label(less_or_equal_2) # label(negated_conjecture). [assumption].
% 12.64/12.97 6 -less_or_equal(additive_identity,a) # label(not_less_or_equal_3) # label(negated_conjecture). [assumption].
% 12.64/12.97 7 defined(additive_inverse(A)) | -defined(A) # label(well_definedness_of_additive_inverse) # label(axiom). [assumption].
% 12.64/12.97 9 equalish(A,B) | -equalish(B,A) # label(symmetry_of_equality) # label(axiom). [assumption].
% 12.64/12.97 10 equalish(add(additive_identity,A),A) | -defined(A) # label(existence_of_identity_addition) # label(axiom). [assumption].
% 12.64/12.97 12 equalish(add(A,additive_inverse(A)),additive_identity) | -defined(A) # label(existence_of_inverse_addition) # label(axiom). [assumption].
% 12.64/12.97 17 less_or_equal(A,B) | -less_or_equal(A,C) | -less_or_equal(C,B) # label(transitivity_of_order_relation) # label(axiom). [assumption].
% 12.64/12.97 19 less_or_equal(A,B) | -less_or_equal(C,B) | -equalish(C,A) # label(compatibility_of_equality_and_order_relation) # label(axiom). [assumption].
% 12.64/12.97 20 less_or_equal(A,B) | less_or_equal(B,A) | -defined(A) | -defined(B) # label(totality_of_order_relation) # label(axiom). [assumption].
% 12.64/12.97 21 equalish(add(A,B),add(B,A)) | -defined(A) | -defined(B) # label(commutativity_addition) # label(axiom). [assumption].
% 12.64/12.97 25 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].
% 12.64/12.97 50 defined(additive_inverse(a)). [resolve(7,b,3,a)].
% 12.64/12.97 57 equalish(add(additive_identity,a),a). [resolve(10,b,3,a)].
% 12.64/12.97 63 equalish(add(a,additive_inverse(a)),additive_identity). [resolve(12,b,3,a)].
% 12.64/12.97 85 less_or_equal(a,A) | less_or_equal(A,a) | -defined(A). [resolve(20,c,3,a)].
% 12.64/12.97 88 less_or_equal(a,a). [factor(85,a,b),unit_del(b,3)].
% 12.64/12.97 94 equalish(add(A,a),add(a,A)) | -defined(A). [resolve(21,c,3,a)].
% 12.64/12.97 105 less_or_equal(add(additive_inverse(a),A),add(additive_identity,A)) | -defined(A). [resolve(25,c,4,a)].
% 12.64/12.97 419 less_or_equal(A,a) | -equalish(a,A). [resolve(88,a,19,b)].
% 12.64/12.97 434 equalish(a,add(additive_identity,a)). [resolve(57,a,9,b)].
% 12.64/12.97 1099 -less_or_equal(add(a,additive_inverse(a)),a). [ur(19,a,6,a,c,63,a)].
% 12.64/12.97 7110 equalish(add(additive_inverse(a),a),add(a,additive_inverse(a))). [resolve(94,b,50,a)].
% 12.64/12.97 8016 less_or_equal(add(additive_identity,a),a). [resolve(419,b,434,a)].
% 12.64/12.97 8042 -less_or_equal(add(a,additive_inverse(a)),add(additive_identity,a)). [ur(17,a,1099,a,c,8016,a)].
% 12.64/12.97 8165 less_or_equal(add(additive_inverse(a),a),add(additive_identity,a)). [resolve(105,b,3,a)].
% 12.64/12.97 33966 $F. [ur(19,a,8042,a,b,8165,a),unit_del(a,7110)].
% 12.64/12.97
% 12.64/12.97 % SZS output end Refutation
% 12.64/12.97 ============================== end of proof ==========================
% 12.64/12.97
% 12.64/12.97 ============================== STATISTICS ============================
% 12.64/12.97
% 12.64/12.97 Given=5088. Generated=2433910. Kept=33965. proofs=1.
% 12.64/12.97 Usable=5088. Sos=9778. Demods=0. Limbo=31, Disabled=19098. Hints=0.
% 12.64/12.97 Megabytes=16.04.
% 12.64/12.97 User_CPU=10.78, System_CPU=1.17, Wall_clock=12.
% 12.64/12.97
% 12.64/12.97 ============================== end of statistics =====================
% 12.64/12.97
% 12.64/12.97 ============================== end of search =========================
% 12.64/12.97
% 12.64/12.97 THEOREM PROVED
% 12.64/12.97 % SZS status Unsatisfiable
% 12.64/12.97
% 12.64/12.97 Exiting with 1 proof.
% 12.64/12.97
% 12.64/12.97 Process 21001 exit (max_proofs) Tue Jun 7 03:21:31 2022
% 12.64/12.97 Prover9 interrupted
%------------------------------------------------------------------------------