TSTP Solution File: SYN059+1 by Otter---3.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : SYN059+1 : TPTP v8.1.0. Released v2.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:23:26 EDT 2022
% Result : Theorem 1.71s 1.91s
% Output : Refutation 1.71s
% Verified :
% SZS Type : Refutation
% Derivation depth : 19
% Number of leaves : 16
% Syntax : Number of clauses : 39 ( 11 unt; 21 nHn; 39 RR)
% Number of literals : 93 ( 0 equ; 30 neg)
% Maximal clause size : 5 ( 2 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 5 ( 4 usr; 1 prp; 0-1 aty)
% Number of functors : 6 ( 6 usr; 6 con; 0-0 aty)
% Number of variables : 10 ( 4 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
( ~ big_f(A)
| big_h(A)
| ~ big_f(B)
| ~ big_g(C)
| big_h(B) ),
file('SYN059+1.p',unknown),
[] ).
cnf(2,plain,
( ~ big_f(A)
| big_h(A)
| ~ big_g(B) ),
inference(factor_simp,[status(thm)],[inference(factor_simp,[status(thm)],[inference(copy,[status(thm)],[1])])]),
[iquote('copy,1,factor_simp,factor_simp')] ).
cnf(3,axiom,
( ~ big_g(A)
| big_j(A)
| ~ big_f(B)
| ~ big_g(C)
| big_j(C) ),
file('SYN059+1.p',unknown),
[] ).
cnf(4,plain,
( ~ big_g(A)
| big_j(A)
| ~ big_f(B) ),
inference(factor_simp,[status(thm)],[inference(factor_simp,[status(thm)],[inference(copy,[status(thm)],[3])])]),
[iquote('copy,3,factor_simp,factor_simp')] ).
cnf(5,axiom,
( big_f(dollar_c3)
| big_g(dollar_c4)
| ~ big_h(dollar_c6)
| ~ big_j(dollar_c5) ),
file('SYN059+1.p',unknown),
[] ).
cnf(6,axiom,
( big_f(dollar_c3)
| ~ big_j(dollar_c4)
| big_f(dollar_c6) ),
file('SYN059+1.p',unknown),
[] ).
cnf(7,axiom,
( big_f(dollar_c3)
| ~ big_j(dollar_c4)
| big_g(dollar_c5) ),
file('SYN059+1.p',unknown),
[] ).
cnf(8,axiom,
( big_f(dollar_c3)
| ~ big_j(dollar_c4)
| ~ big_h(dollar_c6)
| ~ big_j(dollar_c5) ),
file('SYN059+1.p',unknown),
[] ).
cnf(9,axiom,
( ~ big_h(dollar_c3)
| big_g(dollar_c4)
| big_f(dollar_c6) ),
file('SYN059+1.p',unknown),
[] ).
cnf(10,axiom,
( ~ big_h(dollar_c3)
| big_g(dollar_c4)
| big_g(dollar_c5) ),
file('SYN059+1.p',unknown),
[] ).
cnf(11,axiom,
( ~ big_h(dollar_c3)
| big_g(dollar_c4)
| ~ big_h(dollar_c6)
| ~ big_j(dollar_c5) ),
file('SYN059+1.p',unknown),
[] ).
cnf(12,axiom,
( ~ big_h(dollar_c3)
| ~ big_j(dollar_c4)
| big_f(dollar_c6) ),
file('SYN059+1.p',unknown),
[] ).
cnf(13,axiom,
( ~ big_h(dollar_c3)
| ~ big_j(dollar_c4)
| big_g(dollar_c5) ),
file('SYN059+1.p',unknown),
[] ).
cnf(14,axiom,
( ~ big_h(dollar_c3)
| ~ big_j(dollar_c4)
| ~ big_h(dollar_c6)
| ~ big_j(dollar_c5) ),
file('SYN059+1.p',unknown),
[] ).
cnf(15,axiom,
big_f(dollar_c1),
file('SYN059+1.p',unknown),
[] ).
cnf(16,axiom,
big_g(dollar_c2),
file('SYN059+1.p',unknown),
[] ).
cnf(17,axiom,
( big_f(dollar_c3)
| big_g(dollar_c4)
| big_f(dollar_c6) ),
file('SYN059+1.p',unknown),
[] ).
cnf(18,axiom,
( big_f(dollar_c3)
| big_g(dollar_c4)
| big_g(dollar_c5) ),
file('SYN059+1.p',unknown),
[] ).
cnf(21,plain,
( big_f(dollar_c3)
| big_f(dollar_c6)
| big_j(dollar_c4) ),
inference(hyper,[status(thm)],[17,4,15]),
[iquote('hyper,17,4,15')] ).
cnf(22,plain,
( big_f(dollar_c3)
| big_g(dollar_c5)
| big_j(dollar_c4) ),
inference(hyper,[status(thm)],[18,4,15]),
[iquote('hyper,18,4,15')] ).
cnf(25,plain,
( big_f(dollar_c3)
| big_f(dollar_c6) ),
inference(factor_simp,[status(thm)],[inference(factor_simp,[status(thm)],[inference(hyper,[status(thm)],[21,6])])]),
[iquote('hyper,21,6,factor_simp,factor_simp')] ).
cnf(26,plain,
( big_f(dollar_c6)
| big_h(dollar_c3) ),
inference(hyper,[status(thm)],[25,2,16]),
[iquote('hyper,25,2,16')] ).
cnf(31,plain,
( big_f(dollar_c6)
| big_g(dollar_c4) ),
inference(factor_simp,[status(thm)],[inference(hyper,[status(thm)],[26,9])]),
[iquote('hyper,26,9,factor_simp')] ).
cnf(32,plain,
( big_f(dollar_c3)
| big_g(dollar_c5) ),
inference(factor_simp,[status(thm)],[inference(factor_simp,[status(thm)],[inference(hyper,[status(thm)],[22,7])])]),
[iquote('hyper,22,7,factor_simp,factor_simp')] ).
cnf(33,plain,
( big_f(dollar_c6)
| big_j(dollar_c4) ),
inference(factor_simp,[status(thm)],[inference(hyper,[status(thm)],[31,4,25])]),
[iquote('hyper,31,4,25,factor_simp')] ).
cnf(34,plain,
( big_f(dollar_c3)
| big_j(dollar_c5) ),
inference(factor_simp,[status(thm)],[inference(hyper,[status(thm)],[32,4,25])]),
[iquote('hyper,32,4,25,factor_simp')] ).
cnf(36,plain,
big_f(dollar_c6),
inference(factor_simp,[status(thm)],[inference(factor_simp,[status(thm)],[inference(hyper,[status(thm)],[33,12,26])])]),
[iquote('hyper,33,12,26,factor_simp,factor_simp')] ).
cnf(37,plain,
big_h(dollar_c6),
inference(hyper,[status(thm)],[36,2,16]),
[iquote('hyper,36,2,16')] ).
cnf(38,plain,
( big_f(dollar_c3)
| big_g(dollar_c4) ),
inference(factor_simp,[status(thm)],[inference(hyper,[status(thm)],[37,5,34])]),
[iquote('hyper,37,5,34,factor_simp')] ).
cnf(39,plain,
( big_f(dollar_c3)
| big_j(dollar_c4) ),
inference(hyper,[status(thm)],[38,4,36]),
[iquote('hyper,38,4,36')] ).
cnf(40,plain,
big_f(dollar_c3),
inference(factor_simp,[status(thm)],[inference(factor_simp,[status(thm)],[inference(hyper,[status(thm)],[39,8,37,34])])]),
[iquote('hyper,39,8,37,34,factor_simp,factor_simp')] ).
cnf(41,plain,
big_h(dollar_c3),
inference(hyper,[status(thm)],[40,2,16]),
[iquote('hyper,40,2,16')] ).
cnf(42,plain,
( big_g(dollar_c4)
| big_g(dollar_c5) ),
inference(hyper,[status(thm)],[41,10]),
[iquote('hyper,41,10')] ).
cnf(43,plain,
( big_g(dollar_c5)
| big_j(dollar_c4) ),
inference(hyper,[status(thm)],[42,4,40]),
[iquote('hyper,42,4,40')] ).
cnf(45,plain,
big_g(dollar_c5),
inference(factor_simp,[status(thm)],[inference(hyper,[status(thm)],[43,13,41])]),
[iquote('hyper,43,13,41,factor_simp')] ).
cnf(46,plain,
big_j(dollar_c5),
inference(hyper,[status(thm)],[45,4,40]),
[iquote('hyper,45,4,40')] ).
cnf(47,plain,
big_g(dollar_c4),
inference(hyper,[status(thm)],[46,11,41,37]),
[iquote('hyper,46,11,41,37')] ).
cnf(48,plain,
big_j(dollar_c4),
inference(hyper,[status(thm)],[47,4,40]),
[iquote('hyper,47,4,40')] ).
cnf(49,plain,
$false,
inference(hyper,[status(thm)],[48,14,41,37,46]),
[iquote('hyper,48,14,41,37,46')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : SYN059+1 : TPTP v8.1.0. Released v2.0.0.
% 0.11/0.13 % Command : otter-tptp-script %s
% 0.12/0.34 % Computer : n009.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 300
% 0.12/0.34 % DateTime : Wed Jul 27 11:12:51 EDT 2022
% 0.12/0.34 % CPUTime :
% 1.71/1.91 ----- Otter 3.3f, August 2004 -----
% 1.71/1.91 The process was started by sandbox2 on n009.cluster.edu,
% 1.71/1.91 Wed Jul 27 11:12:51 2022
% 1.71/1.91 The command was "./otter". The process ID is 20316.
% 1.71/1.91
% 1.71/1.91 set(prolog_style_variables).
% 1.71/1.91 set(auto).
% 1.71/1.91 dependent: set(auto1).
% 1.71/1.91 dependent: set(process_input).
% 1.71/1.91 dependent: clear(print_kept).
% 1.71/1.91 dependent: clear(print_new_demod).
% 1.71/1.91 dependent: clear(print_back_demod).
% 1.71/1.91 dependent: clear(print_back_sub).
% 1.71/1.91 dependent: set(control_memory).
% 1.71/1.91 dependent: assign(max_mem, 12000).
% 1.71/1.91 dependent: assign(pick_given_ratio, 4).
% 1.71/1.91 dependent: assign(stats_level, 1).
% 1.71/1.91 dependent: assign(max_seconds, 10800).
% 1.71/1.91 clear(print_given).
% 1.71/1.91
% 1.71/1.91 formula_list(usable).
% 1.71/1.91 exists X big_f(X).
% 1.71/1.91 exists Y big_g(Y).
% 1.71/1.91 -((all X (big_f(X)->big_h(X)))& (all U (big_g(U)->big_j(U)))<-> (all W Y (big_f(W)&big_g(Y)->big_h(W)&big_j(Y)))).
% 1.71/1.91 end_of_list.
% 1.71/1.91
% 1.71/1.91 -------> usable clausifies to:
% 1.71/1.91
% 1.71/1.91 list(usable).
% 1.71/1.91 0 [] big_f($c1).
% 1.71/1.91 0 [] big_g($c2).
% 1.71/1.91 0 [] -big_f(X)|big_h(X)| -big_f(W)| -big_g(Y)|big_h(W).
% 1.71/1.91 0 [] -big_f(X)|big_h(X)| -big_f(W)| -big_g(Y)|big_j(Y).
% 1.71/1.91 0 [] -big_g(U)|big_j(U)| -big_f(W)| -big_g(Y)|big_h(W).
% 1.71/1.91 0 [] -big_g(U)|big_j(U)| -big_f(W)| -big_g(Y)|big_j(Y).
% 1.71/1.91 0 [] big_f($c3)|big_g($c4)|big_f($c6).
% 1.71/1.91 0 [] big_f($c3)|big_g($c4)|big_g($c5).
% 1.71/1.91 0 [] big_f($c3)|big_g($c4)| -big_h($c6)| -big_j($c5).
% 1.71/1.91 0 [] big_f($c3)| -big_j($c4)|big_f($c6).
% 1.71/1.91 0 [] big_f($c3)| -big_j($c4)|big_g($c5).
% 1.71/1.91 0 [] big_f($c3)| -big_j($c4)| -big_h($c6)| -big_j($c5).
% 1.71/1.91 0 [] -big_h($c3)|big_g($c4)|big_f($c6).
% 1.71/1.91 0 [] -big_h($c3)|big_g($c4)|big_g($c5).
% 1.71/1.91 0 [] -big_h($c3)|big_g($c4)| -big_h($c6)| -big_j($c5).
% 1.71/1.91 0 [] -big_h($c3)| -big_j($c4)|big_f($c6).
% 1.71/1.91 0 [] -big_h($c3)| -big_j($c4)|big_g($c5).
% 1.71/1.91 0 [] -big_h($c3)| -big_j($c4)| -big_h($c6)| -big_j($c5).
% 1.71/1.91 end_of_list.
% 1.71/1.91
% 1.71/1.91 SCAN INPUT: prop=0, horn=0, equality=0, symmetry=0, max_lits=5.
% 1.71/1.91
% 1.71/1.91 This is a non-Horn set without equality. The strategy will
% 1.71/1.91 be ordered hyper_res, unit deletion, and factoring, with
% 1.71/1.91 satellites in sos and with nuclei in usable.
% 1.71/1.91
% 1.71/1.91 dependent: set(hyper_res).
% 1.71/1.91 dependent: set(factor).
% 1.71/1.91 dependent: set(unit_deletion).
% 1.71/1.91
% 1.71/1.91 ------------> process usable:
% 1.71/1.91 ** KEPT (pick-wt=6): 2 [copy,1,factor_simp,factor_simp] -big_f(A)|big_h(A)| -big_g(B).
% 1.71/1.91 Following clause subsumed by 2 during input processing: 0 [factor_simp] -big_f(B)|big_h(B)| -big_g(C)|big_j(C).
% 1.71/1.91 Following clause subsumed by 2 during input processing: 0 [factor_simp] -big_g(C)|big_j(C)| -big_f(B)|big_h(B).
% 1.71/1.91 ** KEPT (pick-wt=6): 4 [copy,3,factor_simp,factor_simp] -big_g(A)|big_j(A)| -big_f(B).
% 1.71/1.91 ** KEPT (pick-wt=8): 5 [] big_f($c3)|big_g($c4)| -big_h($c6)| -big_j($c5).
% 1.71/1.91 ** KEPT (pick-wt=6): 6 [] big_f($c3)| -big_j($c4)|big_f($c6).
% 1.71/1.91 ** KEPT (pick-wt=6): 7 [] big_f($c3)| -big_j($c4)|big_g($c5).
% 1.71/1.91 ** KEPT (pick-wt=8): 8 [] big_f($c3)| -big_j($c4)| -big_h($c6)| -big_j($c5).
% 1.71/1.91 ** KEPT (pick-wt=6): 9 [] -big_h($c3)|big_g($c4)|big_f($c6).
% 1.71/1.91 ** KEPT (pick-wt=6): 10 [] -big_h($c3)|big_g($c4)|big_g($c5).
% 1.71/1.91 ** KEPT (pick-wt=8): 11 [] -big_h($c3)|big_g($c4)| -big_h($c6)| -big_j($c5).
% 1.71/1.91 ** KEPT (pick-wt=6): 12 [] -big_h($c3)| -big_j($c4)|big_f($c6).
% 1.71/1.91 ** KEPT (pick-wt=6): 13 [] -big_h($c3)| -big_j($c4)|big_g($c5).
% 1.71/1.91 ** KEPT (pick-wt=8): 14 [] -big_h($c3)| -big_j($c4)| -big_h($c6)| -big_j($c5).
% 1.71/1.91
% 1.71/1.91 ------------> process sos:
% 1.71/1.91 ** KEPT (pick-wt=2): 15 [] big_f($c1).
% 1.71/1.91 ** KEPT (pick-wt=2): 16 [] big_g($c2).
% 1.71/1.91 ** KEPT (pick-wt=6): 17 [] big_f($c3)|big_g($c4)|big_f($c6).
% 1.71/1.91 ** KEPT (pick-wt=6): 18 [] big_f($c3)|big_g($c4)|big_g($c5).
% 1.71/1.91
% 1.71/1.91 ======= end of input processing =======
% 1.71/1.91
% 1.71/1.91 =========== start of search ===========
% 1.71/1.91
% 1.71/1.91 -------- PROOF --------
% 1.71/1.91
% 1.71/1.91 -----> EMPTY CLAUSE at 0.00 sec ----> 49 [hyper,48,14,41,37,46] $F.
% 1.71/1.91
% 1.71/1.91 Length of proof is 22. Level of proof is 18.
% 1.71/1.91
% 1.71/1.91 ---------------- PROOF ----------------
% 1.71/1.91 % SZS status Theorem
% 1.71/1.91 % SZS output start Refutation
% See solution above
% 1.71/1.91 ------------ end of proof -------------
% 1.71/1.91
% 1.71/1.91
% 1.71/1.91 Search stopped by max_proofs option.
% 1.71/1.91
% 1.71/1.91
% 1.71/1.91 Search stopped by max_proofs option.
% 1.71/1.91
% 1.71/1.91 ============ end of search ============
% 1.71/1.91
% 1.71/1.91 -------------- statistics -------------
% 1.71/1.91 clauses given 27
% 1.71/1.91 clauses generated 81
% 1.71/1.91 clauses kept 46
% 1.71/1.91 clauses forward subsumed 52
% 1.71/1.91 clauses back subsumed 31
% 1.71/1.91 Kbytes malloced 976
% 1.71/1.91
% 1.71/1.91 ----------- times (seconds) -----------
% 1.71/1.91 user CPU time 0.00 (0 hr, 0 min, 0 sec)
% 1.71/1.91 system CPU time 0.00 (0 hr, 0 min, 0 sec)
% 1.71/1.91 wall-clock time 1 (0 hr, 0 min, 1 sec)
% 1.71/1.91
% 1.71/1.91 That finishes the proof of the theorem.
% 1.71/1.91
% 1.71/1.91 Process 20316 finished Wed Jul 27 11:12:52 2022
% 1.71/1.91 Otter interrupted
% 1.71/1.91 PROOF FOUND
%------------------------------------------------------------------------------