↑ Up

Otter---3.3.THM-Ref.s

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

% Computer : n017.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:11 EDT 2022

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

% Comments : 
%------------------------------------------------------------------------------
cnf(1,axiom,
    ( ~ r(A)
    | s(A)
    | s(B)
    | ~ r(B) ),
    file('SYN724+1.p',unknown),
    [] ).

cnf(2,plain,
    ( ~ r(A)
    | s(A) ),
    inference(factor_simp,[status(thm)],[inference(factor_simp,[status(thm)],[inference(copy,[status(thm)],[1])])]),
    [iquote('copy,1,factor_simp,factor_simp')] ).

cnf(3,axiom,
    ( r(dollar_c1)
    | ~ r(dollar_c2)
    | ~ s(dollar_c2) ),
    file('SYN724+1.p',unknown),
    [] ).

cnf(4,axiom,
    ( ~ s(dollar_c1)
    | r(dollar_c2) ),
    file('SYN724+1.p',unknown),
    [] ).

cnf(5,axiom,
    ( ~ s(dollar_c1)
    | ~ r(dollar_c2)
    | ~ s(dollar_c2) ),
    file('SYN724+1.p',unknown),
    [] ).

cnf(6,axiom,
    ( r(dollar_c1)
    | r(dollar_c2) ),
    file('SYN724+1.p',unknown),
    [] ).

cnf(7,plain,
    ( r(dollar_c2)
    | s(dollar_c1) ),
    inference(hyper,[status(thm)],[6,2]),
    [iquote('hyper,6,2')] ).

cnf(9,plain,
    r(dollar_c2),
    inference(factor_simp,[status(thm)],[inference(hyper,[status(thm)],[7,4])]),
    [iquote('hyper,7,4,factor_simp')] ).

cnf(10,plain,
    s(dollar_c2),
    inference(hyper,[status(thm)],[9,2]),
    [iquote('hyper,9,2')] ).

cnf(11,plain,
    r(dollar_c1),
    inference(hyper,[status(thm)],[10,3,9]),
    [iquote('hyper,10,3,9')] ).

cnf(12,plain,
    s(dollar_c1),
    inference(hyper,[status(thm)],[11,2]),
    [iquote('hyper,11,2')] ).

cnf(13,plain,
    $false,
    inference(hyper,[status(thm)],[12,5,9,10]),
    [iquote('hyper,12,5,9,10')] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11  % Problem  : SYN724+1 : TPTP v8.1.0. Released v2.5.0.
% 0.00/0.12  % Command  : otter-tptp-script %s
% 0.12/0.33  % Computer : n017.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 10:41:03 EDT 2022
% 0.12/0.33  % CPUTime  : 
% 1.64/1.85  ----- Otter 3.3f, August 2004 -----
% 1.64/1.85  The process was started by sandbox on n017.cluster.edu,
% 1.64/1.85  Wed Jul 27 10:41:03 2022
% 1.64/1.85  The command was "./otter".  The process ID is 26163.
% 1.64/1.85  
% 1.64/1.85  set(prolog_style_variables).
% 1.64/1.85  set(auto).
% 1.64/1.85     dependent: set(auto1).
% 1.64/1.85     dependent: set(process_input).
% 1.64/1.85     dependent: clear(print_kept).
% 1.64/1.85     dependent: clear(print_new_demod).
% 1.64/1.85     dependent: clear(print_back_demod).
% 1.64/1.85     dependent: clear(print_back_sub).
% 1.64/1.85     dependent: set(control_memory).
% 1.64/1.85     dependent: assign(max_mem, 12000).
% 1.64/1.85     dependent: assign(pick_given_ratio, 4).
% 1.64/1.85     dependent: assign(stats_level, 1).
% 1.64/1.85     dependent: assign(max_seconds, 10800).
% 1.64/1.85  clear(print_given).
% 1.64/1.85  
% 1.64/1.85  formula_list(usable).
% 1.64/1.85  -((all X (r(X)->s(X)))<-> (all X (r(X)&s(X)<->r(X)))).
% 1.64/1.85  end_of_list.
% 1.64/1.85  
% 1.64/1.85  -------> usable clausifies to:
% 1.64/1.85  
% 1.64/1.85  list(usable).
% 1.64/1.85  0 [] -r(X)|s(X)|s(X1)| -r(X1).
% 1.64/1.85  0 [] r($c1)|r($c2).
% 1.64/1.85  0 [] r($c1)| -r($c2)| -s($c2).
% 1.64/1.85  0 [] -s($c1)|r($c2).
% 1.64/1.85  0 [] -s($c1)| -r($c2)| -s($c2).
% 1.64/1.85  end_of_list.
% 1.64/1.85  
% 1.64/1.85  SCAN INPUT: prop=0, horn=0, equality=0, symmetry=0, max_lits=4.
% 1.64/1.85  
% 1.64/1.85  This is a non-Horn set without equality.  The strategy will
% 1.64/1.85  be ordered hyper_res, unit deletion, and factoring, with
% 1.64/1.85  satellites in sos and with nuclei in usable.
% 1.64/1.85  
% 1.64/1.85     dependent: set(hyper_res).
% 1.64/1.85     dependent: set(factor).
% 1.64/1.85     dependent: set(unit_deletion).
% 1.64/1.85  
% 1.64/1.85  ------------> process usable:
% 1.64/1.85  ** KEPT (pick-wt=4): 2 [copy,1,factor_simp,factor_simp] -r(A)|s(A).
% 1.64/1.85  ** KEPT (pick-wt=6): 3 [] r($c1)| -r($c2)| -s($c2).
% 1.64/1.85  ** KEPT (pick-wt=4): 4 [] -s($c1)|r($c2).
% 1.64/1.85  ** KEPT (pick-wt=6): 5 [] -s($c1)| -r($c2)| -s($c2).
% 1.64/1.85  
% 1.64/1.85  ------------> process sos:
% 1.64/1.85  ** KEPT (pick-wt=4): 6 [] r($c1)|r($c2).
% 1.64/1.85  
% 1.64/1.85  ======= end of input processing =======
% 1.64/1.85  
% 1.64/1.85  =========== start of search ===========
% 1.64/1.85  
% 1.64/1.85  -------- PROOF -------- 
% 1.64/1.85  
% 1.64/1.85  -----> EMPTY CLAUSE at   0.00 sec ----> 13 [hyper,12,5,9,10] $F.
% 1.64/1.85  
% 1.64/1.85  Length of proof is 6.  Level of proof is 6.
% 1.64/1.85  
% 1.64/1.85  ---------------- PROOF ----------------
% 1.64/1.85  % SZS status Theorem
% 1.64/1.85  % SZS output start Refutation
% See solution above
% 1.64/1.85  ------------ end of proof -------------
% 1.64/1.85  
% 1.64/1.85  
% 1.64/1.85  Search stopped by max_proofs option.
% 1.64/1.85  
% 1.64/1.85  
% 1.64/1.85  Search stopped by max_proofs option.
% 1.64/1.85  
% 1.64/1.85  ============ end of search ============
% 1.64/1.85  
% 1.64/1.85  -------------- statistics -------------
% 1.64/1.85  clauses given                  6
% 1.64/1.85  clauses generated              7
% 1.64/1.85  clauses kept                  11
% 1.64/1.85  clauses forward subsumed       0
% 1.64/1.85  clauses back subsumed          5
% 1.64/1.85  Kbytes malloced              976
% 1.64/1.85  
% 1.64/1.85  ----------- times (seconds) -----------
% 1.64/1.85  user CPU time          0.00          (0 hr, 0 min, 0 sec)
% 1.64/1.85  system CPU time        0.00          (0 hr, 0 min, 0 sec)
% 1.64/1.85  wall-clock time        1             (0 hr, 0 min, 1 sec)
% 1.64/1.85  
% 1.64/1.85  That finishes the proof of the theorem.
% 1.64/1.85  
% 1.64/1.85  Process 26163 finished Wed Jul 27 10:41:04 2022
% 1.64/1.85  Otter interrupted
% 1.64/1.85  PROOF FOUND
%------------------------------------------------------------------------------