TSTP Solution File: HEN007-2 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : HEN007-2 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n014.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:51 EDT 2022
% Result : Unsatisfiable 0.70s 1.06s
% Output : Refutation 0.70s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : HEN007-2 : TPTP v8.1.0. Released v1.0.0.
% 0.03/0.13 % Command : tptp2X_and_run_prover9 %d %s
% 0.13/0.34 % Computer : n014.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 13:26:10 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.70/1.06 ============================== Prover9 ===============================
% 0.70/1.06 Prover9 (32) version 2009-11A, November 2009.
% 0.70/1.06 Process 30884 was started by sandbox on n014.cluster.edu,
% 0.70/1.06 Fri Jul 1 13:26:11 2022
% 0.70/1.06 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_30730_n014.cluster.edu".
% 0.70/1.06 ============================== end of head ===========================
% 0.70/1.06
% 0.70/1.06 ============================== INPUT =================================
% 0.70/1.06
% 0.70/1.06 % Reading from file /tmp/Prover9_30730_n014.cluster.edu
% 0.70/1.06
% 0.70/1.06 set(prolog_style_variables).
% 0.70/1.06 set(auto2).
% 0.70/1.06 % set(auto2) -> set(auto).
% 0.70/1.06 % set(auto) -> set(auto_inference).
% 0.70/1.06 % set(auto) -> set(auto_setup).
% 0.70/1.06 % set(auto_setup) -> set(predicate_elim).
% 0.70/1.06 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.70/1.06 % set(auto) -> set(auto_limits).
% 0.70/1.06 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.70/1.06 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.70/1.06 % set(auto) -> set(auto_denials).
% 0.70/1.06 % set(auto) -> set(auto_process).
% 0.70/1.06 % set(auto2) -> assign(new_constants, 1).
% 0.70/1.06 % set(auto2) -> assign(fold_denial_max, 3).
% 0.70/1.06 % set(auto2) -> assign(max_weight, "200.000").
% 0.70/1.06 % set(auto2) -> assign(max_hours, 1).
% 0.70/1.06 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.70/1.06 % set(auto2) -> assign(max_seconds, 0).
% 0.70/1.06 % set(auto2) -> assign(max_minutes, 5).
% 0.70/1.06 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.70/1.06 % set(auto2) -> set(sort_initial_sos).
% 0.70/1.06 % set(auto2) -> assign(sos_limit, -1).
% 0.70/1.06 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.70/1.06 % set(auto2) -> assign(max_megs, 400).
% 0.70/1.06 % set(auto2) -> assign(stats, some).
% 0.70/1.06 % set(auto2) -> clear(echo_input).
% 0.70/1.06 % set(auto2) -> set(quiet).
% 0.70/1.06 % set(auto2) -> clear(print_initial_clauses).
% 0.70/1.06 % set(auto2) -> clear(print_given).
% 0.70/1.06 assign(lrs_ticks,-1).
% 0.70/1.06 assign(sos_limit,10000).
% 0.70/1.06 assign(order,kbo).
% 0.70/1.06 set(lex_order_vars).
% 0.70/1.06 clear(print_given).
% 0.70/1.06
% 0.70/1.06 % formulas(sos). % not echoed (19 formulas)
% 0.70/1.06
% 0.70/1.06 ============================== end of input ==========================
% 0.70/1.06
% 0.70/1.06 % From the command line: assign(max_seconds, 300).
% 0.70/1.06
% 0.70/1.06 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.70/1.06
% 0.70/1.06 % Formulas that are not ordinary clauses:
% 0.70/1.06
% 0.70/1.06 ============================== end of process non-clausal formulas ===
% 0.70/1.06
% 0.70/1.06 ============================== PROCESS INITIAL CLAUSES ===============
% 0.70/1.06
% 0.70/1.06 ============================== PREDICATE ELIMINATION =================
% 0.70/1.06
% 0.70/1.06 ============================== end predicate elimination =============
% 0.70/1.06
% 0.70/1.06 Auto_denials:
% 0.70/1.06 % copying label prove_zQyLEzQx to answer in negative clause
% 0.70/1.06
% 0.70/1.06 Term ordering decisions:
% 0.70/1.06 Function symbol KB weights: zero=1. identity=1. x=1. y=1. z=1. zQx=1. zQy=1. divide=1.
% 0.70/1.06
% 0.70/1.06 ============================== end of process initial clauses ========
% 0.70/1.06
% 0.70/1.06 ============================== CLAUSES FOR SEARCH ====================
% 0.70/1.06
% 0.70/1.06 ============================== end of clauses for search =============
% 0.70/1.06
% 0.70/1.06 ============================== SEARCH ================================
% 0.70/1.06
% 0.70/1.06 % Starting search at 0.01 seconds.
% 0.70/1.06
% 0.70/1.06 ============================== PROOF =================================
% 0.70/1.06 % SZS status Unsatisfiable
% 0.70/1.06 % SZS output start Refutation
% 0.70/1.06
% 0.70/1.06 % Proof 1 at 0.08 (+ 0.01) seconds: prove_zQyLEzQx.
% 0.70/1.06 % Length of proof is 18.
% 0.70/1.06 % Level of proof is 3.
% 0.70/1.06 % Maximum clause weight is 23.000.
% 0.70/1.06 % Given clauses 35.
% 0.70/1.06
% 0.70/1.06 3 less_equal(x,y) # label(xLEy) # label(hypothesis). [assumption].
% 0.70/1.06 7 quotient(A,zero,A) # label(x_divde_zero_is_x) # label(axiom). [assumption].
% 0.70/1.06 8 quotient(z,y,zQy) # label(zQy) # label(hypothesis). [assumption].
% 0.70/1.06 9 quotient(z,x,zQx) # label(zQx) # label(hypothesis). [assumption].
% 0.70/1.06 10 quotient(A,B,divide(A,B)) # label(closure) # label(axiom). [assumption].
% 0.70/1.06 11 -less_equal(zQy,zQx) # label(prove_zQyLEzQx) # label(negated_conjecture) # answer(prove_zQyLEzQx). [assumption].
% 0.70/1.06 12 -less_equal(A,B) | quotient(A,B,zero) # label(quotient_less_equal) # label(axiom). [assumption].
% 0.70/1.06 14 -quotient(A,B,C) | less_equal(C,A) # label(divisor_existence) # label(axiom). [assumption].
% 0.70/1.06 16 -less_equal(A,B) | -less_equal(B,C) | less_equal(A,C) # label(transitivity_of_less_equal) # label(axiom). [assumption].
% 0.70/1.06 17 -quotient(A,B,C) | -quotient(A,B,D) | C = D # label(well_defined) # label(axiom). [assumption].
% 0.70/1.06 19 -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.70/1.06 20 quotient(x,y,zero). [hyper(12,a,3,a)].
% 0.70/1.06 23 less_equal(divide(A,B),A). [hyper(14,a,10,a)].
% 0.70/1.06 29 divide(z,x) = zQx. [hyper(17,a,10,a,b,9,a)].
% 0.70/1.06 31 divide(A,zero) = A. [hyper(17,a,10,a,b,7,a)].
% 0.70/1.06 66 less_equal(zQy,divide(zQx,y)). [hyper(19,a,10,a,b,20,a,c,8,a,d,10,a,e,10,a),rewrite([31(3),29(4)])].
% 0.70/1.06 210 -less_equal(zQy,divide(zQx,A)) # answer(prove_zQyLEzQx). [ur(16,b,23,a,c,11,a)].
% 0.70/1.06 211 $F # answer(prove_zQyLEzQx). [resolve(210,a,66,a)].
% 0.70/1.06
% 0.70/1.06 % SZS output end Refutation
% 0.70/1.06 ============================== end of proof ==========================
% 0.70/1.06
% 0.70/1.06 ============================== STATISTICS ============================
% 0.70/1.06
% 0.70/1.06 Given=35. Generated=4128. Kept=210. proofs=1.
% 0.70/1.06 Usable=35. Sos=145. Demods=9. Limbo=13, Disabled=35. Hints=0.
% 0.70/1.06 Megabytes=0.15.
% 0.70/1.06 User_CPU=0.08, System_CPU=0.01, Wall_clock=0.
% 0.70/1.06
% 0.70/1.06 ============================== end of statistics =====================
% 0.70/1.06
% 0.70/1.06 ============================== end of search =========================
% 0.70/1.06
% 0.70/1.06 THEOREM PROVED
% 0.70/1.06 % SZS status Unsatisfiable
% 0.70/1.06
% 0.70/1.06 Exiting with 1 proof.
% 0.70/1.06
% 0.70/1.06 Process 30884 exit (max_proofs) Fri Jul 1 13:26:11 2022
% 0.70/1.06 Prover9 interrupted
%------------------------------------------------------------------------------