TSTP Solution File: ANA002-4 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : ANA002-4 : TPTP v8.1.0. Released v1.1.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n012.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:16 EDT 2022
% Result : Unsatisfiable 2.76s 3.08s
% Output : Refutation 2.76s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : ANA002-4 : TPTP v8.1.0. Released v1.1.0.
% 0.11/0.12 % Command : tptp2X_and_run_prover9 %d %s
% 0.12/0.33 % Computer : n012.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 600
% 0.12/0.33 % DateTime : Fri Jul 8 06:47:29 EDT 2022
% 0.12/0.33 % CPUTime :
% 2.76/3.08 ============================== Prover9 ===============================
% 2.76/3.08 Prover9 (32) version 2009-11A, November 2009.
% 2.76/3.08 Process 17852 was started by sandbox on n012.cluster.edu,
% 2.76/3.08 Fri Jul 8 06:47:30 2022
% 2.76/3.08 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_17698_n012.cluster.edu".
% 2.76/3.08 ============================== end of head ===========================
% 2.76/3.08
% 2.76/3.08 ============================== INPUT =================================
% 2.76/3.08
% 2.76/3.08 % Reading from file /tmp/Prover9_17698_n012.cluster.edu
% 2.76/3.08
% 2.76/3.08 set(prolog_style_variables).
% 2.76/3.08 set(auto2).
% 2.76/3.08 % set(auto2) -> set(auto).
% 2.76/3.08 % set(auto) -> set(auto_inference).
% 2.76/3.08 % set(auto) -> set(auto_setup).
% 2.76/3.08 % set(auto_setup) -> set(predicate_elim).
% 2.76/3.08 % set(auto_setup) -> assign(eq_defs, unfold).
% 2.76/3.08 % set(auto) -> set(auto_limits).
% 2.76/3.08 % set(auto_limits) -> assign(max_weight, "100.000").
% 2.76/3.08 % set(auto_limits) -> assign(sos_limit, 20000).
% 2.76/3.08 % set(auto) -> set(auto_denials).
% 2.76/3.08 % set(auto) -> set(auto_process).
% 2.76/3.08 % set(auto2) -> assign(new_constants, 1).
% 2.76/3.08 % set(auto2) -> assign(fold_denial_max, 3).
% 2.76/3.08 % set(auto2) -> assign(max_weight, "200.000").
% 2.76/3.08 % set(auto2) -> assign(max_hours, 1).
% 2.76/3.08 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 2.76/3.08 % set(auto2) -> assign(max_seconds, 0).
% 2.76/3.08 % set(auto2) -> assign(max_minutes, 5).
% 2.76/3.08 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 2.76/3.08 % set(auto2) -> set(sort_initial_sos).
% 2.76/3.08 % set(auto2) -> assign(sos_limit, -1).
% 2.76/3.08 % set(auto2) -> assign(lrs_ticks, 3000).
% 2.76/3.08 % set(auto2) -> assign(max_megs, 400).
% 2.76/3.08 % set(auto2) -> assign(stats, some).
% 2.76/3.08 % set(auto2) -> clear(echo_input).
% 2.76/3.08 % set(auto2) -> set(quiet).
% 2.76/3.08 % set(auto2) -> clear(print_initial_clauses).
% 2.76/3.08 % set(auto2) -> clear(print_given).
% 2.76/3.08 assign(lrs_ticks,-1).
% 2.76/3.08 assign(sos_limit,10000).
% 2.76/3.08 assign(order,kbo).
% 2.76/3.08 set(lex_order_vars).
% 2.76/3.08 clear(print_given).
% 2.76/3.08
% 2.76/3.08 % formulas(sos). % not echoed (17 formulas)
% 2.76/3.08
% 2.76/3.08 ============================== end of input ==========================
% 2.76/3.08
% 2.76/3.08 % From the command line: assign(max_seconds, 300).
% 2.76/3.08
% 2.76/3.08 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 2.76/3.08
% 2.76/3.08 % Formulas that are not ordinary clauses:
% 2.76/3.08
% 2.76/3.08 ============================== end of process non-clausal formulas ===
% 2.76/3.08
% 2.76/3.08 ============================== PROCESS INITIAL CLAUSES ===============
% 2.76/3.08
% 2.76/3.08 ============================== PREDICATE ELIMINATION =================
% 2.76/3.08
% 2.76/3.08 ============================== end predicate elimination =============
% 2.76/3.08
% 2.76/3.08 Auto_denials: (non-Horn, no changes).
% 2.76/3.08
% 2.76/3.08 Term ordering decisions:
% 2.76/3.08 Function symbol KB weights: n0=1. upper_bound=1. lower_bound=1. l=1. q=1. f=1. g=1. h=1. k=1.
% 2.76/3.08
% 2.76/3.08 ============================== end of process initial clauses ========
% 2.76/3.08
% 2.76/3.08 ============================== CLAUSES FOR SEARCH ====================
% 2.76/3.08
% 2.76/3.08 ============================== end of clauses for search =============
% 2.76/3.08
% 2.76/3.08 ============================== SEARCH ================================
% 2.76/3.08
% 2.76/3.08 % Starting search at 0.01 seconds.
% 2.76/3.08
% 2.76/3.08 Low Water (keep): wt=36.000, iters=3333
% 2.76/3.08
% 2.76/3.08 Low Water (keep): wt=34.000, iters=3336
% 2.76/3.08
% 2.76/3.08 Low Water (keep): wt=30.000, iters=3336
% 2.76/3.08
% 2.76/3.08 Low Water (keep): wt=29.000, iters=3394
% 2.76/3.08
% 2.76/3.08 Low Water (keep): wt=28.000, iters=3344
% 2.76/3.08
% 2.76/3.08 Low Water (keep): wt=27.000, iters=3339
% 2.76/3.08
% 2.76/3.08 Low Water (keep): wt=26.000, iters=3341
% 2.76/3.08
% 2.76/3.08 Low Water (keep): wt=21.000, iters=3366
% 2.76/3.08
% 2.76/3.08 ============================== PROOF =================================
% 2.76/3.08 % SZS status Unsatisfiable
% 2.76/3.08 % SZS output start Refutation
% 2.76/3.08
% 2.76/3.08 % Proof 1 at 2.08 (+ 0.03) seconds.
% 2.76/3.08 % Length of proof is 45.
% 2.76/3.08 % Level of proof is 16.
% 2.76/3.08 % Maximum clause weight is 22.000.
% 2.76/3.08 % Given clauses 564.
% 2.76/3.08
% 2.76/3.08 2 less_than_or_equal(lower_bound,upper_bound) # label(the_interval) # label(hypothesis). [assumption].
% 2.76/3.08 3 less_than_or_equal(f(lower_bound),n0) # label(lower_mapping) # label(hypothesis). [assumption].
% 2.76/3.08 4 less_than_or_equal(n0,f(upper_bound)) # label(upper_mapping) # label(hypothesis). [assumption].
% 2.76/3.08 5 less_than_or_equal(A,B) | less_than_or_equal(B,A) # label(totality_of_less) # label(axiom). [assumption].
% 2.76/3.08 6 less_than_or_equal(g(A),upper_bound) | less_than_or_equal(l,A) # label(crossover2_and_g_function1) # label(axiom). [assumption].
% 2.76/3.08 7 less_than_or_equal(f(g(A)),n0) | less_than_or_equal(l,A) # label(crossover3_and_g_function2) # label(axiom). [assumption].
% 2.76/3.08 8 -less_than_or_equal(f(l),n0) | -less_than_or_equal(n0,f(l)) # label(prove_there_is_x_which_crosses) # label(negated_conjecture). [assumption].
% 2.76/3.08 9 -less_than_or_equal(g(A),A) | less_than_or_equal(l,A) # label(crossover4_and_g_function3) # label(axiom). [assumption].
% 2.76/3.08 10 -less_than_or_equal(A,q(B,A)) | less_than_or_equal(A,B) # label(interpolation1) # label(axiom). [assumption].
% 2.76/3.08 11 -less_than_or_equal(q(A,B),A) | less_than_or_equal(B,A) # label(interpolation2) # label(axiom). [assumption].
% 2.76/3.08 12 less_than_or_equal(A,B) | -less_than_or_equal(A,C) | -less_than_or_equal(C,B) # label(transitivity_of_less) # label(axiom). [assumption].
% 2.76/3.08 13 less_than_or_equal(A,l) | -less_than_or_equal(A,upper_bound) | -less_than_or_equal(f(A),n0) # label(crossover1) # label(axiom). [assumption].
% 2.76/3.08 14 less_than_or_equal(f(A),n0) | -less_than_or_equal(A,h(A)) | -less_than_or_equal(lower_bound,A) | -less_than_or_equal(A,upper_bound) # label(continuity1) # label(axiom). [assumption].
% 2.76/3.08 15 less_than_or_equal(n0,f(A)) | -less_than_or_equal(k(A),A) | -less_than_or_equal(lower_bound,A) | -less_than_or_equal(A,upper_bound) # label(continuity3) # label(axiom). [assumption].
% 2.76/3.08 16 less_than_or_equal(f(A),n0) | -less_than_or_equal(B,A) | -less_than_or_equal(f(B),n0) | less_than_or_equal(B,h(A)) | -less_than_or_equal(lower_bound,A) | -less_than_or_equal(A,upper_bound) # label(continuity2) # label(axiom). [assumption].
% 2.76/3.08 17 less_than_or_equal(n0,f(A)) | -less_than_or_equal(A,B) | -less_than_or_equal(n0,f(B)) | less_than_or_equal(k(A),B) | -less_than_or_equal(lower_bound,A) | -less_than_or_equal(A,upper_bound) # label(continuity4) # label(axiom). [assumption].
% 2.76/3.08 19 less_than_or_equal(n0,f(A)) | -less_than_or_equal(A,upper_bound) | less_than_or_equal(k(A),upper_bound) | -less_than_or_equal(lower_bound,A). [factor(17,b,f),unit_del(c,4)].
% 2.76/3.08 20 less_than_or_equal(l,upper_bound). [resolve(9,a,6,a),merge(b)].
% 2.76/3.08 26 less_than_or_equal(A,B) | -less_than_or_equal(C,B) | less_than_or_equal(C,A). [resolve(12,b,5,b)].
% 2.76/3.08 36 less_than_or_equal(g(A),l) | -less_than_or_equal(g(A),upper_bound) | less_than_or_equal(l,A). [resolve(13,c,7,a)].
% 2.76/3.08 37 less_than_or_equal(A,l) | -less_than_or_equal(A,upper_bound) | less_than_or_equal(n0,f(A)). [resolve(13,c,5,b)].
% 2.76/3.08 38 less_than_or_equal(lower_bound,l). [resolve(13,c,3,a),unit_del(b,2)].
% 2.76/3.08 47 less_than_or_equal(f(A),n0) | -less_than_or_equal(g(B),A) | less_than_or_equal(g(B),h(A)) | -less_than_or_equal(lower_bound,A) | -less_than_or_equal(A,upper_bound) | less_than_or_equal(l,B). [resolve(16,c,7,a)].
% 2.76/3.08 62 less_than_or_equal(n0,f(A)) | -less_than_or_equal(A,B) | -less_than_or_equal(n0,f(B)) | less_than_or_equal(k(A),B) | -less_than_or_equal(lower_bound,A) | less_than_or_equal(upper_bound,A). [resolve(17,f,5,b)].
% 2.76/3.08 67 less_than_or_equal(n0,f(l)) | less_than_or_equal(k(l),upper_bound). [resolve(20,a,19,b),unit_del(c,38)].
% 2.76/3.08 305 less_than_or_equal(g(A),l) | less_than_or_equal(l,A). [resolve(36,b,6,a),merge(c)].
% 2.76/3.08 705 less_than_or_equal(f(l),n0) | less_than_or_equal(g(A),h(l)) | less_than_or_equal(l,A). [resolve(47,b,305,a),merge(f),unit_del(c,38),unit_del(d,20)].
% 2.76/3.08 7435 less_than_or_equal(f(l),n0) | less_than_or_equal(l,h(l)). [resolve(705,b,9,a),merge(c)].
% 2.76/3.08 7468 less_than_or_equal(l,h(l)) | less_than_or_equal(A,n0) | less_than_or_equal(f(l),A). [resolve(7435,a,26,b)].
% 2.76/3.08 7644 less_than_or_equal(A,n0) | less_than_or_equal(f(l),A) | less_than_or_equal(f(l),n0). [resolve(7468,a,14,b),unit_del(d,38),unit_del(e,20)].
% 2.76/3.08 7960 less_than_or_equal(A,n0) | less_than_or_equal(f(l),A) | less_than_or_equal(B,n0) | less_than_or_equal(f(l),B). [resolve(7644,c,26,b)].
% 2.76/3.08 7998 less_than_or_equal(A,n0) | less_than_or_equal(f(l),A). [factor(7960,a,c),merge(c)].
% 2.76/3.08 8067 less_than_or_equal(q(A,f(l)),n0) | less_than_or_equal(f(l),A). [resolve(7998,b,10,a)].
% 2.76/3.08 8601 less_than_or_equal(f(l),n0). [resolve(8067,a,11,a),merge(b)].
% 2.76/3.08 8628 -less_than_or_equal(n0,f(l)). [back_unit_del(8),unit_del(a,8601)].
% 2.76/3.08 8841 less_than_or_equal(k(l),upper_bound). [back_unit_del(67),unit_del(a,8628)].
% 2.76/3.08 8872 -less_than_or_equal(k(l),l). [ur(15,a,8628,a,c,38,a,d,20,a)].
% 2.76/3.08 8880 -less_than_or_equal(q(l,k(l)),l). [ur(11,b,8872,a)].
% 2.76/3.08 8881 -less_than_or_equal(k(l),q(l,k(l))). [ur(10,b,8872,a)].
% 2.76/3.08 8914 -less_than_or_equal(upper_bound,l). [ur(12,a,8872,a,b,8841,a)].
% 2.76/3.08 9446 less_than_or_equal(l,q(l,k(l))). [resolve(8880,a,5,b)].
% 2.76/3.08 9719 -less_than_or_equal(n0,f(q(l,k(l)))). [resolve(9446,a,62,b),unit_del(a,8628),unit_del(c,8881),unit_del(d,38),unit_del(e,8914)].
% 2.76/3.08 9764 -less_than_or_equal(upper_bound,q(l,k(l))). [ur(12,a,8881,a,b,8841,a)].
% 2.76/3.08 9774 less_than_or_equal(q(l,k(l)),upper_bound). [resolve(9764,a,5,b)].
% 2.76/3.08 9933 $F. [resolve(9774,a,37,b),unit_del(a,8880),unit_del(b,9719)].
% 2.76/3.08
% 2.76/3.08 % SZS output end Refutation
% 2.76/3.08 ============================== end of proof ==========================
% 2.76/3.08
% 2.76/3.08 ============================== STATISTICS ============================
% 2.76/3.08
% 2.76/3.08 Given=564. Generated=44390. Kept=9932. proofs=1.
% 2.76/3.08 Usable=426. Sos=5643. Demods=0. Limbo=9, Disabled=3871. Hints=0.
% 2.76/3.08 Megabytes=8.53.
% 2.76/3.08 User_CPU=2.08, System_CPU=0.03, Wall_clock=2.
% 2.76/3.08
% 2.76/3.08 ============================== end of statistics =====================
% 2.76/3.08
% 2.76/3.08 ============================== end of search =========================
% 2.76/3.08
% 2.76/3.08 THEOREM PROVED
% 2.76/3.08 % SZS status Unsatisfiable
% 2.76/3.08
% 2.76/3.08 Exiting with 1 proof.
% 2.76/3.08
% 2.76/3.08 Process 17852 exit (max_proofs) Fri Jul 8 06:47:32 2022
% 2.76/3.08 Prover9 interrupted
%------------------------------------------------------------------------------