TSTP Solution File: FLD058-3 by Otter---3.3

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Otter---3.3
% Problem  : FLD058-3 : TPTP v8.1.0. Bugfixed v2.1.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 12:53:52 EDT 2022

% Result   : Unsatisfiable 1.97s 2.17s
% Output   : Refutation 1.97s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    6
%            Number of leaves      :   11
% Syntax   : Number of clauses     :   18 (  12 unt;   1 nHn;  18 RR)
%            Number of literals    :   30 (   0 equ;  12 neg)
%            Maximal clause size   :    4 (   1 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of predicates  :    4 (   3 usr;   1 prp; 0-3 aty)
%            Number of functors    :    3 (   3 usr;   3 con; 0-0 aty)
%            Number of variables   :   14 (   0 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(3,axiom,
    ( sum(additive_identity,A,A)
    | ~ defined(A) ),
    file('FLD058-3.p',unknown),
    [] ).

cnf(19,axiom,
    ( sum(additive_identity,A,B)
    | ~ less_or_e_qual(A,B)
    | ~ less_or_e_qual(B,A) ),
    file('FLD058-3.p',unknown),
    [] ).

cnf(20,axiom,
    ( less_or_e_qual(A,B)
    | ~ less_or_e_qual(A,C)
    | ~ less_or_e_qual(C,B) ),
    file('FLD058-3.p',unknown),
    [] ).

cnf(21,axiom,
    ( less_or_e_qual(A,B)
    | less_or_e_qual(B,A)
    | ~ defined(A)
    | ~ defined(B) ),
    file('FLD058-3.p',unknown),
    [] ).

cnf(22,axiom,
    ( less_or_e_qual(A,B)
    | ~ less_or_e_qual(C,D)
    | ~ sum(C,E,A)
    | ~ sum(D,E,B) ),
    file('FLD058-3.p',unknown),
    [] ).

cnf(25,axiom,
    ~ sum(additive_identity,a,additive_identity),
    file('FLD058-3.p',unknown),
    [] ).

cnf(44,plain,
    ( less_or_e_qual(A,A)
    | ~ defined(A) ),
    inference(factor_simp,[status(thm)],[inference(factor,[status(thm)],[21])]),
    [iquote('factor,21.1.2,factor_simp')] ).

cnf(49,axiom,
    defined(additive_identity),
    file('FLD058-3.p',unknown),
    [] ).

cnf(52,axiom,
    defined(b),
    file('FLD058-3.p',unknown),
    [] ).

cnf(53,axiom,
    less_or_e_qual(additive_identity,a),
    file('FLD058-3.p',unknown),
    [] ).

cnf(54,axiom,
    less_or_e_qual(a,b),
    file('FLD058-3.p',unknown),
    [] ).

cnf(55,axiom,
    sum(additive_identity,b,additive_identity),
    file('FLD058-3.p',unknown),
    [] ).

cnf(56,plain,
    less_or_e_qual(additive_identity,additive_identity),
    inference(hyper,[status(thm)],[49,44]),
    [iquote('hyper,49,44')] ).

cnf(149,plain,
    sum(additive_identity,b,b),
    inference(hyper,[status(thm)],[52,3]),
    [iquote('hyper,52,3')] ).

cnf(8338,plain,
    less_or_e_qual(b,additive_identity),
    inference(hyper,[status(thm)],[149,22,56,55]),
    [iquote('hyper,149,22,56,55')] ).

cnf(8343,plain,
    less_or_e_qual(a,additive_identity),
    inference(hyper,[status(thm)],[8338,20,54]),
    [iquote('hyper,8338,20,54')] ).

cnf(8348,plain,
    sum(additive_identity,a,additive_identity),
    inference(hyper,[status(thm)],[8343,19,53]),
    [iquote('hyper,8343,19,53')] ).

cnf(8349,plain,
    $false,
    inference(binary,[status(thm)],[8348,25]),
    [iquote('binary,8348.1,25.1')] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11  % Problem  : FLD058-3 : TPTP v8.1.0. Bugfixed v2.1.0.
% 0.03/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 03:32:18 EDT 2022
% 0.12/0.33  % CPUTime  : 
% 1.82/2.05  ----- Otter 3.3f, August 2004 -----
% 1.82/2.05  The process was started by sandbox on n023.cluster.edu,
% 1.82/2.05  Wed Jul 27 03:32:18 2022
% 1.82/2.05  The command was "./otter".  The process ID is 29491.
% 1.82/2.05  
% 1.82/2.05  set(prolog_style_variables).
% 1.82/2.05  set(auto).
% 1.82/2.05     dependent: set(auto1).
% 1.82/2.05     dependent: set(process_input).
% 1.82/2.05     dependent: clear(print_kept).
% 1.82/2.05     dependent: clear(print_new_demod).
% 1.82/2.05     dependent: clear(print_back_demod).
% 1.82/2.05     dependent: clear(print_back_sub).
% 1.82/2.05     dependent: set(control_memory).
% 1.82/2.05     dependent: assign(max_mem, 12000).
% 1.82/2.05     dependent: assign(pick_given_ratio, 4).
% 1.82/2.05     dependent: assign(stats_level, 1).
% 1.82/2.05     dependent: assign(max_seconds, 10800).
% 1.82/2.05  clear(print_given).
% 1.82/2.05  
% 1.82/2.05  list(usable).
% 1.82/2.05  0 [] sum(X,V,W)| -sum(X,Y,U)| -sum(Y,Z,V)| -sum(U,Z,W).
% 1.82/2.05  0 [] sum(U,Z,W)| -sum(X,Y,U)| -sum(Y,Z,V)| -sum(X,V,W).
% 1.82/2.05  0 [] sum(additive_identity,X,X)| -defined(X).
% 1.82/2.05  0 [] sum(additive_inverse(X),X,additive_identity)| -defined(X).
% 1.82/2.05  0 [] sum(Y,X,Z)| -sum(X,Y,Z).
% 1.82/2.05  0 [] product(X,V,W)| -product(X,Y,U)| -product(Y,Z,V)| -product(U,Z,W).
% 1.82/2.05  0 [] product(U,Z,W)| -product(X,Y,U)| -product(Y,Z,V)| -product(X,V,W).
% 1.82/2.05  0 [] product(multiplicative_identity,X,X)| -defined(X).
% 1.82/2.05  0 [] product(multiplicative_inverse(X),X,multiplicative_identity)|sum(additive_identity,X,additive_identity)| -defined(X).
% 1.82/2.05  0 [] product(Y,X,Z)| -product(X,Y,Z).
% 1.82/2.05  0 [] sum(C,D,B)| -sum(X,Y,A)| -product(A,Z,B)| -product(X,Z,C)| -product(Y,Z,D).
% 1.82/2.05  0 [] product(A,Z,B)| -sum(X,Y,A)| -product(X,Z,C)| -product(Y,Z,D)| -sum(C,D,B).
% 1.82/2.05  0 [] defined(add(X,Y))| -defined(X)| -defined(Y).
% 1.82/2.05  0 [] defined(additive_identity).
% 1.82/2.05  0 [] defined(additive_inverse(X))| -defined(X).
% 1.82/2.05  0 [] defined(multiply(X,Y))| -defined(X)| -defined(Y).
% 1.82/2.05  0 [] defined(multiplicative_identity).
% 1.82/2.05  0 [] defined(multiplicative_inverse(X))| -defined(X)|sum(additive_identity,X,additive_identity).
% 1.82/2.05  0 [] sum(X,Y,add(X,Y))| -defined(X)| -defined(Y).
% 1.82/2.05  0 [] product(X,Y,multiply(X,Y))| -defined(X)| -defined(Y).
% 1.82/2.05  0 [] sum(additive_identity,X,Y)| -less_or_e_qual(X,Y)| -less_or_e_qual(Y,X).
% 1.82/2.05  0 [] less_or_e_qual(X,Z)| -less_or_e_qual(X,Y)| -less_or_e_qual(Y,Z).
% 1.82/2.05  0 [] less_or_e_qual(X,Y)|less_or_e_qual(Y,X)| -defined(X)| -defined(Y).
% 1.82/2.05  0 [] less_or_e_qual(U,V)| -less_or_e_qual(X,Y)| -sum(X,Z,U)| -sum(Y,Z,V).
% 1.82/2.05  0 [] less_or_e_qual(additive_identity,Z)| -less_or_e_qual(additive_identity,X)| -less_or_e_qual(additive_identity,Y)| -product(X,Y,Z).
% 1.82/2.05  0 [] -sum(additive_identity,additive_identity,multiplicative_identity).
% 1.82/2.05  0 [] defined(a).
% 1.82/2.05  0 [] defined(b).
% 1.82/2.05  0 [] less_or_e_qual(additive_identity,a).
% 1.82/2.05  0 [] less_or_e_qual(a,b).
% 1.82/2.05  0 [] -sum(additive_identity,a,additive_identity).
% 1.82/2.05  0 [] sum(additive_identity,b,additive_identity).
% 1.82/2.05  end_of_list.
% 1.82/2.05  
% 1.82/2.05  SCAN INPUT: prop=0, horn=0, equality=0, symmetry=0, max_lits=5.
% 1.82/2.05  
% 1.82/2.05  This is a non-Horn set without equality.  The strategy will
% 1.82/2.05  be ordered hyper_res, unit deletion, and factoring, with
% 1.82/2.05  satellites in sos and with nuclei in usable.
% 1.82/2.05  
% 1.82/2.05     dependent: set(hyper_res).
% 1.82/2.05     dependent: set(factor).
% 1.82/2.05     dependent: set(unit_deletion).
% 1.82/2.05  
% 1.82/2.05  ------------> process usable:
% 1.82/2.05  ** KEPT (pick-wt=16): 1 [] sum(A,B,C)| -sum(A,D,E)| -sum(D,F,B)| -sum(E,F,C).
% 1.82/2.05  ** KEPT (pick-wt=16): 2 [] sum(A,B,C)| -sum(D,E,A)| -sum(E,B,F)| -sum(D,F,C).
% 1.82/2.05  ** KEPT (pick-wt=6): 3 [] sum(additive_identity,A,A)| -defined(A).
% 1.82/2.05  ** KEPT (pick-wt=7): 4 [] sum(additive_inverse(A),A,additive_identity)| -defined(A).
% 1.82/2.05  ** KEPT (pick-wt=8): 5 [] sum(A,B,C)| -sum(B,A,C).
% 1.82/2.05  ** KEPT (pick-wt=16): 6 [] product(A,B,C)| -product(A,D,E)| -product(D,F,B)| -product(E,F,C).
% 1.82/2.05  ** KEPT (pick-wt=16): 7 [] product(A,B,C)| -product(D,E,A)| -product(E,B,F)| -product(D,F,C).
% 1.82/2.05  ** KEPT (pick-wt=6): 8 [] product(multiplicative_identity,A,A)| -defined(A).
% 1.82/2.05  ** KEPT (pick-wt=11): 9 [] product(multiplicative_inverse(A),A,multiplicative_identity)|sum(additive_identity,A,additive_identity)| -defined(A).
% 1.82/2.05  ** KEPT (pick-wt=8): 10 [] product(A,B,C)| -product(B,A,C).
% 1.82/2.05  ** KEPT (pick-wt=20): 11 [] sum(A,B,C)| -sum(D,E,F)| -product(F,G,C)| -product(D,G,A)| -product(E,G,B).
% 1.82/2.05  ** KEPT (pick-wt=20): 12 [] product(A,B,C)| -sum(D,E,A)| -product(D,B,F)| -product(E,B,G)| -sum(F,G,C).
% 1.82/2.05  ** KEPT (pick-wt=8): 13 [] defined(add(A,B))| -defined(A)| -defined(B).
% 1.82/2.05  ** KEPT (pick-wt=5): 14 [] defined(additive_inverse(A))| -defined(A).
% 1.97/2.17  ** KEPT (pick-wt=8): 15 [] defined(multiply(A,B))| -defined(A)| -defined(B).
% 1.97/2.17  ** KEPT (pick-wt=9): 16 [] defined(multiplicative_inverse(A))| -defined(A)|sum(additive_identity,A,additive_identity).
% 1.97/2.17  ** KEPT (pick-wt=10): 17 [] sum(A,B,add(A,B))| -defined(A)| -defined(B).
% 1.97/2.17  ** KEPT (pick-wt=10): 18 [] product(A,B,multiply(A,B))| -defined(A)| -defined(B).
% 1.97/2.17  ** KEPT (pick-wt=10): 19 [] sum(additive_identity,A,B)| -less_or_e_qual(A,B)| -less_or_e_qual(B,A).
% 1.97/2.17  ** KEPT (pick-wt=9): 20 [] less_or_e_qual(A,B)| -less_or_e_qual(A,C)| -less_or_e_qual(C,B).
% 1.97/2.17  ** KEPT (pick-wt=10): 21 [] less_or_e_qual(A,B)|less_or_e_qual(B,A)| -defined(A)| -defined(B).
% 1.97/2.17  ** KEPT (pick-wt=14): 22 [] less_or_e_qual(A,B)| -less_or_e_qual(C,D)| -sum(C,E,A)| -sum(D,E,B).
% 1.97/2.17  ** KEPT (pick-wt=13): 23 [] less_or_e_qual(additive_identity,A)| -less_or_e_qual(additive_identity,B)| -less_or_e_qual(additive_identity,C)| -product(B,C,A).
% 1.97/2.17  ** KEPT (pick-wt=4): 24 [] -sum(additive_identity,additive_identity,multiplicative_identity).
% 1.97/2.17  ** KEPT (pick-wt=4): 25 [] -sum(additive_identity,a,additive_identity).
% 1.97/2.17  
% 1.97/2.17  ------------> process sos:
% 1.97/2.17  ** KEPT (pick-wt=2): 49 [] defined(additive_identity).
% 1.97/2.17  ** KEPT (pick-wt=2): 50 [] defined(multiplicative_identity).
% 1.97/2.17  ** KEPT (pick-wt=2): 51 [] defined(a).
% 1.97/2.17  ** KEPT (pick-wt=2): 52 [] defined(b).
% 1.97/2.17  ** KEPT (pick-wt=3): 53 [] less_or_e_qual(additive_identity,a).
% 1.97/2.17  ** KEPT (pick-wt=3): 54 [] less_or_e_qual(a,b).
% 1.97/2.17  ** KEPT (pick-wt=4): 55 [] sum(additive_identity,b,additive_identity).
% 1.97/2.17  
% 1.97/2.17  ======= end of input processing =======
% 1.97/2.17  
% 1.97/2.17  =========== start of search ===========
% 1.97/2.17  
% 1.97/2.17  -------- PROOF -------- 
% 1.97/2.17  
% 1.97/2.17  ----> UNIT CONFLICT at   0.12 sec ----> 8349 [binary,8348.1,25.1] $F.
% 1.97/2.17  
% 1.97/2.17  Length of proof is 6.  Level of proof is 5.
% 1.97/2.17  
% 1.97/2.17  ---------------- PROOF ----------------
% 1.97/2.17  % SZS status Unsatisfiable
% 1.97/2.17  % SZS output start Refutation
% See solution above
% 1.97/2.17  ------------ end of proof -------------
% 1.97/2.17  
% 1.97/2.17  
% 1.97/2.17  Search stopped by max_proofs option.
% 1.97/2.17  
% 1.97/2.17  
% 1.97/2.17  Search stopped by max_proofs option.
% 1.97/2.17  
% 1.97/2.17  ============ end of search ============
% 1.97/2.17  
% 1.97/2.17  -------------- statistics -------------
% 1.97/2.17  clauses given                 70
% 1.97/2.17  clauses generated           9887
% 1.97/2.17  clauses kept                8348
% 1.97/2.17  clauses forward subsumed    1562
% 1.97/2.17  clauses back subsumed          9
% 1.97/2.17  Kbytes malloced             3906
% 1.97/2.17  
% 1.97/2.17  ----------- times (seconds) -----------
% 1.97/2.17  user CPU time          0.12          (0 hr, 0 min, 0 sec)
% 1.97/2.17  system CPU time        0.00          (0 hr, 0 min, 0 sec)
% 1.97/2.17  wall-clock time        2             (0 hr, 0 min, 2 sec)
% 1.97/2.17  
% 1.97/2.17  That finishes the proof of the theorem.
% 1.97/2.17  
% 1.97/2.17  Process 29491 finished Wed Jul 27 03:32:20 2022
% 1.97/2.17  Otter interrupted
% 1.97/2.17  PROOF FOUND
%------------------------------------------------------------------------------