TSTP Solution File: ANA029-2 by Otter---3.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : ANA029-2 : TPTP v8.1.0. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : otter-tptp-script %s
% Computer : n029.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:46:46 EDT 2022
% Result : Unsatisfiable 1.80s 1.95s
% Output : Refutation 1.80s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 12
% Syntax : Number of clauses : 23 ( 13 unt; 2 nHn; 17 RR)
% Number of literals : 39 ( 0 equ; 16 neg)
% Maximal clause size : 4 ( 1 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 8 ( 7 usr; 1 prp; 0-3 aty)
% Number of functors : 9 ( 9 usr; 3 con; 0-3 aty)
% Number of variables : 25 ( 4 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
~ c_lesse_quals(c_0,c_minus(v_f(v_x),v_k(v_x),t_b),t_b),
file('ANA029-2.p',unknown),
[] ).
cnf(2,axiom,
~ c_lesse_quals(c_Orderings_Omax(c_minus(v_f(v_x),v_k(v_x),t_b),c_0,t_b),c_HOL_Oabs(c_minus(v_f(v_x),v_g(v_x),t_b),t_b),t_b),
file('ANA029-2.p',unknown),
[] ).
cnf(3,axiom,
( ~ class_OrderedGroup_Olordered__ab__group__abs(A)
| c_lesse_quals(c_0,c_HOL_Oabs(B,A),A) ),
file('ANA029-2.p',unknown),
[] ).
cnf(6,axiom,
( ~ class_Orderings_Olinorder(A)
| c_less(B,C,A)
| c_lesse_quals(C,B,A) ),
file('ANA029-2.p',unknown),
[] ).
cnf(7,axiom,
( ~ class_Orderings_Olinorder(A)
| ~ c_lesse_quals(B,C,A)
| ~ c_lesse_quals(D,C,A)
| c_lesse_quals(c_Orderings_Omax(D,B,A),C,A) ),
file('ANA029-2.p',unknown),
[] ).
cnf(8,axiom,
( ~ class_Orderings_Oorder(A)
| ~ c_lesse_quals(B,C,A)
| ~ c_lesse_quals(D,B,A)
| c_lesse_quals(D,C,A) ),
file('ANA029-2.p',unknown),
[] ).
cnf(9,axiom,
( ~ class_Orderings_Oorder(A)
| ~ c_less(B,C,A)
| c_lesse_quals(B,C,A) ),
file('ANA029-2.p',unknown),
[] ).
cnf(10,axiom,
( ~ class_OrderedGroup_Opordered__ab__group__add(A)
| class_Orderings_Oorder(A) ),
file('ANA029-2.p',unknown),
[] ).
cnf(11,axiom,
( ~ class_Ring__and__Field_Oordered__idom(A)
| class_Orderings_Olinorder(A) ),
file('ANA029-2.p',unknown),
[] ).
cnf(12,axiom,
( ~ class_Ring__and__Field_Oordered__idom(A)
| class_OrderedGroup_Olordered__ab__group__abs(A) ),
file('ANA029-2.p',unknown),
[] ).
cnf(13,axiom,
( ~ class_Ring__and__Field_Oordered__idom(A)
| class_OrderedGroup_Opordered__ab__group__add(A) ),
file('ANA029-2.p',unknown),
[] ).
cnf(15,axiom,
class_Ring__and__Field_Oordered__idom(t_b),
file('ANA029-2.p',unknown),
[] ).
cnf(16,plain,
class_OrderedGroup_Opordered__ab__group__add(t_b),
inference(hyper,[status(thm)],[15,13]),
[iquote('hyper,15,13')] ).
cnf(17,plain,
class_OrderedGroup_Olordered__ab__group__abs(t_b),
inference(hyper,[status(thm)],[15,12]),
[iquote('hyper,15,12')] ).
cnf(18,plain,
class_Orderings_Olinorder(t_b),
inference(hyper,[status(thm)],[15,11]),
[iquote('hyper,15,11')] ).
cnf(19,plain,
class_Orderings_Oorder(t_b),
inference(hyper,[status(thm)],[16,10]),
[iquote('hyper,16,10')] ).
cnf(20,plain,
c_lesse_quals(c_0,c_HOL_Oabs(A,t_b),t_b),
inference(hyper,[status(thm)],[17,3]),
[iquote('hyper,17,3')] ).
cnf(21,plain,
( c_less(A,B,t_b)
| c_lesse_quals(B,A,t_b) ),
inference(hyper,[status(thm)],[18,6]),
[iquote('hyper,18,6')] ).
cnf(34,plain,
c_less(c_minus(v_f(v_x),v_k(v_x),t_b),c_0,t_b),
inference(hyper,[status(thm)],[21,1]),
[iquote('hyper,21,1')] ).
cnf(51,plain,
c_lesse_quals(c_minus(v_f(v_x),v_k(v_x),t_b),c_0,t_b),
inference(hyper,[status(thm)],[34,9,19]),
[iquote('hyper,34,9,19')] ).
cnf(73,plain,
c_lesse_quals(c_minus(v_f(v_x),v_k(v_x),t_b),c_HOL_Oabs(A,t_b),t_b),
inference(hyper,[status(thm)],[51,8,19,20]),
[iquote('hyper,51,8,19,20')] ).
cnf(524,plain,
c_lesse_quals(c_Orderings_Omax(c_minus(v_f(v_x),v_k(v_x),t_b),c_0,t_b),c_HOL_Oabs(A,t_b),t_b),
inference(hyper,[status(thm)],[73,7,18,20]),
[iquote('hyper,73,7,18,20')] ).
cnf(525,plain,
$false,
inference(binary,[status(thm)],[524,2]),
[iquote('binary,524.1,2.1')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : ANA029-2 : TPTP v8.1.0. Released v3.2.0.
% 0.07/0.13 % Command : otter-tptp-script %s
% 0.13/0.34 % Computer : n029.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Wed Jul 27 10:10:14 EDT 2022
% 0.13/0.34 % CPUTime :
% 1.80/1.95 ----- Otter 3.3f, August 2004 -----
% 1.80/1.95 The process was started by sandbox on n029.cluster.edu,
% 1.80/1.95 Wed Jul 27 10:10:14 2022
% 1.80/1.95 The command was "./otter". The process ID is 20789.
% 1.80/1.95
% 1.80/1.95 set(prolog_style_variables).
% 1.80/1.95 set(auto).
% 1.80/1.95 dependent: set(auto1).
% 1.80/1.95 dependent: set(process_input).
% 1.80/1.95 dependent: clear(print_kept).
% 1.80/1.95 dependent: clear(print_new_demod).
% 1.80/1.95 dependent: clear(print_back_demod).
% 1.80/1.95 dependent: clear(print_back_sub).
% 1.80/1.95 dependent: set(control_memory).
% 1.80/1.95 dependent: assign(max_mem, 12000).
% 1.80/1.95 dependent: assign(pick_given_ratio, 4).
% 1.80/1.95 dependent: assign(stats_level, 1).
% 1.80/1.95 dependent: assign(max_seconds, 10800).
% 1.80/1.95 clear(print_given).
% 1.80/1.95
% 1.80/1.95 list(usable).
% 1.80/1.95 0 [] -c_lesse_quals(c_0,c_minus(v_f(v_x),v_k(v_x),t_b),t_b).
% 1.80/1.95 0 [] -c_lesse_quals(c_Orderings_Omax(c_minus(v_f(v_x),v_k(v_x),t_b),c_0,t_b),c_HOL_Oabs(c_minus(v_f(v_x),v_g(v_x),t_b),t_b),t_b).
% 1.80/1.95 0 [] class_Ring__and__Field_Oordered__idom(t_b).
% 1.80/1.95 0 [] -class_OrderedGroup_Olordered__ab__group__abs(T_a)|c_lesse_quals(c_0,c_HOL_Oabs(V_a,T_a),T_a).
% 1.80/1.95 0 [] -class_OrderedGroup_Opordered__ab__group__add(T_a)| -c_lesse_quals(c_minus(V_a,V_b,T_a),c_0,T_a)|c_lesse_quals(V_a,V_b,T_a).
% 1.80/1.95 0 [] -class_OrderedGroup_Opordered__ab__group__add(T_a)| -c_lesse_quals(V_a,V_b,T_a)|c_lesse_quals(c_minus(V_a,V_b,T_a),c_0,T_a).
% 1.80/1.95 0 [] -class_Orderings_Olinorder(T_a)|c_less(V_y,V_x,T_a)|c_lesse_quals(V_x,V_y,T_a).
% 1.80/1.95 0 [] -class_Orderings_Olinorder(T_b)| -c_lesse_quals(V_y,V_z,T_b)| -c_lesse_quals(V_x,V_z,T_b)|c_lesse_quals(c_Orderings_Omax(V_x,V_y,T_b),V_z,T_b).
% 1.80/1.95 0 [] -class_Orderings_Oorder(T_a)| -c_lesse_quals(V_y,V_z,T_a)| -c_lesse_quals(V_x,V_y,T_a)|c_lesse_quals(V_x,V_z,T_a).
% 1.80/1.95 0 [] -class_Orderings_Oorder(T_a)| -c_less(V_x,V_y,T_a)|c_lesse_quals(V_x,V_y,T_a).
% 1.80/1.95 0 [] -class_OrderedGroup_Opordered__ab__group__add(T)|class_Orderings_Oorder(T).
% 1.80/1.95 0 [] -class_Ring__and__Field_Oordered__idom(T)|class_Orderings_Olinorder(T).
% 1.80/1.95 0 [] -class_Ring__and__Field_Oordered__idom(T)|class_OrderedGroup_Olordered__ab__group__abs(T).
% 1.80/1.95 0 [] -class_Ring__and__Field_Oordered__idom(T)|class_OrderedGroup_Opordered__ab__group__add(T).
% 1.80/1.95 end_of_list.
% 1.80/1.95
% 1.80/1.95 SCAN INPUT: prop=0, horn=0, equality=0, symmetry=0, max_lits=4.
% 1.80/1.95
% 1.80/1.95 This is a non-Horn set without equality. The strategy will
% 1.80/1.95 be ordered hyper_res, unit deletion, and factoring, with
% 1.80/1.95 satellites in sos and with nuclei in usable.
% 1.80/1.95
% 1.80/1.95 dependent: set(hyper_res).
% 1.80/1.95 dependent: set(factor).
% 1.80/1.95 dependent: set(unit_deletion).
% 1.80/1.95
% 1.80/1.95 ------------> process usable:
% 1.80/1.95 ** KEPT (pick-wt=9): 1 [] -c_lesse_quals(c_0,c_minus(v_f(v_x),v_k(v_x),t_b),t_b).
% 1.80/1.95 ** KEPT (pick-wt=19): 2 [] -c_lesse_quals(c_Orderings_Omax(c_minus(v_f(v_x),v_k(v_x),t_b),c_0,t_b),c_HOL_Oabs(c_minus(v_f(v_x),v_g(v_x),t_b),t_b),t_b).
% 1.80/1.95 ** KEPT (pick-wt=8): 3 [] -class_OrderedGroup_Olordered__ab__group__abs(A)|c_lesse_quals(c_0,c_HOL_Oabs(B,A),A).
% 1.80/1.95 ** KEPT (pick-wt=13): 4 [] -class_OrderedGroup_Opordered__ab__group__add(A)| -c_lesse_quals(c_minus(B,C,A),c_0,A)|c_lesse_quals(B,C,A).
% 1.80/1.95 ** KEPT (pick-wt=13): 5 [] -class_OrderedGroup_Opordered__ab__group__add(A)| -c_lesse_quals(B,C,A)|c_lesse_quals(c_minus(B,C,A),c_0,A).
% 1.80/1.95 ** KEPT (pick-wt=10): 6 [] -class_Orderings_Olinorder(A)|c_less(B,C,A)|c_lesse_quals(C,B,A).
% 1.80/1.95 ** KEPT (pick-wt=17): 7 [] -class_Orderings_Olinorder(A)| -c_lesse_quals(B,C,A)| -c_lesse_quals(D,C,A)|c_lesse_quals(c_Orderings_Omax(D,B,A),C,A).
% 1.80/1.95 ** KEPT (pick-wt=14): 8 [] -class_Orderings_Oorder(A)| -c_lesse_quals(B,C,A)| -c_lesse_quals(D,B,A)|c_lesse_quals(D,C,A).
% 1.80/1.95 ** KEPT (pick-wt=10): 9 [] -class_Orderings_Oorder(A)| -c_less(B,C,A)|c_lesse_quals(B,C,A).
% 1.80/1.95 ** KEPT (pick-wt=4): 10 [] -class_OrderedGroup_Opordered__ab__group__add(A)|class_Orderings_Oorder(A).
% 1.80/1.95 ** KEPT (pick-wt=4): 11 [] -class_Ring__and__Field_Oordered__idom(A)|class_Orderings_Olinorder(A).
% 1.80/1.95 ** KEPT (pick-wt=4): 12 [] -class_Ring__and__Field_Oordered__idom(A)|class_OrderedGroup_Olordered__ab__group__abs(A).
% 1.80/1.95 ** KEPT (pick-wt=4): 13 [] -class_Ring__and__Field_Oordered__idom(A)|class_OrderedGroup_Opordered__ab__group__add(A).
% 1.80/1.95
% 1.80/1.95 ------------> process sos:
% 1.80/1.95 ** KEPT (pick-wt=2): 15 [] class_Ring__and__Field_Oordered__idom(t_b).
% 1.80/1.95
% 1.80/1.95 ======= end of input processing =======
% 1.80/1.95
% 1.80/1.95 =========== start of search ===========
% 1.80/1.95
% 1.80/1.95 -------- PROOF --------
% 1.80/1.95
% 1.80/1.95 ----> UNIT CONFLICT at 0.04 sec ----> 525 [binary,524.1,2.1] $F.
% 1.80/1.95
% 1.80/1.95 Length of proof is 10. Level of proof is 6.
% 1.80/1.95
% 1.80/1.95 ---------------- PROOF ----------------
% 1.80/1.95 % SZS status Unsatisfiable
% 1.80/1.95 % SZS output start Refutation
% See solution above
% 1.80/1.95 ------------ end of proof -------------
% 1.80/1.95
% 1.80/1.95
% 1.80/1.95 Search stopped by max_proofs option.
% 1.80/1.95
% 1.80/1.95
% 1.80/1.95 Search stopped by max_proofs option.
% 1.80/1.95
% 1.80/1.95 ============ end of search ============
% 1.80/1.95
% 1.80/1.95 -------------- statistics -------------
% 1.80/1.95 clauses given 24
% 1.80/1.95 clauses generated 885
% 1.80/1.95 clauses kept 524
% 1.80/1.95 clauses forward subsumed 374
% 1.80/1.95 clauses back subsumed 8
% 1.80/1.95 Kbytes malloced 1953
% 1.80/1.95
% 1.80/1.95 ----------- times (seconds) -----------
% 1.80/1.95 user CPU time 0.04 (0 hr, 0 min, 0 sec)
% 1.80/1.95 system CPU time 0.00 (0 hr, 0 min, 0 sec)
% 1.80/1.95 wall-clock time 2 (0 hr, 0 min, 2 sec)
% 1.80/1.95
% 1.80/1.95 That finishes the proof of the theorem.
% 1.80/1.95
% 1.80/1.95 Process 20789 finished Wed Jul 27 10:10:16 2022
% 1.80/1.95 Otter interrupted
% 1.80/1.95 PROOF FOUND
%------------------------------------------------------------------------------