TSTP Solution File: LCL678+1.001 by Otter---3.3

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Otter---3.3
% Problem  : LCL678+1.001 : TPTP v8.1.0. Released v4.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : otter-tptp-script %s

% Computer : n004.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:05:06 EDT 2022

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

% Comments : 
%------------------------------------------------------------------------------
cnf(3,axiom,
    ( ~ r1(dollar_c1,A)
    | r1(dollar_f2(A),dollar_f1(A)) ),
    file('LCL678+1.001.p',unknown),
    [] ).

cnf(4,axiom,
    ( ~ r1(dollar_c1,A)
    | ~ p1(dollar_f1(A)) ),
    file('LCL678+1.001.p',unknown),
    [] ).

cnf(5,axiom,
    ( ~ r1(dollar_c1,A)
    | ~ r1(dollar_f2(A),B)
    | p1(B) ),
    file('LCL678+1.001.p',unknown),
    [] ).

cnf(6,axiom,
    r1(A,A),
    file('LCL678+1.001.p',unknown),
    [] ).

cnf(8,plain,
    r1(dollar_f2(dollar_c1),dollar_f1(dollar_c1)),
    inference(hyper,[status(thm)],[6,3]),
    [iquote('hyper,6,3')] ).

cnf(13,plain,
    p1(dollar_f1(dollar_c1)),
    inference(hyper,[status(thm)],[8,5,6]),
    [iquote('hyper,8,5,6')] ).

cnf(16,plain,
    $false,
    inference(hyper,[status(thm)],[13,4,6]),
    [iquote('hyper,13,4,6')] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem  : LCL678+1.001 : TPTP v8.1.0. Released v4.0.0.
% 0.03/0.13  % Command  : otter-tptp-script %s
% 0.12/0.33  % Computer : n004.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:51 EDT 2022
% 0.12/0.33  % CPUTime  : 
% 1.70/1.90  ----- Otter 3.3f, August 2004 -----
% 1.70/1.90  The process was started by sandbox2 on n004.cluster.edu,
% 1.70/1.90  Wed Jul 27 09:14:51 2022
% 1.70/1.90  The command was "./otter".  The process ID is 10866.
% 1.70/1.90  
% 1.70/1.90  set(prolog_style_variables).
% 1.70/1.90  set(auto).
% 1.70/1.90     dependent: set(auto1).
% 1.70/1.90     dependent: set(process_input).
% 1.70/1.90     dependent: clear(print_kept).
% 1.70/1.90     dependent: clear(print_new_demod).
% 1.70/1.90     dependent: clear(print_back_demod).
% 1.70/1.90     dependent: clear(print_back_sub).
% 1.70/1.90     dependent: set(control_memory).
% 1.70/1.90     dependent: assign(max_mem, 12000).
% 1.70/1.90     dependent: assign(pick_given_ratio, 4).
% 1.70/1.90     dependent: assign(stats_level, 1).
% 1.70/1.90     dependent: assign(max_seconds, 10800).
% 1.70/1.90  clear(print_given).
% 1.70/1.90  
% 1.70/1.90  formula_list(usable).
% 1.70/1.90  all X r1(X,X).
% 1.70/1.90  all X Y Z (r1(X,Y)&r1(Y,Z)->r1(X,Z)).
% 1.70/1.90  -(-(exists X (-(-(all Y (-r1(X,Y)| -(all X (-r1(Y,X)| (all Y (-r1(X,Y)|p1(Y)))| -(all Y (-r1(X,Y)|p1(Y))))))))))).
% 1.70/1.90  end_of_list.
% 1.70/1.90  
% 1.70/1.90  -------> usable clausifies to:
% 1.70/1.90  
% 1.70/1.90  list(usable).
% 1.70/1.90  0 [] r1(X,X).
% 1.70/1.90  0 [] -r1(X,Y)| -r1(Y,Z)|r1(X,Z).
% 1.70/1.90  0 [] -r1($c1,Y)|r1(Y,$f2(Y)).
% 1.70/1.90  0 [] -r1($c1,Y)|r1($f2(Y),$f1(Y)).
% 1.70/1.90  0 [] -r1($c1,Y)| -p1($f1(Y)).
% 1.70/1.90  0 [] -r1($c1,Y)| -r1($f2(Y),X1)|p1(X1).
% 1.70/1.90  end_of_list.
% 1.70/1.90  
% 1.70/1.90  SCAN INPUT: prop=0, horn=1, equality=0, symmetry=0, max_lits=3.
% 1.70/1.90  
% 1.70/1.90  This is a Horn set without equality.  The strategy will
% 1.70/1.90  be hyperresolution, with satellites in sos and nuclei
% 1.70/1.90  in usable.
% 1.70/1.90  
% 1.70/1.90     dependent: set(hyper_res).
% 1.70/1.90     dependent: clear(order_hyper).
% 1.70/1.90  
% 1.70/1.90  ------------> process usable:
% 1.70/1.90  ** KEPT (pick-wt=9): 1 [] -r1(A,B)| -r1(B,C)|r1(A,C).
% 1.70/1.90  ** KEPT (pick-wt=7): 2 [] -r1($c1,A)|r1(A,$f2(A)).
% 1.70/1.90  ** KEPT (pick-wt=8): 3 [] -r1($c1,A)|r1($f2(A),$f1(A)).
% 1.70/1.90  ** KEPT (pick-wt=6): 4 [] -r1($c1,A)| -p1($f1(A)).
% 1.70/1.90  ** KEPT (pick-wt=9): 5 [] -r1($c1,A)| -r1($f2(A),B)|p1(B).
% 1.70/1.90  
% 1.70/1.90  ------------> process sos:
% 1.70/1.90  ** KEPT (pick-wt=3): 6 [] r1(A,A).
% 1.70/1.90  
% 1.70/1.90  ======= end of input processing =======
% 1.70/1.90  
% 1.70/1.90  =========== start of search ===========
% 1.70/1.90  
% 1.70/1.90  -------- PROOF -------- 
% 1.70/1.90  
% 1.70/1.90  -----> EMPTY CLAUSE at   0.00 sec ----> 16 [hyper,13,4,6] $F.
% 1.70/1.90  
% 1.70/1.90  Length of proof is 2.  Level of proof is 2.
% 1.70/1.90  
% 1.70/1.90  ---------------- PROOF ----------------
% 1.70/1.90  % SZS status Theorem
% 1.70/1.90  % SZS output start Refutation
% See solution above
% 1.70/1.90  ------------ end of proof -------------
% 1.70/1.90  
% 1.70/1.90  
% 1.70/1.90  Search stopped by max_proofs option.
% 1.70/1.90  
% 1.70/1.90  
% 1.70/1.90  Search stopped by max_proofs option.
% 1.70/1.90  
% 1.70/1.90  ============ end of search ============
% 1.70/1.90  
% 1.70/1.90  -------------- statistics -------------
% 1.70/1.90  clauses given                  7
% 1.70/1.90  clauses generated             19
% 1.70/1.90  clauses kept                  15
% 1.70/1.90  clauses forward subsumed       9
% 1.70/1.90  clauses back subsumed          0
% 1.70/1.90  Kbytes malloced              976
% 1.70/1.90  
% 1.70/1.90  ----------- times (seconds) -----------
% 1.70/1.90  user CPU time          0.00          (0 hr, 0 min, 0 sec)
% 1.70/1.90  system CPU time        0.00          (0 hr, 0 min, 0 sec)
% 1.70/1.90  wall-clock time        1             (0 hr, 0 min, 1 sec)
% 1.70/1.90  
% 1.70/1.90  That finishes the proof of the theorem.
% 1.70/1.90  
% 1.70/1.90  Process 10866 finished Wed Jul 27 09:14:52 2022
% 1.70/1.90  Otter interrupted
% 1.70/1.90  PROOF FOUND
%------------------------------------------------------------------------------