TSTP Solution File: HEN005-4 by Otter---3.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : HEN005-4 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : otter-tptp-script %s
% Computer : n009.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:56 EDT 2022
% Result : Unsatisfiable 1.86s 1.99s
% Output : Refutation 1.86s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 8
% Syntax : Number of clauses : 16 ( 13 unt; 0 nHn; 12 RR)
% Number of literals : 19 ( 8 equ; 4 neg)
% Maximal clause size : 2 ( 1 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 4 con; 0-2 aty)
% Number of variables : 11 ( 1 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
( ~ less_e_qual(A,B)
| divide(A,B) = zero ),
file('HEN005-4.p',unknown),
[] ).
cnf(2,axiom,
( divide(A,B) != zero
| less_e_qual(A,B) ),
file('HEN005-4.p',unknown),
[] ).
cnf(4,axiom,
~ less_e_qual(a,c),
file('HEN005-4.p',unknown),
[] ).
cnf(7,axiom,
less_e_qual(divide(divide(A,B),divide(C,B)),divide(divide(A,C),B)),
file('HEN005-4.p',unknown),
[] ).
cnf(13,axiom,
divide(zero,A) = zero,
file('HEN005-4.p',unknown),
[] ).
cnf(17,axiom,
divide(A,zero) = A,
file('HEN005-4.p',unknown),
[] ).
cnf(18,axiom,
less_e_qual(a,b),
file('HEN005-4.p',unknown),
[] ).
cnf(19,axiom,
less_e_qual(b,c),
file('HEN005-4.p',unknown),
[] ).
cnf(22,plain,
divide(a,b) = zero,
inference(hyper,[status(thm)],[18,1]),
[iquote('hyper,18,1')] ).
cnf(26,plain,
divide(b,c) = zero,
inference(hyper,[status(thm)],[19,1]),
[iquote('hyper,19,1')] ).
cnf(52,plain,
( ~ less_e_qual(A,zero)
| A = zero ),
inference(para_from,[status(thm),theory(equality)],[17,1]),
[iquote('para_from,16.1.1,1.2.1')] ).
cnf(60,plain,
less_e_qual(divide(A,c),divide(divide(A,b),c)),
inference(demod,[status(thm),theory(equality)],[inference(para_from,[status(thm),theory(equality)],[26,7]),17]),
[iquote('para_from,26.1.1,7.1.1.2,demod,17')] ).
cnf(580,plain,
less_e_qual(divide(a,c),zero),
inference(demod,[status(thm),theory(equality)],[inference(para_into,[status(thm),theory(equality)],[60,22]),13]),
[iquote('para_into,60.1.2.1,22.1.1,demod,13')] ).
cnf(594,plain,
divide(a,c) = zero,
inference(hyper,[status(thm)],[580,52]),
[iquote('hyper,580,52')] ).
cnf(627,plain,
less_e_qual(a,c),
inference(hyper,[status(thm)],[594,2]),
[iquote('hyper,594,2')] ).
cnf(628,plain,
$false,
inference(binary,[status(thm)],[627,4]),
[iquote('binary,627.1,4.1')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : HEN005-4 : TPTP v8.1.0. Released v1.0.0.
% 0.07/0.13 % Command : otter-tptp-script %s
% 0.14/0.34 % Computer : n009.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 300
% 0.14/0.34 % DateTime : Wed Jul 27 08:54:51 EDT 2022
% 0.14/0.35 % CPUTime :
% 1.86/1.99 ----- Otter 3.3f, August 2004 -----
% 1.86/1.99 The process was started by sandbox2 on n009.cluster.edu,
% 1.86/1.99 Wed Jul 27 08:54:51 2022
% 1.86/1.99 The command was "./otter". The process ID is 31295.
% 1.86/1.99
% 1.86/1.99 set(prolog_style_variables).
% 1.86/1.99 set(auto).
% 1.86/1.99 dependent: set(auto1).
% 1.86/1.99 dependent: set(process_input).
% 1.86/1.99 dependent: clear(print_kept).
% 1.86/1.99 dependent: clear(print_new_demod).
% 1.86/1.99 dependent: clear(print_back_demod).
% 1.86/1.99 dependent: clear(print_back_sub).
% 1.86/1.99 dependent: set(control_memory).
% 1.86/1.99 dependent: assign(max_mem, 12000).
% 1.86/1.99 dependent: assign(pick_given_ratio, 4).
% 1.86/1.99 dependent: assign(stats_level, 1).
% 1.86/1.99 dependent: assign(max_seconds, 10800).
% 1.86/1.99 clear(print_given).
% 1.86/1.99
% 1.86/1.99 list(usable).
% 1.86/1.99 0 [] A=A.
% 1.86/1.99 0 [] -less_e_qual(X,Y)|divide(X,Y)=zero.
% 1.86/1.99 0 [] divide(X,Y)!=zero|less_e_qual(X,Y).
% 1.86/1.99 0 [] less_e_qual(divide(X,Y),X).
% 1.86/1.99 0 [] less_e_qual(divide(divide(X,Z),divide(Y,Z)),divide(divide(X,Y),Z)).
% 1.86/1.99 0 [] less_e_qual(zero,X).
% 1.86/1.99 0 [] -less_e_qual(X,Y)| -less_e_qual(Y,X)|X=Y.
% 1.86/1.99 0 [] less_e_qual(X,identity).
% 1.86/1.99 0 [] divide(X,identity)=zero.
% 1.86/1.99 0 [] divide(zero,X)=zero.
% 1.86/1.99 0 [] divide(X,X)=zero.
% 1.86/1.99 0 [] divide(X,zero)=X.
% 1.86/1.99 0 [] less_e_qual(a,b).
% 1.86/1.99 0 [] less_e_qual(b,c).
% 1.86/1.99 0 [] -less_e_qual(a,c).
% 1.86/1.99 end_of_list.
% 1.86/1.99
% 1.86/1.99 SCAN INPUT: prop=0, horn=1, equality=1, symmetry=0, max_lits=3.
% 1.86/1.99
% 1.86/1.99 This is a Horn set with equality. The strategy will be
% 1.86/1.99 Knuth-Bendix and hyper_res, with positive clauses in
% 1.86/1.99 sos and nonpositive clauses in usable.
% 1.86/1.99
% 1.86/1.99 dependent: set(knuth_bendix).
% 1.86/1.99 dependent: set(anl_eq).
% 1.86/1.99 dependent: set(para_from).
% 1.86/1.99 dependent: set(para_into).
% 1.86/1.99 dependent: clear(para_from_right).
% 1.86/1.99 dependent: clear(para_into_right).
% 1.86/1.99 dependent: set(para_from_vars).
% 1.86/1.99 dependent: set(eq_units_both_ways).
% 1.86/1.99 dependent: set(dynamic_demod_all).
% 1.86/1.99 dependent: set(dynamic_demod).
% 1.86/1.99 dependent: set(order_eq).
% 1.86/1.99 dependent: set(back_demod).
% 1.86/1.99 dependent: set(lrpo).
% 1.86/1.99 dependent: set(hyper_res).
% 1.86/1.99 dependent: clear(order_hyper).
% 1.86/1.99
% 1.86/1.99 ------------> process usable:
% 1.86/1.99 ** KEPT (pick-wt=8): 1 [] -less_e_qual(A,B)|divide(A,B)=zero.
% 1.86/1.99 ** KEPT (pick-wt=8): 2 [] divide(A,B)!=zero|less_e_qual(A,B).
% 1.86/1.99 ** KEPT (pick-wt=9): 3 [] -less_e_qual(A,B)| -less_e_qual(B,A)|A=B.
% 1.86/1.99 ** KEPT (pick-wt=3): 4 [] -less_e_qual(a,c).
% 1.86/1.99
% 1.86/1.99 ------------> process sos:
% 1.86/1.99 ** KEPT (pick-wt=3): 5 [] A=A.
% 1.86/1.99 ** KEPT (pick-wt=5): 6 [] less_e_qual(divide(A,B),A).
% 1.86/1.99 ** KEPT (pick-wt=13): 7 [] less_e_qual(divide(divide(A,B),divide(C,B)),divide(divide(A,C),B)).
% 1.86/1.99 ** KEPT (pick-wt=3): 8 [] less_e_qual(zero,A).
% 1.86/1.99 ** KEPT (pick-wt=3): 9 [] less_e_qual(A,identity).
% 1.86/1.99 ** KEPT (pick-wt=5): 10 [] divide(A,identity)=zero.
% 1.86/1.99 ---> New Demodulator: 11 [new_demod,10] divide(A,identity)=zero.
% 1.86/1.99 ** KEPT (pick-wt=5): 12 [] divide(zero,A)=zero.
% 1.86/1.99 ---> New Demodulator: 13 [new_demod,12] divide(zero,A)=zero.
% 1.86/1.99 ** KEPT (pick-wt=5): 14 [] divide(A,A)=zero.
% 1.86/1.99 ---> New Demodulator: 15 [new_demod,14] divide(A,A)=zero.
% 1.86/1.99 ** KEPT (pick-wt=5): 16 [] divide(A,zero)=A.
% 1.86/1.99 ---> New Demodulator: 17 [new_demod,16] divide(A,zero)=A.
% 1.86/1.99 ** KEPT (pick-wt=3): 18 [] less_e_qual(a,b).
% 1.86/1.99 ** KEPT (pick-wt=3): 19 [] less_e_qual(b,c).
% 1.86/1.99 Following clause subsumed by 5 during input processing: 0 [copy,5,flip.1] A=A.
% 1.86/1.99 >>>> Starting back demodulation with 11.
% 1.86/1.99 >>>> Starting back demodulation with 13.
% 1.86/1.99 >>>> Starting back demodulation with 15.
% 1.86/1.99 >>>> Starting back demodulation with 17.
% 1.86/1.99
% 1.86/1.99 ======= end of input processing =======
% 1.86/1.99
% 1.86/1.99 =========== start of search ===========
% 1.86/1.99
% 1.86/1.99 -------- PROOF --------
% 1.86/1.99
% 1.86/1.99 ----> UNIT CONFLICT at 0.04 sec ----> 628 [binary,627.1,4.1] $F.
% 1.86/1.99
% 1.86/1.99 Length of proof is 7. Level of proof is 5.
% 1.86/1.99
% 1.86/1.99 ---------------- PROOF ----------------
% 1.86/1.99 % SZS status Unsatisfiable
% 1.86/1.99 % SZS output start Refutation
% See solution above
% 1.86/1.99 ------------ end of proof -------------
% 1.86/1.99
% 1.86/1.99
% 1.86/1.99 Search stopped by max_proofs option.
% 1.86/1.99
% 1.86/1.99
% 1.86/1.99 Search stopped by max_proofs option.
% 1.86/1.99
% 1.86/1.99 ============ end of search ============
% 1.86/1.99
% 1.86/1.99 -------------- statistics -------------
% 1.86/1.99 clauses given 67
% 1.86/1.99 clauses generated 1761
% 1.86/1.99 clauses kept 598
% 1.86/1.99 clauses forward subsumed 1173
% 1.86/1.99 clauses back subsumed 110
% 1.86/1.99 Kbytes malloced 1953
% 1.86/1.99
% 1.86/1.99 ----------- times (seconds) -----------
% 1.86/1.99 user CPU time 0.04 (0 hr, 0 min, 0 sec)
% 1.86/1.99 system CPU time 0.01 (0 hr, 0 min, 0 sec)
% 1.86/1.99 wall-clock time 2 (0 hr, 0 min, 2 sec)
% 1.86/1.99
% 1.86/1.99 That finishes the proof of the theorem.
% 1.86/1.99
% 1.86/1.99 Process 31295 finished Wed Jul 27 08:54:53 2022
% 1.86/1.99 Otter interrupted
% 1.86/1.99 PROOF FOUND
%------------------------------------------------------------------------------