TSTP Solution File: HWV052-1.001.001 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : HWV052-1.001.001 : TPTP v8.1.0. Released v4.1.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n025.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:02:06 EDT 2022
% Result : Unsatisfiable 0.41s 1.03s
% Output : Refutation 0.41s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.11 % Problem : HWV052-1.001.001 : TPTP v8.1.0. Released v4.1.0.
% 0.07/0.12 % Command : tptp2X_and_run_prover9 %d %s
% 0.12/0.32 % Computer : n025.cluster.edu
% 0.12/0.32 % Model : x86_64 x86_64
% 0.12/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.32 % Memory : 8042.1875MB
% 0.12/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 600
% 0.12/0.33 % DateTime : Fri Jun 17 04:31:12 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.41/1.03 ============================== Prover9 ===============================
% 0.41/1.03 Prover9 (32) version 2009-11A, November 2009.
% 0.41/1.03 Process 32019 was started by sandbox2 on n025.cluster.edu,
% 0.41/1.03 Fri Jun 17 04:31:12 2022
% 0.41/1.03 The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 300 -f /tmp/Prover9_31865_n025.cluster.edu".
% 0.41/1.03 ============================== end of head ===========================
% 0.41/1.03
% 0.41/1.03 ============================== INPUT =================================
% 0.41/1.03
% 0.41/1.03 % Reading from file /tmp/Prover9_31865_n025.cluster.edu
% 0.41/1.03
% 0.41/1.03 set(prolog_style_variables).
% 0.41/1.03 set(auto2).
% 0.41/1.03 % set(auto2) -> set(auto).
% 0.41/1.03 % set(auto) -> set(auto_inference).
% 0.41/1.03 % set(auto) -> set(auto_setup).
% 0.41/1.03 % set(auto_setup) -> set(predicate_elim).
% 0.41/1.03 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.41/1.03 % set(auto) -> set(auto_limits).
% 0.41/1.03 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.41/1.03 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.41/1.03 % set(auto) -> set(auto_denials).
% 0.41/1.03 % set(auto) -> set(auto_process).
% 0.41/1.03 % set(auto2) -> assign(new_constants, 1).
% 0.41/1.03 % set(auto2) -> assign(fold_denial_max, 3).
% 0.41/1.03 % set(auto2) -> assign(max_weight, "200.000").
% 0.41/1.03 % set(auto2) -> assign(max_hours, 1).
% 0.41/1.03 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.41/1.03 % set(auto2) -> assign(max_seconds, 0).
% 0.41/1.03 % set(auto2) -> assign(max_minutes, 5).
% 0.41/1.03 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.41/1.03 % set(auto2) -> set(sort_initial_sos).
% 0.41/1.03 % set(auto2) -> assign(sos_limit, -1).
% 0.41/1.03 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.41/1.03 % set(auto2) -> assign(max_megs, 400).
% 0.41/1.03 % set(auto2) -> assign(stats, some).
% 0.41/1.03 % set(auto2) -> clear(echo_input).
% 0.41/1.03 % set(auto2) -> set(quiet).
% 0.41/1.03 % set(auto2) -> clear(print_initial_clauses).
% 0.41/1.03 % set(auto2) -> clear(print_given).
% 0.41/1.03 assign(lrs_ticks,-1).
% 0.41/1.03 assign(sos_limit,10000).
% 0.41/1.03 assign(order,kbo).
% 0.41/1.03 set(lex_order_vars).
% 0.41/1.03 clear(print_given).
% 0.41/1.03
% 0.41/1.03 % formulas(sos). % not echoed (5 formulas)
% 0.41/1.03
% 0.41/1.03 ============================== end of input ==========================
% 0.41/1.03
% 0.41/1.03 % From the command line: assign(max_seconds, 300).
% 0.41/1.03
% 0.41/1.03 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.41/1.03
% 0.41/1.03 % Formulas that are not ordinary clauses:
% 0.41/1.03
% 0.41/1.03 ============================== end of process non-clausal formulas ===
% 0.41/1.03
% 0.41/1.03 ============================== PROCESS INITIAL CLAUSES ===============
% 0.41/1.03
% 0.41/1.03 ============================== PREDICATE ELIMINATION =================
% 0.41/1.03
% 0.41/1.03 ============================== end predicate elimination =============
% 0.41/1.03
% 0.41/1.03 Auto_denials: (non-Horn, no changes).
% 0.41/1.03
% 0.41/1.03 Term ordering decisions:
% 0.41/1.03 Function symbol KB weights: i=1. o=1. unpack1=1. pack1=1. inv=1.
% 0.41/1.03
% 0.41/1.03 ============================== end of process initial clauses ========
% 0.41/1.03
% 0.41/1.03 ============================== CLAUSES FOR SEARCH ====================
% 0.41/1.03
% 0.41/1.03 ============================== end of clauses for search =============
% 0.41/1.03
% 0.41/1.03 ============================== SEARCH ================================
% 0.41/1.03
% 0.41/1.03 % Starting search at 0.01 seconds.
% 0.41/1.03
% 0.41/1.03 ============================== PROOF =================================
% 0.41/1.03 % SZS status Unsatisfiable
% 0.41/1.03 % SZS output start Refutation
% 0.41/1.03
% 0.41/1.03 % Proof 1 at 0.03 (+ 0.00) seconds.
% 0.41/1.03 % Length of proof is 26.
% 0.41/1.03 % Level of proof is 11.
% 0.41/1.03 % Maximum clause weight is 10.000.
% 0.41/1.03 % Given clauses 30.
% 0.41/1.03
% 0.41/1.03 1 A = o | A = i # label(bit_domain) # label(axiom). [assumption].
% 0.41/1.03 2 o = A | i = A. [copy(1),flip(a),flip(b)].
% 0.41/1.03 3 unpack1(A,pack1(A)) = A # label(unpack1) # label(axiom). [assumption].
% 0.41/1.03 4 unpack1(inv(A),pack1(A)) = A # label(unpack1_01) # label(axiom). [assumption].
% 0.41/1.03 5 unpack1(A,inv(pack1(A))) = A # label(unpack1_02) # label(axiom). [assumption].
% 0.41/1.03 6 inv(A) != A # label(bit_inverse) # label(axiom). [assumption].
% 0.41/1.03 7 i = A | A = B | i = B. [para(2(a,1),2(a,1))].
% 0.41/1.03 8 pack1(A) = i | unpack1(A,o) = A. [para(2(a,2),3(a,1,2)),flip(a)].
% 0.41/1.03 11 pack1(A) = i | unpack1(A,inv(o)) = A. [para(2(a,2),5(a,1,2,1)),flip(a)].
% 0.41/1.03 13 inv(o) = i. [resolve(6,a,2,a(flip)),flip(a)].
% 0.41/1.03 14 inv(A) = i | o != A. [para(2(a,2),6(a,1)),flip(a)].
% 0.41/1.03 15 pack1(A) = i | unpack1(A,i) = A. [back_rewrite(11),rewrite([13(5)])].
% 0.41/1.03 16 inv(i) = A | i = A. [resolve(7,a,6,a(flip))].
% 0.41/1.03 38 unpack1(i,pack1(o)) = o. [para(13(a,1),4(a,1,1))].
% 0.41/1.03 39 o != i. [para(13(a,1),6(a,1)),flip(a)].
% 0.41/1.03 41 pack1(o) = i | unpack1(i,o) = o. [para(2(a,2),38(a,1,2)),flip(a)].
% 0.41/1.03 57 inv(i) = o. [para(16(a,2),38(a,1)),rewrite([38(5)]),flip(a),unit_del(a,39)].
% 0.41/1.03 64 unpack1(o,pack1(i)) = i. [para(57(a,1),4(a,1,1))].
% 0.41/1.03 77 pack1(o) = i | inv(unpack1(o,i)) = i. [resolve(15,b,14,b(flip))].
% 0.41/1.03 100 pack1(o) = i | pack1(i) = i. [para(41(b,1),8(b,1)),unit_del(c,39)].
% 0.41/1.03 103 pack1(i) = i | unpack1(i,i) = o. [para(100(a,1),4(a,1,2)),rewrite([13(6)])].
% 0.41/1.03 158 pack1(i) = i. [para(103(b,1),15(b,1)),merge(b),unit_del(b,39)].
% 0.41/1.03 165 unpack1(o,i) = i. [back_rewrite(64),rewrite([158(3)])].
% 0.41/1.03 167 pack1(o) = i. [back_rewrite(77),rewrite([165(7),57(6)]),unit_del(b,39)].
% 0.41/1.03 171 unpack1(i,i) = o. [back_rewrite(38),rewrite([167(3)])].
% 0.41/1.03 172 $F. [para(158(a,1),3(a,1,2)),rewrite([171(3)]),unit_del(a,39)].
% 0.41/1.03
% 0.41/1.03 % SZS output end Refutation
% 0.41/1.03 ============================== end of proof ==========================
% 0.41/1.03
% 0.41/1.03 ============================== STATISTICS ============================
% 0.41/1.03
% 0.41/1.03 Given=30. Generated=787. Kept=170. proofs=1.
% 0.41/1.03 Usable=21. Sos=82. Demods=9. Limbo=0, Disabled=72. Hints=0.
% 0.41/1.03 Megabytes=0.12.
% 0.41/1.03 User_CPU=0.03, System_CPU=0.00, Wall_clock=0.
% 0.41/1.03
% 0.41/1.03 ============================== end of statistics =====================
% 0.41/1.03
% 0.41/1.03 ============================== end of search =========================
% 0.41/1.03
% 0.41/1.03 THEOREM PROVED
% 0.41/1.03 % SZS status Unsatisfiable
% 0.41/1.03
% 0.41/1.03 Exiting with 1 proof.
% 0.41/1.03
% 0.41/1.03 Process 32019 exit (max_proofs) Fri Jun 17 04:31:12 2022
% 0.41/1.03 Prover9 interrupted
%------------------------------------------------------------------------------