TSTP Solution File: SYN328-1 by Otter---3.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : SYN328-1 : TPTP v8.1.0. Released v1.2.0.
% Transfm : none
% Format : tptp:raw
% Command : otter-tptp-script %s
% Computer : n024.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:24:15 EDT 2022
% Result : Unsatisfiable 1.66s 1.89s
% Output : Refutation 1.66s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 9
% Syntax : Number of clauses : 32 ( 12 unt; 14 nHn; 8 RR)
% Number of literals : 59 ( 0 equ; 11 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-1 aty)
% Number of functors : 2 ( 2 usr; 0 con; 1-1 aty)
% Number of variables : 31 ( 11 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
( ~ f(y(A))
| g(y(A))
| ~ f(A) ),
file('SYN328-1.p',unknown),
[] ).
cnf(2,axiom,
( ~ g(y(A))
| f(A) ),
file('SYN328-1.p',unknown),
[] ).
cnf(3,axiom,
( ~ f(y(A))
| h(y(A))
| ~ g(A) ),
file('SYN328-1.p',unknown),
[] ).
cnf(4,axiom,
( ~ h(y(A))
| g(A) ),
file('SYN328-1.p',unknown),
[] ).
cnf(7,axiom,
( ~ f(y(A))
| g(y(A))
| h(A) ),
file('SYN328-1.p',unknown),
[] ).
cnf(8,axiom,
( ~ h(y(A))
| h(A) ),
file('SYN328-1.p',unknown),
[] ).
cnf(9,axiom,
( ~ f(z(A))
| ~ g(z(A))
| ~ h(z(A)) ),
file('SYN328-1.p',unknown),
[] ).
cnf(10,axiom,
( f(y(A))
| f(A) ),
file('SYN328-1.p',unknown),
[] ).
cnf(11,axiom,
( f(y(A))
| g(A) ),
file('SYN328-1.p',unknown),
[] ).
cnf(12,plain,
( f(A)
| g(y(A))
| h(A) ),
inference(hyper,[status(thm)],[10,7]),
[iquote('hyper,10,7')] ).
cnf(13,plain,
( f(y(y(A)))
| f(A) ),
inference(hyper,[status(thm)],[11,2]),
[iquote('hyper,11,2')] ).
cnf(20,plain,
( f(y(A))
| g(y(y(A)))
| h(A) ),
inference(hyper,[status(thm)],[12,8]),
[iquote('hyper,12,8')] ).
cnf(22,plain,
( f(y(z(A)))
| g(y(y(z(A)))) ),
inference(factor_simp,[status(thm)],[inference(factor_simp,[status(thm)],[inference(hyper,[status(thm)],[20,9,10,11])])]),
[iquote('hyper,20,9,10,11,factor_simp,factor_simp')] ).
cnf(24,plain,
( f(y(y(A)))
| g(y(y(y(A))))
| g(A) ),
inference(hyper,[status(thm)],[20,4]),
[iquote('hyper,20,4')] ).
cnf(27,plain,
f(y(z(A))),
inference(factor_simp,[status(thm)],[inference(hyper,[status(thm)],[22,2])]),
[iquote('hyper,22,2,factor_simp')] ).
cnf(36,plain,
( f(y(y(A)))
| g(A) ),
inference(factor_simp,[status(thm)],[inference(hyper,[status(thm)],[24,2])]),
[iquote('hyper,24,2,factor_simp')] ).
cnf(41,plain,
( f(y(y(A)))
| h(y(A)) ),
inference(factor_simp,[status(thm)],[inference(hyper,[status(thm)],[36,3,10])]),
[iquote('hyper,36,3,10,factor_simp')] ).
cnf(42,plain,
( f(y(y(y(A))))
| f(A) ),
inference(hyper,[status(thm)],[36,2]),
[iquote('hyper,36,2')] ).
cnf(43,plain,
( f(y(y(A)))
| h(A) ),
inference(hyper,[status(thm)],[41,8]),
[iquote('hyper,41,8')] ).
cnf(47,plain,
f(y(y(z(A)))),
inference(factor_simp,[status(thm)],[inference(factor_simp,[status(thm)],[inference(hyper,[status(thm)],[43,9,13,36])])]),
[iquote('hyper,43,9,13,36,factor_simp,factor_simp')] ).
cnf(48,plain,
( f(y(y(y(A))))
| h(A) ),
inference(hyper,[status(thm)],[43,8]),
[iquote('hyper,43,8')] ).
cnf(49,plain,
( f(y(y(y(A))))
| g(A) ),
inference(hyper,[status(thm)],[43,4]),
[iquote('hyper,43,4')] ).
cnf(51,plain,
g(y(y(z(A)))),
inference(hyper,[status(thm)],[47,1,27]),
[iquote('hyper,47,1,27')] ).
cnf(59,plain,
f(y(y(y(z(A))))),
inference(factor_simp,[status(thm)],[inference(factor_simp,[status(thm)],[inference(hyper,[status(thm)],[49,9,42,48])])]),
[iquote('hyper,49,9,42,48,factor_simp,factor_simp')] ).
cnf(62,plain,
h(y(y(y(z(A))))),
inference(hyper,[status(thm)],[59,3,51]),
[iquote('hyper,59,3,51')] ).
cnf(64,plain,
h(y(y(z(A)))),
inference(hyper,[status(thm)],[62,8]),
[iquote('hyper,62,8')] ).
cnf(66,plain,
h(y(z(A))),
inference(hyper,[status(thm)],[64,8]),
[iquote('hyper,64,8')] ).
cnf(67,plain,
g(y(z(A))),
inference(hyper,[status(thm)],[64,4]),
[iquote('hyper,64,4')] ).
cnf(68,plain,
h(z(A)),
inference(hyper,[status(thm)],[66,8]),
[iquote('hyper,66,8')] ).
cnf(69,plain,
g(z(A)),
inference(hyper,[status(thm)],[66,4]),
[iquote('hyper,66,4')] ).
cnf(70,plain,
f(z(A)),
inference(hyper,[status(thm)],[67,2]),
[iquote('hyper,67,2')] ).
cnf(71,plain,
$false,
inference(hyper,[status(thm)],[70,9,69,68]),
[iquote('hyper,70,9,69,68')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SYN328-1 : TPTP v8.1.0. Released v1.2.0.
% 0.07/0.12 % Command : otter-tptp-script %s
% 0.12/0.33 % Computer : n024.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:17:10 EDT 2022
% 0.12/0.33 % CPUTime :
% 1.66/1.89 ----- Otter 3.3f, August 2004 -----
% 1.66/1.89 The process was started by sandbox2 on n024.cluster.edu,
% 1.66/1.89 Wed Jul 27 11:17:10 2022
% 1.66/1.89 The command was "./otter". The process ID is 13582.
% 1.66/1.89
% 1.66/1.89 set(prolog_style_variables).
% 1.66/1.89 set(auto).
% 1.66/1.89 dependent: set(auto1).
% 1.66/1.89 dependent: set(process_input).
% 1.66/1.89 dependent: clear(print_kept).
% 1.66/1.89 dependent: clear(print_new_demod).
% 1.66/1.89 dependent: clear(print_back_demod).
% 1.66/1.89 dependent: clear(print_back_sub).
% 1.66/1.89 dependent: set(control_memory).
% 1.66/1.89 dependent: assign(max_mem, 12000).
% 1.66/1.89 dependent: assign(pick_given_ratio, 4).
% 1.66/1.89 dependent: assign(stats_level, 1).
% 1.66/1.89 dependent: assign(max_seconds, 10800).
% 1.66/1.89 clear(print_given).
% 1.66/1.89
% 1.66/1.89 list(usable).
% 1.66/1.89 0 [] -f(y(X))|g(y(X))| -f(X).
% 1.66/1.89 0 [] f(y(X))|f(X).
% 1.66/1.89 0 [] -g(y(X))|f(X).
% 1.66/1.89 0 [] -f(y(X))|h(y(X))| -g(X).
% 1.66/1.89 0 [] f(y(X))|g(X).
% 1.66/1.89 0 [] -h(y(X))|g(X).
% 1.66/1.89 0 [] f(y(X))|h(y(X))| -h(X).
% 1.66/1.89 0 [] -g(y(X))|h(y(X))| -h(X).
% 1.66/1.89 0 [] -f(y(X))|g(y(X))|h(X).
% 1.66/1.89 0 [] -h(y(X))|h(X).
% 1.66/1.89 0 [] -f(z(X))| -g(z(X))| -h(z(X)).
% 1.66/1.89 end_of_list.
% 1.66/1.89
% 1.66/1.89 SCAN INPUT: prop=0, horn=0, equality=0, symmetry=0, max_lits=3.
% 1.66/1.89
% 1.66/1.89 This is a non-Horn set without equality. The strategy will
% 1.66/1.89 be ordered hyper_res, unit deletion, and factoring, with
% 1.66/1.89 satellites in sos and with nuclei in usable.
% 1.66/1.89
% 1.66/1.89 dependent: set(hyper_res).
% 1.66/1.89 dependent: set(factor).
% 1.66/1.89 dependent: set(unit_deletion).
% 1.66/1.89
% 1.66/1.89 ------------> process usable:
% 1.66/1.89 ** KEPT (pick-wt=8): 1 [] -f(y(A))|g(y(A))| -f(A).
% 1.66/1.89 ** KEPT (pick-wt=5): 2 [] -g(y(A))|f(A).
% 1.66/1.89 ** KEPT (pick-wt=8): 3 [] -f(y(A))|h(y(A))| -g(A).
% 1.66/1.89 ** KEPT (pick-wt=5): 4 [] -h(y(A))|g(A).
% 1.66/1.89 ** KEPT (pick-wt=8): 5 [] f(y(A))|h(y(A))| -h(A).
% 1.66/1.89 ** KEPT (pick-wt=8): 6 [] -g(y(A))|h(y(A))| -h(A).
% 1.66/1.89 ** KEPT (pick-wt=8): 7 [] -f(y(A))|g(y(A))|h(A).
% 1.66/1.89 ** KEPT (pick-wt=5): 8 [] -h(y(A))|h(A).
% 1.66/1.89 ** KEPT (pick-wt=9): 9 [] -f(z(A))| -g(z(A))| -h(z(A)).
% 1.66/1.89
% 1.66/1.89 ------------> process sos:
% 1.66/1.89 ** KEPT (pick-wt=5): 10 [] f(y(A))|f(A).
% 1.66/1.89 ** KEPT (pick-wt=5): 11 [] f(y(A))|g(A).
% 1.66/1.89
% 1.66/1.89 ======= end of input processing =======
% 1.66/1.89
% 1.66/1.89 =========== start of search ===========
% 1.66/1.89
% 1.66/1.89 -------- PROOF --------
% 1.66/1.89
% 1.66/1.89 -----> EMPTY CLAUSE at 0.01 sec ----> 71 [hyper,70,9,69,68] $F.
% 1.66/1.89
% 1.66/1.89 Length of proof is 22. Level of proof is 12.
% 1.66/1.89
% 1.66/1.89 ---------------- PROOF ----------------
% 1.66/1.89 % SZS status Unsatisfiable
% 1.66/1.89 % SZS output start Refutation
% See solution above
% 1.66/1.89 ------------ end of proof -------------
% 1.66/1.89
% 1.66/1.89
% 1.66/1.89 Search stopped by max_proofs option.
% 1.66/1.89
% 1.66/1.89
% 1.66/1.89 Search stopped by max_proofs option.
% 1.66/1.89
% 1.66/1.89 ============ end of search ============
% 1.66/1.89
% 1.66/1.89 -------------- statistics -------------
% 1.66/1.89 clauses given 33
% 1.66/1.89 clauses generated 394
% 1.66/1.89 clauses kept 70
% 1.66/1.89 clauses forward subsumed 334
% 1.66/1.89 clauses back subsumed 30
% 1.66/1.89 Kbytes malloced 976
% 1.66/1.89
% 1.66/1.89 ----------- times (seconds) -----------
% 1.66/1.89 user CPU time 0.01 (0 hr, 0 min, 0 sec)
% 1.66/1.89 system CPU time 0.00 (0 hr, 0 min, 0 sec)
% 1.66/1.89 wall-clock time 1 (0 hr, 0 min, 1 sec)
% 1.66/1.89
% 1.66/1.89 That finishes the proof of the theorem.
% 1.66/1.89
% 1.66/1.89 Process 13582 finished Wed Jul 27 11:17:11 2022
% 1.66/1.89 Otter interrupted
% 1.66/1.89 PROOF FOUND
%------------------------------------------------------------------------------