↑ Up

SPASS---3.9.UNS-Ref.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : SPASS---3.9
% Problem  : LAT271-1 : TPTP v8.1.0. Released v3.2.0.
% Transfm  : none
% Format   : tptp
% Command  : run_spass %d %s

% Computer : n016.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:57 EDT 2022

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

% Comments : 
%------------------------------------------------------------------------------
cnf(3,axiom,
    c_lessequals(v_S,c_Tarski_Ointerval(v_r,v_a,v_b,t_a),tc_set(t_a)),
    file('LAT271-1.p',unknown),
    [] ).

cnf(7,axiom,
    c_in(v_x,v_S,t_a),
    file('LAT271-1.p',unknown),
    [] ).

cnf(8,axiom,
    ~ c_in(c_Pair(v_a,v_x,t_a,t_a),v_r,tc_prod(t_a,t_a)),
    file('LAT271-1.p',unknown),
    [] ).

cnf(13,axiom,
    ( ~ c_in(u,v,w)
    | ~ c_lessequals(v,c_Tarski_Ointerval(x,y,z,w),tc_set(w))
    | c_in(c_Pair(y,u,w,w),x,tc_prod(w,w)) ),
    file('LAT271-1.p',unknown),
    [] ).

cnf(3467,plain,
    ( ~ c_lessequals(u,c_Tarski_Ointerval(v_r,v_a,v,t_a),tc_set(t_a))
    | ~ c_in(v_x,u,t_a) ),
    inference(res,[status(thm),theory(equality)],[13,8]),
    [iquote('0:Res:13.2,8.0')] ).

cnf(3550,plain,
    ~ c_in(v_x,v_S,t_a),
    inference(res,[status(thm),theory(equality)],[3,3467]),
    [iquote('0:Res:3.0,3467.1')] ).

cnf(3564,plain,
    $false,
    inference(mrr,[status(thm)],[3550,7]),
    [iquote('0:MRR:3550.0,7.0')] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.11  % Problem  : LAT271-1 : TPTP v8.1.0. Released v3.2.0.
% 0.10/0.11  % Command  : run_spass %d %s
% 0.10/0.32  % Computer : n016.cluster.edu
% 0.10/0.32  % Model    : x86_64 x86_64
% 0.10/0.32  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.32  % Memory   : 8042.1875MB
% 0.10/0.32  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.10/0.32  % CPULimit : 300
% 0.10/0.32  % WCLimit  : 600
% 0.10/0.32  % DateTime : Thu Jun 30 16:44:56 EDT 2022
% 0.10/0.32  % CPUTime  : 
% 1.64/1.87  
% 1.64/1.87  SPASS V 3.9 
% 1.64/1.87  SPASS beiseite: Proof found.
% 1.64/1.87  % SZS status Theorem
% 1.64/1.87  Problem: /export/starexec/sandbox/benchmark/theBenchmark.p 
% 1.64/1.87  SPASS derived 411 clauses, backtracked 0 clauses, performed 0 splits and kept 2888 clauses.
% 1.64/1.87  SPASS allocated 80247 KBytes.
% 1.64/1.87  SPASS spent	0:00:01.48 on the problem.
% 1.64/1.87  		0:00:00.23 for the input.
% 1.64/1.87  		0:00:00.00 for the FLOTTER CNF translation.
% 1.64/1.87  		0:00:00.00 for inferences.
% 1.64/1.87  		0:00:00.00 for the backtracking.
% 1.64/1.87  		0:00:00.69 for the reduction.
% 1.64/1.87  
% 1.64/1.87  
% 1.64/1.87  Here is a proof with depth 2, length 7 :
% 1.64/1.87  % SZS output start Refutation
% See solution above
% 1.64/1.87  Formulae used in the proof : cls_conjecture_2 cls_conjecture_6 cls_conjecture_7 cls_Tarski_O_91_124_AS1_A_60_61_Ainterval_Ar_Aa1_Ab1_59_Ax1_A_58_AS1_A_124_93_A_61_61_62_A_Ia1_M_Ax1_J_A_58_Ar_A_61_61_ATrue_0
% 1.64/1.87  
%------------------------------------------------------------------------------