TSTP Solution File: HWV027-1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : HWV027-1 : TPTP v8.1.0. Released v2.5.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n028.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:23 EDT 2022
% Result : Unsatisfiable 0.76s 1.03s
% Output : Refutation 0.76s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12 % Problem : HWV027-1 : TPTP v8.1.0. Released v2.5.0.
% 0.10/0.13 % Command : tptp2X_and_run_prover9 %d %s
% 0.14/0.34 % Computer : n028.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 Jun 17 08:55:27 EDT 2022
% 0.14/0.34 % CPUTime :
% 0.45/1.03 ============================== Prover9 ===============================
% 0.45/1.03 Prover9 (32) version 2009-11A, November 2009.
% 0.45/1.03 Process 31308 was started by sandbox on n028.cluster.edu,
% 0.45/1.03 Fri Jun 17 08:55:28 2022
% 0.45/1.03 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_31155_n028.cluster.edu".
% 0.45/1.03 ============================== end of head ===========================
% 0.45/1.03
% 0.45/1.03 ============================== INPUT =================================
% 0.45/1.03
% 0.45/1.03 % Reading from file /tmp/Prover9_31155_n028.cluster.edu
% 0.45/1.03
% 0.45/1.03 set(prolog_style_variables).
% 0.45/1.03 set(auto2).
% 0.45/1.03 % set(auto2) -> set(auto).
% 0.45/1.03 % set(auto) -> set(auto_inference).
% 0.45/1.03 % set(auto) -> set(auto_setup).
% 0.45/1.03 % set(auto_setup) -> set(predicate_elim).
% 0.45/1.03 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.45/1.03 % set(auto) -> set(auto_limits).
% 0.45/1.03 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.45/1.03 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.45/1.03 % set(auto) -> set(auto_denials).
% 0.45/1.03 % set(auto) -> set(auto_process).
% 0.45/1.03 % set(auto2) -> assign(new_constants, 1).
% 0.45/1.03 % set(auto2) -> assign(fold_denial_max, 3).
% 0.45/1.03 % set(auto2) -> assign(max_weight, "200.000").
% 0.45/1.03 % set(auto2) -> assign(max_hours, 1).
% 0.45/1.03 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.45/1.03 % set(auto2) -> assign(max_seconds, 0).
% 0.45/1.03 % set(auto2) -> assign(max_minutes, 5).
% 0.45/1.03 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.45/1.03 % set(auto2) -> set(sort_initial_sos).
% 0.45/1.03 % set(auto2) -> assign(sos_limit, -1).
% 0.45/1.03 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.45/1.03 % set(auto2) -> assign(max_megs, 400).
% 0.45/1.03 % set(auto2) -> assign(stats, some).
% 0.45/1.03 % set(auto2) -> clear(echo_input).
% 0.45/1.03 % set(auto2) -> set(quiet).
% 0.45/1.03 % set(auto2) -> clear(print_initial_clauses).
% 0.45/1.03 % set(auto2) -> clear(print_given).
% 0.45/1.03 assign(lrs_ticks,-1).
% 0.45/1.03 assign(sos_limit,10000).
% 0.45/1.03 assign(order,kbo).
% 0.45/1.03 set(lex_order_vars).
% 0.45/1.03 clear(print_given).
% 0.45/1.03
% 0.45/1.03 % formulas(sos). % not echoed (94 formulas)
% 0.45/1.03
% 0.45/1.03 ============================== end of input ==========================
% 0.45/1.03
% 0.45/1.03 % From the command line: assign(max_seconds, 300).
% 0.45/1.03
% 0.45/1.03 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.45/1.03
% 0.45/1.03 % Formulas that are not ordinary clauses:
% 0.45/1.03
% 0.45/1.03 ============================== end of process non-clausal formulas ===
% 0.45/1.03
% 0.45/1.03 ============================== PROCESS INITIAL CLAUSES ===============
% 0.45/1.03
% 0.45/1.03 ============================== PREDICATE ELIMINATION =================
% 0.45/1.03 1 minus(A,B) != C | plus(C,B) = A | def_10(B,A) # label(axiom_4) # label(axiom). [assumption].
% 0.45/1.03 2 -def_10(A,B) | -gt(B,A) # label(axiom_6) # label(axiom). [assumption].
% 0.45/1.03 3 -def_10(A,B) | B != A # label(axiom_7) # label(axiom). [assumption].
% 0.45/1.03 Derived: minus(A,B) != C | plus(C,B) = A | -gt(A,B). [resolve(1,c,2,a)].
% 0.45/1.03 Derived: minus(A,B) != C | plus(C,B) = A | A != B. [resolve(1,c,3,a)].
% 0.45/1.03 4 minus(A,B) = C | plus(C,B) != A | def_10(B,A) # label(axiom_5) # label(axiom). [assumption].
% 0.45/1.03 Derived: minus(A,B) = C | plus(C,B) != A | -gt(A,B). [resolve(4,c,2,a)].
% 0.45/1.03 Derived: minus(A,B) = C | plus(C,B) != A | A != B. [resolve(4,c,3,a)].
% 0.45/1.03 5 int_level(A) = fifo_length | -p_Full(A) # label(axiom_23) # label(axiom). [assumption].
% 0.45/1.03 6 int_level(A) != fifo_length | p_Full(A) # label(axiom_22) # label(axiom). [assumption].
% 0.76/1.03 7 int_level(A) = n0 | -p_Empty(A) # label(axiom_25) # label(axiom). [assumption].
% 0.76/1.03 8 int_level(A) != n0 | p_Empty(A) # label(axiom_24) # label(axiom). [assumption].
% 0.76/1.03 9 p_Reset(A) | -p_Wr(A) | -p_Rd(A) | p_Mem(wr_level(A),B,plus(A,n1)) | -p_Data_in(B,A) # label(axiom_64) # label(axiom). [assumption].
% 0.76/1.03 10 p_Reset(A) | -p_Wr(A) | -p_Rd(A) | -p_Mem(wr_level(A),B,plus(A,n1)) | p_Data_in(B,A) # label(axiom_63) # label(axiom). [assumption].
% 0.76/1.03 11 p_Reset(A) | -p_Wr(A) | p_Rd(A) | -gt(fifo_length,int_level(A)) | -p_Mem(wr_level(A),B,plus(A,n1)) | p_Data_in(B,A) # label(axiom_36) # label(axiom). [assumption].
% 0.76/1.03 12 p_Reset(A) | -p_Wr(A) | p_Rd(A) | -gt(fifo_length,int_level(A)) | p_Mem(wr_level(A),B,plus(A,n1)) | -p_Data_in(B,A) # label(axiom_37) # label(axiom). [assumption].
% 0.76/1.03
% 0.76/1.03 ============================== end predicate elimination =============
% 0.76/1.03
% 0.76/1.03 Auto_denials: (non-Horn, no changes).
% 0.76/1.03
% 0.76/1.03 Term ordering decisions:
% 0.76/1.03 Function symbol KB weights: n1=1. n0=1. fifo_length=1. t_139=1. plus=1. minus=1. int_level=1. rd_level=1. wr_level=1. level=1. y_27=1.
% 0.76/1.03
% 0.76/1.03 ============================== end of process initial clauses ========
% 0.76/1.03
% 0.76/1.03 ============================== CLAUSES FOR SEARCH ====================
% 0.76/1.03
% 0.76/1.03 ============================== end of clauses for search =============
% 0.76/1.03
% 0.76/1.03 ============================== SEARCH ================================
% 0.76/1.03
% 0.76/1.03 % Starting search at 0.03 seconds.
% 0.76/1.03
% 0.76/1.03 ============================== PROOF =================================
% 0.76/1.03 % SZS status Unsatisfiable
% 0.76/1.03 % SZS output start Refutation
% 0.76/1.03
% 0.76/1.03 % Proof 1 at 0.03 (+ 0.00) seconds.
% 0.76/1.03 % Length of proof is 8.
% 0.76/1.03 % Level of proof is 2.
% 0.76/1.03 % Maximum clause weight is 13.000.
% 0.76/1.03 % Given clauses 11.
% 0.76/1.03
% 0.76/1.03 16 level(A) = int_level(A) # label(axiom_21) # label(axiom). [assumption].
% 0.76/1.03 24 p_Reset(A) | p_Wr(A) | p_Rd(A) | int_level(plus(A,n1)) = int_level(A) # label(axiom_82) # label(axiom). [assumption].
% 0.76/1.03 25 -p_Wr(t_139) # label(quest_1) # label(negated_conjecture). [assumption].
% 0.76/1.03 26 -p_Rd(t_139) # label(quest_2) # label(negated_conjecture). [assumption].
% 0.76/1.03 27 -p_Reset(t_139) # label(quest_3) # label(negated_conjecture). [assumption].
% 0.76/1.03 33 level(t_139) != level(plus(t_139,n1)) # label(quest_4) # label(negated_conjecture). [assumption].
% 0.76/1.03 34 int_level(plus(t_139,n1)) != int_level(t_139). [copy(33),rewrite([16(2),16(6)]),flip(a)].
% 0.76/1.03 108 $F. [resolve(26,a,24,c),unit_del(a,27),unit_del(b,25),unit_del(c,34)].
% 0.76/1.03
% 0.76/1.03 % SZS output end Refutation
% 0.76/1.03 ============================== end of proof ==========================
% 0.76/1.03
% 0.76/1.03 ============================== STATISTICS ============================
% 0.76/1.03
% 0.76/1.03 Given=11. Generated=95. Kept=87. proofs=1.
% 0.76/1.03 Usable=11. Sos=76. Demods=3. Limbo=0, Disabled=98. Hints=0.
% 0.76/1.03 Megabytes=0.17.
% 0.76/1.03 User_CPU=0.03, System_CPU=0.00, Wall_clock=0.
% 0.76/1.03
% 0.76/1.03 ============================== end of statistics =====================
% 0.76/1.03
% 0.76/1.03 ============================== end of search =========================
% 0.76/1.03
% 0.76/1.03 THEOREM PROVED
% 0.76/1.03 % SZS status Unsatisfiable
% 0.76/1.03
% 0.76/1.03 Exiting with 1 proof.
% 0.76/1.03
% 0.76/1.03 Process 31308 exit (max_proofs) Fri Jun 17 08:55:28 2022
% 0.76/1.03 Prover9 interrupted
%------------------------------------------------------------------------------