TSTP Solution File: MSC012+1 by Otter---3.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : MSC012+1 : TPTP v8.1.0. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : otter-tptp-script %s
% Computer : n025.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:19 EDT 2022
% Result : Theorem 2.25s 2.39s
% Output : Refutation 2.25s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 6
% Syntax : Number of clauses : 14 ( 7 unt; 5 nHn; 5 RR)
% Number of literals : 24 ( 0 equ; 6 neg)
% Maximal clause size : 4 ( 1 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 2 prp; 0-2 aty)
% Number of functors : 2 ( 2 usr; 0 con; 1-1 aty)
% Number of variables : 14 ( 1 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
( ~ p(A)
| ~ less(A,B)
| ~ p(B)
| goal ),
file('MSC012+1.p',unknown),
[] ).
cnf(2,axiom,
( ~ less(A,B)
| ~ less(B,C)
| less(A,C) ),
file('MSC012+1.p',unknown),
[] ).
cnf(3,axiom,
~ goal,
file('MSC012+1.p',unknown),
[] ).
cnf(5,axiom,
( p(A)
| less(A,dollar_f1(A)) ),
file('MSC012+1.p',unknown),
[] ).
cnf(6,axiom,
( p(A)
| p(dollar_f1(A)) ),
file('MSC012+1.p',unknown),
[] ).
cnf(7,axiom,
less(A,dollar_f2(A)),
file('MSC012+1.p',unknown),
[] ).
cnf(9,plain,
( less(A,dollar_f1(A))
| less(dollar_f2(A),dollar_f1(dollar_f2(A))) ),
inference(unit_del,[status(thm)],[inference(hyper,[status(thm)],[7,1,5,5]),3]),
[iquote('hyper,7,1,5,5,unit_del,3')] ).
cnf(12,plain,
( p(dollar_f1(dollar_f2(A)))
| less(A,dollar_f1(A)) ),
inference(unit_del,[status(thm)],[inference(hyper,[status(thm)],[6,1,5,7]),3]),
[iquote('hyper,6,1,5,7,unit_del,3')] ).
cnf(41,plain,
( less(A,dollar_f1(A))
| less(A,dollar_f1(dollar_f2(A))) ),
inference(hyper,[status(thm)],[9,2,7]),
[iquote('hyper,9,2,7')] ).
cnf(881,plain,
less(A,dollar_f1(A)),
inference(factor_simp,[status(thm)],[inference(factor_simp,[status(thm)],[inference(unit_del,[status(thm)],[inference(hyper,[status(thm)],[41,1,5,12]),3])])]),
[iquote('hyper,41,1,5,12,unit_del,3,factor_simp,factor_simp')] ).
cnf(1025,plain,
less(A,dollar_f1(dollar_f1(A))),
inference(hyper,[status(thm)],[881,2,881]),
[iquote('hyper,881,2,881')] ).
cnf(1196,plain,
p(dollar_f1(A)),
inference(factor_simp,[status(thm)],[inference(unit_del,[status(thm)],[inference(hyper,[status(thm)],[1025,1,6,6]),3])]),
[iquote('hyper,1025,1,6,6,unit_del,3,factor_simp')] ).
cnf(1197,plain,
goal,
inference(hyper,[status(thm)],[1196,1,1196,1025]),
[iquote('hyper,1196,1,1196,1025')] ).
cnf(1198,plain,
$false,
inference(binary,[status(thm)],[1197,3]),
[iquote('binary,1197.1,3.1')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : MSC012+1 : TPTP v8.1.0. Released v3.2.0.
% 0.07/0.13 % Command : otter-tptp-script %s
% 0.14/0.34 % Computer : n025.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 300
% 0.14/0.34 % DateTime : Wed Jul 27 09:08:45 EDT 2022
% 0.14/0.34 % CPUTime :
% 2.25/2.39 ----- Otter 3.3f, August 2004 -----
% 2.25/2.39 The process was started by sandbox on n025.cluster.edu,
% 2.25/2.39 Wed Jul 27 09:08:45 2022
% 2.25/2.39 The command was "./otter". The process ID is 25839.
% 2.25/2.39
% 2.25/2.39 set(prolog_style_variables).
% 2.25/2.39 set(auto).
% 2.25/2.39 dependent: set(auto1).
% 2.25/2.39 dependent: set(process_input).
% 2.25/2.39 dependent: clear(print_kept).
% 2.25/2.39 dependent: clear(print_new_demod).
% 2.25/2.39 dependent: clear(print_back_demod).
% 2.25/2.39 dependent: clear(print_back_sub).
% 2.25/2.39 dependent: set(control_memory).
% 2.25/2.39 dependent: assign(max_mem, 12000).
% 2.25/2.39 dependent: assign(pick_given_ratio, 4).
% 2.25/2.39 dependent: assign(stats_level, 1).
% 2.25/2.39 dependent: assign(max_seconds, 10800).
% 2.25/2.39 clear(print_given).
% 2.25/2.39
% 2.25/2.39 formula_list(usable).
% 2.25/2.39 all A B (p(A)&less(A,B)&p(B)->goal).
% 2.25/2.39 all A (p(A)| (exists B (less(A,B)&p(B)))).
% 2.25/2.39 all A B C (less(A,B)&less(B,C)->less(A,C)).
% 2.25/2.39 all A exists B less(A,B).
% 2.25/2.39 -goal.
% 2.25/2.39 end_of_list.
% 2.25/2.39
% 2.25/2.39 -------> usable clausifies to:
% 2.25/2.39
% 2.25/2.39 list(usable).
% 2.25/2.39 0 [] -p(A)| -less(A,B)| -p(B)|goal.
% 2.25/2.39 0 [] p(A)|less(A,$f1(A)).
% 2.25/2.39 0 [] p(A)|p($f1(A)).
% 2.25/2.39 0 [] -less(A,B)| -less(B,C)|less(A,C).
% 2.25/2.39 0 [] less(A,$f2(A)).
% 2.25/2.39 0 [] -goal.
% 2.25/2.39 end_of_list.
% 2.25/2.39
% 2.25/2.39 SCAN INPUT: prop=0, horn=0, equality=0, symmetry=0, max_lits=4.
% 2.25/2.39
% 2.25/2.39 This is a non-Horn set without equality. The strategy will
% 2.25/2.39 be ordered hyper_res, unit deletion, and factoring, with
% 2.25/2.39 satellites in sos and with nuclei in usable.
% 2.25/2.39
% 2.25/2.39 dependent: set(hyper_res).
% 2.25/2.39 dependent: set(factor).
% 2.25/2.39 dependent: set(unit_deletion).
% 2.25/2.39
% 2.25/2.39 ------------> process usable:
% 2.25/2.39 ** KEPT (pick-wt=8): 1 [] -p(A)| -less(A,B)| -p(B)|goal.
% 2.25/2.39 ** KEPT (pick-wt=9): 2 [] -less(A,B)| -less(B,C)|less(A,C).
% 2.25/2.39 ** KEPT (pick-wt=1): 3 [] -goal.
% 2.25/2.39
% 2.25/2.39 ------------> process sos:
% 2.25/2.39 ** KEPT (pick-wt=6): 5 [] p(A)|less(A,$f1(A)).
% 2.25/2.39 ** KEPT (pick-wt=5): 6 [] p(A)|p($f1(A)).
% 2.25/2.39 ** KEPT (pick-wt=4): 7 [] less(A,$f2(A)).
% 2.25/2.39
% 2.25/2.39 ======= end of input processing =======
% 2.25/2.39
% 2.25/2.39 =========== start of search ===========
% 2.25/2.39
% 2.25/2.39 -------- PROOF --------
% 2.25/2.39
% 2.25/2.39 ----> UNIT CONFLICT at 0.22 sec ----> 1198 [binary,1197.1,3.1] $F.
% 2.25/2.39
% 2.25/2.39 Length of proof is 7. Level of proof is 6.
% 2.25/2.39
% 2.25/2.39 ---------------- PROOF ----------------
% 2.25/2.39 % SZS status Theorem
% 2.25/2.39 % SZS output start Refutation
% See solution above
% 2.25/2.39 ------------ end of proof -------------
% 2.25/2.39
% 2.25/2.39
% 2.25/2.39 Search stopped by max_proofs option.
% 2.25/2.39
% 2.25/2.39
% 2.25/2.39 Search stopped by max_proofs option.
% 2.25/2.39
% 2.25/2.39 ============ end of search ============
% 2.25/2.39
% 2.25/2.39 -------------- statistics -------------
% 2.25/2.39 clauses given 24
% 2.25/2.39 clauses generated 2285
% 2.25/2.39 clauses kept 1197
% 2.25/2.39 clauses forward subsumed 1093
% 2.25/2.39 clauses back subsumed 1151
% 2.25/2.39 Kbytes malloced 1953
% 2.25/2.39
% 2.25/2.39 ----------- times (seconds) -----------
% 2.25/2.39 user CPU time 0.22 (0 hr, 0 min, 0 sec)
% 2.25/2.39 system CPU time 0.00 (0 hr, 0 min, 0 sec)
% 2.25/2.39 wall-clock time 2 (0 hr, 0 min, 2 sec)
% 2.25/2.39
% 2.25/2.39 That finishes the proof of the theorem.
% 2.25/2.39
% 2.25/2.39 Process 25839 finished Wed Jul 27 09:08:47 2022
% 2.25/2.39 Otter interrupted
% 2.25/2.39 PROOF FOUND
%------------------------------------------------------------------------------