TSTP Solution File: HWV052-1.002.001 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : HWV052-1.002.001 : TPTP v8.1.0. Released v4.1.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:02:06 EDT 2022
% Result : Unsatisfiable 2.82s 3.12s
% Output : Refutation 2.82s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.09/0.14 % Problem : HWV052-1.002.001 : TPTP v8.1.0. Released v4.1.0.
% 0.09/0.15 % Command : tptp2X_and_run_prover9 %d %s
% 0.14/0.36 % Computer : n027.cluster.edu
% 0.14/0.36 % Model : x86_64 x86_64
% 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36 % Memory : 8042.1875MB
% 0.14/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36 % CPULimit : 300
% 0.14/0.36 % WCLimit : 600
% 0.14/0.36 % DateTime : Fri Jun 17 06:27:36 EDT 2022
% 0.14/0.36 % CPUTime :
% 2.82/3.12 ============================== Prover9 ===============================
% 2.82/3.12 Prover9 (32) version 2009-11A, November 2009.
% 2.82/3.12 Process 7269 was started by sandbox on n027.cluster.edu,
% 2.82/3.12 Fri Jun 17 06:27:37 2022
% 2.82/3.12 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_7115_n027.cluster.edu".
% 2.82/3.12 ============================== end of head ===========================
% 2.82/3.12
% 2.82/3.12 ============================== INPUT =================================
% 2.82/3.12
% 2.82/3.12 % Reading from file /tmp/Prover9_7115_n027.cluster.edu
% 2.82/3.12
% 2.82/3.12 set(prolog_style_variables).
% 2.82/3.12 set(auto2).
% 2.82/3.12 % set(auto2) -> set(auto).
% 2.82/3.12 % set(auto) -> set(auto_inference).
% 2.82/3.12 % set(auto) -> set(auto_setup).
% 2.82/3.12 % set(auto_setup) -> set(predicate_elim).
% 2.82/3.12 % set(auto_setup) -> assign(eq_defs, unfold).
% 2.82/3.12 % set(auto) -> set(auto_limits).
% 2.82/3.12 % set(auto_limits) -> assign(max_weight, "100.000").
% 2.82/3.12 % set(auto_limits) -> assign(sos_limit, 20000).
% 2.82/3.12 % set(auto) -> set(auto_denials).
% 2.82/3.12 % set(auto) -> set(auto_process).
% 2.82/3.12 % set(auto2) -> assign(new_constants, 1).
% 2.82/3.12 % set(auto2) -> assign(fold_denial_max, 3).
% 2.82/3.12 % set(auto2) -> assign(max_weight, "200.000").
% 2.82/3.12 % set(auto2) -> assign(max_hours, 1).
% 2.82/3.12 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 2.82/3.12 % set(auto2) -> assign(max_seconds, 0).
% 2.82/3.12 % set(auto2) -> assign(max_minutes, 5).
% 2.82/3.12 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 2.82/3.12 % set(auto2) -> set(sort_initial_sos).
% 2.82/3.12 % set(auto2) -> assign(sos_limit, -1).
% 2.82/3.12 % set(auto2) -> assign(lrs_ticks, 3000).
% 2.82/3.12 % set(auto2) -> assign(max_megs, 400).
% 2.82/3.12 % set(auto2) -> assign(stats, some).
% 2.82/3.12 % set(auto2) -> clear(echo_input).
% 2.82/3.12 % set(auto2) -> set(quiet).
% 2.82/3.12 % set(auto2) -> clear(print_initial_clauses).
% 2.82/3.12 % set(auto2) -> clear(print_given).
% 2.82/3.12 assign(lrs_ticks,-1).
% 2.82/3.12 assign(sos_limit,10000).
% 2.82/3.12 assign(order,kbo).
% 2.82/3.12 set(lex_order_vars).
% 2.82/3.12 clear(print_given).
% 2.82/3.12
% 2.82/3.12 % formulas(sos). % not echoed (10 formulas)
% 2.82/3.12
% 2.82/3.12 ============================== end of input ==========================
% 2.82/3.12
% 2.82/3.12 % From the command line: assign(max_seconds, 300).
% 2.82/3.12
% 2.82/3.12 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 2.82/3.12
% 2.82/3.12 % Formulas that are not ordinary clauses:
% 2.82/3.12
% 2.82/3.12 ============================== end of process non-clausal formulas ===
% 2.82/3.12
% 2.82/3.12 ============================== PROCESS INITIAL CLAUSES ===============
% 2.82/3.12
% 2.82/3.12 ============================== PREDICATE ELIMINATION =================
% 2.82/3.12
% 2.82/3.12 ============================== end predicate elimination =============
% 2.82/3.12
% 2.82/3.12 Auto_denials: (non-Horn, no changes).
% 2.82/3.12
% 2.82/3.12 Term ordering decisions:
% 2.82/3.12
% 2.82/3.12 % Assigning unary symbol inv kb_weight 0 and highest precedence (7).
% 2.82/3.12 Function symbol KB weights: i=1. o=1. pack1=1. unpack1=1. unpack2=1. inv=0.
% 2.82/3.12
% 2.82/3.12 ============================== end of process initial clauses ========
% 2.82/3.12
% 2.82/3.12 ============================== CLAUSES FOR SEARCH ====================
% 2.82/3.12
% 2.82/3.12 ============================== end of clauses for search =============
% 2.82/3.12
% 2.82/3.12 ============================== SEARCH ================================
% 2.82/3.12
% 2.82/3.12 % Starting search at 0.01 seconds.
% 2.82/3.12
% 2.82/3.12 Low Water (keep): wt=26.000, iters=3486
% 2.82/3.12
% 2.82/3.12 Low Water (keep): wt=25.000, iters=3450
% 2.82/3.12
% 2.82/3.12 ============================== PROOF =================================
% 2.82/3.12 % SZS status Unsatisfiable
% 2.82/3.12 % SZS output start Refutation
% 2.82/3.12
% 2.82/3.12 % Proof 1 at 2.05 (+ 0.02) seconds.
% 2.82/3.12 % Length of proof is 56.
% 2.82/3.12 % Level of proof is 22.
% 2.82/3.12 % Maximum clause weight is 20.000.
% 2.82/3.12 % Given clauses 132.
% 2.82/3.12
% 2.82/3.12 1 A = o | A = i # label(bit_domain) # label(axiom). [assumption].
% 2.82/3.12 2 o = A | i = A. [copy(1),flip(a),flip(b)].
% 2.82/3.12 4 unpack2(A,B,pack1(A,B)) = B # label(unpack2) # label(axiom). [assumption].
% 2.82/3.12 5 unpack1(inv(A),B,pack1(A,B)) = A # label(unpack1_01) # label(axiom). [assumption].
% 2.82/3.12 8 unpack2(inv(A),B,pack1(A,B)) = B # label(unpack2_04) # label(axiom). [assumption].
% 2.82/3.12 9 unpack2(A,inv(B),pack1(A,B)) = B # label(unpack2_05) # label(axiom). [assumption].
% 2.82/3.12 10 unpack2(A,B,inv(pack1(A,B))) = B # label(unpack2_06) # label(axiom). [assumption].
% 2.82/3.12 11 inv(A) != A # label(bit_inverse) # label(axiom). [assumption].
% 2.82/3.12 12 i = A | A = B | i = B. [para(2(a,1),2(a,1))].
% 2.82/3.12 21 inv(A) = i | unpack2(o,B,pack1(A,B)) = B. [para(2(a,2),8(a,1,1)),flip(a)].
% 2.82/3.12 24 pack1(A,B) = i | unpack2(A,inv(B),o) = B. [para(2(a,2),9(a,1,3)),flip(a)].
% 2.82/3.12 27 inv(o) = i. [resolve(11,a,2,a(flip)),flip(a)].
% 2.82/3.12 28 inv(A) = i | o != A. [para(2(a,2),11(a,1)),flip(a)].
% 2.82/3.12 31 inv(i) = A | i = A. [resolve(12,a,11,a(flip))].
% 2.82/3.12 32 inv(A) = i | i = A. [resolve(12,b,11,a),flip(a)].
% 2.82/3.12 57 pack1(A,B) = C | i = C | unpack2(A,B,inv(i)) = B. [para(12(a,2),10(a,1,3,1))].
% 2.82/3.12 63 A = B | i = B | A = C | C = D | i = D. [para(12(a,1),12(a,1))].
% 2.82/3.12 71 unpack1(i,A,pack1(o,A)) = o. [para(27(a,1),5(a,1,1))].
% 2.82/3.12 74 unpack2(A,i,pack1(A,o)) = o. [para(27(a,1),9(a,1,2))].
% 2.82/3.12 75 o != i. [para(27(a,1),11(a,1)),flip(a)].
% 2.82/3.12 76 inv(inv(i)) = i. [resolve(31,a,28,b(flip)),flip(a),unit_del(a,75)].
% 2.82/3.12 94 A = B | i = B | inv(A) = C | i = C. [para(12(a,1),31(a,1,1))].
% 2.82/3.12 96 A = B | i = B | inv(A) = B. [factor(94,b,d)].
% 2.82/3.12 98 unpack1(i,A,pack1(inv(i),A)) = inv(i). [para(76(a,1),5(a,1,1))].
% 2.82/3.12 111 i = A | inv(A) = B | B = C | i = C. [para(32(a,2),12(a,1))].
% 2.82/3.12 113 i = A | inv(inv(A)) = B | i = B. [para(32(a,2),31(a,1,1))].
% 2.82/3.12 117 i = A | inv(A) = B | B = A. [factor(111,a,d)].
% 2.82/3.12 119 i = A | inv(inv(A)) = A. [factor(113,a,c)].
% 2.82/3.12 128 inv(i) = o. [para(31(a,2),71(a,1,3,1)),rewrite([98(8)]),flip(a),unit_del(a,75)].
% 2.82/3.12 130 pack1(A,B) = C | i = C | unpack2(A,B,o) = B. [back_rewrite(57),rewrite([128(6)])].
% 2.82/3.12 183 inv(inv(A)) = A | o != A. [para(119(a,1),75(a,2))].
% 2.82/3.12 187 inv(inv(A)) = A | inv(A) = o. [para(119(a,1),128(a,1,1))].
% 2.82/3.12 317 inv(A) = B | i = B | o = A | inv(A) = o. [para(12(a,2),187(a,1,1)),rewrite([128(6)])].
% 2.82/3.12 344 inv(A) = o | o = A. [factor(317,a,d),flip(b),unit_del(b,75)].
% 2.82/3.12 347 o = A | inv(inv(A)) = i. [resolve(344,a,28,b(flip))].
% 2.82/3.12 452 o = A | i = B | B = C | inv(inv(A)) = C. [para(347(b,2),12(c,1))].
% 2.82/3.12 516 o = A | inv(inv(A)) = A. [factor(452,a,c),flip(b),unit_del(b,75)].
% 2.82/3.12 544 inv(inv(A)) = A. [resolve(516,a,183,b),merge(b)].
% 2.82/3.12 1168 inv(A) = B | B = A | C = D | A = D | inv(C) = D. [para(117(a,1),96(b,1))].
% 2.82/3.12 1184 A = B | inv(A) = B | A = C | inv(A) = C. [factor(1168,d,e),rewrite([544(2)]),flip(b)].
% 2.82/3.12 1185 A = B | inv(A) = B. [factor(1184,a,c),merge(c)].
% 2.82/3.12 1221 inv(A) = B | inv(B) != A. [para(1185(b,2),11(a,1)),flip(a)].
% 2.82/3.12 1293 inv(A) = inv(B) | B != A. [para(544(a,1),1221(b,1))].
% 2.82/3.12 1294 A = B | inv(C) = A | B != C. [para(1185(b,1),1221(b,1))].
% 2.82/3.12 1402 inv(unpack2(A,inv(B),o)) = inv(B) | pack1(A,B) = i. [resolve(1293,b,24,b),flip(a)].
% 2.82/3.12 1783 pack1(A,o) = B | B = C | C = D | i = D | unpack2(A,i,i) = o. [para(63(b,2),74(a,1,3)),flip(a)].
% 2.82/3.12 2103 pack1(A,o) = B | unpack2(A,i,i) = B | unpack2(A,i,i) = o. [factor(1783,c,e),flip(b),flip(d),unit_del(d,75)].
% 2.82/3.12 2239 pack1(A,o) = o | unpack2(A,i,i) = o. [factor(2103,b,c)].
% 2.82/3.12 4279 A = B | inv(unpack2(o,B,pack1(C,B))) = A | inv(C) = i. [resolve(1294,c,21,b(flip))].
% 2.82/3.12 4291 inv(A) = i | inv(unpack2(o,i,pack1(A,i))) = inv(A). [factor(4279,a,c)].
% 2.82/3.12 6741 i = A | unpack2(B,C,o) = C | unpack2(B,C,A) = C. [para(130(a,1),4(a,1,3))].
% 2.82/3.12 6901 unpack2(A,B,o) = B. [factor(6741,b,c),flip(a),unit_del(a,75)].
% 2.82/3.12 6974 pack1(A,B) = i. [back_rewrite(1402),rewrite([6901(3),544(2)]),flip(a),unit_del(a,11)].
% 2.82/3.12 7040 unpack2(A,i,i) = o. [back_rewrite(2239),rewrite([6974(2)]),flip(a),unit_del(a,75)].
% 2.82/3.12 7069 inv(A) = i. [back_rewrite(4291),rewrite([6974(7),7040(7),27(5)]),flip(b),merge(b)].
% 2.82/3.12 7070 $F. [resolve(7069,a,11,a)].
% 2.82/3.12
% 2.82/3.12 % SZS output end Refutation
% 2.82/3.12 ============================== end of proof ==========================
% 2.82/3.12
% 2.82/3.12 ============================== STATISTICS ============================
% 2.82/3.12
% 2.82/3.12 Given=132. Generated=52061. Kept=7068. proofs=1.
% 2.82/3.12 Usable=89. Sos=4444. Demods=27. Limbo=112, Disabled=2432. Hints=0.
% 2.82/3.12 Megabytes=4.43.
% 2.82/3.12 User_CPU=2.05, System_CPU=0.02, Wall_clock=2.
% 2.82/3.12
% 2.82/3.12 ============================== end of statistics =====================
% 2.82/3.12
% 2.82/3.12 ============================== end of search =========================
% 2.82/3.12
% 2.82/3.12 THEOREM PROVED
% 2.82/3.12 % SZS status Unsatisfiable
% 2.82/3.12
% 2.82/3.12 Exiting with 1 proof.
% 2.82/3.12
% 2.82/3.12 Process 7269 exit (max_proofs) Fri Jun 17 06:27:39 2022
% 2.82/3.12 Prover9 interrupted
%------------------------------------------------------------------------------