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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Otter---3.3
% Problem  : SYN327-1 : TPTP v8.1.0. Released v1.2.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : otter-tptp-script %s

% Computer : n020.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:15 EDT 2022

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

% Comments : 
%------------------------------------------------------------------------------
cnf(3,axiom,
    ( ~ f(a,A)
    | ~ f(a,z(A)) ),
    file('SYN327-1.p',unknown),
    [] ).

cnf(4,axiom,
    ( ~ f(a,A)
    | ~ f(A,a)
    | ~ f(z(A),A) ),
    file('SYN327-1.p',unknown),
    [] ).

cnf(5,plain,
    ( ~ f(a,a)
    | ~ f(z(a),a) ),
    inference(factor,[status(thm)],[4]),
    [iquote('factor,4.1.2')] ).

cnf(6,axiom,
    ( f(A,a)
    | f(a,A) ),
    file('SYN327-1.p',unknown),
    [] ).

cnf(8,plain,
    f(a,a),
    inference(factor,[status(thm)],[6]),
    [iquote('factor,6.1.2')] ).

cnf(10,plain,
    f(a,z(a)),
    inference(hyper,[status(thm)],[8,5,6]),
    [iquote('hyper,8,5,6')] ).

cnf(12,plain,
    $false,
    inference(hyper,[status(thm)],[10,3,8]),
    [iquote('hyper,10,3,8')] ).

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