%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : HEN006-5 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : otter-tptp-script %s
% Computer : n023.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:57 EDT 2022
% Result : Unsatisfiable 2.00s 2.18s
% Output : Refutation 2.00s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 7
% Syntax : Number of clauses : 14 ( 12 unt; 0 nHn; 7 RR)
% Number of literals : 18 ( 17 equ; 5 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 : 21 ( 5 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
( divide(A,B) != zero
| divide(B,A) != zero
| A = B ),
file('HEN006-5.p',unknown),
[] ).
cnf(2,axiom,
divide(divide(a,d),b) != zero,
file('HEN006-5.p',unknown),
[] ).
cnf(4,axiom,
divide(divide(A,B),A) = zero,
file('HEN006-5.p',unknown),
[] ).
cnf(6,axiom,
divide(divide(divide(A,B),divide(C,B)),divide(divide(A,C),B)) = zero,
file('HEN006-5.p',unknown),
[] ).
cnf(9,axiom,
divide(zero,A) = zero,
file('HEN006-5.p',unknown),
[] ).
cnf(13,axiom,
divide(A,zero) = A,
file('HEN006-5.p',unknown),
[] ).
cnf(14,axiom,
divide(divide(a,b),d) = zero,
file('HEN006-5.p',unknown),
[] ).
cnf(24,plain,
( divide(A,B) = zero
| divide(divide(B,C),A) != zero
| divide(A,divide(B,C)) != zero ),
inference(para_into,[status(thm),theory(equality)],[4,1]),
[iquote('para_into,4.1.1.1,1.3.1')] ).
cnf(29,plain,
divide(divide(A,B),divide(divide(A,divide(B,C)),B)) = zero,
inference(demod,[status(thm),theory(equality)],[inference(para_into,[status(thm),theory(equality)],[6,4]),13]),
[iquote('para_into,6.1.1.1.2,4.1.1,demod,13')] ).
cnf(37,plain,
divide(divide(divide(A,B),C),divide(A,C)) = zero,
inference(demod,[status(thm),theory(equality)],[inference(para_into,[status(thm),theory(equality)],[6,4]),9,13]),
[iquote('para_into,6.1.1.2.1,4.1.1,demod,9,13')] ).
cnf(53,plain,
divide(divide(a,d),divide(b,d)) = zero,
inference(demod,[status(thm),theory(equality)],[inference(para_from,[status(thm),theory(equality)],[14,6]),13]),
[iquote('para_from,14.1.1,6.1.1.2,demod,13')] ).
cnf(602,plain,
divide(divide(A,B),divide(A,divide(B,C))) = zero,
inference(hyper,[status(thm)],[29,24,37]),
[iquote('hyper,29,24,37')] ).
cnf(616,plain,
divide(divide(a,d),b) = zero,
inference(demod,[status(thm),theory(equality)],[inference(para_into,[status(thm),theory(equality)],[602,53]),13]),
[iquote('para_into,602.1.1.2,53.1.1,demod,13')] ).
cnf(618,plain,
$false,
inference(binary,[status(thm)],[616,2]),
[iquote('binary,616.1,2.1')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.11 % Problem : HEN006-5 : TPTP v8.1.0. Released v1.0.0.
% 0.07/0.12 % Command : otter-tptp-script %s
% 0.12/0.33 % Computer : n023.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 09:20:18 EDT 2022
% 0.12/0.33 % CPUTime :
% 2.00/2.17 ----- Otter 3.3f, August 2004 -----
% 2.00/2.17 The process was started by sandbox on n023.cluster.edu,
% 2.00/2.17 Wed Jul 27 09:20:18 2022
% 2.00/2.17 The command was "./otter". The process ID is 1679.
% 2.00/2.17
% 2.00/2.17 set(prolog_style_variables).
% 2.00/2.17 set(auto).
% 2.00/2.17 dependent: set(auto1).
% 2.00/2.17 dependent: set(process_input).
% 2.00/2.17 dependent: clear(print_kept).
% 2.00/2.17 dependent: clear(print_new_demod).
% 2.00/2.17 dependent: clear(print_back_demod).
% 2.00/2.17 dependent: clear(print_back_sub).
% 2.00/2.17 dependent: set(control_memory).
% 2.00/2.17 dependent: assign(max_mem, 12000).
% 2.00/2.17 dependent: assign(pick_given_ratio, 4).
% 2.00/2.17 dependent: assign(stats_level, 1).
% 2.00/2.17 dependent: assign(max_seconds, 10800).
% 2.00/2.17 clear(print_given).
% 2.00/2.17
% 2.00/2.17 list(usable).
% 2.00/2.17 0 [] A=A.
% 2.00/2.17 0 [] divide(divide(X,Y),X)=zero.
% 2.00/2.17 0 [] divide(divide(divide(X,Z),divide(Y,Z)),divide(divide(X,Y),Z))=zero.
% 2.00/2.17 0 [] divide(zero,X)=zero.
% 2.00/2.17 0 [] divide(X,Y)!=zero|divide(Y,X)!=zero|X=Y.
% 2.00/2.17 0 [] divide(X,identity)=zero.
% 2.00/2.17 0 [] divide(X,zero)=X.
% 2.00/2.17 0 [] divide(divide(a,b),d)=zero.
% 2.00/2.17 0 [] divide(divide(a,d),b)!=zero.
% 2.00/2.17 end_of_list.
% 2.00/2.17
% 2.00/2.17 SCAN INPUT: prop=0, horn=1, equality=1, symmetry=0, max_lits=3.
% 2.00/2.17
% 2.00/2.17 This is a Horn set with equality. The strategy will be
% 2.00/2.17 Knuth-Bendix and hyper_res, with positive clauses in
% 2.00/2.17 sos and nonpositive clauses in usable.
% 2.00/2.17
% 2.00/2.17 dependent: set(knuth_bendix).
% 2.00/2.17 dependent: set(anl_eq).
% 2.00/2.17 dependent: set(para_from).
% 2.00/2.17 dependent: set(para_into).
% 2.00/2.17 dependent: clear(para_from_right).
% 2.00/2.17 dependent: clear(para_into_right).
% 2.00/2.17 dependent: set(para_from_vars).
% 2.00/2.17 dependent: set(eq_units_both_ways).
% 2.00/2.17 dependent: set(dynamic_demod_all).
% 2.00/2.17 dependent: set(dynamic_demod).
% 2.00/2.17 dependent: set(order_eq).
% 2.00/2.17 dependent: set(back_demod).
% 2.00/2.17 dependent: set(lrpo).
% 2.00/2.17 dependent: set(hyper_res).
% 2.00/2.17 dependent: clear(order_hyper).
% 2.00/2.17
% 2.00/2.17 ------------> process usable:
% 2.00/2.17 ** KEPT (pick-wt=13): 1 [] divide(A,B)!=zero|divide(B,A)!=zero|A=B.
% 2.00/2.17 ** KEPT (pick-wt=7): 2 [] divide(divide(a,d),b)!=zero.
% 2.00/2.17
% 2.00/2.17 ------------> process sos:
% 2.00/2.17 ** KEPT (pick-wt=3): 3 [] A=A.
% 2.00/2.17 ** KEPT (pick-wt=7): 4 [] divide(divide(A,B),A)=zero.
% 2.00/2.17 ---> New Demodulator: 5 [new_demod,4] divide(divide(A,B),A)=zero.
% 2.00/2.17 ** KEPT (pick-wt=15): 6 [] divide(divide(divide(A,B),divide(C,B)),divide(divide(A,C),B))=zero.
% 2.00/2.18 ---> New Demodulator: 7 [new_demod,6] divide(divide(divide(A,B),divide(C,B)),divide(divide(A,C),B))=zero.
% 2.00/2.18 ** KEPT (pick-wt=5): 8 [] divide(zero,A)=zero.
% 2.00/2.18 ---> New Demodulator: 9 [new_demod,8] divide(zero,A)=zero.
% 2.00/2.18 ** KEPT (pick-wt=5): 10 [] divide(A,identity)=zero.
% 2.00/2.18 ---> New Demodulator: 11 [new_demod,10] divide(A,identity)=zero.
% 2.00/2.18 ** KEPT (pick-wt=5): 12 [] divide(A,zero)=A.
% 2.00/2.18 ---> New Demodulator: 13 [new_demod,12] divide(A,zero)=A.
% 2.00/2.18 ** KEPT (pick-wt=7): 14 [] divide(divide(a,b),d)=zero.
% 2.00/2.18 ---> New Demodulator: 15 [new_demod,14] divide(divide(a,b),d)=zero.
% 2.00/2.18 Following clause subsumed by 3 during input processing: 0 [copy,3,flip.1] A=A.
% 2.00/2.18 >>>> Starting back demodulation with 5.
% 2.00/2.18 >>>> Starting back demodulation with 7.
% 2.00/2.18 >>>> Starting back demodulation with 9.
% 2.00/2.18 >>>> Starting back demodulation with 11.
% 2.00/2.18 >>>> Starting back demodulation with 13.
% 2.00/2.18 >>>> Starting back demodulation with 15.
% 2.00/2.18
% 2.00/2.18 ======= end of input processing =======
% 2.00/2.18
% 2.00/2.18 =========== start of search ===========
% 2.00/2.18
% 2.00/2.18 -------- PROOF --------
% 2.00/2.18
% 2.00/2.18 ----> UNIT CONFLICT at 0.09 sec ----> 618 [binary,616.1,2.1] $F.
% 2.00/2.18
% 2.00/2.18 Length of proof is 6. Level of proof is 3.
% 2.00/2.18
% 2.00/2.18 ---------------- PROOF ----------------
% 2.00/2.18 % SZS status Unsatisfiable
% 2.00/2.18 % SZS output start Refutation
% See solution above
% 2.00/2.18 ------------ end of proof -------------
% 2.00/2.18
% 2.00/2.18
% 2.00/2.18 Search stopped by max_proofs option.
% 2.00/2.18
% 2.00/2.18
% 2.00/2.18 Search stopped by max_proofs option.
% 2.00/2.18
% 2.00/2.18 ============ end of search ============
% 2.00/2.18
% 2.00/2.18 -------------- statistics -------------
% 2.00/2.18 clauses given 47
% 2.00/2.18 clauses generated 2158
% 2.00/2.18 clauses kept 540
% 2.00/2.18 clauses forward subsumed 1197
% 2.00/2.18 clauses back subsumed 22
% 2.00/2.18 Kbytes malloced 1953
% 2.00/2.18
% 2.00/2.18 ----------- times (seconds) -----------
% 2.00/2.18 user CPU time 0.09 (0 hr, 0 min, 0 sec)
% 2.00/2.18 system CPU time 0.00 (0 hr, 0 min, 0 sec)
% 2.00/2.18 wall-clock time 2 (0 hr, 0 min, 2 sec)
% 2.00/2.18
% 2.00/2.18 That finishes the proof of the theorem.
% 2.00/2.18
% 2.00/2.18 Process 1679 finished Wed Jul 27 09:20:20 2022
% 2.00/2.18 Otter interrupted
% 2.00/2.18 PROOF FOUND
%------------------------------------------------------------------------------