TSTP Solution File: HEN010-2 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : HEN010-2 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n015.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:57 EDT 2022
% Result : Unsatisfiable 0.75s 1.08s
% Output : Refutation 0.75s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : HEN010-2 : TPTP v8.1.0. Released v1.0.0.
% 0.11/0.13 % Command : tptp2X_and_run_prover9 %d %s
% 0.13/0.34 % Computer : n015.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 : Fri Jul 1 14:31:58 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.75/1.08 ============================== Prover9 ===============================
% 0.75/1.08 Prover9 (32) version 2009-11A, November 2009.
% 0.75/1.08 Process 14019 was started by sandbox on n015.cluster.edu,
% 0.75/1.08 Fri Jul 1 14:31:59 2022
% 0.75/1.08 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_13747_n015.cluster.edu".
% 0.75/1.08 ============================== end of head ===========================
% 0.75/1.08
% 0.75/1.08 ============================== INPUT =================================
% 0.75/1.08
% 0.75/1.08 % Reading from file /tmp/Prover9_13747_n015.cluster.edu
% 0.75/1.08
% 0.75/1.08 set(prolog_style_variables).
% 0.75/1.08 set(auto2).
% 0.75/1.08 % set(auto2) -> set(auto).
% 0.75/1.08 % set(auto) -> set(auto_inference).
% 0.75/1.08 % set(auto) -> set(auto_setup).
% 0.75/1.08 % set(auto_setup) -> set(predicate_elim).
% 0.75/1.08 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.75/1.08 % set(auto) -> set(auto_limits).
% 0.75/1.08 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.75/1.08 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.75/1.08 % set(auto) -> set(auto_denials).
% 0.75/1.08 % set(auto) -> set(auto_process).
% 0.75/1.08 % set(auto2) -> assign(new_constants, 1).
% 0.75/1.08 % set(auto2) -> assign(fold_denial_max, 3).
% 0.75/1.08 % set(auto2) -> assign(max_weight, "200.000").
% 0.75/1.08 % set(auto2) -> assign(max_hours, 1).
% 0.75/1.08 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.75/1.08 % set(auto2) -> assign(max_seconds, 0).
% 0.75/1.08 % set(auto2) -> assign(max_minutes, 5).
% 0.75/1.08 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.75/1.08 % set(auto2) -> set(sort_initial_sos).
% 0.75/1.08 % set(auto2) -> assign(sos_limit, -1).
% 0.75/1.08 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.75/1.08 % set(auto2) -> assign(max_megs, 400).
% 0.75/1.08 % set(auto2) -> assign(stats, some).
% 0.75/1.08 % set(auto2) -> clear(echo_input).
% 0.75/1.08 % set(auto2) -> set(quiet).
% 0.75/1.08 % set(auto2) -> clear(print_initial_clauses).
% 0.75/1.08 % set(auto2) -> clear(print_given).
% 0.75/1.08 assign(lrs_ticks,-1).
% 0.75/1.08 assign(sos_limit,10000).
% 0.75/1.08 assign(order,kbo).
% 0.75/1.08 set(lex_order_vars).
% 0.75/1.08 clear(print_given).
% 0.75/1.08
% 0.75/1.08 % formulas(sos). % not echoed (22 formulas)
% 0.75/1.08
% 0.75/1.08 ============================== end of input ==========================
% 0.75/1.08
% 0.75/1.08 % From the command line: assign(max_seconds, 300).
% 0.75/1.08
% 0.75/1.08 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.75/1.08
% 0.75/1.08 % Formulas that are not ordinary clauses:
% 0.75/1.08
% 0.75/1.08 ============================== end of process non-clausal formulas ===
% 0.75/1.08
% 0.75/1.08 ============================== PROCESS INITIAL CLAUSES ===============
% 0.75/1.08
% 0.75/1.08 ============================== PREDICATE ELIMINATION =================
% 0.75/1.08
% 0.75/1.08 ============================== end predicate elimination =============
% 0.75/1.08
% 0.75/1.08 Auto_denials:
% 0.75/1.08 % copying label prove_idQa_equals_idQa_Q__idQ_idQa to answer in negative clause
% 0.75/1.08
% 0.75/1.08 Term ordering decisions:
% 0.75/1.08 Function symbol KB weights: zero=1. identity=1. idQa=1. idQ_idQa=1. a=1. idQa_Q__idQ_idQa=1. divide=1.
% 0.75/1.08
% 0.75/1.08 ============================== end of process initial clauses ========
% 0.75/1.08
% 0.75/1.08 ============================== CLAUSES FOR SEARCH ====================
% 0.75/1.08
% 0.75/1.08 ============================== end of clauses for search =============
% 0.75/1.08
% 0.75/1.08 ============================== SEARCH ================================
% 0.75/1.08
% 0.75/1.08 % Starting search at 0.01 seconds.
% 0.75/1.08
% 0.75/1.08 ============================== PROOF =================================
% 0.75/1.08 % SZS status Unsatisfiable
% 0.75/1.08 % SZS output start Refutation
% 0.75/1.08
% 0.75/1.08 % Proof 1 at 0.06 (+ 0.00) seconds: prove_idQa_equals_idQa_Q__idQ_idQa.
% 0.75/1.08 % Length of proof is 22.
% 0.75/1.08 % Level of proof is 4.
% 0.75/1.08 % Maximum clause weight is 23.000.
% 0.75/1.08 % Given clauses 33.
% 0.75/1.08
% 0.75/1.08 5 quotient(A,A,zero) # label(x_divide_x_is_zero) # label(axiom). [assumption].
% 0.75/1.08 6 quotient(A,zero,A) # label(x_divde_zero_is_x) # label(axiom). [assumption].
% 0.75/1.08 7 quotient(identity,a,idQa) # label(identity_divide_a) # label(hypothesis). [assumption].
% 0.75/1.08 8 quotient(identity,idQa,idQ_idQa) # label(identity_divide_idQa) # label(hypothesis). [assumption].
% 0.75/1.08 9 quotient(idQa,idQ_idQa,idQa_Q__idQ_idQa) # label(identity_divide_idQ_idQa) # label(hypothesis). [assumption].
% 0.75/1.08 10 quotient(A,B,divide(A,B)) # label(closure) # label(axiom). [assumption].
% 0.75/1.08 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.75/1.08 12 idQa_Q__idQ_idQa != idQa # answer(prove_idQa_equals_idQa_Q__idQ_idQa). [copy(11),flip(a)].
% 0.75/1.08 15 -quotient(A,B,C) | less_equal(C,A) # label(divisor_existence) # label(axiom). [assumption].
% 0.75/1.08 16 -less_equal(A,B) | -less_equal(B,A) | A = B # label(less_equal_and_equal) # label(axiom). [assumption].
% 0.75/1.08 18 -quotient(A,B,C) | -quotient(A,B,D) | C = D # label(well_defined) # label(axiom). [assumption].
% 0.75/1.08 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.75/1.08 22 -quotient(identity,A,B) | -quotient(identity,B,C) | -quotient(identity,C,D) | B = D # label(one_inversion_equals_three) # label(axiom). [assumption].
% 0.75/1.08 23 -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.75/1.08 26 less_equal(idQa_Q__idQ_idQa,idQa). [hyper(15,a,9,a)].
% 0.75/1.08 27 divide(idQa,idQ_idQa) = idQa_Q__idQ_idQa. [hyper(18,a,10,a,b,9,a)].
% 0.75/1.08 28 divide(identity,idQa) = idQ_idQa. [hyper(18,a,10,a,b,8,a)].
% 0.75/1.08 44 divide(identity,idQ_idQa) = idQa. [hyper(22,a,7,a,b,10,a,c,10,a),rewrite([28(5)]),flip(a)].
% 0.75/1.08 61 less_equal(divide(idQa,idQa_Q__idQ_idQa),zero). [hyper(23,a,8,a,b,10,a,c,10,a,d,10,a,e,5,a),rewrite([44(3),27(4)])].
% 0.75/1.08 75 -less_equal(idQa,idQa_Q__idQ_idQa) # answer(prove_idQa_equals_idQa_Q__idQ_idQa). [ur(16,b,26,a,c,12,a(flip))].
% 0.75/1.08 125 -less_equal(divide(idQa,idQa_Q__idQ_idQa),zero) # answer(prove_idQa_equals_idQa_Q__idQ_idQa). [ur(19,a,10,a,c,6,a,d,75,a)].
% 0.75/1.08 126 $F # answer(prove_idQa_equals_idQa_Q__idQ_idQa). [resolve(125,a,61,a)].
% 0.75/1.08
% 0.75/1.08 % SZS output end Refutation
% 0.75/1.08 ============================== end of proof ==========================
% 0.75/1.08
% 0.75/1.08 ============================== STATISTICS ============================
% 0.75/1.08
% 0.75/1.08 Given=33. Generated=2534. Kept=124. proofs=1.
% 0.75/1.08 Usable=33. Sos=63. Demods=11. Limbo=21, Disabled=28. Hints=0.
% 0.75/1.08 Megabytes=0.11.
% 0.75/1.08 User_CPU=0.06, System_CPU=0.00, Wall_clock=0.
% 0.75/1.08
% 0.75/1.08 ============================== end of statistics =====================
% 0.75/1.08
% 0.75/1.08 ============================== end of search =========================
% 0.75/1.08
% 0.75/1.08 THEOREM PROVED
% 0.75/1.08 % SZS status Unsatisfiable
% 0.75/1.08
% 0.75/1.08 Exiting with 1 proof.
% 0.75/1.08
% 0.75/1.08 Process 14019 exit (max_proofs) Fri Jul 1 14:31:59 2022
% 0.75/1.08 Prover9 interrupted
%------------------------------------------------------------------------------