TSTP Solution File: HEN005-1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : HEN005-1 : TPTP v8.1.0. Bugfixed v1.2.1.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n011.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:47 EDT 2022
% Result : Unsatisfiable 0.45s 1.02s
% Output : Refutation 0.45s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : HEN005-1 : TPTP v8.1.0. Bugfixed v1.2.1.
% 0.11/0.13 % Command : tptp2X_and_run_prover9 %d %s
% 0.14/0.34 % Computer : n011.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 600
% 0.14/0.34 % DateTime : Fri Jul 1 13:06:19 EDT 2022
% 0.14/0.34 % CPUTime :
% 0.45/1.02 ============================== Prover9 ===============================
% 0.45/1.02 Prover9 (32) version 2009-11A, November 2009.
% 0.45/1.02 Process 12914 was started by sandbox on n011.cluster.edu,
% 0.45/1.02 Fri Jul 1 13:06:19 2022
% 0.45/1.02 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_12761_n011.cluster.edu".
% 0.45/1.02 ============================== end of head ===========================
% 0.45/1.02
% 0.45/1.02 ============================== INPUT =================================
% 0.45/1.02
% 0.45/1.02 % Reading from file /tmp/Prover9_12761_n011.cluster.edu
% 0.45/1.02
% 0.45/1.02 set(prolog_style_variables).
% 0.45/1.02 set(auto2).
% 0.45/1.02 % set(auto2) -> set(auto).
% 0.45/1.02 % set(auto) -> set(auto_inference).
% 0.45/1.02 % set(auto) -> set(auto_setup).
% 0.45/1.02 % set(auto_setup) -> set(predicate_elim).
% 0.45/1.02 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.45/1.02 % set(auto) -> set(auto_limits).
% 0.45/1.02 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.45/1.02 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.45/1.02 % set(auto) -> set(auto_denials).
% 0.45/1.02 % set(auto) -> set(auto_process).
% 0.45/1.02 % set(auto2) -> assign(new_constants, 1).
% 0.45/1.02 % set(auto2) -> assign(fold_denial_max, 3).
% 0.45/1.02 % set(auto2) -> assign(max_weight, "200.000").
% 0.45/1.02 % set(auto2) -> assign(max_hours, 1).
% 0.45/1.02 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.45/1.02 % set(auto2) -> assign(max_seconds, 0).
% 0.45/1.02 % set(auto2) -> assign(max_minutes, 5).
% 0.45/1.02 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.45/1.02 % set(auto2) -> set(sort_initial_sos).
% 0.45/1.02 % set(auto2) -> assign(sos_limit, -1).
% 0.45/1.02 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.45/1.02 % set(auto2) -> assign(max_megs, 400).
% 0.45/1.02 % set(auto2) -> assign(stats, some).
% 0.45/1.02 % set(auto2) -> clear(echo_input).
% 0.45/1.02 % set(auto2) -> set(quiet).
% 0.45/1.02 % set(auto2) -> clear(print_initial_clauses).
% 0.45/1.02 % set(auto2) -> clear(print_given).
% 0.45/1.02 assign(lrs_ticks,-1).
% 0.45/1.02 assign(sos_limit,10000).
% 0.45/1.02 assign(order,kbo).
% 0.45/1.02 set(lex_order_vars).
% 0.45/1.02 clear(print_given).
% 0.45/1.02
% 0.45/1.02 % formulas(sos). % not echoed (12 formulas)
% 0.45/1.02
% 0.45/1.02 ============================== end of input ==========================
% 0.45/1.02
% 0.45/1.02 % From the command line: assign(max_seconds, 300).
% 0.45/1.02
% 0.45/1.02 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.45/1.02
% 0.45/1.02 % Formulas that are not ordinary clauses:
% 0.45/1.02
% 0.45/1.02 ============================== end of process non-clausal formulas ===
% 0.45/1.02
% 0.45/1.02 ============================== PROCESS INITIAL CLAUSES ===============
% 0.45/1.02
% 0.45/1.02 ============================== PREDICATE ELIMINATION =================
% 0.45/1.02
% 0.45/1.02 ============================== end predicate elimination =============
% 0.45/1.02
% 0.45/1.02 Auto_denials:
% 0.45/1.02 % copying label prove_transitivity_of_less_equal to answer in negative clause
% 0.45/1.02
% 0.45/1.02 Term ordering decisions:
% 0.45/1.02 Function symbol KB weights: zero=1. y=1. identity=1. x=1. z=1. divide=1.
% 0.45/1.02
% 0.45/1.02 ============================== end of process initial clauses ========
% 0.45/1.02
% 0.45/1.02 ============================== CLAUSES FOR SEARCH ====================
% 0.45/1.02
% 0.45/1.02 ============================== end of clauses for search =============
% 0.45/1.02
% 0.45/1.02 ============================== SEARCH ================================
% 0.45/1.02
% 0.45/1.02 % Starting search at 0.01 seconds.
% 0.45/1.02
% 0.45/1.02 ============================== PROOF =================================
% 0.45/1.02 % SZS status Unsatisfiable
% 0.45/1.02 % SZS output start Refutation
% 0.45/1.02
% 0.45/1.02 % Proof 1 at 0.03 (+ 0.00) seconds: prove_transitivity_of_less_equal.
% 0.45/1.03 % Length of proof is 20.
% 0.45/1.03 % Level of proof is 8.
% 0.45/1.03 % Maximum clause weight is 23.000.
% 0.45/1.03 % Given clauses 34.
% 0.45/1.03
% 0.45/1.03 1 less_equal(zero,A) # label(zero_is_smallest) # label(axiom). [assumption].
% 0.45/1.03 3 less_equal(x,y) # label(xLEy) # label(hypothesis). [assumption].
% 0.45/1.03 4 less_equal(y,z) # label(yLEz) # label(hypothesis). [assumption].
% 0.45/1.03 5 quotient(A,B,divide(A,B)) # label(closure) # label(axiom). [assumption].
% 0.45/1.03 6 -less_equal(x,z) # label(prove_transitivity_of_less_equal) # label(negated_conjecture) # answer(prove_transitivity_of_less_equal). [assumption].
% 0.45/1.03 7 -less_equal(A,B) | quotient(A,B,zero) # label(quotient_less_equal) # label(axiom). [assumption].
% 0.45/1.03 8 -quotient(A,B,zero) | less_equal(A,B) # label(less_equal_quotient) # label(axiom). [assumption].
% 0.45/1.03 10 -less_equal(A,B) | -less_equal(B,A) | A = B # label(less_equal_and_equal) # label(axiom). [assumption].
% 0.45/1.03 12 -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.45/1.03 13 quotient(y,z,zero). [hyper(7,a,4,a)].
% 0.45/1.03 14 quotient(x,y,zero). [hyper(7,a,3,a)].
% 0.45/1.03 16 quotient(zero,A,zero). [hyper(7,a,1,a)].
% 0.45/1.03 17 -quotient(x,z,zero) # answer(prove_transitivity_of_less_equal). [ur(8,b,6,a)].
% 0.45/1.03 54 less_equal(divide(divide(x,z),zero),zero). [hyper(12,a,14,a,b,13,a,c,5,a,d,5,a,e,16,a)].
% 0.45/1.03 78 divide(divide(x,z),zero) = zero. [hyper(10,a,1,a,b,54,a),flip(a)].
% 0.45/1.03 81 quotient(divide(x,z),zero,zero). [para(78(a,1),5(a,3))].
% 0.45/1.03 86 less_equal(divide(x,z),zero). [hyper(8,a,81,a)].
% 0.45/1.03 87 divide(x,z) = zero. [hyper(10,a,1,a,b,86,a),flip(a)].
% 0.45/1.03 88 quotient(x,z,zero). [para(87(a,1),5(a,3))].
% 0.45/1.03 89 $F # answer(prove_transitivity_of_less_equal). [resolve(88,a,17,a)].
% 0.45/1.03
% 0.45/1.03 % SZS output end Refutation
% 0.45/1.03 ============================== end of proof ==========================
% 0.45/1.03
% 0.45/1.03 ============================== STATISTICS ============================
% 0.45/1.03
% 0.45/1.03 Given=34. Generated=839. Kept=88. proofs=1.
% 0.45/1.03 Usable=29. Sos=15. Demods=7. Limbo=0, Disabled=55. Hints=0.
% 0.45/1.03 Megabytes=0.09.
% 0.45/1.03 User_CPU=0.03, System_CPU=0.00, Wall_clock=0.
% 0.45/1.03
% 0.45/1.03 ============================== end of statistics =====================
% 0.45/1.03
% 0.45/1.03 ============================== end of search =========================
% 0.45/1.03
% 0.45/1.03 THEOREM PROVED
% 0.45/1.03 % SZS status Unsatisfiable
% 0.45/1.03
% 0.45/1.03 Exiting with 1 proof.
% 0.45/1.03
% 0.45/1.03 Process 12914 exit (max_proofs) Fri Jul 1 13:06:19 2022
% 0.45/1.03 Prover9 interrupted
%------------------------------------------------------------------------------