TSTP Solution File: HEN010-6 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : HEN010-6 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n003.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.71s 0.99s
% Output : Refutation 0.71s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : HEN010-6 : TPTP v8.1.0. Released v1.0.0.
% 0.06/0.12 % Command : tptp2X_and_run_prover9 %d %s
% 0.12/0.33 % Computer : n003.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 1 14:23:37 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.71/0.99 ============================== Prover9 ===============================
% 0.71/0.99 Prover9 (32) version 2009-11A, November 2009.
% 0.71/0.99 Process 14162 was started by sandbox on n003.cluster.edu,
% 0.71/0.99 Fri Jul 1 14:23:38 2022
% 0.71/0.99 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_14009_n003.cluster.edu".
% 0.71/0.99 ============================== end of head ===========================
% 0.71/0.99
% 0.71/0.99 ============================== INPUT =================================
% 0.71/0.99
% 0.71/0.99 % Reading from file /tmp/Prover9_14009_n003.cluster.edu
% 0.71/0.99
% 0.71/0.99 set(prolog_style_variables).
% 0.71/0.99 set(auto2).
% 0.71/0.99 % set(auto2) -> set(auto).
% 0.71/0.99 % set(auto) -> set(auto_inference).
% 0.71/0.99 % set(auto) -> set(auto_setup).
% 0.71/0.99 % set(auto_setup) -> set(predicate_elim).
% 0.71/0.99 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.71/0.99 % set(auto) -> set(auto_limits).
% 0.71/0.99 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.71/0.99 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.71/0.99 % set(auto) -> set(auto_denials).
% 0.71/0.99 % set(auto) -> set(auto_process).
% 0.71/0.99 % set(auto2) -> assign(new_constants, 1).
% 0.71/0.99 % set(auto2) -> assign(fold_denial_max, 3).
% 0.71/0.99 % set(auto2) -> assign(max_weight, "200.000").
% 0.71/0.99 % set(auto2) -> assign(max_hours, 1).
% 0.71/0.99 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.71/0.99 % set(auto2) -> assign(max_seconds, 0).
% 0.71/0.99 % set(auto2) -> assign(max_minutes, 5).
% 0.71/0.99 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.71/0.99 % set(auto2) -> set(sort_initial_sos).
% 0.71/0.99 % set(auto2) -> assign(sos_limit, -1).
% 0.71/0.99 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.71/0.99 % set(auto2) -> assign(max_megs, 400).
% 0.71/0.99 % set(auto2) -> assign(stats, some).
% 0.71/0.99 % set(auto2) -> clear(echo_input).
% 0.71/0.99 % set(auto2) -> set(quiet).
% 0.71/0.99 % set(auto2) -> clear(print_initial_clauses).
% 0.71/0.99 % set(auto2) -> clear(print_given).
% 0.71/0.99 assign(lrs_ticks,-1).
% 0.71/0.99 assign(sos_limit,10000).
% 0.71/0.99 assign(order,kbo).
% 0.71/0.99 set(lex_order_vars).
% 0.71/0.99 clear(print_given).
% 0.71/0.99
% 0.71/0.99 % formulas(sos). % not echoed (16 formulas)
% 0.71/0.99
% 0.71/0.99 ============================== end of input ==========================
% 0.71/0.99
% 0.71/0.99 % From the command line: assign(max_seconds, 300).
% 0.71/0.99
% 0.71/0.99 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.71/0.99
% 0.71/0.99 % Formulas that are not ordinary clauses:
% 0.71/0.99
% 0.71/0.99 ============================== end of process non-clausal formulas ===
% 0.71/0.99
% 0.71/0.99 ============================== PROCESS INITIAL CLAUSES ===============
% 0.71/0.99
% 0.71/0.99 ============================== PREDICATE ELIMINATION =================
% 0.71/0.99
% 0.71/0.99 ============================== end predicate elimination =============
% 0.71/0.99
% 0.71/0.99 Auto_denials:
% 0.71/0.99 % copying label prove_property_of_inversion to answer in negative clause
% 0.71/0.99
% 0.71/0.99 Term ordering decisions:
% 0.71/0.99 Function symbol KB weights: zero=1. identity=1. a=1. divide=1.
% 0.71/0.99
% 0.71/0.99 ============================== end of process initial clauses ========
% 0.71/0.99
% 0.71/0.99 ============================== CLAUSES FOR SEARCH ====================
% 0.71/0.99
% 0.71/0.99 ============================== end of clauses for search =============
% 0.71/0.99
% 0.71/0.99 ============================== SEARCH ================================
% 0.71/0.99
% 0.71/0.99 % Starting search at 0.01 seconds.
% 0.71/0.99
% 0.71/0.99 ============================== PROOF =================================
% 0.71/0.99 % SZS status Unsatisfiable
% 0.71/0.99 % SZS output start Refutation
% 0.71/0.99
% 0.71/0.99 % Proof 1 at 0.02 (+ 0.00) seconds: prove_property_of_inversion.
% 0.71/0.99 % Length of proof is 15.
% 0.71/0.99 % Level of proof is 5.
% 0.71/0.99 % Maximum clause weight is 15.000.
% 0.71/0.99 % Given clauses 44.
% 0.71/0.99
% 0.71/0.99 1 less_equal(zero,A) # label(zero_is_smallest) # label(axiom). [assumption].
% 0.71/0.99 3 less_equal(divide(A,B),A) # label(quotient_smaller_than_numerator) # label(axiom). [assumption].
% 0.71/0.99 6 divide(A,A) = zero # label(x_divide_x_is_zero) # label(axiom). [assumption].
% 0.71/0.99 8 divide(identity,divide(identity,divide(identity,A))) = divide(identity,A) # label(one_inversion_equals_three) # label(axiom). [assumption].
% 0.71/0.99 9 less_equal(divide(divide(A,B),divide(C,B)),divide(divide(A,C),B)) # label(quotient_property) # label(axiom). [assumption].
% 0.71/0.99 10 divide(identity,a) != divide(divide(identity,a),divide(identity,divide(identity,a))) # label(prove_property_of_inversion) # label(negated_conjecture) # answer(prove_property_of_inversion). [assumption].
% 0.71/0.99 11 divide(divide(identity,a),divide(identity,divide(identity,a))) != divide(identity,a) # answer(prove_property_of_inversion). [copy(10),flip(a)].
% 0.71/0.99 13 divide(A,B) != zero | less_equal(A,B) # label(quotient_less_equal2) # label(axiom). [assumption].
% 0.71/0.99 14 -less_equal(A,B) | -less_equal(B,A) | A = B # label(less_equal_and_equal) # label(axiom). [assumption].
% 0.71/0.99 23 less_equal(divide(divide(A,divide(A,B)),divide(B,divide(A,B))),zero). [para(6(a,1),9(a,2))].
% 0.71/0.99 34 -less_equal(divide(identity,a),divide(divide(identity,a),divide(identity,divide(identity,a)))) # answer(prove_property_of_inversion). [ur(14,b,3,a,c,11,a(flip))].
% 0.71/0.99 47 divide(divide(identity,a),divide(divide(identity,a),divide(identity,divide(identity,a)))) != zero # answer(prove_property_of_inversion). [ur(13,b,34,a)].
% 0.71/0.99 49 -less_equal(divide(divide(identity,a),divide(divide(identity,a),divide(identity,divide(identity,a)))),zero) # answer(prove_property_of_inversion). [ur(14,b,1,a,c,47,a)].
% 0.71/0.99 111 less_equal(divide(divide(identity,A),divide(divide(identity,A),divide(identity,divide(identity,A)))),zero). [para(8(a,1),23(a,1,1))].
% 0.71/0.99 112 $F # answer(prove_property_of_inversion). [resolve(111,a,49,a)].
% 0.71/0.99
% 0.71/0.99 % SZS output end Refutation
% 0.71/0.99 ============================== end of proof ==========================
% 0.71/0.99
% 0.71/0.99 ============================== STATISTICS ============================
% 0.71/0.99
% 0.71/0.99 Given=44. Generated=395. Kept=110. proofs=1.
% 0.71/0.99 Usable=32. Sos=24. Demods=11. Limbo=5, Disabled=64. Hints=0.
% 0.71/0.99 Megabytes=0.11.
% 0.71/0.99 User_CPU=0.02, System_CPU=0.00, Wall_clock=0.
% 0.71/0.99
% 0.71/0.99 ============================== end of statistics =====================
% 0.71/0.99
% 0.71/0.99 ============================== end of search =========================
% 0.71/0.99
% 0.71/0.99 THEOREM PROVED
% 0.71/0.99 % SZS status Unsatisfiable
% 0.71/0.99
% 0.71/0.99 Exiting with 1 proof.
% 0.71/0.99
% 0.71/0.99 Process 14162 exit (max_proofs) Fri Jul 1 14:23:38 2022
% 0.71/0.99 Prover9 interrupted
%------------------------------------------------------------------------------