%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : SYN349-1 : TPTP v8.1.0. Released v1.2.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:24:19 EDT 2022
% Result : Unsatisfiable 1.63s 1.82s
% Output : Refutation 1.63s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 6
% Syntax : Number of clauses : 15 ( 4 unt; 6 nHn; 9 RR)
% Number of literals : 37 ( 0 equ; 16 neg)
% Maximal clause size : 4 ( 2 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 2 ( 2 usr; 0 con; 1-2 aty)
% Number of variables : 20 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
( f(A,g(A,B))
| ~ f(w(A),g(A,B)) ),
file('SYN349-1.p',unknown),
[] ).
cnf(2,axiom,
( ~ f(A,g(A,B))
| f(w(A),g(A,B)) ),
file('SYN349-1.p',unknown),
[] ).
cnf(3,axiom,
( ~ f(A,g(A,B))
| f(g(A,B),B)
| ~ f(B,g(A,B))
| f(g(A,B),w(A)) ),
file('SYN349-1.p',unknown),
[] ).
cnf(7,axiom,
( f(A,g(A,B))
| ~ f(g(A,B),B)
| f(B,g(A,B))
| ~ f(g(A,B),w(A)) ),
file('SYN349-1.p',unknown),
[] ).
cnf(9,axiom,
( ~ f(A,g(A,B))
| ~ f(g(A,B),B)
| ~ f(B,g(A,B))
| ~ f(g(A,B),w(A)) ),
file('SYN349-1.p',unknown),
[] ).
cnf(11,plain,
( ~ f(A,g(A,w(A)))
| f(g(A,w(A)),w(A))
| ~ f(w(A),g(A,w(A))) ),
inference(factor,[status(thm)],[3]),
[iquote('factor,3.2.4')] ).
cnf(13,plain,
( f(A,g(A,w(A)))
| ~ f(g(A,w(A)),w(A))
| f(w(A),g(A,w(A))) ),
inference(factor,[status(thm)],[7]),
[iquote('factor,7.2.4')] ).
cnf(15,plain,
( ~ f(A,g(A,w(A)))
| ~ f(g(A,w(A)),w(A))
| ~ f(w(A),g(A,w(A))) ),
inference(factor,[status(thm)],[9]),
[iquote('factor,9.2.4')] ).
cnf(16,axiom,
( f(A,g(A,B))
| f(g(A,B),B)
| f(B,g(A,B))
| f(g(A,B),w(A)) ),
file('SYN349-1.p',unknown),
[] ).
cnf(20,plain,
( f(A,g(A,w(A)))
| f(g(A,w(A)),w(A)) ),
inference(factor_simp,[status(thm)],[inference(factor_simp,[status(thm)],[inference(hyper,[status(thm)],[16,1])])]),
[iquote('hyper,16,1,factor_simp,factor_simp')] ).
cnf(22,plain,
( f(A,g(A,w(A)))
| f(w(A),g(A,w(A))) ),
inference(factor_simp,[status(thm)],[inference(hyper,[status(thm)],[20,13])]),
[iquote('hyper,20,13,factor_simp')] ).
cnf(23,plain,
f(w(A),g(A,w(A))),
inference(factor_simp,[status(thm)],[inference(hyper,[status(thm)],[22,2])]),
[iquote('hyper,22,2,factor_simp')] ).
cnf(24,plain,
f(A,g(A,w(A))),
inference(factor_simp,[status(thm)],[inference(hyper,[status(thm)],[22,1])]),
[iquote('hyper,22,1,factor_simp')] ).
cnf(25,plain,
f(g(A,w(A)),w(A)),
inference(hyper,[status(thm)],[23,11,24]),
[iquote('hyper,23,11,24')] ).
cnf(27,plain,
$false,
inference(hyper,[status(thm)],[25,15,24,23]),
[iquote('hyper,25,15,24,23')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SYN349-1 : TPTP v8.1.0. Released v1.2.0.
% 0.07/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:01:23 EDT 2022
% 0.13/0.34 % CPUTime :
% 1.63/1.82 ----- Otter 3.3f, August 2004 -----
% 1.63/1.82 The process was started by sandbox2 on n008.cluster.edu,
% 1.63/1.82 Wed Jul 27 11:01:23 2022
% 1.63/1.82 The command was "./otter". The process ID is 26307.
% 1.63/1.82
% 1.63/1.82 set(prolog_style_variables).
% 1.63/1.82 set(auto).
% 1.63/1.82 dependent: set(auto1).
% 1.63/1.82 dependent: set(process_input).
% 1.63/1.82 dependent: clear(print_kept).
% 1.63/1.82 dependent: clear(print_new_demod).
% 1.63/1.82 dependent: clear(print_back_demod).
% 1.63/1.82 dependent: clear(print_back_sub).
% 1.63/1.82 dependent: set(control_memory).
% 1.63/1.82 dependent: assign(max_mem, 12000).
% 1.63/1.82 dependent: assign(pick_given_ratio, 4).
% 1.63/1.82 dependent: assign(stats_level, 1).
% 1.63/1.82 dependent: assign(max_seconds, 10800).
% 1.63/1.82 clear(print_given).
% 1.63/1.82
% 1.63/1.82 list(usable).
% 1.63/1.82 0 [] f(X,g(X,Y))| -f(w(X),g(X,Y)).
% 1.63/1.82 0 [] -f(X,g(X,Y))|f(w(X),g(X,Y)).
% 1.63/1.82 0 [] -f(X,g(X,Y))|f(g(X,Y),Y)| -f(Y,g(X,Y))|f(g(X,Y),w(X)).
% 1.63/1.82 0 [] f(X,g(X,Y))| -f(g(X,Y),Y)| -f(Y,g(X,Y))|f(g(X,Y),w(X)).
% 1.63/1.82 0 [] f(X,g(X,Y))|f(g(X,Y),Y)|f(Y,g(X,Y))|f(g(X,Y),w(X)).
% 1.63/1.82 0 [] -f(X,g(X,Y))| -f(g(X,Y),Y)|f(Y,g(X,Y))|f(g(X,Y),w(X)).
% 1.63/1.82 0 [] -f(X,g(X,Y))|f(g(X,Y),Y)|f(Y,g(X,Y))| -f(g(X,Y),w(X)).
% 1.63/1.82 0 [] f(X,g(X,Y))| -f(g(X,Y),Y)|f(Y,g(X,Y))| -f(g(X,Y),w(X)).
% 1.63/1.82 0 [] f(X,g(X,Y))|f(g(X,Y),Y)| -f(Y,g(X,Y))| -f(g(X,Y),w(X)).
% 1.63/1.82 0 [] -f(X,g(X,Y))| -f(g(X,Y),Y)| -f(Y,g(X,Y))| -f(g(X,Y),w(X)).
% 1.63/1.82 end_of_list.
% 1.63/1.82
% 1.63/1.82 SCAN INPUT: prop=0, horn=0, equality=0, symmetry=0, max_lits=4.
% 1.63/1.82
% 1.63/1.82 This is a non-Horn set without equality. The strategy will
% 1.63/1.82 be ordered hyper_res, unit deletion, and factoring, with
% 1.63/1.82 satellites in sos and with nuclei in usable.
% 1.63/1.82
% 1.63/1.82 dependent: set(hyper_res).
% 1.63/1.82 dependent: set(factor).
% 1.63/1.82 dependent: set(unit_deletion).
% 1.63/1.82
% 1.63/1.82 ------------> process usable:
% 1.63/1.82 ** KEPT (pick-wt=11): 1 [] f(A,g(A,B))| -f(w(A),g(A,B)).
% 1.63/1.82 ** KEPT (pick-wt=11): 2 [] -f(A,g(A,B))|f(w(A),g(A,B)).
% 1.63/1.82 ** KEPT (pick-wt=21): 3 [] -f(A,g(A,B))|f(g(A,B),B)| -f(B,g(A,B))|f(g(A,B),w(A)).
% 1.63/1.82 ** KEPT (pick-wt=21): 4 [] f(A,g(A,B))| -f(g(A,B),B)| -f(B,g(A,B))|f(g(A,B),w(A)).
% 1.63/1.82 ** KEPT (pick-wt=21): 5 [] -f(A,g(A,B))| -f(g(A,B),B)|f(B,g(A,B))|f(g(A,B),w(A)).
% 1.63/1.82 ** KEPT (pick-wt=21): 6 [] -f(A,g(A,B))|f(g(A,B),B)|f(B,g(A,B))| -f(g(A,B),w(A)).
% 1.63/1.82 ** KEPT (pick-wt=21): 7 [] f(A,g(A,B))| -f(g(A,B),B)|f(B,g(A,B))| -f(g(A,B),w(A)).
% 1.63/1.82 ** KEPT (pick-wt=21): 8 [] f(A,g(A,B))|f(g(A,B),B)| -f(B,g(A,B))| -f(g(A,B),w(A)).
% 1.63/1.82 ** KEPT (pick-wt=21): 9 [] -f(A,g(A,B))| -f(g(A,B),B)| -f(B,g(A,B))| -f(g(A,B),w(A)).
% 1.63/1.82
% 1.63/1.82 ------------> process sos:
% 1.63/1.82 ** KEPT (pick-wt=21): 16 [] f(A,g(A,B))|f(g(A,B),B)|f(B,g(A,B))|f(g(A,B),w(A)).
% 1.63/1.82
% 1.63/1.82 ======= end of input processing =======
% 1.63/1.82
% 1.63/1.82 =========== start of search ===========
% 1.63/1.82
% 1.63/1.82 -------- PROOF --------
% 1.63/1.82
% 1.63/1.82 -----> EMPTY CLAUSE at 0.02 sec ----> 27 [hyper,25,15,24,23] $F.
% 1.63/1.82
% 1.63/1.82 Length of proof is 8. Level of proof is 4.
% 1.63/1.82
% 1.63/1.82 ---------------- PROOF ----------------
% 1.63/1.82 % SZS status Unsatisfiable
% 1.63/1.82 % SZS output start Refutation
% See solution above
% 1.63/1.82 ------------ end of proof -------------
% 1.63/1.82
% 1.63/1.82
% 1.63/1.82 Search stopped by max_proofs option.
% 1.63/1.82
% 1.63/1.82
% 1.63/1.82 Search stopped by max_proofs option.
% 1.63/1.82
% 1.63/1.82 ============ end of search ============
% 1.63/1.82
% 1.63/1.82 -------------- statistics -------------
% 1.63/1.82 clauses given 7
% 1.63/1.82 clauses generated 380
% 1.63/1.82 clauses kept 26
% 1.63/1.82 clauses forward subsumed 363
% 1.63/1.82 clauses back subsumed 8
% 1.63/1.82 Kbytes malloced 976
% 1.63/1.82
% 1.63/1.82 ----------- times (seconds) -----------
% 1.63/1.82 user CPU time 0.02 (0 hr, 0 min, 0 sec)
% 1.63/1.82 system CPU time 0.00 (0 hr, 0 min, 0 sec)
% 1.63/1.82 wall-clock time 2 (0 hr, 0 min, 2 sec)
% 1.63/1.82
% 1.63/1.82 That finishes the proof of the theorem.
% 1.63/1.82
% 1.63/1.82 Process 26307 finished Wed Jul 27 11:01:25 2022
% 1.63/1.82 Otter interrupted
% 1.63/1.82 PROOF FOUND
%------------------------------------------------------------------------------