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

View Problem - Process Solution

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

% Computer : n009.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:53 EDT 2022

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

% Comments : 
%------------------------------------------------------------------------------
cnf(3,axiom,
    ( p2(A,B)
    | ~ p2(A,C)
    | ~ p2(C,B) ),
    file('SYN553-1.p',unknown),
    [] ).

cnf(4,axiom,
    ( p2(f8(A,B),f8(C,D))
    | ~ p2(A,C)
    | ~ p2(B,D) ),
    file('SYN553-1.p',unknown),
    [] ).

cnf(5,axiom,
    ~ p2(f8(f8(f9(c4),c4),f9(c3)),f8(f9(c4),f8(f9(c3),c4))),
    file('SYN553-1.p',unknown),
    [] ).

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

cnf(8,axiom,
    p2(f8(A,B),f8(B,A)),
    file('SYN553-1.p',unknown),
    [] ).

cnf(9,axiom,
    p2(f8(A,f8(B,C)),f8(f8(A,B),C)),
    file('SYN553-1.p',unknown),
    [] ).

cnf(15,plain,
    p2(f8(A,f8(B,C)),f8(A,f8(C,B))),
    inference(hyper,[status(thm)],[8,4,6]),
    [iquote('hyper,8,4,6')] ).

cnf(50,plain,
    p2(f8(A,f8(B,C)),f8(C,f8(A,B))),
    inference(hyper,[status(thm)],[9,3,8]),
    [iquote('hyper,9,3,8')] ).

cnf(169,plain,
    p2(f8(f8(A,B),C),f8(C,f8(B,A))),
    inference(hyper,[status(thm)],[15,3,8]),
    [iquote('hyper,15,3,8')] ).

cnf(2969,plain,
    p2(f8(f8(A,B),C),f8(A,f8(C,B))),
    inference(hyper,[status(thm)],[169,3,50]),
    [iquote('hyper,169,3,50')] ).

cnf(2970,plain,
    $false,
    inference(binary,[status(thm)],[2969,5]),
    [iquote('binary,2969.1,5.1')] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem  : SYN553-1 : TPTP v8.1.0. Released v2.5.0.
% 0.07/0.12  % Command  : otter-tptp-script %s
% 0.13/0.33  % Computer : n009.cluster.edu
% 0.13/0.33  % Model    : x86_64 x86_64
% 0.13/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33  % Memory   : 8042.1875MB
% 0.13/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33  % CPULimit : 300
% 0.13/0.33  % WCLimit  : 300
% 0.13/0.33  % DateTime : Wed Jul 27 10:56:51 EDT 2022
% 0.13/0.33  % CPUTime  : 
% 1.90/2.10  ----- Otter 3.3f, August 2004 -----
% 1.90/2.10  The process was started by sandbox2 on n009.cluster.edu,
% 1.90/2.10  Wed Jul 27 10:56:51 2022
% 1.90/2.10  The command was "./otter".  The process ID is 32337.
% 1.90/2.10  
% 1.90/2.10  set(prolog_style_variables).
% 1.90/2.10  set(auto).
% 1.90/2.10     dependent: set(auto1).
% 1.90/2.10     dependent: set(process_input).
% 1.90/2.10     dependent: clear(print_kept).
% 1.90/2.10     dependent: clear(print_new_demod).
% 1.90/2.10     dependent: clear(print_back_demod).
% 1.90/2.10     dependent: clear(print_back_sub).
% 1.90/2.10     dependent: set(control_memory).
% 1.90/2.10     dependent: assign(max_mem, 12000).
% 1.90/2.10     dependent: assign(pick_given_ratio, 4).
% 1.90/2.10     dependent: assign(stats_level, 1).
% 1.90/2.10     dependent: assign(max_seconds, 10800).
% 1.90/2.10  clear(print_given).
% 1.90/2.10  
% 1.90/2.10  list(usable).
% 1.90/2.10  0 [] p2(X0,X0).
% 1.90/2.10  0 [] p2(c3,c4).
% 1.90/2.10  0 [] -p2(c4,f5(f6(c7))).
% 1.90/2.10  0 [] -p2(c3,f5(f6(c7))).
% 1.90/2.10  0 [] p2(f8(X11,X12),f8(X12,X11)).
% 1.90/2.10  0 [] p2(X1,X2)| -p2(X1,X3)| -p2(X3,X2).
% 1.90/2.10  0 [] p2(f8(X8,f8(X9,X10)),f8(f8(X8,X9),X10)).
% 1.90/2.10  0 [] p2(f8(X4,X5),f8(X6,X7))| -p2(X4,X6)| -p2(X5,X7).
% 1.90/2.10  0 [] -p2(f8(f8(f9(c4),c4),f9(c3)),f8(f9(c4),f8(f9(c3),c4))).
% 1.90/2.10  end_of_list.
% 1.90/2.10  
% 1.90/2.10  SCAN INPUT: prop=0, horn=1, equality=0, symmetry=0, max_lits=3.
% 1.90/2.10  
% 1.90/2.10  This is a Horn set without equality.  The strategy will
% 1.90/2.10  be hyperresolution, with satellites in sos and nuclei
% 1.90/2.10  in usable.
% 1.90/2.10  
% 1.90/2.10     dependent: set(hyper_res).
% 1.90/2.10     dependent: clear(order_hyper).
% 1.90/2.10  
% 1.90/2.10  ------------> process usable:
% 1.90/2.10  ** KEPT (pick-wt=5): 1 [] -p2(c4,f5(f6(c7))).
% 1.90/2.10  ** KEPT (pick-wt=5): 2 [] -p2(c3,f5(f6(c7))).
% 1.90/2.10  ** KEPT (pick-wt=9): 3 [] p2(A,B)| -p2(A,C)| -p2(C,B).
% 1.90/2.10  ** KEPT (pick-wt=13): 4 [] p2(f8(A,B),f8(C,D))| -p2(A,C)| -p2(B,D).
% 1.90/2.10  ** KEPT (pick-wt=15): 5 [] -p2(f8(f8(f9(c4),c4),f9(c3)),f8(f9(c4),f8(f9(c3),c4))).
% 1.90/2.10  
% 1.90/2.10  ------------> process sos:
% 1.90/2.10  ** KEPT (pick-wt=3): 6 [] p2(A,A).
% 1.90/2.10  ** KEPT (pick-wt=3): 7 [] p2(c3,c4).
% 1.90/2.10  ** KEPT (pick-wt=7): 8 [] p2(f8(A,B),f8(B,A)).
% 1.90/2.10  ** KEPT (pick-wt=11): 9 [] p2(f8(A,f8(B,C)),f8(f8(A,B),C)).
% 1.90/2.10  
% 1.90/2.10  ======= end of input processing =======
% 1.90/2.10  
% 1.90/2.10  =========== start of search ===========
% 1.90/2.10  
% 1.90/2.10  -------- PROOF -------- 
% 1.90/2.10  
% 1.90/2.10  ----> UNIT CONFLICT at   0.20 sec ----> 2970 [binary,2969.1,5.1] $F.
% 1.90/2.10  
% 1.90/2.10  Length of proof is 4.  Level of proof is 3.
% 1.90/2.10  
% 1.90/2.10  ---------------- PROOF ----------------
% 1.90/2.10  % SZS status Unsatisfiable
% 1.90/2.10  % SZS output start Refutation
% See solution above
% 1.90/2.10  ------------ end of proof -------------
% 1.90/2.10  
% 1.90/2.10  
% 1.90/2.10  Search stopped by max_proofs option.
% 1.90/2.10  
% 1.90/2.10  
% 1.90/2.10  Search stopped by max_proofs option.
% 1.90/2.10  
% 1.90/2.10  ============ end of search ============
% 1.90/2.10  
% 1.90/2.10  -------------- statistics -------------
% 1.90/2.10  clauses given                 52
% 1.90/2.10  clauses generated           3787
% 1.90/2.10  clauses kept                2969
% 1.90/2.10  clauses forward subsumed     827
% 1.90/2.10  clauses back subsumed          0
% 1.90/2.10  Kbytes malloced             1953
% 1.90/2.10  
% 1.90/2.10  ----------- times (seconds) -----------
% 1.90/2.10  user CPU time          0.20          (0 hr, 0 min, 0 sec)
% 1.90/2.10  system CPU time        0.00          (0 hr, 0 min, 0 sec)
% 1.90/2.10  wall-clock time        2             (0 hr, 0 min, 2 sec)
% 1.90/2.10  
% 1.90/2.10  That finishes the proof of the theorem.
% 1.90/2.10  
% 1.90/2.10  Process 32337 finished Wed Jul 27 10:56:53 2022
% 1.90/2.10  Otter interrupted
% 1.90/2.10  PROOF FOUND
%------------------------------------------------------------------------------