TSTP Solution File: HWV023-2 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : HWV023-2 : TPTP v8.1.0. Released v2.5.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n019.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:20 EDT 2022
% Result : Unsatisfiable 2.16s 2.49s
% Output : Refutation 2.16s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12 % Problem : HWV023-2 : TPTP v8.1.0. Released v2.5.0.
% 0.12/0.13 % Command : tptp2X_and_run_prover9 %d %s
% 0.12/0.34 % Computer : n019.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 600
% 0.12/0.34 % DateTime : Fri Jun 17 03:38:39 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.72/1.02 ============================== Prover9 ===============================
% 0.72/1.02 Prover9 (32) version 2009-11A, November 2009.
% 0.72/1.02 Process 31023 was started by sandbox on n019.cluster.edu,
% 0.72/1.02 Fri Jun 17 03:38:40 2022
% 0.72/1.02 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_30870_n019.cluster.edu".
% 0.72/1.02 ============================== end of head ===========================
% 0.72/1.02
% 0.72/1.02 ============================== INPUT =================================
% 0.72/1.02
% 0.72/1.02 % Reading from file /tmp/Prover9_30870_n019.cluster.edu
% 0.72/1.02
% 0.72/1.02 set(prolog_style_variables).
% 0.72/1.02 set(auto2).
% 0.72/1.02 % set(auto2) -> set(auto).
% 0.72/1.02 % set(auto) -> set(auto_inference).
% 0.72/1.02 % set(auto) -> set(auto_setup).
% 0.72/1.02 % set(auto_setup) -> set(predicate_elim).
% 0.72/1.02 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.72/1.02 % set(auto) -> set(auto_limits).
% 0.72/1.02 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.72/1.02 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.72/1.02 % set(auto) -> set(auto_denials).
% 0.72/1.02 % set(auto) -> set(auto_process).
% 0.72/1.02 % set(auto2) -> assign(new_constants, 1).
% 0.72/1.02 % set(auto2) -> assign(fold_denial_max, 3).
% 0.72/1.02 % set(auto2) -> assign(max_weight, "200.000").
% 0.72/1.02 % set(auto2) -> assign(max_hours, 1).
% 0.72/1.02 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.72/1.02 % set(auto2) -> assign(max_seconds, 0).
% 0.72/1.02 % set(auto2) -> assign(max_minutes, 5).
% 0.72/1.02 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.72/1.02 % set(auto2) -> set(sort_initial_sos).
% 0.72/1.02 % set(auto2) -> assign(sos_limit, -1).
% 0.72/1.02 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.72/1.02 % set(auto2) -> assign(max_megs, 400).
% 0.72/1.02 % set(auto2) -> assign(stats, some).
% 0.72/1.02 % set(auto2) -> clear(echo_input).
% 0.72/1.02 % set(auto2) -> set(quiet).
% 0.72/1.02 % set(auto2) -> clear(print_initial_clauses).
% 0.72/1.02 % set(auto2) -> clear(print_given).
% 0.72/1.02 assign(lrs_ticks,-1).
% 0.72/1.02 assign(sos_limit,10000).
% 0.72/1.02 assign(order,kbo).
% 0.72/1.02 set(lex_order_vars).
% 0.72/1.02 clear(print_given).
% 0.72/1.02
% 0.72/1.02 % formulas(sos). % not echoed (138 formulas)
% 0.72/1.02
% 0.72/1.02 ============================== end of input ==========================
% 0.72/1.02
% 0.72/1.02 % From the command line: assign(max_seconds, 300).
% 0.72/1.02
% 0.72/1.02 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.72/1.02
% 0.72/1.02 % Formulas that are not ordinary clauses:
% 0.72/1.02
% 0.72/1.02 ============================== end of process non-clausal formulas ===
% 0.72/1.02
% 0.72/1.02 ============================== PROCESS INITIAL CLAUSES ===============
% 0.72/1.02
% 0.72/1.02 ============================== PREDICATE ELIMINATION =================
% 0.72/1.02 1 A != B | -def_89(B,A) # label(axiom_64) # label(axiom). [assumption].
% 0.72/1.02 2 def_89(A,B) | f_ADD_(C,A) = B | f_SUB_(B,A) != C # label(axiom_62) # label(axiom). [assumption].
% 0.72/1.02 3 def_89(A,B) | f_ADD_(C,A) != B | f_SUB_(B,A) = C # label(axiom_63) # label(axiom). [assumption].
% 0.72/1.02 Derived: A != B | f_ADD_(C,B) = A | f_SUB_(A,B) != C. [resolve(1,b,2,a)].
% 0.72/1.02 Derived: A != B | f_ADD_(C,B) != A | f_SUB_(A,B) = C. [resolve(1,b,3,a)].
% 0.72/1.02 4 p_LES_EQU_(A,B) | -def_89(B,A) # label(axiom_65) # label(axiom). [assumption].
% 0.72/1.02 Derived: p_LES_EQU_(A,B) | f_ADD_(C,B) = A | f_SUB_(A,B) != C. [resolve(4,b,2,a)].
% 0.72/1.02 Derived: p_LES_EQU_(A,B) | f_ADD_(C,B) != A | f_SUB_(A,B) = C. [resolve(4,b,3,a)].
% 0.72/1.02
% 0.72/1.02 ============================== end predicate elimination =============
% 0.72/1.02
% 0.72/1.02 Auto_denials: (non-Horn, no changes).
% 0.72/1.02
% 0.72/1.02 Term ordering decisions:
% 0.72/1.02 Function symbol KB weights: n1=1. n0=1. fwork_DOTfifo_DOTrtl_DOTfifo__length_=1. fwork_DOTfifo_DOTrtl_DOTfifo__width_=1. t_206=1. f__empty_=1. f__true_=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.
% 2.16/2.49
% 2.16/2.49 ============================== end of process initial clauses ========
% 2.16/2.49
% 2.16/2.49 ============================== CLAUSES FOR SEARCH ====================
% 2.16/2.49
% 2.16/2.49 ============================== end of clauses for search =============
% 2.16/2.49
% 2.16/2.49 ============================== SEARCH ================================
% 2.16/2.49
% 2.16/2.49 % Starting search at 0.06 seconds.
% 2.16/2.49
% 2.16/2.49 Low Water (keep): wt=42.000, iters=3457
% 2.16/2.49
% 2.16/2.49 Low Water (keep): wt=36.000, iters=3369
% 2.16/2.49
% 2.16/2.49 Low Water (keep): wt=33.000, iters=3380
% 2.16/2.49
% 2.16/2.49 Low Water (keep): wt=32.000, iters=3447
% 2.16/2.49
% 2.16/2.49 Low Water (keep): wt=31.000, iters=3399
% 2.16/2.49
% 2.16/2.49 Low Water (keep): wt=29.000, iters=3351
% 2.16/2.49
% 2.16/2.49 Low Water (keep): wt=26.000, iters=3417
% 2.16/2.49
% 2.16/2.49 Low Water (keep): wt=25.000, iters=3396
% 2.16/2.49
% 2.16/2.49 Low Water (keep): wt=23.000, iters=3333
% 2.16/2.49
% 2.16/2.49 Low Water (keep): wt=20.000, iters=3349
% 2.16/2.49
% 2.16/2.49 Low Water (keep): wt=14.000, iters=3375
% 2.16/2.49
% 2.16/2.49 Low Water (keep): wt=12.000, iters=3349
% 2.16/2.49
% 2.16/2.49 NOTE: Back_subsumption disabled, ratio of kept to back_subsumed is 38 (0.00 of 1.27 sec).
% 2.16/2.49
% 2.16/2.49 Low Water (keep): wt=11.000, iters=3337
% 2.16/2.49
% 2.16/2.49 Low Water (keep): wt=10.000, iters=3341
% 2.16/2.49
% 2.16/2.49 ============================== PROOF =================================
% 2.16/2.49 % SZS status Unsatisfiable
% 2.16/2.49 % SZS output start Refutation
% 2.16/2.49
% 2.16/2.49 % Proof 1 at 1.50 (+ 0.01) seconds.
% 2.16/2.49 % Length of proof is 25.
% 2.16/2.49 % Level of proof is 5.
% 2.16/2.49 % Maximum clause weight is 25.000.
% 2.16/2.49 % Given clauses 897.
% 2.16/2.49
% 2.16/2.49 1 A != B | -def_89(B,A) # label(axiom_64) # label(axiom). [assumption].
% 2.16/2.49 3 def_89(A,B) | f_ADD_(C,A) != B | f_SUB_(B,A) = C # label(axiom_63) # label(axiom). [assumption].
% 2.16/2.49 11 fwork_DOTfifo_DOTrtl_DOTlevel_(A) = fwork_DOTfifo_DOTrtl_DOTint__level_(A) # label(axiom_5) # label(axiom). [assumption].
% 2.16/2.49 14 p__pred_(fwork_DOTfifo_DOTrtl_DOTempty_(A)) | fwork_DOTfifo_DOTrtl_DOTint__level_(A) != n0 # label(axiom_8) # label(axiom). [assumption].
% 2.16/2.49 55 fwork_DOTfifo_DOTrtl_DOTint__level_(f_ADD_(A,n1)) = f_SUB_(fwork_DOTfifo_DOTrtl_DOTint__level_(A),n1) | p_LES_EQU_(fwork_DOTfifo_DOTrtl_DOTint__level_(A),n0) | -p__pred_(fwork_DOTfifo_DOTrtl_DOTrd_(A)) | p__pred_(fwork_DOTfifo_DOTrtl_DOTwr_(A)) | p__pred_(fwork_DOTfifo_DOTrtl_DOTreset_(A)) # label(axiom_43) # label(axiom). [assumption].
% 2.16/2.49 74 -p_LES_EQU_(f_ADD_(A,n1),n0) # label(axiom_60) # label(axiom). [assumption].
% 2.16/2.49 89 f_ADD_(n0,A) = A # label(axiom_77) # label(axiom). [assumption].
% 2.16/2.49 93 f__length_(f__empty_) = n0 # label(axiom_80) # label(axiom). [assumption].
% 2.16/2.49 94 n0 = f__length_(f__empty_). [copy(93),flip(a)].
% 2.16/2.49 160 fwork_DOTfifo_DOTrtl_DOTlevel_(t_206) = n1 # label(quest_1) # label(negated_conjecture). [assumption].
% 2.16/2.49 161 n1 = fwork_DOTfifo_DOTrtl_DOTint__level_(t_206). [copy(160),rewrite([11(2)]),flip(a)].
% 2.16/2.49 162 p__pred_(fwork_DOTfifo_DOTrtl_DOTrd_(t_206)) # label(quest_2) # label(negated_conjecture). [assumption].
% 2.16/2.49 163 -p__pred_(fwork_DOTfifo_DOTrtl_DOTreset_(t_206)) # label(quest_3) # label(negated_conjecture). [assumption].
% 2.16/2.49 164 -p__pred_(fwork_DOTfifo_DOTrtl_DOTwr_(t_206)) # label(quest_4) # label(negated_conjecture). [assumption].
% 2.16/2.49 165 -p__pred_(fwork_DOTfifo_DOTrtl_DOTempty_(f_ADD_(t_206,n1))) # label(quest_5) # label(negated_conjecture). [assumption].
% 2.16/2.49 166 -p__pred_(fwork_DOTfifo_DOTrtl_DOTempty_(f_ADD_(t_206,fwork_DOTfifo_DOTrtl_DOTint__level_(t_206)))). [copy(165),rewrite([161(2)])].
% 2.16/2.49 168 A != B | f_ADD_(C,B) != A | f_SUB_(A,B) = C. [resolve(1,b,3,a)].
% 2.16/2.49 186 f_ADD_(f__length_(f__empty_),A) = A. [back_rewrite(89),rewrite([94(1)])].
% 2.16/2.49 190 -p_LES_EQU_(f_ADD_(A,fwork_DOTfifo_DOTrtl_DOTint__level_(t_206)),f__length_(f__empty_)). [back_rewrite(74),rewrite([161(1),94(4)])].
% 2.16/2.49 201 fwork_DOTfifo_DOTrtl_DOTint__level_(f_ADD_(A,fwork_DOTfifo_DOTrtl_DOTint__level_(t_206))) = f_SUB_(fwork_DOTfifo_DOTrtl_DOTint__level_(A),fwork_DOTfifo_DOTrtl_DOTint__level_(t_206)) | p_LES_EQU_(fwork_DOTfifo_DOTrtl_DOTint__level_(A),f__length_(f__empty_)) | -p__pred_(fwork_DOTfifo_DOTrtl_DOTrd_(A)) | p__pred_(fwork_DOTfifo_DOTrtl_DOTwr_(A)) | p__pred_(fwork_DOTfifo_DOTrtl_DOTreset_(A)). [back_rewrite(55),rewrite([161(1),161(6),94(11)])].
% 2.16/2.49 222 p__pred_(fwork_DOTfifo_DOTrtl_DOTempty_(A)) | fwork_DOTfifo_DOTrtl_DOTint__level_(A) != f__length_(f__empty_). [back_rewrite(14),rewrite([94(4)])].
% 2.16/2.49 538 f_SUB_(A,A) = f__length_(f__empty_). [resolve(186,a,168,b),xx(a)].
% 2.16/2.49 564 -p_LES_EQU_(fwork_DOTfifo_DOTrtl_DOTint__level_(t_206),f__length_(f__empty_)). [para(186(a,1),190(a,1))].
% 2.16/2.49 602 fwork_DOTfifo_DOTrtl_DOTint__level_(f_ADD_(t_206,fwork_DOTfifo_DOTrtl_DOTint__level_(t_206))) = f__length_(f__empty_). [resolve(201,c,162,a),rewrite([538(10)]),unit_del(b,564),unit_del(c,164),unit_del(d,163)].
% 2.16/2.49 7736 $F. [resolve(602,a,222,b),unit_del(a,166)].
% 2.16/2.49
% 2.16/2.49 % SZS output end Refutation
% 2.16/2.49 ============================== end of proof ==========================
% 2.16/2.49
% 2.16/2.49 ============================== STATISTICS ============================
% 2.16/2.49
% 2.16/2.49 Given=897. Generated=22618. Kept=7702. proofs=1.
% 2.16/2.49 Usable=845. Sos=6262. Demods=279. Limbo=0, Disabled=737. Hints=0.
% 2.16/2.49 Megabytes=9.14.
% 2.16/2.49 User_CPU=1.50, System_CPU=0.01, Wall_clock=1.
% 2.16/2.49
% 2.16/2.49 ============================== end of statistics =====================
% 2.16/2.49
% 2.16/2.49 ============================== end of search =========================
% 2.16/2.49
% 2.16/2.49 THEOREM PROVED
% 2.16/2.49 % SZS status Unsatisfiable
% 2.16/2.49
% 2.16/2.49 Exiting with 1 proof.
% 2.16/2.49
% 2.16/2.49 Process 31023 exit (max_proofs) Fri Jun 17 03:38:41 2022
% 2.16/2.49 Prover9 interrupted
%------------------------------------------------------------------------------