TSTP Solution File: MSC017+1 by Otter---3.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : MSC017+1 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : otter-tptp-script %s
% Computer : n023.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 13:06:21 EDT 2022
% Result : Theorem 1.93s 2.14s
% Output : Refutation 1.93s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 8
% Syntax : Number of clauses : 14 ( 7 unt; 2 nHn; 14 RR)
% Number of literals : 27 ( 2 equ; 13 neg)
% Maximal clause size : 4 ( 1 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 6 con; 0-1 aty)
% Number of variables : 7 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(5,axiom,
( ~ dive(A)
| greater(depth(A),depth_limit)
| greater(time(A),time_limit)
| ~ greater(nitrogen(A),nitrogen_limit) ),
file('MSC017+1.p',unknown),
[] ).
cnf(7,axiom,
( ~ dive(A)
| greater(nitrogen(A),nitrogen_limit)
| ~ outcome(A,dci) ),
file('MSC017+1.p',unknown),
[] ).
cnf(8,axiom,
( ~ dive(A)
| ~ outcome(A,B)
| ~ bad(B)
| B = dci ),
file('MSC017+1.p',unknown),
[] ).
cnf(9,axiom,
( ~ dive(A)
| ~ greater(depth(A),depth_limit) ),
file('MSC017+1.p',unknown),
[] ).
cnf(10,axiom,
( ~ dive(A)
| ~ greater(time(A),time_limit) ),
file('MSC017+1.p',unknown),
[] ).
cnf(13,axiom,
dive(dollar_c2),
file('MSC017+1.p',unknown),
[] ).
cnf(14,axiom,
outcome(dollar_c2,dollar_c1),
file('MSC017+1.p',unknown),
[] ).
cnf(15,axiom,
bad(dollar_c1),
file('MSC017+1.p',unknown),
[] ).
cnf(20,plain,
dci = dollar_c1,
inference(flip,[status(thm),theory(equality)],[inference(hyper,[status(thm)],[14,8,13,15])]),
[iquote('hyper,14,8,13,15,flip.1')] ).
cnf(23,plain,
( ~ dive(A)
| greater(nitrogen(A),nitrogen_limit)
| ~ outcome(A,dollar_c1) ),
inference(demod,[status(thm),theory(equality)],[inference(back_demod,[status(thm)],[7]),20]),
[iquote('back_demod,7,demod,20')] ).
cnf(25,plain,
greater(nitrogen(dollar_c2),nitrogen_limit),
inference(hyper,[status(thm)],[23,13,14]),
[iquote('hyper,23,13,14')] ).
cnf(26,plain,
( greater(depth(dollar_c2),depth_limit)
| greater(time(dollar_c2),time_limit) ),
inference(hyper,[status(thm)],[25,5,13]),
[iquote('hyper,25,5,13')] ).
cnf(65,plain,
greater(time(dollar_c2),time_limit),
inference(hyper,[status(thm)],[26,9,13]),
[iquote('hyper,26,9,13')] ).
cnf(67,plain,
$false,
inference(hyper,[status(thm)],[65,10,13]),
[iquote('hyper,65,10,13')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.11 % Problem : MSC017+1 : TPTP v8.1.0. Released v4.0.0.
% 0.11/0.12 % Command : otter-tptp-script %s
% 0.12/0.33 % Computer : n023.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:20:48 EDT 2022
% 0.12/0.33 % CPUTime :
% 1.93/2.14 ----- Otter 3.3f, August 2004 -----
% 1.93/2.14 The process was started by sandbox on n023.cluster.edu,
% 1.93/2.14 Wed Jul 27 09:20:48 2022
% 1.93/2.14 The command was "./otter". The process ID is 3448.
% 1.93/2.14
% 1.93/2.14 set(prolog_style_variables).
% 1.93/2.14 set(auto).
% 1.93/2.14 dependent: set(auto1).
% 1.93/2.14 dependent: set(process_input).
% 1.93/2.14 dependent: clear(print_kept).
% 1.93/2.14 dependent: clear(print_new_demod).
% 1.93/2.14 dependent: clear(print_back_demod).
% 1.93/2.14 dependent: clear(print_back_sub).
% 1.93/2.14 dependent: set(control_memory).
% 1.93/2.14 dependent: assign(max_mem, 12000).
% 1.93/2.14 dependent: assign(pick_given_ratio, 4).
% 1.93/2.14 dependent: assign(stats_level, 1).
% 1.93/2.14 dependent: assign(max_seconds, 10800).
% 1.93/2.14 clear(print_given).
% 1.93/2.14
% 1.93/2.14 formula_list(usable).
% 1.93/2.14 all A (A=A).
% 1.93/2.14 all D (dive(D)->nitrogen(D)=padi(depth(D),time(D))).
% 1.93/2.14 all D (dive(D)-> (greater(depth(D),depth_limit)|greater(time(D),time_limit)<->greater(nitrogen(D),nitrogen_limit))).
% 1.93/2.14 all D (dive(D)-> (greater(nitrogen(D),nitrogen_limit)<->outcome(D,dci))).
% 1.93/2.14 bad(dci).
% 1.93/2.14 all D (dive(D)-> (all O (outcome(D,O)&bad(O)->O=dci))).
% 1.93/2.14 all D (dive(D)-> -greater(depth(D),depth_limit)& -greater(time(D),time_limit)).
% 1.93/2.14 -(all D (dive(D)-> (all O (outcome(D,O)-> -bad(O))))).
% 1.93/2.14 end_of_list.
% 1.93/2.14
% 1.93/2.14 -------> usable clausifies to:
% 1.93/2.14
% 1.93/2.14 list(usable).
% 1.93/2.14 0 [] A=A.
% 1.93/2.14 0 [] -dive(D)|nitrogen(D)=padi(depth(D),time(D)).
% 1.93/2.14 0 [] -dive(D)| -greater(depth(D),depth_limit)|greater(nitrogen(D),nitrogen_limit).
% 1.93/2.14 0 [] -dive(D)| -greater(time(D),time_limit)|greater(nitrogen(D),nitrogen_limit).
% 1.93/2.14 0 [] -dive(D)|greater(depth(D),depth_limit)|greater(time(D),time_limit)| -greater(nitrogen(D),nitrogen_limit).
% 1.93/2.14 0 [] -dive(D)| -greater(nitrogen(D),nitrogen_limit)|outcome(D,dci).
% 1.93/2.14 0 [] -dive(D)|greater(nitrogen(D),nitrogen_limit)| -outcome(D,dci).
% 1.93/2.14 0 [] bad(dci).
% 1.93/2.14 0 [] -dive(D)| -outcome(D,O)| -bad(O)|O=dci.
% 1.93/2.14 0 [] -dive(D)| -greater(depth(D),depth_limit).
% 1.93/2.14 0 [] -dive(D)| -greater(time(D),time_limit).
% 1.93/2.14 0 [] dive($c2).
% 1.93/2.14 0 [] outcome($c2,$c1).
% 1.93/2.14 0 [] bad($c1).
% 1.93/2.14 end_of_list.
% 1.93/2.14
% 1.93/2.14 SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=4.
% 1.93/2.14
% 1.93/2.14 This ia a non-Horn set with equality. The strategy will be
% 1.93/2.14 Knuth-Bendix, ordered hyper_res, factoring, and unit
% 1.93/2.14 deletion, with positive clauses in sos and nonpositive
% 1.93/2.14 clauses in usable.
% 1.93/2.14
% 1.93/2.14 dependent: set(knuth_bendix).
% 1.93/2.14 dependent: set(anl_eq).
% 1.93/2.14 dependent: set(para_from).
% 1.93/2.14 dependent: set(para_into).
% 1.93/2.14 dependent: clear(para_from_right).
% 1.93/2.14 dependent: clear(para_into_right).
% 1.93/2.14 dependent: set(para_from_vars).
% 1.93/2.14 dependent: set(eq_units_both_ways).
% 1.93/2.14 dependent: set(dynamic_demod_all).
% 1.93/2.14 dependent: set(dynamic_demod).
% 1.93/2.14 dependent: set(order_eq).
% 1.93/2.14 dependent: set(back_demod).
% 1.93/2.14 dependent: set(lrpo).
% 1.93/2.14 dependent: set(hyper_res).
% 1.93/2.14 dependent: set(unit_deletion).
% 1.93/2.14 dependent: set(factor).
% 1.93/2.14
% 1.93/2.14 ------------> process usable:
% 1.93/2.14 ** KEPT (pick-wt=10): 2 [copy,1,flip.2] -dive(A)|padi(depth(A),time(A))=nitrogen(A).
% 1.93/2.14 ** KEPT (pick-wt=10): 3 [] -dive(A)| -greater(depth(A),depth_limit)|greater(nitrogen(A),nitrogen_limit).
% 1.93/2.14 ** KEPT (pick-wt=10): 4 [] -dive(A)| -greater(time(A),time_limit)|greater(nitrogen(A),nitrogen_limit).
% 1.93/2.14 ** KEPT (pick-wt=14): 5 [] -dive(A)|greater(depth(A),depth_limit)|greater(time(A),time_limit)| -greater(nitrogen(A),nitrogen_limit).
% 1.93/2.14 ** KEPT (pick-wt=9): 6 [] -dive(A)| -greater(nitrogen(A),nitrogen_limit)|outcome(A,dci).
% 1.93/2.14 ** KEPT (pick-wt=9): 7 [] -dive(A)|greater(nitrogen(A),nitrogen_limit)| -outcome(A,dci).
% 1.93/2.14 ** KEPT (pick-wt=10): 8 [] -dive(A)| -outcome(A,B)| -bad(B)|B=dci.
% 1.93/2.14 ** KEPT (pick-wt=6): 9 [] -dive(A)| -greater(depth(A),depth_limit).
% 1.93/2.14 ** KEPT (pick-wt=6): 10 [] -dive(A)| -greater(time(A),time_limit).
% 1.93/2.14 9 back subsumes 3.
% 1.93/2.14 10 back subsumes 4.
% 1.93/2.14
% 1.93/2.14 ------------> process sos:
% 1.93/2.14 ** KEPT (pick-wt=3): 11 [] A=A.
% 1.93/2.14 ** KEPT (pick-wt=2): 12 [] bad(dci).
% 1.93/2.14 ** KEPT (pick-wt=2): 13 [] dive($c2).
% 1.93/2.14 ** KEPT (pick-wt=3): 14 [] outcome($c2,$c1).
% 1.93/2.14 ** KEPT (pick-wt=2): 15 [] bad($c1).
% 1.93/2.14 Following clause subsumed by 11 during input processing: 0 [copy,11,flip.1] A=A.
% 1.93/2.14
% 1.93/2.14 ======= end of input processing =======
% 1.93/2.14
% 1.93/2.14 =========== start of search ===========
% 1.93/2.14
% 1.93/2.14 -------- PROOF --------
% 1.93/2.14
% 1.93/2.14 -----> EMPTY CLAUSE at 0.00 sec ----> 67 [hyper,65,10,13] $F.
% 1.93/2.14
% 1.93/2.14 Length of proof is 5. Level of proof is 5.
% 1.93/2.14
% 1.93/2.14 ---------------- PROOF ----------------
% 1.93/2.14 % SZS status Theorem
% 1.93/2.14 % SZS output start Refutation
% See solution above
% 1.93/2.14 ------------ end of proof -------------
% 1.93/2.14
% 1.93/2.14
% 1.93/2.14 Search stopped by max_proofs option.
% 1.93/2.14
% 1.93/2.14
% 1.93/2.14 Search stopped by max_proofs option.
% 1.93/2.14
% 1.93/2.14 ============ end of search ============
% 1.93/2.14
% 1.93/2.14 -------------- statistics -------------
% 1.93/2.14 clauses given 13
% 1.93/2.14 clauses generated 64
% 1.93/2.14 clauses kept 63
% 1.93/2.14 clauses forward subsumed 20
% 1.93/2.14 clauses back subsumed 3
% 1.93/2.14 Kbytes malloced 976
% 1.93/2.14
% 1.93/2.14 ----------- times (seconds) -----------
% 1.93/2.14 user CPU time 0.00 (0 hr, 0 min, 0 sec)
% 1.93/2.14 system CPU time 0.00 (0 hr, 0 min, 0 sec)
% 1.93/2.14 wall-clock time 2 (0 hr, 0 min, 2 sec)
% 1.93/2.14
% 1.93/2.14 That finishes the proof of the theorem.
% 1.93/2.14
% 1.93/2.14 Process 3448 finished Wed Jul 27 09:20:50 2022
% 1.93/2.14 Otter interrupted
% 1.93/2.14 PROOF FOUND
%------------------------------------------------------------------------------