TSTP Solution File: SYN986+1.001 by Otter---3.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : SYN986+1.001 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : otter-tptp-script %s
% Computer : n009.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:25:37 EDT 2022
% Result : Theorem 1.67s 1.87s
% Output : Refutation 1.67s
% Verified :
% SZS Type : Refutation
% Derivation depth : 2
% Number of leaves : 3
% Syntax : Number of clauses : 5 ( 3 unt; 0 nHn; 3 RR)
% Number of literals : 8 ( 0 equ; 4 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-3 aty)
% Number of functors : 2 ( 2 usr; 1 con; 0-1 aty)
% Number of variables : 8 ( 1 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
( ~ r(A,B,C)
| ~ r(C,B,D)
| r(A,succ(B),D) ),
file('SYN986+1.001.p',unknown),
[] ).
cnf(2,axiom,
( ~ r(zero,zero,A)
| ~ r(zero,A,B) ),
file('SYN986+1.001.p',unknown),
[] ).
cnf(3,axiom,
r(A,zero,succ(A)),
file('SYN986+1.001.p',unknown),
[] ).
cnf(4,plain,
r(A,succ(zero),succ(succ(A))),
inference(hyper,[status(thm)],[3,1,3]),
[iquote('hyper,3,1,3')] ).
cnf(5,plain,
$false,
inference(hyper,[status(thm)],[4,2,3]),
[iquote('hyper,4,2,3')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SYN986+1.001 : TPTP v8.1.0. Released v4.0.0.
% 0.12/0.13 % Command : otter-tptp-script %s
% 0.12/0.33 % Computer : n009.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 11:11:21 EDT 2022
% 0.19/0.34 % CPUTime :
% 1.67/1.87 ----- Otter 3.3f, August 2004 -----
% 1.67/1.87 The process was started by sandbox2 on n009.cluster.edu,
% 1.67/1.87 Wed Jul 27 11:11:21 2022
% 1.67/1.87 The command was "./otter". The process ID is 14092.
% 1.67/1.87
% 1.67/1.87 set(prolog_style_variables).
% 1.67/1.87 set(auto).
% 1.67/1.87 dependent: set(auto1).
% 1.67/1.87 dependent: set(process_input).
% 1.67/1.87 dependent: clear(print_kept).
% 1.67/1.87 dependent: clear(print_new_demod).
% 1.67/1.87 dependent: clear(print_back_demod).
% 1.67/1.87 dependent: clear(print_back_sub).
% 1.67/1.87 dependent: set(control_memory).
% 1.67/1.87 dependent: assign(max_mem, 12000).
% 1.67/1.87 dependent: assign(pick_given_ratio, 4).
% 1.67/1.87 dependent: assign(stats_level, 1).
% 1.67/1.87 dependent: assign(max_seconds, 10800).
% 1.67/1.87 clear(print_given).
% 1.67/1.87
% 1.67/1.87 formula_list(usable).
% 1.67/1.87 all Y r(Y,zero,succ(Y)).
% 1.67/1.87 all Y X Z Z1 (r(Y,X,Z)-> (r(Z,X,Z1)->r(Y,succ(X),Z1))).
% 1.67/1.87 -(exists Z1 Z0 (r(zero,zero,Z1)&r(zero,Z1,Z0))).
% 1.67/1.87 end_of_list.
% 1.67/1.87
% 1.67/1.87 -------> usable clausifies to:
% 1.67/1.87
% 1.67/1.87 list(usable).
% 1.67/1.87 0 [] r(Y,zero,succ(Y)).
% 1.67/1.87 0 [] -r(Y,X,Z)| -r(Z,X,Z1)|r(Y,succ(X),Z1).
% 1.67/1.87 0 [] -r(zero,zero,Z1)| -r(zero,Z1,Z0).
% 1.67/1.87 end_of_list.
% 1.67/1.87
% 1.67/1.87 SCAN INPUT: prop=0, horn=1, equality=0, symmetry=0, max_lits=3.
% 1.67/1.87
% 1.67/1.87 This is a Horn set without equality. The strategy will
% 1.67/1.87 be hyperresolution, with satellites in sos and nuclei
% 1.67/1.87 in usable.
% 1.67/1.87
% 1.67/1.87 dependent: set(hyper_res).
% 1.67/1.87 dependent: clear(order_hyper).
% 1.67/1.87
% 1.67/1.87 ------------> process usable:
% 1.67/1.87 ** KEPT (pick-wt=13): 1 [] -r(A,B,C)| -r(C,B,D)|r(A,succ(B),D).
% 1.67/1.87 ** KEPT (pick-wt=8): 2 [] -r(zero,zero,A)| -r(zero,A,B).
% 1.67/1.87
% 1.67/1.87 ------------> process sos:
% 1.67/1.87 ** KEPT (pick-wt=5): 3 [] r(A,zero,succ(A)).
% 1.67/1.87
% 1.67/1.87 ======= end of input processing =======
% 1.67/1.87
% 1.67/1.87 =========== start of search ===========
% 1.67/1.87
% 1.67/1.87 -------- PROOF --------
% 1.67/1.87
% 1.67/1.87 -----> EMPTY CLAUSE at 0.00 sec ----> 5 [hyper,4,2,3] $F.
% 1.67/1.87
% 1.67/1.87 Length of proof is 1. Level of proof is 1.
% 1.67/1.87
% 1.67/1.87 ---------------- PROOF ----------------
% 1.67/1.87 % SZS status Theorem
% 1.67/1.87 % SZS output start Refutation
% See solution above
% 1.67/1.87 ------------ end of proof -------------
% 1.67/1.87
% 1.67/1.87
% 1.67/1.87 Search stopped by max_proofs option.
% 1.67/1.87
% 1.67/1.87
% 1.67/1.87 Search stopped by max_proofs option.
% 1.67/1.87
% 1.67/1.87 ============ end of search ============
% 1.67/1.87
% 1.67/1.87 -------------- statistics -------------
% 1.67/1.87 clauses given 2
% 1.67/1.87 clauses generated 3
% 1.67/1.87 clauses kept 4
% 1.67/1.87 clauses forward subsumed 1
% 1.67/1.87 clauses back subsumed 0
% 1.67/1.87 Kbytes malloced 976
% 1.67/1.87
% 1.67/1.87 ----------- times (seconds) -----------
% 1.67/1.87 user CPU time 0.00 (0 hr, 0 min, 0 sec)
% 1.67/1.87 system CPU time 0.00 (0 hr, 0 min, 0 sec)
% 1.67/1.87 wall-clock time 1 (0 hr, 0 min, 1 sec)
% 1.67/1.87
% 1.67/1.87 That finishes the proof of the theorem.
% 1.67/1.87
% 1.67/1.87 Process 14092 finished Wed Jul 27 11:11:22 2022
% 1.67/1.87 Otter interrupted
% 1.67/1.87 PROOF FOUND
%------------------------------------------------------------------------------