%------------------------------------------------------------------------------
% File     : SPASS+T---2.2.22
% Problem  : DAT061_1 : TPTP v8.1.0. Released v5.5.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : spasst-tptp-script %s %d

% 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  : 600s
% DateTime : Sat Jul 16 01:32:01 EDT 2022

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

% Comments : 
%------------------------------------------------------------------------------
cnf(5,axiom,
    data(skc9),
    file('DAT061=1.p',unknown),
    [] ).

cnf(6,axiom,
    array(skc8),
    file('DAT061=1.p',unknown),
    [] ).

cnf(7,axiom,
    less(skc6,skc7),
    file('DAT061=1.p',unknown),
    [] ).

cnf(11,axiom,
    ~ equal(get(put(skc8,skc6,skc9),skc7),get(skc8,skc7)),
    file('DAT061=1.p',unknown),
    [] ).

cnf(14,axiom,
    ( ~ data(U)
    | ~ array(V)
    | equal(W,X)
    | equal(get(put(V,X,U),W),get(V,W)) ),
    file('DAT061=1.p',unknown),
    [] ).

cnf(63,plain,
    ( ~ array(skc8)
    | ~ data(skc9)
    | equal(skc7,skc6) ),
    inference(res,[status(thm),theory(equality)],[14,11]),
    [iquote('0:Res:14.2,11.0')] ).

cnf(69,plain,
    equal(skc7,skc6),
    inference(mrr,[status(thm)],[63,6,5]),
    [iquote('0:MRR:63.0,63.1,6.0,5.0')] ).

cnf(70,plain,
    less(skc6,skc6),
    inference(rew,[status(thm),theory(equality)],[69,7]),
    [iquote('0:Rew:69.0,7.0')] ).

cnf(92,plain,
    $false,
    inference(oce,[status(thm)],[70]),
    [iquote('0:OCE:70.0,70.0')] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem  : DAT061_1 : TPTP v8.1.0. Released v5.5.0.
% 0.07/0.12  % Command  : spasst-tptp-script %s %d
% 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  : 600
% 0.12/0.33  % DateTime : Fri Jul  1 19:38:08 EDT 2022
% 0.12/0.34  % CPUTime  : 
% 0.18/0.46  % Using integer theory
% 0.43/1.04  
% 0.43/1.04  
% 0.43/1.04  % SZS status Theorem for /tmp/SPASST_18383_n004.cluster.edu
% 0.43/1.04  
% 0.43/1.04  SPASS V 2.2.22  in combination with yices.
% 0.43/1.04  SPASS beiseite: Proof found by SPASS.
% 0.43/1.04  Problem: /tmp/SPASST_18383_n004.cluster.edu 
% 0.43/1.04  SPASS derived 40 clauses, backtracked 0 clauses and kept 72 clauses.
% 0.43/1.04  SPASS backtracked 0 times (0 times due to theory inconsistency).
% 0.43/1.04  SPASS allocated 6311 KBytes.
% 0.43/1.04  SPASS spent	0:00:00.02 on the problem.
% 0.43/1.04  		0:00:00.00 for the input.
% 0.43/1.04  		0:00:00.01 for the FLOTTER CNF translation.
% 0.43/1.04  		0:00:00.00 for inferences.
% 0.43/1.04  		0:00:00.00 for the backtracking.
% 0.43/1.04  		0:00:00.00 for the reduction.
% 0.43/1.04  		0:00:00.00 for interacting with the SMT procedure.
% 0.43/1.04  		
% 0.43/1.04  
% 0.43/1.04  % SZS output start CNFRefutation for /tmp/SPASST_18383_n004.cluster.edu
% See solution above
% 0.43/1.04  
% 0.43/1.04  Formulae used in the proof : fof_data_type fof_th_lem_7 fof_put_type fof_ax_21
% 0.77/1.07  
% 0.77/1.07  SPASS+T ended
%------------------------------------------------------------------------------