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