TSTP Solution File: SYN070+1 by Otter---3.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : SYN070+1 : TPTP v8.1.0. Released v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : otter-tptp-script %s
% Computer : n008.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:29 EDT 2022
% Result : Theorem 1.71s 1.91s
% Output : Refutation 1.71s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 7
% Syntax : Number of clauses : 17 ( 6 unt; 8 nHn; 8 RR)
% Number of literals : 38 ( 0 equ; 15 neg)
% Maximal clause size : 5 ( 2 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 5 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 2 ( 2 usr; 2 con; 0-0 aty)
% Number of variables : 24 ( 13 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
( ~ big_f(A)
| big_f(B)
| big_g(A) ),
file('SYN070+1.p',unknown),
[] ).
cnf(2,axiom,
( ~ big_f(A)
| big_h(B,A)
| big_g(A) ),
file('SYN070+1.p',unknown),
[] ).
cnf(3,axiom,
( ~ big_f(A)
| ~ big_g(B)
| big_g(A) ),
file('SYN070+1.p',unknown),
[] ).
cnf(4,axiom,
( ~ big_f(A)
| big_g(A)
| ~ big_f(B)
| big_g(B)
| big_j(dollar_c1,B) ),
file('SYN070+1.p',unknown),
[] ).
cnf(5,plain,
( ~ big_f(A)
| big_g(A)
| big_j(dollar_c1,A) ),
inference(factor_simp,[status(thm)],[inference(factor_simp,[status(thm)],[inference(copy,[status(thm)],[4])])]),
[iquote('copy,4,factor_simp,factor_simp')] ).
cnf(6,axiom,
( ~ big_f(A)
| ~ big_f(B)
| ~ big_h(A,B)
| ~ big_j(B,A) ),
file('SYN070+1.p',unknown),
[] ).
cnf(7,axiom,
~ big_g(dollar_c2),
file('SYN070+1.p',unknown),
[] ).
cnf(8,plain,
( ~ big_f(A)
| ~ big_h(A,A)
| ~ big_j(A,A) ),
inference(factor,[status(thm)],[6]),
[iquote('factor,6.1.2')] ).
cnf(9,axiom,
big_f(dollar_c2),
file('SYN070+1.p',unknown),
[] ).
cnf(12,plain,
big_f(A),
inference(unit_del,[status(thm)],[inference(hyper,[status(thm)],[9,1]),7]),
[iquote('hyper,9,1,unit_del,7')] ).
cnf(13,plain,
( big_g(A)
| big_j(dollar_c1,A) ),
inference(hyper,[status(thm)],[12,5]),
[iquote('hyper,12,5')] ).
cnf(14,plain,
( big_h(A,B)
| big_g(B) ),
inference(hyper,[status(thm)],[12,2]),
[iquote('hyper,12,2')] ).
cnf(15,plain,
( big_j(dollar_c1,A)
| big_g(B) ),
inference(hyper,[status(thm)],[13,3,12]),
[iquote('hyper,13,3,12')] ).
cnf(16,plain,
( big_h(A,B)
| big_g(C) ),
inference(hyper,[status(thm)],[14,3,12]),
[iquote('hyper,14,3,12')] ).
cnf(17,plain,
big_j(dollar_c1,A),
inference(hyper,[status(thm)],[15,7]),
[iquote('hyper,15,7')] ).
cnf(18,plain,
big_h(A,B),
inference(hyper,[status(thm)],[16,7]),
[iquote('hyper,16,7')] ).
cnf(19,plain,
$false,
inference(hyper,[status(thm)],[18,8,12,17]),
[iquote('hyper,18,8,12,17')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : SYN070+1 : TPTP v8.1.0. Released v2.0.0.
% 0.06/0.13 % Command : otter-tptp-script %s
% 0.13/0.33 % Computer : n008.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % WCLimit : 300
% 0.13/0.33 % DateTime : Wed Jul 27 11:14:08 EDT 2022
% 0.13/0.34 % CPUTime :
% 1.71/1.91 ----- Otter 3.3f, August 2004 -----
% 1.71/1.91 The process was started by sandbox on n008.cluster.edu,
% 1.71/1.91 Wed Jul 27 11:14:08 2022
% 1.71/1.91 The command was "./otter". The process ID is 19761.
% 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 all X Y (big_f(X)& (big_f(Y)&big_h(Y,X)->big_g(Y))->big_g(X)).
% 1.71/1.91 (exists X (big_f(X)& -big_g(X)))-> (exists X1 (big_f(X1)& -big_g(X1)& (all Y (big_f(Y)& -big_g(Y)->big_j(X1,Y))))).
% 1.71/1.91 all X Y (big_f(X)&big_f(Y)&big_h(X,Y)-> -big_j(Y,X)).
% 1.71/1.91 -(all X (big_f(X)->big_g(X))).
% 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(X)|big_f(Y)|big_g(X).
% 1.71/1.91 0 [] -big_f(X)|big_h(Y,X)|big_g(X).
% 1.71/1.91 0 [] -big_f(X)| -big_g(Y)|big_g(X).
% 1.71/1.91 0 [] -big_f(X)|big_g(X)|big_f($c1).
% 1.71/1.91 0 [] -big_f(X)|big_g(X)| -big_g($c1).
% 1.71/1.91 0 [] -big_f(X)|big_g(X)| -big_f(Y)|big_g(Y)|big_j($c1,Y).
% 1.71/1.91 0 [] -big_f(X)| -big_f(Y)| -big_h(X,Y)| -big_j(Y,X).
% 1.71/1.91 0 [] big_f($c2).
% 1.71/1.91 0 [] -big_g($c2).
% 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): 1 [] -big_f(A)|big_f(B)|big_g(A).
% 1.71/1.91 ** KEPT (pick-wt=7): 2 [] -big_f(A)|big_h(B,A)|big_g(A).
% 1.71/1.91 ** KEPT (pick-wt=6): 3 [] -big_f(A)| -big_g(B)|big_g(A).
% 1.71/1.91 Following clause subsumed by 1 during input processing: 0 [] -big_f(A)|big_g(A)|big_f($c1).
% 1.71/1.91 Following clause subsumed by 3 during input processing: 0 [] -big_f(A)|big_g(A)| -big_g($c1).
% 1.71/1.91 ** KEPT (pick-wt=7): 5 [copy,4,factor_simp,factor_simp] -big_f(A)|big_g(A)|big_j($c1,A).
% 1.71/1.91 ** KEPT (pick-wt=10): 6 [] -big_f(A)| -big_f(B)| -big_h(A,B)| -big_j(B,A).
% 1.71/1.91 ** KEPT (pick-wt=2): 7 [] -big_g($c2).
% 1.71/1.91
% 1.71/1.91 ------------> process sos:
% 1.71/1.91 ** KEPT (pick-wt=2): 9 [] big_f($c2).
% 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 ----> 19 [hyper,18,8,12,17] $F.
% 1.71/1.91
% 1.71/1.91 Length of proof is 9. Level of proof is 4.
% 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 10
% 1.71/1.91 clauses generated 15
% 1.71/1.91 clauses kept 17
% 1.71/1.91 clauses forward subsumed 6
% 1.71/1.91 clauses back subsumed 10
% 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 2 (0 hr, 0 min, 2 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 19761 finished Wed Jul 27 11:14:10 2022
% 1.71/1.91 Otter interrupted
% 1.71/1.91 PROOF FOUND
%------------------------------------------------------------------------------