TSTP Solution File: HEN008-2 by Otter---3.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : HEN008-2 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : otter-tptp-script %s
% Computer : n024.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:58 EDT 2022
% Result : Unsatisfiable 1.69s 1.90s
% Output : Refutation 1.69s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 10
% Syntax : Number of clauses : 14 ( 11 unt; 0 nHn; 11 RR)
% Number of literals : 23 ( 0 equ; 10 neg)
% Maximal clause size : 6 ( 1 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-3 aty)
% Number of functors : 7 ( 7 usr; 6 con; 0-2 aty)
% Number of variables : 19 ( 1 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
( ~ less_e_qual(A,B)
| quotient(A,B,zero) ),
file('HEN008-2.p',unknown),
[] ).
cnf(4,axiom,
( ~ 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) ),
file('HEN008-2.p',unknown),
[] ).
cnf(8,axiom,
( ~ quotient(A,B,C)
| ~ less_e_qual(C,D)
| ~ quotient(A,D,E)
| less_e_qual(E,B) ),
file('HEN008-2.p',unknown),
[] ).
cnf(10,axiom,
~ less_e_qual(aQc,bQc),
file('HEN008-2.p',unknown),
[] ).
cnf(14,axiom,
quotient(A,B,divide(A,B)),
file('HEN008-2.p',unknown),
[] ).
cnf(16,axiom,
quotient(zero,A,zero),
file('HEN008-2.p',unknown),
[] ).
cnf(18,axiom,
quotient(A,zero,A),
file('HEN008-2.p',unknown),
[] ).
cnf(19,axiom,
less_e_qual(a,b),
file('HEN008-2.p',unknown),
[] ).
cnf(20,axiom,
quotient(a,c,aQc),
file('HEN008-2.p',unknown),
[] ).
cnf(21,axiom,
quotient(b,c,bQc),
file('HEN008-2.p',unknown),
[] ).
cnf(26,plain,
quotient(a,b,zero),
inference(hyper,[status(thm)],[19,1]),
[iquote('hyper,19,1')] ).
cnf(140,plain,
less_e_qual(divide(aQc,bQc),zero),
inference(hyper,[status(thm)],[26,4,21,20,14,16]),
[iquote('hyper,26,4,21,20,14,16')] ).
cnf(276,plain,
less_e_qual(aQc,bQc),
inference(hyper,[status(thm)],[140,8,14,18]),
[iquote('hyper,140,8,14,18')] ).
cnf(277,plain,
$false,
inference(binary,[status(thm)],[276,10]),
[iquote('binary,276.1,10.1')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11 % Problem : HEN008-2 : TPTP v8.1.0. Released v1.0.0.
% 0.03/0.12 % Command : otter-tptp-script %s
% 0.11/0.33 % Computer : n024.cluster.edu
% 0.11/0.33 % Model : x86_64 x86_64
% 0.11/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.33 % Memory : 8042.1875MB
% 0.11/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.33 % CPULimit : 300
% 0.11/0.33 % WCLimit : 300
% 0.11/0.33 % DateTime : Wed Jul 27 08:59:40 EDT 2022
% 0.11/0.33 % CPUTime :
% 1.69/1.90 ----- Otter 3.3f, August 2004 -----
% 1.69/1.90 The process was started by sandbox on n024.cluster.edu,
% 1.69/1.90 Wed Jul 27 08:59:40 2022
% 1.69/1.90 The command was "./otter". The process ID is 7983.
% 1.69/1.90
% 1.69/1.90 set(prolog_style_variables).
% 1.69/1.90 set(auto).
% 1.69/1.90 dependent: set(auto1).
% 1.69/1.90 dependent: set(process_input).
% 1.69/1.90 dependent: clear(print_kept).
% 1.69/1.90 dependent: clear(print_new_demod).
% 1.69/1.90 dependent: clear(print_back_demod).
% 1.69/1.90 dependent: clear(print_back_sub).
% 1.69/1.90 dependent: set(control_memory).
% 1.69/1.90 dependent: assign(max_mem, 12000).
% 1.69/1.90 dependent: assign(pick_given_ratio, 4).
% 1.69/1.90 dependent: assign(stats_level, 1).
% 1.69/1.90 dependent: assign(max_seconds, 10800).
% 1.69/1.90 clear(print_given).
% 1.69/1.90
% 1.69/1.90 list(usable).
% 1.69/1.90 0 [] A=A.
% 1.69/1.90 0 [] -less_e_qual(X,Y)|quotient(X,Y,zero).
% 1.69/1.90 0 [] -quotient(X,Y,zero)|less_e_qual(X,Y).
% 1.69/1.90 0 [] -quotient(X,Y,Z)|less_e_qual(Z,X).
% 1.69/1.90 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.69/1.90 0 [] less_e_qual(zero,X).
% 1.69/1.90 0 [] -less_e_qual(X,Y)| -less_e_qual(Y,X)|X=Y.
% 1.69/1.90 0 [] less_e_qual(X,identity).
% 1.69/1.90 0 [] quotient(X,Y,divide(X,Y)).
% 1.69/1.90 0 [] -quotient(X,Y,Z)| -quotient(X,Y,W)|Z=W.
% 1.69/1.90 0 [] quotient(X,identity,zero).
% 1.69/1.90 0 [] quotient(zero,X,zero).
% 1.69/1.90 0 [] quotient(X,X,zero).
% 1.69/1.90 0 [] quotient(X,zero,X).
% 1.69/1.90 0 [] -less_e_qual(X,Y)| -less_e_qual(Y,Z)|less_e_qual(X,Z).
% 1.69/1.90 0 [] -quotient(X,Y,W1)| -less_e_qual(W1,Z)| -quotient(X,Z,W2)|less_e_qual(W2,Y).
% 1.69/1.90 0 [] -less_e_qual(X,Y)| -quotient(Z,Y,W1)| -quotient(Z,X,W2)|less_e_qual(W1,W2).
% 1.69/1.90 0 [] less_e_qual(a,b).
% 1.69/1.90 0 [] quotient(a,c,aQc).
% 1.69/1.90 0 [] quotient(b,c,bQc).
% 1.69/1.90 0 [] -less_e_qual(aQc,bQc).
% 1.69/1.90 end_of_list.
% 1.69/1.90
% 1.69/1.90 SCAN INPUT: prop=0, horn=1, equality=1, symmetry=0, max_lits=6.
% 1.69/1.90
% 1.69/1.90 This is a Horn set with equality. The strategy will be
% 1.69/1.90 Knuth-Bendix and hyper_res, with positive clauses in
% 1.69/1.90 sos and nonpositive clauses in usable.
% 1.69/1.90
% 1.69/1.90 dependent: set(knuth_bendix).
% 1.69/1.90 dependent: set(anl_eq).
% 1.69/1.90 dependent: set(para_from).
% 1.69/1.90 dependent: set(para_into).
% 1.69/1.90 dependent: clear(para_from_right).
% 1.69/1.90 dependent: clear(para_into_right).
% 1.69/1.90 dependent: set(para_from_vars).
% 1.69/1.90 dependent: set(eq_units_both_ways).
% 1.69/1.90 dependent: set(dynamic_demod_all).
% 1.69/1.90 dependent: set(dynamic_demod).
% 1.69/1.90 dependent: set(order_eq).
% 1.69/1.90 dependent: set(back_demod).
% 1.69/1.90 dependent: set(lrpo).
% 1.69/1.90 dependent: set(hyper_res).
% 1.69/1.90 dependent: clear(order_hyper).
% 1.69/1.90
% 1.69/1.90 ------------> process usable:
% 1.69/1.90 ** KEPT (pick-wt=7): 1 [] -less_e_qual(A,B)|quotient(A,B,zero).
% 1.69/1.90 ** KEPT (pick-wt=7): 2 [] -quotient(A,B,zero)|less_e_qual(A,B).
% 1.69/1.90 ** KEPT (pick-wt=7): 3 [] -quotient(A,B,C)|less_e_qual(C,A).
% 1.69/1.90 ** 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.69/1.90 ** KEPT (pick-wt=9): 5 [] -less_e_qual(A,B)| -less_e_qual(B,A)|A=B.
% 1.69/1.90 ** KEPT (pick-wt=11): 6 [] -quotient(A,B,C)| -quotient(A,B,D)|C=D.
% 1.69/1.90 ** KEPT (pick-wt=9): 7 [] -less_e_qual(A,B)| -less_e_qual(B,C)|less_e_qual(A,C).
% 1.69/1.90 ** KEPT (pick-wt=14): 8 [] -quotient(A,B,C)| -less_e_qual(C,D)| -quotient(A,D,E)|less_e_qual(E,B).
% 1.69/1.90 ** KEPT (pick-wt=14): 9 [] -less_e_qual(A,B)| -quotient(C,B,D)| -quotient(C,A,E)|less_e_qual(D,E).
% 1.69/1.90 ** KEPT (pick-wt=3): 10 [] -less_e_qual(aQc,bQc).
% 1.69/1.90
% 1.69/1.90 ------------> process sos:
% 1.69/1.90 ** KEPT (pick-wt=3): 11 [] A=A.
% 1.69/1.90 ** KEPT (pick-wt=3): 12 [] less_e_qual(zero,A).
% 1.69/1.90 ** KEPT (pick-wt=3): 13 [] less_e_qual(A,identity).
% 1.69/1.90 ** KEPT (pick-wt=6): 14 [] quotient(A,B,divide(A,B)).
% 1.69/1.90 ** KEPT (pick-wt=4): 15 [] quotient(A,identity,zero).
% 1.69/1.90 ** KEPT (pick-wt=4): 16 [] quotient(zero,A,zero).
% 1.69/1.90 ** KEPT (pick-wt=4): 17 [] quotient(A,A,zero).
% 1.69/1.90 ** KEPT (pick-wt=4): 18 [] quotient(A,zero,A).
% 1.69/1.90 ** KEPT (pick-wt=3): 19 [] less_e_qual(a,b).
% 1.69/1.90 ** KEPT (pick-wt=4): 20 [] quotient(a,c,aQc).
% 1.69/1.90 ** KEPT (pick-wt=4): 21 [] quotient(b,c,bQc).
% 1.69/1.90 Following clause subsumed by 11 during input processing: 0 [copy,11,flip.1] A=A.
% 1.69/1.90
% 1.69/1.90 ======= end of input processing =======
% 1.69/1.90
% 1.69/1.90 =========== start of search ===========
% 1.69/1.90
% 1.69/1.90 -------- PROOF --------
% 1.69/1.90
% 1.69/1.90 ----> UNIT CONFLICT at 0.02 sec ----> 277 [binary,276.1,10.1] $F.
% 1.69/1.90
% 1.69/1.90 Length of proof is 3. Level of proof is 3.
% 1.69/1.90
% 1.69/1.90 ---------------- PROOF ----------------
% 1.69/1.90 % SZS status Unsatisfiable
% 1.69/1.90 % SZS output start Refutation
% See solution above
% 1.69/1.90 ------------ end of proof -------------
% 1.69/1.90
% 1.69/1.90
% 1.69/1.90 Search stopped by max_proofs option.
% 1.69/1.90
% 1.69/1.90
% 1.69/1.90 Search stopped by max_proofs option.
% 1.69/1.90
% 1.69/1.90 ============ end of search ============
% 1.69/1.90
% 1.69/1.90 -------------- statistics -------------
% 1.69/1.90 clauses given 38
% 1.69/1.90 clauses generated 3772
% 1.69/1.90 clauses kept 264
% 1.69/1.90 clauses forward subsumed 3559
% 1.69/1.90 clauses back subsumed 8
% 1.69/1.90 Kbytes malloced 976
% 1.69/1.90
% 1.69/1.90 ----------- times (seconds) -----------
% 1.69/1.90 user CPU time 0.02 (0 hr, 0 min, 0 sec)
% 1.69/1.90 system CPU time 0.00 (0 hr, 0 min, 0 sec)
% 1.69/1.90 wall-clock time 1 (0 hr, 0 min, 1 sec)
% 1.69/1.90
% 1.69/1.90 That finishes the proof of the theorem.
% 1.69/1.90
% 1.69/1.90 Process 7983 finished Wed Jul 27 08:59:41 2022
% 1.69/1.90 Otter interrupted
% 1.69/1.90 PROOF FOUND
%------------------------------------------------------------------------------