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

View Problem - Process Solution

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

% Computer : n015.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:56 EDT 2022

% Result   : Unsatisfiable 2.22s 2.40s
% Output   : Refutation 2.22s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    7
%            Number of leaves      :   14
% Syntax   : Number of clauses     :   27 (  21 unt;   0 nHn;   8 RR)
%            Number of literals    :   39 (   0 equ;  13 neg)
%            Maximal clause size   :    4 (   1 avg)
%            Maximal term depth    :    6 (   2 avg)
%            Number of predicates  :    4 (   3 usr;   1 prp; 0-2 aty)
%            Number of functors    :   10 (  10 usr;   3 con; 0-2 aty)
%            Number of variables   :   50 (   0 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(4,axiom,
    ( p4(f10(A),f10(B))
    | ~ p2(A,B) ),
    file('SYN572-1.p',unknown),
    [] ).

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

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

cnf(9,axiom,
    ~ p12(f10(c14),f11(f10(f3(c14,c15)),f10(c15))),
    file('SYN572-1.p',unknown),
    [] ).

cnf(10,axiom,
    ( p12(A,B)
    | ~ p4(C,A)
    | ~ p4(D,B)
    | ~ p12(C,D) ),
    file('SYN572-1.p',unknown),
    [] ).

cnf(11,axiom,
    ( p4(f11(A,B),f11(C,D))
    | ~ p4(A,C)
    | ~ p4(B,D) ),
    file('SYN572-1.p',unknown),
    [] ).

cnf(12,axiom,
    ( p2(f3(A,B),f3(C,D))
    | ~ p2(A,C)
    | ~ p2(B,D) ),
    file('SYN572-1.p',unknown),
    [] ).

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

cnf(15,axiom,
    p4(A,A),
    file('SYN572-1.p',unknown),
    [] ).

cnf(16,axiom,
    p4(f10(f9(A)),f10(A)),
    file('SYN572-1.p',unknown),
    [] ).

cnf(17,axiom,
    p2(f3(A,f5(f7(f8(c13)))),A),
    file('SYN572-1.p',unknown),
    [] ).

cnf(18,axiom,
    p2(f3(A,f9(A)),f5(f7(f8(c13)))),
    file('SYN572-1.p',unknown),
    [] ).

cnf(19,axiom,
    p12(f10(f3(A,B)),f11(f10(A),f10(B))),
    file('SYN572-1.p',unknown),
    [] ).

cnf(20,axiom,
    p2(f3(A,f3(B,C)),f3(f3(A,B),C)),
    file('SYN572-1.p',unknown),
    [] ).

cnf(24,plain,
    p4(f10(A),f10(f9(A))),
    inference(hyper,[status(thm)],[16,8,15]),
    [iquote('hyper,16,8,15')] ).

cnf(31,plain,
    p4(f10(A),f10(f9(f9(A)))),
    inference(hyper,[status(thm)],[24,8,16]),
    [iquote('hyper,24,8,16')] ).

cnf(43,plain,
    p4(f11(A,f10(B)),f11(A,f10(f9(f9(B))))),
    inference(hyper,[status(thm)],[31,11,15]),
    [iquote('hyper,31,11,15')] ).

cnf(48,plain,
    p4(f10(f9(f9(f9(A)))),f10(A)),
    inference(hyper,[status(thm)],[31,8,16]),
    [iquote('hyper,31,8,16')] ).

cnf(87,plain,
    p2(f5(f7(f8(c13))),f3(A,f9(A))),
    inference(hyper,[status(thm)],[18,6,13]),
    [iquote('hyper,18,6,13')] ).

cnf(131,plain,
    p4(f11(A,f10(f9(f9(f9(B))))),f11(A,f10(B))),
    inference(hyper,[status(thm)],[48,11,15]),
    [iquote('hyper,48,11,15')] ).

cnf(227,plain,
    p2(f3(A,f5(f7(f8(c13)))),f3(A,f3(B,f9(B)))),
    inference(hyper,[status(thm)],[87,12,13]),
    [iquote('hyper,87,12,13')] ).

cnf(1130,plain,
    p12(f10(f3(A,B)),f11(f10(A),f10(f9(f9(B))))),
    inference(hyper,[status(thm)],[43,10,15,19]),
    [iquote('hyper,43,10,15,19')] ).

cnf(3531,plain,
    p2(f3(A,f3(B,f9(B))),A),
    inference(hyper,[status(thm)],[227,6,17]),
    [iquote('hyper,227,6,17')] ).

cnf(3543,plain,
    p2(f3(f3(A,B),f9(B)),A),
    inference(hyper,[status(thm)],[3531,6,20]),
    [iquote('hyper,3531,6,20')] ).

cnf(3566,plain,
    p4(f10(f3(f3(A,B),f9(B))),f10(A)),
    inference(hyper,[status(thm)],[3543,4]),
    [iquote('hyper,3543,4')] ).

cnf(3634,plain,
    p12(f10(A),f11(f10(f3(A,B)),f10(B))),
    inference(hyper,[status(thm)],[3566,10,131,1130]),
    [iquote('hyper,3566,10,131,1130')] ).

cnf(3635,plain,
    $false,
    inference(binary,[status(thm)],[3634,9]),
    [iquote('binary,3634.1,9.1')] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem  : SYN572-1 : TPTP v8.1.0. Released v2.5.0.
% 0.03/0.13  % Command  : otter-tptp-script %s
% 0.13/0.34  % Computer : n015.cluster.edu
% 0.13/0.34  % Model    : x86_64 x86_64
% 0.13/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34  % Memory   : 8042.1875MB
% 0.13/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34  % CPULimit : 300
% 0.13/0.34  % WCLimit  : 300
% 0.13/0.34  % DateTime : Wed Jul 27 11:32:12 EDT 2022
% 0.13/0.34  % CPUTime  : 
% 2.22/2.40  ----- Otter 3.3f, August 2004 -----
% 2.22/2.40  The process was started by sandbox2 on n015.cluster.edu,
% 2.22/2.40  Wed Jul 27 11:32:12 2022
% 2.22/2.40  The command was "./otter".  The process ID is 3637.
% 2.22/2.40  
% 2.22/2.40  set(prolog_style_variables).
% 2.22/2.40  set(auto).
% 2.22/2.40     dependent: set(auto1).
% 2.22/2.40     dependent: set(process_input).
% 2.22/2.40     dependent: clear(print_kept).
% 2.22/2.40     dependent: clear(print_new_demod).
% 2.22/2.40     dependent: clear(print_back_demod).
% 2.22/2.40     dependent: clear(print_back_sub).
% 2.22/2.40     dependent: set(control_memory).
% 2.22/2.40     dependent: assign(max_mem, 12000).
% 2.22/2.40     dependent: assign(pick_given_ratio, 4).
% 2.22/2.40     dependent: assign(stats_level, 1).
% 2.22/2.40     dependent: assign(max_seconds, 10800).
% 2.22/2.40  clear(print_given).
% 2.22/2.40  
% 2.22/2.40  list(usable).
% 2.22/2.40  0 [] p2(X6,X6).
% 2.22/2.40  0 [] p6(X34,X34).
% 2.22/2.40  0 [] p4(X22,X22).
% 2.22/2.40  0 [] p4(f10(f9(X27)),f10(X27)).
% 2.22/2.40  0 [] p2(f3(X13,f5(f7(f8(c13)))),X13).
% 2.22/2.40  0 [] p6(f8(X37),f8(X38))| -p6(X37,X38).
% 2.22/2.40  0 [] p2(f5(X18),f5(X19))| -p4(X18,X19).
% 2.22/2.40  0 [] p2(f9(X20),f9(X21))| -p2(X20,X21).
% 2.22/2.40  0 [] p4(f10(X25),f10(X26))| -p2(X25,X26).
% 2.22/2.40  0 [] p4(f7(X32),f7(X33))| -p6(X32,X33).
% 2.22/2.40  0 [] p2(f3(X14,f9(X14)),f5(f7(f8(c13)))).
% 2.22/2.40  0 [] p2(X7,X8)| -p2(X6,X7)| -p2(X6,X8).
% 2.22/2.40  0 [] p6(X35,X36)| -p6(X34,X35)| -p6(X34,X36).
% 2.22/2.40  0 [] p4(X23,X24)| -p4(X22,X23)| -p4(X22,X24).
% 2.22/2.40  0 [] p12(f10(f3(X4,X5)),f11(f10(X4),f10(X5))).
% 2.22/2.40  0 [] -p12(f10(c14),f11(f10(f3(c14,c15)),f10(c15))).
% 2.22/2.40  0 [] p2(f3(X15,f3(X16,X17)),f3(f3(X15,X16),X17)).
% 2.22/2.40  0 [] p12(X0,X1)| -p4(X2,X0)| -p4(X3,X1)| -p12(X2,X3).
% 2.22/2.40  0 [] p4(f11(X28,X29),f11(X30,X31))| -p4(X28,X30)| -p4(X29,X31).
% 2.22/2.40  0 [] p2(f3(X9,X10),f3(X11,X12))| -p2(X9,X11)| -p2(X10,X12).
% 2.22/2.40  end_of_list.
% 2.22/2.40  
% 2.22/2.40  SCAN INPUT: prop=0, horn=1, equality=0, symmetry=0, max_lits=4.
% 2.22/2.40  
% 2.22/2.40  This is a Horn set without equality.  The strategy will
% 2.22/2.40  be hyperresolution, with satellites in sos and nuclei
% 2.22/2.40  in usable.
% 2.22/2.40  
% 2.22/2.40     dependent: set(hyper_res).
% 2.22/2.40     dependent: clear(order_hyper).
% 2.22/2.40  
% 2.22/2.40  ------------> process usable:
% 2.22/2.40  ** KEPT (pick-wt=8): 1 [] p6(f8(A),f8(B))| -p6(A,B).
% 2.22/2.40  ** KEPT (pick-wt=8): 2 [] p2(f5(A),f5(B))| -p4(A,B).
% 2.22/2.40  ** KEPT (pick-wt=8): 3 [] p2(f9(A),f9(B))| -p2(A,B).
% 2.22/2.40  ** KEPT (pick-wt=8): 4 [] p4(f10(A),f10(B))| -p2(A,B).
% 2.22/2.40  ** KEPT (pick-wt=8): 5 [] p4(f7(A),f7(B))| -p6(A,B).
% 2.22/2.40  ** KEPT (pick-wt=9): 6 [] p2(A,B)| -p2(C,A)| -p2(C,B).
% 2.22/2.40  ** KEPT (pick-wt=9): 7 [] p6(A,B)| -p6(C,A)| -p6(C,B).
% 2.22/2.40  ** KEPT (pick-wt=9): 8 [] p4(A,B)| -p4(C,A)| -p4(C,B).
% 2.22/2.40  ** KEPT (pick-wt=10): 9 [] -p12(f10(c14),f11(f10(f3(c14,c15)),f10(c15))).
% 2.22/2.40  ** KEPT (pick-wt=12): 10 [] p12(A,B)| -p4(C,A)| -p4(D,B)| -p12(C,D).
% 2.22/2.40  ** KEPT (pick-wt=13): 11 [] p4(f11(A,B),f11(C,D))| -p4(A,C)| -p4(B,D).
% 2.22/2.40  ** KEPT (pick-wt=13): 12 [] p2(f3(A,B),f3(C,D))| -p2(A,C)| -p2(B,D).
% 2.22/2.40  
% 2.22/2.40  ------------> process sos:
% 2.22/2.40  ** KEPT (pick-wt=3): 13 [] p2(A,A).
% 2.22/2.40  ** KEPT (pick-wt=3): 14 [] p6(A,A).
% 2.22/2.40  ** KEPT (pick-wt=3): 15 [] p4(A,A).
% 2.22/2.40  ** KEPT (pick-wt=6): 16 [] p4(f10(f9(A)),f10(A)).
% 2.22/2.40  ** KEPT (pick-wt=8): 17 [] p2(f3(A,f5(f7(f8(c13)))),A).
% 2.22/2.40  ** KEPT (pick-wt=9): 18 [] p2(f3(A,f9(A)),f5(f7(f8(c13)))).
% 2.22/2.40  ** KEPT (pick-wt=10): 19 [] p12(f10(f3(A,B)),f11(f10(A),f10(B))).
% 2.22/2.40  ** KEPT (pick-wt=11): 20 [] p2(f3(A,f3(B,C)),f3(f3(A,B),C)).
% 2.22/2.40  
% 2.22/2.40  ======= end of input processing =======
% 2.22/2.40  
% 2.22/2.40  =========== start of search ===========
% 2.22/2.40  
% 2.22/2.40  
% 2.22/2.40  Resetting weight limit to 13.
% 2.22/2.40  
% 2.22/2.40  
% 2.22/2.40  Resetting weight limit to 13.
% 2.22/2.40  
% 2.22/2.40  sos_size=3374
% 2.22/2.40  
% 2.22/2.40  -------- PROOF -------- 
% 2.22/2.40  
% 2.22/2.40  ----> UNIT CONFLICT at   0.26 sec ----> 3635 [binary,3634.1,9.1] $F.
% 2.22/2.40  
% 2.22/2.40  Length of proof is 12.  Level of proof is 6.
% 2.22/2.40  
% 2.22/2.40  ---------------- PROOF ----------------
% 2.22/2.40  % SZS status Unsatisfiable
% 2.22/2.40  % SZS output start Refutation
% See solution above
% 2.22/2.40  ------------ end of proof -------------
% 2.22/2.40  
% 2.22/2.40  
% 2.22/2.40  Search stopped by max_proofs option.
% 2.22/2.40  
% 2.22/2.40  
% 2.22/2.40  Search stopped by max_proofs option.
% 2.22/2.40  
% 2.22/2.40  ============ end of search ============
% 2.22/2.40  
% 2.22/2.40  -------------- statistics -------------
% 2.22/2.40  clauses given                228
% 2.22/2.40  clauses generated          50655
% 2.22/2.40  clauses kept                3634
% 2.22/2.40  clauses forward subsumed    4418
% 2.22/2.40  clauses back subsumed         32
% 2.22/2.40  Kbytes malloced             4882
% 2.22/2.40  
% 2.22/2.40  ----------- times (seconds) -----------
% 2.22/2.40  user CPU time          0.26          (0 hr, 0 min, 0 sec)
% 2.22/2.40  system CPU time        0.00          (0 hr, 0 min, 0 sec)
% 2.22/2.40  wall-clock time        2             (0 hr, 0 min, 2 sec)
% 2.22/2.40  
% 2.22/2.40  That finishes the proof of the theorem.
% 2.22/2.40  
% 2.22/2.40  Process 3637 finished Wed Jul 27 11:32:14 2022
% 2.22/2.40  Otter interrupted
% 2.22/2.40  PROOF FOUND
%------------------------------------------------------------------------------