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

% Computer : n010.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 : Thu Jul 14 22:18:07 EDT 2022

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

% Comments : 
%------------------------------------------------------------------------------
cnf(1,axiom,
    ~ less(skc3,skc2),
    file('ARI572=1.p',unknown),
    [] ).

cnf(2,axiom,
    less(plus(skc3,uminus(skc2)),plus(skc2,uminus(skc3))),
    file('ARI572=1.p',unknown),
    [] ).

cnf(63,plain,
    $false,
    inference(thr,[status(thm)],[2,1]),
    [iquote('0:ThR:2,1')] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem  : ARI572_1 : TPTP v8.1.0. Released v5.1.0.
% 0.03/0.13  % Command  : spasst-tptp-script %s %d
% 0.13/0.34  % Computer : n010.cluster.edu
% 0.13/0.34  % Model    : x86_64 x86_64
% 0.13/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34  % Memory   : 8042.1875MB
% 0.13/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34  % CPULimit : 300
% 0.13/0.34  % WCLimit  : 600
% 0.13/0.34  % DateTime : Fri Jun 17 14:50:53 EDT 2022
% 0.13/0.34  % CPUTime  : 
% 0.20/0.47  % Using integer theory
% 0.46/1.02  
% 0.46/1.02  
% 0.46/1.02  % SZS status Theorem for /tmp/SPASST_10696_n010.cluster.edu
% 0.46/1.02  
% 0.46/1.02  SPASS V 2.2.22  in combination with yices.
% 0.46/1.02  SPASS beiseite: Proof found by SPASS and SMT.
% 0.46/1.02  Problem: /tmp/SPASST_10696_n010.cluster.edu 
% 0.46/1.02  SPASS derived 23 clauses, backtracked 4 clauses and kept 50 clauses.
% 0.46/1.02  SPASS backtracked 2 times (1 times due to theory inconsistency).
% 0.46/1.02  SPASS allocated 6232 KBytes.
% 0.46/1.02  SPASS spent	0:00:00.01 on the problem.
% 0.46/1.02  		0:00:00.00 for the input.
% 0.46/1.02  		0:00:00.00 for the FLOTTER CNF translation.
% 0.46/1.02  		0:00:00.00 for inferences.
% 0.46/1.02  		0:00:00.00 for the backtracking.
% 0.46/1.02  		0:00:00.00 for the reduction.
% 0.46/1.02  		0:00:00.00 for interacting with the SMT procedure.
% 0.46/1.02  		
% 0.46/1.02  
% 0.46/1.02  % SZS output start CNFRefutation for /tmp/SPASST_10696_n010.cluster.edu
% See solution above
% 0.46/1.02  
% 0.46/1.02  Formulae used in the proof : fof_impl_ineq
% 0.46/1.02  
% 0.46/1.02  SPASS+T ended
%------------------------------------------------------------------------------