TSTP Solution File: HWV011-3 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : HWV011-3 : TPTP v8.1.0. Released v2.5.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n027.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 19:01:13 EDT 2022
% Result : Unsatisfiable 0.89s 1.17s
% Output : Refutation 0.89s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : HWV011-3 : TPTP v8.1.0. Released v2.5.0.
% 0.03/0.13 % Command : tptp2X_and_run_prover9 %d %s
% 0.13/0.34 % Computer : n027.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 Jun 17 01:17:51 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.82/1.08 ============================== Prover9 ===============================
% 0.82/1.08 Prover9 (32) version 2009-11A, November 2009.
% 0.82/1.08 Process 5850 was started by sandbox2 on n027.cluster.edu,
% 0.82/1.08 Fri Jun 17 01:17:52 2022
% 0.82/1.08 The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 300 -f /tmp/Prover9_5697_n027.cluster.edu".
% 0.82/1.08 ============================== end of head ===========================
% 0.82/1.08
% 0.82/1.08 ============================== INPUT =================================
% 0.82/1.08
% 0.82/1.08 % Reading from file /tmp/Prover9_5697_n027.cluster.edu
% 0.82/1.08
% 0.82/1.08 set(prolog_style_variables).
% 0.82/1.08 set(auto2).
% 0.82/1.08 % set(auto2) -> set(auto).
% 0.82/1.08 % set(auto) -> set(auto_inference).
% 0.82/1.08 % set(auto) -> set(auto_setup).
% 0.82/1.08 % set(auto_setup) -> set(predicate_elim).
% 0.82/1.08 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.82/1.08 % set(auto) -> set(auto_limits).
% 0.82/1.08 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.82/1.08 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.82/1.08 % set(auto) -> set(auto_denials).
% 0.82/1.08 % set(auto) -> set(auto_process).
% 0.82/1.08 % set(auto2) -> assign(new_constants, 1).
% 0.82/1.08 % set(auto2) -> assign(fold_denial_max, 3).
% 0.82/1.08 % set(auto2) -> assign(max_weight, "200.000").
% 0.82/1.08 % set(auto2) -> assign(max_hours, 1).
% 0.82/1.08 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.82/1.08 % set(auto2) -> assign(max_seconds, 0).
% 0.82/1.08 % set(auto2) -> assign(max_minutes, 5).
% 0.82/1.08 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.82/1.08 % set(auto2) -> set(sort_initial_sos).
% 0.82/1.08 % set(auto2) -> assign(sos_limit, -1).
% 0.82/1.08 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.82/1.08 % set(auto2) -> assign(max_megs, 400).
% 0.82/1.08 % set(auto2) -> assign(stats, some).
% 0.82/1.08 % set(auto2) -> clear(echo_input).
% 0.82/1.08 % set(auto2) -> set(quiet).
% 0.82/1.08 % set(auto2) -> clear(print_initial_clauses).
% 0.82/1.08 % set(auto2) -> clear(print_given).
% 0.82/1.08 assign(lrs_ticks,-1).
% 0.82/1.08 assign(sos_limit,10000).
% 0.82/1.08 assign(order,kbo).
% 0.82/1.08 set(lex_order_vars).
% 0.82/1.08 clear(print_given).
% 0.82/1.08
% 0.82/1.08 % formulas(sos). % not echoed (135 formulas)
% 0.82/1.08
% 0.82/1.08 ============================== end of input ==========================
% 0.82/1.08
% 0.82/1.08 % From the command line: assign(max_seconds, 300).
% 0.82/1.08
% 0.82/1.08 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.82/1.08
% 0.82/1.08 % Formulas that are not ordinary clauses:
% 0.82/1.08
% 0.82/1.08 ============================== end of process non-clausal formulas ===
% 0.82/1.08
% 0.82/1.08 ============================== PROCESS INITIAL CLAUSES ===============
% 0.82/1.08
% 0.82/1.08 ============================== PREDICATE ELIMINATION =================
% 0.82/1.08 1 A != B | -def_89(B,A) # label(axiom_64) # label(axiom). [assumption].
% 0.82/1.08 2 def_89(A,B) | f_ADD_(C,A) = B | f_SUB_(B,A) != C # label(axiom_62) # label(axiom). [assumption].
% 0.82/1.08 3 def_89(A,B) | f_ADD_(C,A) != B | f_SUB_(B,A) = C # label(axiom_63) # label(axiom). [assumption].
% 0.82/1.08 Derived: A != B | f_ADD_(C,B) = A | f_SUB_(A,B) != C. [resolve(1,b,2,a)].
% 0.82/1.08 Derived: A != B | f_ADD_(C,B) != A | f_SUB_(A,B) = C. [resolve(1,b,3,a)].
% 0.82/1.08 4 p_LES_EQU_(A,B) | -def_89(B,A) # label(axiom_65) # label(axiom). [assumption].
% 0.82/1.08 Derived: p_LES_EQU_(A,B) | f_ADD_(C,B) = A | f_SUB_(A,B) != C. [resolve(4,b,2,a)].
% 0.82/1.08 Derived: p_LES_EQU_(A,B) | f_ADD_(C,B) != A | f_SUB_(A,B) = C. [resolve(4,b,3,a)].
% 0.82/1.08
% 0.82/1.08 ============================== end predicate elimination =============
% 0.82/1.08
% 0.82/1.08 Auto_denials: (non-Horn, no changes).
% 0.82/1.08
% 0.82/1.08 Term ordering decisions:
% 0.82/1.08 Function symbol KB weights: n1=1. n0=1. fwork_DOTfifo_DOTrtl_DOTfifo__length_=1. fwork_DOTfifo_DOTrtl_DOTfifo__width_=1. f__empty_=1. f__true_=1. t_206=1. f__false_=1. f_ADD_=1. f__index_=1. f_SUB_=1. f__xnor_=1. f__and_=1. f__or_=1. f__xor_=1. f__equiv_=1. f__nand_=1. fstd_DOTstandard_DOTmod_=1. f__concat_=1. f__cons_=1. f__nor_=1. f__equal_=1. f__geq_=1. f__leq_=1. f__gt_=1. f__lt_=1. fwork_DOTfifo_DOTrtl_DOTint__level_=1. fwork_DOTfifo_DOTrtl_DOTreset_=1. fwork_DOTfifo_DOTrtl_DOTwr_=1. fwork_DOTfifo_DOTrtl_DOTrd_=1. fwork_DOTfifo_DOTrtl_DOTrd__level_=1. fwork_DOTfifo_DOTrtl_DOTmem_=1. fwork_DOTfifo_DOTrtl_DOTwr__level_=1. fwork_DOTfifo_DOTrtl_DOTrd__error_=1. fwork_DOTfifo_DOTrtl_DOTdata__out_=1. f__length_=1. fwork_DOTfifo_DOTrtl_DOTwr__error_=1. f__not_=1. fwork_DOTfifo_DOTrtl_DOTdata__in_=1. length=1. fwork_DOTfifo_DOTrtl_DOTempty_=1. fwork_DOTfifo_DOTrtl_DOTfull_=1. fwork_DOTfifo_DOTrtl_DOTlevel_=1. f__others_=1. y_105=1. f__slice_=1.
% 0.89/1.17
% 0.89/1.17 ============================== end of process initial clauses ========
% 0.89/1.17
% 0.89/1.17 ============================== CLAUSES FOR SEARCH ====================
% 0.89/1.17
% 0.89/1.17 ============================== end of clauses for search =============
% 0.89/1.17
% 0.89/1.17 ============================== SEARCH ================================
% 0.89/1.17
% 0.89/1.17 % Starting search at 0.05 seconds.
% 0.89/1.17
% 0.89/1.17 ============================== PROOF =================================
% 0.89/1.17 % SZS status Unsatisfiable
% 0.89/1.17 % SZS output start Refutation
% 0.89/1.17
% 0.89/1.17 % Proof 1 at 0.14 (+ 0.00) seconds.
% 0.89/1.17 % Length of proof is 7.
% 0.89/1.17 % Level of proof is 3.
% 0.89/1.17 % Maximum clause weight is 8.000.
% 0.89/1.17 % Given clauses 157.
% 0.89/1.17
% 0.89/1.17 11 fwork_DOTfifo_DOTrtl_DOTlevel_(A) = fwork_DOTfifo_DOTrtl_DOTint__level_(A) # label(axiom_5) # label(axiom). [assumption].
% 0.89/1.17 12 p__pred_(fwork_DOTfifo_DOTrtl_DOTfull_(A)) | fwork_DOTfifo_DOTrtl_DOTint__level_(A) != fwork_DOTfifo_DOTrtl_DOTfifo__length_ # label(axiom_6) # label(axiom). [assumption].
% 0.89/1.17 160 fwork_DOTfifo_DOTrtl_DOTlevel_(t_206) = fwork_DOTfifo_DOTrtl_DOTfifo__length_ # label(quest_1) # label(negated_conjecture). [assumption].
% 0.89/1.17 161 fwork_DOTfifo_DOTrtl_DOTfifo__length_ = fwork_DOTfifo_DOTrtl_DOTint__level_(t_206). [copy(160),rewrite([11(2)]),flip(a)].
% 0.89/1.17 162 -p__pred_(fwork_DOTfifo_DOTrtl_DOTfull_(t_206)) # label(quest_2) # label(negated_conjecture). [assumption].
% 0.89/1.17 237 p__pred_(fwork_DOTfifo_DOTrtl_DOTfull_(A)) | fwork_DOTfifo_DOTrtl_DOTint__level_(t_206) != fwork_DOTfifo_DOTrtl_DOTint__level_(A). [back_rewrite(12),rewrite([161(4)]),flip(b)].
% 0.89/1.17 846 $F. [xx_res(237,b),unit_del(a,162)].
% 0.89/1.17
% 0.89/1.17 % SZS output end Refutation
% 0.89/1.17 ============================== end of proof ==========================
% 0.89/1.17
% 0.89/1.17 ============================== STATISTICS ============================
% 0.89/1.17
% 0.89/1.17 Given=157. Generated=1062. Kept=813. proofs=1.
% 0.89/1.17 Usable=156. Sos=595. Demods=40. Limbo=0, Disabled=201. Hints=0.
% 0.89/1.17 Megabytes=1.67.
% 0.89/1.17 User_CPU=0.14, System_CPU=0.00, Wall_clock=0.
% 0.89/1.17
% 0.89/1.17 ============================== end of statistics =====================
% 0.89/1.17
% 0.89/1.17 ============================== end of search =========================
% 0.89/1.17
% 0.89/1.17 THEOREM PROVED
% 0.89/1.17 % SZS status Unsatisfiable
% 0.89/1.17
% 0.89/1.17 Exiting with 1 proof.
% 0.89/1.17
% 0.89/1.17 Process 5850 exit (max_proofs) Fri Jun 17 01:17:52 2022
% 0.89/1.17 Prover9 interrupted
%------------------------------------------------------------------------------