TSTP Solution File: RNG005-2 by Otter---3.3

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Otter---3.3
% Problem  : RNG005-2 : TPTP v8.1.0. Released v1.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : otter-tptp-script %s

% Computer : n018.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:12:01 EDT 2022

% Result   : Unsatisfiable 1.80s 2.01s
% Output   : Refutation 1.80s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    2
%            Number of leaves      :    6
% Syntax   : Number of clauses     :    8 (   7 unt;   0 nHn;   6 RR)
%            Number of literals    :   12 (   0 equ;   5 neg)
%            Maximal clause size   :    5 (   1 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    3 (   2 usr;   1 prp; 0-3 aty)
%            Number of functors    :    6 (   6 usr;   5 con; 0-1 aty)
%            Number of variables   :    9 (   1 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(17,axiom,
    ( ~ product(A,B,C)
    | ~ product(D,B,E)
    | ~ sum(A,D,F)
    | ~ product(F,B,G)
    | sum(C,E,G) ),
    file('RNG005-2.p',unknown),
    [] ).

cnf(21,axiom,
    ~ sum(c,d,additive_identity),
    file('RNG005-2.p',unknown),
    [] ).

cnf(26,axiom,
    sum(additive_inverse(A),A,additive_identity),
    file('RNG005-2.p',unknown),
    [] ).

cnf(28,axiom,
    product(additive_identity,A,additive_identity),
    file('RNG005-2.p',unknown),
    [] ).

cnf(30,axiom,
    product(a,b,d),
    file('RNG005-2.p',unknown),
    [] ).

cnf(31,axiom,
    product(additive_inverse(a),b,c),
    file('RNG005-2.p',unknown),
    [] ).

cnf(372,plain,
    sum(c,d,additive_identity),
    inference(hyper,[status(thm)],[31,17,30,26,28]),
    [iquote('hyper,31,17,30,26,28')] ).

cnf(373,plain,
    $false,
    inference(binary,[status(thm)],[372,21]),
    [iquote('binary,372.1,21.1')] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12  % Problem  : RNG005-2 : TPTP v8.1.0. Released v1.0.0.
% 0.10/0.12  % Command  : otter-tptp-script %s
% 0.12/0.33  % Computer : n018.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 02:18:01 EDT 2022
% 0.12/0.33  % CPUTime  : 
% 1.80/2.00  ----- Otter 3.3f, August 2004 -----
% 1.80/2.00  The process was started by sandbox2 on n018.cluster.edu,
% 1.80/2.00  Wed Jul 27 02:18:01 2022
% 1.80/2.00  The command was "./otter".  The process ID is 30082.
% 1.80/2.00  
% 1.80/2.00  set(prolog_style_variables).
% 1.80/2.00  set(auto).
% 1.80/2.00     dependent: set(auto1).
% 1.80/2.00     dependent: set(process_input).
% 1.80/2.00     dependent: clear(print_kept).
% 1.80/2.00     dependent: clear(print_new_demod).
% 1.80/2.00     dependent: clear(print_back_demod).
% 1.80/2.00     dependent: clear(print_back_sub).
% 1.80/2.00     dependent: set(control_memory).
% 1.80/2.00     dependent: assign(max_mem, 12000).
% 1.80/2.00     dependent: assign(pick_given_ratio, 4).
% 1.80/2.00     dependent: assign(stats_level, 1).
% 1.80/2.00     dependent: assign(max_seconds, 10800).
% 1.80/2.00  clear(print_given).
% 1.80/2.00  
% 1.80/2.00  list(usable).
% 1.80/2.00  0 [] -e_qualish(X,Y)|e_qualish(additive_inverse(X),additive_inverse(Y)).
% 1.80/2.00  0 [] -e_qualish(X,Y)|e_qualish(add(X,W),add(Y,W)).
% 1.80/2.00  0 [] -e_qualish(X,Y)| -sum(X,W,Z)|sum(Y,W,Z).
% 1.80/2.00  0 [] -e_qualish(X,Y)| -sum(W,X,Z)|sum(W,Y,Z).
% 1.80/2.00  0 [] -e_qualish(X,Y)| -sum(W,Z,X)|sum(W,Z,Y).
% 1.80/2.00  0 [] -e_qualish(X,Y)|e_qualish(multiply(X,W),multiply(Y,W)).
% 1.80/2.00  0 [] -e_qualish(X,Y)| -product(X,W,Z)|product(Y,W,Z).
% 1.80/2.00  0 [] -e_qualish(X,Y)| -product(W,X,Z)|product(W,Y,Z).
% 1.80/2.00  0 [] -e_qualish(X,Y)| -product(W,Z,X)|product(W,Z,Y).
% 1.80/2.00  0 [] sum(additive_identity,X,X).
% 1.80/2.00  0 [] sum(X,additive_identity,X).
% 1.80/2.00  0 [] product(X,Y,multiply(X,Y)).
% 1.80/2.00  0 [] sum(X,Y,add(X,Y)).
% 1.80/2.00  0 [] sum(additive_inverse(X),X,additive_identity).
% 1.80/2.00  0 [] sum(X,additive_inverse(X),additive_identity).
% 1.80/2.00  0 [] -sum(X,Y,U)| -sum(Y,Z,V)| -sum(U,Z,W)|sum(X,V,W).
% 1.80/2.00  0 [] -sum(X,Y,U)| -sum(Y,Z,V)| -sum(X,V,W)|sum(U,Z,W).
% 1.80/2.00  0 [] -sum(X,Y,Z)|sum(Y,X,Z).
% 1.80/2.00  0 [] -product(X,Y,U)| -product(Y,Z,V)| -product(U,Z,W)|product(X,V,W).
% 1.80/2.00  0 [] -product(X,Y,U)| -product(Y,Z,V)| -product(X,V,W)|product(U,Z,W).
% 1.80/2.00  0 [] -product(X,Y,V1)| -product(X,Z,V2)| -sum(Y,Z,V3)| -product(X,V3,V4)|sum(V1,V2,V4).
% 1.80/2.00  0 [] -product(X,Y,V1)| -product(X,Z,V2)| -sum(Y,Z,V3)| -sum(V1,V2,V4)|product(X,V3,V4).
% 1.80/2.00  0 [] -product(Y,X,V1)| -product(Z,X,V2)| -sum(Y,Z,V3)| -product(V3,X,V4)|sum(V1,V2,V4).
% 1.80/2.00  0 [] -product(Y,X,V1)| -product(Z,X,V2)| -sum(Y,Z,V3)| -sum(V1,V2,V4)|product(V3,X,V4).
% 1.80/2.00  0 [] -sum(X,Y,U)| -sum(X,Y,V)|e_qualish(U,V).
% 1.80/2.00  0 [] -product(X,Y,U)| -product(X,Y,V)|e_qualish(U,V).
% 1.80/2.00  0 [] product(additive_identity,X,additive_identity).
% 1.80/2.00  0 [] product(X,additive_identity,additive_identity).
% 1.80/2.00  0 [] product(a,b,d).
% 1.80/2.00  0 [] product(additive_inverse(a),b,c).
% 1.80/2.00  0 [] -sum(c,d,additive_identity).
% 1.80/2.00  end_of_list.
% 1.80/2.00  
% 1.80/2.00  SCAN INPUT: prop=0, horn=1, equality=0, symmetry=0, max_lits=5.
% 1.80/2.00  
% 1.80/2.00  This is a Horn set without equality.  The strategy will
% 1.80/2.00  be hyperresolution, with satellites in sos and nuclei
% 1.80/2.00  in usable.
% 1.80/2.00  
% 1.80/2.00     dependent: set(hyper_res).
% 1.80/2.00     dependent: clear(order_hyper).
% 1.80/2.00  
% 1.80/2.00  ------------> process usable:
% 1.80/2.00  ** KEPT (pick-wt=8): 1 [] -e_qualish(A,B)|e_qualish(additive_inverse(A),additive_inverse(B)).
% 1.80/2.00  ** KEPT (pick-wt=10): 2 [] -e_qualish(A,B)|e_qualish(add(A,C),add(B,C)).
% 1.80/2.00  ** KEPT (pick-wt=11): 3 [] -e_qualish(A,B)| -sum(A,C,D)|sum(B,C,D).
% 1.80/2.00  ** KEPT (pick-wt=11): 4 [] -e_qualish(A,B)| -sum(C,A,D)|sum(C,B,D).
% 1.80/2.00  ** KEPT (pick-wt=11): 5 [] -e_qualish(A,B)| -sum(C,D,A)|sum(C,D,B).
% 1.80/2.00  ** KEPT (pick-wt=10): 6 [] -e_qualish(A,B)|e_qualish(multiply(A,C),multiply(B,C)).
% 1.80/2.00  ** KEPT (pick-wt=11): 7 [] -e_qualish(A,B)| -product(A,C,D)|product(B,C,D).
% 1.80/2.00  ** KEPT (pick-wt=11): 8 [] -e_qualish(A,B)| -product(C,A,D)|product(C,B,D).
% 1.80/2.00  ** KEPT (pick-wt=11): 9 [] -e_qualish(A,B)| -product(C,D,A)|product(C,D,B).
% 1.80/2.00  ** KEPT (pick-wt=16): 10 [] -sum(A,B,C)| -sum(B,D,E)| -sum(C,D,F)|sum(A,E,F).
% 1.80/2.00  ** KEPT (pick-wt=16): 11 [] -sum(A,B,C)| -sum(B,D,E)| -sum(A,E,F)|sum(C,D,F).
% 1.80/2.00  ** KEPT (pick-wt=8): 12 [] -sum(A,B,C)|sum(B,A,C).
% 1.80/2.00  ** KEPT (pick-wt=16): 13 [] -product(A,B,C)| -product(B,D,E)| -product(C,D,F)|product(A,E,F).
% 1.80/2.00  ** KEPT (pick-wt=16): 14 [] -product(A,B,C)| -product(B,D,E)| -product(A,E,F)|product(C,D,F).
% 1.80/2.00  ** KEPT (pick-wt=20): 15 [] -product(A,B,C)| -product(A,D,E)| -sum(B,D,F)| -product(A,F,G)|sum(C,E,G).
% 1.80/2.00  ** KEPT (pick-wt=20): 16 [] -product(A,B,C)| -product(A,D,E)| -sum(B,D,F)| -sum(C,E,G)|product(A,F,G).
% 1.80/2.00  ** KEPT (pick-wt=20): 17 [] -product(A,B,C)| -product(D,B,E)| -sum(A,D,F)| -product(F,B,G)|sum(C,E,G).
% 1.80/2.00  ** KEPT (pick-wt=20): 18 [] -product(A,B,C)| -product(D,B,E)| -sum(A,D,F)| -sum(C,E,G)|product(F,B,G).
% 1.80/2.00  ** KEPT (pick-wt=11): 19 [] -sum(A,B,C)| -sum(A,B,D)|e_qualish(C,D).
% 1.80/2.01  ** KEPT (pick-wt=11): 20 [] -product(A,B,C)| -product(A,B,D)|e_qualish(C,D).
% 1.80/2.01  ** KEPT (pick-wt=4): 21 [] -sum(c,d,additive_identity).
% 1.80/2.01  
% 1.80/2.01  ------------> process sos:
% 1.80/2.01  ** KEPT (pick-wt=4): 22 [] sum(additive_identity,A,A).
% 1.80/2.01  ** KEPT (pick-wt=4): 23 [] sum(A,additive_identity,A).
% 1.80/2.01  ** KEPT (pick-wt=6): 24 [] product(A,B,multiply(A,B)).
% 1.80/2.01  ** KEPT (pick-wt=6): 25 [] sum(A,B,add(A,B)).
% 1.80/2.01  ** KEPT (pick-wt=5): 26 [] sum(additive_inverse(A),A,additive_identity).
% 1.80/2.01  ** KEPT (pick-wt=5): 27 [] sum(A,additive_inverse(A),additive_identity).
% 1.80/2.01  ** KEPT (pick-wt=4): 28 [] product(additive_identity,A,additive_identity).
% 1.80/2.01  ** KEPT (pick-wt=4): 29 [] product(A,additive_identity,additive_identity).
% 1.80/2.01  ** KEPT (pick-wt=4): 30 [] product(a,b,d).
% 1.80/2.01  ** KEPT (pick-wt=5): 31 [] product(additive_inverse(a),b,c).
% 1.80/2.01  
% 1.80/2.01  ======= end of input processing =======
% 1.80/2.01  
% 1.80/2.01  =========== start of search ===========
% 1.80/2.01  
% 1.80/2.01  -------- PROOF -------- 
% 1.80/2.01  
% 1.80/2.01  ----> UNIT CONFLICT at   0.01 sec ----> 373 [binary,372.1,21.1] $F.
% 1.80/2.01  
% 1.80/2.01  Length of proof is 1.  Level of proof is 1.
% 1.80/2.01  
% 1.80/2.01  ---------------- PROOF ----------------
% 1.80/2.01  % SZS status Unsatisfiable
% 1.80/2.01  % SZS output start Refutation
% See solution above
% 1.80/2.01  ------------ end of proof -------------
% 1.80/2.01  
% 1.80/2.01  
% 1.80/2.01  Search stopped by max_proofs option.
% 1.80/2.01  
% 1.80/2.01  
% 1.80/2.01  Search stopped by max_proofs option.
% 1.80/2.01  
% 1.80/2.01  ============ end of search ============
% 1.80/2.01  
% 1.80/2.01  -------------- statistics -------------
% 1.80/2.01  clauses given                 13
% 1.80/2.01  clauses generated           1042
% 1.80/2.01  clauses kept                 372
% 1.80/2.01  clauses forward subsumed     701
% 1.80/2.01  clauses back subsumed         25
% 1.80/2.01  Kbytes malloced              976
% 1.80/2.01  
% 1.80/2.01  ----------- times (seconds) -----------
% 1.80/2.01  user CPU time          0.01          (0 hr, 0 min, 0 sec)
% 1.80/2.01  system CPU time        0.00          (0 hr, 0 min, 0 sec)
% 1.80/2.01  wall-clock time        1             (0 hr, 0 min, 1 sec)
% 1.80/2.01  
% 1.80/2.01  That finishes the proof of the theorem.
% 1.80/2.01  
% 1.80/2.01  Process 30082 finished Wed Jul 27 02:18:02 2022
% 1.80/2.01  Otter interrupted
% 1.80/2.01  PROOF FOUND
%------------------------------------------------------------------------------