%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : SYN730+1 : TPTP v8.1.0. Released v2.5.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:25:13 EDT 2022
% Result : Theorem 1.58s 1.76s
% Output : Refutation 1.58s
% Verified :
% SZS Type : Refutation
% Derivation depth : 2
% Number of leaves : 2
% Syntax : Number of clauses : 4 ( 3 unt; 1 nHn; 2 RR)
% Number of literals : 5 ( 0 equ; 1 neg)
% Maximal clause size : 2 ( 1 avg)
% Maximal term depth : 3 ( 2 avg)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-3 aty)
% Number of functors : 4 ( 4 usr; 1 con; 0-1 aty)
% Number of variables : 4 ( 1 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
~ p(A,dollar_f1(A),B),
file('SYN730+1.p',unknown),
[] ).
cnf(2,axiom,
( p(a,dollar_f1(A),h(dollar_f1(A)))
| p(A,dollar_f1(A),k(dollar_f1(A))) ),
file('SYN730+1.p',unknown),
[] ).
cnf(3,plain,
p(a,dollar_f1(A),h(dollar_f1(A))),
inference(unit_del,[status(thm)],[inference(copy,[status(thm)],[2]),1]),
[iquote('copy,2,unit_del,1')] ).
cnf(4,plain,
$false,
inference(binary,[status(thm)],[3,1]),
[iquote('binary,3.1,1.1')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SYN730+1 : TPTP v8.1.0. Released v2.5.0.
% 0.03/0.12 % Command : otter-tptp-script %s
% 0.12/0.33 % Computer : n009.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:02:36 EDT 2022
% 0.12/0.33 % CPUTime :
% 1.58/1.76
% 1.58/1.76 -------- PROOF --------
% 1.58/1.76 ----- Otter 3.3f, August 2004 -----
% 1.58/1.76 The process was started by sandbox2 on n009.cluster.edu,
% 1.58/1.76 Wed Jul 27 11:02:36 2022
% 1.58/1.76 The command was "./otter". The process ID is 5369.
% 1.58/1.76
% 1.58/1.76 set(prolog_style_variables).
% 1.58/1.76 set(auto).
% 1.58/1.76 dependent: set(auto1).
% 1.58/1.76 dependent: set(process_input).
% 1.58/1.76 dependent: clear(print_kept).
% 1.58/1.76 dependent: clear(print_new_demod).
% 1.58/1.76 dependent: clear(print_back_demod).
% 1.58/1.76 dependent: clear(print_back_sub).
% 1.58/1.76 dependent: set(control_memory).
% 1.58/1.76 dependent: assign(max_mem, 12000).
% 1.58/1.76 dependent: assign(pick_given_ratio, 4).
% 1.58/1.76 dependent: assign(stats_level, 1).
% 1.58/1.76 dependent: assign(max_seconds, 10800).
% 1.58/1.76 clear(print_given).
% 1.58/1.76
% 1.58/1.76 formula_list(usable).
% 1.58/1.76 -(exists V all J exists Q (p(a,J,h(J))|p(V,J,k(J))->p(V,J,Q))).
% 1.58/1.76 end_of_list.
% 1.58/1.76
% 1.58/1.76 -------> usable clausifies to:
% 1.58/1.76
% 1.58/1.76 list(usable).
% 1.58/1.76 0 [] p(a,$f1(V),h($f1(V)))|p(V,$f1(V),k($f1(V))).
% 1.58/1.76 0 [] -p(V,$f1(V),Q).
% 1.58/1.76 end_of_list.
% 1.58/1.76
% 1.58/1.76 SCAN INPUT: prop=0, horn=0, equality=0, symmetry=0, max_lits=2.
% 1.58/1.76
% 1.58/1.76 This is a non-Horn set without equality. The strategy will
% 1.58/1.76 be ordered hyper_res, unit deletion, and factoring, with
% 1.58/1.76 satellites in sos and with nuclei in usable.
% 1.58/1.76
% 1.58/1.76 dependent: set(hyper_res).
% 1.58/1.76 dependent: set(factor).
% 1.58/1.76 dependent: set(unit_deletion).
% 1.58/1.76
% 1.58/1.76 ------------> process usable:
% 1.58/1.76 ** KEPT (pick-wt=5): 1 [] -p(A,$f1(A),B).
% 1.58/1.76
% 1.58/1.76 ------------> process sos:
% 1.58/1.76 ** KEPT (pick-wt=7): 3 [copy,2,unit_del,1] p(a,$f1(A),h($f1(A))).
% 1.58/1.76
% 1.58/1.76 ----> UNIT CONFLICT at 0.00 sec ----> 4 [binary,3.1,1.1] $F.
% 1.58/1.76
% 1.58/1.76 Length of proof is 1. Level of proof is 1.
% 1.58/1.76
% 1.58/1.76 ---------------- PROOF ----------------
% 1.58/1.76 % SZS status Theorem
% 1.58/1.76 % SZS output start Refutation
% See solution above
% 1.58/1.76 ------------ end of proof -------------
% 1.58/1.76
% 1.58/1.76
% 1.58/1.76 Search stopped by max_proofs option.
% 1.58/1.76
% 1.58/1.76
% 1.58/1.76 Search stopped by max_proofs option.
% 1.58/1.76
% 1.58/1.76 ============ end of search ============
% 1.58/1.76
% 1.58/1.76 -------------- statistics -------------
% 1.58/1.76 clauses given 0
% 1.58/1.76 clauses generated 0
% 1.58/1.76 clauses kept 2
% 1.58/1.76 clauses forward subsumed 0
% 1.58/1.76 clauses back subsumed 0
% 1.58/1.76 Kbytes malloced 976
% 1.58/1.76
% 1.58/1.76 ----------- times (seconds) -----------
% 1.58/1.76 user CPU time 0.00 (0 hr, 0 min, 0 sec)
% 1.58/1.76 system CPU time 0.00 (0 hr, 0 min, 0 sec)
% 1.58/1.76 wall-clock time 1 (0 hr, 0 min, 1 sec)
% 1.58/1.76
% 1.58/1.76 That finishes the proof of the theorem.
% 1.58/1.76
% 1.58/1.76 Process 5369 finished Wed Jul 27 11:02:37 2022
% 1.58/1.76 Otter interrupted
% 1.58/1.76 PROOF FOUND
%------------------------------------------------------------------------------