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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Otter---3.3
% Problem  : SYN583-1 : TPTP v8.1.0. Released v2.5.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : otter-tptp-script %s

% Computer : n022.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:24:57 EDT 2022

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

% Comments : 
%------------------------------------------------------------------------------
cnf(1,axiom,
    ~ p11(f4(f6(c15,c18)),c16),
    file('SYN583-1.p',unknown),
    [] ).

cnf(6,axiom,
    ( p2(f4(A),f4(B))
    | ~ p2(A,B) ),
    file('SYN583-1.p',unknown),
    [] ).

cnf(13,axiom,
    ( p11(A,B)
    | ~ p2(C,A)
    | ~ p2(D,B)
    | ~ p11(C,D) ),
    file('SYN583-1.p',unknown),
    [] ).

cnf(15,axiom,
    ( p2(f6(A,B),f6(C,D))
    | ~ p2(B,D)
    | ~ p5(A,C) ),
    file('SYN583-1.p',unknown),
    [] ).

cnf(25,axiom,
    p2(A,A),
    file('SYN583-1.p',unknown),
    [] ).

cnf(26,axiom,
    p5(A,A),
    file('SYN583-1.p',unknown),
    [] ).

cnf(27,axiom,
    p2(c13,c18),
    file('SYN583-1.p',unknown),
    [] ).

cnf(30,axiom,
    p11(f4(f6(c15,c13)),c16),
    file('SYN583-1.p',unknown),
    [] ).

cnf(33,plain,
    p2(f6(A,c13),f6(A,c18)),
    inference(hyper,[status(thm)],[27,15,26]),
    [iquote('hyper,27,15,26')] ).

cnf(80,plain,
    p2(f4(f6(A,c13)),f4(f6(A,c18))),
    inference(hyper,[status(thm)],[33,6]),
    [iquote('hyper,33,6')] ).

cnf(265,plain,
    p11(f4(f6(c15,c18)),c16),
    inference(hyper,[status(thm)],[80,13,25,30]),
    [iquote('hyper,80,13,25,30')] ).

cnf(266,plain,
    $false,
    inference(binary,[status(thm)],[265,1]),
    [iquote('binary,265.1,1.1')] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.13  % Problem  : SYN583-1 : TPTP v8.1.0. Released v2.5.0.
% 0.13/0.13  % Command  : otter-tptp-script %s
% 0.13/0.35  % Computer : n022.cluster.edu
% 0.13/0.35  % Model    : x86_64 x86_64
% 0.13/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35  % Memory   : 8042.1875MB
% 0.13/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35  % CPULimit : 300
% 0.13/0.35  % WCLimit  : 300
% 0.13/0.35  % DateTime : Wed Jul 27 10:56:50 EDT 2022
% 0.13/0.35  % CPUTime  : 
% 1.83/1.99  ----- Otter 3.3f, August 2004 -----
% 1.83/1.99  The process was started by sandbox2 on n022.cluster.edu,
% 1.83/1.99  Wed Jul 27 10:56:50 2022
% 1.83/1.99  The command was "./otter".  The process ID is 21225.
% 1.83/1.99  
% 1.83/1.99  set(prolog_style_variables).
% 1.83/1.99  set(auto).
% 1.83/1.99     dependent: set(auto1).
% 1.83/1.99     dependent: set(process_input).
% 1.83/1.99     dependent: clear(print_kept).
% 1.83/1.99     dependent: clear(print_new_demod).
% 1.83/1.99     dependent: clear(print_back_demod).
% 1.83/1.99     dependent: clear(print_back_sub).
% 1.83/1.99     dependent: set(control_memory).
% 1.83/1.99     dependent: assign(max_mem, 12000).
% 1.83/1.99     dependent: assign(pick_given_ratio, 4).
% 1.83/1.99     dependent: assign(stats_level, 1).
% 1.83/1.99     dependent: assign(max_seconds, 10800).
% 1.83/1.99  clear(print_given).
% 1.83/1.99  
% 1.83/1.99  list(usable).
% 1.83/1.99  0 [] p7(X34,X34).
% 1.83/1.99  0 [] p2(X18,X18).
% 1.83/1.99  0 [] p5(X31,X31).
% 1.83/1.99  0 [] p2(c13,c18).
% 1.83/1.99  0 [] p2(c18,c14).
% 1.83/1.99  0 [] p2(f3(c18),f8(f9(c17))).
% 1.83/1.99  0 [] p11(f4(f6(c15,c13)),c16).
% 1.83/1.99  0 [] p11(f4(f6(c15,c14)),c16).
% 1.83/1.99  0 [] -p11(f4(f6(c15,c18)),c16).
% 1.83/1.99  0 [] p11(X11,X12)| -p12(X11,X12).
% 1.83/1.99  0 [] p11(X11,X12)| -p2(X11,X12).
% 1.83/1.99  0 [] p7(f9(X37),f9(X38))| -p7(X37,X38).
% 1.83/1.99  0 [] p2(f3(X21),f3(X22))| -p2(X21,X22).
% 1.83/1.99  0 [] p2(f4(X23),f4(X24))| -p2(X23,X24).
% 1.83/2.00  0 [] p2(f8(X29),f8(X30))| -p7(X29,X30).
% 1.83/2.00  0 [] p12(X11,X12)|p2(X11,X12)| -p11(X11,X12).
% 1.83/2.00  0 [] p7(X35,X36)| -p7(X34,X35)| -p7(X34,X36).
% 1.83/2.00  0 [] p2(X19,X20)| -p2(X18,X19)| -p2(X18,X20).
% 1.83/2.00  0 [] p5(X32,X33)| -p5(X31,X32)| -p5(X31,X33).
% 1.83/2.00  0 [] p10(c15,f3(X6),X6)| -p11(X6,c14)| -p11(c13,X6).
% 1.83/2.00  0 [] p11(X7,X8)| -p2(X9,X7)| -p2(X10,X8)| -p11(X9,X10).
% 1.83/2.00  0 [] p12(X14,X15)| -p2(X16,X14)| -p2(X17,X15)| -p12(X16,X17).
% 1.83/2.00  0 [] p2(f6(X25,X26),f6(X27,X28))| -p2(X26,X28)| -p5(X25,X27).
% 1.83/2.00  0 [] p10(X0,X1,X2)| -p5(X3,X0)| -p2(X5,X2)| -p2(X4,X1)| -p10(X3,X4,X5).
% 1.83/2.00  0 [] p11(f4(f6(c15,X13)),c16)| -p12(X13,c14)| -p12(c13,X13)| -p2(f3(X13),f8(f9(c17))).
% 1.83/2.00  end_of_list.
% 1.83/2.00  
% 1.83/2.00  SCAN INPUT: prop=0, horn=0, equality=0, symmetry=0, max_lits=5.
% 1.83/2.00  
% 1.83/2.00  This is a non-Horn set without equality.  The strategy will
% 1.83/2.00  be ordered hyper_res, unit deletion, and factoring, with
% 1.83/2.00  satellites in sos and with nuclei in usable.
% 1.83/2.00  
% 1.83/2.00     dependent: set(hyper_res).
% 1.83/2.00     dependent: set(factor).
% 1.83/2.00     dependent: set(unit_deletion).
% 1.83/2.00  
% 1.83/2.00  ------------> process usable:
% 1.83/2.00  ** KEPT (pick-wt=6): 1 [] -p11(f4(f6(c15,c18)),c16).
% 1.83/2.00  ** KEPT (pick-wt=6): 2 [] p11(A,B)| -p12(A,B).
% 1.83/2.00  ** KEPT (pick-wt=6): 3 [] p11(A,B)| -p2(A,B).
% 1.83/2.00  ** KEPT (pick-wt=8): 4 [] p7(f9(A),f9(B))| -p7(A,B).
% 1.83/2.00  ** KEPT (pick-wt=8): 5 [] p2(f3(A),f3(B))| -p2(A,B).
% 1.83/2.00  ** KEPT (pick-wt=8): 6 [] p2(f4(A),f4(B))| -p2(A,B).
% 1.83/2.00  ** KEPT (pick-wt=8): 7 [] p2(f8(A),f8(B))| -p7(A,B).
% 1.83/2.00  ** KEPT (pick-wt=9): 8 [] p12(A,B)|p2(A,B)| -p11(A,B).
% 1.83/2.00  ** KEPT (pick-wt=9): 9 [] p7(A,B)| -p7(C,A)| -p7(C,B).
% 1.83/2.00  ** KEPT (pick-wt=9): 10 [] p2(A,B)| -p2(C,A)| -p2(C,B).
% 1.83/2.00  ** KEPT (pick-wt=9): 11 [] p5(A,B)| -p5(C,A)| -p5(C,B).
% 1.83/2.00  ** KEPT (pick-wt=11): 12 [] p10(c15,f3(A),A)| -p11(A,c14)| -p11(c13,A).
% 1.83/2.00  ** KEPT (pick-wt=12): 13 [] p11(A,B)| -p2(C,A)| -p2(D,B)| -p11(C,D).
% 1.83/2.00  ** KEPT (pick-wt=12): 14 [] p12(A,B)| -p2(C,A)| -p2(D,B)| -p12(C,D).
% 1.83/2.00  ** KEPT (pick-wt=13): 15 [] p2(f6(A,B),f6(C,D))| -p2(B,D)| -p5(A,C).
% 1.83/2.00  ** KEPT (pick-wt=17): 16 [] p10(A,B,C)| -p5(D,A)| -p2(E,C)| -p2(F,B)| -p10(D,F,E).
% 1.83/2.00  ** KEPT (pick-wt=18): 17 [] p11(f4(f6(c15,A)),c16)| -p12(A,c14)| -p12(c13,A)| -p2(f3(A),f8(f9(c17))).
% 1.83/2.00  
% 1.83/2.00  ------------> process sos:
% 1.83/2.00  ** KEPT (pick-wt=3): 24 [] p7(A,A).
% 1.83/2.00  ** KEPT (pick-wt=3): 25 [] p2(A,A).
% 1.83/2.00  ** KEPT (pick-wt=3): 26 [] p5(A,A).
% 1.83/2.00  ** KEPT (pick-wt=3): 27 [] p2(c13,c18).
% 1.83/2.00  ** KEPT (pick-wt=3): 28 [] p2(c18,c14).
% 1.83/2.00  ** KEPT (pick-wt=6): 29 [] p2(f3(c18),f8(f9(c17))).
% 1.83/2.00  ** KEPT (pick-wt=6): 30 [] p11(f4(f6(c15,c13)),c16).
% 1.83/2.00  ** KEPT (pick-wt=6): 31 [] p11(f4(f6(c15,c14)),c16).
% 1.83/2.00  24 back subsumes 18.
% 1.83/2.00  25 back subsumes 19.
% 1.83/2.00  26 back subsumes 20.
% 1.83/2.00  
% 1.83/2.00  ======= end of input processing =======
% 1.83/2.00  
% 1.83/2.00  =========== start of search ===========
% 1.83/2.00  
% 1.83/2.00  -------- PROOF -------- 
% 1.83/2.00  
% 1.83/2.00  ----> UNIT CONFLICT at   0.02 sec ----> 266 [binary,265.1,1.1] $F.
% 1.83/2.00  
% 1.83/2.00  Length of proof is 3.  Level of proof is 3.
% 1.83/2.00  
% 1.83/2.00  ---------------- PROOF ----------------
% 1.83/2.00  % SZS status Unsatisfiable
% 1.83/2.00  % SZS output start Refutation
% See solution above
% 1.83/2.00  ------------ end of proof -------------
% 1.83/2.00  
% 1.83/2.00  
% 1.83/2.00  Search stopped by max_proofs option.
% 1.83/2.00  
% 1.83/2.00  
% 1.83/2.00  Search stopped by max_proofs option.
% 1.83/2.00  
% 1.83/2.00  ============ end of search ============
% 1.83/2.00  
% 1.83/2.00  -------------- statistics -------------
% 1.83/2.00  clauses given                 91
% 1.83/2.00  clauses generated           1170
% 1.83/2.00  clauses kept                 265
% 1.83/2.00  clauses forward subsumed     930
% 1.83/2.00  clauses back subsumed          4
% 1.83/2.00  Kbytes malloced             1953
% 1.83/2.00  
% 1.83/2.00  ----------- times (seconds) -----------
% 1.83/2.00  user CPU time          0.02          (0 hr, 0 min, 0 sec)
% 1.83/2.00  system CPU time        0.00          (0 hr, 0 min, 0 sec)
% 1.83/2.00  wall-clock time        2             (0 hr, 0 min, 2 sec)
% 1.83/2.00  
% 1.83/2.00  That finishes the proof of the theorem.
% 1.83/2.00  
% 1.83/2.00  Process 21225 finished Wed Jul 27 10:56:52 2022
% 1.83/2.00  Otter interrupted
% 1.83/2.00  PROOF FOUND
%------------------------------------------------------------------------------