%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : ANA012-2 : TPTP v8.1.0. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : otter-tptp-script %s
% Computer : n009.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:43 EDT 2022
% Result : Unsatisfiable 1.72s 1.93s
% Output : Refutation 1.72s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 9
% Syntax : Number of clauses : 17 ( 10 unt; 2 nHn; 13 RR)
% Number of literals : 26 ( 9 equ; 9 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 7 ( 5 usr; 1 prp; 0-3 aty)
% Number of functors : 7 ( 7 usr; 4 con; 0-3 aty)
% Number of variables : 12 ( 1 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
v_c != c_0,
file('ANA012-2.p',unknown),
[] ).
cnf(2,axiom,
~ c_lesse_quals(c_1,c_times(A,c_HOL_Oabs(v_c,t_a),t_a),t_a),
file('ANA012-2.p',unknown),
[] ).
cnf(3,axiom,
( ~ class_OrderedGroup_Olordered__ab__group__abs(A)
| c_HOL_Oabs(B,A) != c_0
| B = c_0 ),
file('ANA012-2.p',unknown),
[] ).
cnf(4,axiom,
( ~ class_Orderings_Oorder(A)
| c_lesse_quals(B,B,A) ),
file('ANA012-2.p',unknown),
[] ).
cnf(5,axiom,
( ~ class_Ring__and__Field_Ofield(A)
| B = c_0
| c_times(c_HOL_Oinverse(B,A),B,A) = c_1 ),
file('ANA012-2.p',unknown),
[] ).
cnf(6,axiom,
( ~ class_Ring__and__Field_Oordered__field(A)
| class_Ring__and__Field_Ofield(A) ),
file('ANA012-2.p',unknown),
[] ).
cnf(7,axiom,
( ~ class_Ring__and__Field_Oordered__field(A)
| class_OrderedGroup_Olordered__ab__group__abs(A) ),
file('ANA012-2.p',unknown),
[] ).
cnf(8,axiom,
( ~ class_Ring__and__Field_Oordered__field(A)
| class_Orderings_Oorder(A) ),
file('ANA012-2.p',unknown),
[] ).
cnf(10,axiom,
class_Ring__and__Field_Oordered__field(t_a),
file('ANA012-2.p',unknown),
[] ).
cnf(11,plain,
class_Orderings_Oorder(t_a),
inference(hyper,[status(thm)],[10,8]),
[iquote('hyper,10,8')] ).
cnf(12,plain,
class_OrderedGroup_Olordered__ab__group__abs(t_a),
inference(hyper,[status(thm)],[10,7]),
[iquote('hyper,10,7')] ).
cnf(13,plain,
class_Ring__and__Field_Ofield(t_a),
inference(hyper,[status(thm)],[10,6]),
[iquote('hyper,10,6')] ).
cnf(16,plain,
c_lesse_quals(A,A,t_a),
inference(hyper,[status(thm)],[11,4]),
[iquote('hyper,11,4')] ).
cnf(21,plain,
( A = c_0
| c_times(c_HOL_Oinverse(A,t_a),A,t_a) = c_1 ),
inference(hyper,[status(thm)],[13,5]),
[iquote('hyper,13,5')] ).
cnf(128,plain,
c_HOL_Oabs(v_c,t_a) = c_0,
inference(unit_del,[status(thm)],[inference(para_from,[status(thm),theory(equality)],[21,2]),16]),
[iquote('para_from,21.2.1,2.1.2,unit_del,16')] ).
cnf(137,plain,
v_c = c_0,
inference(hyper,[status(thm)],[128,3,12]),
[iquote('hyper,128,3,12')] ).
cnf(139,plain,
$false,
inference(binary,[status(thm)],[137,1]),
[iquote('binary,137.1,1.1')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : ANA012-2 : TPTP v8.1.0. Released v3.2.0.
% 0.07/0.13 % Command : otter-tptp-script %s
% 0.12/0.33 % Computer : n009.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:58:21 EDT 2022
% 0.12/0.34 % CPUTime :
% 1.72/1.93 ----- Otter 3.3f, August 2004 -----
% 1.72/1.93 The process was started by sandbox on n009.cluster.edu,
% 1.72/1.93 Wed Jul 27 09:58:21 2022
% 1.72/1.93 The command was "./otter". The process ID is 7501.
% 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 [] v_c!=c_0.
% 1.72/1.93 0 [] -c_lesse_quals(c_1,c_times(V_U,c_HOL_Oabs(v_c,t_a),t_a),t_a).
% 1.72/1.93 0 [] class_Ring__and__Field_Oordered__field(t_a).
% 1.72/1.93 0 [] -class_OrderedGroup_Olordered__ab__group__abs(T_a)|c_HOL_Oabs(V_a,T_a)!=c_0|V_a=c_0.
% 1.72/1.93 0 [] -class_Orderings_Oorder(T_a)|c_lesse_quals(V_x,V_x,T_a).
% 1.72/1.93 0 [] -class_Ring__and__Field_Ofield(T_a)|V_a=c_0|c_times(c_HOL_Oinverse(V_a,T_a),V_a,T_a)=c_1.
% 1.72/1.93 0 [] -class_Ring__and__Field_Oordered__field(T)|class_Ring__and__Field_Ofield(T).
% 1.72/1.93 0 [] -class_Ring__and__Field_Oordered__field(T)|class_OrderedGroup_Olordered__ab__group__abs(T).
% 1.72/1.93 0 [] -class_Ring__and__Field_Oordered__field(T)|class_Orderings_Oorder(T).
% 1.72/1.93 end_of_list.
% 1.72/1.93
% 1.72/1.93 SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=3.
% 1.72/1.93
% 1.72/1.93 This ia a non-Horn set with equality. The strategy will be
% 1.72/1.93 Knuth-Bendix, ordered hyper_res, factoring, and unit
% 1.72/1.93 deletion, with positive clauses in sos and nonpositive
% 1.72/1.93 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: set(unit_deletion).
% 1.72/1.93 dependent: set(factor).
% 1.72/1.93
% 1.72/1.93 ------------> process usable:
% 1.72/1.93 ** KEPT (pick-wt=3): 1 [] v_c!=c_0.
% 1.72/1.93 ** KEPT (pick-wt=9): 2 [] -c_lesse_quals(c_1,c_times(A,c_HOL_Oabs(v_c,t_a),t_a),t_a).
% 1.72/1.93 ** KEPT (pick-wt=10): 3 [] -class_OrderedGroup_Olordered__ab__group__abs(A)|c_HOL_Oabs(B,A)!=c_0|B=c_0.
% 1.72/1.93 ** KEPT (pick-wt=6): 4 [] -class_Orderings_Oorder(A)|c_lesse_quals(B,B,A).
% 1.72/1.93 ** KEPT (pick-wt=13): 5 [] -class_Ring__and__Field_Ofield(A)|B=c_0|c_times(c_HOL_Oinverse(B,A),B,A)=c_1.
% 1.72/1.93 ** KEPT (pick-wt=4): 6 [] -class_Ring__and__Field_Oordered__field(A)|class_Ring__and__Field_Ofield(A).
% 1.72/1.93 ** KEPT (pick-wt=4): 7 [] -class_Ring__and__Field_Oordered__field(A)|class_OrderedGroup_Olordered__ab__group__abs(A).
% 1.72/1.93 ** KEPT (pick-wt=4): 8 [] -class_Ring__and__Field_Oordered__field(A)|class_Orderings_Oorder(A).
% 1.72/1.93
% 1.72/1.93 ------------> process sos:
% 1.72/1.93 ** KEPT (pick-wt=3): 9 [] A=A.
% 1.72/1.93 ** KEPT (pick-wt=2): 10 [] class_Ring__and__Field_Oordered__field(t_a).
% 1.72/1.93 Following clause subsumed by 9 during input processing: 0 [copy,9,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.01 sec ----> 139 [binary,137.1,1.1] $F.
% 1.72/1.93
% 1.72/1.93 Length of proof is 7. Level of proof is 4.
% 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 19
% 1.72/1.93 clauses generated 338
% 1.72/1.93 clauses kept 135
% 1.72/1.93 clauses forward subsumed 220
% 1.72/1.93 clauses back subsumed 1
% 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.01 (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 7501 finished Wed Jul 27 09:58:22 2022
% 1.72/1.93 Otter interrupted
% 1.72/1.93 PROOF FOUND
%------------------------------------------------------------------------------