%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : NUM022-1 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : otter-tptp-script %s
% Computer : n005.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:07:28 EDT 2022
% Result : Unsatisfiable 1.65s 1.87s
% Output : Refutation 1.65s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 8
% Syntax : Number of clauses : 14 ( 8 unt; 2 nHn; 14 RR)
% Number of literals : 23 ( 0 equ; 8 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 3 con; 0-2 aty)
% Number of variables : 13 ( 1 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
( ~ less(A,B)
| ~ less(C,A)
| less(C,B) ),
file('NUM022-1.p',unknown),
[] ).
cnf(2,axiom,
( ~ e_qualish(add(successor(A),B),C)
| less(B,C) ),
file('NUM022-1.p',unknown),
[] ).
cnf(3,axiom,
( ~ less(A,B)
| e_qualish(add(successor(predecessor_of_1st_minus_2nd(B,A)),A),B) ),
file('NUM022-1.p',unknown),
[] ).
cnf(4,axiom,
( ~ divides(A,B)
| less(A,B)
| e_qualish(A,B) ),
file('NUM022-1.p',unknown),
[] ).
cnf(7,axiom,
( ~ e_qualish(A,B)
| ~ e_qualish(C,A)
| e_qualish(C,B) ),
file('NUM022-1.p',unknown),
[] ).
cnf(8,axiom,
~ less(a,d),
file('NUM022-1.p',unknown),
[] ).
cnf(9,axiom,
less(a,b),
file('NUM022-1.p',unknown),
[] ).
cnf(10,axiom,
divides(b,d),
file('NUM022-1.p',unknown),
[] ).
cnf(12,plain,
e_qualish(add(successor(predecessor_of_1st_minus_2nd(b,a)),a),b),
inference(hyper,[status(thm)],[9,3]),
[iquote('hyper,9,3')] ).
cnf(13,plain,
( less(b,d)
| e_qualish(b,d) ),
inference(hyper,[status(thm)],[10,4]),
[iquote('hyper,10,4')] ).
cnf(15,plain,
e_qualish(b,d),
inference(unit_del,[status(thm)],[inference(hyper,[status(thm)],[13,1,9]),8]),
[iquote('hyper,13,1,9,unit_del,8')] ).
cnf(16,plain,
e_qualish(add(successor(predecessor_of_1st_minus_2nd(b,a)),a),d),
inference(hyper,[status(thm)],[12,7,15]),
[iquote('hyper,12,7,15')] ).
cnf(19,plain,
less(a,d),
inference(hyper,[status(thm)],[16,2]),
[iquote('hyper,16,2')] ).
cnf(20,plain,
$false,
inference(binary,[status(thm)],[19,8]),
[iquote('binary,19.1,8.1')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.11 % Problem : NUM022-1 : TPTP v8.1.0. Released v1.0.0.
% 0.07/0.12 % Command : otter-tptp-script %s
% 0.12/0.33 % Computer : n005.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 09:40:50 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 n005.cluster.edu,
% 1.65/1.87 Wed Jul 27 09:40:50 2022
% 1.65/1.87 The command was "./otter". The process ID is 10097.
% 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 [] -less(A,B)| -less(C,A)|less(C,B).
% 1.65/1.87 0 [] -e_qualish(add(successor(A),B),C)|less(B,C).
% 1.65/1.87 0 [] -less(A,B)|e_qualish(add(successor(predecessor_of_1st_minus_2nd(B,A)),A),B).
% 1.65/1.87 0 [] -divides(A,B)|less(A,B)|e_qualish(A,B).
% 1.65/1.87 0 [] -less(A,B)|divides(A,B).
% 1.65/1.87 0 [] -e_qualish(A,B)|divides(A,B).
% 1.65/1.87 0 [] -e_qualish(A,B)| -e_qualish(C,A)|e_qualish(C,B).
% 1.65/1.87 0 [] less(a,b).
% 1.65/1.87 0 [] divides(b,d).
% 1.65/1.87 0 [] -less(a,d).
% 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=3.
% 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=9): 1 [] -less(A,B)| -less(C,A)|less(C,B).
% 1.65/1.87 ** KEPT (pick-wt=9): 2 [] -e_qualish(add(successor(A),B),C)|less(B,C).
% 1.65/1.87 ** KEPT (pick-wt=11): 3 [] -less(A,B)|e_qualish(add(successor(predecessor_of_1st_minus_2nd(B,A)),A),B).
% 1.65/1.87 ** KEPT (pick-wt=9): 4 [] -divides(A,B)|less(A,B)|e_qualish(A,B).
% 1.65/1.87 ** KEPT (pick-wt=6): 5 [] -less(A,B)|divides(A,B).
% 1.65/1.87 ** KEPT (pick-wt=6): 6 [] -e_qualish(A,B)|divides(A,B).
% 1.65/1.87 ** KEPT (pick-wt=9): 7 [] -e_qualish(A,B)| -e_qualish(C,A)|e_qualish(C,B).
% 1.65/1.87 ** KEPT (pick-wt=3): 8 [] -less(a,d).
% 1.65/1.87
% 1.65/1.87 ------------> process sos:
% 1.65/1.87 ** KEPT (pick-wt=3): 9 [] less(a,b).
% 1.65/1.87 ** KEPT (pick-wt=3): 10 [] divides(b,d).
% 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 ----> UNIT CONFLICT at 0.00 sec ----> 20 [binary,19.1,8.1] $F.
% 1.65/1.87
% 1.65/1.87 Length of proof is 5. Level of proof is 4.
% 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 7
% 1.65/1.87 clauses generated 15
% 1.65/1.87 clauses kept 19
% 1.65/1.87 clauses forward subsumed 4
% 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 2 (0 hr, 0 min, 2 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 10097 finished Wed Jul 27 09:40:52 2022
% 1.65/1.87 Otter interrupted
% 1.65/1.87 PROOF FOUND
%------------------------------------------------------------------------------