TSTP Solution File: ANA024-2 by Otter---3.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : ANA024-2 : TPTP v8.1.0. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : otter-tptp-script %s
% Computer : n010.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:45 EDT 2022
% Result : Unsatisfiable 1.72s 1.93s
% Output : Refutation 1.72s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 7
% Syntax : Number of clauses : 14 ( 8 unt; 0 nHn; 8 RR)
% Number of literals : 22 ( 3 equ; 9 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-3 aty)
% Number of functors : 7 ( 7 usr; 2 con; 0-3 aty)
% Number of variables : 20 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
( ~ class_OrderedGroup_Oab__group__add(A)
| B = c_plus(c_minus(B,C,A),C,A) ),
file('ANA024-2.p',unknown),
[] ).
cnf(2,plain,
( ~ class_OrderedGroup_Oab__group__add(A)
| c_plus(c_minus(B,C,A),C,A) = B ),
inference(flip,[status(thm),theory(equality)],[inference(copy,[status(thm)],[1])]),
[iquote('copy,1,flip.2')] ).
cnf(3,axiom,
( ~ class_OrderedGroup_Opordered__ab__group__add(A)
| ~ c_lesse_quals(c_plus(B,C,A),D,A)
| c_lesse_quals(B,c_minus(D,C,A),A) ),
file('ANA024-2.p',unknown),
[] ).
cnf(4,axiom,
~ c_lesse_quals(c_minus(v_k(v_x),v_g(v_x),t_b),c_minus(v_f(v_x),v_g(v_x),t_b),t_b),
file('ANA024-2.p',unknown),
[] ).
cnf(5,axiom,
( ~ class_OrderedGroup_Opordered__ab__group__add(A)
| class_OrderedGroup_Oab__group__add(A) ),
file('ANA024-2.p',unknown),
[] ).
cnf(6,axiom,
( ~ class_Ring__and__Field_Oordered__idom(A)
| class_OrderedGroup_Opordered__ab__group__add(A) ),
file('ANA024-2.p',unknown),
[] ).
cnf(8,axiom,
c_lesse_quals(v_k(A),v_f(A),t_b),
file('ANA024-2.p',unknown),
[] ).
cnf(9,axiom,
class_Ring__and__Field_Oordered__idom(t_b),
file('ANA024-2.p',unknown),
[] ).
cnf(10,plain,
class_OrderedGroup_Opordered__ab__group__add(t_b),
inference(hyper,[status(thm)],[9,6]),
[iquote('hyper,9,6')] ).
cnf(11,plain,
class_OrderedGroup_Oab__group__add(t_b),
inference(hyper,[status(thm)],[10,5]),
[iquote('hyper,10,5')] ).
cnf(12,plain,
c_plus(c_minus(A,B,t_b),B,t_b) = A,
inference(hyper,[status(thm)],[11,2]),
[iquote('hyper,11,2')] ).
cnf(14,plain,
( ~ class_OrderedGroup_Opordered__ab__group__add(t_b)
| ~ c_lesse_quals(A,B,t_b)
| c_lesse_quals(c_minus(A,C,t_b),c_minus(B,C,t_b),t_b) ),
inference(para_from,[status(thm),theory(equality)],[12,3]),
[iquote('para_from,12.1.1,3.2.1')] ).
cnf(15,plain,
c_lesse_quals(c_minus(v_k(A),B,t_b),c_minus(v_f(A),B,t_b),t_b),
inference(hyper,[status(thm)],[14,10,8]),
[iquote('hyper,14,10,8')] ).
cnf(16,plain,
$false,
inference(binary,[status(thm)],[15,4]),
[iquote('binary,15.1,4.1')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : ANA024-2 : TPTP v8.1.0. Released v3.2.0.
% 0.07/0.12 % Command : otter-tptp-script %s
% 0.12/0.33 % Computer : n010.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 09:56:39 EDT 2022
% 0.12/0.33 % CPUTime :
% 1.72/1.93 ----- Otter 3.3f, August 2004 -----
% 1.72/1.93 The process was started by sandbox2 on n010.cluster.edu,
% 1.72/1.93 Wed Jul 27 09:56:40 2022
% 1.72/1.93 The command was "./otter". The process ID is 24359.
% 1.72/1.93
% 1.72/1.93 set(prolog_style_variables).
% 1.72/1.93 set(auto).
% 1.72/1.93 dependent: set(auto1).
% 1.72/1.93 dependent: set(process_input).
% 1.72/1.93 dependent: clear(print_kept).
% 1.72/1.93 dependent: clear(print_new_demod).
% 1.72/1.93 dependent: clear(print_back_demod).
% 1.72/1.93 dependent: clear(print_back_sub).
% 1.72/1.93 dependent: set(control_memory).
% 1.72/1.93 dependent: assign(max_mem, 12000).
% 1.72/1.93 dependent: assign(pick_given_ratio, 4).
% 1.72/1.93 dependent: assign(stats_level, 1).
% 1.72/1.93 dependent: assign(max_seconds, 10800).
% 1.72/1.93 clear(print_given).
% 1.72/1.93
% 1.72/1.93 list(usable).
% 1.72/1.93 0 [] A=A.
% 1.72/1.93 0 [] -class_OrderedGroup_Oab__group__add(T_a)|V_a=c_plus(c_minus(V_a,V_b,T_a),V_b,T_a).
% 1.72/1.93 0 [] -class_OrderedGroup_Opordered__ab__group__add(T_a)| -c_lesse_quals(c_plus(V_a,V_b,T_a),V_c,T_a)|c_lesse_quals(V_a,c_minus(V_c,V_b,T_a),T_a).
% 1.72/1.93 0 [] c_lesse_quals(v_k(V_U),v_f(V_U),t_b).
% 1.72/1.93 0 [] -c_lesse_quals(c_minus(v_k(v_x),v_g(v_x),t_b),c_minus(v_f(v_x),v_g(v_x),t_b),t_b).
% 1.72/1.93 0 [] -class_OrderedGroup_Opordered__ab__group__add(T)|class_OrderedGroup_Oab__group__add(T).
% 1.72/1.93 0 [] -class_Ring__and__Field_Oordered__idom(T)|class_OrderedGroup_Opordered__ab__group__add(T).
% 1.72/1.93 0 [] class_Ring__and__Field_Oordered__idom(t_b).
% 1.72/1.93 end_of_list.
% 1.72/1.93
% 1.72/1.93 SCAN INPUT: prop=0, horn=1, equality=1, symmetry=0, max_lits=3.
% 1.72/1.93
% 1.72/1.93 This is a Horn set with equality. The strategy will be
% 1.72/1.93 Knuth-Bendix and hyper_res, with positive clauses in
% 1.72/1.93 sos and nonpositive clauses in usable.
% 1.72/1.93
% 1.72/1.93 dependent: set(knuth_bendix).
% 1.72/1.93 dependent: set(anl_eq).
% 1.72/1.93 dependent: set(para_from).
% 1.72/1.93 dependent: set(para_into).
% 1.72/1.93 dependent: clear(para_from_right).
% 1.72/1.93 dependent: clear(para_into_right).
% 1.72/1.93 dependent: set(para_from_vars).
% 1.72/1.93 dependent: set(eq_units_both_ways).
% 1.72/1.93 dependent: set(dynamic_demod_all).
% 1.72/1.93 dependent: set(dynamic_demod).
% 1.72/1.93 dependent: set(order_eq).
% 1.72/1.93 dependent: set(back_demod).
% 1.72/1.93 dependent: set(lrpo).
% 1.72/1.93 dependent: set(hyper_res).
% 1.72/1.93 dependent: clear(order_hyper).
% 1.72/1.93
% 1.72/1.93 ------------> process usable:
% 1.72/1.93 ** KEPT (pick-wt=11): 2 [copy,1,flip.2] -class_OrderedGroup_Oab__group__add(A)|c_plus(c_minus(B,C,A),C,A)=B.
% 1.72/1.93 ** KEPT (pick-wt=16): 3 [] -class_OrderedGroup_Opordered__ab__group__add(A)| -c_lesse_quals(c_plus(B,C,A),D,A)|c_lesse_quals(B,c_minus(D,C,A),A).
% 1.72/1.93 ** KEPT (pick-wt=14): 4 [] -c_lesse_quals(c_minus(v_k(v_x),v_g(v_x),t_b),c_minus(v_f(v_x),v_g(v_x),t_b),t_b).
% 1.72/1.93 ** KEPT (pick-wt=4): 5 [] -class_OrderedGroup_Opordered__ab__group__add(A)|class_OrderedGroup_Oab__group__add(A).
% 1.72/1.93 ** KEPT (pick-wt=4): 6 [] -class_Ring__and__Field_Oordered__idom(A)|class_OrderedGroup_Opordered__ab__group__add(A).
% 1.72/1.93
% 1.72/1.93 ------------> process sos:
% 1.72/1.93 ** KEPT (pick-wt=3): 7 [] A=A.
% 1.72/1.93 ** KEPT (pick-wt=6): 8 [] c_lesse_quals(v_k(A),v_f(A),t_b).
% 1.72/1.93 ** KEPT (pick-wt=2): 9 [] class_Ring__and__Field_Oordered__idom(t_b).
% 1.72/1.93 Following clause subsumed by 7 during input processing: 0 [copy,7,flip.1] A=A.
% 1.72/1.93
% 1.72/1.93 ======= end of input processing =======
% 1.72/1.93
% 1.72/1.93 =========== start of search ===========
% 1.72/1.93
% 1.72/1.93 -------- PROOF --------
% 1.72/1.93
% 1.72/1.93 ----> UNIT CONFLICT at 0.00 sec ----> 16 [binary,15.1,4.1] $F.
% 1.72/1.93
% 1.72/1.93 Length of proof is 6. Level of proof is 5.
% 1.72/1.93
% 1.72/1.93 ---------------- PROOF ----------------
% 1.72/1.93 % SZS status Unsatisfiable
% 1.72/1.93 % SZS output start Refutation
% See solution above
% 1.72/1.93 ------------ end of proof -------------
% 1.72/1.93
% 1.72/1.93
% 1.72/1.93 Search stopped by max_proofs option.
% 1.72/1.93
% 1.72/1.93
% 1.72/1.93 Search stopped by max_proofs option.
% 1.72/1.93
% 1.72/1.93 ============ end of search ============
% 1.72/1.93
% 1.72/1.93 -------------- statistics -------------
% 1.72/1.93 clauses given 7
% 1.72/1.93 clauses generated 9
% 1.72/1.93 clauses kept 13
% 1.72/1.93 clauses forward subsumed 5
% 1.72/1.93 clauses back subsumed 0
% 1.72/1.93 Kbytes malloced 976
% 1.72/1.93
% 1.72/1.93 ----------- times (seconds) -----------
% 1.72/1.93 user CPU time 0.00 (0 hr, 0 min, 0 sec)
% 1.72/1.93 system CPU time 0.00 (0 hr, 0 min, 0 sec)
% 1.72/1.93 wall-clock time 1 (0 hr, 0 min, 1 sec)
% 1.72/1.93
% 1.72/1.93 That finishes the proof of the theorem.
% 1.72/1.93
% 1.72/1.93 Process 24359 finished Wed Jul 27 09:56:41 2022
% 1.72/1.93 Otter interrupted
% 1.72/1.93 PROOF FOUND
%------------------------------------------------------------------------------