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