TSTP Solution File: NUM023-1 by Otter---3.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : NUM023-1 : TPTP v8.1.0. Bugfixed v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : otter-tptp-script %s
% Computer : n018.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:07:28 EDT 2022
% Result : Unsatisfiable 1.68s 1.89s
% Output : Refutation 1.68s
% Verified :
% SZS Type : Refutation
% Derivation depth : 2
% Number of leaves : 3
% Syntax : Number of clauses : 5 ( 4 unt; 0 nHn; 3 RR)
% Number of literals : 6 ( 0 equ; 2 neg)
% Maximal clause size : 2 ( 1 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 2 con; 0-2 aty)
% Number of variables : 5 ( 2 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(4,axiom,
( ~ e_qualish(add(successor(A),B),C)
| less(B,C) ),
file('NUM023-1.p',unknown),
[] ).
cnf(9,axiom,
~ less(n0,successor(a)),
file('NUM023-1.p',unknown),
[] ).
cnf(10,axiom,
e_qualish(add(A,n0),A),
file('NUM023-1.p',unknown),
[] ).
cnf(18,plain,
less(n0,successor(A)),
inference(hyper,[status(thm)],[10,4]),
[iquote('hyper,10,4')] ).
cnf(19,plain,
$false,
inference(binary,[status(thm)],[18,9]),
[iquote('binary,18.1,9.1')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : NUM023-1 : TPTP v8.1.0. Bugfixed v4.0.0.
% 0.07/0.12 % Command : otter-tptp-script %s
% 0.12/0.33 % Computer : n018.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:45:01 EDT 2022
% 0.12/0.33 % CPUTime :
% 1.68/1.89 ----- Otter 3.3f, August 2004 -----
% 1.68/1.89 The process was started by sandbox2 on n018.cluster.edu,
% 1.68/1.89 Wed Jul 27 09:45:01 2022
% 1.68/1.89 The command was "./otter". The process ID is 6542.
% 1.68/1.89
% 1.68/1.89 set(prolog_style_variables).
% 1.68/1.89 set(auto).
% 1.68/1.89 dependent: set(auto1).
% 1.68/1.89 dependent: set(process_input).
% 1.68/1.89 dependent: clear(print_kept).
% 1.68/1.89 dependent: clear(print_new_demod).
% 1.68/1.89 dependent: clear(print_back_demod).
% 1.68/1.89 dependent: clear(print_back_sub).
% 1.68/1.89 dependent: set(control_memory).
% 1.68/1.89 dependent: assign(max_mem, 12000).
% 1.68/1.89 dependent: assign(pick_given_ratio, 4).
% 1.68/1.89 dependent: assign(stats_level, 1).
% 1.68/1.89 dependent: assign(max_seconds, 10800).
% 1.68/1.89 clear(print_given).
% 1.68/1.89
% 1.68/1.89 list(usable).
% 1.68/1.89 0 [] e_qualish(add(A,n0),A).
% 1.68/1.89 0 [] e_qualish(add(A,successor(B)),successor(add(A,B))).
% 1.68/1.89 0 [] e_qualish(multiply(A,n0),n0).
% 1.68/1.89 0 [] e_qualish(multiply(A,successor(B)),add(multiply(A,B),A)).
% 1.68/1.89 0 [] -e_qualish(successor(A),successor(B))|e_qualish(A,B).
% 1.68/1.89 0 [] -e_qualish(A,B)|e_qualish(successor(A),successor(B)).
% 1.68/1.89 0 [] -less(A,B)| -less(C,A)|less(C,B).
% 1.68/1.89 0 [] -e_qualish(add(successor(A),B),C)|less(B,C).
% 1.68/1.89 0 [] -less(A,B)|e_qualish(add(successor(predecessor_of_1st_minus_2nd(B,A)),A),B).
% 1.68/1.89 0 [] e_qualish(X,X).
% 1.68/1.89 0 [] -e_qualish(X,Y)|e_qualish(Y,X).
% 1.68/1.89 0 [] -e_qualish(X,Y)| -e_qualish(Y,Z)|e_qualish(X,Z).
% 1.68/1.89 0 [] -e_qualish(successor(A),n0).
% 1.68/1.89 0 [] less(A,successor(A)).
% 1.68/1.89 0 [] -less(n0,successor(a)).
% 1.68/1.89 end_of_list.
% 1.68/1.89
% 1.68/1.89 SCAN INPUT: prop=0, horn=1, equality=0, symmetry=0, max_lits=3.
% 1.68/1.89
% 1.68/1.89 This is a Horn set without equality. The strategy will
% 1.68/1.89 be hyperresolution, with satellites in sos and nuclei
% 1.68/1.89 in usable.
% 1.68/1.89
% 1.68/1.89 dependent: set(hyper_res).
% 1.68/1.89 dependent: clear(order_hyper).
% 1.68/1.89
% 1.68/1.89 ------------> process usable:
% 1.68/1.89 ** KEPT (pick-wt=8): 1 [] -e_qualish(successor(A),successor(B))|e_qualish(A,B).
% 1.68/1.89 ** KEPT (pick-wt=8): 2 [] -e_qualish(A,B)|e_qualish(successor(A),successor(B)).
% 1.68/1.89 ** KEPT (pick-wt=9): 3 [] -less(A,B)| -less(C,A)|less(C,B).
% 1.68/1.89 ** KEPT (pick-wt=9): 4 [] -e_qualish(add(successor(A),B),C)|less(B,C).
% 1.68/1.89 ** KEPT (pick-wt=11): 5 [] -less(A,B)|e_qualish(add(successor(predecessor_of_1st_minus_2nd(B,A)),A),B).
% 1.68/1.89 ** KEPT (pick-wt=6): 6 [] -e_qualish(A,B)|e_qualish(B,A).
% 1.68/1.89 ** KEPT (pick-wt=9): 7 [] -e_qualish(A,B)| -e_qualish(B,C)|e_qualish(A,C).
% 1.68/1.89 ** KEPT (pick-wt=4): 8 [] -e_qualish(successor(A),n0).
% 1.68/1.89 ** KEPT (pick-wt=4): 9 [] -less(n0,successor(a)).
% 1.68/1.89
% 1.68/1.89 ------------> process sos:
% 1.68/1.89 ** KEPT (pick-wt=5): 10 [] e_qualish(add(A,n0),A).
% 1.68/1.89 ** KEPT (pick-wt=9): 11 [] e_qualish(add(A,successor(B)),successor(add(A,B))).
% 1.68/1.89 ** KEPT (pick-wt=5): 12 [] e_qualish(multiply(A,n0),n0).
% 1.68/1.89 ** KEPT (pick-wt=10): 13 [] e_qualish(multiply(A,successor(B)),add(multiply(A,B),A)).
% 1.68/1.89 ** KEPT (pick-wt=3): 14 [] e_qualish(A,A).
% 1.68/1.89 ** KEPT (pick-wt=4): 15 [] less(A,successor(A)).
% 1.68/1.89
% 1.68/1.89 ======= end of input processing =======
% 1.68/1.89
% 1.68/1.89 =========== start of search ===========
% 1.68/1.89
% 1.68/1.89 -------- PROOF --------
% 1.68/1.89
% 1.68/1.89 ----> UNIT CONFLICT at 0.00 sec ----> 19 [binary,18.1,9.1] $F.
% 1.68/1.89
% 1.68/1.89 Length of proof is 1. Level of proof is 1.
% 1.68/1.89
% 1.68/1.89 ---------------- PROOF ----------------
% 1.68/1.89 % SZS status Unsatisfiable
% 1.68/1.89 % SZS output start Refutation
% See solution above
% 1.68/1.89 ------------ end of proof -------------
% 1.68/1.89
% 1.68/1.89
% 1.68/1.89 Search stopped by max_proofs option.
% 1.68/1.89
% 1.68/1.89
% 1.68/1.89 Search stopped by max_proofs option.
% 1.68/1.89
% 1.68/1.89 ============ end of search ============
% 1.68/1.89
% 1.68/1.89 -------------- statistics -------------
% 1.68/1.89 clauses given 1
% 1.68/1.89 clauses generated 4
% 1.68/1.89 clauses kept 18
% 1.68/1.89 clauses forward subsumed 1
% 1.68/1.89 clauses back subsumed 0
% 1.68/1.89 Kbytes malloced 976
% 1.68/1.89
% 1.68/1.89 ----------- times (seconds) -----------
% 1.68/1.89 user CPU time 0.00 (0 hr, 0 min, 0 sec)
% 1.68/1.89 system CPU time 0.00 (0 hr, 0 min, 0 sec)
% 1.68/1.89 wall-clock time 2 (0 hr, 0 min, 2 sec)
% 1.68/1.89
% 1.68/1.89 That finishes the proof of the theorem.
% 1.68/1.89
% 1.68/1.89 Process 6542 finished Wed Jul 27 09:45:03 2022
% 1.68/1.89 Otter interrupted
% 1.68/1.89 PROOF FOUND
%------------------------------------------------------------------------------