TSTP Solution File: FLD063-3 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : FLD063-3 : TPTP v8.1.0. Bugfixed v2.1.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n032.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 107.03s 107.32s
% Output : Refutation 107.03s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.05/0.09 % Problem : FLD063-3 : TPTP v8.1.0. Bugfixed v2.1.0.
% 0.05/0.10 % Command : tptp2X_and_run_prover9 %d %s
% 0.09/0.29 % Computer : n032.cluster.edu
% 0.09/0.29 % Model : x86_64 x86_64
% 0.09/0.29 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.29 % Memory : 8042.1875MB
% 0.09/0.29 % OS : Linux 3.10.0-693.el7.x86_64
% 0.09/0.29 % CPULimit : 300
% 0.09/0.29 % WCLimit : 600
% 0.09/0.29 % DateTime : Mon Jun 6 13:46:34 EDT 2022
% 0.09/0.29 % CPUTime :
% 107.03/107.32 ============================== Prover9 ===============================
% 107.03/107.32 Prover9 (32) version 2009-11A, November 2009.
% 107.03/107.32 Process 16136 was started by sandbox2 on n032.cluster.edu,
% 107.03/107.32 Mon Jun 6 13:46:35 2022
% 107.03/107.32 The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 300 -f /tmp/Prover9_15983_n032.cluster.edu".
% 107.03/107.32 ============================== end of head ===========================
% 107.03/107.32
% 107.03/107.32 ============================== INPUT =================================
% 107.03/107.32
% 107.03/107.32 % Reading from file /tmp/Prover9_15983_n032.cluster.edu
% 107.03/107.32
% 107.03/107.32 set(prolog_style_variables).
% 107.03/107.32 set(auto2).
% 107.03/107.32 % set(auto2) -> set(auto).
% 107.03/107.32 % set(auto) -> set(auto_inference).
% 107.03/107.32 % set(auto) -> set(auto_setup).
% 107.03/107.32 % set(auto_setup) -> set(predicate_elim).
% 107.03/107.32 % set(auto_setup) -> assign(eq_defs, unfold).
% 107.03/107.32 % set(auto) -> set(auto_limits).
% 107.03/107.32 % set(auto_limits) -> assign(max_weight, "100.000").
% 107.03/107.32 % set(auto_limits) -> assign(sos_limit, 20000).
% 107.03/107.32 % set(auto) -> set(auto_denials).
% 107.03/107.32 % set(auto) -> set(auto_process).
% 107.03/107.32 % set(auto2) -> assign(new_constants, 1).
% 107.03/107.32 % set(auto2) -> assign(fold_denial_max, 3).
% 107.03/107.32 % set(auto2) -> assign(max_weight, "200.000").
% 107.03/107.32 % set(auto2) -> assign(max_hours, 1).
% 107.03/107.32 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 107.03/107.32 % set(auto2) -> assign(max_seconds, 0).
% 107.03/107.32 % set(auto2) -> assign(max_minutes, 5).
% 107.03/107.32 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 107.03/107.32 % set(auto2) -> set(sort_initial_sos).
% 107.03/107.32 % set(auto2) -> assign(sos_limit, -1).
% 107.03/107.32 % set(auto2) -> assign(lrs_ticks, 3000).
% 107.03/107.32 % set(auto2) -> assign(max_megs, 400).
% 107.03/107.32 % set(auto2) -> assign(stats, some).
% 107.03/107.32 % set(auto2) -> clear(echo_input).
% 107.03/107.32 % set(auto2) -> set(quiet).
% 107.03/107.32 % set(auto2) -> clear(print_initial_clauses).
% 107.03/107.32 % set(auto2) -> clear(print_given).
% 107.03/107.32 assign(lrs_ticks,-1).
% 107.03/107.32 assign(sos_limit,10000).
% 107.03/107.32 assign(order,kbo).
% 107.03/107.32 set(lex_order_vars).
% 107.03/107.32 clear(print_given).
% 107.03/107.32
% 107.03/107.32 % formulas(sos). % not echoed (30 formulas)
% 107.03/107.32
% 107.03/107.32 ============================== end of input ==========================
% 107.03/107.32
% 107.03/107.32 % From the command line: assign(max_seconds, 300).
% 107.03/107.32
% 107.03/107.32 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 107.03/107.32
% 107.03/107.32 % Formulas that are not ordinary clauses:
% 107.03/107.32
% 107.03/107.32 ============================== end of process non-clausal formulas ===
% 107.03/107.32
% 107.03/107.32 ============================== PROCESS INITIAL CLAUSES ===============
% 107.03/107.32
% 107.03/107.32 ============================== PREDICATE ELIMINATION =================
% 107.03/107.32
% 107.03/107.32 ============================== end predicate elimination =============
% 107.03/107.32
% 107.03/107.32 Auto_denials: (non-Horn, no changes).
% 107.03/107.32
% 107.03/107.32 Term ordering decisions:
% 107.03/107.32 Function symbol KB weights: additive_identity=1. multiplicative_identity=1. a=1. b=1. add=1. multiply=1. additive_inverse=1. multiplicative_inverse=1.
% 107.03/107.32
% 107.03/107.32 ============================== end of process initial clauses ========
% 107.03/107.32
% 107.03/107.32 ============================== CLAUSES FOR SEARCH ====================
% 107.03/107.32
% 107.03/107.32 ============================== end of clauses for search =============
% 107.03/107.32
% 107.03/107.32 ============================== SEARCH ================================
% 107.03/107.32
% 107.03/107.32 % Starting search at 0.01 seconds.
% 107.03/107.32
% 107.03/107.32 Low Water (keep): wt=18.000, iters=3706
% 107.03/107.32
% 107.03/107.32 Low Water (keep): wt=14.000, iters=3476
% 107.03/107.32
% 107.03/107.32 Low Water (keep): wt=12.000, iters=3334
% 107.03/107.32
% 107.03/107.32 Low Water (keep): wt=11.000, iters=3385
% 107.03/107.32
% 107.03/107.32 Low Water (keep): wt=10.000, iters=3341
% 107.03/107.32
% 107.03/107.32 Low Water (keep): wt=9.000, iters=3363
% 107.03/107.32
% 107.03/107.32 Low Water (keep): wt=8.000, iters=3403
% 107.03/107.32
% 107.03/107.32 NOTE: Back_subsumption disabled, ratio of kept to back_subsumed is 290 (0.00 of 0.24 sec).
% 107.03/107.32
% 107.03/107.32 Low Water (keep): wt=7.000, iters=3366
% 107.03/107.32
% 107.03/107.32 Low Water (displace): id=5815, wt=18.000
% 107.03/107.32
% 107.03/107.32 Low Water (displace): id=11303, wt=12.000
% 107.03/107.32
% 107.03/107.32 Low Water (displace): id=11336, wt=11.000
% 107.03/107.32
% 107.03/107.32 Low Water (displace): id=11559, wt=10.000
% 107.03/107.32
% 107.03/107.32 Low Water (displace): id=12038, wt=9.000
% 107.03/107.32
% 107.03/107.32 ============================== PROOF =================================
% 107.03/107.32 % SZS status Unsatisfiable
% 107.03/107.32 % SZS output start Refutation
% 107.03/107.32
% 107.03/107.32 % Proof 1 at 104.44 (+ 2.08) seconds.
% 107.03/107.32 % Length of proof is 38.
% 107.03/107.32 % Level of proof is 8.
% 107.03/107.32 % Maximum clause weight is 16.000.
% 107.03/107.32 % Given clauses 13397.
% 107.03/107.32
% 107.03/107.32 1 defined(additive_identity) # label(well_definedness_of_additive_identity) # label(axiom). [assumption].
% 107.03/107.32 3 defined(a) # label(a_is_defined) # label(hypothesis). [assumption].
% 107.03/107.32 4 defined(b) # label(b_is_defined) # label(hypothesis). [assumption].
% 107.03/107.32 5 less_or_equal(additive_inverse(b),additive_inverse(a)) # label(less_or_equal_3) # label(negated_conjecture). [assumption].
% 107.03/107.32 6 -less_or_equal(a,b) # label(not_less_or_equal_4) # label(negated_conjecture). [assumption].
% 107.03/107.32 8 defined(additive_inverse(A)) | -defined(A) # label(well_definedness_of_additive_inverse) # label(axiom). [assumption].
% 107.03/107.32 9 sum(additive_identity,A,A) | -defined(A) # label(existence_of_identity_addition) # label(axiom). [assumption].
% 107.03/107.32 11 sum(additive_inverse(A),A,additive_identity) | -defined(A) # label(existence_of_inverse_addition) # label(axiom). [assumption].
% 107.03/107.32 12 sum(A,B,C) | -sum(B,A,C) # label(commutativity_addition) # label(axiom). [assumption].
% 107.03/107.32 18 sum(A,B,add(A,B)) | -defined(A) | -defined(B) # label(totality_of_addition) # label(axiom). [assumption].
% 107.03/107.32 20 sum(additive_identity,A,B) | -less_or_equal(A,B) | -less_or_equal(B,A) # label(antisymmetry_of_order_relation) # label(axiom). [assumption].
% 107.03/107.32 21 less_or_equal(A,B) | less_or_equal(B,A) | -defined(A) | -defined(B) # label(totality_of_order_relation) # label(axiom). [assumption].
% 107.03/107.32 24 less_or_equal(A,B) | -less_or_equal(C,D) | -sum(C,E,A) | -sum(D,E,B) # label(compatibility_of_order_relation_and_addition) # label(axiom). [assumption].
% 107.03/107.32 25 sum(A,B,C) | -sum(A,D,E) | -sum(D,F,B) | -sum(E,F,C) # label(associativity_addition_1) # label(axiom). [assumption].
% 107.03/107.32 26 sum(A,B,C) | -sum(D,E,A) | -sum(E,B,F) | -sum(D,F,C) # label(associativity_addition_2) # label(axiom). [assumption].
% 107.03/107.32 55 defined(additive_inverse(a)). [resolve(8,b,3,a)].
% 107.03/107.32 58 sum(additive_identity,b,b). [resolve(9,b,4,a)].
% 107.03/107.32 59 sum(additive_identity,a,a). [resolve(9,b,3,a)].
% 107.03/107.32 66 sum(additive_inverse(b),b,additive_identity). [resolve(11,b,4,a)].
% 107.03/107.32 67 sum(additive_inverse(a),a,additive_identity). [resolve(11,b,3,a)].
% 107.03/107.32 91 sum(b,A,add(b,A)) | -defined(A). [resolve(18,b,4,a)].
% 107.03/107.32 109 less_or_equal(b,A) | less_or_equal(A,b) | -defined(A). [resolve(21,c,4,a)].
% 107.03/107.32 112 less_or_equal(additive_identity,A) | less_or_equal(A,additive_identity) | -defined(A). [resolve(21,c,1,a)].
% 107.03/107.32 116 less_or_equal(additive_identity,additive_identity). [factor(112,a,b),unit_del(b,1)].
% 107.03/107.32 221 sum(b,A,B) | -sum(b,A,C) | -sum(additive_identity,C,B). [resolve(58,a,26,b)].
% 107.03/107.32 228 -sum(additive_identity,b,a). [ur(24,a,6,a,b,116,a,d,58,a)].
% 107.03/107.32 254 -sum(b,additive_identity,a). [ur(12,a,228,a)].
% 107.03/107.32 455 less_or_equal(additive_identity,A) | -less_or_equal(additive_inverse(b),B) | -sum(B,b,A). [resolve(66,a,24,c)].
% 107.03/107.32 553 sum(a,additive_inverse(a),additive_identity). [resolve(67,a,12,b)].
% 107.03/107.32 556 -sum(b,additive_inverse(a),additive_identity). [ur(25,a,254,a,c,67,a,d,59,a)].
% 107.03/107.32 1713 less_or_equal(A,additive_identity) | -less_or_equal(B,a) | -sum(B,additive_inverse(a),A). [resolve(553,a,24,d)].
% 107.03/107.32 3914 sum(b,additive_inverse(a),add(b,additive_inverse(a))). [resolve(91,b,55,a)].
% 107.03/107.32 5456 less_or_equal(b,a). [resolve(109,c,3,a),unit_del(b,6)].
% 107.03/107.32 21712 less_or_equal(add(b,additive_inverse(a)),additive_identity). [resolve(3914,a,1713,c),unit_del(b,5456)].
% 107.03/107.32 21713 sum(additive_inverse(a),b,add(b,additive_inverse(a))). [resolve(3914,a,12,b)].
% 107.03/107.32 21718 -sum(additive_identity,add(b,additive_inverse(a)),additive_identity). [ur(221,a,556,a,b,3914,a)].
% 107.03/107.32 21730 -less_or_equal(additive_identity,add(b,additive_inverse(a))). [resolve(21712,a,20,b),unit_del(a,21718)].
% 107.03/107.32 21744 $F. [ur(455,a,21730,a,b,5,a),unit_del(a,21713)].
% 107.03/107.32
% 107.03/107.32 % SZS output end Refutation
% 107.03/107.32 ============================== end of proof ==========================
% 107.03/107.32
% 107.03/107.32 ============================== STATISTICS ============================
% 107.03/107.32
% 107.03/107.32 Given=13397. Generated=4009875. Kept=21743. proofs=1.
% 107.03/107.32 Usable=13382. Sos=7665. Demods=0. Limbo=11, Disabled=715. Hints=0.
% 107.03/107.32 Megabytes=10.92.
% 107.03/107.32 User_CPU=104.44, System_CPU=2.08, Wall_clock=106.
% 107.03/107.32
% 107.03/107.32 ============================== end of statistics =====================
% 107.03/107.32
% 107.03/107.32 ============================== end of search =========================
% 107.03/107.32
% 107.03/107.32 THEOREM PROVED
% 107.03/107.32 % SZS status Unsatisfiable
% 107.03/107.32
% 107.03/107.32 Exiting with 1 proof.
% 107.03/107.32
% 107.03/107.32 Process 16136 exit (max_proofs) Mon Jun 6 13:48:21 2022
% 107.03/107.32 Prover9 interrupted
%------------------------------------------------------------------------------