TSTP Solution File: LAT275-2 by SPASS---3.9

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SPASS---3.9
% Problem  : LAT275-2 : TPTP v8.1.0. Released v3.2.0.
% Transfm  : none
% Format   : tptp
% Command  : run_spass %d %s

% Computer : n013.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 06:50:00 EDT 2022

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

% Comments : 
%------------------------------------------------------------------------------
cnf(1,axiom,
    equal(c_Tarski_Opotype_Opset(v_cl,t_a,tc_Product__Type_Ounit),v_A),
    file('LAT275-2.p',unknown),
    [] ).

cnf(2,axiom,
    ( ~ c_lessequals(u,v_A,tc_set(t_a))
    | c_in(c_Tarski_Olub(u,v_cl,t_a),v_A,t_a) ),
    file('LAT275-2.p',unknown),
    [] ).

cnf(3,axiom,
    c_lessequals(v_S,v_A,tc_set(t_a)),
    file('LAT275-2.p',unknown),
    [] ).

cnf(4,axiom,
    ~ c_in(c_Tarski_Olub(v_S,v_cl,t_a),c_Tarski_Opotype_Opset(v_cl,t_a,tc_Product__Type_Ounit),t_a),
    file('LAT275-2.p',unknown),
    [] ).

cnf(5,plain,
    ~ c_in(c_Tarski_Olub(v_S,v_cl,t_a),v_A,t_a),
    inference(rew,[status(thm),theory(equality)],[1,4]),
    [iquote('0:Rew:1.0,4.0')] ).

cnf(7,plain,
    ~ c_lessequals(v_S,v_A,tc_set(t_a)),
    inference(res,[status(thm),theory(equality)],[2,5]),
    [iquote('0:Res:2.1,5.0')] ).

cnf(8,plain,
    $false,
    inference(mrr,[status(thm)],[7,3]),
    [iquote('0:MRR:7.0,3.0')] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem  : LAT275-2 : TPTP v8.1.0. Released v3.2.0.
% 0.07/0.13  % Command  : run_spass %d %s
% 0.13/0.34  % Computer : n013.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 : Thu Jun 30 04:15:29 EDT 2022
% 0.13/0.34  % CPUTime  : 
% 0.20/0.40  
% 0.20/0.40  SPASS V 3.9 
% 0.20/0.40  SPASS beiseite: Proof found.
% 0.20/0.40  % SZS status Theorem
% 0.20/0.40  Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p 
% 0.20/0.40  SPASS derived 2 clauses, backtracked 0 clauses, performed 0 splits and kept 5 clauses.
% 0.20/0.40  SPASS allocated 63081 KBytes.
% 0.20/0.40  SPASS spent	0:00:00.04 on the problem.
% 0.20/0.40  		0:00:00.03 for the input.
% 0.20/0.40  		0:00:00.00 for the FLOTTER CNF translation.
% 0.20/0.40  		0:00:00.00 for inferences.
% 0.20/0.40  		0:00:00.00 for the backtracking.
% 0.20/0.40  		0:00:00.00 for the reduction.
% 0.20/0.40  
% 0.20/0.40  
% 0.20/0.40  Here is a proof with depth 1, length 7 :
% 0.20/0.40  % SZS output start Refutation
% See solution above
% 0.20/0.40  Formulae used in the proof : cls_Tarski_OA_A_61_61_Apset_Acl_0 cls_Tarski_OS_A_60_61_AA_A_61_61_62_Alub_AS_Acl_A_58_AA_0 cls_conjecture_0 cls_conjecture_2
% 0.20/0.40  
%------------------------------------------------------------------------------