TSTP Solution File: LCL844-1 by SPASS---3.9

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SPASS---3.9
% Problem  : LCL844-1 : TPTP v8.1.0. Released v4.1.0.
% Transfm  : none
% Format   : tptp
% Command  : run_spass %d %s

% 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 : Sun Jul 17 14:40:33 EDT 2022

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

% Comments : 
%------------------------------------------------------------------------------
cnf(56,axiom,
    c_InductTermi_OIT(v_ta______),
    file('LCL844-1.p',unknown),
    [] ).

cnf(61,axiom,
    ( ~ c_InductTermi_OIT(u)
    | c_InductTermi_OIT(c_Lambda_OdB_OAbs(u)) ),
    file('LCL844-1.p',unknown),
    [] ).

cnf(69,axiom,
    ~ c_InductTermi_OIT(c_Lambda_OdB_OAbs(v_ta______)),
    file('LCL844-1.p',unknown),
    [] ).

cnf(70,plain,
    ~ c_InductTermi_OIT(v_ta______),
    inference(res,[status(thm),theory(equality)],[61,69]),
    [iquote('0:Res:61.1,69.0')] ).

cnf(71,plain,
    $false,
    inference(mrr,[status(thm)],[70,56]),
    [iquote('0:MRR:70.0,56.0')] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem  : LCL844-1 : TPTP v8.1.0. Released v4.1.0.
% 0.13/0.13  % Command  : run_spass %d %s
% 0.13/0.34  % Computer : n004.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 : Sun Jul  3 13:21:53 EDT 2022
% 0.13/0.35  % CPUTime  : 
% 0.20/0.42  
% 0.20/0.42  SPASS V 3.9 
% 0.20/0.42  SPASS beiseite: Proof found.
% 0.20/0.42  % SZS status Theorem
% 0.20/0.42  Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p 
% 0.20/0.42  SPASS derived 1 clauses, backtracked 0 clauses, performed 0 splits and kept 58 clauses.
% 0.20/0.42  SPASS allocated 75665 KBytes.
% 0.20/0.42  SPASS spent	0:00:00.06 on the problem.
% 0.20/0.42  		0:00:00.04 for the input.
% 0.20/0.42  		0:00:00.00 for the FLOTTER CNF translation.
% 0.20/0.42  		0:00:00.00 for inferences.
% 0.20/0.42  		0:00:00.00 for the backtracking.
% 0.20/0.42  		0:00:00.00 for the reduction.
% 0.20/0.42  
% 0.20/0.42  
% 0.20/0.42  Here is a proof with depth 1, length 5 :
% 0.20/0.42  % SZS output start Refutation
% See solution above
% 0.20/0.42  Formulae used in the proof : cls_Abs_I2_J_0 cls_Lambda_0 cls_conjecture_0
% 0.20/0.42  
%------------------------------------------------------------------------------