TSTP Solution File: ANA038-2 by Otter---3.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : ANA038-2 : TPTP v8.1.0. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : otter-tptp-script %s
% Computer : n014.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:47 EDT 2022
% Result : Unsatisfiable 1.72s 1.92s
% Output : Refutation 1.72s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 10
% Syntax : Number of clauses : 17 ( 11 unt; 0 nHn; 13 RR)
% Number of literals : 27 ( 0 equ; 11 neg)
% Maximal clause size : 4 ( 1 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 6 ( 5 usr; 1 prp; 0-3 aty)
% Number of functors : 10 ( 10 usr; 5 con; 0-3 aty)
% Number of variables : 19 ( 4 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
~ c_lesse_quals(c_HOL_Oabs(v_b(v_xa),t_b),c_times(c_Orderings_Omax(v_c,v_ca,t_b),v_g(v_xa),t_b),t_b),
file('ANA038-2.p',unknown),
[] ).
cnf(2,axiom,
( ~ class_Orderings_Olinorder(A)
| c_lesse_quals(B,c_Orderings_Omax(C,B,A),A) ),
file('ANA038-2.p',unknown),
[] ).
cnf(3,axiom,
( ~ class_Orderings_Oorder(A)
| ~ c_lesse_quals(B,C,A)
| ~ c_lesse_quals(D,B,A)
| c_lesse_quals(D,C,A) ),
file('ANA038-2.p',unknown),
[] ).
cnf(4,axiom,
( ~ class_Ring__and__Field_Opordered__semiring(A)
| ~ c_lesse_quals(B,C,A)
| ~ c_lesse_quals(c_0,D,A)
| c_lesse_quals(c_times(B,D,A),c_times(C,D,A),A) ),
file('ANA038-2.p',unknown),
[] ).
cnf(5,axiom,
( ~ class_Ring__and__Field_Oordered__idom(A)
| class_Orderings_Olinorder(A) ),
file('ANA038-2.p',unknown),
[] ).
cnf(6,axiom,
( ~ class_Ring__and__Field_Oordered__idom(A)
| class_Ring__and__Field_Opordered__semiring(A) ),
file('ANA038-2.p',unknown),
[] ).
cnf(7,axiom,
( ~ class_Ring__and__Field_Oordered__idom(A)
| class_Orderings_Oorder(A) ),
file('ANA038-2.p',unknown),
[] ).
cnf(8,axiom,
c_lesse_quals(c_0,v_g(v_xa),t_b),
file('ANA038-2.p',unknown),
[] ).
cnf(9,axiom,
c_lesse_quals(c_HOL_Oabs(v_b(v_xa),t_b),c_times(v_ca,v_g(v_xa),t_b),t_b),
file('ANA038-2.p',unknown),
[] ).
cnf(10,axiom,
class_Ring__and__Field_Oordered__idom(t_b),
file('ANA038-2.p',unknown),
[] ).
cnf(11,plain,
class_Orderings_Oorder(t_b),
inference(hyper,[status(thm)],[10,7]),
[iquote('hyper,10,7')] ).
cnf(12,plain,
class_Ring__and__Field_Opordered__semiring(t_b),
inference(hyper,[status(thm)],[10,6]),
[iquote('hyper,10,6')] ).
cnf(13,plain,
class_Orderings_Olinorder(t_b),
inference(hyper,[status(thm)],[10,5]),
[iquote('hyper,10,5')] ).
cnf(15,plain,
c_lesse_quals(A,c_Orderings_Omax(B,A,t_b),t_b),
inference(hyper,[status(thm)],[13,2]),
[iquote('hyper,13,2')] ).
cnf(20,plain,
c_lesse_quals(c_times(A,v_g(v_xa),t_b),c_times(c_Orderings_Omax(B,A,t_b),v_g(v_xa),t_b),t_b),
inference(hyper,[status(thm)],[15,4,12,8]),
[iquote('hyper,15,4,12,8')] ).
cnf(113,plain,
c_lesse_quals(c_HOL_Oabs(v_b(v_xa),t_b),c_times(c_Orderings_Omax(A,v_ca,t_b),v_g(v_xa),t_b),t_b),
inference(hyper,[status(thm)],[20,3,11,9]),
[iquote('hyper,20,3,11,9')] ).
cnf(114,plain,
$false,
inference(binary,[status(thm)],[113,1]),
[iquote('binary,113.1,1.1')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : ANA038-2 : TPTP v8.1.0. Released v3.2.0.
% 0.11/0.13 % Command : otter-tptp-script %s
% 0.13/0.34 % Computer : n014.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:24 EDT 2022
% 0.13/0.34 % CPUTime :
% 1.72/1.92 ----- Otter 3.3f, August 2004 -----
% 1.72/1.92 The process was started by sandbox on n014.cluster.edu,
% 1.72/1.92 Wed Jul 27 10:04:24 2022
% 1.72/1.92 The command was "./otter". The process ID is 18812.
% 1.72/1.92
% 1.72/1.92 set(prolog_style_variables).
% 1.72/1.92 set(auto).
% 1.72/1.92 dependent: set(auto1).
% 1.72/1.92 dependent: set(process_input).
% 1.72/1.92 dependent: clear(print_kept).
% 1.72/1.92 dependent: clear(print_new_demod).
% 1.72/1.92 dependent: clear(print_back_demod).
% 1.72/1.92 dependent: clear(print_back_sub).
% 1.72/1.92 dependent: set(control_memory).
% 1.72/1.92 dependent: assign(max_mem, 12000).
% 1.72/1.92 dependent: assign(pick_given_ratio, 4).
% 1.72/1.92 dependent: assign(stats_level, 1).
% 1.72/1.92 dependent: assign(max_seconds, 10800).
% 1.72/1.92 clear(print_given).
% 1.72/1.92
% 1.72/1.92 list(usable).
% 1.72/1.92 0 [] c_lesse_quals(c_0,v_g(v_xa),t_b).
% 1.72/1.92 0 [] c_lesse_quals(c_HOL_Oabs(v_b(v_xa),t_b),c_times(v_ca,v_g(v_xa),t_b),t_b).
% 1.72/1.92 0 [] -c_lesse_quals(c_HOL_Oabs(v_b(v_xa),t_b),c_times(c_Orderings_Omax(v_c,v_ca,t_b),v_g(v_xa),t_b),t_b).
% 1.72/1.92 0 [] class_Ring__and__Field_Oordered__idom(t_b).
% 1.72/1.92 0 [] -class_Orderings_Olinorder(T_b)|c_lesse_quals(V_y,c_Orderings_Omax(V_x,V_y,T_b),T_b).
% 1.72/1.92 0 [] -class_Orderings_Oorder(T_a)| -c_lesse_quals(V_y,V_z,T_a)| -c_lesse_quals(V_x,V_y,T_a)|c_lesse_quals(V_x,V_z,T_a).
% 1.72/1.92 0 [] -class_Ring__and__Field_Opordered__semiring(T_a)| -c_lesse_quals(V_a,V_b,T_a)| -c_lesse_quals(c_0,V_c,T_a)|c_lesse_quals(c_times(V_a,V_c,T_a),c_times(V_b,V_c,T_a),T_a).
% 1.72/1.92 0 [] -class_Ring__and__Field_Oordered__idom(T)|class_Orderings_Olinorder(T).
% 1.72/1.92 0 [] -class_Ring__and__Field_Oordered__idom(T)|class_Ring__and__Field_Opordered__semiring(T).
% 1.72/1.92 0 [] -class_Ring__and__Field_Oordered__idom(T)|class_Orderings_Oorder(T).
% 1.72/1.92 end_of_list.
% 1.72/1.92
% 1.72/1.92 SCAN INPUT: prop=0, horn=1, equality=0, symmetry=0, max_lits=4.
% 1.72/1.92
% 1.72/1.92 This is a Horn set without equality. The strategy will
% 1.72/1.92 be hyperresolution, with satellites in sos and nuclei
% 1.72/1.92 in usable.
% 1.72/1.92
% 1.72/1.92 dependent: set(hyper_res).
% 1.72/1.92 dependent: clear(order_hyper).
% 1.72/1.92
% 1.72/1.92 ------------> process usable:
% 1.72/1.92 ** KEPT (pick-wt=14): 1 [] -c_lesse_quals(c_HOL_Oabs(v_b(v_xa),t_b),c_times(c_Orderings_Omax(v_c,v_ca,t_b),v_g(v_xa),t_b),t_b).
% 1.72/1.92 ** KEPT (pick-wt=9): 2 [] -class_Orderings_Olinorder(A)|c_lesse_quals(B,c_Orderings_Omax(C,B,A),A).
% 1.72/1.92 ** KEPT (pick-wt=14): 3 [] -class_Orderings_Oorder(A)| -c_lesse_quals(B,C,A)| -c_lesse_quals(D,B,A)|c_lesse_quals(D,C,A).
% 1.72/1.92 ** KEPT (pick-wt=20): 4 [] -class_Ring__and__Field_Opordered__semiring(A)| -c_lesse_quals(B,C,A)| -c_lesse_quals(c_0,D,A)|c_lesse_quals(c_times(B,D,A),c_times(C,D,A),A).
% 1.72/1.92 ** KEPT (pick-wt=4): 5 [] -class_Ring__and__Field_Oordered__idom(A)|class_Orderings_Olinorder(A).
% 1.72/1.92 ** KEPT (pick-wt=4): 6 [] -class_Ring__and__Field_Oordered__idom(A)|class_Ring__and__Field_Opordered__semiring(A).
% 1.72/1.92 ** KEPT (pick-wt=4): 7 [] -class_Ring__and__Field_Oordered__idom(A)|class_Orderings_Oorder(A).
% 1.72/1.92
% 1.72/1.92 ------------> process sos:
% 1.72/1.92 ** KEPT (pick-wt=5): 8 [] c_lesse_quals(c_0,v_g(v_xa),t_b).
% 1.72/1.92 ** KEPT (pick-wt=11): 9 [] c_lesse_quals(c_HOL_Oabs(v_b(v_xa),t_b),c_times(v_ca,v_g(v_xa),t_b),t_b).
% 1.72/1.92 ** KEPT (pick-wt=2): 10 [] class_Ring__and__Field_Oordered__idom(t_b).
% 1.72/1.92
% 1.72/1.92 ======= end of input processing =======
% 1.72/1.92
% 1.72/1.92 =========== start of search ===========
% 1.72/1.92
% 1.72/1.92 -------- PROOF --------
% 1.72/1.92
% 1.72/1.92 ----> UNIT CONFLICT at 0.00 sec ----> 114 [binary,113.1,1.1] $F.
% 1.72/1.92
% 1.72/1.92 Length of proof is 6. Level of proof is 4.
% 1.72/1.92
% 1.72/1.92 ---------------- PROOF ----------------
% 1.72/1.92 % SZS status Unsatisfiable
% 1.72/1.92 % SZS output start Refutation
% See solution above
% 1.72/1.92 ------------ end of proof -------------
% 1.72/1.92
% 1.72/1.92
% 1.72/1.92 Search stopped by max_proofs option.
% 1.72/1.92
% 1.72/1.92
% 1.72/1.92 Search stopped by max_proofs option.
% 1.72/1.92
% 1.72/1.92 ============ end of search ============
% 1.72/1.92
% 1.72/1.92 -------------- statistics -------------
% 1.72/1.92 clauses given 15
% 1.72/1.92 clauses generated 127
% 1.72/1.92 clauses kept 113
% 1.72/1.92 clauses forward subsumed 24
% 1.72/1.92 clauses back subsumed 0
% 1.72/1.92 Kbytes malloced 976
% 1.72/1.92
% 1.72/1.92 ----------- times (seconds) -----------
% 1.72/1.92 user CPU time 0.00 (0 hr, 0 min, 0 sec)
% 1.72/1.92 system CPU time 0.00 (0 hr, 0 min, 0 sec)
% 1.72/1.92 wall-clock time 1 (0 hr, 0 min, 1 sec)
% 1.72/1.92
% 1.72/1.92 That finishes the proof of the theorem.
% 1.72/1.92
% 1.72/1.92 Process 18812 finished Wed Jul 27 10:04:25 2022
% 1.72/1.92 Otter interrupted
% 1.72/1.92 PROOF FOUND
%------------------------------------------------------------------------------