↑ Up

Otter---3.3.UNS-Ref.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Otter---3.3
% Problem  : SYN594-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:58 EDT 2022

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

% Comments : 
%------------------------------------------------------------------------------
cnf(2,axiom,
    ( p15(A,B)
    | ~ p14(A,B) ),
    file('SYN594-1.p',unknown),
    [] ).

cnf(9,axiom,
    ( p14(A,B)
    | p2(A,B)
    | ~ p15(A,B) ),
    file('SYN594-1.p',unknown),
    [] ).

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

cnf(12,axiom,
    ~ p2(c19,f6(f3(f4(f5(c17))),f13(c16,f3(f5(c17))))),
    file('SYN594-1.p',unknown),
    [] ).

cnf(21,axiom,
    ( ~ p14(A,f3(f4(f5(c17))))
    | ~ p15(B,f6(f3(f4(f5(c17))),c16))
    | ~ p14(f6(f3(f4(f5(c17))),f13(c16,f3(f5(c17)))),B)
    | ~ p7(c20,f8(f10(f12(f11(f3(f5(c17)))),A),f8(f10(f11(f3(f4(f5(c17)))),C),f9(f11(B),f10(f11(f3(f4(f5(c17)))),c22))))) ),
    file('SYN594-1.p',unknown),
    [] ).

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

cnf(33,axiom,
    p14(c18,f3(f4(f5(c17)))),
    file('SYN594-1.p',unknown),
    [] ).

cnf(34,axiom,
    p14(c19,f6(f3(f4(f5(c17))),c16)),
    file('SYN594-1.p',unknown),
    [] ).

cnf(35,axiom,
    p15(f6(f3(f4(f5(c17))),f13(c16,f3(f5(c17)))),c19),
    file('SYN594-1.p',unknown),
    [] ).

cnf(36,axiom,
    p7(c20,f8(f10(f12(f11(f3(f5(c17)))),c18),f8(f10(f11(f3(f4(f5(c17)))),c21),f9(f11(c19),f10(f11(f3(f4(f5(c17)))),c22))))),
    file('SYN594-1.p',unknown),
    [] ).

cnf(38,plain,
    p15(c19,f6(f3(f4(f5(c17))),c16)),
    inference(hyper,[status(thm)],[34,2]),
    [iquote('hyper,34,2')] ).

cnf(39,plain,
    ( p14(f6(f3(f4(f5(c17))),f13(c16,f3(f5(c17)))),c19)
    | p2(f6(f3(f4(f5(c17))),f13(c16,f3(f5(c17)))),c19) ),
    inference(hyper,[status(thm)],[35,9]),
    [iquote('hyper,35,9')] ).

cnf(48,plain,
    p14(f6(f3(f4(f5(c17))),f13(c16,f3(f5(c17)))),c19),
    inference(unit_del,[status(thm)],[inference(hyper,[status(thm)],[39,11,31]),12]),
    [iquote('hyper,39,11,31,unit_del,12')] ).

cnf(51,plain,
    $false,
    inference(hyper,[status(thm)],[36,21,33,38,48]),
    [iquote('hyper,36,21,33,38,48')] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.11  % Problem  : SYN594-1 : TPTP v8.1.0. Released v2.5.0.
% 0.07/0.12  % Command  : otter-tptp-script %s
% 0.12/0.33  % Computer : n027.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 11:27:07 EDT 2022
% 0.12/0.33  % CPUTime  : 
% 1.37/1.80  ----- Otter 3.3f, August 2004 -----
% 1.37/1.80  The process was started by sandbox2 on n027.cluster.edu,
% 1.37/1.80  Wed Jul 27 11:27:07 2022
% 1.37/1.80  The command was "./otter".  The process ID is 9931.
% 1.37/1.80  
% 1.37/1.80  set(prolog_style_variables).
% 1.37/1.80  set(auto).
% 1.37/1.80     dependent: set(auto1).
% 1.37/1.80     dependent: set(process_input).
% 1.37/1.80     dependent: clear(print_kept).
% 1.37/1.80     dependent: clear(print_new_demod).
% 1.37/1.80     dependent: clear(print_back_demod).
% 1.37/1.80     dependent: clear(print_back_sub).
% 1.37/1.80     dependent: set(control_memory).
% 1.37/1.80     dependent: assign(max_mem, 12000).
% 1.37/1.80     dependent: assign(pick_given_ratio, 4).
% 1.37/1.80     dependent: assign(stats_level, 1).
% 1.37/1.80     dependent: assign(max_seconds, 10800).
% 1.37/1.80  clear(print_given).
% 1.37/1.80  
% 1.37/1.80  list(usable).
% 1.37/1.80  0 [] p2(X10,X10).
% 1.37/1.80  0 [] p7(X27,X27).
% 1.37/1.80  0 [] -p2(c16,f3(c17)).
% 1.37/1.80  0 [] p14(c18,f3(f4(f5(c17)))).
% 1.37/1.80  0 [] p15(X4,X5)| -p14(X4,X5).
% 1.37/1.80  0 [] -p14(X4,X5)| -p2(X4,X5).
% 1.37/1.80  0 [] p14(c19,f6(f3(f4(f5(c17))),c16)).
% 1.37/1.80  0 [] p7(f12(X36),f12(X37))| -p7(X36,X37).
% 1.37/1.80  0 [] p2(f3(X17),f3(X18))| -p2(X17,X18).
% 1.37/1.80  0 [] p2(f4(X19),f4(X20))| -p2(X19,X20).
% 1.37/1.80  0 [] p2(f5(X21),f5(X22))| -p2(X21,X22).
% 1.37/1.80  0 [] p7(f11(X34),f11(X35))| -p2(X34,X35).
% 1.37/1.80  0 [] p14(X4,X5)|p2(X4,X5)| -p15(X4,X5).
% 1.37/1.80  0 [] p7(X28,X29)| -p7(X27,X28)| -p7(X27,X29).
% 1.37/1.80  0 [] p2(X11,X12)| -p2(X10,X11)| -p2(X10,X12).
% 1.37/1.80  0 [] p15(f6(f3(f4(f5(c17))),f13(c16,f3(f5(c17)))),c19).
% 1.37/1.80  0 [] -p2(c19,f6(f3(f4(f5(c17))),f13(c16,f3(f5(c17))))).
% 1.37/1.80  0 [] p14(X0,X1)| -p2(X2,X0)| -p2(X3,X1)| -p14(X2,X3).
% 1.37/1.80  0 [] p15(X6,X7)| -p2(X8,X6)| -p2(X9,X7)| -p15(X8,X9).
% 1.37/1.80  0 [] p2(f13(X13,X14),f13(X15,X16))| -p2(X13,X15)| -p2(X14,X16).
% 1.37/1.80  0 [] p7(f9(X42,X43),f9(X44,X45))| -p7(X42,X44)| -p7(X43,X45).
% 1.37/1.80  0 [] p7(f8(X38,X39),f8(X40,X41))| -p7(X38,X40)| -p7(X39,X41).
% 1.37/1.80  0 [] p7(f10(X30,X31),f10(X32,X33))| -p2(X31,X33)| -p7(X30,X32).
% 1.37/1.80  0 [] p2(f6(X23,X24),f6(X25,X26))| -p2(X23,X25)| -p2(X24,X26).
% 1.37/1.80  0 [] p7(c20,f8(f10(f12(f11(f3(f5(c17)))),c18),f8(f10(f11(f3(f4(f5(c17)))),c21),f9(f11(c19),f10(f11(f3(f4(f5(c17)))),c22))))).
% 1.37/1.80  0 [] -p2(X48,f3(c17))| -p14(X46,f3(f4(f5(c17))))| -p15(X47,f6(f3(f4(f5(c17))),c16))| -p7(c20,f8(f10(f12(f11(f3(f5(c17)))),X46),f8(f10(f11(f3(f4(f5(c17)))),X48),f9(f11(X47),f10(f11(f3(f4(f5(c17)))),c22))))).
% 1.37/1.80  0 [] -p14(X46,f3(f4(f5(c17))))| -p15(X47,f6(f3(f4(f5(c17))),c16))| -p14(f6(f3(f4(f5(c17))),f13(c16,f3(f5(c17)))),X47)| -p7(c20,f8(f10(f12(f11(f3(f5(c17)))),X46),f8(f10(f11(f3(f4(f5(c17)))),X48),f9(f11(X47),f10(f11(f3(f4(f5(c17)))),c22))))).
% 1.37/1.80  end_of_list.
% 1.37/1.80  
% 1.37/1.80  SCAN INPUT: prop=0, horn=0, equality=0, symmetry=0, max_lits=4.
% 1.37/1.80  
% 1.37/1.80  This is a non-Horn set without equality.  The strategy will
% 1.37/1.80  be ordered hyper_res, unit deletion, and factoring, with
% 1.37/1.80  satellites in sos and with nuclei in usable.
% 1.37/1.80  
% 1.37/1.80     dependent: set(hyper_res).
% 1.37/1.80     dependent: set(factor).
% 1.37/1.80     dependent: set(unit_deletion).
% 1.37/1.80  
% 1.37/1.80  ------------> process usable:
% 1.37/1.80  ** KEPT (pick-wt=4): 1 [] -p2(c16,f3(c17)).
% 1.37/1.80  ** KEPT (pick-wt=6): 2 [] p15(A,B)| -p14(A,B).
% 1.37/1.80  ** KEPT (pick-wt=6): 3 [] -p14(A,B)| -p2(A,B).
% 1.37/1.80  ** KEPT (pick-wt=8): 4 [] p7(f12(A),f12(B))| -p7(A,B).
% 1.37/1.80  ** KEPT (pick-wt=8): 5 [] p2(f3(A),f3(B))| -p2(A,B).
% 1.37/1.80  ** KEPT (pick-wt=8): 6 [] p2(f4(A),f4(B))| -p2(A,B).
% 1.37/1.80  ** KEPT (pick-wt=8): 7 [] p2(f5(A),f5(B))| -p2(A,B).
% 1.37/1.80  ** KEPT (pick-wt=8): 8 [] p7(f11(A),f11(B))| -p2(A,B).
% 1.37/1.80  ** KEPT (pick-wt=9): 9 [] p14(A,B)|p2(A,B)| -p15(A,B).
% 1.37/1.80  ** KEPT (pick-wt=9): 10 [] p7(A,B)| -p7(C,A)| -p7(C,B).
% 1.37/1.80  ** KEPT (pick-wt=9): 11 [] p2(A,B)| -p2(C,A)| -p2(C,B).
% 1.37/1.80  ** KEPT (pick-wt=12): 12 [] -p2(c19,f6(f3(f4(f5(c17))),f13(c16,f3(f5(c17))))).
% 1.37/1.80  ** KEPT (pick-wt=12): 13 [] p14(A,B)| -p2(C,A)| -p2(D,B)| -p14(C,D).
% 1.37/1.80  ** KEPT (pick-wt=12): 14 [] p15(A,B)| -p2(C,A)| -p2(D,B)| -p15(C,D).
% 1.37/1.80  ** KEPT (pick-wt=13): 15 [] p2(f13(A,B),f13(C,D))| -p2(A,C)| -p2(B,D).
% 1.37/1.80  ** KEPT (pick-wt=13): 16 [] p7(f9(A,B),f9(C,D))| -p7(A,C)| -p7(B,D).
% 1.37/1.80  ** KEPT (pick-wt=13): 17 [] p7(f8(A,B),f8(C,D))| -p7(A,C)| -p7(B,D).
% 1.37/1.80  ** KEPT (pick-wt=13): 18 [] p7(f10(A,B),f10(C,D))| -p2(B,D)| -p7(A,C).
% 1.37/1.80  ** KEPT (pick-wt=13): 19 [] p2(f6(A,B),f6(C,D))| -p2(A,C)| -p2(B,D).
% 1.37/1.80  ** KEPT (pick-wt=46): 20 [] -p2(A,f3(c17))| -p14(B,f3(f4(f5(c17))))| -p15(C,f6(f3(f4(f5(c17))),c16))| -p7(c20,f8(f10(f12(f11(f3(f5(c17)))),B),f8(f10(f11(f3(f4(f5(c17)))),A),f9(f11(C),f10(f11(f3(f4(f5(c17)))),c22))))).
% 1.37/1.80  ** KEPT (pick-wt=54): 21 [] -p14(A,f3(f4(f5(c17))))| -p15(B,f6(f3(f4(f5(c17))),c16))| -p14(f6(f3(f4(f5(c17))),f13(c16,f3(f5(c17)))),B)| -p7(c20,f8(f10(f12(f11(f3(f5(c17)))),A),f8(f10(f11(f3(f4(f5(c17)))),C),f9(f11(B),f10(f11(f3(f4(f5(c17)))),c22))))).
% 1.37/1.80  
% 1.37/1.80  ------------> process sos:
% 1.37/1.80  ** KEPT (pick-wt=3): 31 [] p2(A,A).
% 1.37/1.80  ** KEPT (pick-wt=3): 32 [] p7(A,A).
% 1.37/1.80  ** KEPT (pick-wt=6): 33 [] p14(c18,f3(f4(f5(c17)))).
% 1.37/1.80  ** KEPT (pick-wt=8): 34 [] p14(c19,f6(f3(f4(f5(c17))),c16)).
% 1.37/1.80  ** KEPT (pick-wt=12): 35 [] p15(f6(f3(f4(f5(c17))),f13(c16,f3(f5(c17)))),c19).
% 1.37/1.80  ** KEPT (pick-wt=28): 36 [] p7(c20,f8(f10(f12(f11(f3(f5(c17)))),c18),f8(f10(f11(f3(f4(f5(c17)))),c21),f9(f11(c19),f10(f11(f3(f4(f5(c17)))),c22))))).
% 1.37/1.80  31 back subsumes 23.
% 1.37/1.80  32 back subsumes 22.
% 1.37/1.80  
% 1.37/1.80  ======= end of input processing =======
% 1.37/1.80  
% 1.37/1.80  =========== start of search ===========
% 1.37/1.80  
% 1.37/1.80  -------- PROOF -------- 
% 1.37/1.80  
% 1.37/1.80  -----> EMPTY CLAUSE at   0.00 sec ----> 51 [hyper,36,21,33,38,48] $F.
% 1.37/1.80  
% 1.37/1.80  Length of proof is 3.  Level of proof is 2.
% 1.37/1.80  
% 1.37/1.80  ---------------- PROOF ----------------
% 1.37/1.80  % SZS status Unsatisfiable
% 1.37/1.80  % SZS output start Refutation
% See solution above
% 1.37/1.80  ------------ end of proof -------------
% 1.37/1.80  
% 1.37/1.80  
% 1.37/1.80  Search stopped by max_proofs option.
% 1.37/1.80  
% 1.37/1.80  
% 1.37/1.80  Search stopped by max_proofs option.
% 1.37/1.80  
% 1.37/1.80  ============ end of search ============
% 1.37/1.80  
% 1.37/1.80  -------------- statistics -------------
% 1.37/1.80  clauses given                 10
% 1.37/1.80  clauses generated             66
% 1.37/1.80  clauses kept                  50
% 1.37/1.80  clauses forward subsumed      42
% 1.37/1.80  clauses back subsumed         11
% 1.37/1.80  Kbytes malloced             1953
% 1.37/1.80  
% 1.37/1.80  ----------- times (seconds) -----------
% 1.37/1.80  user CPU time          0.00          (0 hr, 0 min, 0 sec)
% 1.37/1.80  system CPU time        0.00          (0 hr, 0 min, 0 sec)
% 1.37/1.80  wall-clock time        1             (0 hr, 0 min, 1 sec)
% 1.37/1.80  
% 1.37/1.80  That finishes the proof of the theorem.
% 1.37/1.80  
% 1.37/1.80  Process 9931 finished Wed Jul 27 11:27:08 2022
% 1.37/1.80  Otter interrupted
% 1.37/1.80  PROOF FOUND
%------------------------------------------------------------------------------