TSTP Solution File: ANA021-2 by Otter---3.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : ANA021-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:44 EDT 2022
% Result : Unsatisfiable 1.73s 1.91s
% Output : Refutation 1.73s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 5
% Syntax : Number of clauses : 10 ( 7 unt; 1 nHn; 8 RR)
% Number of literals : 13 ( 5 equ; 4 neg)
% Maximal clause size : 2 ( 1 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-3 aty)
% Number of functors : 12 ( 12 usr; 6 con; 0-3 aty)
% Number of variables : 4 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
( ~ c_less(c_0,A,tc_nat)
| A = c_Suc(c_minus(A,c_1,tc_nat)) ),
file('ANA021-2.p',unknown),
[] ).
cnf(2,plain,
( ~ c_less(c_0,A,tc_nat)
| c_Suc(c_minus(A,c_1,tc_nat)) = A ),
inference(flip,[status(thm),theory(equality)],[inference(copy,[status(thm)],[1])]),
[iquote('copy,1,flip.2')] ).
cnf(3,axiom,
v_x != c_0,
file('ANA021-2.p',unknown),
[] ).
cnf(4,axiom,
~ c_lesse_quals(c_HOL_Oabs(v_f(v_x),t_a),c_times(v_c,c_HOL_Oabs(v_h(v_x),t_a),t_a),t_a),
file('ANA021-2.p',unknown),
[] ).
cnf(6,axiom,
( c_less(c_0,A,tc_nat)
| A = c_0 ),
file('ANA021-2.p',unknown),
[] ).
cnf(7,axiom,
c_lesse_quals(c_HOL_Oabs(v_f(c_Suc(A)),t_a),c_times(v_c,c_HOL_Oabs(v_h(c_Suc(A)),t_a),t_a),t_a),
file('ANA021-2.p',unknown),
[] ).
cnf(8,plain,
c_less(c_0,v_x,tc_nat),
inference(hyper,[status(thm)],[6,3]),
[iquote('hyper,6,3')] ).
cnf(26,plain,
c_Suc(c_minus(v_x,c_1,tc_nat)) = v_x,
inference(hyper,[status(thm)],[8,2]),
[iquote('hyper,8,2')] ).
cnf(32,plain,
c_lesse_quals(c_HOL_Oabs(v_f(v_x),t_a),c_times(v_c,c_HOL_Oabs(v_h(v_x),t_a),t_a),t_a),
inference(demod,[status(thm),theory(equality)],[inference(para_into,[status(thm),theory(equality)],[7,26]),26]),
[iquote('para_into,7.1.1.1.1,25.1.1,demod,26')] ).
cnf(33,plain,
$false,
inference(binary,[status(thm)],[32,4]),
[iquote('binary,32.1,4.1')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : ANA021-2 : TPTP v8.1.0. Released v3.2.0.
% 0.07/0.12 % Command : otter-tptp-script %s
% 0.13/0.33 % Computer : n014.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % WCLimit : 300
% 0.13/0.33 % DateTime : Wed Jul 27 10:01:39 EDT 2022
% 0.13/0.33 % CPUTime :
% 1.73/1.91 ----- Otter 3.3f, August 2004 -----
% 1.73/1.91 The process was started by sandbox2 on n014.cluster.edu,
% 1.73/1.91 Wed Jul 27 10:01:39 2022
% 1.73/1.91 The command was "./otter". The process ID is 16092.
% 1.73/1.91
% 1.73/1.91 set(prolog_style_variables).
% 1.73/1.91 set(auto).
% 1.73/1.91 dependent: set(auto1).
% 1.73/1.91 dependent: set(process_input).
% 1.73/1.91 dependent: clear(print_kept).
% 1.73/1.91 dependent: clear(print_new_demod).
% 1.73/1.91 dependent: clear(print_back_demod).
% 1.73/1.91 dependent: clear(print_back_sub).
% 1.73/1.91 dependent: set(control_memory).
% 1.73/1.91 dependent: assign(max_mem, 12000).
% 1.73/1.91 dependent: assign(pick_given_ratio, 4).
% 1.73/1.91 dependent: assign(stats_level, 1).
% 1.73/1.91 dependent: assign(max_seconds, 10800).
% 1.73/1.91 clear(print_given).
% 1.73/1.91
% 1.73/1.91 list(usable).
% 1.73/1.91 0 [] A=A.
% 1.73/1.91 0 [] -c_less(c_0,V_x,tc_nat)|V_x=c_Suc(c_minus(V_x,c_1,tc_nat)).
% 1.73/1.91 0 [] c_less(c_0,V_n,tc_nat)|V_n=c_0.
% 1.73/1.91 0 [] c_lesse_quals(c_HOL_Oabs(v_f(c_Suc(V_U)),t_a),c_times(v_c,c_HOL_Oabs(v_h(c_Suc(V_U)),t_a),t_a),t_a).
% 1.73/1.91 0 [] v_x!=c_0.
% 1.73/1.91 0 [] -c_lesse_quals(c_HOL_Oabs(v_f(v_x),t_a),c_times(v_c,c_HOL_Oabs(v_h(v_x),t_a),t_a),t_a).
% 1.73/1.91 end_of_list.
% 1.73/1.91
% 1.73/1.91 SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=2.
% 1.73/1.91
% 1.73/1.91 This ia a non-Horn set with equality. The strategy will be
% 1.73/1.91 Knuth-Bendix, ordered hyper_res, factoring, and unit
% 1.73/1.91 deletion, with positive clauses in sos and nonpositive
% 1.73/1.91 clauses in usable.
% 1.73/1.91
% 1.73/1.91 dependent: set(knuth_bendix).
% 1.73/1.91 dependent: set(anl_eq).
% 1.73/1.91 dependent: set(para_from).
% 1.73/1.91 dependent: set(para_into).
% 1.73/1.91 dependent: clear(para_from_right).
% 1.73/1.91 dependent: clear(para_into_right).
% 1.73/1.91 dependent: set(para_from_vars).
% 1.73/1.91 dependent: set(eq_units_both_ways).
% 1.73/1.91 dependent: set(dynamic_demod_all).
% 1.73/1.91 dependent: set(dynamic_demod).
% 1.73/1.91 dependent: set(order_eq).
% 1.73/1.91 dependent: set(back_demod).
% 1.73/1.91 dependent: set(lrpo).
% 1.73/1.91 dependent: set(hyper_res).
% 1.73/1.91 dependent: set(unit_deletion).
% 1.73/1.91 dependent: set(factor).
% 1.73/1.91
% 1.73/1.91 ------------> process usable:
% 1.73/1.91 ** KEPT (pick-wt=11): 2 [copy,1,flip.2] -c_less(c_0,A,tc_nat)|c_Suc(c_minus(A,c_1,tc_nat))=A.
% 1.73/1.91 ** KEPT (pick-wt=3): 3 [] v_x!=c_0.
% 1.73/1.91 ** KEPT (pick-wt=13): 4 [] -c_lesse_quals(c_HOL_Oabs(v_f(v_x),t_a),c_times(v_c,c_HOL_Oabs(v_h(v_x),t_a),t_a),t_a).
% 1.73/1.91
% 1.73/1.91 ------------> process sos:
% 1.73/1.91 ** KEPT (pick-wt=3): 5 [] A=A.
% 1.73/1.91 ** KEPT (pick-wt=7): 6 [] c_less(c_0,A,tc_nat)|A=c_0.
% 1.73/1.91 ** KEPT (pick-wt=15): 7 [] c_lesse_quals(c_HOL_Oabs(v_f(c_Suc(A)),t_a),c_times(v_c,c_HOL_Oabs(v_h(c_Suc(A)),t_a),t_a),t_a).
% 1.73/1.91 Following clause subsumed by 5 during input processing: 0 [copy,5,flip.1] A=A.
% 1.73/1.91
% 1.73/1.91 ======= end of input processing =======
% 1.73/1.91
% 1.73/1.91 =========== start of search ===========
% 1.73/1.91
% 1.73/1.91 -------- PROOF --------
% 1.73/1.91
% 1.73/1.91 ----> UNIT CONFLICT at 0.00 sec ----> 33 [binary,32.1,4.1] $F.
% 1.73/1.91
% 1.73/1.91 Length of proof is 4. Level of proof is 3.
% 1.73/1.91
% 1.73/1.91 ---------------- PROOF ----------------
% 1.73/1.91 % SZS status Unsatisfiable
% 1.73/1.91 % SZS output start Refutation
% See solution above
% 1.73/1.91 ------------ end of proof -------------
% 1.73/1.91
% 1.73/1.91
% 1.73/1.91 Search stopped by max_proofs option.
% 1.73/1.91
% 1.73/1.91
% 1.73/1.91 Search stopped by max_proofs option.
% 1.73/1.91
% 1.73/1.91 ============ end of search ============
% 1.73/1.91
% 1.73/1.91 -------------- statistics -------------
% 1.73/1.91 clauses given 6
% 1.73/1.91 clauses generated 45
% 1.73/1.91 clauses kept 30
% 1.73/1.91 clauses forward subsumed 22
% 1.73/1.91 clauses back subsumed 0
% 1.73/1.91 Kbytes malloced 976
% 1.73/1.91
% 1.73/1.91 ----------- times (seconds) -----------
% 1.73/1.91 user CPU time 0.00 (0 hr, 0 min, 0 sec)
% 1.73/1.91 system CPU time 0.00 (0 hr, 0 min, 0 sec)
% 1.73/1.91 wall-clock time 1 (0 hr, 0 min, 1 sec)
% 1.73/1.91
% 1.73/1.91 That finishes the proof of the theorem.
% 1.73/1.91
% 1.73/1.91 Process 16092 finished Wed Jul 27 10:01:40 2022
% 1.73/1.91 Otter interrupted
% 1.73/1.91 PROOF FOUND
%------------------------------------------------------------------------------