TSTP Solution File: NUM024-1 by Otter---3.3

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Otter---3.3
% Problem  : NUM024-1 : TPTP v8.1.0. Bugfixed v4.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : otter-tptp-script %s

% Computer : n004.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.74s 1.94s
% Output   : Refutation 1.74s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    5
%            Number of leaves      :    8
% Syntax   : Number of clauses     :   14 (  10 unt;   0 nHn;  10 RR)
%            Number of literals    :   19 (   0 equ;   6 neg)
%            Maximal clause size   :    3 (   1 avg)
%            Maximal term depth    :    4 (   1 avg)
%            Number of predicates  :    3 (   2 usr;   1 prp; 0-2 aty)
%            Number of functors    :    5 (   5 usr;   2 con; 0-2 aty)
%            Number of variables   :   16 (   1 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(5,axiom,
    ( ~ less(A,B)
    | e_qualish(add(successor(predecessor_of_1st_minus_2nd(B,A)),A),B) ),
    file('NUM024-1.p',unknown),
    [] ).

cnf(6,axiom,
    ( ~ e_qualish(A,B)
    | e_qualish(B,A) ),
    file('NUM024-1.p',unknown),
    [] ).

cnf(7,axiom,
    ( ~ e_qualish(A,B)
    | ~ e_qualish(B,C)
    | e_qualish(A,C) ),
    file('NUM024-1.p',unknown),
    [] ).

cnf(8,axiom,
    ( ~ e_qualish(add(A,B),add(C,B))
    | e_qualish(A,C) ),
    file('NUM024-1.p',unknown),
    [] ).

cnf(9,axiom,
    ~ e_qualish(successor(A),n0),
    file('NUM024-1.p',unknown),
    [] ).

cnf(10,axiom,
    e_qualish(add(A,n0),A),
    file('NUM024-1.p',unknown),
    [] ).

cnf(15,axiom,
    e_qualish(add(A,B),add(B,A)),
    file('NUM024-1.p',unknown),
    [] ).

cnf(16,axiom,
    less(a,a),
    file('NUM024-1.p',unknown),
    [] ).

cnf(18,plain,
    e_qualish(A,add(A,n0)),
    inference(hyper,[status(thm)],[10,6]),
    [iquote('hyper,10,6')] ).

cnf(22,plain,
    e_qualish(add(successor(predecessor_of_1st_minus_2nd(a,a)),a),a),
    inference(hyper,[status(thm)],[16,5]),
    [iquote('hyper,16,5')] ).

cnf(43,plain,
    e_qualish(A,add(n0,A)),
    inference(hyper,[status(thm)],[15,7,18]),
    [iquote('hyper,15,7,18')] ).

cnf(125,plain,
    e_qualish(add(successor(predecessor_of_1st_minus_2nd(a,a)),a),add(n0,a)),
    inference(hyper,[status(thm)],[22,7,43]),
    [iquote('hyper,22,7,43')] ).

cnf(1391,plain,
    e_qualish(successor(predecessor_of_1st_minus_2nd(a,a)),n0),
    inference(hyper,[status(thm)],[125,8]),
    [iquote('hyper,125,8')] ).

cnf(1392,plain,
    $false,
    inference(binary,[status(thm)],[1391,9]),
    [iquote('binary,1391.1,9.1')] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem  : NUM024-1 : TPTP v8.1.0. Bugfixed v4.0.0.
% 0.03/0.12  % Command  : otter-tptp-script %s
% 0.12/0.33  % Computer : n004.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:39:51 EDT 2022
% 0.12/0.33  % CPUTime  : 
% 1.74/1.94  ----- Otter 3.3f, August 2004 -----
% 1.74/1.94  The process was started by sandbox2 on n004.cluster.edu,
% 1.74/1.94  Wed Jul 27 09:39:51 2022
% 1.74/1.94  The command was "./otter".  The process ID is 9298.
% 1.74/1.94  
% 1.74/1.94  set(prolog_style_variables).
% 1.74/1.94  set(auto).
% 1.74/1.94     dependent: set(auto1).
% 1.74/1.94     dependent: set(process_input).
% 1.74/1.94     dependent: clear(print_kept).
% 1.74/1.94     dependent: clear(print_new_demod).
% 1.74/1.94     dependent: clear(print_back_demod).
% 1.74/1.94     dependent: clear(print_back_sub).
% 1.74/1.94     dependent: set(control_memory).
% 1.74/1.94     dependent: assign(max_mem, 12000).
% 1.74/1.94     dependent: assign(pick_given_ratio, 4).
% 1.74/1.94     dependent: assign(stats_level, 1).
% 1.74/1.94     dependent: assign(max_seconds, 10800).
% 1.74/1.94  clear(print_given).
% 1.74/1.94  
% 1.74/1.94  list(usable).
% 1.74/1.94  0 [] e_qualish(add(A,n0),A).
% 1.74/1.94  0 [] e_qualish(add(A,successor(B)),successor(add(A,B))).
% 1.74/1.94  0 [] e_qualish(multiply(A,n0),n0).
% 1.74/1.94  0 [] e_qualish(multiply(A,successor(B)),add(multiply(A,B),A)).
% 1.74/1.94  0 [] -e_qualish(successor(A),successor(B))|e_qualish(A,B).
% 1.74/1.94  0 [] -e_qualish(A,B)|e_qualish(successor(A),successor(B)).
% 1.74/1.94  0 [] -less(A,B)| -less(C,A)|less(C,B).
% 1.74/1.94  0 [] -e_qualish(add(successor(A),B),C)|less(B,C).
% 1.74/1.94  0 [] -less(A,B)|e_qualish(add(successor(predecessor_of_1st_minus_2nd(B,A)),A),B).
% 1.74/1.94  0 [] e_qualish(X,X).
% 1.74/1.94  0 [] -e_qualish(X,Y)|e_qualish(Y,X).
% 1.74/1.94  0 [] -e_qualish(X,Y)| -e_qualish(Y,Z)|e_qualish(X,Z).
% 1.74/1.94  0 [] -e_qualish(add(A,B),add(C,B))|e_qualish(A,C).
% 1.74/1.94  0 [] e_qualish(add(A,B),add(B,A)).
% 1.74/1.94  0 [] less(a,a).
% 1.74/1.94  0 [] -e_qualish(successor(A),n0).
% 1.74/1.94  end_of_list.
% 1.74/1.94  
% 1.74/1.94  SCAN INPUT: prop=0, horn=1, equality=0, symmetry=0, max_lits=3.
% 1.74/1.94  
% 1.74/1.94  This is a Horn set without equality.  The strategy will
% 1.74/1.94  be hyperresolution, with satellites in sos and nuclei
% 1.74/1.94  in usable.
% 1.74/1.94  
% 1.74/1.94     dependent: set(hyper_res).
% 1.74/1.94     dependent: clear(order_hyper).
% 1.74/1.94  
% 1.74/1.94  ------------> process usable:
% 1.74/1.94  ** KEPT (pick-wt=8): 1 [] -e_qualish(successor(A),successor(B))|e_qualish(A,B).
% 1.74/1.94  ** KEPT (pick-wt=8): 2 [] -e_qualish(A,B)|e_qualish(successor(A),successor(B)).
% 1.74/1.94  ** KEPT (pick-wt=9): 3 [] -less(A,B)| -less(C,A)|less(C,B).
% 1.74/1.94  ** KEPT (pick-wt=9): 4 [] -e_qualish(add(successor(A),B),C)|less(B,C).
% 1.74/1.94  ** KEPT (pick-wt=11): 5 [] -less(A,B)|e_qualish(add(successor(predecessor_of_1st_minus_2nd(B,A)),A),B).
% 1.74/1.94  ** KEPT (pick-wt=6): 6 [] -e_qualish(A,B)|e_qualish(B,A).
% 1.74/1.94  ** KEPT (pick-wt=9): 7 [] -e_qualish(A,B)| -e_qualish(B,C)|e_qualish(A,C).
% 1.74/1.94  ** KEPT (pick-wt=10): 8 [] -e_qualish(add(A,B),add(C,B))|e_qualish(A,C).
% 1.74/1.94  ** KEPT (pick-wt=4): 9 [] -e_qualish(successor(A),n0).
% 1.74/1.94  
% 1.74/1.94  ------------> process sos:
% 1.74/1.94  ** KEPT (pick-wt=5): 10 [] e_qualish(add(A,n0),A).
% 1.74/1.94  ** KEPT (pick-wt=9): 11 [] e_qualish(add(A,successor(B)),successor(add(A,B))).
% 1.74/1.94  ** KEPT (pick-wt=5): 12 [] e_qualish(multiply(A,n0),n0).
% 1.74/1.94  ** KEPT (pick-wt=10): 13 [] e_qualish(multiply(A,successor(B)),add(multiply(A,B),A)).
% 1.74/1.94  ** KEPT (pick-wt=3): 14 [] e_qualish(A,A).
% 1.74/1.94  ** KEPT (pick-wt=7): 15 [] e_qualish(add(A,B),add(B,A)).
% 1.74/1.94  ** KEPT (pick-wt=3): 16 [] less(a,a).
% 1.74/1.94  
% 1.74/1.94  ======= end of input processing =======
% 1.74/1.94  
% 1.74/1.94  =========== start of search ===========
% 1.74/1.94  
% 1.74/1.94  
% 1.74/1.94  Resetting weight limit to 9.
% 1.74/1.94  
% 1.74/1.94  
% 1.74/1.94  Resetting weight limit to 9.
% 1.74/1.94  
% 1.74/1.94  sos_size=1205
% 1.74/1.94  
% 1.74/1.94  -------- PROOF -------- 
% 1.74/1.94  
% 1.74/1.94  ----> UNIT CONFLICT at   0.06 sec ----> 1392 [binary,1391.1,9.1] $F.
% 1.74/1.94  
% 1.74/1.94  Length of proof is 5.  Level of proof is 4.
% 1.74/1.94  
% 1.74/1.94  ---------------- PROOF ----------------
% 1.74/1.94  % SZS status Unsatisfiable
% 1.74/1.94  % SZS output start Refutation
% See solution above
% 1.74/1.94  ------------ end of proof -------------
% 1.74/1.94  
% 1.74/1.94  
% 1.74/1.94  Search stopped by max_proofs option.
% 1.74/1.94  
% 1.74/1.94  
% 1.74/1.94  Search stopped by max_proofs option.
% 1.74/1.94  
% 1.74/1.94  ============ end of search ============
% 1.74/1.94  
% 1.74/1.94  -------------- statistics -------------
% 1.74/1.94  clauses given                221
% 1.74/1.94  clauses generated          10191
% 1.74/1.94  clauses kept                1391
% 1.74/1.94  clauses forward subsumed    1777
% 1.74/1.94  clauses back subsumed         54
% 1.74/1.94  Kbytes malloced             4882
% 1.74/1.94  
% 1.74/1.94  ----------- times (seconds) -----------
% 1.74/1.94  user CPU time          0.06          (0 hr, 0 min, 0 sec)
% 1.74/1.94  system CPU time        0.00          (0 hr, 0 min, 0 sec)
% 1.74/1.94  wall-clock time        2             (0 hr, 0 min, 2 sec)
% 1.74/1.94  
% 1.74/1.94  That finishes the proof of the theorem.
% 1.74/1.94  
% 1.74/1.94  Process 9298 finished Wed Jul 27 09:39:53 2022
% 1.74/1.94  Otter interrupted
% 1.74/1.94  PROOF FOUND
%------------------------------------------------------------------------------