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