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

View Problem - Process Solution

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

% Computer : n003.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:52 EDT 2022

% Result   : Unsatisfiable 0.91s 1.09s
% Output   : Refutation 0.91s
% 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(3,axiom,
    ~ c_in(c_Tarski_Odual(v_cl,t_a),c_Tarski_OPartialOrder,tc_Tarski_Opotype_Opotype__ext__type(t_a,tc_Product__Type_Ounit)),
    file('LAT264-1.p',unknown),
    [] ).

cnf(13,axiom,
    c_in(c_Tarski_Odual(v_cl,t_a),c_Tarski_OPartialOrder,tc_Tarski_Opotype_Opotype__ext__type(t_a,tc_Product__Type_Ounit)),
    file('LAT264-1.p',unknown),
    [] ).

cnf(2776,plain,
    $false,
    inference(mrr,[status(thm)],[3,13]),
    [iquote('0:MRR:3.0,13.0')] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11  % Problem  : LAT264-1 : TPTP v8.1.0. Released v3.2.0.
% 0.03/0.12  % Command  : run_spass %d %s
% 0.12/0.33  % Computer : n003.cluster.edu
% 0.12/0.33  % Model    : x86_64 x86_64
% 0.12/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33  % Memory   : 8042.1875MB
% 0.12/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33  % CPULimit : 300
% 0.12/0.33  % WCLimit  : 600
% 0.12/0.33  % DateTime : Thu Jun 30 13:09:22 EDT 2022
% 0.12/0.33  % CPUTime  : 
% 0.91/1.09  
% 0.91/1.09  SPASS V 3.9 
% 0.91/1.09  SPASS beiseite: Proof found.
% 0.91/1.09  % SZS status Theorem
% 0.91/1.09  Problem: /export/starexec/sandbox/benchmark/theBenchmark.p 
% 0.91/1.09  SPASS derived 0 clauses, backtracked 0 clauses, performed 0 splits and kept 1404 clauses.
% 0.91/1.09  SPASS allocated 79791 KBytes.
% 0.91/1.09  SPASS spent	0:00:00.70 on the problem.
% 0.91/1.09  		0:00:00.22 for the input.
% 0.91/1.09  		0:00:00.00 for the FLOTTER CNF translation.
% 0.91/1.09  		0:00:00.00 for inferences.
% 0.91/1.09  		0:00:00.00 for the backtracking.
% 0.91/1.09  		0:00:00.16 for the reduction.
% 0.91/1.09  
% 0.91/1.09  
% 0.91/1.09  Here is a proof with depth 0, length 3 :
% 0.91/1.09  % SZS output start Refutation
% See solution above
% 0.91/1.09  Formulae used in the proof : cls_conjecture_2 cls_Tarski_Odual_Acl_A_58_APartialOrder_0
% 0.91/1.09  
%------------------------------------------------------------------------------