TSTP Solution File: ANA044-2 by Otter---3.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : ANA044-2 : TPTP v8.1.0. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : otter-tptp-script %s
% Computer : n018.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:48 EDT 2022
% Result : Unsatisfiable 1.58s 1.78s
% Output : Refutation 1.58s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 8
% Syntax : Number of clauses : 14 ( 10 unt; 0 nHn; 10 RR)
% Number of literals : 21 ( 4 equ; 9 neg)
% Maximal clause size : 4 ( 1 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-3 aty)
% Number of functors : 9 ( 9 usr; 4 con; 0-3 aty)
% Number of variables : 16 ( 6 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
c_times(v_l(v_x,v_xa),v_h(v_k(v_x,v_xa)),t_b) != c_HOL_Oabs(c_times(v_l(v_x,v_xa),v_h(v_k(v_x,v_xa)),t_b),t_b),
file('ANA044-2.p',unknown),
[] ).
cnf(2,plain,
c_HOL_Oabs(c_times(v_l(v_x,v_xa),v_h(v_k(v_x,v_xa)),t_b),t_b) != c_times(v_l(v_x,v_xa),v_h(v_k(v_x,v_xa)),t_b),
inference(flip,[status(thm),theory(equality)],[inference(copy,[status(thm)],[1])]),
[iquote('copy,1,flip.1')] ).
cnf(3,axiom,
( ~ class_OrderedGroup_Olordered__ab__group__abs(A)
| ~ c_lesse_quals(c_0,B,A)
| c_HOL_Oabs(B,A) = B ),
file('ANA044-2.p',unknown),
[] ).
cnf(4,axiom,
( ~ class_Ring__and__Field_Opordered__cancel__semiring(A)
| ~ c_lesse_quals(c_0,B,A)
| ~ c_lesse_quals(c_0,C,A)
| c_lesse_quals(c_0,c_times(C,B,A),A) ),
file('ANA044-2.p',unknown),
[] ).
cnf(5,axiom,
( ~ class_Ring__and__Field_Oordered__idom(A)
| class_Ring__and__Field_Opordered__cancel__semiring(A) ),
file('ANA044-2.p',unknown),
[] ).
cnf(6,axiom,
( ~ class_Ring__and__Field_Oordered__idom(A)
| class_OrderedGroup_Olordered__ab__group__abs(A) ),
file('ANA044-2.p',unknown),
[] ).
cnf(8,axiom,
c_lesse_quals(c_0,v_l(A,B),t_b),
file('ANA044-2.p',unknown),
[] ).
cnf(9,axiom,
c_lesse_quals(c_0,v_h(A),t_b),
file('ANA044-2.p',unknown),
[] ).
cnf(10,axiom,
class_Ring__and__Field_Oordered__idom(t_b),
file('ANA044-2.p',unknown),
[] ).
cnf(11,plain,
class_OrderedGroup_Olordered__ab__group__abs(t_b),
inference(hyper,[status(thm)],[10,6]),
[iquote('hyper,10,6')] ).
cnf(12,plain,
class_Ring__and__Field_Opordered__cancel__semiring(t_b),
inference(hyper,[status(thm)],[10,5]),
[iquote('hyper,10,5')] ).
cnf(16,plain,
c_lesse_quals(c_0,c_times(v_l(A,B),v_h(C),t_b),t_b),
inference(hyper,[status(thm)],[8,4,12,9]),
[iquote('hyper,8,4,12,9')] ).
cnf(35,plain,
c_HOL_Oabs(c_times(v_l(A,B),v_h(C),t_b),t_b) = c_times(v_l(A,B),v_h(C),t_b),
inference(hyper,[status(thm)],[16,3,11]),
[iquote('hyper,16,3,11')] ).
cnf(37,plain,
$false,
inference(binary,[status(thm)],[35,2]),
[iquote('binary,35.1,2.1')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : ANA044-2 : TPTP v8.1.0. Released v3.2.0.
% 0.11/0.13 % Command : otter-tptp-script %s
% 0.12/0.34 % Computer : n018.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 300
% 0.12/0.34 % DateTime : Wed Jul 27 10:06:01 EDT 2022
% 0.12/0.34 % CPUTime :
% 1.58/1.78 ----- Otter 3.3f, August 2004 -----
% 1.58/1.78 The process was started by sandbox2 on n018.cluster.edu,
% 1.58/1.78 Wed Jul 27 10:06:01 2022
% 1.58/1.78 The command was "./otter". The process ID is 18077.
% 1.58/1.78
% 1.58/1.78 set(prolog_style_variables).
% 1.58/1.78 set(auto).
% 1.58/1.78 dependent: set(auto1).
% 1.58/1.78 dependent: set(process_input).
% 1.58/1.78 dependent: clear(print_kept).
% 1.58/1.78 dependent: clear(print_new_demod).
% 1.58/1.78 dependent: clear(print_back_demod).
% 1.58/1.78 dependent: clear(print_back_sub).
% 1.58/1.78 dependent: set(control_memory).
% 1.58/1.78 dependent: assign(max_mem, 12000).
% 1.58/1.78 dependent: assign(pick_given_ratio, 4).
% 1.58/1.78 dependent: assign(stats_level, 1).
% 1.58/1.78 dependent: assign(max_seconds, 10800).
% 1.58/1.78 clear(print_given).
% 1.58/1.78
% 1.58/1.78 list(usable).
% 1.58/1.78 0 [] A=A.
% 1.58/1.78 0 [] c_lesse_quals(c_0,v_l(V_U,V_V),t_b).
% 1.58/1.78 0 [] c_lesse_quals(c_0,v_h(V_U),t_b).
% 1.58/1.78 0 [] c_times(v_l(v_x,v_xa),v_h(v_k(v_x,v_xa)),t_b)!=c_HOL_Oabs(c_times(v_l(v_x,v_xa),v_h(v_k(v_x,v_xa)),t_b),t_b).
% 1.58/1.78 0 [] class_Ring__and__Field_Oordered__idom(t_b).
% 1.58/1.78 0 [] -class_OrderedGroup_Olordered__ab__group__abs(T_a)| -c_lesse_quals(c_0,V_y,T_a)|c_HOL_Oabs(V_y,T_a)=V_y.
% 1.58/1.78 0 [] -class_Ring__and__Field_Opordered__cancel__semiring(T_a)| -c_lesse_quals(c_0,V_b,T_a)| -c_lesse_quals(c_0,V_a,T_a)|c_lesse_quals(c_0,c_times(V_a,V_b,T_a),T_a).
% 1.58/1.78 0 [] -class_Ring__and__Field_Oordered__idom(T)|class_Ring__and__Field_Opordered__cancel__semiring(T).
% 1.58/1.78 0 [] -class_Ring__and__Field_Oordered__idom(T)|class_OrderedGroup_Olordered__ab__group__abs(T).
% 1.58/1.78 end_of_list.
% 1.58/1.78
% 1.58/1.78 SCAN INPUT: prop=0, horn=1, equality=1, symmetry=0, max_lits=4.
% 1.58/1.78
% 1.58/1.78 This is a Horn set with equality. The strategy will be
% 1.58/1.78 Knuth-Bendix and hyper_res, with positive clauses in
% 1.58/1.78 sos and nonpositive clauses in usable.
% 1.58/1.78
% 1.58/1.78 dependent: set(knuth_bendix).
% 1.58/1.78 dependent: set(anl_eq).
% 1.58/1.78 dependent: set(para_from).
% 1.58/1.78 dependent: set(para_into).
% 1.58/1.78 dependent: clear(para_from_right).
% 1.58/1.78 dependent: clear(para_into_right).
% 1.58/1.78 dependent: set(para_from_vars).
% 1.58/1.78 dependent: set(eq_units_both_ways).
% 1.58/1.78 dependent: set(dynamic_demod_all).
% 1.58/1.78 dependent: set(dynamic_demod).
% 1.58/1.78 dependent: set(order_eq).
% 1.58/1.78 dependent: set(back_demod).
% 1.58/1.78 dependent: set(lrpo).
% 1.58/1.78 dependent: set(hyper_res).
% 1.58/1.78 dependent: clear(order_hyper).
% 1.58/1.78
% 1.58/1.78 ------------> process usable:
% 1.58/1.78 ** KEPT (pick-wt=21): 2 [copy,1,flip.1] c_HOL_Oabs(c_times(v_l(v_x,v_xa),v_h(v_k(v_x,v_xa)),t_b),t_b)!=c_times(v_l(v_x,v_xa),v_h(v_k(v_x,v_xa)),t_b).
% 1.58/1.78 ** KEPT (pick-wt=11): 3 [] -class_OrderedGroup_Olordered__ab__group__abs(A)| -c_lesse_quals(c_0,B,A)|c_HOL_Oabs(B,A)=B.
% 1.58/1.78 ** KEPT (pick-wt=17): 4 [] -class_Ring__and__Field_Opordered__cancel__semiring(A)| -c_lesse_quals(c_0,B,A)| -c_lesse_quals(c_0,C,A)|c_lesse_quals(c_0,c_times(C,B,A),A).
% 1.58/1.78 ** KEPT (pick-wt=4): 5 [] -class_Ring__and__Field_Oordered__idom(A)|class_Ring__and__Field_Opordered__cancel__semiring(A).
% 1.58/1.78 ** KEPT (pick-wt=4): 6 [] -class_Ring__and__Field_Oordered__idom(A)|class_OrderedGroup_Olordered__ab__group__abs(A).
% 1.58/1.78
% 1.58/1.78 ------------> process sos:
% 1.58/1.78 ** KEPT (pick-wt=3): 7 [] A=A.
% 1.58/1.78 ** KEPT (pick-wt=6): 8 [] c_lesse_quals(c_0,v_l(A,B),t_b).
% 1.58/1.78 ** KEPT (pick-wt=5): 9 [] c_lesse_quals(c_0,v_h(A),t_b).
% 1.58/1.78 ** KEPT (pick-wt=2): 10 [] class_Ring__and__Field_Oordered__idom(t_b).
% 1.58/1.78 Following clause subsumed by 7 during input processing: 0 [copy,7,flip.1] A=A.
% 1.58/1.78
% 1.58/1.78 ======= end of input processing =======
% 1.58/1.78
% 1.58/1.78 =========== start of search ===========
% 1.58/1.78
% 1.58/1.78 -------- PROOF --------
% 1.58/1.78
% 1.58/1.78 ----> UNIT CONFLICT at 0.00 sec ----> 37 [binary,35.1,2.1] $F.
% 1.58/1.78
% 1.58/1.78 Length of proof is 5. Level of proof is 3.
% 1.58/1.78
% 1.58/1.78 ---------------- PROOF ----------------
% 1.58/1.78 % SZS status Unsatisfiable
% 1.58/1.78 % SZS output start Refutation
% See solution above
% 1.58/1.78 ------------ end of proof -------------
% 1.58/1.78
% 1.58/1.78
% 1.58/1.78 Search stopped by max_proofs option.
% 1.58/1.78
% 1.58/1.78
% 1.58/1.78 Search stopped by max_proofs option.
% 1.58/1.78
% 1.58/1.78 ============ end of search ============
% 1.58/1.78
% 1.58/1.78 -------------- statistics -------------
% 1.58/1.78 clauses given 10
% 1.58/1.78 clauses generated 34
% 1.58/1.78 clauses kept 31
% 1.58/1.78 clauses forward subsumed 13
% 1.58/1.78 clauses back subsumed 0
% 1.58/1.78 Kbytes malloced 976
% 1.58/1.78
% 1.58/1.78 ----------- times (seconds) -----------
% 1.58/1.78 user CPU time 0.00 (0 hr, 0 min, 0 sec)
% 1.58/1.78 system CPU time 0.00 (0 hr, 0 min, 0 sec)
% 1.58/1.78 wall-clock time 2 (0 hr, 0 min, 2 sec)
% 1.58/1.78
% 1.58/1.78 That finishes the proof of the theorem.
% 1.58/1.78
% 1.58/1.78 Process 18077 finished Wed Jul 27 10:06:03 2022
% 1.58/1.78 Otter interrupted
% 1.58/1.78 PROOF FOUND
%------------------------------------------------------------------------------