TSTP Solution File: HEN007-5 by Otter---3.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : HEN007-5 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : otter-tptp-script %s
% Computer : n004.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:57:58 EDT 2022
% Result : Unsatisfiable 2.13s 2.34s
% Output : Refutation 2.13s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 8
% Syntax : Number of clauses : 24 ( 20 unt; 0 nHn; 7 RR)
% Number of literals : 32 ( 31 equ; 9 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 4 con; 0-2 aty)
% Number of variables : 36 ( 7 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
( divide(A,B) != zero
| divide(B,A) != zero
| A = B ),
file('HEN007-5.p',unknown),
[] ).
cnf(2,axiom,
( divide(A,B) != zero
| divide(B,C) != zero
| divide(A,C) = zero ),
file('HEN007-5.p',unknown),
[] ).
cnf(3,axiom,
divide(divide(c,b),divide(c,a)) != zero,
file('HEN007-5.p',unknown),
[] ).
cnf(4,axiom,
A = A,
file('HEN007-5.p',unknown),
[] ).
cnf(5,axiom,
divide(divide(A,B),A) = zero,
file('HEN007-5.p',unknown),
[] ).
cnf(7,axiom,
divide(divide(divide(A,B),divide(C,B)),divide(divide(A,C),B)) = zero,
file('HEN007-5.p',unknown),
[] ).
cnf(10,axiom,
divide(zero,A) = zero,
file('HEN007-5.p',unknown),
[] ).
cnf(13,axiom,
divide(a,b) = zero,
file('HEN007-5.p',unknown),
[] ).
cnf(17,plain,
( zero != zero
| divide(A,zero) != zero
| zero = A ),
inference(para_from,[status(thm),theory(equality)],[10,1]),
[iquote('para_from,9.1.1,1.1.1')] ).
cnf(26,plain,
divide(divide(divide(A,B),C),A) = zero,
inference(hyper,[status(thm)],[5,2,5]),
[iquote('hyper,5,2,5')] ).
cnf(32,plain,
( divide(A,divide(A,B)) != zero
| zero != zero
| divide(A,B) = A ),
inference(flip,[status(thm),theory(equality)],[inference(para_from,[status(thm),theory(equality)],[5,1])]),
[iquote('para_from,5.1.1,1.2.1,flip.3')] ).
cnf(38,plain,
divide(divide(divide(A,B),divide(C,B)),divide(A,C)) = zero,
inference(hyper,[status(thm)],[7,2,5]),
[iquote('hyper,7,2,5')] ).
cnf(43,plain,
divide(divide(divide(A,B),zero),divide(divide(A,zero),B)) = zero,
inference(para_into,[status(thm),theory(equality)],[7,10]),
[iquote('para_into,7.1.1.1.2,9.1.1')] ).
cnf(64,plain,
divide(divide(divide(A,A),divide(B,A)),zero) = zero,
inference(para_into,[status(thm),theory(equality)],[7,5]),
[iquote('para_into,7.1.1.2,5.1.1')] ).
cnf(345,plain,
divide(divide(A,A),divide(B,A)) = zero,
inference(flip,[status(thm),theory(equality)],[inference(hyper,[status(thm)],[64,17,4])]),
[iquote('hyper,64,17,4,flip.1')] ).
cnf(358,plain,
divide(divide(A,A),B) = zero,
inference(hyper,[status(thm)],[345,2,26]),
[iquote('hyper,345,2,26')] ).
cnf(361,plain,
divide(A,A) = zero,
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(hyper,[status(thm)],[345,1,26]),358,10])]),
[iquote('hyper,345,1,26,demod,358,10,flip.1')] ).
cnf(1152,plain,
divide(divide(divide(A,b),zero),divide(A,a)) = zero,
inference(para_into,[status(thm),theory(equality)],[38,13]),
[iquote('para_into,38.1.1.1.2,13.1.1')] ).
cnf(1681,plain,
divide(divide(divide(A,divide(A,zero)),zero),zero) = zero,
inference(para_into,[status(thm),theory(equality)],[43,361]),
[iquote('para_into,43.1.1.2,361.1.1')] ).
cnf(1726,plain,
divide(divide(A,divide(A,zero)),zero) = zero,
inference(flip,[status(thm),theory(equality)],[inference(hyper,[status(thm)],[1681,17,4])]),
[iquote('hyper,1681,17,4,flip.1')] ).
cnf(1988,plain,
divide(A,divide(A,zero)) = zero,
inference(flip,[status(thm),theory(equality)],[inference(hyper,[status(thm)],[1726,17,4])]),
[iquote('hyper,1726,17,4,flip.1')] ).
cnf(2102,plain,
divide(A,zero) = A,
inference(hyper,[status(thm)],[1988,32,4]),
[iquote('hyper,1988,32,4')] ).
cnf(2105,plain,
divide(divide(A,b),divide(A,a)) = zero,
inference(demod,[status(thm),theory(equality)],[inference(hyper,[status(thm)],[1988,2,1152]),2102,2102]),
[iquote('hyper,1988,2,1152,demod,2102,2102')] ).
cnf(2107,plain,
$false,
inference(binary,[status(thm)],[2105,3]),
[iquote('binary,2105.1,3.1')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12 % Problem : HEN007-5 : TPTP v8.1.0. Released v1.0.0.
% 0.10/0.12 % Command : otter-tptp-script %s
% 0.12/0.33 % Computer : n004.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 08:55:36 EDT 2022
% 0.12/0.33 % CPUTime :
% 2.13/2.34 ----- Otter 3.3f, August 2004 -----
% 2.13/2.34 The process was started by sandbox on n004.cluster.edu,
% 2.13/2.34 Wed Jul 27 08:55:36 2022
% 2.13/2.34 The command was "./otter". The process ID is 5352.
% 2.13/2.34
% 2.13/2.34 set(prolog_style_variables).
% 2.13/2.34 set(auto).
% 2.13/2.34 dependent: set(auto1).
% 2.13/2.34 dependent: set(process_input).
% 2.13/2.34 dependent: clear(print_kept).
% 2.13/2.34 dependent: clear(print_new_demod).
% 2.13/2.34 dependent: clear(print_back_demod).
% 2.13/2.34 dependent: clear(print_back_sub).
% 2.13/2.34 dependent: set(control_memory).
% 2.13/2.34 dependent: assign(max_mem, 12000).
% 2.13/2.34 dependent: assign(pick_given_ratio, 4).
% 2.13/2.34 dependent: assign(stats_level, 1).
% 2.13/2.34 dependent: assign(max_seconds, 10800).
% 2.13/2.34 clear(print_given).
% 2.13/2.34
% 2.13/2.34 list(usable).
% 2.13/2.34 0 [] A=A.
% 2.13/2.34 0 [] divide(divide(X,Y),X)=zero.
% 2.13/2.34 0 [] divide(divide(divide(X,Z),divide(Y,Z)),divide(divide(X,Y),Z))=zero.
% 2.13/2.34 0 [] divide(zero,X)=zero.
% 2.13/2.34 0 [] divide(X,Y)!=zero|divide(Y,X)!=zero|X=Y.
% 2.13/2.34 0 [] divide(X,identity)=zero.
% 2.13/2.34 0 [] divide(X,Y)!=zero|divide(Y,Z)!=zero|divide(X,Z)=zero.
% 2.13/2.34 0 [] divide(a,b)=zero.
% 2.13/2.34 0 [] divide(divide(c,b),divide(c,a))!=zero.
% 2.13/2.34 end_of_list.
% 2.13/2.34
% 2.13/2.34 SCAN INPUT: prop=0, horn=1, equality=1, symmetry=0, max_lits=3.
% 2.13/2.34
% 2.13/2.34 This is a Horn set with equality. The strategy will be
% 2.13/2.34 Knuth-Bendix and hyper_res, with positive clauses in
% 2.13/2.34 sos and nonpositive clauses in usable.
% 2.13/2.34
% 2.13/2.34 dependent: set(knuth_bendix).
% 2.13/2.34 dependent: set(anl_eq).
% 2.13/2.34 dependent: set(para_from).
% 2.13/2.34 dependent: set(para_into).
% 2.13/2.34 dependent: clear(para_from_right).
% 2.13/2.34 dependent: clear(para_into_right).
% 2.13/2.34 dependent: set(para_from_vars).
% 2.13/2.34 dependent: set(eq_units_both_ways).
% 2.13/2.34 dependent: set(dynamic_demod_all).
% 2.13/2.34 dependent: set(dynamic_demod).
% 2.13/2.34 dependent: set(order_eq).
% 2.13/2.34 dependent: set(back_demod).
% 2.13/2.34 dependent: set(lrpo).
% 2.13/2.34 dependent: set(hyper_res).
% 2.13/2.34 dependent: clear(order_hyper).
% 2.13/2.34
% 2.13/2.34 ------------> process usable:
% 2.13/2.34 ** KEPT (pick-wt=13): 1 [] divide(A,B)!=zero|divide(B,A)!=zero|A=B.
% 2.13/2.34 ** KEPT (pick-wt=15): 2 [] divide(A,B)!=zero|divide(B,C)!=zero|divide(A,C)=zero.
% 2.13/2.34 ** KEPT (pick-wt=9): 3 [] divide(divide(c,b),divide(c,a))!=zero.
% 2.13/2.34
% 2.13/2.34 ------------> process sos:
% 2.13/2.34 ** KEPT (pick-wt=3): 4 [] A=A.
% 2.13/2.34 ** KEPT (pick-wt=7): 5 [] divide(divide(A,B),A)=zero.
% 2.13/2.34 ---> New Demodulator: 6 [new_demod,5] divide(divide(A,B),A)=zero.
% 2.13/2.34 ** KEPT (pick-wt=15): 7 [] divide(divide(divide(A,B),divide(C,B)),divide(divide(A,C),B))=zero.
% 2.13/2.34 ---> New Demodulator: 8 [new_demod,7] divide(divide(divide(A,B),divide(C,B)),divide(divide(A,C),B))=zero.
% 2.13/2.34 ** KEPT (pick-wt=5): 9 [] divide(zero,A)=zero.
% 2.13/2.34 ---> New Demodulator: 10 [new_demod,9] divide(zero,A)=zero.
% 2.13/2.34 ** KEPT (pick-wt=5): 11 [] divide(A,identity)=zero.
% 2.13/2.34 ---> New Demodulator: 12 [new_demod,11] divide(A,identity)=zero.
% 2.13/2.34 ** KEPT (pick-wt=5): 13 [] divide(a,b)=zero.
% 2.13/2.34 ---> New Demodulator: 14 [new_demod,13] divide(a,b)=zero.
% 2.13/2.34 Following clause subsumed by 4 during input processing: 0 [copy,4,flip.1] A=A.
% 2.13/2.34 >>>> Starting back demodulation with 6.
% 2.13/2.34 >>>> Starting back demodulation with 8.
% 2.13/2.34 >>>> Starting back demodulation with 10.
% 2.13/2.34 >>>> Starting back demodulation with 12.
% 2.13/2.34 >>>> Starting back demodulation with 14.
% 2.13/2.34
% 2.13/2.34 ======= end of input processing =======
% 2.13/2.34
% 2.13/2.34 =========== start of search ===========
% 2.13/2.34
% 2.13/2.34 -------- PROOF --------
% 2.13/2.34
% 2.13/2.34 ----> UNIT CONFLICT at 0.47 sec ----> 2107 [binary,2105.1,3.1] $F.
% 2.13/2.34
% 2.13/2.34 Length of proof is 15. Level of proof is 9.
% 2.13/2.34
% 2.13/2.34 ---------------- PROOF ----------------
% 2.13/2.34 % SZS status Unsatisfiable
% 2.13/2.34 % SZS output start Refutation
% See solution above
% 2.13/2.34 ------------ end of proof -------------
% 2.13/2.34
% 2.13/2.34
% 2.13/2.34 Search stopped by max_proofs option.
% 2.13/2.34
% 2.13/2.34
% 2.13/2.34 Search stopped by max_proofs option.
% 2.13/2.34
% 2.13/2.34 ============ end of search ============
% 2.13/2.34
% 2.13/2.34 -------------- statistics -------------
% 2.13/2.34 clauses given 99
% 2.13/2.34 clauses generated 6520
% 2.13/2.34 clauses kept 1693
% 2.13/2.34 clauses forward subsumed 3874
% 2.13/2.34 clauses back subsumed 242
% 2.13/2.34 Kbytes malloced 3906
% 2.13/2.34
% 2.13/2.34 ----------- times (seconds) -----------
% 2.13/2.34 user CPU time 0.47 (0 hr, 0 min, 0 sec)
% 2.13/2.34 system CPU time 0.00 (0 hr, 0 min, 0 sec)
% 2.13/2.34 wall-clock time 2 (0 hr, 0 min, 2 sec)
% 2.13/2.34
% 2.13/2.34 That finishes the proof of the theorem.
% 2.13/2.34
% 2.13/2.34 Process 5352 finished Wed Jul 27 08:55:38 2022
% 2.13/2.34 Otter interrupted
% 2.13/2.35 PROOF FOUND
%------------------------------------------------------------------------------