TSTP Solution File: LAT271-2 by CSE_E---1.5

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : CSE_E---1.5
% Problem  : LAT271-2 : TPTP v8.1.2. Released v3.2.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %d %s

% Computer : n018.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  : 300s
% DateTime : Thu Aug 31 06:00:23 EDT 2023

% Result   : Unsatisfiable 0.19s 0.57s
% Output   : CNFRefutation 0.19s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    3
%            Number of leaves      :   16
% Syntax   : Number of formulae    :   22 (   7 unt;  12 typ;   0 def)
%            Number of atoms       :   15 (   0 equ)
%            Maximal formula atoms :    3 (   1 avg)
%            Number of connectives :   12 (   7   ~;   5   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    4 (   2 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of types       :    2 (   0 usr)
%            Number of type conns  :   17 (   6   >;  11   *;   0   +;   0  <<)
%            Number of predicates  :    3 (   2 usr;   1 prp; 0-3 aty)
%            Number of functors    :   10 (  10 usr;   6 con; 0-4 aty)
%            Number of variables   :   13 (   2 sgn;   0   !;   0   ?;   0   :)

% Comments : 
%------------------------------------------------------------------------------
tff(decl_22,type,
    v_S: $i ).

tff(decl_23,type,
    v_r: $i ).

tff(decl_24,type,
    v_a: $i ).

tff(decl_25,type,
    v_b: $i ).

tff(decl_26,type,
    t_a: $i ).

tff(decl_27,type,
    c_Tarski_Ointerval: ( $i * $i * $i * $i ) > $i ).

tff(decl_28,type,
    tc_set: $i > $i ).

tff(decl_29,type,
    c_lessequals: ( $i * $i * $i ) > $o ).

tff(decl_30,type,
    v_x: $i ).

tff(decl_31,type,
    c_in: ( $i * $i * $i ) > $o ).

tff(decl_32,type,
    c_Pair: ( $i * $i * $i * $i ) > $i ).

tff(decl_33,type,
    tc_prod: ( $i * $i ) > $i ).

cnf(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,axiom,
    ( c_in(c_Pair(X5,X1,X3,X3),X4,tc_prod(X3,X3))
    | ~ c_in(X1,X2,X3)
    | ~ c_lessequals(X2,c_Tarski_Ointerval(X4,X5,X6,X3),tc_set(X3)) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',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) ).

cnf(cls_conjecture_2,negated_conjecture,
    c_lessequals(v_S,c_Tarski_Ointerval(v_r,v_a,v_b,t_a),tc_set(t_a)),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_conjecture_2) ).

cnf(cls_conjecture_7,negated_conjecture,
    ~ c_in(c_Pair(v_a,v_x,t_a,t_a),v_r,tc_prod(t_a,t_a)),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_conjecture_7) ).

cnf(cls_conjecture_6,negated_conjecture,
    c_in(v_x,v_S,t_a),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_conjecture_6) ).

cnf(c_0_4,axiom,
    ( c_in(c_Pair(X5,X1,X3,X3),X4,tc_prod(X3,X3))
    | ~ c_in(X1,X2,X3)
    | ~ c_lessequals(X2,c_Tarski_Ointerval(X4,X5,X6,X3),tc_set(X3)) ),
    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 ).

cnf(c_0_5,negated_conjecture,
    c_lessequals(v_S,c_Tarski_Ointerval(v_r,v_a,v_b,t_a),tc_set(t_a)),
    cls_conjecture_2 ).

cnf(c_0_6,negated_conjecture,
    ~ c_in(c_Pair(v_a,v_x,t_a,t_a),v_r,tc_prod(t_a,t_a)),
    cls_conjecture_7 ).

cnf(c_0_7,negated_conjecture,
    ( c_in(c_Pair(v_a,X1,t_a,t_a),v_r,tc_prod(t_a,t_a))
    | ~ c_in(X1,v_S,t_a) ),
    inference(spm,[status(thm)],[c_0_4,c_0_5]) ).

cnf(c_0_8,negated_conjecture,
    c_in(v_x,v_S,t_a),
    cls_conjecture_6 ).

cnf(c_0_9,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_6,c_0_7]),c_0_8])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem    : LAT271-2 : TPTP v8.1.2. Released v3.2.0.
% 0.00/0.13  % Command    : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %d %s
% 0.13/0.34  % Computer : n018.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    : 300
% 0.13/0.34  % DateTime   : Thu Aug 24 07:33:42 EDT 2023
% 0.13/0.34  % CPUTime  : 
% 0.19/0.55  start to proof: theBenchmark
% 0.19/0.57  % Version  : CSE_E---1.5
% 0.19/0.57  % Problem  : theBenchmark.p
% 0.19/0.57  % Proof found
% 0.19/0.57  % SZS status Theorem for theBenchmark.p
% 0.19/0.57  % SZS output start Proof
% See solution above
% 0.19/0.57  % Total time : 0.004000 s
% 0.19/0.57  % SZS output end Proof
% 0.19/0.57  % Total time : 0.006000 s
%------------------------------------------------------------------------------