TSTP Solution File: ANA004-4 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : ANA004-4 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n029.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 : Thu Jul 14 19:21:19 EDT 2022
% Result : Unsatisfiable 40.49s 40.76s
% Output : Refutation 40.49s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.11 % Problem : ANA004-4 : TPTP v8.1.0. Released v1.0.0.
% 0.06/0.12 % Command : tptp2X_and_run_prover9 %d %s
% 0.11/0.32 % Computer : n029.cluster.edu
% 0.11/0.32 % Model : x86_64 x86_64
% 0.11/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.32 % Memory : 8042.1875MB
% 0.11/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.32 % CPULimit : 300
% 0.11/0.32 % WCLimit : 600
% 0.11/0.32 % DateTime : Fri Jul 8 07:07:29 EDT 2022
% 0.11/0.32 % CPUTime :
% 40.49/40.76 ============================== Prover9 ===============================
% 40.49/40.76 Prover9 (32) version 2009-11A, November 2009.
% 40.49/40.76 Process 1799 was started by sandbox on n029.cluster.edu,
% 40.49/40.76 Fri Jul 8 07:07:30 2022
% 40.49/40.76 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_1561_n029.cluster.edu".
% 40.49/40.76 ============================== end of head ===========================
% 40.49/40.76
% 40.49/40.76 ============================== INPUT =================================
% 40.49/40.76
% 40.49/40.76 % Reading from file /tmp/Prover9_1561_n029.cluster.edu
% 40.49/40.76
% 40.49/40.76 set(prolog_style_variables).
% 40.49/40.76 set(auto2).
% 40.49/40.76 % set(auto2) -> set(auto).
% 40.49/40.76 % set(auto) -> set(auto_inference).
% 40.49/40.76 % set(auto) -> set(auto_setup).
% 40.49/40.76 % set(auto_setup) -> set(predicate_elim).
% 40.49/40.76 % set(auto_setup) -> assign(eq_defs, unfold).
% 40.49/40.76 % set(auto) -> set(auto_limits).
% 40.49/40.76 % set(auto_limits) -> assign(max_weight, "100.000").
% 40.49/40.76 % set(auto_limits) -> assign(sos_limit, 20000).
% 40.49/40.76 % set(auto) -> set(auto_denials).
% 40.49/40.76 % set(auto) -> set(auto_process).
% 40.49/40.76 % set(auto2) -> assign(new_constants, 1).
% 40.49/40.76 % set(auto2) -> assign(fold_denial_max, 3).
% 40.49/40.76 % set(auto2) -> assign(max_weight, "200.000").
% 40.49/40.76 % set(auto2) -> assign(max_hours, 1).
% 40.49/40.76 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 40.49/40.76 % set(auto2) -> assign(max_seconds, 0).
% 40.49/40.76 % set(auto2) -> assign(max_minutes, 5).
% 40.49/40.76 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 40.49/40.76 % set(auto2) -> set(sort_initial_sos).
% 40.49/40.76 % set(auto2) -> assign(sos_limit, -1).
% 40.49/40.76 % set(auto2) -> assign(lrs_ticks, 3000).
% 40.49/40.76 % set(auto2) -> assign(max_megs, 400).
% 40.49/40.76 % set(auto2) -> assign(stats, some).
% 40.49/40.76 % set(auto2) -> clear(echo_input).
% 40.49/40.76 % set(auto2) -> set(quiet).
% 40.49/40.76 % set(auto2) -> clear(print_initial_clauses).
% 40.49/40.76 % set(auto2) -> clear(print_given).
% 40.49/40.76 assign(lrs_ticks,-1).
% 40.49/40.76 assign(sos_limit,10000).
% 40.49/40.76 assign(order,kbo).
% 40.49/40.76 set(lex_order_vars).
% 40.49/40.76 clear(print_given).
% 40.49/40.76
% 40.49/40.76 % formulas(sos). % not echoed (13 formulas)
% 40.49/40.76
% 40.49/40.76 ============================== end of input ==========================
% 40.49/40.76
% 40.49/40.76 % From the command line: assign(max_seconds, 300).
% 40.49/40.76
% 40.49/40.76 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 40.49/40.76
% 40.49/40.76 % Formulas that are not ordinary clauses:
% 40.49/40.76
% 40.49/40.76 ============================== end of process non-clausal formulas ===
% 40.49/40.76
% 40.49/40.76 ============================== PROCESS INITIAL CLAUSES ===============
% 40.49/40.76
% 40.49/40.76 ============================== PREDICATE ELIMINATION =================
% 40.49/40.76
% 40.49/40.76 ============================== end predicate elimination =============
% 40.49/40.76
% 40.49/40.76 Auto_denials: (non-Horn, no changes).
% 40.49/40.76
% 40.49/40.76 Term ordering decisions:
% 40.49/40.76 Function symbol KB weights: n0=1. a_real_number=1. epsilon_0=1. add=1. minimum=1. absolute=1. negate=1. f=1. g=1. half=1. xs=1. delta_1=1. delta_2=1.
% 40.49/40.76
% 40.49/40.76 ============================== end of process initial clauses ========
% 40.49/40.76
% 40.49/40.76 ============================== CLAUSES FOR SEARCH ====================
% 40.49/40.76
% 40.49/40.76 ============================== end of clauses for search =============
% 40.49/40.76
% 40.49/40.76 ============================== SEARCH ================================
% 40.49/40.76
% 40.49/40.76 % Starting search at 0.01 seconds.
% 40.49/40.76
% 40.49/40.76 Low Water (keep): wt=24.000, iters=3345
% 40.49/40.76
% 40.49/40.76 Low Water (keep): wt=12.000, iters=3353
% 40.49/40.76
% 40.49/40.76 Low Water (keep): wt=11.000, iters=3335
% 40.49/40.76
% 40.49/40.76 Low Water (keep): wt=10.000, iters=3337
% 40.49/40.76
% 40.49/40.76 NOTE: Back_subsumption disabled, ratio of kept to back_subsumed is 242 (0.00 of 0.83 sec).
% 40.49/40.76
% 40.49/40.76 Low Water (displace): id=3328, wt=26.000
% 40.49/40.76
% 40.49/40.76 ============================== PROOF =================================
% 40.49/40.76 % SZS status Unsatisfiable
% 40.49/40.76 % SZS output start Refutation
% 40.49/40.76
% 40.49/40.76 % Proof 1 at 34.66 (+ 5.16) seconds.
% 40.49/40.76 % Length of proof is 26.
% 40.49/40.76 % Level of proof is 7.
% 40.49/40.76 % Maximum clause weight is 45.000.
% 40.49/40.76 % Given clauses 6213.
% 40.49/40.76
% 40.49/40.76 1 less_or_equal(A,n0) | less_or_equal(absolute(add(xs(A),negate(a_real_number))),A) # label(clause_6) # label(hypothesis). [assumption].
% 40.49/40.76 2 -less_or_equal(epsilon_0,n0) # label(clause_5) # label(hypothesis). [assumption].
% 40.49/40.76 3 less_or_equal(A,n0) | -less_or_equal(half(A),n0) # label(zero_and_half) # label(axiom). [assumption].
% 40.49/40.76 4 less_or_equal(A,n0) | -less_or_equal(delta_1(A),n0) # label(clause_1) # label(hypothesis). [assumption].
% 40.49/40.76 5 less_or_equal(A,n0) | -less_or_equal(delta_2(A),n0) # label(clause_2) # label(hypothesis). [assumption].
% 40.49/40.76 6 -less_or_equal(A,minimum(B,C)) | less_or_equal(A,B) # label(minimum3) # label(axiom). [assumption].
% 40.49/40.76 7 -less_or_equal(A,minimum(B,C)) | less_or_equal(A,C) # label(minimum7) # label(axiom). [assumption].
% 40.49/40.76 8 less_or_equal(A,n0) | less_or_equal(B,n0) | -less_or_equal(minimum(A,B),n0) # label(minimum9) # label(axiom). [assumption].
% 40.49/40.76 9 -less_or_equal(add(absolute(A),absolute(B)),C) | less_or_equal(absolute(add(A,B)),C) # label(absolute_sum_less_or_equal_sum_of_absolutes2) # label(axiom). [assumption].
% 40.49/40.76 10 -less_or_equal(A,half(B)) | -less_or_equal(C,half(B)) | less_or_equal(add(A,C),B) # label(less_or_equal_sum_of_halves) # label(axiom). [assumption].
% 40.49/40.76 11 less_or_equal(A,n0) | -less_or_equal(absolute(add(B,negate(a_real_number))),delta_1(A)) | less_or_equal(absolute(add(f(B),negate(f(a_real_number)))),A) # label(clause_3) # label(hypothesis). [assumption].
% 40.49/40.76 12 less_or_equal(A,n0) | -less_or_equal(absolute(add(B,negate(a_real_number))),delta_2(A)) | less_or_equal(absolute(add(g(B),negate(g(a_real_number)))),A) # label(clause_4) # label(hypothesis). [assumption].
% 40.49/40.76 13 less_or_equal(A,n0) | -less_or_equal(absolute(add(add(f(xs(A)),negate(f(a_real_number))),add(g(xs(A)),negate(g(a_real_number))))),epsilon_0) # label(clause_7_1) # label(negated_conjecture). [assumption].
% 40.49/40.76 16 -less_or_equal(half(epsilon_0),n0). [ur(3,a,2,a)].
% 40.49/40.76 19 less_or_equal(absolute(add(xs(minimum(A,B)),negate(a_real_number))),A) | less_or_equal(minimum(A,B),n0). [resolve(6,a,1,b)].
% 40.49/40.76 21 less_or_equal(absolute(add(xs(minimum(A,B)),negate(a_real_number))),B) | less_or_equal(minimum(A,B),n0). [resolve(7,a,1,b)].
% 40.49/40.76 36 -less_or_equal(delta_2(half(epsilon_0)),n0). [ur(5,a,16,a)].
% 40.49/40.76 37 -less_or_equal(delta_1(half(epsilon_0)),n0). [ur(4,a,16,a)].
% 40.49/40.76 68 less_or_equal(minimum(delta_2(A),B),n0) | less_or_equal(A,n0) | less_or_equal(absolute(add(g(xs(minimum(delta_2(A),B))),negate(g(a_real_number)))),A). [resolve(19,a,12,b)].
% 40.49/40.76 76 less_or_equal(minimum(A,delta_1(B)),n0) | less_or_equal(B,n0) | less_or_equal(absolute(add(f(xs(minimum(A,delta_1(B)))),negate(f(a_real_number)))),B). [resolve(21,a,11,b)].
% 40.49/40.76 125 -less_or_equal(minimum(delta_2(half(epsilon_0)),delta_1(half(epsilon_0))),n0). [ur(8,a,36,a,b,37,a)].
% 40.49/40.76 509 less_or_equal(minimum(delta_2(half(A)),B),n0) | less_or_equal(half(A),n0) | -less_or_equal(C,half(A)) | less_or_equal(add(C,absolute(add(g(xs(minimum(delta_2(half(A)),B))),negate(g(a_real_number))))),A). [resolve(68,c,10,b)].
% 40.49/40.76 7797 less_or_equal(minimum(delta_2(half(A)),B),n0) | less_or_equal(half(A),n0) | less_or_equal(add(absolute(add(f(xs(minimum(C,delta_1(half(A))))),negate(f(a_real_number)))),absolute(add(g(xs(minimum(delta_2(half(A)),B))),negate(g(a_real_number))))),A) | less_or_equal(minimum(C,delta_1(half(A))),n0). [resolve(509,c,76,c),merge(e)].
% 40.49/40.76 7812 less_or_equal(minimum(delta_2(half(A)),delta_1(half(A))),n0) | less_or_equal(half(A),n0) | less_or_equal(add(absolute(add(f(xs(minimum(delta_2(half(A)),delta_1(half(A))))),negate(f(a_real_number)))),absolute(add(g(xs(minimum(delta_2(half(A)),delta_1(half(A))))),negate(g(a_real_number))))),A). [factor(7797,a,d)].
% 40.49/40.76 16104 less_or_equal(minimum(delta_2(half(A)),delta_1(half(A))),n0) | less_or_equal(half(A),n0) | less_or_equal(absolute(add(add(f(xs(minimum(delta_2(half(A)),delta_1(half(A))))),negate(f(a_real_number))),add(g(xs(minimum(delta_2(half(A)),delta_1(half(A))))),negate(g(a_real_number))))),A). [resolve(7812,c,9,a)].
% 40.49/40.76 16111 $F. [resolve(16104,c,13,b),merge(c),unit_del(a,125),unit_del(b,16)].
% 40.49/40.76
% 40.49/40.76 % SZS output end Refutation
% 40.49/40.76 ============================== end of proof ==========================
% 40.49/40.76
% 40.49/40.76 ============================== STATISTICS ============================
% 40.49/40.76
% 40.49/40.76 Given=6213. Generated=10155901. Kept=16110. proofs=1.
% 40.49/40.76 Usable=6213. Sos=8401. Demods=0. Limbo=0, Disabled=1509. Hints=0.
% 40.49/40.76 Megabytes=19.27.
% 40.49/40.76 User_CPU=34.66, System_CPU=5.16, Wall_clock=40.
% 40.49/40.76
% 40.49/40.76 ============================== end of statistics =====================
% 40.49/40.76
% 40.49/40.76 ============================== end of search =========================
% 40.49/40.76
% 40.49/40.76 THEOREM PROVED
% 40.49/40.76 % SZS status Unsatisfiable
% 40.49/40.76
% 40.49/40.76 Exiting with 1 proof.
% 40.49/40.76
% 40.49/40.76 Process 1799 exit (max_proofs) Fri Jul 8 07:08:10 2022
% 40.49/40.76 Prover9 interrupted
%------------------------------------------------------------------------------