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

View Problem - Process Solution

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

% 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 : Sun Jul 17 06:49:53 EDT 2022

% Result   : Unsatisfiable 0.17s 0.39s
% Output   : Refutation 0.17s
% 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    :    2 (   1 avg)
%            Number of predicates  :    2 (   1 usr;   1 prp; 0-3 aty)
%            Number of functors    :    6 (   6 usr;   4 con; 0-2 aty)
%            Number of variables   :    0 (   0 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(1,axiom,
    c_in(c_Tarski_Odual(v_cl,t_a),c_Tarski_OCompleteLattice,tc_Tarski_Opotype_Opotype__ext__type(t_a,tc_Product__Type_Ounit)),
    file('LAT265-2.p',unknown),
    [] ).

cnf(2,axiom,
    ~ c_in(c_Tarski_Odual(v_cl,t_a),c_Tarski_OCompleteLattice,tc_Tarski_Opotype_Opotype__ext__type(t_a,tc_Product__Type_Ounit)),
    file('LAT265-2.p',unknown),
    [] ).

cnf(3,plain,
    $false,
    inference(mrr,[status(thm)],[2,1]),
    [iquote('0:MRR:2.0,1.0')] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.10  % Problem  : LAT265-2 : TPTP v8.1.0. Released v3.2.0.
% 0.00/0.11  % Command  : run_spass %d %s
% 0.11/0.32  % Computer : n010.cluster.edu
% 0.11/0.32  % Model    : x86_64 x86_64
% 0.11/0.32  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.32  % Memory   : 8042.1875MB
% 0.11/0.32  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.11/0.32  % CPULimit : 300
% 0.11/0.32  % WCLimit  : 600
% 0.11/0.32  % DateTime : Thu Jun 30 11:53:19 EDT 2022
% 0.11/0.32  % CPUTime  : 
% 0.17/0.39  
% 0.17/0.39  SPASS V 3.9 
% 0.17/0.39  SPASS beiseite: Proof found.
% 0.17/0.39  % SZS status Theorem
% 0.17/0.39  Problem: /export/starexec/sandbox/benchmark/theBenchmark.p 
% 0.17/0.39  SPASS derived 0 clauses, backtracked 0 clauses, performed 0 splits and kept 2 clauses.
% 0.17/0.39  SPASS allocated 63075 KBytes.
% 0.17/0.39  SPASS spent	0:00:00.06 on the problem.
% 0.17/0.39  		0:00:00.04 for the input.
% 0.17/0.39  		0:00:00.00 for the FLOTTER CNF translation.
% 0.17/0.39  		0:00:00.00 for inferences.
% 0.17/0.39  		0:00:00.00 for the backtracking.
% 0.17/0.39  		0:00:00.00 for the reduction.
% 0.17/0.39  
% 0.17/0.39  
% 0.17/0.39  Here is a proof with depth 0, length 3 :
% 0.17/0.39  % SZS output start Refutation
% See solution above
% 0.17/0.39  Formulae used in the proof : cls_Tarski_Odual_Acl_A_58_ACompleteLattice_0 cls_conjecture_2
% 0.17/0.39  
%------------------------------------------------------------------------------