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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Otter---3.3
% Problem  : FLD071-2 : TPTP v8.1.0. Bugfixed v2.1.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : otter-tptp-script %s

% Computer : n008.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:55 EDT 2022

% Result   : Unsatisfiable 59.32s 59.51s
% Output   : Refutation 59.32s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    5
%            Number of leaves      :   10
% Syntax   : Number of clauses     :   17 (  11 unt;   1 nHn;  17 RR)
%            Number of literals    :   28 (   0 equ;  11 neg)
%            Maximal clause size   :    4 (   1 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    4 (   3 usr;   1 prp; 0-2 aty)
%            Number of functors    :    5 (   5 usr;   4 con; 0-2 aty)
%            Number of variables   :   13 (   0 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(15,axiom,
    ( less_or_e_qual(A,B)
    | ~ less_or_e_qual(A,C)
    | ~ less_or_e_qual(C,B) ),
    file('FLD071-2.p',unknown),
    [] ).

cnf(16,axiom,
    ( less_or_e_qual(A,B)
    | less_or_e_qual(B,A)
    | ~ defined(A)
    | ~ defined(B) ),
    file('FLD071-2.p',unknown),
    [] ).

cnf(18,axiom,
    ( less_or_e_qual(additive_identity,multiply(A,B))
    | ~ less_or_e_qual(additive_identity,A)
    | ~ less_or_e_qual(additive_identity,B) ),
    file('FLD071-2.p',unknown),
    [] ).

cnf(20,axiom,
    ( e_qualish(A,B)
    | ~ e_qualish(B,A) ),
    file('FLD071-2.p',unknown),
    [] ).

cnf(24,axiom,
    ( less_or_e_qual(A,B)
    | ~ less_or_e_qual(C,B)
    | ~ e_qualish(C,A) ),
    file('FLD071-2.p',unknown),
    [] ).

cnf(26,axiom,
    ~ less_or_e_qual(additive_identity,u),
    file('FLD071-2.p',unknown),
    [] ).

cnf(41,plain,
    ( less_or_e_qual(A,A)
    | ~ defined(A) ),
    inference(factor_simp,[status(thm)],[inference(factor,[status(thm)],[16])]),
    [iquote('factor,16.1.2,factor_simp')] ).

cnf(50,axiom,
    defined(u),
    file('FLD071-2.p',unknown),
    [] ).

cnf(51,axiom,
    less_or_e_qual(additive_identity,a),
    file('FLD071-2.p',unknown),
    [] ).

cnf(52,axiom,
    less_or_e_qual(additive_identity,b),
    file('FLD071-2.p',unknown),
    [] ).

cnf(53,axiom,
    e_qualish(multiply(a,b),u),
    file('FLD071-2.p',unknown),
    [] ).

cnf(347,plain,
    less_or_e_qual(u,u),
    inference(hyper,[status(thm)],[50,41]),
    [iquote('hyper,50,41')] ).

cnf(582,plain,
    less_or_e_qual(additive_identity,multiply(a,b)),
    inference(hyper,[status(thm)],[52,18,51]),
    [iquote('hyper,52,18,51')] ).

cnf(954,plain,
    e_qualish(u,multiply(a,b)),
    inference(hyper,[status(thm)],[53,20]),
    [iquote('hyper,53,20')] ).

cnf(7787,plain,
    less_or_e_qual(multiply(a,b),u),
    inference(hyper,[status(thm)],[954,24,347]),
    [iquote('hyper,954,24,347')] ).

cnf(7954,plain,
    less_or_e_qual(additive_identity,u),
    inference(hyper,[status(thm)],[7787,15,582]),
    [iquote('hyper,7787,15,582')] ).

cnf(7955,plain,
    $false,
    inference(binary,[status(thm)],[7954,26]),
    [iquote('binary,7954.1,26.1')] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.12  % Problem  : FLD071-2 : TPTP v8.1.0. Bugfixed v2.1.0.
% 0.04/0.13  % Command  : otter-tptp-script %s
% 0.12/0.33  % Computer : n008.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:25:38 EDT 2022
% 0.12/0.34  % CPUTime  : 
% 1.71/1.92  ----- Otter 3.3f, August 2004 -----
% 1.71/1.92  The process was started by sandbox on n008.cluster.edu,
% 1.71/1.92  Wed Jul 27 03:25:38 2022
% 1.71/1.92  The command was "./otter".  The process ID is 17121.
% 1.71/1.92  
% 1.71/1.92  set(prolog_style_variables).
% 1.71/1.92  set(auto).
% 1.71/1.92     dependent: set(auto1).
% 1.71/1.92     dependent: set(process_input).
% 1.71/1.92     dependent: clear(print_kept).
% 1.71/1.92     dependent: clear(print_new_demod).
% 1.71/1.92     dependent: clear(print_back_demod).
% 1.71/1.92     dependent: clear(print_back_sub).
% 1.71/1.92     dependent: set(control_memory).
% 1.71/1.92     dependent: assign(max_mem, 12000).
% 1.71/1.92     dependent: assign(pick_given_ratio, 4).
% 1.71/1.92     dependent: assign(stats_level, 1).
% 1.71/1.92     dependent: assign(max_seconds, 10800).
% 1.71/1.92  clear(print_given).
% 1.71/1.92  
% 1.71/1.92  list(usable).
% 1.71/1.92  0 [] e_qualish(add(X,add(Y,Z)),add(add(X,Y),Z))| -defined(X)| -defined(Y)| -defined(Z).
% 1.71/1.92  0 [] e_qualish(add(additive_identity,X),X)| -defined(X).
% 1.71/1.92  0 [] e_qualish(add(X,additive_inverse(X)),additive_identity)| -defined(X).
% 1.71/1.92  0 [] e_qualish(add(X,Y),add(Y,X))| -defined(X)| -defined(Y).
% 1.71/1.92  0 [] e_qualish(multiply(X,multiply(Y,Z)),multiply(multiply(X,Y),Z))| -defined(X)| -defined(Y)| -defined(Z).
% 1.71/1.92  0 [] e_qualish(multiply(multiplicative_identity,X),X)| -defined(X).
% 1.71/1.92  0 [] e_qualish(multiply(X,multiplicative_inverse(X)),multiplicative_identity)| -defined(X)|e_qualish(X,additive_identity).
% 1.71/1.92  0 [] e_qualish(multiply(X,Y),multiply(Y,X))| -defined(X)| -defined(Y).
% 1.71/1.92  0 [] e_qualish(add(multiply(X,Z),multiply(Y,Z)),multiply(add(X,Y),Z))| -defined(X)| -defined(Y)| -defined(Z).
% 1.71/1.92  0 [] defined(add(X,Y))| -defined(X)| -defined(Y).
% 1.71/1.92  0 [] defined(additive_identity).
% 1.71/1.92  0 [] defined(additive_inverse(X))| -defined(X).
% 1.71/1.92  0 [] defined(multiply(X,Y))| -defined(X)| -defined(Y).
% 1.71/1.92  0 [] defined(multiplicative_identity).
% 1.71/1.92  0 [] defined(multiplicative_inverse(X))| -defined(X)|e_qualish(X,additive_identity).
% 1.71/1.92  0 [] e_qualish(X,Y)| -less_or_e_qual(X,Y)| -less_or_e_qual(Y,X).
% 1.71/1.92  0 [] less_or_e_qual(X,Z)| -less_or_e_qual(X,Y)| -less_or_e_qual(Y,Z).
% 1.71/1.92  0 [] less_or_e_qual(X,Y)|less_or_e_qual(Y,X)| -defined(X)| -defined(Y).
% 1.71/1.92  0 [] less_or_e_qual(add(X,Z),add(Y,Z))| -defined(Z)| -less_or_e_qual(X,Y).
% 1.71/1.92  0 [] less_or_e_qual(additive_identity,multiply(Y,Z))| -less_or_e_qual(additive_identity,Y)| -less_or_e_qual(additive_identity,Z).
% 1.71/1.92  0 [] e_qualish(X,X)| -defined(X).
% 1.71/1.92  0 [] e_qualish(X,Y)| -e_qualish(Y,X).
% 1.71/1.92  0 [] e_qualish(X,Z)| -e_qualish(X,Y)| -e_qualish(Y,Z).
% 1.71/1.92  0 [] e_qualish(add(X,Z),add(Y,Z))| -defined(Z)| -e_qualish(X,Y).
% 1.71/1.92  0 [] e_qualish(multiply(X,Z),multiply(Y,Z))| -defined(Z)| -e_qualish(X,Y).
% 1.71/1.92  0 [] less_or_e_qual(Y,Z)| -less_or_e_qual(X,Z)| -e_qualish(X,Y).
% 1.71/1.92  0 [] -e_qualish(additive_identity,multiplicative_identity).
% 1.71/1.92  0 [] defined(a).
% 1.71/1.92  0 [] defined(b).
% 1.71/1.92  0 [] defined(u).
% 1.71/1.92  0 [] less_or_e_qual(additive_identity,a).
% 1.71/1.92  0 [] less_or_e_qual(additive_identity,b).
% 1.71/1.92  0 [] e_qualish(multiply(a,b),u).
% 1.71/1.92  0 [] -less_or_e_qual(additive_identity,u).
% 1.71/1.92  end_of_list.
% 1.71/1.92  
% 1.71/1.92  SCAN INPUT: prop=0, horn=0, equality=0, symmetry=0, max_lits=4.
% 1.71/1.92  
% 1.71/1.92  This is a non-Horn set without equality.  The strategy will
% 1.71/1.92  be ordered hyper_res, unit deletion, and factoring, with
% 1.71/1.92  satellites in sos and with nuclei in usable.
% 1.71/1.92  
% 1.71/1.92     dependent: set(hyper_res).
% 1.71/1.92     dependent: set(factor).
% 1.71/1.92     dependent: set(unit_deletion).
% 1.71/1.92  
% 1.71/1.92  ------------> process usable:
% 1.71/1.92  ** KEPT (pick-wt=17): 1 [] e_qualish(add(A,add(B,C)),add(add(A,B),C))| -defined(A)| -defined(B)| -defined(C).
% 1.71/1.92  ** KEPT (pick-wt=7): 2 [] e_qualish(add(additive_identity,A),A)| -defined(A).
% 1.71/1.92  ** KEPT (pick-wt=8): 3 [] e_qualish(add(A,additive_inverse(A)),additive_identity)| -defined(A).
% 1.71/1.92  ** KEPT (pick-wt=11): 4 [] e_qualish(add(A,B),add(B,A))| -defined(A)| -defined(B).
% 1.71/1.92  ** KEPT (pick-wt=17): 5 [] e_qualish(multiply(A,multiply(B,C)),multiply(multiply(A,B),C))| -defined(A)| -defined(B)| -defined(C).
% 1.71/1.92  ** KEPT (pick-wt=7): 6 [] e_qualish(multiply(multiplicative_identity,A),A)| -defined(A).
% 1.71/1.92  ** KEPT (pick-wt=11): 7 [] e_qualish(multiply(A,multiplicative_inverse(A)),multiplicative_identity)| -defined(A)|e_qualish(A,additive_identity).
% 1.71/1.92  ** KEPT (pick-wt=11): 8 [] e_qualish(multiply(A,B),multiply(B,A))| -defined(A)| -defined(B).
% 1.71/1.92  ** KEPT (pick-wt=19): 9 [] e_qualish(add(multiply(A,B),multiply(C,B)),multiply(add(A,C),B))| -defined(A)| -defined(C)| -defined(B).
% 1.71/1.92  ** KEPT (pick-wt=8): 10 [] defined(add(A,B))| -defined(A)| -defined(B).
% 59.32/59.51  ** KEPT (pick-wt=5): 11 [] defined(additive_inverse(A))| -defined(A).
% 59.32/59.51  ** KEPT (pick-wt=8): 12 [] defined(multiply(A,B))| -defined(A)| -defined(B).
% 59.32/59.51  ** KEPT (pick-wt=8): 13 [] defined(multiplicative_inverse(A))| -defined(A)|e_qualish(A,additive_identity).
% 59.32/59.51  ** KEPT (pick-wt=9): 14 [] e_qualish(A,B)| -less_or_e_qual(A,B)| -less_or_e_qual(B,A).
% 59.32/59.51  ** KEPT (pick-wt=9): 15 [] less_or_e_qual(A,B)| -less_or_e_qual(A,C)| -less_or_e_qual(C,B).
% 59.32/59.51  ** KEPT (pick-wt=10): 16 [] less_or_e_qual(A,B)|less_or_e_qual(B,A)| -defined(A)| -defined(B).
% 59.32/59.51  ** KEPT (pick-wt=12): 17 [] less_or_e_qual(add(A,B),add(C,B))| -defined(B)| -less_or_e_qual(A,C).
% 59.32/59.51  ** KEPT (pick-wt=11): 18 [] less_or_e_qual(additive_identity,multiply(A,B))| -less_or_e_qual(additive_identity,A)| -less_or_e_qual(additive_identity,B).
% 59.32/59.51  ** KEPT (pick-wt=5): 19 [] e_qualish(A,A)| -defined(A).
% 59.32/59.51  ** KEPT (pick-wt=6): 20 [] e_qualish(A,B)| -e_qualish(B,A).
% 59.32/59.51  ** KEPT (pick-wt=9): 21 [] e_qualish(A,B)| -e_qualish(A,C)| -e_qualish(C,B).
% 59.32/59.51  ** KEPT (pick-wt=12): 22 [] e_qualish(add(A,B),add(C,B))| -defined(B)| -e_qualish(A,C).
% 59.32/59.51  ** KEPT (pick-wt=12): 23 [] e_qualish(multiply(A,B),multiply(C,B))| -defined(B)| -e_qualish(A,C).
% 59.32/59.51  ** KEPT (pick-wt=9): 24 [] less_or_e_qual(A,B)| -less_or_e_qual(C,B)| -e_qualish(C,A).
% 59.32/59.51  ** KEPT (pick-wt=3): 25 [] -e_qualish(additive_identity,multiplicative_identity).
% 59.32/59.51  ** KEPT (pick-wt=3): 26 [] -less_or_e_qual(additive_identity,u).
% 59.32/59.51  
% 59.32/59.51  ------------> process sos:
% 59.32/59.51  ** KEPT (pick-wt=2): 46 [] defined(additive_identity).
% 59.32/59.51  ** KEPT (pick-wt=2): 47 [] defined(multiplicative_identity).
% 59.32/59.51  ** KEPT (pick-wt=2): 48 [] defined(a).
% 59.32/59.51  ** KEPT (pick-wt=2): 49 [] defined(b).
% 59.32/59.51  ** KEPT (pick-wt=2): 50 [] defined(u).
% 59.32/59.51  ** KEPT (pick-wt=3): 51 [] less_or_e_qual(additive_identity,a).
% 59.32/59.51  ** KEPT (pick-wt=3): 52 [] less_or_e_qual(additive_identity,b).
% 59.32/59.51  ** KEPT (pick-wt=5): 53 [] e_qualish(multiply(a,b),u).
% 59.32/59.51  
% 59.32/59.51  ======= end of input processing =======
% 59.32/59.51  
% 59.32/59.51  =========== start of search ===========
% 59.32/59.51  
% 59.32/59.51  
% 59.32/59.51  Resetting weight limit to 7.
% 59.32/59.51  
% 59.32/59.51  
% 59.32/59.51  Resetting weight limit to 7.
% 59.32/59.51  
% 59.32/59.51  sos_size=6223
% 59.32/59.51  
% 59.32/59.51  
% 59.32/59.51  Resetting weight limit to 6.
% 59.32/59.51  
% 59.32/59.51  
% 59.32/59.51  Resetting weight limit to 6.
% 59.32/59.51  
% 59.32/59.51  sos_size=6869
% 59.32/59.51  
% 59.32/59.51  -- HEY sandbox, WE HAVE A PROOF!! -- 
% 59.32/59.51  
% 59.32/59.51  ----> UNIT CONFLICT at  57.58 sec ----> 7955 [binary,7954.1,26.1] $F.
% 59.32/59.51  
% 59.32/59.51  Length of proof is 6.  Level of proof is 4.
% 59.32/59.51  
% 59.32/59.51  ---------------- PROOF ----------------
% 59.32/59.51  % SZS status Unsatisfiable
% 59.32/59.51  % SZS output start Refutation
% See solution above
% 59.32/59.51  ------------ end of proof -------------
% 59.32/59.51  
% 59.32/59.51  
% 59.32/59.51  Search stopped by max_proofs option.
% 59.32/59.51  
% 59.32/59.51  
% 59.32/59.51  Search stopped by max_proofs option.
% 59.32/59.51  
% 59.32/59.51  ============ end of search ============
% 59.32/59.51  
% 59.32/59.51  -------------- statistics -------------
% 59.32/59.51  clauses given                354
% 59.32/59.51  clauses generated        33343217
% 59.32/59.51  clauses kept                7954
% 59.32/59.51  clauses forward subsumed    2606
% 59.32/59.51  clauses back subsumed          7
% 59.32/59.51  Kbytes malloced             4882
% 59.32/59.51  
% 59.32/59.51  ----------- times (seconds) -----------
% 59.32/59.51  user CPU time         57.58          (0 hr, 0 min, 57 sec)
% 59.32/59.51  system CPU time        0.01          (0 hr, 0 min, 0 sec)
% 59.32/59.51  wall-clock time       59             (0 hr, 0 min, 59 sec)
% 59.32/59.51  
% 59.32/59.51  That finishes the proof of the theorem.
% 59.32/59.51  
% 59.32/59.51  Process 17121 finished Wed Jul 27 03:26:37 2022
% 59.32/59.51  Otter interrupted
% 59.32/59.51  PROOF FOUND
%------------------------------------------------------------------------------