TSTP Solution File: HEN012-3 by Otter---3.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : HEN012-3 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : otter-tptp-script %s
% Computer : n017.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:01 EDT 2022
% Result : Unsatisfiable 1.68s 1.90s
% Output : Refutation 1.68s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 7
% Syntax : Number of clauses : 14 ( 11 unt; 0 nHn; 5 RR)
% Number of literals : 18 ( 6 equ; 5 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 3 ( 3 usr; 2 con; 0-2 aty)
% Number of variables : 22 ( 6 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
( ~ less_e_qual(A,B)
| divide(A,B) = zero ),
file('HEN012-3.p',unknown),
[] ).
cnf(2,axiom,
( divide(A,B) != zero
| less_e_qual(A,B) ),
file('HEN012-3.p',unknown),
[] ).
cnf(3,axiom,
( ~ less_e_qual(A,B)
| ~ less_e_qual(B,A)
| A = B ),
file('HEN012-3.p',unknown),
[] ).
cnf(4,axiom,
~ less_e_qual(a,a),
file('HEN012-3.p',unknown),
[] ).
cnf(6,axiom,
less_e_qual(divide(A,B),A),
file('HEN012-3.p',unknown),
[] ).
cnf(7,axiom,
less_e_qual(divide(divide(A,B),divide(C,B)),divide(divide(A,C),B)),
file('HEN012-3.p',unknown),
[] ).
cnf(8,axiom,
less_e_qual(zero,A),
file('HEN012-3.p',unknown),
[] ).
cnf(17,plain,
divide(divide(A,B),A) = zero,
inference(hyper,[status(thm)],[6,1]),
[iquote('hyper,6,1')] ).
cnf(34,plain,
less_e_qual(divide(divide(A,A),divide(B,A)),zero),
inference(para_from,[status(thm),theory(equality)],[17,7]),
[iquote('para_from,16.1.1,7.1.2')] ).
cnf(49,plain,
divide(divide(A,A),divide(B,A)) = zero,
inference(flip,[status(thm),theory(equality)],[inference(hyper,[status(thm)],[34,3,8])]),
[iquote('hyper,34,3,8,flip.1')] ).
cnf(74,plain,
less_e_qual(divide(A,A),divide(B,A)),
inference(hyper,[status(thm)],[49,2]),
[iquote('hyper,49,2')] ).
cnf(85,plain,
divide(A,A) = zero,
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(hyper,[status(thm)],[74,3,6]),17])]),
[iquote('hyper,74,3,6,demod,17,flip.1')] ).
cnf(87,plain,
less_e_qual(A,A),
inference(hyper,[status(thm)],[85,2]),
[iquote('hyper,85,2')] ).
cnf(88,plain,
$false,
inference(binary,[status(thm)],[87,4]),
[iquote('binary,87.1,4.1')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : HEN012-3 : TPTP v8.1.0. Released v1.0.0.
% 0.06/0.12 % Command : otter-tptp-script %s
% 0.12/0.33 % Computer : n017.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:21:18 EDT 2022
% 0.12/0.33 % CPUTime :
% 1.68/1.90 ----- Otter 3.3f, August 2004 -----
% 1.68/1.90 The process was started by sandbox2 on n017.cluster.edu,
% 1.68/1.90 Wed Jul 27 08:21:18 2022
% 1.68/1.90 The command was "./otter". The process ID is 19789.
% 1.68/1.90
% 1.68/1.90 set(prolog_style_variables).
% 1.68/1.90 set(auto).
% 1.68/1.90 dependent: set(auto1).
% 1.68/1.90 dependent: set(process_input).
% 1.68/1.90 dependent: clear(print_kept).
% 1.68/1.90 dependent: clear(print_new_demod).
% 1.68/1.90 dependent: clear(print_back_demod).
% 1.68/1.90 dependent: clear(print_back_sub).
% 1.68/1.90 dependent: set(control_memory).
% 1.68/1.90 dependent: assign(max_mem, 12000).
% 1.68/1.90 dependent: assign(pick_given_ratio, 4).
% 1.68/1.90 dependent: assign(stats_level, 1).
% 1.68/1.90 dependent: assign(max_seconds, 10800).
% 1.68/1.90 clear(print_given).
% 1.68/1.90
% 1.68/1.90 list(usable).
% 1.68/1.90 0 [] A=A.
% 1.68/1.90 0 [] -less_e_qual(X,Y)|divide(X,Y)=zero.
% 1.68/1.90 0 [] divide(X,Y)!=zero|less_e_qual(X,Y).
% 1.68/1.90 0 [] less_e_qual(divide(X,Y),X).
% 1.68/1.90 0 [] less_e_qual(divide(divide(X,Z),divide(Y,Z)),divide(divide(X,Y),Z)).
% 1.68/1.90 0 [] less_e_qual(zero,X).
% 1.68/1.90 0 [] -less_e_qual(X,Y)| -less_e_qual(Y,X)|X=Y.
% 1.68/1.90 0 [] less_e_qual(X,identity).
% 1.68/1.90 0 [] -less_e_qual(a,a).
% 1.68/1.90 end_of_list.
% 1.68/1.90
% 1.68/1.90 SCAN INPUT: prop=0, horn=1, equality=1, symmetry=0, max_lits=3.
% 1.68/1.90
% 1.68/1.90 This is a Horn set with equality. The strategy will be
% 1.68/1.90 Knuth-Bendix and hyper_res, with positive clauses in
% 1.68/1.90 sos and nonpositive clauses in usable.
% 1.68/1.90
% 1.68/1.90 dependent: set(knuth_bendix).
% 1.68/1.90 dependent: set(anl_eq).
% 1.68/1.90 dependent: set(para_from).
% 1.68/1.90 dependent: set(para_into).
% 1.68/1.90 dependent: clear(para_from_right).
% 1.68/1.90 dependent: clear(para_into_right).
% 1.68/1.90 dependent: set(para_from_vars).
% 1.68/1.90 dependent: set(eq_units_both_ways).
% 1.68/1.90 dependent: set(dynamic_demod_all).
% 1.68/1.90 dependent: set(dynamic_demod).
% 1.68/1.90 dependent: set(order_eq).
% 1.68/1.90 dependent: set(back_demod).
% 1.68/1.90 dependent: set(lrpo).
% 1.68/1.90 dependent: set(hyper_res).
% 1.68/1.90 dependent: clear(order_hyper).
% 1.68/1.90
% 1.68/1.90 ------------> process usable:
% 1.68/1.90 ** KEPT (pick-wt=8): 1 [] -less_e_qual(A,B)|divide(A,B)=zero.
% 1.68/1.90 ** KEPT (pick-wt=8): 2 [] divide(A,B)!=zero|less_e_qual(A,B).
% 1.68/1.90 ** KEPT (pick-wt=9): 3 [] -less_e_qual(A,B)| -less_e_qual(B,A)|A=B.
% 1.68/1.90 ** KEPT (pick-wt=3): 4 [] -less_e_qual(a,a).
% 1.68/1.90
% 1.68/1.90 ------------> process sos:
% 1.68/1.90 ** KEPT (pick-wt=3): 5 [] A=A.
% 1.68/1.90 ** KEPT (pick-wt=5): 6 [] less_e_qual(divide(A,B),A).
% 1.68/1.90 ** KEPT (pick-wt=13): 7 [] less_e_qual(divide(divide(A,B),divide(C,B)),divide(divide(A,C),B)).
% 1.68/1.90 ** KEPT (pick-wt=3): 8 [] less_e_qual(zero,A).
% 1.68/1.90 ** KEPT (pick-wt=3): 9 [] less_e_qual(A,identity).
% 1.68/1.90 Following clause subsumed by 5 during input processing: 0 [copy,5,flip.1] A=A.
% 1.68/1.90
% 1.68/1.90 ======= end of input processing =======
% 1.68/1.90
% 1.68/1.90 =========== start of search ===========
% 1.68/1.90
% 1.68/1.90 -------- PROOF --------
% 1.68/1.90
% 1.68/1.90 ----> UNIT CONFLICT at 0.00 sec ----> 88 [binary,87.1,4.1] $F.
% 1.68/1.90
% 1.68/1.90 Length of proof is 6. Level of proof is 6.
% 1.68/1.90
% 1.68/1.90 ---------------- PROOF ----------------
% 1.68/1.90 % SZS status Unsatisfiable
% 1.68/1.90 % SZS output start Refutation
% See solution above
% 1.68/1.90 ------------ end of proof -------------
% 1.68/1.90
% 1.68/1.90
% 1.68/1.90 Search stopped by max_proofs option.
% 1.68/1.90
% 1.68/1.90
% 1.68/1.90 Search stopped by max_proofs option.
% 1.68/1.90
% 1.68/1.90 ============ end of search ============
% 1.68/1.90
% 1.68/1.90 -------------- statistics -------------
% 1.68/1.90 clauses given 20
% 1.68/1.90 clauses generated 239
% 1.68/1.90 clauses kept 78
% 1.68/1.90 clauses forward subsumed 180
% 1.68/1.90 clauses back subsumed 2
% 1.68/1.90 Kbytes malloced 976
% 1.68/1.90
% 1.68/1.90 ----------- times (seconds) -----------
% 1.68/1.90 user CPU time 0.00 (0 hr, 0 min, 0 sec)
% 1.68/1.90 system CPU time 0.00 (0 hr, 0 min, 0 sec)
% 1.68/1.90 wall-clock time 1 (0 hr, 0 min, 1 sec)
% 1.68/1.90
% 1.68/1.90 That finishes the proof of the theorem.
% 1.68/1.90
% 1.68/1.90 Process 19789 finished Wed Jul 27 08:21:19 2022
% 1.68/1.90 Otter interrupted
% 1.68/1.90 PROOF FOUND
%------------------------------------------------------------------------------