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

View Problem - Process Solution

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

% Computer : n014.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:25:12 EDT 2022

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

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

cnf(2,axiom,
    ( q(A,B)
    | ~ q(A,C)
    | ~ q(C,B) ),
    file('SYN726-1.p',unknown),
    [] ).

cnf(3,axiom,
    ( q(A,B)
    | ~ q(B,A) ),
    file('SYN726-1.p',unknown),
    [] ).

cnf(4,axiom,
    ~ p(sk1,sk2),
    file('SYN726-1.p',unknown),
    [] ).

cnf(5,axiom,
    ~ q(sk3,sk4),
    file('SYN726-1.p',unknown),
    [] ).

cnf(6,axiom,
    ( p(A,B)
    | q(A,B) ),
    file('SYN726-1.p',unknown),
    [] ).

cnf(7,plain,
    p(sk3,sk4),
    inference(hyper,[status(thm)],[6,5]),
    [iquote('hyper,6,5')] ).

cnf(8,plain,
    ( p(A,B)
    | q(B,A) ),
    inference(hyper,[status(thm)],[6,3]),
    [iquote('hyper,6,3')] ).

cnf(10,plain,
    p(sk4,sk3),
    inference(hyper,[status(thm)],[8,5]),
    [iquote('hyper,8,5')] ).

cnf(12,plain,
    ( p(A,B)
    | q(C,A)
    | p(C,B) ),
    inference(hyper,[status(thm)],[8,2,6]),
    [iquote('hyper,8,2,6')] ).

cnf(13,plain,
    ( p(A,B)
    | q(B,C)
    | p(A,C) ),
    inference(hyper,[status(thm)],[8,2,6]),
    [iquote('hyper,8,2,6')] ).

cnf(36,plain,
    ( p(sk4,A)
    | p(sk3,A) ),
    inference(hyper,[status(thm)],[12,5]),
    [iquote('hyper,12,5')] ).

cnf(44,plain,
    ( p(A,sk3)
    | p(A,sk4) ),
    inference(hyper,[status(thm)],[13,5]),
    [iquote('hyper,13,5')] ).

cnf(54,plain,
    p(sk3,A),
    inference(factor_simp,[status(thm)],[inference(hyper,[status(thm)],[36,1,7])]),
    [iquote('hyper,36,1,7,factor_simp')] ).

cnf(56,plain,
    p(sk4,A),
    inference(factor_simp,[status(thm)],[inference(hyper,[status(thm)],[36,1,10])]),
    [iquote('hyper,36,1,10,factor_simp')] ).

cnf(57,plain,
    p(A,sk4),
    inference(factor_simp,[status(thm)],[inference(hyper,[status(thm)],[44,1,54])]),
    [iquote('hyper,44,1,54,factor_simp')] ).

cnf(70,plain,
    p(A,B),
    inference(hyper,[status(thm)],[57,1,56]),
    [iquote('hyper,57,1,56')] ).

cnf(71,plain,
    $false,
    inference(binary,[status(thm)],[70,4]),
    [iquote('binary,70.1,4.1')] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11  % Problem  : SYN726-1 : TPTP v8.1.0. Released v2.5.0.
% 0.03/0.12  % Command  : otter-tptp-script %s
% 0.12/0.32  % Computer : n014.cluster.edu
% 0.12/0.32  % Model    : x86_64 x86_64
% 0.12/0.32  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.32  % Memory   : 8042.1875MB
% 0.12/0.32  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.32  % CPULimit : 300
% 0.12/0.32  % WCLimit  : 300
% 0.12/0.32  % DateTime : Wed Jul 27 11:14:39 EDT 2022
% 0.12/0.32  % CPUTime  : 
% 1.51/1.75  ----- Otter 3.3f, August 2004 -----
% 1.51/1.75  The process was started by sandbox on n014.cluster.edu,
% 1.51/1.75  Wed Jul 27 11:14:39 2022
% 1.51/1.75  The command was "./otter".  The process ID is 25501.
% 1.51/1.75  
% 1.51/1.75  set(prolog_style_variables).
% 1.51/1.75  set(auto).
% 1.51/1.75     dependent: set(auto1).
% 1.51/1.75     dependent: set(process_input).
% 1.51/1.75     dependent: clear(print_kept).
% 1.51/1.75     dependent: clear(print_new_demod).
% 1.51/1.75     dependent: clear(print_back_demod).
% 1.51/1.75     dependent: clear(print_back_sub).
% 1.51/1.75     dependent: set(control_memory).
% 1.51/1.75     dependent: assign(max_mem, 12000).
% 1.51/1.75     dependent: assign(pick_given_ratio, 4).
% 1.51/1.75     dependent: assign(stats_level, 1).
% 1.51/1.75     dependent: assign(max_seconds, 10800).
% 1.51/1.75  clear(print_given).
% 1.51/1.75  
% 1.51/1.75  list(usable).
% 1.51/1.75  0 [] p(A,C)| -p(A,B)| -p(B,C).
% 1.51/1.75  0 [] q(A,C)| -q(A,B)| -q(B,C).
% 1.51/1.75  0 [] q(B,A)| -q(A,B).
% 1.51/1.75  0 [] p(A,B)|q(A,B).
% 1.51/1.75  0 [] -p(sk1,sk2).
% 1.51/1.75  0 [] -q(sk3,sk4).
% 1.51/1.75  end_of_list.
% 1.51/1.75  
% 1.51/1.75  SCAN INPUT: prop=0, horn=0, equality=0, symmetry=0, max_lits=3.
% 1.51/1.75  
% 1.51/1.75  This is a non-Horn set without equality.  The strategy will
% 1.51/1.75  be ordered hyper_res, unit deletion, and factoring, with
% 1.51/1.75  satellites in sos and with nuclei in usable.
% 1.51/1.75  
% 1.51/1.75     dependent: set(hyper_res).
% 1.51/1.75     dependent: set(factor).
% 1.51/1.75     dependent: set(unit_deletion).
% 1.51/1.75  
% 1.51/1.75  ------------> process usable:
% 1.51/1.75  ** KEPT (pick-wt=9): 1 [] p(A,B)| -p(A,C)| -p(C,B).
% 1.51/1.75  ** KEPT (pick-wt=9): 2 [] q(A,B)| -q(A,C)| -q(C,B).
% 1.51/1.75  ** KEPT (pick-wt=6): 3 [] q(A,B)| -q(B,A).
% 1.51/1.75  ** KEPT (pick-wt=3): 4 [] -p(sk1,sk2).
% 1.51/1.75  ** KEPT (pick-wt=3): 5 [] -q(sk3,sk4).
% 1.51/1.75  
% 1.51/1.75  ------------> process sos:
% 1.51/1.75  ** KEPT (pick-wt=6): 6 [] p(A,B)|q(A,B).
% 1.51/1.75  
% 1.51/1.75  ======= end of input processing =======
% 1.51/1.75  
% 1.51/1.75  =========== start of search ===========
% 1.51/1.75  
% 1.51/1.75  -------- PROOF -------- 
% 1.51/1.75  
% 1.51/1.75  ----> UNIT CONFLICT at   0.04 sec ----> 71 [binary,70.1,4.1] $F.
% 1.51/1.75  
% 1.51/1.75  Length of proof is 11.  Level of proof is 6.
% 1.51/1.75  
% 1.51/1.75  ---------------- PROOF ----------------
% 1.51/1.75  % SZS status Unsatisfiable
% 1.51/1.75  % SZS output start Refutation
% See solution above
% 1.51/1.75  ------------ end of proof -------------
% 1.51/1.75  
% 1.51/1.75  
% 1.51/1.75  Search stopped by max_proofs option.
% 1.51/1.75  
% 1.51/1.75  
% 1.51/1.75  Search stopped by max_proofs option.
% 1.51/1.75  
% 1.51/1.75  ============ end of search ============
% 1.51/1.75  
% 1.51/1.75  -------------- statistics -------------
% 1.51/1.75  clauses given                 22
% 1.51/1.75  clauses generated            618
% 1.51/1.75  clauses kept                  70
% 1.51/1.75  clauses forward subsumed     552
% 1.51/1.75  clauses back subsumed         17
% 1.51/1.75  Kbytes malloced              976
% 1.51/1.75  
% 1.51/1.75  ----------- times (seconds) -----------
% 1.51/1.75  user CPU time          0.04          (0 hr, 0 min, 0 sec)
% 1.51/1.75  system CPU time        0.00          (0 hr, 0 min, 0 sec)
% 1.51/1.75  wall-clock time        1             (0 hr, 0 min, 1 sec)
% 1.51/1.75  
% 1.51/1.75  That finishes the proof of the theorem.
% 1.51/1.75  
% 1.51/1.75  Process 25501 finished Wed Jul 27 11:14:40 2022
% 1.51/1.75  Otter interrupted
% 1.51/1.75  PROOF FOUND
%------------------------------------------------------------------------------