TSTP Solution File: HWV052-1.001.001 by Otter---3.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : HWV052-1.001.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.93s 2.13s
% Output : Refutation 1.93s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 5
% Syntax : Number of clauses : 19 ( 11 unt; 8 nHn; 5 RR)
% Number of literals : 27 ( 26 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-2 aty)
% Number of variables : 15 ( 1 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
inv(A) != A,
file('HWV052-1.001.001.p',unknown),
[] ).
cnf(3,axiom,
( A = o
| A = i ),
file('HWV052-1.001.001.p',unknown),
[] ).
cnf(5,axiom,
unpack1(A,pack1(A)) = A,
file('HWV052-1.001.001.p',unknown),
[] ).
cnf(6,axiom,
unpack1(inv(A),pack1(A)) = A,
file('HWV052-1.001.001.p',unknown),
[] ).
cnf(8,axiom,
unpack1(A,inv(pack1(A))) = A,
file('HWV052-1.001.001.p',unknown),
[] ).
cnf(11,plain,
inv(o) = i,
inference(hyper,[status(thm)],[3,1]),
[iquote('hyper,3,1')] ).
cnf(12,plain,
inv(i) = o,
inference(hyper,[status(thm)],[3,1]),
[iquote('hyper,3,1')] ).
cnf(16,plain,
o != i,
inference(flip,[status(thm),theory(equality)],[inference(para_from,[status(thm),theory(equality)],[11,1])]),
[iquote('para_from,10.1.1,1.1.1,flip.1')] ).
cnf(17,plain,
( unpack1(A,i) = A
| pack1(A) = o ),
inference(para_into,[status(thm),theory(equality)],[5,3]),
[iquote('para_into,4.1.1.2,3.2.1')] ).
cnf(19,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(20,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(22,plain,
( inv(A) = o
| A = o ),
inference(para_from,[status(thm),theory(equality)],[19,12]),
[iquote('para_from,19.1.1,12.1.1.1')] ).
cnf(47,plain,
( unpack1(inv(A),i) = A
| pack1(A) = o ),
inference(flip,[status(thm),theory(equality)],[inference(para_into,[status(thm),theory(equality)],[6,20])]),
[iquote('para_into,6.1.1.2,20.2.1,flip.2')] ).
cnf(88,plain,
( unpack1(inv(A),o) = A
| inv(pack1(A)) = o ),
inference(para_from,[status(thm),theory(equality)],[22,6]),
[iquote('para_from,22.2.1,6.1.1.2')] ).
cnf(89,plain,
( unpack1(A,o) = A
| inv(pack1(A)) = o ),
inference(para_from,[status(thm),theory(equality)],[22,5]),
[iquote('para_from,22.2.1,4.1.1.2')] ).
cnf(123,plain,
unpack1(A,i) = A,
inference(factor_simp,[status(thm)],[inference(demod,[status(thm),theory(equality)],[inference(para_from,[status(thm),theory(equality)],[17,8]),11])]),
[iquote('para_from,17.2.1,8.1.1.2.1,demod,11,factor_simp')] ).
cnf(132,plain,
pack1(A) = o,
inference(unit_del,[status(thm)],[inference(demod,[status(thm),theory(equality)],[inference(back_demod,[status(thm)],[47]),123]),1]),
[iquote('back_demod,47,demod,123,unit_del,1')] ).
cnf(134,plain,
unpack1(A,o) = A,
inference(unit_del,[status(thm)],[inference(demod,[status(thm),theory(equality)],[inference(back_demod,[status(thm)],[89]),132,11]),16]),
[iquote('back_demod,89,demod,132,11,unit_del,16')] ).
cnf(135,plain,
$false,
inference(unit_del,[status(thm)],[inference(demod,[status(thm),theory(equality)],[inference(back_demod,[status(thm)],[88]),134,132,11]),1,16]),
[iquote('back_demod,88,demod,134,132,11,unit_del,1,16')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.14 % Problem : HWV052-1.001.001 : TPTP v8.1.0. Released v4.1.0.
% 0.10/0.15 % Command : otter-tptp-script %s
% 0.12/0.36 % Computer : n015.cluster.edu
% 0.12/0.36 % Model : x86_64 x86_64
% 0.12/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.36 % Memory : 8042.1875MB
% 0.12/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.36 % CPULimit : 300
% 0.12/0.36 % WCLimit : 300
% 0.12/0.36 % DateTime : Wed Jul 27 06:53:27 EDT 2022
% 0.12/0.36 % CPUTime :
% 1.93/2.13 ----- Otter 3.3f, August 2004 -----
% 1.93/2.13 The process was started by sandbox on n015.cluster.edu,
% 1.93/2.13 Wed Jul 27 06:53:27 2022
% 1.93/2.13 The command was "./otter". The process ID is 28282.
% 1.93/2.13
% 1.93/2.13 set(prolog_style_variables).
% 1.93/2.13 set(auto).
% 1.93/2.13 dependent: set(auto1).
% 1.93/2.13 dependent: set(process_input).
% 1.93/2.13 dependent: clear(print_kept).
% 1.93/2.13 dependent: clear(print_new_demod).
% 1.93/2.13 dependent: clear(print_back_demod).
% 1.93/2.13 dependent: clear(print_back_sub).
% 1.93/2.13 dependent: set(control_memory).
% 1.93/2.13 dependent: assign(max_mem, 12000).
% 1.93/2.13 dependent: assign(pick_given_ratio, 4).
% 1.93/2.13 dependent: assign(stats_level, 1).
% 1.93/2.13 dependent: assign(max_seconds, 10800).
% 1.93/2.13 clear(print_given).
% 1.93/2.13
% 1.93/2.13 list(usable).
% 1.93/2.13 0 [] A=A.
% 1.93/2.13 0 [] X=o|X=i.
% 1.93/2.13 0 [] inv(X)!=X.
% 1.93/2.13 0 [] unpack1(X1,pack1(X1))=X1.
% 1.93/2.13 0 [] unpack1(inv(X1),pack1(X1))=X1.
% 1.93/2.13 0 [] unpack1(X1,inv(pack1(X1)))=X1.
% 1.93/2.13 end_of_list.
% 1.93/2.13
% 1.93/2.13 SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=2.
% 1.93/2.13
% 1.93/2.13 This ia a non-Horn set with equality. The strategy will be
% 1.93/2.13 Knuth-Bendix, ordered hyper_res, factoring, and unit
% 1.93/2.13 deletion, with positive clauses in sos and nonpositive
% 1.93/2.13 clauses in usable.
% 1.93/2.13
% 1.93/2.13 dependent: set(knuth_bendix).
% 1.93/2.13 dependent: set(anl_eq).
% 1.93/2.13 dependent: set(para_from).
% 1.93/2.13 dependent: set(para_into).
% 1.93/2.13 dependent: clear(para_from_right).
% 1.93/2.13 dependent: clear(para_into_right).
% 1.93/2.13 dependent: set(para_from_vars).
% 1.93/2.13 dependent: set(eq_units_both_ways).
% 1.93/2.13 dependent: set(dynamic_demod_all).
% 1.93/2.13 dependent: set(dynamic_demod).
% 1.93/2.13 dependent: set(order_eq).
% 1.93/2.13 dependent: set(back_demod).
% 1.93/2.13 dependent: set(lrpo).
% 1.93/2.13 dependent: set(hyper_res).
% 1.93/2.13 dependent: set(unit_deletion).
% 1.93/2.13 dependent: set(factor).
% 1.93/2.13
% 1.93/2.13 ------------> process usable:
% 1.93/2.13 ** KEPT (pick-wt=4): 1 [] inv(A)!=A.
% 1.93/2.13
% 1.93/2.13 ------------> process sos:
% 1.93/2.13 ** KEPT (pick-wt=3): 2 [] A=A.
% 1.93/2.13 ** KEPT (pick-wt=6): 3 [] A=o|A=i.
% 1.93/2.13 ** KEPT (pick-wt=6): 4 [] unpack1(A,pack1(A))=A.
% 1.93/2.13 ---> New Demodulator: 5 [new_demod,4] unpack1(A,pack1(A))=A.
% 1.93/2.13 ** KEPT (pick-wt=7): 6 [] unpack1(inv(A),pack1(A))=A.
% 1.93/2.13 ---> New Demodulator: 7 [new_demod,6] unpack1(inv(A),pack1(A))=A.
% 1.93/2.13 ** KEPT (pick-wt=7): 8 [] unpack1(A,inv(pack1(A)))=A.
% 1.93/2.13 ---> New Demodulator: 9 [new_demod,8] unpack1(A,inv(pack1(A)))=A.
% 1.93/2.13 Following clause subsumed by 2 during input processing: 0 [copy,2,flip.1] A=A.
% 1.93/2.13 >>>> Starting back demodulation with 5.
% 1.93/2.13 >>>> Starting back demodulation with 7.
% 1.93/2.13 >>>> Starting back demodulation with 9.
% 1.93/2.13
% 1.93/2.13 ======= end of input processing =======
% 1.93/2.13
% 1.93/2.13 =========== start of search ===========
% 1.93/2.13
% 1.93/2.13 -------- PROOF --------
% 1.93/2.13
% 1.93/2.13 -----> EMPTY CLAUSE at 0.01 sec ----> 135 [back_demod,88,demod,134,132,11,unit_del,1,16] $F.
% 1.93/2.13
% 1.93/2.13 Length of proof is 13. Level of proof is 4.
% 1.93/2.13
% 1.93/2.13 ---------------- PROOF ----------------
% 1.93/2.13 % SZS status Unsatisfiable
% 1.93/2.13 % SZS output start Refutation
% See solution above
% 1.93/2.13 ------------ end of proof -------------
% 1.93/2.13
% 1.93/2.13
% 1.93/2.13 Search stopped by max_proofs option.
% 1.93/2.13
% 1.93/2.13
% 1.93/2.13 Search stopped by max_proofs option.
% 1.93/2.13
% 1.93/2.13 ============ end of search ============
% 1.93/2.13
% 1.93/2.13 -------------- statistics -------------
% 1.93/2.13 clauses given 21
% 1.93/2.13 clauses generated 557
% 1.93/2.13 clauses kept 121
% 1.93/2.13 clauses forward subsumed 460
% 1.93/2.13 clauses back subsumed 0
% 1.93/2.13 Kbytes malloced 976
% 1.93/2.13
% 1.93/2.13 ----------- times (seconds) -----------
% 1.93/2.13 user CPU time 0.01 (0 hr, 0 min, 0 sec)
% 1.93/2.13 system CPU time 0.00 (0 hr, 0 min, 0 sec)
% 1.93/2.13 wall-clock time 1 (0 hr, 0 min, 1 sec)
% 1.93/2.13
% 1.93/2.13 That finishes the proof of the theorem.
% 1.93/2.13
% 1.93/2.13 Process 28282 finished Wed Jul 27 06:53:28 2022
% 1.93/2.13 Otter interrupted
% 1.93/2.13 PROOF FOUND
%------------------------------------------------------------------------------