TSTP Solution File: NUM021-1 by Otter---3.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : NUM021-1 : TPTP v8.1.0. Bugfixed v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : otter-tptp-script %s
% Computer : n023.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.96s 2.12s
% Output : Refutation 1.96s
% 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(3,axiom,
( ~ less(A,B)
| ~ less(C,A)
| less(C,B) ),
file('NUM021-1.p',unknown),
[] ).
cnf(4,axiom,
( ~ e_qualish(add(successor(A),B),C)
| less(B,C) ),
file('NUM021-1.p',unknown),
[] ).
cnf(5,axiom,
( ~ less(A,B)
| e_qualish(add(successor(predecessor_of_1st_minus_2nd(B,A)),A),B) ),
file('NUM021-1.p',unknown),
[] ).
cnf(6,axiom,
( ~ divides(A,B)
| less(A,B)
| e_qualish(A,B) ),
file('NUM021-1.p',unknown),
[] ).
cnf(10,axiom,
( ~ e_qualish(A,B)
| ~ e_qualish(B,C)
| e_qualish(A,C) ),
file('NUM021-1.p',unknown),
[] ).
cnf(11,axiom,
~ less(b,a),
file('NUM021-1.p',unknown),
[] ).
cnf(18,axiom,
less(b,c),
file('NUM021-1.p',unknown),
[] ).
cnf(19,axiom,
divides(c,a),
file('NUM021-1.p',unknown),
[] ).
cnf(28,plain,
e_qualish(add(successor(predecessor_of_1st_minus_2nd(c,b)),b),c),
inference(hyper,[status(thm)],[18,5]),
[iquote('hyper,18,5')] ).
cnf(29,plain,
( less(c,a)
| e_qualish(c,a) ),
inference(hyper,[status(thm)],[19,6]),
[iquote('hyper,19,6')] ).
cnf(74,plain,
e_qualish(c,a),
inference(unit_del,[status(thm)],[inference(hyper,[status(thm)],[29,3,18]),11]),
[iquote('hyper,29,3,18,unit_del,11')] ).
cnf(97,plain,
e_qualish(add(successor(predecessor_of_1st_minus_2nd(c,b)),b),a),
inference(hyper,[status(thm)],[28,10,74]),
[iquote('hyper,28,10,74')] ).
cnf(649,plain,
less(b,a),
inference(hyper,[status(thm)],[97,4]),
[iquote('hyper,97,4')] ).
cnf(650,plain,
$false,
inference(binary,[status(thm)],[649,11]),
[iquote('binary,649.1,11.1')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.11 % Problem : NUM021-1 : TPTP v8.1.0. Bugfixed v4.0.0.
% 0.06/0.12 % Command : otter-tptp-script %s
% 0.12/0.33 % Computer : n023.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:00:48 EDT 2022
% 0.12/0.33 % CPUTime :
% 1.96/2.12 ----- Otter 3.3f, August 2004 -----
% 1.96/2.12 The process was started by sandbox on n023.cluster.edu,
% 1.96/2.12 Wed Jul 27 10:00:48 2022
% 1.96/2.12 The command was "./otter". The process ID is 32499.
% 1.96/2.12
% 1.96/2.12 set(prolog_style_variables).
% 1.96/2.12 set(auto).
% 1.96/2.12 dependent: set(auto1).
% 1.96/2.12 dependent: set(process_input).
% 1.96/2.12 dependent: clear(print_kept).
% 1.96/2.12 dependent: clear(print_new_demod).
% 1.96/2.12 dependent: clear(print_back_demod).
% 1.96/2.12 dependent: clear(print_back_sub).
% 1.96/2.12 dependent: set(control_memory).
% 1.96/2.12 dependent: assign(max_mem, 12000).
% 1.96/2.12 dependent: assign(pick_given_ratio, 4).
% 1.96/2.12 dependent: assign(stats_level, 1).
% 1.96/2.12 dependent: assign(max_seconds, 10800).
% 1.96/2.12 clear(print_given).
% 1.96/2.12
% 1.96/2.12 list(usable).
% 1.96/2.12 0 [] e_qualish(add(A,n0),A).
% 1.96/2.12 0 [] e_qualish(add(A,successor(B)),successor(add(A,B))).
% 1.96/2.12 0 [] e_qualish(multiply(A,n0),n0).
% 1.96/2.12 0 [] e_qualish(multiply(A,successor(B)),add(multiply(A,B),A)).
% 1.96/2.12 0 [] -e_qualish(successor(A),successor(B))|e_qualish(A,B).
% 1.96/2.12 0 [] -e_qualish(A,B)|e_qualish(successor(A),successor(B)).
% 1.96/2.12 0 [] -less(A,B)| -less(C,A)|less(C,B).
% 1.96/2.12 0 [] -e_qualish(add(successor(A),B),C)|less(B,C).
% 1.96/2.12 0 [] -less(A,B)|e_qualish(add(successor(predecessor_of_1st_minus_2nd(B,A)),A),B).
% 1.96/2.12 0 [] -divides(A,B)|less(A,B)|e_qualish(A,B).
% 1.96/2.12 0 [] -less(A,B)|divides(A,B).
% 1.96/2.12 0 [] -e_qualish(A,B)|divides(A,B).
% 1.96/2.12 0 [] e_qualish(X,X).
% 1.96/2.12 0 [] -e_qualish(X,Y)|e_qualish(Y,X).
% 1.96/2.12 0 [] -e_qualish(X,Y)| -e_qualish(Y,Z)|e_qualish(X,Z).
% 1.96/2.12 0 [] less(b,c).
% 1.96/2.12 0 [] -less(b,a).
% 1.96/2.12 0 [] divides(c,a).
% 1.96/2.12 0 [] -e_qualish(successor(A),n0).
% 1.96/2.12 end_of_list.
% 1.96/2.12
% 1.96/2.12 SCAN INPUT: prop=0, horn=0, equality=0, symmetry=0, max_lits=3.
% 1.96/2.12
% 1.96/2.12 This is a non-Horn set without equality. The strategy will
% 1.96/2.12 be ordered hyper_res, unit deletion, and factoring, with
% 1.96/2.12 satellites in sos and with nuclei in usable.
% 1.96/2.12
% 1.96/2.12 dependent: set(hyper_res).
% 1.96/2.12 dependent: set(factor).
% 1.96/2.12 dependent: set(unit_deletion).
% 1.96/2.12
% 1.96/2.12 ------------> process usable:
% 1.96/2.12 ** KEPT (pick-wt=8): 1 [] -e_qualish(successor(A),successor(B))|e_qualish(A,B).
% 1.96/2.12 ** KEPT (pick-wt=8): 2 [] -e_qualish(A,B)|e_qualish(successor(A),successor(B)).
% 1.96/2.12 ** KEPT (pick-wt=9): 3 [] -less(A,B)| -less(C,A)|less(C,B).
% 1.96/2.12 ** KEPT (pick-wt=9): 4 [] -e_qualish(add(successor(A),B),C)|less(B,C).
% 1.96/2.12 ** KEPT (pick-wt=11): 5 [] -less(A,B)|e_qualish(add(successor(predecessor_of_1st_minus_2nd(B,A)),A),B).
% 1.96/2.12 ** KEPT (pick-wt=9): 6 [] -divides(A,B)|less(A,B)|e_qualish(A,B).
% 1.96/2.12 ** KEPT (pick-wt=6): 7 [] -less(A,B)|divides(A,B).
% 1.96/2.12 ** KEPT (pick-wt=6): 8 [] -e_qualish(A,B)|divides(A,B).
% 1.96/2.12 ** KEPT (pick-wt=6): 9 [] -e_qualish(A,B)|e_qualish(B,A).
% 1.96/2.12 ** KEPT (pick-wt=9): 10 [] -e_qualish(A,B)| -e_qualish(B,C)|e_qualish(A,C).
% 1.96/2.12 ** KEPT (pick-wt=3): 11 [] -less(b,a).
% 1.96/2.12 ** KEPT (pick-wt=4): 12 [] -e_qualish(successor(A),n0).
% 1.96/2.12
% 1.96/2.12 ------------> process sos:
% 1.96/2.12 ** KEPT (pick-wt=5): 13 [] e_qualish(add(A,n0),A).
% 1.96/2.12 ** KEPT (pick-wt=9): 14 [] e_qualish(add(A,successor(B)),successor(add(A,B))).
% 1.96/2.12 ** KEPT (pick-wt=5): 15 [] e_qualish(multiply(A,n0),n0).
% 1.96/2.12 ** KEPT (pick-wt=10): 16 [] e_qualish(multiply(A,successor(B)),add(multiply(A,B),A)).
% 1.96/2.12 ** KEPT (pick-wt=3): 17 [] e_qualish(A,A).
% 1.96/2.12 ** KEPT (pick-wt=3): 18 [] less(b,c).
% 1.96/2.12 ** KEPT (pick-wt=3): 19 [] divides(c,a).
% 1.96/2.12
% 1.96/2.12 ======= end of input processing =======
% 1.96/2.12
% 1.96/2.12 =========== start of search ===========
% 1.96/2.12
% 1.96/2.12 -------- PROOF --------
% 1.96/2.12
% 1.96/2.12 ----> UNIT CONFLICT at 0.02 sec ----> 650 [binary,649.1,11.1] $F.
% 1.96/2.12
% 1.96/2.12 Length of proof is 5. Level of proof is 4.
% 1.96/2.12
% 1.96/2.12 ---------------- PROOF ----------------
% 1.96/2.12 % SZS status Unsatisfiable
% 1.96/2.12 % SZS output start Refutation
% See solution above
% 1.96/2.12 ------------ end of proof -------------
% 1.96/2.12
% 1.96/2.12
% 1.96/2.12 Search stopped by max_proofs option.
% 1.96/2.12
% 1.96/2.12
% 1.96/2.12 Search stopped by max_proofs option.
% 1.96/2.12
% 1.96/2.12 ============ end of search ============
% 1.96/2.12
% 1.96/2.12 -------------- statistics -------------
% 1.96/2.12 clauses given 139
% 1.96/2.12 clauses generated 1301
% 1.96/2.12 clauses kept 649
% 1.96/2.12 clauses forward subsumed 669
% 1.96/2.12 clauses back subsumed 3
% 1.96/2.12 Kbytes malloced 2929
% 1.96/2.12
% 1.96/2.12 ----------- times (seconds) -----------
% 1.96/2.12 user CPU time 0.02 (0 hr, 0 min, 0 sec)
% 1.96/2.12 system CPU time 0.00 (0 hr, 0 min, 0 sec)
% 1.96/2.12 wall-clock time 2 (0 hr, 0 min, 2 sec)
% 1.96/2.12
% 1.96/2.12 That finishes the proof of the theorem.
% 1.96/2.12
% 1.96/2.12 Process 32499 finished Wed Jul 27 10:00:50 2022
% 1.96/2.12 Otter interrupted
% 1.96/2.12 PROOF FOUND
%------------------------------------------------------------------------------