TSTP Solution File: HEN009-4 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : HEN009-4 : TPTP v8.1.0. Bugfixed v1.2.1.
% 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:55 EDT 2022
% Result : Unsatisfiable 0.47s 1.02s
% Output : Refutation 0.47s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : HEN009-4 : TPTP v8.1.0. Bugfixed v1.2.1.
% 0.03/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:07:58 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.47/1.02 ============================== Prover9 ===============================
% 0.47/1.02 Prover9 (32) version 2009-11A, November 2009.
% 0.47/1.02 Process 15794 was started by sandbox on n015.cluster.edu,
% 0.47/1.02 Fri Jul 1 14:07:58 2022
% 0.47/1.02 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_15641_n015.cluster.edu".
% 0.47/1.02 ============================== end of head ===========================
% 0.47/1.02
% 0.47/1.02 ============================== INPUT =================================
% 0.47/1.02
% 0.47/1.02 % Reading from file /tmp/Prover9_15641_n015.cluster.edu
% 0.47/1.02
% 0.47/1.02 set(prolog_style_variables).
% 0.47/1.02 set(auto2).
% 0.47/1.02 % set(auto2) -> set(auto).
% 0.47/1.02 % set(auto) -> set(auto_inference).
% 0.47/1.02 % set(auto) -> set(auto_setup).
% 0.47/1.02 % set(auto_setup) -> set(predicate_elim).
% 0.47/1.02 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.47/1.02 % set(auto) -> set(auto_limits).
% 0.47/1.02 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.47/1.02 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.47/1.02 % set(auto) -> set(auto_denials).
% 0.47/1.02 % set(auto) -> set(auto_process).
% 0.47/1.02 % set(auto2) -> assign(new_constants, 1).
% 0.47/1.02 % set(auto2) -> assign(fold_denial_max, 3).
% 0.47/1.02 % set(auto2) -> assign(max_weight, "200.000").
% 0.47/1.02 % set(auto2) -> assign(max_hours, 1).
% 0.47/1.02 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.47/1.02 % set(auto2) -> assign(max_seconds, 0).
% 0.47/1.02 % set(auto2) -> assign(max_minutes, 5).
% 0.47/1.02 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.47/1.02 % set(auto2) -> set(sort_initial_sos).
% 0.47/1.02 % set(auto2) -> assign(sos_limit, -1).
% 0.47/1.02 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.47/1.02 % set(auto2) -> assign(max_megs, 400).
% 0.47/1.02 % set(auto2) -> assign(stats, some).
% 0.47/1.02 % set(auto2) -> clear(echo_input).
% 0.47/1.02 % set(auto2) -> set(quiet).
% 0.47/1.02 % set(auto2) -> clear(print_initial_clauses).
% 0.47/1.02 % set(auto2) -> clear(print_given).
% 0.47/1.02 assign(lrs_ticks,-1).
% 0.47/1.02 assign(sos_limit,10000).
% 0.47/1.02 assign(order,kbo).
% 0.47/1.02 set(lex_order_vars).
% 0.47/1.02 clear(print_given).
% 0.47/1.02
% 0.47/1.02 % formulas(sos). % not echoed (16 formulas)
% 0.47/1.02
% 0.47/1.02 ============================== end of input ==========================
% 0.47/1.02
% 0.47/1.02 % From the command line: assign(max_seconds, 300).
% 0.47/1.02
% 0.47/1.02 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.47/1.02
% 0.47/1.02 % Formulas that are not ordinary clauses:
% 0.47/1.02
% 0.47/1.02 ============================== end of process non-clausal formulas ===
% 0.47/1.02
% 0.47/1.02 ============================== PROCESS INITIAL CLAUSES ===============
% 0.47/1.02
% 0.47/1.02 ============================== PREDICATE ELIMINATION =================
% 0.47/1.02
% 0.47/1.02 ============================== end predicate elimination =============
% 0.47/1.02
% 0.47/1.02 Auto_denials:
% 0.47/1.02 % copying label prove_this to answer in negative clause
% 0.47/1.02
% 0.47/1.02 Term ordering decisions:
% 0.47/1.02 Function symbol KB weights: zero=1. a=1. identity=1. divide=1.
% 0.47/1.02
% 0.47/1.02 ============================== end of process initial clauses ========
% 0.47/1.02
% 0.47/1.02 ============================== CLAUSES FOR SEARCH ====================
% 0.47/1.02
% 0.47/1.02 ============================== end of clauses for search =============
% 0.47/1.02
% 0.47/1.02 ============================== SEARCH ================================
% 0.47/1.02
% 0.47/1.02 % Starting search at 0.01 seconds.
% 0.47/1.02
% 0.47/1.02 ============================== PROOF =================================
% 0.47/1.02 % SZS status Unsatisfiable
% 0.47/1.02 % SZS output start Refutation
% 0.47/1.02
% 0.47/1.02 % Proof 1 at 0.02 (+ 0.00) seconds: prove_this.
% 0.47/1.02 % Length of proof is 12.
% 0.47/1.02 % Level of proof is 4.
% 0.47/1.02 % Maximum clause weight is 11.000.
% 0.47/1.02 % Given clauses 26.
% 0.47/1.02
% 0.47/1.02 6 divide(A,A) = zero # label(x_divide_x_is_zero) # label(axiom). [assumption].
% 0.47/1.02 9 divide(identity,a) != divide(identity,divide(identity,divide(identity,a))) # label(prove_this) # label(negated_conjecture) # answer(prove_this). [assumption].
% 0.47/1.02 10 divide(identity,divide(identity,divide(identity,a))) != divide(identity,a) # answer(prove_this). [copy(9),flip(a)].
% 0.47/1.02 12 divide(A,B) != zero | less_equal(A,B) # label(quotient_less_equal2) # label(axiom). [assumption].
% 0.47/1.02 13 -less_equal(A,B) | -less_equal(B,A) | A = B # label(less_equal_and_equal) # label(axiom). [assumption].
% 0.47/1.02 15 -less_equal(divide(A,B),C) | less_equal(divide(A,C),B) # label(property_of_divide1) # label(axiom). [assumption].
% 0.47/1.02 16 -less_equal(A,B) | less_equal(divide(C,B),divide(C,A)) # label(property_of_divide2) # label(axiom). [assumption].
% 0.47/1.02 27 less_equal(A,A). [hyper(12,a,6,a)].
% 0.47/1.02 48 less_equal(divide(A,divide(A,B)),B). [hyper(15,a,27,a)].
% 0.47/1.02 86 less_equal(divide(A,B),divide(A,divide(C,divide(C,B)))). [hyper(16,a,48,a)].
% 0.47/1.02 98 -less_equal(divide(identity,a),divide(identity,divide(identity,divide(identity,a)))) # answer(prove_this). [ur(13,b,48,a,c,10,a(flip))].
% 0.47/1.02 99 $F # answer(prove_this). [resolve(98,a,86,a)].
% 0.47/1.02
% 0.47/1.02 % SZS output end Refutation
% 0.47/1.02 ============================== end of proof ==========================
% 0.47/1.02
% 0.47/1.02 ============================== STATISTICS ============================
% 0.47/1.02
% 0.47/1.02 Given=26. Generated=297. Kept=97. proofs=1.
% 0.47/1.02 Usable=24. Sos=50. Demods=13. Limbo=13, Disabled=25. Hints=0.
% 0.47/1.02 Megabytes=0.09.
% 0.47/1.02 User_CPU=0.02, System_CPU=0.00, Wall_clock=0.
% 0.47/1.02
% 0.47/1.02 ============================== end of statistics =====================
% 0.47/1.02
% 0.47/1.02 ============================== end of search =========================
% 0.47/1.02
% 0.47/1.02 THEOREM PROVED
% 0.47/1.02 % SZS status Unsatisfiable
% 0.47/1.02
% 0.47/1.02 Exiting with 1 proof.
% 0.47/1.02
% 0.47/1.02 Process 15794 exit (max_proofs) Fri Jul 1 14:07:58 2022
% 0.47/1.02 Prover9 interrupted
%------------------------------------------------------------------------------