TSTP Solution File: HEN010-7 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : HEN010-7 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n019.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 13:00:58 EDT 2022
% Result : Unsatisfiable 0.81s 1.09s
% Output : Refutation 0.81s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.12 % Problem : HEN010-7 : TPTP v8.1.0. Released v1.0.0.
% 0.04/0.13 % Command : tptp2X_and_run_prover9 %d %s
% 0.12/0.34 % Computer : n019.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 600
% 0.12/0.34 % DateTime : Fri Jul 1 13:22:53 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.81/1.09 ============================== Prover9 ===============================
% 0.81/1.09 Prover9 (32) version 2009-11A, November 2009.
% 0.81/1.09 Process 5329 was started by sandbox on n019.cluster.edu,
% 0.81/1.09 Fri Jul 1 13:22:54 2022
% 0.81/1.09 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_5176_n019.cluster.edu".
% 0.81/1.09 ============================== end of head ===========================
% 0.81/1.09
% 0.81/1.09 ============================== INPUT =================================
% 0.81/1.09
% 0.81/1.09 % Reading from file /tmp/Prover9_5176_n019.cluster.edu
% 0.81/1.09
% 0.81/1.09 set(prolog_style_variables).
% 0.81/1.09 set(auto2).
% 0.81/1.09 % set(auto2) -> set(auto).
% 0.81/1.09 % set(auto) -> set(auto_inference).
% 0.81/1.09 % set(auto) -> set(auto_setup).
% 0.81/1.09 % set(auto_setup) -> set(predicate_elim).
% 0.81/1.09 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.81/1.09 % set(auto) -> set(auto_limits).
% 0.81/1.09 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.81/1.09 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.81/1.09 % set(auto) -> set(auto_denials).
% 0.81/1.09 % set(auto) -> set(auto_process).
% 0.81/1.09 % set(auto2) -> assign(new_constants, 1).
% 0.81/1.09 % set(auto2) -> assign(fold_denial_max, 3).
% 0.81/1.09 % set(auto2) -> assign(max_weight, "200.000").
% 0.81/1.09 % set(auto2) -> assign(max_hours, 1).
% 0.81/1.09 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.81/1.09 % set(auto2) -> assign(max_seconds, 0).
% 0.81/1.09 % set(auto2) -> assign(max_minutes, 5).
% 0.81/1.09 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.81/1.09 % set(auto2) -> set(sort_initial_sos).
% 0.81/1.09 % set(auto2) -> assign(sos_limit, -1).
% 0.81/1.09 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.81/1.09 % set(auto2) -> assign(max_megs, 400).
% 0.81/1.09 % set(auto2) -> assign(stats, some).
% 0.81/1.09 % set(auto2) -> clear(echo_input).
% 0.81/1.09 % set(auto2) -> set(quiet).
% 0.81/1.09 % set(auto2) -> clear(print_initial_clauses).
% 0.81/1.09 % set(auto2) -> clear(print_given).
% 0.81/1.09 assign(lrs_ticks,-1).
% 0.81/1.09 assign(sos_limit,10000).
% 0.81/1.09 assign(order,kbo).
% 0.81/1.09 set(lex_order_vars).
% 0.81/1.09 clear(print_given).
% 0.81/1.09
% 0.81/1.09 % formulas(sos). % not echoed (21 formulas)
% 0.81/1.09
% 0.81/1.09 ============================== end of input ==========================
% 0.81/1.09
% 0.81/1.09 % From the command line: assign(max_seconds, 300).
% 0.81/1.09
% 0.81/1.09 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.81/1.09
% 0.81/1.09 % Formulas that are not ordinary clauses:
% 0.81/1.09
% 0.81/1.09 ============================== end of process non-clausal formulas ===
% 0.81/1.09
% 0.81/1.09 ============================== PROCESS INITIAL CLAUSES ===============
% 0.81/1.09
% 0.81/1.09 ============================== PREDICATE ELIMINATION =================
% 0.81/1.09
% 0.81/1.09 ============================== end predicate elimination =============
% 0.81/1.09
% 0.81/1.09 Auto_denials:
% 0.81/1.09 % copying label prove_idQa_equals_idQa_Q__idQ_idQa to answer in negative clause
% 0.81/1.09
% 0.81/1.09 Term ordering decisions:
% 0.81/1.09 Function symbol KB weights: zero=1. identity=1. idQa=1. idQ_idQa=1. a=1. idQa_Q__idQ_idQa=1. divide=1.
% 0.81/1.09
% 0.81/1.09 ============================== end of process initial clauses ========
% 0.81/1.09
% 0.81/1.09 ============================== CLAUSES FOR SEARCH ====================
% 0.81/1.09
% 0.81/1.09 ============================== end of clauses for search =============
% 0.81/1.09
% 0.81/1.09 ============================== SEARCH ================================
% 0.81/1.09
% 0.81/1.09 % Starting search at 0.01 seconds.
% 0.81/1.09
% 0.81/1.09 ============================== PROOF =================================
% 0.81/1.09 % SZS status Unsatisfiable
% 0.81/1.09 % SZS output start Refutation
% 0.81/1.09
% 0.81/1.09 % Proof 1 at 0.11 (+ 0.01) seconds: prove_idQa_equals_idQa_Q__idQ_idQa.
% 0.81/1.09 % Length of proof is 34.
% 0.81/1.09 % Level of proof is 6.
% 0.81/1.09 % Maximum clause weight is 23.000.
% 0.81/1.09 % Given clauses 57.
% 0.81/1.09
% 0.81/1.09 2 less_equal(A,identity) # label(identity_is_largest) # label(axiom). [assumption].
% 0.81/1.09 5 quotient(A,A,zero) # label(x_divide_x_is_zero) # label(axiom). [assumption].
% 0.81/1.09 6 quotient(A,zero,A) # label(x_divde_zero_is_x) # label(axiom). [assumption].
% 0.81/1.09 7 quotient(identity,a,idQa) # label(identity_divide_a) # label(hypothesis). [assumption].
% 0.81/1.09 8 quotient(identity,idQa,idQ_idQa) # label(identity_divide_idQa) # label(hypothesis). [assumption].
% 0.81/1.09 9 quotient(idQa,idQ_idQa,idQa_Q__idQ_idQa) # label(identity_divide_idQ_idQa) # label(hypothesis). [assumption].
% 0.81/1.09 10 quotient(A,B,divide(A,B)) # label(closure) # label(axiom). [assumption].
% 0.81/1.09 11 idQa != idQa_Q__idQ_idQa # label(prove_idQa_equals_idQa_Q__idQ_idQa) # label(negated_conjecture) # answer(prove_idQa_equals_idQa_Q__idQ_idQa). [assumption].
% 0.81/1.09 12 idQa_Q__idQ_idQa != idQa # answer(prove_idQa_equals_idQa_Q__idQ_idQa). [copy(11),flip(a)].
% 0.81/1.09 13 -less_equal(A,B) | quotient(A,B,zero) # label(quotient_less_equal) # label(axiom). [assumption].
% 0.81/1.09 14 -quotient(A,B,zero) | less_equal(A,B) # label(less_equal_quotient) # label(axiom). [assumption].
% 0.81/1.09 15 -quotient(A,B,C) | less_equal(C,A) # label(divisor_existence) # label(axiom). [assumption].
% 0.81/1.09 16 -less_equal(A,B) | -less_equal(B,A) | A = B # label(less_equal_and_equal) # label(axiom). [assumption].
% 0.81/1.09 17 -less_equal(A,B) | -less_equal(B,C) | less_equal(A,C) # label(transitivity_of_less_equal) # label(axiom). [assumption].
% 0.81/1.09 18 -quotient(A,B,C) | -quotient(A,B,D) | C = D # label(well_defined) # label(axiom). [assumption].
% 0.81/1.09 19 -quotient(A,B,C) | -less_equal(C,D) | -quotient(A,D,E) | less_equal(E,B) # label(xQyLEz_implies_xQzLEy) # label(axiom). [assumption].
% 0.81/1.09 21 -less_equal(A,B) | -quotient(A,C,D) | -quotient(B,C,E) | less_equal(D,E) # label(xLEy_implies_xQzLEyQz) # label(axiom). [assumption].
% 0.81/1.09 22 -quotient(A,B,C) | -quotient(B,D,E) | -quotient(A,D,F) | -quotient(F,E,V6) | -quotient(C,D,V7) | less_equal(V6,V7) # label(quotient_property) # label(axiom). [assumption].
% 0.81/1.09 23 less_equal(A,A). [hyper(14,a,5,a)].
% 0.81/1.09 24 less_equal(divide(A,B),A). [hyper(15,a,10,a)].
% 0.81/1.09 25 less_equal(idQa_Q__idQ_idQa,idQa). [hyper(15,a,9,a)].
% 0.81/1.09 27 divide(identity,idQa) = idQ_idQa. [hyper(18,a,10,a,b,8,a)].
% 0.81/1.09 28 divide(identity,a) = idQa. [hyper(18,a,10,a,b,7,a)].
% 0.81/1.09 29 divide(A,zero) = A. [hyper(18,a,10,a,b,6,a)].
% 0.81/1.09 39 less_equal(divide(A,a),idQa). [hyper(21,a,2,a,b,10,a,c,7,a)].
% 0.81/1.09 52 less_equal(idQa,divide(idQa,a)). [hyper(22,a,10,a,b,5,a,c,7,a,d,10,a,e,10,a),rewrite([29(3),28(4)])].
% 0.81/1.09 66 less_equal(idQ_idQa,a). [hyper(19,a,7,a,b,23,a,c,10,a),rewrite([27(3)])].
% 0.81/1.09 72 -less_equal(idQa,idQa_Q__idQ_idQa) # answer(prove_idQa_equals_idQa_Q__idQ_idQa). [ur(16,b,25,a,c,12,a(flip))].
% 0.81/1.09 78 quotient(idQ_idQa,a,zero). [hyper(13,a,66,a)].
% 0.81/1.09 88 less_equal(divide(idQa,a),divide(idQa_Q__idQ_idQa,a)). [hyper(22,a,9,a,b,78,a,c,10,a,d,10,a,e,10,a),rewrite([29(5)])].
% 0.81/1.09 131 -less_equal(idQa,divide(idQa_Q__idQ_idQa,A)) # answer(prove_idQa_equals_idQa_Q__idQ_idQa). [ur(17,b,24,a,c,72,a)].
% 0.81/1.09 336 divide(idQa,a) = idQa. [hyper(16,a,39,a,b,52,a)].
% 0.81/1.09 337 less_equal(idQa,divide(idQa_Q__idQ_idQa,a)). [back_rewrite(88),rewrite([336(3)])].
% 0.81/1.09 338 $F # answer(prove_idQa_equals_idQa_Q__idQ_idQa). [resolve(337,a,131,a)].
% 0.81/1.09
% 0.81/1.09 % SZS output end Refutation
% 0.81/1.09 ============================== end of proof ==========================
% 0.81/1.09
% 0.81/1.09 ============================== STATISTICS ============================
% 0.81/1.09
% 0.81/1.09 Given=57. Generated=5614. Kept=336. proofs=1.
% 0.81/1.09 Usable=54. Sos=214. Demods=12. Limbo=1, Disabled=87. Hints=0.
% 0.81/1.09 Megabytes=0.21.
% 0.81/1.09 User_CPU=0.11, System_CPU=0.01, Wall_clock=0.
% 0.81/1.09
% 0.81/1.09 ============================== end of statistics =====================
% 0.81/1.09
% 0.81/1.09 ============================== end of search =========================
% 0.81/1.09
% 0.81/1.09 THEOREM PROVED
% 0.81/1.09 % SZS status Unsatisfiable
% 0.81/1.09
% 0.81/1.09 Exiting with 1 proof.
% 0.81/1.09
% 0.81/1.09 Process 5329 exit (max_proofs) Fri Jul 1 13:22:54 2022
% 0.81/1.09 Prover9 interrupted
%------------------------------------------------------------------------------