TSTP Solution File: ANA023-10 by Otter---3.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : ANA023-10 : TPTP v8.1.0. Released v7.5.0.
% Transfm : none
% Format : tptp:raw
% Command : otter-tptp-script %s
% Computer : n012.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:44 EDT 2022
% Result : Unsatisfiable 1.68s 1.90s
% Output : Refutation 1.68s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 14
% Syntax : Number of clauses : 25 ( 25 unt; 0 nHn; 12 RR)
% Number of literals : 25 ( 24 equ; 1 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 17 ( 17 usr; 4 con; 0-4 aty)
% Number of variables : 28 ( 2 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
c_lesse_quals(c_0,c_minus(v_f(v_x),v_g(v_x),t_b),t_b) != true,
file('ANA023-10.p',unknown),
[] ).
cnf(4,axiom,
ife_q2(A,A,B,C) = B,
file('ANA023-10.p',unknown),
[] ).
cnf(6,axiom,
ife_q(A,A,B,C) = B,
file('ANA023-10.p',unknown),
[] ).
cnf(7,axiom,
ife_q2(class_OrderedGroup_Ocomm__monoid__add(A),true,c_plus(c_0,B,A),B) = B,
file('ANA023-10.p',unknown),
[] ).
cnf(9,axiom,
ife_q(class_OrderedGroup_Opordered__ab__group__add(A),true,ife_q(c_lesse_quals(B,c_minus(C,D,A),A),true,c_lesse_quals(c_plus(B,D,A),C,A),true),true) = true,
file('ANA023-10.p',unknown),
[] ).
cnf(11,axiom,
ife_q(class_OrderedGroup_Opordered__ab__group__add(A),true,ife_q(c_lesse_quals(c_plus(B,C,A),D,A),true,c_lesse_quals(B,c_minus(D,C,A),A),true),true) = true,
file('ANA023-10.p',unknown),
[] ).
cnf(13,axiom,
ife_q(class_Orderings_Oorder(A),true,ife_q(c_lesse_quals(B,C,A),true,ife_q(c_lesse_quals(C,D,A),true,c_lesse_quals(B,D,A),true),true),true) = true,
file('ANA023-10.p',unknown),
[] ).
cnf(15,axiom,
c_lesse_quals(c_0,c_minus(v_k(v_x),v_g(v_x),t_b),t_b) = true,
file('ANA023-10.p',unknown),
[] ).
cnf(17,axiom,
c_lesse_quals(v_k(v_x),v_f(v_x),t_b) = true,
file('ANA023-10.p',unknown),
[] ).
cnf(19,axiom,
ife_q(class_Orderings_Olinorder(A),true,class_Orderings_Oorder(A),true) = true,
file('ANA023-10.p',unknown),
[] ).
cnf(21,axiom,
ife_q(class_Ring__and__Field_Oordered__idom(A),true,class_OrderedGroup_Ocomm__monoid__add(A),true) = true,
file('ANA023-10.p',unknown),
[] ).
cnf(23,axiom,
ife_q(class_Ring__and__Field_Oordered__idom(A),true,class_Orderings_Olinorder(A),true) = true,
file('ANA023-10.p',unknown),
[] ).
cnf(25,axiom,
ife_q(class_Ring__and__Field_Oordered__idom(A),true,class_OrderedGroup_Opordered__ab__group__add(A),true) = true,
file('ANA023-10.p',unknown),
[] ).
cnf(27,axiom,
class_Ring__and__Field_Oordered__idom(t_b) = true,
file('ANA023-10.p',unknown),
[] ).
cnf(29,plain,
class_OrderedGroup_Ocomm__monoid__add(t_b) = true,
inference(demod,[status(thm),theory(equality)],[inference(para_into,[status(thm),theory(equality)],[21,27]),6]),
[iquote('para_into,21.1.1.1,27.1.1,demod,6')] ).
cnf(32,plain,
c_plus(c_0,A,t_b) = A,
inference(demod,[status(thm),theory(equality)],[inference(para_from,[status(thm),theory(equality)],[29,7]),4]),
[iquote('para_from,29.1.1,7.1.1.1,demod,4')] ).
cnf(35,plain,
class_Orderings_Olinorder(t_b) = true,
inference(demod,[status(thm),theory(equality)],[inference(para_into,[status(thm),theory(equality)],[23,27]),6]),
[iquote('para_into,23.1.1.1,27.1.1,demod,6')] ).
cnf(38,plain,
class_Orderings_Oorder(t_b) = true,
inference(demod,[status(thm),theory(equality)],[inference(para_from,[status(thm),theory(equality)],[35,19]),6]),
[iquote('para_from,35.1.1,19.1.1.1,demod,6')] ).
cnf(40,plain,
class_OrderedGroup_Opordered__ab__group__add(t_b) = true,
inference(demod,[status(thm),theory(equality)],[inference(para_into,[status(thm),theory(equality)],[25,27]),6]),
[iquote('para_into,25.1.1.1,27.1.1,demod,6')] ).
cnf(43,plain,
ife_q(c_lesse_quals(A,B,t_b),true,c_lesse_quals(c_0,c_minus(B,A,t_b),t_b),true) = true,
inference(demod,[status(thm),theory(equality)],[inference(para_into,[status(thm),theory(equality)],[11,32]),40,6]),
[iquote('para_into,11.1.1.3.1.1,31.1.1,demod,40,6')] ).
cnf(51,plain,
c_lesse_quals(v_g(v_x),v_k(v_x),t_b) = true,
inference(demod,[status(thm),theory(equality)],[inference(para_from,[status(thm),theory(equality)],[15,9]),40,32,6,6]),
[iquote('para_from,15.1.1,9.1.1.3.1,demod,40,32,6,6')] ).
cnf(59,plain,
ife_q(c_lesse_quals(v_k(v_x),A,t_b),true,c_lesse_quals(v_g(v_x),A,t_b),true) = true,
inference(demod,[status(thm),theory(equality)],[inference(para_into,[status(thm),theory(equality)],[13,51]),38,6,6]),
[iquote('para_into,13.1.1.3.1,51.1.1,demod,38,6,6')] ).
cnf(77,plain,
c_lesse_quals(v_g(v_x),v_f(v_x),t_b) = true,
inference(demod,[status(thm),theory(equality)],[inference(para_into,[status(thm),theory(equality)],[59,17]),6]),
[iquote('para_into,59.1.1.1,17.1.1,demod,6')] ).
cnf(89,plain,
c_lesse_quals(c_0,c_minus(v_f(v_x),v_g(v_x),t_b),t_b) = true,
inference(demod,[status(thm),theory(equality)],[inference(para_into,[status(thm),theory(equality)],[43,77]),6]),
[iquote('para_into,43.1.1.1,77.1.1,demod,6')] ).
cnf(91,plain,
$false,
inference(binary,[status(thm)],[89,1]),
[iquote('binary,89.1,1.1')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11 % Problem : ANA023-10 : TPTP v8.1.0. Released v7.5.0.
% 0.03/0.12 % Command : otter-tptp-script %s
% 0.12/0.33 % Computer : n012.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 10:01:50 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 n012.cluster.edu,
% 1.68/1.90 Wed Jul 27 10:01:50 2022
% 1.68/1.90 The command was "./otter". The process ID is 20461.
% 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 [] ife_q2(A,A,B,C)=B.
% 1.68/1.90 0 [] ife_q(A,A,B,C)=B.
% 1.68/1.90 0 [] ife_q2(class_OrderedGroup_Ocomm__monoid__add(T_a),true,c_plus(c_0,V_y,T_a),V_y)=V_y.
% 1.68/1.90 0 [] ife_q(class_OrderedGroup_Opordered__ab__group__add(T_a),true,ife_q(c_lesse_quals(V_a,c_minus(V_c,V_b,T_a),T_a),true,c_lesse_quals(c_plus(V_a,V_b,T_a),V_c,T_a),true),true)=true.
% 1.68/1.90 0 [] ife_q(class_OrderedGroup_Opordered__ab__group__add(T_a),true,ife_q(c_lesse_quals(c_plus(V_a,V_b,T_a),V_c,T_a),true,c_lesse_quals(V_a,c_minus(V_c,V_b,T_a),T_a),true),true)=true.
% 1.68/1.90 0 [] ife_q(class_Orderings_Oorder(T_a),true,ife_q(c_lesse_quals(V_x,V_y,T_a),true,ife_q(c_lesse_quals(V_y,V_z,T_a),true,c_lesse_quals(V_x,V_z,T_a),true),true),true)=true.
% 1.68/1.90 0 [] c_lesse_quals(c_0,c_minus(v_k(v_x),v_g(v_x),t_b),t_b)=true.
% 1.68/1.90 0 [] c_lesse_quals(v_k(v_x),v_f(v_x),t_b)=true.
% 1.68/1.90 0 [] c_lesse_quals(c_0,c_minus(v_f(v_x),v_g(v_x),t_b),t_b)!=true.
% 1.68/1.90 0 [] ife_q(class_Orderings_Olinorder(T),true,class_Orderings_Oorder(T),true)=true.
% 1.68/1.90 0 [] ife_q(class_Ring__and__Field_Oordered__idom(T),true,class_OrderedGroup_Ocomm__monoid__add(T),true)=true.
% 1.68/1.90 0 [] ife_q(class_Ring__and__Field_Oordered__idom(T),true,class_Orderings_Olinorder(T),true)=true.
% 1.68/1.90 0 [] ife_q(class_Ring__and__Field_Oordered__idom(T),true,class_OrderedGroup_Opordered__ab__group__add(T),true)=true.
% 1.68/1.90 0 [] class_Ring__and__Field_Oordered__idom(t_b)=true.
% 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=1.
% 1.68/1.90
% 1.68/1.90 All clauses are units, and equality is present; the
% 1.68/1.90 strategy will be Knuth-Bendix with positive clauses in sos.
% 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
% 1.68/1.90 ------------> process usable:
% 1.68/1.90 ** KEPT (pick-wt=11): 1 [] c_lesse_quals(c_0,c_minus(v_f(v_x),v_g(v_x),t_b),t_b)!=true.
% 1.68/1.90
% 1.68/1.90 ------------> process sos:
% 1.68/1.90 ** KEPT (pick-wt=3): 2 [] A=A.
% 1.68/1.90 ** KEPT (pick-wt=7): 3 [] ife_q2(A,A,B,C)=B.
% 1.68/1.90 ---> New Demodulator: 4 [new_demod,3] ife_q2(A,A,B,C)=B.
% 1.68/1.90 ** KEPT (pick-wt=7): 5 [] ife_q(A,A,B,C)=B.
% 1.68/1.90 ---> New Demodulator: 6 [new_demod,5] ife_q(A,A,B,C)=B.
% 1.68/1.90 ** KEPT (pick-wt=11): 7 [] ife_q2(class_OrderedGroup_Ocomm__monoid__add(A),true,c_plus(c_0,B,A),B)=B.
% 1.68/1.90 ---> New Demodulator: 8 [new_demod,7] ife_q2(class_OrderedGroup_Ocomm__monoid__add(A),true,c_plus(c_0,B,A),B)=B.
% 1.68/1.90 ** KEPT (pick-wt=24): 9 [] ife_q(class_OrderedGroup_Opordered__ab__group__add(A),true,ife_q(c_lesse_quals(B,c_minus(C,D,A),A),true,c_lesse_quals(c_plus(B,D,A),C,A),true),true)=true.
% 1.68/1.90 ---> New Demodulator: 10 [new_demod,9] ife_q(class_OrderedGroup_Opordered__ab__group__add(A),true,ife_q(c_lesse_quals(B,c_minus(C,D,A),A),true,c_lesse_quals(c_plus(B,D,A),C,A),true),true)=true.
% 1.68/1.90 ** KEPT (pick-wt=24): 11 [] ife_q(class_OrderedGroup_Opordered__ab__group__add(A),true,ife_q(c_lesse_quals(c_plus(B,C,A),D,A),true,c_lesse_quals(B,c_minus(D,C,A),A),true),true)=true.
% 1.68/1.90 ---> New Demodulator: 12 [new_demod,11] ife_q(class_OrderedGroup_Opordered__ab__group__add(A),true,ife_q(c_lesse_quals(c_plus(B,C,A),D,A),true,c_lesse_quals(B,c_minus(D,C,A),A),true),true)=true.
% 1.68/1.90 ** KEPT (pick-wt=25): 13 [] ife_q(class_Orderings_Oorder(A),true,ife_q(c_lesse_quals(B,C,A),true,ife_q(c_lesse_quals(C,D,A),true,c_lesse_quals(B,D,A),true),true),true)=true.
% 1.68/1.90 ---> New Demodulator: 14 [new_demod,13] ife_q(class_Orderings_Oorder(A),true,ife_q(c_lesse_quals(B,C,A),true,ife_q(c_lesse_quals(C,D,A),true,c_lesse_quals(B,D,A),true),true),true)=true.
% 1.68/1.90 ** KEPT (pick-wt=11): 15 [] c_lesse_quals(c_0,c_minus(v_k(v_x),v_g(v_x),t_b),t_b)=true.
% 1.68/1.90 ---> New Demodulator: 16 [new_demod,15] c_lesse_quals(c_0,c_minus(v_k(v_x),v_g(v_x),t_b),t_b)=true.
% 1.68/1.90 ** KEPT (pick-wt=8): 17 [] c_lesse_quals(v_k(v_x),v_f(v_x),t_b)=true.
% 1.68/1.90 ---> New Demodulator: 18 [new_demod,17] c_lesse_quals(v_k(v_x),v_f(v_x),t_b)=true.
% 1.68/1.90 ** KEPT (pick-wt=9): 19 [] ife_q(class_Orderings_Olinorder(A),true,class_Orderings_Oorder(A),true)=true.
% 1.68/1.90 ---> New Demodulator: 20 [new_demod,19] ife_q(class_Orderings_Olinorder(A),true,class_Orderings_Oorder(A),true)=true.
% 1.68/1.90 ** KEPT (pick-wt=9): 21 [] ife_q(class_Ring__and__Field_Oordered__idom(A),true,class_OrderedGroup_Ocomm__monoid__add(A),true)=true.
% 1.68/1.90 ---> New Demodulator: 22 [new_demod,21] ife_q(class_Ring__and__Field_Oordered__idom(A),true,class_OrderedGroup_Ocomm__monoid__add(A),true)=true.
% 1.68/1.90 ** KEPT (pick-wt=9): 23 [] ife_q(class_Ring__and__Field_Oordered__idom(A),true,class_Orderings_Olinorder(A),true)=true.
% 1.68/1.90 ---> New Demodulator: 24 [new_demod,23] ife_q(class_Ring__and__Field_Oordered__idom(A),true,class_Orderings_Olinorder(A),true)=true.
% 1.68/1.90 ** KEPT (pick-wt=9): 25 [] ife_q(class_Ring__and__Field_Oordered__idom(A),true,class_OrderedGroup_Opordered__ab__group__add(A),true)=true.
% 1.68/1.90 ---> New Demodulator: 26 [new_demod,25] ife_q(class_Ring__and__Field_Oordered__idom(A),true,class_OrderedGroup_Opordered__ab__group__add(A),true)=true.
% 1.68/1.90 ** KEPT (pick-wt=4): 27 [] class_Ring__and__Field_Oordered__idom(t_b)=true.
% 1.68/1.90 ---> New Demodulator: 28 [new_demod,27] class_Ring__and__Field_Oordered__idom(t_b)=true.
% 1.68/1.90 Following clause subsumed by 2 during input processing: 0 [copy,2,flip.1] A=A.
% 1.68/1.90 >>>> Starting back demodulation with 4.
% 1.68/1.90 >>>> Starting back demodulation with 6.
% 1.68/1.90 >>>> Starting back demodulation with 8.
% 1.68/1.90 >>>> Starting back demodulation with 10.
% 1.68/1.90 >>>> Starting back demodulation with 12.
% 1.68/1.90 >>>> Starting back demodulation with 14.
% 1.68/1.90 >>>> Starting back demodulation with 16.
% 1.68/1.90 >>>> Starting back demodulation with 18.
% 1.68/1.90 >>>> Starting back demodulation with 20.
% 1.68/1.90 >>>> Starting back demodulation with 22.
% 1.68/1.90 >>>> Starting back demodulation with 24.
% 1.68/1.90 >>>> Starting back demodulation with 26.
% 1.68/1.90 >>>> Starting back demodulation with 28.
% 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 ----> 91 [binary,89.1,1.1] $F.
% 1.68/1.90
% 1.68/1.90 Length of proof is 10. 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.91 clauses given 26
% 1.68/1.91 clauses generated 87
% 1.68/1.91 clauses kept 46
% 1.68/1.91 clauses forward subsumed 59
% 1.68/1.91 clauses back subsumed 0
% 1.68/1.91 Kbytes malloced 1953
% 1.68/1.91
% 1.68/1.91 ----------- times (seconds) -----------
% 1.68/1.91 user CPU time 0.00 (0 hr, 0 min, 0 sec)
% 1.68/1.91 system CPU time 0.00 (0 hr, 0 min, 0 sec)
% 1.68/1.91 wall-clock time 2 (0 hr, 0 min, 2 sec)
% 1.68/1.91
% 1.68/1.91 That finishes the proof of the theorem.
% 1.68/1.91
% 1.68/1.91 Process 20461 finished Wed Jul 27 10:01:52 2022
% 1.68/1.91 Otter interrupted
% 1.68/1.91 PROOF FOUND
%------------------------------------------------------------------------------