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

View Problem - Process Solution

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

% Computer : n005.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:03 EDT 2022

% Result   : Unsatisfiable 5.37s 5.57s
% Output   : Refutation 5.37s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    2
%            Number of leaves      :    4
% Syntax   : Number of clauses     :    6 (   4 unt;   0 nHn;   6 RR)
%            Number of literals    :    8 (   0 equ;   3 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;   7 con; 0-3 aty)
%            Number of variables   :    0 (   0 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(3,axiom,
    ( ~ c_in(u,c_Tarski_OPartialOrder,tc_Tarski_Opotype_Opotype__ext__type(v,tc_Product__Type_Ounit))
    | c_Relation_Oantisym(c_Tarski_Opotype_Oorder(u,v,tc_Product__Type_Ounit),v) ),
    file('LAT279-1.p',unknown),
    [] ).

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

cnf(7,axiom,
    equal(c_Tarski_Opotype_Oorder(v_cl,t_a,tc_Product__Type_Ounit),v_r),
    file('LAT279-1.p',unknown),
    [] ).

cnf(8,axiom,
    ~ c_Relation_Oantisym(v_r,t_a),
    file('LAT279-1.p',unknown),
    [] ).

cnf(20634,plain,
    ( ~ c_in(v_cl,c_Tarski_OPartialOrder,tc_Tarski_Opotype_Opotype__ext__type(t_a,tc_Product__Type_Ounit))
    | c_Relation_Oantisym(v_r,t_a) ),
    inference(spr,[status(thm),theory(equality)],[7,3]),
    [iquote('0:SpR:7.0,3.1')] ).

cnf(20636,plain,
    $false,
    inference(mrr,[status(thm)],[20634,6,8]),
    [iquote('0:MRR:20634.0,20634.1,6.0,8.0')] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem  : LAT279-1 : TPTP v8.1.0. Released v3.2.0.
% 0.03/0.13  % Command  : run_spass %d %s
% 0.12/0.34  % Computer : n005.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 : Thu Jun 30 12:01:52 EDT 2022
% 0.12/0.34  % CPUTime  : 
% 5.37/5.57  
% 5.37/5.57  SPASS V 3.9 
% 5.37/5.57  SPASS beiseite: Proof found.
% 5.37/5.57  % SZS status Theorem
% 5.37/5.57  Problem: /export/starexec/sandbox/benchmark/theBenchmark.p 
% 5.37/5.57  SPASS derived 14875 clauses, backtracked 0 clauses, performed 1 splits and kept 4968 clauses.
% 5.37/5.57  SPASS allocated 89525 KBytes.
% 5.37/5.57  SPASS spent	0:00:05.07 on the problem.
% 5.37/5.57  		0:00:00.27 for the input.
% 5.37/5.57  		0:00:00.00 for the FLOTTER CNF translation.
% 5.37/5.57  		0:00:00.32 for inferences.
% 5.37/5.57  		0:00:00.00 for the backtracking.
% 5.37/5.57  		0:00:03.90 for the reduction.
% 5.37/5.57  
% 5.37/5.57  
% 5.37/5.57  Here is a proof with depth 1, length 6 :
% 5.37/5.57  % SZS output start Refutation
% See solution above
% 5.37/5.57  Formulae used in the proof : cls_Tarski_OPartialOrder__iff_1 cls_Tarski_Ocl_A_58_APartialOrder_0 cls_Tarski_Or_A_61_61_Aorder_Acl_0 cls_conjecture_0
% 5.37/5.57  
%------------------------------------------------------------------------------