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

View Problem - Process Solution

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

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

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

% Comments : 
%------------------------------------------------------------------------------
cnf(1,axiom,
    ~ p11(f9(c13),f9(c14)),
    file('SYN568-1.p',unknown),
    [] ).

cnf(2,axiom,
    ( ~ p10(A,B)
    | ~ p11(B,A) ),
    file('SYN568-1.p',unknown),
    [] ).

cnf(3,axiom,
    ~ p3(f6(f7(f8(c12))),f6(c12)),
    file('SYN568-1.p',unknown),
    [] ).

cnf(15,axiom,
    ( p3(A,f6(c12))
    | p10(f4(B,A),f4(C,A))
    | ~ p10(B,C)
    | ~ p11(f5(f6(c12)),B) ),
    file('SYN568-1.p',unknown),
    [] ).

cnf(23,axiom,
    p11(f5(f6(c12)),f9(A)),
    file('SYN568-1.p',unknown),
    [] ).

cnf(24,axiom,
    ( p10(A,B)
    | p11(B,A) ),
    file('SYN568-1.p',unknown),
    [] ).

cnf(25,axiom,
    p11(f4(f9(c13),f6(f7(f8(c12)))),f4(f9(c14),f6(f7(f8(c12))))),
    file('SYN568-1.p',unknown),
    [] ).

cnf(30,plain,
    p10(f9(c14),f9(c13)),
    inference(hyper,[status(thm)],[24,1]),
    [iquote('hyper,24,1')] ).

cnf(32,plain,
    ( p3(A,f6(c12))
    | p10(f4(f9(c14),A),f4(f9(c13),A)) ),
    inference(hyper,[status(thm)],[30,15,23]),
    [iquote('hyper,30,15,23')] ).

cnf(41,plain,
    p10(f4(f9(c14),f6(f7(f8(c12)))),f4(f9(c13),f6(f7(f8(c12))))),
    inference(hyper,[status(thm)],[32,3]),
    [iquote('hyper,32,3')] ).

cnf(108,plain,
    $false,
    inference(hyper,[status(thm)],[41,2,25]),
    [iquote('hyper,41,2,25')] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem  : SYN568-1 : TPTP v8.1.0. Released v2.5.0.
% 0.07/0.12  % Command  : otter-tptp-script %s
% 0.14/0.33  % Computer : n026.cluster.edu
% 0.14/0.33  % Model    : x86_64 x86_64
% 0.14/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.33  % Memory   : 8042.1875MB
% 0.14/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.33  % CPULimit : 300
% 0.14/0.33  % WCLimit  : 300
% 0.14/0.33  % DateTime : Wed Jul 27 11:33:24 EDT 2022
% 0.14/0.33  % CPUTime  : 
% 1.96/2.14  ----- Otter 3.3f, August 2004 -----
% 1.96/2.14  The process was started by sandbox2 on n026.cluster.edu,
% 1.96/2.14  Wed Jul 27 11:33:24 2022
% 1.96/2.14  The command was "./otter".  The process ID is 20415.
% 1.96/2.14  
% 1.96/2.14  set(prolog_style_variables).
% 1.96/2.14  set(auto).
% 1.96/2.14     dependent: set(auto1).
% 1.96/2.14     dependent: set(process_input).
% 1.96/2.14     dependent: clear(print_kept).
% 1.96/2.14     dependent: clear(print_new_demod).
% 1.96/2.14     dependent: clear(print_back_demod).
% 1.96/2.14     dependent: clear(print_back_sub).
% 1.96/2.14     dependent: set(control_memory).
% 1.96/2.14     dependent: assign(max_mem, 12000).
% 1.96/2.14     dependent: assign(pick_given_ratio, 4).
% 1.96/2.14     dependent: assign(stats_level, 1).
% 1.96/2.14     dependent: assign(max_seconds, 10800).
% 1.96/2.14  clear(print_given).
% 1.96/2.14  
% 1.96/2.14  list(usable).
% 1.96/2.14  0 [] p2(X17,X17).
% 1.96/2.14  0 [] p3(X28,X28).
% 1.96/2.14  0 [] -p11(f9(c13),f9(c14)).
% 1.96/2.14  0 [] p11(f5(f6(c12)),f9(X16)).
% 1.96/2.14  0 [] p10(X4,X5)|p11(X5,X4).
% 1.96/2.14  0 [] -p10(X4,X5)| -p11(X5,X4).
% 1.96/2.14  0 [] -p3(f6(f7(f8(c12))),f6(c12)).
% 1.96/2.14  0 [] p3(f8(X35),f8(X36))| -p3(X35,X36).
% 1.96/2.14  0 [] p2(f5(X24),f5(X25))| -p3(X24,X25).
% 1.96/2.14  0 [] p2(f9(X26),f9(X27))| -p2(X26,X27).
% 1.96/2.14  0 [] p3(f6(X31),f6(X32))| -p3(X31,X32).
% 1.96/2.14  0 [] p3(f7(X33),f7(X34))| -p3(X33,X34).
% 1.96/2.14  0 [] p2(X18,X19)| -p2(X17,X18)| -p2(X17,X19).
% 1.96/2.14  0 [] p3(X29,X30)| -p3(X28,X29)| -p3(X28,X30).
% 1.96/2.14  0 [] p10(X0,X1)| -p2(X2,X0)| -p2(X3,X1)| -p10(X2,X3).
% 1.96/2.14  0 [] p11(X9,X10)| -p2(X11,X9)| -p2(X12,X10)| -p11(X11,X12).
% 1.96/2.14  0 [] p2(f4(X20,X21),f4(X22,X23))| -p2(X20,X22)| -p3(X21,X23).
% 1.96/2.14  0 [] p11(f4(f9(c13),f6(f7(f8(c12)))),f4(f9(c14),f6(f7(f8(c12))))).
% 1.96/2.14  0 [] p11(f4(X13,X14),f4(X15,X14))| -p11(X13,X15)| -p11(f5(f6(c12)),X13).
% 1.96/2.14  0 [] p3(X7,f6(c12))|p10(f4(X6,X7),f4(X8,X7))| -p10(X6,X8)| -p11(f5(f6(c12)),X6).
% 1.96/2.14  end_of_list.
% 1.96/2.14  
% 1.96/2.14  SCAN INPUT: prop=0, horn=0, equality=0, symmetry=0, max_lits=4.
% 1.96/2.14  
% 1.96/2.14  This is a non-Horn set without equality.  The strategy will
% 1.96/2.14  be ordered hyper_res, unit deletion, and factoring, with
% 1.96/2.14  satellites in sos and with nuclei in usable.
% 1.96/2.14  
% 1.96/2.14     dependent: set(hyper_res).
% 1.96/2.14     dependent: set(factor).
% 1.96/2.14     dependent: set(unit_deletion).
% 1.96/2.14  
% 1.96/2.14  ------------> process usable:
% 1.96/2.14  ** KEPT (pick-wt=5): 1 [] -p11(f9(c13),f9(c14)).
% 1.96/2.14  ** KEPT (pick-wt=6): 2 [] -p10(A,B)| -p11(B,A).
% 1.96/2.14  ** KEPT (pick-wt=7): 3 [] -p3(f6(f7(f8(c12))),f6(c12)).
% 1.96/2.14  ** KEPT (pick-wt=8): 4 [] p3(f8(A),f8(B))| -p3(A,B).
% 1.96/2.14  ** KEPT (pick-wt=8): 5 [] p2(f5(A),f5(B))| -p3(A,B).
% 1.96/2.14  ** KEPT (pick-wt=8): 6 [] p2(f9(A),f9(B))| -p2(A,B).
% 1.96/2.14  ** KEPT (pick-wt=8): 7 [] p3(f6(A),f6(B))| -p3(A,B).
% 1.96/2.14  ** KEPT (pick-wt=8): 8 [] p3(f7(A),f7(B))| -p3(A,B).
% 1.96/2.14  ** KEPT (pick-wt=9): 9 [] p2(A,B)| -p2(C,A)| -p2(C,B).
% 1.96/2.14  ** KEPT (pick-wt=9): 10 [] p3(A,B)| -p3(C,A)| -p3(C,B).
% 1.96/2.14  ** KEPT (pick-wt=12): 11 [] p10(A,B)| -p2(C,A)| -p2(D,B)| -p10(C,D).
% 1.96/2.14  ** KEPT (pick-wt=12): 12 [] p11(A,B)| -p2(C,A)| -p2(D,B)| -p11(C,D).
% 1.96/2.14  ** KEPT (pick-wt=13): 13 [] p2(f4(A,B),f4(C,D))| -p2(A,C)| -p3(B,D).
% 1.96/2.14  ** KEPT (pick-wt=15): 14 [] p11(f4(A,B),f4(C,B))| -p11(A,C)| -p11(f5(f6(c12)),A).
% 1.96/2.14  ** KEPT (pick-wt=19): 15 [] p3(A,f6(c12))|p10(f4(B,A),f4(C,A))| -p10(B,C)| -p11(f5(f6(c12)),B).
% 1.96/2.14  
% 1.96/2.14  ------------> process sos:
% 1.96/2.14  ** KEPT (pick-wt=3): 21 [] p2(A,A).
% 1.96/2.14  ** KEPT (pick-wt=3): 22 [] p3(A,A).
% 1.96/2.14  ** KEPT (pick-wt=6): 23 [] p11(f5(f6(c12)),f9(A)).
% 1.96/2.14  ** KEPT (pick-wt=6): 24 [] p10(A,B)|p11(B,A).
% 1.96/2.14  ** KEPT (pick-wt=15): 25 [] p11(f4(f9(c13),f6(f7(f8(c12)))),f4(f9(c14),f6(f7(f8(c12))))).
% 1.96/2.14  21 back subsumes 16.
% 1.96/2.14  22 back subsumes 17.
% 1.96/2.14  
% 1.96/2.14  ======= end of input processing =======
% 1.96/2.14  
% 1.96/2.14  =========== start of search ===========
% 1.96/2.14  
% 1.96/2.14  -------- PROOF -------- 
% 1.96/2.14  
% 1.96/2.14  -----> EMPTY CLAUSE at   0.00 sec ----> 108 [hyper,41,2,25] $F.
% 1.96/2.14  
% 1.96/2.14  Length of proof is 3.  Level of proof is 3.
% 1.96/2.14  
% 1.96/2.14  ---------------- PROOF ----------------
% 1.96/2.14  % SZS status Unsatisfiable
% 1.96/2.14  % SZS output start Refutation
% See solution above
% 1.96/2.14  ------------ end of proof -------------
% 1.96/2.14  
% 1.96/2.14  
% 1.96/2.14  Search stopped by max_proofs option.
% 1.96/2.14  
% 1.96/2.14  
% 1.96/2.14  Search stopped by max_proofs option.
% 1.96/2.14  
% 1.96/2.14  ============ end of search ============
% 1.96/2.14  
% 1.96/2.14  -------------- statistics -------------
% 1.96/2.14  clauses given                 19
% 1.96/2.14  clauses generated            159
% 1.96/2.14  clauses kept                 107
% 1.96/2.14  clauses forward subsumed      71
% 1.96/2.14  clauses back subsumed          3
% 1.96/2.14  Kbytes malloced              976
% 1.96/2.14  
% 1.96/2.14  ----------- times (seconds) -----------
% 1.96/2.14  user CPU time          0.00          (0 hr, 0 min, 0 sec)
% 1.96/2.14  system CPU time        0.00          (0 hr, 0 min, 0 sec)
% 1.96/2.14  wall-clock time        2             (0 hr, 0 min, 2 sec)
% 1.96/2.14  
% 1.96/2.14  That finishes the proof of the theorem.
% 1.96/2.14  
% 1.96/2.14  Process 20415 finished Wed Jul 27 11:33:26 2022
% 1.96/2.14  Otter interrupted
% 1.96/2.14  PROOF FOUND
%------------------------------------------------------------------------------