↑ Up

CSE_E---1.7.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : CSE_E---1.7
% Problem  : SEU137+2 : TPTP v9.2.1. Released v3.3.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : /export/starexec/sandbox/solver/bin/lemma_parallel_prover %s --lemma-prover /export/starexec/sandbox/solver/bin/cse --final-prover /export/starexec/sandbox/solver/bin/eprover --proof-time %d --global-time-limit %d

% Computer : n027.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 : Tue May  5 05:10:44 PM UTC 2026

% Result   : Theorem 1.26s 1.71s
% Output   : CNFRefutation 1.26s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    5
%            Number of leaves      :    3
% Syntax   : Number of formulae    :   13 (   7 unt;   0 def)
%            Number of atoms       :   19 (  11 equ)
%            Maximal formula atoms :    2 (   1 avg)
%            Number of connectives :   12 (   6   ~;   2   |;   1   &)
%                                         (   0 <=>;   3  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    5 (   3 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    3 (   1 usr;   1 prp; 0-2 aty)
%            Number of functors    :    4 (   4 usr;   2 con; 0-2 aty)
%            Number of variables   :   16 (   0 sgn  12   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(t45_xboole_1,conjecture,
    ! [X1,X2] :
      ( subset(X1,X2)
     => X2 = set_union2(X1,set_difference(X2,X1)) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',t45_xboole_1) ).

fof(t39_xboole_1,lemma,
    ! [X1,X2] : set_union2(X1,set_difference(X2,X1)) = set_union2(X1,X2),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',t39_xboole_1) ).

fof(t12_xboole_1,lemma,
    ! [X1,X2] :
      ( subset(X1,X2)
     => set_union2(X1,X2) = X2 ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',t12_xboole_1) ).

fof(c_0_3,negated_conjecture,
    ~ ! [X1,X2] :
        ( subset(X1,X2)
       => X2 = set_union2(X1,set_difference(X2,X1)) ),
    inference(assume_negation,[status(cth)],[t45_xboole_1]) ).

fof(c_0_4,negated_conjecture,
    ( subset(esk10_0,esk11_0)
    & esk11_0 != set_union2(esk10_0,set_difference(esk11_0,esk10_0)) ),
    inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_3])])]) ).

fof(c_0_5,lemma,
    ! [X191,X192] : set_union2(X191,set_difference(X192,X191)) = set_union2(X191,X192),
    inference(variable_rename,[status(thm)],[t39_xboole_1]) ).

fof(c_0_6,lemma,
    ! [X163,X164] :
      ( ~ subset(X163,X164)
      | set_union2(X163,X164) = X164 ),
    inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t12_xboole_1])]) ).

cnf(c_0_7,negated_conjecture,
    esk11_0 != set_union2(esk10_0,set_difference(esk11_0,esk10_0)),
    inference(split_conjunct,[status(thm)],[c_0_4]) ).

cnf(c_0_8,lemma,
    set_union2(X1,set_difference(X2,X1)) = set_union2(X1,X2),
    inference(split_conjunct,[status(thm)],[c_0_5]) ).

cnf(c_0_9,lemma,
    ( set_union2(X1,X2) = X2
    | ~ subset(X1,X2) ),
    inference(split_conjunct,[status(thm)],[c_0_6]) ).

cnf(c_0_10,negated_conjecture,
    subset(esk10_0,esk11_0),
    inference(split_conjunct,[status(thm)],[c_0_4]) ).

cnf(c_0_11,negated_conjecture,
    set_union2(esk10_0,esk11_0) != esk11_0,
    inference(rw,[status(thm)],[c_0_7,c_0_8]) ).

cnf(c_0_12,negated_conjecture,
    $false,
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_9,c_0_10]),c_0_11]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem    : SEU137+2 : TPTP v9.2.1. Released v3.3.0.
% 0.00/0.12  % Command    : /export/starexec/sandbox/solver/bin/lemma_parallel_prover %s --lemma-prover /export/starexec/sandbox/solver/bin/cse --final-prover /export/starexec/sandbox/solver/bin/eprover --proof-time %d --global-time-limit %d
% 0.14/0.32  % Computer : n027.cluster.edu
% 0.14/0.32  % Model    : x86_64 x86_64
% 0.14/0.32  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.32  % Memory   : 8042.1875MB
% 0.14/0.32  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.32  % CPULimit   : 300
% 0.14/0.32  % WCLimit    : 300
% 0.14/0.32  % DateTime   : Tue May  5 02:44:50 EDT 2026
% 0.14/0.32  % CPUTime    : 
% 0.14/0.33  % start to proof: theBenchmark
% 1.26/1.71  % Version  : CSE_E---1.7
% 1.26/1.71  % Problem  : theBenchmark.p
% 1.26/1.71  % SZS status Theorem for theBenchmark.p
% 1.26/1.71  % SZS output start CNFRefutation
% See solution above
% 1.26/1.71  % Total time : 1.371s
%------------------------------------------------------------------------------