↑ Up

CSE_E---1.7.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : CSE_E---1.7
% Problem  : SET599+3 : TPTP v9.2.1. Released v2.2.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 : 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 : Tue May  5 05:08:05 PM UTC 2026

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

% Comments : 
%------------------------------------------------------------------------------
fof(prove_th58,conjecture,
    ! [X1,X2] : subset(difference(X1,X2),symmetric_difference(X1,X2)),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_th58) ).

fof(symmetric_difference_defn,axiom,
    ! [X1,X2] : symmetric_difference(X1,X2) = union(difference(X1,X2),difference(X2,X1)),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',symmetric_difference_defn) ).

fof(subset_of_union,axiom,
    ! [X1,X2] : subset(X1,union(X1,X2)),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',subset_of_union) ).

fof(c_0_3,negated_conjecture,
    ~ ! [X1,X2] : subset(difference(X1,X2),symmetric_difference(X1,X2)),
    inference(assume_negation,[status(cth)],[prove_th58]) ).

fof(c_0_4,negated_conjecture,
    ~ subset(difference(esk3_0,esk4_0),symmetric_difference(esk3_0,esk4_0)),
    inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_3])])]) ).

fof(c_0_5,plain,
    ! [X24,X25] : symmetric_difference(X24,X25) = union(difference(X24,X25),difference(X25,X24)),
    inference(variable_rename,[status(thm)],[symmetric_difference_defn]) ).

cnf(c_0_6,negated_conjecture,
    ~ subset(difference(esk3_0,esk4_0),symmetric_difference(esk3_0,esk4_0)),
    inference(split_conjunct,[status(thm)],[c_0_4]) ).

cnf(c_0_7,plain,
    symmetric_difference(X1,X2) = union(difference(X1,X2),difference(X2,X1)),
    inference(split_conjunct,[status(thm)],[c_0_5]) ).

fof(c_0_8,plain,
    ! [X26,X27] : subset(X26,union(X26,X27)),
    inference(variable_rename,[status(thm)],[subset_of_union]) ).

cnf(c_0_9,negated_conjecture,
    ~ subset(difference(esk3_0,esk4_0),union(difference(esk3_0,esk4_0),difference(esk4_0,esk3_0))),
    inference(rw,[status(thm)],[c_0_6,c_0_7]) ).

cnf(c_0_10,plain,
    subset(X1,union(X1,X2)),
    inference(split_conjunct,[status(thm)],[c_0_8]) ).

cnf(c_0_11,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_9,c_0_10])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11  % Problem    : SET599+3 : TPTP v9.2.1. Released v2.2.0.
% 0.00/0.11  % 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.13/0.32  % Computer : n029.cluster.edu
% 0.13/0.32  % Model    : x86_64 x86_64
% 0.13/0.32  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.32  % Memory   : 8042.1875MB
% 0.13/0.32  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.32  % CPULimit   : 300
% 0.13/0.32  % WCLimit    : 300
% 0.13/0.32  % DateTime   : Tue May  5 02:28:59 EDT 2026
% 0.13/0.32  % CPUTime    : 
% 0.13/0.33  % start to proof: theBenchmark
% 0.26/1.61  % Version  : CSE_E---1.7
% 0.26/1.61  % Problem  : theBenchmark.p
% 0.26/1.61  % SZS status Theorem for theBenchmark.p
% 0.26/1.61  % SZS output start CNFRefutation
% See solution above
% 0.26/1.61  % Total time : 1.270s
%------------------------------------------------------------------------------