TSTP Solution File: HEN011-4 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : HEN011-4 : TPTP v8.1.0. Bugfixed v1.2.1.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n026.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:01:00 EDT 2022
% Result : Unsatisfiable 1.10s 1.42s
% Output : Refutation 1.10s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : HEN011-4 : TPTP v8.1.0. Bugfixed v1.2.1.
% 0.07/0.13 % Command : tptp2X_and_run_prover9 %d %s
% 0.13/0.34 % Computer : n026.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:25:49 EDT 2022
% 0.13/0.34 % CPUTime :
% 1.10/1.42 ============================== Prover9 ===============================
% 1.10/1.42 Prover9 (32) version 2009-11A, November 2009.
% 1.10/1.42 Process 26251 was started by sandbox2 on n026.cluster.edu,
% 1.10/1.42 Fri Jul 1 14:25:50 2022
% 1.10/1.42 The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 300 -f /tmp/Prover9_26098_n026.cluster.edu".
% 1.10/1.42 ============================== end of head ===========================
% 1.10/1.42
% 1.10/1.42 ============================== INPUT =================================
% 1.10/1.42
% 1.10/1.42 % Reading from file /tmp/Prover9_26098_n026.cluster.edu
% 1.10/1.42
% 1.10/1.42 set(prolog_style_variables).
% 1.10/1.42 set(auto2).
% 1.10/1.42 % set(auto2) -> set(auto).
% 1.10/1.42 % set(auto) -> set(auto_inference).
% 1.10/1.42 % set(auto) -> set(auto_setup).
% 1.10/1.42 % set(auto_setup) -> set(predicate_elim).
% 1.10/1.42 % set(auto_setup) -> assign(eq_defs, unfold).
% 1.10/1.42 % set(auto) -> set(auto_limits).
% 1.10/1.42 % set(auto_limits) -> assign(max_weight, "100.000").
% 1.10/1.42 % set(auto_limits) -> assign(sos_limit, 20000).
% 1.10/1.42 % set(auto) -> set(auto_denials).
% 1.10/1.42 % set(auto) -> set(auto_process).
% 1.10/1.42 % set(auto2) -> assign(new_constants, 1).
% 1.10/1.42 % set(auto2) -> assign(fold_denial_max, 3).
% 1.10/1.42 % set(auto2) -> assign(max_weight, "200.000").
% 1.10/1.42 % set(auto2) -> assign(max_hours, 1).
% 1.10/1.42 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 1.10/1.42 % set(auto2) -> assign(max_seconds, 0).
% 1.10/1.42 % set(auto2) -> assign(max_minutes, 5).
% 1.10/1.42 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 1.10/1.42 % set(auto2) -> set(sort_initial_sos).
% 1.10/1.42 % set(auto2) -> assign(sos_limit, -1).
% 1.10/1.42 % set(auto2) -> assign(lrs_ticks, 3000).
% 1.10/1.42 % set(auto2) -> assign(max_megs, 400).
% 1.10/1.42 % set(auto2) -> assign(stats, some).
% 1.10/1.42 % set(auto2) -> clear(echo_input).
% 1.10/1.42 % set(auto2) -> set(quiet).
% 1.10/1.42 % set(auto2) -> clear(print_initial_clauses).
% 1.10/1.42 % set(auto2) -> clear(print_given).
% 1.10/1.42 assign(lrs_ticks,-1).
% 1.10/1.42 assign(sos_limit,10000).
% 1.10/1.42 assign(order,kbo).
% 1.10/1.42 set(lex_order_vars).
% 1.10/1.42 clear(print_given).
% 1.10/1.42
% 1.10/1.42 % formulas(sos). % not echoed (18 formulas)
% 1.10/1.42
% 1.10/1.42 ============================== end of input ==========================
% 1.10/1.42
% 1.10/1.42 % From the command line: assign(max_seconds, 300).
% 1.10/1.42
% 1.10/1.42 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 1.10/1.42
% 1.10/1.42 % Formulas that are not ordinary clauses:
% 1.10/1.42
% 1.10/1.42 ============================== end of process non-clausal formulas ===
% 1.10/1.42
% 1.10/1.42 ============================== PROCESS INITIAL CLAUSES ===============
% 1.10/1.42
% 1.10/1.42 ============================== PREDICATE ELIMINATION =================
% 1.10/1.42
% 1.10/1.42 ============================== end predicate elimination =============
% 1.10/1.42
% 1.10/1.42 Auto_denials:
% 1.10/1.42 % copying label prove_this to answer in negative clause
% 1.10/1.42
% 1.10/1.42 Term ordering decisions:
% 1.10/1.42 Function symbol KB weights: identity=1. zero=1. a=1. b=1. divide=1.
% 1.10/1.42
% 1.10/1.42 ============================== end of process initial clauses ========
% 1.10/1.42
% 1.10/1.42 ============================== CLAUSES FOR SEARCH ====================
% 1.10/1.42
% 1.10/1.42 ============================== end of clauses for search =============
% 1.10/1.42
% 1.10/1.42 ============================== SEARCH ================================
% 1.10/1.42
% 1.10/1.42 % Starting search at 0.01 seconds.
% 1.10/1.42
% 1.10/1.42 ============================== PROOF =================================
% 1.10/1.42 % SZS status Unsatisfiable
% 1.10/1.42 % SZS output start Refutation
% 1.10/1.42
% 1.10/1.42 % Proof 1 at 0.33 (+ 0.02) seconds: prove_this.
% 1.10/1.42 % Length of proof is 20.
% 1.10/1.42 % Level of proof is 6.
% 1.10/1.42 % Maximum clause weight is 19.000.
% 1.10/1.42 % Given clauses 131.
% 1.10/1.42
% 1.10/1.42 3 less_equal(divide(A,B),A) # label(quotient_smaller_than_numerator) # label(axiom). [assumption].
% 1.10/1.42 6 divide(A,A) = zero # label(x_divide_x_is_zero) # label(axiom). [assumption].
% 1.10/1.42 9 less_equal(divide(divide(A,B),divide(C,B)),divide(divide(A,C),B)) # label(quotient_property) # label(axiom). [assumption].
% 1.10/1.42 11 divide(divide(identity,a),divide(identity,divide(identity,b))) != divide(divide(identity,b),divide(identity,divide(identity,a))) # label(prove_this) # label(negated_conjecture) # answer(prove_this). [assumption].
% 1.10/1.42 12 divide(divide(identity,b),divide(identity,divide(identity,a))) != divide(divide(identity,a),divide(identity,divide(identity,b))) # answer(prove_this). [copy(11),flip(a)].
% 1.10/1.42 14 divide(A,B) != zero | less_equal(A,B) # label(quotient_less_equal2) # label(axiom). [assumption].
% 1.10/1.42 15 -less_equal(A,B) | -less_equal(B,A) | A = B # label(less_equal_and_equal) # label(axiom). [assumption].
% 1.10/1.42 16 -less_equal(A,B) | -less_equal(B,C) | less_equal(A,C) # label(transitivity_of_less_equal) # label(axiom). [assumption].
% 1.10/1.42 17 -less_equal(divide(A,B),C) | less_equal(divide(A,C),B) # label(property_of_divide1) # label(axiom). [assumption].
% 1.10/1.42 18 -less_equal(A,B) | less_equal(divide(C,B),divide(C,A)) # label(property_of_divide2) # label(axiom). [assumption].
% 1.10/1.42 37 less_equal(A,A). [hyper(14,a,6,a)].
% 1.10/1.42 49 less_equal(divide(A,B),divide(A,divide(B,C))). [hyper(18,a,3,a)].
% 1.10/1.42 58 less_equal(divide(A,divide(A,B)),B). [hyper(17,a,37,a)].
% 1.10/1.42 106 less_equal(divide(A,B),divide(A,divide(C,divide(C,B)))). [hyper(18,a,58,a)].
% 1.10/1.42 179 less_equal(divide(divide(A,B),C),divide(divide(A,C),B)). [hyper(16,a,49,a,b,9,a)].
% 1.10/1.42 694 divide(A,divide(A,divide(A,B))) = divide(A,B). [hyper(15,a,58,a,b,106,a)].
% 1.10/1.42 1516 divide(divide(A,B),C) = divide(divide(A,C),B). [hyper(15,a,179,a,b,179,a)].
% 1.10/1.42 3681 divide(divide(identity,b),divide(identity,divide(identity,a))) != divide(divide(identity,a),b) # answer(prove_this). [para(1516(a,1),12(a,2)),rewrite([694(16),1516(14)])].
% 1.10/1.42 3753 divide(divide(A,B),divide(A,divide(A,C))) = divide(divide(A,C),B). [para(694(a,1),1516(a,1,1)),flip(a)].
% 1.10/1.42 3754 $F # answer(prove_this). [resolve(3753,a,3681,a)].
% 1.10/1.42
% 1.10/1.42 % SZS output end Refutation
% 1.10/1.42 ============================== end of proof ==========================
% 1.10/1.42
% 1.10/1.42 ============================== STATISTICS ============================
% 1.10/1.42
% 1.10/1.42 Given=131. Generated=13408. Kept=3752. proofs=1.
% 1.10/1.42 Usable=108. Sos=3172. Demods=124. Limbo=76, Disabled=413. Hints=0.
% 1.10/1.42 Megabytes=2.75.
% 1.10/1.42 User_CPU=0.33, System_CPU=0.02, Wall_clock=0.
% 1.10/1.42
% 1.10/1.42 ============================== end of statistics =====================
% 1.10/1.42
% 1.10/1.42 ============================== end of search =========================
% 1.10/1.42
% 1.10/1.42 THEOREM PROVED
% 1.10/1.42 % SZS status Unsatisfiable
% 1.10/1.42
% 1.10/1.42 Exiting with 1 proof.
% 1.10/1.42
% 1.10/1.42 Process 26251 exit (max_proofs) Fri Jul 1 14:25:50 2022
% 1.10/1.42 Prover9 interrupted
%------------------------------------------------------------------------------