TSTP Solution File: HEN004-4 by Otter---3.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : HEN004-4 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : otter-tptp-script %s
% Computer : n007.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:55 EDT 2022
% Result : Unsatisfiable 1.66s 1.90s
% Output : Refutation 1.66s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 8
% Syntax : Number of clauses : 16 ( 14 unt; 0 nHn; 4 RR)
% Number of literals : 19 ( 8 equ; 4 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 4 ( 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 : 20 ( 3 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(2,axiom,
( divide(A,B) != zero
| less_e_qual(A,B) ),
file('HEN004-4.p',unknown),
[] ).
cnf(3,axiom,
( ~ less_e_qual(A,B)
| ~ less_e_qual(B,A)
| A = B ),
file('HEN004-4.p',unknown),
[] ).
cnf(4,axiom,
divide(a,zero) != a,
file('HEN004-4.p',unknown),
[] ).
cnf(6,axiom,
less_e_qual(divide(A,B),A),
file('HEN004-4.p',unknown),
[] ).
cnf(7,axiom,
less_e_qual(divide(divide(A,B),divide(C,B)),divide(divide(A,C),B)),
file('HEN004-4.p',unknown),
[] ).
cnf(8,axiom,
less_e_qual(zero,A),
file('HEN004-4.p',unknown),
[] ).
cnf(12,axiom,
divide(zero,A) = zero,
file('HEN004-4.p',unknown),
[] ).
cnf(14,axiom,
divide(A,A) = zero,
file('HEN004-4.p',unknown),
[] ).
cnf(34,plain,
less_e_qual(divide(divide(A,B),zero),divide(divide(A,zero),B)),
inference(para_from,[status(thm),theory(equality)],[12,7]),
[iquote('para_from,12.1.1,7.1.1.2')] ).
cnf(155,plain,
less_e_qual(divide(divide(A,divide(A,zero)),zero),zero),
inference(para_into,[status(thm),theory(equality)],[34,14]),
[iquote('para_into,34.1.2,14.1.1')] ).
cnf(209,plain,
divide(divide(A,divide(A,zero)),zero) = zero,
inference(flip,[status(thm),theory(equality)],[inference(hyper,[status(thm)],[155,3,8])]),
[iquote('hyper,155,3,8,flip.1')] ).
cnf(423,plain,
less_e_qual(divide(A,divide(A,zero)),zero),
inference(hyper,[status(thm)],[209,2]),
[iquote('hyper,209,2')] ).
cnf(451,plain,
divide(A,divide(A,zero)) = zero,
inference(flip,[status(thm),theory(equality)],[inference(hyper,[status(thm)],[423,3,8])]),
[iquote('hyper,423,3,8,flip.1')] ).
cnf(488,plain,
less_e_qual(A,divide(A,zero)),
inference(hyper,[status(thm)],[451,2]),
[iquote('hyper,451,2')] ).
cnf(521,plain,
divide(A,zero) = A,
inference(hyper,[status(thm)],[488,3,6]),
[iquote('hyper,488,3,6')] ).
cnf(523,plain,
$false,
inference(binary,[status(thm)],[521,4]),
[iquote('binary,521.1,4.1')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : HEN004-4 : TPTP v8.1.0. Released v1.0.0.
% 0.03/0.12 % Command : otter-tptp-script %s
% 0.12/0.33 % Computer : n007.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:43:46 EDT 2022
% 0.12/0.33 % CPUTime :
% 1.66/1.90 ----- Otter 3.3f, August 2004 -----
% 1.66/1.90 The process was started by sandbox2 on n007.cluster.edu,
% 1.66/1.90 Wed Jul 27 08:43:46 2022
% 1.66/1.90 The command was "./otter". The process ID is 9199.
% 1.66/1.90
% 1.66/1.90 set(prolog_style_variables).
% 1.66/1.90 set(auto).
% 1.66/1.90 dependent: set(auto1).
% 1.66/1.90 dependent: set(process_input).
% 1.66/1.90 dependent: clear(print_kept).
% 1.66/1.90 dependent: clear(print_new_demod).
% 1.66/1.90 dependent: clear(print_back_demod).
% 1.66/1.90 dependent: clear(print_back_sub).
% 1.66/1.90 dependent: set(control_memory).
% 1.66/1.90 dependent: assign(max_mem, 12000).
% 1.66/1.90 dependent: assign(pick_given_ratio, 4).
% 1.66/1.90 dependent: assign(stats_level, 1).
% 1.66/1.90 dependent: assign(max_seconds, 10800).
% 1.66/1.90 clear(print_given).
% 1.66/1.90
% 1.66/1.90 list(usable).
% 1.66/1.90 0 [] A=A.
% 1.66/1.90 0 [] -less_e_qual(X,Y)|divide(X,Y)=zero.
% 1.66/1.90 0 [] divide(X,Y)!=zero|less_e_qual(X,Y).
% 1.66/1.90 0 [] less_e_qual(divide(X,Y),X).
% 1.66/1.90 0 [] less_e_qual(divide(divide(X,Z),divide(Y,Z)),divide(divide(X,Y),Z)).
% 1.66/1.90 0 [] less_e_qual(zero,X).
% 1.66/1.90 0 [] -less_e_qual(X,Y)| -less_e_qual(Y,X)|X=Y.
% 1.66/1.90 0 [] less_e_qual(X,identity).
% 1.66/1.90 0 [] divide(X,identity)=zero.
% 1.66/1.90 0 [] divide(zero,X)=zero.
% 1.66/1.90 0 [] divide(X,X)=zero.
% 1.66/1.90 0 [] divide(a,zero)!=a.
% 1.66/1.90 end_of_list.
% 1.66/1.90
% 1.66/1.90 SCAN INPUT: prop=0, horn=1, equality=1, symmetry=0, max_lits=3.
% 1.66/1.90
% 1.66/1.90 This is a Horn set with equality. The strategy will be
% 1.66/1.90 Knuth-Bendix and hyper_res, with positive clauses in
% 1.66/1.90 sos and nonpositive clauses in usable.
% 1.66/1.90
% 1.66/1.90 dependent: set(knuth_bendix).
% 1.66/1.90 dependent: set(anl_eq).
% 1.66/1.90 dependent: set(para_from).
% 1.66/1.90 dependent: set(para_into).
% 1.66/1.90 dependent: clear(para_from_right).
% 1.66/1.90 dependent: clear(para_into_right).
% 1.66/1.90 dependent: set(para_from_vars).
% 1.66/1.90 dependent: set(eq_units_both_ways).
% 1.66/1.90 dependent: set(dynamic_demod_all).
% 1.66/1.90 dependent: set(dynamic_demod).
% 1.66/1.90 dependent: set(order_eq).
% 1.66/1.90 dependent: set(back_demod).
% 1.66/1.90 dependent: set(lrpo).
% 1.66/1.90 dependent: set(hyper_res).
% 1.66/1.90 dependent: clear(order_hyper).
% 1.66/1.90
% 1.66/1.90 ------------> process usable:
% 1.66/1.90 ** KEPT (pick-wt=8): 1 [] -less_e_qual(A,B)|divide(A,B)=zero.
% 1.66/1.90 ** KEPT (pick-wt=8): 2 [] divide(A,B)!=zero|less_e_qual(A,B).
% 1.66/1.90 ** KEPT (pick-wt=9): 3 [] -less_e_qual(A,B)| -less_e_qual(B,A)|A=B.
% 1.66/1.90 ** KEPT (pick-wt=5): 4 [] divide(a,zero)!=a.
% 1.66/1.90
% 1.66/1.90 ------------> process sos:
% 1.66/1.90 ** KEPT (pick-wt=3): 5 [] A=A.
% 1.66/1.90 ** KEPT (pick-wt=5): 6 [] less_e_qual(divide(A,B),A).
% 1.66/1.90 ** KEPT (pick-wt=13): 7 [] less_e_qual(divide(divide(A,B),divide(C,B)),divide(divide(A,C),B)).
% 1.66/1.90 ** KEPT (pick-wt=3): 8 [] less_e_qual(zero,A).
% 1.66/1.90 ** KEPT (pick-wt=3): 9 [] less_e_qual(A,identity).
% 1.66/1.90 ** KEPT (pick-wt=5): 10 [] divide(A,identity)=zero.
% 1.66/1.90 ---> New Demodulator: 11 [new_demod,10] divide(A,identity)=zero.
% 1.66/1.90 ** KEPT (pick-wt=5): 12 [] divide(zero,A)=zero.
% 1.66/1.90 ---> New Demodulator: 13 [new_demod,12] divide(zero,A)=zero.
% 1.66/1.90 ** KEPT (pick-wt=5): 14 [] divide(A,A)=zero.
% 1.66/1.90 ---> New Demodulator: 15 [new_demod,14] divide(A,A)=zero.
% 1.66/1.90 Following clause subsumed by 5 during input processing: 0 [copy,5,flip.1] A=A.
% 1.66/1.90 >>>> Starting back demodulation with 11.
% 1.66/1.90 >>>> Starting back demodulation with 13.
% 1.66/1.90 >>>> Starting back demodulation with 15.
% 1.66/1.90
% 1.66/1.90 ======= end of input processing =======
% 1.66/1.90
% 1.66/1.90 =========== start of search ===========
% 1.66/1.90
% 1.66/1.90 -------- PROOF --------
% 1.66/1.90
% 1.66/1.90 ----> UNIT CONFLICT at 0.05 sec ----> 523 [binary,521.1,4.1] $F.
% 1.66/1.90
% 1.66/1.90 Length of proof is 7. Level of proof is 7.
% 1.66/1.90
% 1.66/1.90 ---------------- PROOF ----------------
% 1.66/1.90 % SZS status Unsatisfiable
% 1.66/1.90 % SZS output start Refutation
% See solution above
% 1.66/1.90 ------------ end of proof -------------
% 1.66/1.90
% 1.66/1.90
% 1.66/1.90 Search stopped by max_proofs option.
% 1.66/1.90
% 1.66/1.90
% 1.66/1.90 Search stopped by max_proofs option.
% 1.66/1.90
% 1.66/1.90 ============ end of search ============
% 1.66/1.90
% 1.66/1.90 -------------- statistics -------------
% 1.66/1.90 clauses given 48
% 1.66/1.90 clauses generated 1404
% 1.66/1.90 clauses kept 485
% 1.66/1.90 clauses forward subsumed 940
% 1.66/1.90 clauses back subsumed 28
% 1.66/1.90 Kbytes malloced 1953
% 1.66/1.90
% 1.66/1.90 ----------- times (seconds) -----------
% 1.66/1.90 user CPU time 0.05 (0 hr, 0 min, 0 sec)
% 1.66/1.90 system CPU time 0.00 (0 hr, 0 min, 0 sec)
% 1.66/1.90 wall-clock time 1 (0 hr, 0 min, 1 sec)
% 1.66/1.90
% 1.66/1.90 That finishes the proof of the theorem.
% 1.66/1.90
% 1.66/1.90 Process 9199 finished Wed Jul 27 08:43:47 2022
% 1.66/1.90 Otter interrupted
% 1.66/1.90 PROOF FOUND
%------------------------------------------------------------------------------