↑ Up

Otter---3.3.THM-Ref.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Otter---3.3
% Problem  : SYN409+1 : TPTP v8.1.0. Released v2.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : otter-tptp-script %s

% Computer : n022.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:28 EDT 2022

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

% Comments : 
%------------------------------------------------------------------------------
cnf(1,axiom,
    ( ~ f(dollar_c1)
    | ~ f(dollar_c3)
    | ~ f(dollar_c2) ),
    file('SYN409+1.p',unknown),
    [] ).

cnf(2,axiom,
    ( f(A)
    | f(B) ),
    file('SYN409+1.p',unknown),
    [] ).

cnf(3,plain,
    f(A),
    inference(factor_simp,[status(thm)],[inference(copy,[status(thm)],[2])]),
    [iquote('copy,2,factor_simp')] ).

cnf(4,plain,
    $false,
    inference(hyper,[status(thm)],[3,1,3,3]),
    [iquote('hyper,3,1,3,3')] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11  % Problem  : SYN409+1 : TPTP v8.1.0. Released v2.0.0.
% 0.10/0.11  % Command  : otter-tptp-script %s
% 0.11/0.32  % Computer : n022.cluster.edu
% 0.11/0.32  % Model    : x86_64 x86_64
% 0.11/0.32  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.32  % Memory   : 8042.1875MB
% 0.11/0.32  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.11/0.32  % CPULimit : 300
% 0.11/0.32  % WCLimit  : 300
% 0.11/0.32  % DateTime : Wed Jul 27 11:25:05 EDT 2022
% 0.11/0.32  % CPUTime  : 
% 1.71/1.91  ----- Otter 3.3f, August 2004 -----
% 1.71/1.91  The process was started by sandbox2 on n022.cluster.edu,
% 1.71/1.91  Wed Jul 27 11:25:05 2022
% 1.71/1.91  The command was "./otter".  The process ID is 27945.
% 1.71/1.91  
% 1.71/1.91  set(prolog_style_variables).
% 1.71/1.91  set(auto).
% 1.71/1.91     dependent: set(auto1).
% 1.71/1.91     dependent: set(process_input).
% 1.71/1.91     dependent: clear(print_kept).
% 1.71/1.91     dependent: clear(print_new_demod).
% 1.71/1.91     dependent: clear(print_back_demod).
% 1.71/1.91     dependent: clear(print_back_sub).
% 1.71/1.91     dependent: set(control_memory).
% 1.71/1.91     dependent: assign(max_mem, 12000).
% 1.71/1.91     dependent: assign(pick_given_ratio, 4).
% 1.71/1.91     dependent: assign(stats_level, 1).
% 1.71/1.91     dependent: assign(max_seconds, 10800).
% 1.71/1.91  clear(print_given).
% 1.71/1.91  
% 1.71/1.91  formula_list(usable).
% 1.71/1.91  -((all X f(X))<-> (all Y Z (f(Y)&f(Z)))).
% 1.71/1.91  end_of_list.
% 1.71/1.91  
% 1.71/1.91  -------> usable clausifies to:
% 1.71/1.91  
% 1.71/1.91  list(usable).
% 1.71/1.91  0 [] f(X)|f(Y).
% 1.71/1.91  0 [] f(X)|f(Z).
% 1.71/1.91  0 [] -f($c1)| -f($c3)| -f($c2).
% 1.71/1.91  end_of_list.
% 1.71/1.91  
% 1.71/1.91  SCAN INPUT: prop=0, horn=0, equality=0, symmetry=0, max_lits=3.
% 1.71/1.91  
% 1.71/1.91  This is a non-Horn set without equality.  The strategy will
% 1.71/1.91  be ordered hyper_res, unit deletion, and factoring, with
% 1.71/1.91  satellites in sos and with nuclei in usable.
% 1.71/1.91  
% 1.71/1.91     dependent: set(hyper_res).
% 1.71/1.91     dependent: set(factor).
% 1.71/1.91     dependent: set(unit_deletion).
% 1.71/1.91  
% 1.71/1.91  ------------> process usable:
% 1.71/1.91  ** KEPT (pick-wt=6): 1 [] -f($c1)| -f($c3)| -f($c2).
% 1.71/1.91  
% 1.71/1.91  ------------> process sos:
% 1.71/1.91  ** KEPT (pick-wt=2): 3 [copy,2,factor_simp] f(A).
% 1.71/1.91    Following clause subsumed by 3 during input processing: 0 [factor_simp] f(B).
% 1.71/1.91  
% 1.71/1.91  ======= end of input processing =======
% 1.71/1.91  
% 1.71/1.91  =========== start of search ===========
% 1.71/1.91  
% 1.71/1.91  -------- PROOF -------- 
% 1.71/1.91  
% 1.71/1.91  -----> EMPTY CLAUSE at   0.00 sec ----> 4 [hyper,3,1,3,3] $F.
% 1.71/1.91  
% 1.71/1.91  Length of proof is 1.  Level of proof is 1.
% 1.71/1.91  
% 1.71/1.91  ---------------- PROOF ----------------
% 1.71/1.91  % SZS status Theorem
% 1.71/1.91  % SZS output start Refutation
% See solution above
% 1.71/1.91  ------------ end of proof -------------
% 1.71/1.91  
% 1.71/1.91  
% 1.71/1.91  Search stopped by max_proofs option.
% 1.71/1.91  
% 1.71/1.91  
% 1.71/1.91  Search stopped by max_proofs option.
% 1.71/1.91  
% 1.71/1.91  ============ end of search ============
% 1.71/1.91  
% 1.71/1.91  -------------- statistics -------------
% 1.71/1.91  clauses given                  1
% 1.71/1.91  clauses generated              1
% 1.71/1.91  clauses kept                   2
% 1.71/1.91  clauses forward subsumed       1
% 1.71/1.91  clauses back subsumed          0
% 1.71/1.91  Kbytes malloced              976
% 1.71/1.91  
% 1.71/1.91  ----------- times (seconds) -----------
% 1.71/1.91  user CPU time          0.00          (0 hr, 0 min, 0 sec)
% 1.71/1.91  system CPU time        0.00          (0 hr, 0 min, 0 sec)
% 1.71/1.91  wall-clock time        2             (0 hr, 0 min, 2 sec)
% 1.71/1.91  
% 1.71/1.91  That finishes the proof of the theorem.
% 1.71/1.91  
% 1.71/1.91  Process 27945 finished Wed Jul 27 11:25:07 2022
% 1.71/1.91  Otter interrupted
% 1.71/1.91  PROOF FOUND
%------------------------------------------------------------------------------