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 : n018.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:23 EDT 2022

% Result   : Theorem 1.55s 1.77s
% Output   : Refutation 1.55s
% 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(implies(A,B))
    | ~ a_truth(A)
    | a_truth(B) ),
    file('LCL414+1.p',unknown),
    [] ).

cnf(2,axiom,
    ~ a_truth(implies(dollar_c1,dollar_c1)),
    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(16,plain,
    a_truth(implies(implies(A,B),implies(A,A))),
    inference(hyper,[status(thm)],[4,1,3]),
    [iquote('hyper,4,1,3')] ).

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

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

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