%------------------------------------------------------------------------------
% File     : SPASS---3.9
% Problem  : GEO498+1 : TPTP v8.1.0. Released v7.0.0.
% Transfm  : none
% Format   : tptp
% Command  : run_spass %d %s

% Computer : n012.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 06:24:58 EDT 2022

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

% Comments : 
%------------------------------------------------------------------------------
cnf(1,axiom,
    ~ equal(skc4,skc3),
    file('GEO498+1.p',unknown),
    [] ).

cnf(19,axiom,
    equal(s(skc5,skc4),s(skc5,skc3)),
    file('GEO498+1.p',unknown),
    [] ).

cnf(22,axiom,
    equal(s(u,s(u,v)),v),
    file('GEO498+1.p',unknown),
    [] ).

cnf(729,plain,
    equal(s(skc5,s(skc5,skc3)),skc4),
    inference(spr,[status(thm),theory(equality)],[19,22]),
    [iquote('0:SpR:19.0,22.0')] ).

cnf(731,plain,
    equal(skc4,skc3),
    inference(rew,[status(thm),theory(equality)],[22,729]),
    [iquote('0:Rew:22.0,729.0')] ).

cnf(732,plain,
    $false,
    inference(mrr,[status(thm)],[731,1]),
    [iquote('0:MRR:731.0,1.0')] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12  % Problem  : GEO498+1 : TPTP v8.1.0. Released v7.0.0.
% 0.12/0.13  % Command  : run_spass %d %s
% 0.12/0.34  % Computer : n012.cluster.edu
% 0.12/0.34  % Model    : x86_64 x86_64
% 0.12/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34  % Memory   : 8042.1875MB
% 0.12/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34  % CPULimit : 300
% 0.12/0.34  % WCLimit  : 600
% 0.12/0.34  % DateTime : Sat Jun 18 13:13:23 EDT 2022
% 0.12/0.34  % CPUTime  : 
% 0.48/0.67  
% 0.48/0.67  SPASS V 3.9 
% 0.48/0.67  SPASS beiseite: Proof found.
% 0.48/0.67  % SZS status Theorem
% 0.48/0.67  Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p 
% 0.48/0.67  SPASS derived 406 clauses, backtracked 206 clauses, performed 2 splits and kept 668 clauses.
% 0.48/0.67  SPASS allocated 85826 KBytes.
% 0.48/0.67  SPASS spent	0:00:00.31 on the problem.
% 0.48/0.67  		0:00:00.04 for the input.
% 0.48/0.67  		0:00:00.05 for the FLOTTER CNF translation.
% 0.48/0.67  		0:00:00.00 for inferences.
% 0.48/0.67  		0:00:00.00 for the backtracking.
% 0.48/0.67  		0:00:00.17 for the reduction.
% 0.48/0.67  
% 0.48/0.67  
% 0.48/0.67  Here is a proof with depth 1, length 6 :
% 0.48/0.67  % SZS output start Refutation
% See solution above
% 0.48/0.67  Formulae used in the proof : aSatz7_8 aSatz7_7
% 0.48/0.67  
%------------------------------------------------------------------------------