↑ Up

Otter---3.3.UNS-Ref.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Otter---3.3
% Problem  : SYN560-1 : TPTP v8.1.0. Released v2.5.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : otter-tptp-script %s

% Computer : n027.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:54 EDT 2022

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

% Comments : 
%------------------------------------------------------------------------------
cnf(1,axiom,
    ~ p2(c9,f3(c10)),
    file('SYN560-1.p',unknown),
    [] ).

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

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

cnf(7,axiom,
    ~ p8(f6(c9,f4(c12)),f6(c9,f4(f4(f5(c12,c14))))),
    file('SYN560-1.p',unknown),
    [] ).

cnf(8,axiom,
    ( p8(A,B)
    | ~ p2(C,B)
    | ~ p8(D,C)
    | ~ p2(D,A) ),
    file('SYN560-1.p',unknown),
    [] ).

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

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

cnf(17,axiom,
    p2(f4(A),f5(A,f3(f7(c10)))),
    file('SYN560-1.p',unknown),
    [] ).

cnf(18,axiom,
    p8(f6(c9,f4(c12)),f6(c9,f4(f5(c12,c14)))),
    file('SYN560-1.p',unknown),
    [] ).

cnf(19,axiom,
    ( p2(A,f3(c10))
    | p8(f6(A,B),f6(A,f5(B,f3(f7(c10))))) ),
    file('SYN560-1.p',unknown),
    [] ).

cnf(61,plain,
    p2(f5(A,f3(f7(c10))),f4(A)),
    inference(hyper,[status(thm)],[17,5,15]),
    [iquote('hyper,17,5,15')] ).

cnf(279,plain,
    p2(f6(A,f5(B,f3(f7(c10)))),f6(A,f4(B))),
    inference(hyper,[status(thm)],[61,10,15]),
    [iquote('hyper,61,10,15')] ).

cnf(3203,plain,
    ( p8(f6(A,B),f6(A,f4(B)))
    | p2(A,f3(c10)) ),
    inference(hyper,[status(thm)],[279,8,19,15]),
    [iquote('hyper,279,8,19,15')] ).

cnf(3206,plain,
    $false,
    inference(unit_del,[status(thm)],[inference(hyper,[status(thm)],[3203,6,18]),1,7]),
    [iquote('hyper,3203,6,18,unit_del,1,7')] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem  : SYN560-1 : TPTP v8.1.0. Released v2.5.0.
% 0.07/0.13  % Command  : otter-tptp-script %s
% 0.13/0.34  % Computer : n027.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:18:37 EDT 2022
% 0.13/0.34  % CPUTime  : 
% 2.15/2.34  ----- Otter 3.3f, August 2004 -----
% 2.15/2.34  The process was started by sandbox on n027.cluster.edu,
% 2.15/2.34  Wed Jul 27 11:18:37 2022
% 2.15/2.34  The command was "./otter".  The process ID is 30667.
% 2.15/2.34  
% 2.15/2.34  set(prolog_style_variables).
% 2.15/2.34  set(auto).
% 2.15/2.34     dependent: set(auto1).
% 2.15/2.34     dependent: set(process_input).
% 2.15/2.34     dependent: clear(print_kept).
% 2.15/2.34     dependent: clear(print_new_demod).
% 2.15/2.34     dependent: clear(print_back_demod).
% 2.15/2.34     dependent: clear(print_back_sub).
% 2.15/2.34     dependent: set(control_memory).
% 2.15/2.34     dependent: assign(max_mem, 12000).
% 2.15/2.34     dependent: assign(pick_given_ratio, 4).
% 2.15/2.34     dependent: assign(stats_level, 1).
% 2.15/2.34     dependent: assign(max_seconds, 10800).
% 2.15/2.34  clear(print_given).
% 2.15/2.34  
% 2.15/2.34  list(usable).
% 2.15/2.34  0 [] p2(X0,X0).
% 2.15/2.34  0 [] -p2(c9,f3(c10)).
% 2.15/2.34  0 [] p2(c11,f4(f5(c12,c13))).
% 2.15/2.34  0 [] p2(f4(X9),f5(X9,f3(f7(c10)))).
% 2.15/2.34  0 [] p2(f7(X18),f7(X19))| -p2(X18,X19).
% 2.15/2.34  0 [] p2(f3(X5),f3(X6))| -p2(X5,X6).
% 2.15/2.34  0 [] p2(f4(X7),f4(X8))| -p2(X7,X8).
% 2.15/2.34  0 [] p2(X1,X2)| -p2(X0,X1)| -p2(X0,X2).
% 2.15/2.34  0 [] p8(X24,X25)| -p8(X24,X26)| -p8(X26,X25).
% 2.15/2.34  0 [] p8(f6(c9,f4(c12)),f6(c9,f4(f5(c12,c14)))).
% 2.15/2.34  0 [] -p8(f6(c9,f4(c12)),f6(c9,f4(f4(f5(c12,c14))))).
% 2.15/2.34  0 [] p8(X20,X21)| -p2(X23,X21)| -p8(X22,X23)| -p2(X22,X20).
% 2.15/2.34  0 [] p2(f5(X10,X11),f5(X12,X13))| -p2(X10,X12)| -p2(X11,X13).
% 2.15/2.34  0 [] p2(f6(X14,X15),f6(X16,X17))| -p2(X15,X17)| -p2(X14,X16).
% 2.15/2.34  0 [] p2(X3,f3(c10))|p8(f6(X3,X4),f6(X3,f5(X4,f3(f7(c10))))).
% 2.15/2.34  end_of_list.
% 2.15/2.34  
% 2.15/2.34  SCAN INPUT: prop=0, horn=0, equality=0, symmetry=0, max_lits=4.
% 2.15/2.34  
% 2.15/2.34  This is a non-Horn set without equality.  The strategy will
% 2.15/2.34  be ordered hyper_res, unit deletion, and factoring, with
% 2.15/2.34  satellites in sos and with nuclei in usable.
% 2.15/2.34  
% 2.15/2.34     dependent: set(hyper_res).
% 2.15/2.34     dependent: set(factor).
% 2.15/2.34     dependent: set(unit_deletion).
% 2.15/2.34  
% 2.15/2.34  ------------> process usable:
% 2.15/2.34  ** KEPT (pick-wt=4): 1 [] -p2(c9,f3(c10)).
% 2.15/2.34  ** KEPT (pick-wt=8): 2 [] p2(f7(A),f7(B))| -p2(A,B).
% 2.15/2.34  ** KEPT (pick-wt=8): 3 [] p2(f3(A),f3(B))| -p2(A,B).
% 2.15/2.34  ** KEPT (pick-wt=8): 4 [] p2(f4(A),f4(B))| -p2(A,B).
% 2.15/2.34  ** KEPT (pick-wt=9): 5 [] p2(A,B)| -p2(C,A)| -p2(C,B).
% 2.15/2.34  ** KEPT (pick-wt=9): 6 [] p8(A,B)| -p8(A,C)| -p8(C,B).
% 2.15/2.34  ** KEPT (pick-wt=12): 7 [] -p8(f6(c9,f4(c12)),f6(c9,f4(f4(f5(c12,c14))))).
% 2.15/2.34  ** KEPT (pick-wt=12): 8 [] p8(A,B)| -p2(C,B)| -p8(D,C)| -p2(D,A).
% 2.15/2.34  ** KEPT (pick-wt=13): 9 [] p2(f5(A,B),f5(C,D))| -p2(A,C)| -p2(B,D).
% 2.15/2.34  ** KEPT (pick-wt=13): 10 [] p2(f6(A,B),f6(C,D))| -p2(B,D)| -p2(A,C).
% 2.15/2.34  
% 2.15/2.34  ------------> process sos:
% 2.15/2.34  ** KEPT (pick-wt=3): 15 [] p2(A,A).
% 2.15/2.34  ** KEPT (pick-wt=6): 16 [] p2(c11,f4(f5(c12,c13))).
% 2.15/2.34  ** KEPT (pick-wt=8): 17 [] p2(f4(A),f5(A,f3(f7(c10)))).
% 2.15/2.34  ** KEPT (pick-wt=11): 18 [] p8(f6(c9,f4(c12)),f6(c9,f4(f5(c12,c14)))).
% 2.15/2.34  ** KEPT (pick-wt=15): 19 [] p2(A,f3(c10))|p8(f6(A,B),f6(A,f5(B,f3(f7(c10))))).
% 2.15/2.34  15 back subsumes 11.
% 2.15/2.34  
% 2.15/2.34  ======= end of input processing =======
% 2.15/2.34  
% 2.15/2.34  =========== start of search ===========
% 2.15/2.34  
% 2.15/2.34  
% 2.15/2.34  Resetting weight limit to 14.
% 2.15/2.34  
% 2.15/2.34  
% 2.15/2.34  Resetting weight limit to 14.
% 2.15/2.34  
% 2.15/2.34  sos_size=3003
% 2.15/2.34  
% 2.15/2.34  
% 2.15/2.34  Resetting weight limit to 13.
% 2.15/2.34  
% 2.15/2.34  
% 2.15/2.34  Resetting weight limit to 13.
% 2.15/2.34  
% 2.15/2.34  sos_size=3083
% 2.15/2.34  
% 2.15/2.34  -------- PROOF -------- 
% 2.15/2.34  
% 2.15/2.34  -----> EMPTY CLAUSE at   0.40 sec ----> 3206 [hyper,3203,6,18,unit_del,1,7] $F.
% 2.15/2.34  
% 2.15/2.34  Length of proof is 3.  Level of proof is 3.
% 2.15/2.34  
% 2.15/2.34  ---------------- PROOF ----------------
% 2.15/2.34  % SZS status Unsatisfiable
% 2.15/2.34  % SZS output start Refutation
% See solution above
% 2.15/2.34  ------------ end of proof -------------
% 2.15/2.34  
% 2.15/2.34  
% 2.15/2.34  Search stopped by max_proofs option.
% 2.15/2.34  
% 2.15/2.34  
% 2.15/2.34  Search stopped by max_proofs option.
% 2.15/2.34  
% 2.15/2.34  ============ end of search ============
% 2.15/2.34  
% 2.15/2.34  -------------- statistics -------------
% 2.15/2.34  clauses given                229
% 2.15/2.34  clauses generated         106614
% 2.15/2.34  clauses kept                3205
% 2.15/2.34  clauses forward subsumed     934
% 2.15/2.34  clauses back subsumed         27
% 2.15/2.34  Kbytes malloced             6835
% 2.15/2.34  
% 2.15/2.34  ----------- times (seconds) -----------
% 2.15/2.34  user CPU time          0.40          (0 hr, 0 min, 0 sec)
% 2.15/2.34  system CPU time        0.01          (0 hr, 0 min, 0 sec)
% 2.15/2.34  wall-clock time        2             (0 hr, 0 min, 2 sec)
% 2.15/2.34  
% 2.15/2.34  That finishes the proof of the theorem.
% 2.15/2.34  
% 2.15/2.34  Process 30667 finished Wed Jul 27 11:18:39 2022
% 2.15/2.34  Otter interrupted
% 2.15/2.34  PROOF FOUND
%------------------------------------------------------------------------------