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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : CSE_E---1.5
% Problem  : LCL441-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 : n029.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:54:05 EDT 2023

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

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

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

tff(decl_24,type,
    c_PropLog_Opl_Ovar: ( $i * $i ) > $i ).

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

tff(decl_26,type,
    c_PropLog_Opl_Oop_A_N_62: ( $i * $i * $i ) > $i ).

tff(decl_27,type,
    c_emptyset: $i ).

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

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

tff(decl_30,type,
    c_PropLog_Othms: ( $i * $i ) > $i ).

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

cnf(cls_conjecture_3,negated_conjecture,
    ( ~ c_in(c_PropLog_Opl_Oop_A_N_62(c_PropLog_Opl_Ovar(v_a,t_a),c_PropLog_Opl_Ofalse,t_a),c_PropLog_Othms(c_insert(c_PropLog_Opl_Oop_A_N_62(c_PropLog_Opl_Ovar(v_a,t_a),c_PropLog_Opl_Ofalse,t_a),c_emptyset,tc_PropLog_Opl(t_a)),t_a),tc_PropLog_Opl(t_a))
    | ~ c_in(c_PropLog_Opl_Ovar(v_a,t_a),c_PropLog_Othms(c_insert(c_PropLog_Opl_Ovar(v_a,t_a),c_emptyset,tc_PropLog_Opl(t_a)),t_a),tc_PropLog_Opl(t_a)) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_conjecture_3) ).

cnf(cls_PropLog_Othms_OH_0,axiom,
    ( c_in(X1,c_PropLog_Othms(X2,X3),tc_PropLog_Opl(X3))
    | ~ c_in(X1,X2,tc_PropLog_Opl(X3)) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_PropLog_Othms_OH_0) ).

cnf(cls_Set_OinsertCI_1,axiom,
    c_in(X1,c_insert(X1,X2,X3),X3),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_Set_OinsertCI_1) ).

cnf(c_0_3,negated_conjecture,
    ( ~ c_in(c_PropLog_Opl_Oop_A_N_62(c_PropLog_Opl_Ovar(v_a,t_a),c_PropLog_Opl_Ofalse,t_a),c_PropLog_Othms(c_insert(c_PropLog_Opl_Oop_A_N_62(c_PropLog_Opl_Ovar(v_a,t_a),c_PropLog_Opl_Ofalse,t_a),c_emptyset,tc_PropLog_Opl(t_a)),t_a),tc_PropLog_Opl(t_a))
    | ~ c_in(c_PropLog_Opl_Ovar(v_a,t_a),c_PropLog_Othms(c_insert(c_PropLog_Opl_Ovar(v_a,t_a),c_emptyset,tc_PropLog_Opl(t_a)),t_a),tc_PropLog_Opl(t_a)) ),
    cls_conjecture_3 ).

cnf(c_0_4,axiom,
    ( c_in(X1,c_PropLog_Othms(X2,X3),tc_PropLog_Opl(X3))
    | ~ c_in(X1,X2,tc_PropLog_Opl(X3)) ),
    cls_PropLog_Othms_OH_0 ).

cnf(c_0_5,axiom,
    c_in(X1,c_insert(X1,X2,X3),X3),
    cls_Set_OinsertCI_1 ).

cnf(c_0_6,negated_conjecture,
    ~ c_in(c_PropLog_Opl_Ovar(v_a,t_a),c_PropLog_Othms(c_insert(c_PropLog_Opl_Ovar(v_a,t_a),c_emptyset,tc_PropLog_Opl(t_a)),t_a),tc_PropLog_Opl(t_a)),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_3,c_0_4]),c_0_5])]) ).

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem    : LCL441-2 : TPTP v8.1.2. Released v3.2.0.
% 0.00/0.12  % Command    : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %d %s
% 0.12/0.34  % Computer : n029.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    : 300
% 0.12/0.34  % DateTime   : Fri Aug 25 00:30:23 EDT 2023
% 0.12/0.34  % CPUTime  : 
% 0.19/0.57  start to proof: theBenchmark
% 0.19/0.59  % Version  : CSE_E---1.5
% 0.19/0.59  % Problem  : theBenchmark.p
% 0.19/0.59  % Proof found
% 0.19/0.59  % SZS status Theorem for theBenchmark.p
% 0.19/0.59  % SZS output start Proof
% See solution above
% 0.19/0.59  % Total time : 0.003000 s
% 0.19/0.59  % SZS output end Proof
% 0.19/0.59  % Total time : 0.006000 s
%------------------------------------------------------------------------------