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

View Problem - Process Solution

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

% Computer : n006.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:04:22 EDT 2022

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

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

cnf(2,axiom,
    ~ a_truth(implies(sk1,sk1)),
    file('LCL414-1.p',unknown),
    [] ).

cnf(3,axiom,
    a_truth(implies(A,implies(B,A))),
    file('LCL414-1.p',unknown),
    [] ).

cnf(4,axiom,
    a_truth(implies(implies(A,implies(B,C)),implies(implies(A,B),implies(A,C)))),
    file('LCL414-1.p',unknown),
    [] ).

cnf(5,axiom,
    a_truth(implies(implies(not(A),not(B)),implies(B,A))),
    file('LCL414-1.p',unknown),
    [] ).

cnf(8,plain,
    a_truth(implies(A,implies(implies(not(B),not(C)),implies(C,B)))),
    inference(hyper,[status(thm)],[5,1,3]),
    [iquote('hyper,5,1,3')] ).

cnf(15,plain,
    a_truth(implies(implies(A,B),implies(A,A))),
    inference(hyper,[status(thm)],[4,1,3]),
    [iquote('hyper,4,1,3')] ).

cnf(18,plain,
    a_truth(implies(A,A)),
    inference(hyper,[status(thm)],[15,1,8]),
    [iquote('hyper,15,1,8')] ).

cnf(19,plain,
    $false,
    inference(binary,[status(thm)],[18,2]),
    [iquote('binary,18.1,2.1')] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11  % Problem  : LCL414-1 : TPTP v8.1.0. Released v2.5.0.
% 0.03/0.12  % Command  : otter-tptp-script %s
% 0.12/0.33  % Computer : n006.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 09:14:16 EDT 2022
% 0.12/0.33  % CPUTime  : 
% 1.92/2.09  ----- Otter 3.3f, August 2004 -----
% 1.92/2.09  The process was started by sandbox on n006.cluster.edu,
% 1.92/2.09  Wed Jul 27 09:14:17 2022
% 1.92/2.09  The command was "./otter".  The process ID is 30891.
% 1.92/2.09  
% 1.92/2.09  set(prolog_style_variables).
% 1.92/2.09  set(auto).
% 1.92/2.09     dependent: set(auto1).
% 1.92/2.09     dependent: set(process_input).
% 1.92/2.09     dependent: clear(print_kept).
% 1.92/2.09     dependent: clear(print_new_demod).
% 1.92/2.09     dependent: clear(print_back_demod).
% 1.92/2.09     dependent: clear(print_back_sub).
% 1.92/2.09     dependent: set(control_memory).
% 1.92/2.09     dependent: assign(max_mem, 12000).
% 1.92/2.09     dependent: assign(pick_given_ratio, 4).
% 1.92/2.09     dependent: assign(stats_level, 1).
% 1.92/2.09     dependent: assign(max_seconds, 10800).
% 1.92/2.09  clear(print_given).
% 1.92/2.09  
% 1.92/2.09  list(usable).
% 1.92/2.09  0 [] a_truth(B)| -a_truth(A)| -a_truth(implies(A,B)).
% 1.92/2.09  0 [] a_truth(implies(A,implies(B,A))).
% 1.92/2.09  0 [] a_truth(implies(implies(A,implies(B,C)),implies(implies(A,B),implies(A,C)))).
% 1.92/2.09  0 [] a_truth(implies(implies(not(A),not(B)),implies(B,A))).
% 1.92/2.09  0 [] -a_truth(implies(sk1,sk1)).
% 1.92/2.09  end_of_list.
% 1.92/2.09  
% 1.92/2.09  SCAN INPUT: prop=0, horn=1, equality=0, symmetry=0, max_lits=3.
% 1.92/2.09  
% 1.92/2.09  This is a Horn set without equality.  The strategy will
% 1.92/2.09  be hyperresolution, with satellites in sos and nuclei
% 1.92/2.09  in usable.
% 1.92/2.09  
% 1.92/2.09     dependent: set(hyper_res).
% 1.92/2.09     dependent: clear(order_hyper).
% 1.92/2.09  
% 1.92/2.09  ------------> process usable:
% 1.92/2.09  ** KEPT (pick-wt=8): 1 [] a_truth(A)| -a_truth(B)| -a_truth(implies(B,A)).
% 1.92/2.09  ** KEPT (pick-wt=4): 2 [] -a_truth(implies(sk1,sk1)).
% 1.92/2.09  
% 1.92/2.09  ------------> process sos:
% 1.92/2.09  ** KEPT (pick-wt=6): 3 [] a_truth(implies(A,implies(B,A))).
% 1.92/2.09  ** KEPT (pick-wt=14): 4 [] a_truth(implies(implies(A,implies(B,C)),implies(implies(A,B),implies(A,C)))).
% 1.92/2.09  ** KEPT (pick-wt=10): 5 [] a_truth(implies(implies(not(A),not(B)),implies(B,A))).
% 1.92/2.09  
% 1.92/2.09  ======= end of input processing =======
% 1.92/2.09  
% 1.92/2.09  =========== start of search ===========
% 1.92/2.09  
% 1.92/2.09  -------- PROOF -------- 
% 1.92/2.09  
% 1.92/2.09  ----> UNIT CONFLICT at   0.00 sec ----> 19 [binary,18.1,2.1] $F.
% 1.92/2.09  
% 1.92/2.09  Length of proof is 3.  Level of proof is 2.
% 1.92/2.09  
% 1.92/2.09  ---------------- PROOF ----------------
% 1.92/2.09  % SZS status Unsatisfiable
% 1.92/2.09  % SZS output start Refutation
% See solution above
% 1.92/2.09  ------------ end of proof -------------
% 1.92/2.09  
% 1.92/2.09  
% 1.92/2.09  Search stopped by max_proofs option.
% 1.92/2.09  
% 1.92/2.09  
% 1.92/2.09  Search stopped by max_proofs option.
% 1.92/2.09  
% 1.92/2.09  ============ end of search ============
% 1.92/2.09  
% 1.92/2.09  -------------- statistics -------------
% 1.92/2.09  clauses given                  7
% 1.92/2.09  clauses generated             37
% 1.92/2.09  clauses kept                  18
% 1.92/2.09  clauses forward subsumed      24
% 1.92/2.09  clauses back subsumed          0
% 1.92/2.09  Kbytes malloced              976
% 1.92/2.09  
% 1.92/2.09  ----------- times (seconds) -----------
% 1.92/2.09  user CPU time          0.00          (0 hr, 0 min, 0 sec)
% 1.92/2.09  system CPU time        0.00          (0 hr, 0 min, 0 sec)
% 1.92/2.09  wall-clock time        1             (0 hr, 0 min, 1 sec)
% 1.92/2.09  
% 1.92/2.09  That finishes the proof of the theorem.
% 1.92/2.09  
% 1.92/2.09  Process 30891 finished Wed Jul 27 09:14:18 2022
% 1.92/2.09  Otter interrupted
% 1.92/2.09  PROOF FOUND
%------------------------------------------------------------------------------