TSTP Solution File: HWV052-1.002.001 by Otter---3.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : HWV052-1.002.001 : TPTP v8.1.0. Released v4.1.0.
% Transfm : none
% Format : tptp:raw
% Command : otter-tptp-script %s
% Computer : n015.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 : 300s
% DateTime : Wed Jul 27 12:58:26 EDT 2022
% Result : Unsatisfiable 1.96s 2.19s
% Output : Refutation 1.96s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 5
% Syntax : Number of clauses : 21 ( 11 unt; 10 nHn; 5 RR)
% Number of literals : 31 ( 30 equ; 2 neg)
% Maximal clause size : 2 ( 1 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 2 con; 0-3 aty)
% Number of variables : 27 ( 4 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
inv(A) != A,
file('HWV052-1.002.001.p',unknown),
[] ).
cnf(3,axiom,
( A = o
| A = i ),
file('HWV052-1.002.001.p',unknown),
[] ).
cnf(5,axiom,
unpack1(A,B,pack1(A,B)) = A,
file('HWV052-1.002.001.p',unknown),
[] ).
cnf(6,axiom,
unpack1(inv(A),B,pack1(A,B)) = A,
file('HWV052-1.002.001.p',unknown),
[] ).
cnf(10,axiom,
unpack1(A,B,inv(pack1(A,B))) = A,
file('HWV052-1.002.001.p',unknown),
[] ).
cnf(21,plain,
inv(o) = i,
inference(hyper,[status(thm)],[3,1]),
[iquote('hyper,3,1')] ).
cnf(23,plain,
inv(i) = o,
inference(hyper,[status(thm)],[3,1]),
[iquote('hyper,3,1')] ).
cnf(26,plain,
o != i,
inference(flip,[status(thm),theory(equality)],[inference(para_from,[status(thm),theory(equality)],[21,1])]),
[iquote('para_from,20.1.1,1.1.1,flip.1')] ).
cnf(27,plain,
( unpack1(A,B,i) = A
| pack1(A,B) = o ),
inference(para_into,[status(thm),theory(equality)],[5,3]),
[iquote('para_into,4.1.1.3,3.2.1')] ).
cnf(29,plain,
( i = A
| A = o ),
inference(demod,[status(thm),theory(equality)],[inference(para_into,[status(thm),theory(equality)],[5,3]),5]),
[iquote('para_into,4.1.1,3.2.1,demod,5')] ).
cnf(30,plain,
( o = A
| A = i ),
inference(demod,[status(thm),theory(equality)],[inference(para_into,[status(thm),theory(equality)],[5,3]),5]),
[iquote('para_into,4.1.1,3.1.1,demod,5')] ).
cnf(32,plain,
( inv(A) = o
| A = o ),
inference(para_from,[status(thm),theory(equality)],[29,23]),
[iquote('para_from,29.1.1,22.1.1.1')] ).
cnf(35,plain,
( inv(A) = i
| A = i ),
inference(para_from,[status(thm),theory(equality)],[30,21]),
[iquote('para_from,30.1.1,20.1.1.1')] ).
cnf(57,plain,
( unpack1(inv(A),B,i) = A
| pack1(A,B) = o ),
inference(flip,[status(thm),theory(equality)],[inference(para_into,[status(thm),theory(equality)],[6,30])]),
[iquote('para_into,6.1.1.3,30.2.1,flip.2')] ).
cnf(104,plain,
( A = o
| inv(inv(A)) = i ),
inference(unit_del,[status(thm)],[inference(para_from,[status(thm),theory(equality)],[35,32]),26]),
[iquote('para_from,35.2.1,32.1.1,unit_del,26')] ).
cnf(406,plain,
( unpack1(inv(A),B,o) = A
| inv(inv(pack1(A,B))) = i ),
inference(para_from,[status(thm),theory(equality)],[104,6]),
[iquote('para_from,104.1.1,6.1.1.3')] ).
cnf(407,plain,
( unpack1(A,B,o) = A
| inv(inv(pack1(A,B))) = i ),
inference(para_from,[status(thm),theory(equality)],[104,5]),
[iquote('para_from,104.1.1,4.1.1.3')] ).
cnf(504,plain,
unpack1(A,B,i) = A,
inference(factor_simp,[status(thm)],[inference(demod,[status(thm),theory(equality)],[inference(para_from,[status(thm),theory(equality)],[27,10]),21])]),
[iquote('para_from,27.2.1,10.1.1.3.1,demod,21,factor_simp')] ).
cnf(517,plain,
pack1(A,B) = o,
inference(unit_del,[status(thm)],[inference(demod,[status(thm),theory(equality)],[inference(back_demod,[status(thm)],[57]),504]),1]),
[iquote('back_demod,57,demod,504,unit_del,1')] ).
cnf(519,plain,
unpack1(A,B,o) = A,
inference(unit_del,[status(thm)],[inference(demod,[status(thm),theory(equality)],[inference(back_demod,[status(thm)],[407]),517,21,23]),26]),
[iquote('back_demod,407,demod,517,21,23,unit_del,26')] ).
cnf(520,plain,
$false,
inference(unit_del,[status(thm)],[inference(demod,[status(thm),theory(equality)],[inference(back_demod,[status(thm)],[406]),519,517,21,23]),1,26]),
[iquote('back_demod,406,demod,519,517,21,23,unit_del,1,26')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : HWV052-1.002.001 : TPTP v8.1.0. Released v4.1.0.
% 0.03/0.12 % Command : otter-tptp-script %s
% 0.12/0.33 % Computer : n015.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 300
% 0.12/0.33 % DateTime : Wed Jul 27 06:56:42 EDT 2022
% 0.12/0.33 % CPUTime :
% 1.96/2.19 ----- Otter 3.3f, August 2004 -----
% 1.96/2.19 The process was started by sandbox2 on n015.cluster.edu,
% 1.96/2.19 Wed Jul 27 06:56:42 2022
% 1.96/2.19 The command was "./otter". The process ID is 2602.
% 1.96/2.19
% 1.96/2.19 set(prolog_style_variables).
% 1.96/2.19 set(auto).
% 1.96/2.19 dependent: set(auto1).
% 1.96/2.19 dependent: set(process_input).
% 1.96/2.19 dependent: clear(print_kept).
% 1.96/2.19 dependent: clear(print_new_demod).
% 1.96/2.19 dependent: clear(print_back_demod).
% 1.96/2.19 dependent: clear(print_back_sub).
% 1.96/2.19 dependent: set(control_memory).
% 1.96/2.19 dependent: assign(max_mem, 12000).
% 1.96/2.19 dependent: assign(pick_given_ratio, 4).
% 1.96/2.19 dependent: assign(stats_level, 1).
% 1.96/2.19 dependent: assign(max_seconds, 10800).
% 1.96/2.19 clear(print_given).
% 1.96/2.19
% 1.96/2.19 list(usable).
% 1.96/2.19 0 [] A=A.
% 1.96/2.19 0 [] X=o|X=i.
% 1.96/2.19 0 [] inv(X)!=X.
% 1.96/2.19 0 [] unpack1(X1,X2,pack1(X1,X2))=X1.
% 1.96/2.19 0 [] unpack1(inv(X1),X2,pack1(X1,X2))=X1.
% 1.96/2.19 0 [] unpack1(X1,inv(X2),pack1(X1,X2))=X1.
% 1.96/2.19 0 [] unpack1(X1,X2,inv(pack1(X1,X2)))=X1.
% 1.96/2.19 0 [] unpack2(X1,X2,pack1(X1,X2))=X2.
% 1.96/2.19 0 [] unpack2(inv(X1),X2,pack1(X1,X2))=X2.
% 1.96/2.19 0 [] unpack2(X1,inv(X2),pack1(X1,X2))=X2.
% 1.96/2.19 0 [] unpack2(X1,X2,inv(pack1(X1,X2)))=X2.
% 1.96/2.19 end_of_list.
% 1.96/2.19
% 1.96/2.19 SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=2.
% 1.96/2.19
% 1.96/2.19 This ia a non-Horn set with equality. The strategy will be
% 1.96/2.19 Knuth-Bendix, ordered hyper_res, factoring, and unit
% 1.96/2.19 deletion, with positive clauses in sos and nonpositive
% 1.96/2.19 clauses in usable.
% 1.96/2.19
% 1.96/2.19 dependent: set(knuth_bendix).
% 1.96/2.19 dependent: set(anl_eq).
% 1.96/2.19 dependent: set(para_from).
% 1.96/2.19 dependent: set(para_into).
% 1.96/2.19 dependent: clear(para_from_right).
% 1.96/2.19 dependent: clear(para_into_right).
% 1.96/2.19 dependent: set(para_from_vars).
% 1.96/2.19 dependent: set(eq_units_both_ways).
% 1.96/2.19 dependent: set(dynamic_demod_all).
% 1.96/2.19 dependent: set(dynamic_demod).
% 1.96/2.19 dependent: set(order_eq).
% 1.96/2.19 dependent: set(back_demod).
% 1.96/2.19 dependent: set(lrpo).
% 1.96/2.19 dependent: set(hyper_res).
% 1.96/2.19 dependent: set(unit_deletion).
% 1.96/2.19 dependent: set(factor).
% 1.96/2.19
% 1.96/2.19 ------------> process usable:
% 1.96/2.19 ** KEPT (pick-wt=4): 1 [] inv(A)!=A.
% 1.96/2.19
% 1.96/2.19 ------------> process sos:
% 1.96/2.19 ** KEPT (pick-wt=3): 2 [] A=A.
% 1.96/2.19 ** KEPT (pick-wt=6): 3 [] A=o|A=i.
% 1.96/2.19 ** KEPT (pick-wt=8): 4 [] unpack1(A,B,pack1(A,B))=A.
% 1.96/2.19 ---> New Demodulator: 5 [new_demod,4] unpack1(A,B,pack1(A,B))=A.
% 1.96/2.19 ** KEPT (pick-wt=9): 6 [] unpack1(inv(A),B,pack1(A,B))=A.
% 1.96/2.19 ---> New Demodulator: 7 [new_demod,6] unpack1(inv(A),B,pack1(A,B))=A.
% 1.96/2.19 ** KEPT (pick-wt=9): 8 [] unpack1(A,inv(B),pack1(A,B))=A.
% 1.96/2.19 ---> New Demodulator: 9 [new_demod,8] unpack1(A,inv(B),pack1(A,B))=A.
% 1.96/2.19 ** KEPT (pick-wt=9): 10 [] unpack1(A,B,inv(pack1(A,B)))=A.
% 1.96/2.19 ---> New Demodulator: 11 [new_demod,10] unpack1(A,B,inv(pack1(A,B)))=A.
% 1.96/2.19 ** KEPT (pick-wt=8): 12 [] unpack2(A,B,pack1(A,B))=B.
% 1.96/2.19 ---> New Demodulator: 13 [new_demod,12] unpack2(A,B,pack1(A,B))=B.
% 1.96/2.19 ** KEPT (pick-wt=9): 14 [] unpack2(inv(A),B,pack1(A,B))=B.
% 1.96/2.19 ---> New Demodulator: 15 [new_demod,14] unpack2(inv(A),B,pack1(A,B))=B.
% 1.96/2.19 ** KEPT (pick-wt=9): 16 [] unpack2(A,inv(B),pack1(A,B))=B.
% 1.96/2.19 ---> New Demodulator: 17 [new_demod,16] unpack2(A,inv(B),pack1(A,B))=B.
% 1.96/2.19 ** KEPT (pick-wt=9): 18 [] unpack2(A,B,inv(pack1(A,B)))=B.
% 1.96/2.19 ---> New Demodulator: 19 [new_demod,18] unpack2(A,B,inv(pack1(A,B)))=B.
% 1.96/2.19 Following clause subsumed by 2 during input processing: 0 [copy,2,flip.1] A=A.
% 1.96/2.19 >>>> Starting back demodulation with 5.
% 1.96/2.19 >>>> Starting back demodulation with 7.
% 1.96/2.19 >>>> Starting back demodulation with 9.
% 1.96/2.19 >>>> Starting back demodulation with 11.
% 1.96/2.19 >>>> Starting back demodulation with 13.
% 1.96/2.19 >>>> Starting back demodulation with 15.
% 1.96/2.19 >>>> Starting back demodulation with 17.
% 1.96/2.19 >>>> Starting back demodulation with 19.
% 1.96/2.19
% 1.96/2.19 ======= end of input processing =======
% 1.96/2.19
% 1.96/2.19 =========== start of search ===========
% 1.96/2.19
% 1.96/2.19 -------- PROOF --------
% 1.96/2.19
% 1.96/2.19 -----> EMPTY CLAUSE at 0.07 sec ----> 520 [back_demod,406,demod,519,517,21,23,unit_del,1,26] $F.
% 1.96/2.19
% 1.96/2.19 Length of proof is 15. Level of proof is 5.
% 1.96/2.19
% 1.96/2.19 ---------------- PROOF ----------------
% 1.96/2.19 % SZS status Unsatisfiable
% 1.96/2.19 % SZS output start Refutation
% See solution above
% 1.96/2.19 ------------ end of proof -------------
% 1.96/2.19
% 1.96/2.19
% 1.96/2.19 Search stopped by max_proofs option.
% 1.96/2.19
% 1.96/2.19
% 1.96/2.19 Search stopped by max_proofs option.
% 1.96/2.19
% 1.96/2.19 ============ end of search ============
% 1.96/2.19
% 1.96/2.19 -------------- statistics -------------
% 1.96/2.19 clauses given 46
% 1.96/2.19 clauses generated 2951
% 1.96/2.19 clauses kept 493
% 1.96/2.19 clauses forward subsumed 2489
% 1.96/2.19 clauses back subsumed 0
% 1.96/2.19 Kbytes malloced 1953
% 1.96/2.19
% 1.96/2.19 ----------- times (seconds) -----------
% 1.96/2.19 user CPU time 0.07 (0 hr, 0 min, 0 sec)
% 1.96/2.19 system CPU time 0.00 (0 hr, 0 min, 0 sec)
% 1.96/2.19 wall-clock time 1 (0 hr, 0 min, 1 sec)
% 1.96/2.19
% 1.96/2.19 That finishes the proof of the theorem.
% 1.96/2.19
% 1.96/2.19 Process 2602 finished Wed Jul 27 06:56:43 2022
% 1.96/2.19 Otter interrupted
% 1.96/2.19 PROOF FOUND
%------------------------------------------------------------------------------