↑ Up

CSE_E---1.7.THM-CRf.s

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

% Computer : n015.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:09 PM UTC 2026

% Result   : Theorem 1.28s 1.73s
% Output   : CNFRefutation 1.28s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    6
%            Number of leaves      :    6
% Syntax   : Number of formulae    :   25 (  25 unt;   0 def)
%            Number of atoms       :   25 (  24 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    :    4 (   2 avg)
%            Number of predicates  :    2 (   0 usr;   1 prp; 0-2 aty)
%            Number of functors    :    6 (   6 usr;   2 con; 0-2 aty)
%            Number of variables   :   46 (   0 sgn  26   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(difference_distributes_over_union,axiom,
    ! [X1,X2,X3] : difference(union(X1,X2),X3) = union(difference(X1,X3),difference(X2,X3)),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',difference_distributes_over_union) ).

fof(difference_into_intersection,axiom,
    ! [X1,X2] : difference(X1,intersection(X1,X2)) = difference(X1,X2),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',difference_into_intersection) ).

fof(commutativity_of_union,axiom,
    ! [X1,X2] : union(X1,X2) = union(X2,X1),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',commutativity_of_union) ).

fof(commutativity_of_intersection,axiom,
    ! [X1,X2] : intersection(X1,X2) = intersection(X2,X1),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',commutativity_of_intersection) ).

fof(prove_th96,conjecture,
    ! [X1,X2] : symmetric_difference(X1,X2) = difference(union(X1,X2),intersection(X1,X2)),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_th96) ).

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

fof(c_0_6,plain,
    ! [X41,X42,X43] : difference(union(X41,X42),X43) = union(difference(X41,X43),difference(X42,X43)),
    inference(variable_rename,[status(thm)],[difference_distributes_over_union]) ).

fof(c_0_7,plain,
    ! [X39,X40] : difference(X39,intersection(X39,X40)) = difference(X39,X40),
    inference(variable_rename,[status(thm)],[difference_into_intersection]) ).

fof(c_0_8,plain,
    ! [X55,X56] : union(X55,X56) = union(X56,X55),
    inference(variable_rename,[status(thm)],[commutativity_of_union]) ).

fof(c_0_9,plain,
    ! [X57,X58] : intersection(X57,X58) = intersection(X58,X57),
    inference(variable_rename,[status(thm)],[commutativity_of_intersection]) ).

fof(c_0_10,negated_conjecture,
    ~ ! [X1,X2] : symmetric_difference(X1,X2) = difference(union(X1,X2),intersection(X1,X2)),
    inference(assume_negation,[status(cth)],[prove_th96]) ).

cnf(c_0_11,plain,
    difference(union(X1,X2),X3) = union(difference(X1,X3),difference(X2,X3)),
    inference(split_conjunct,[status(thm)],[c_0_6]) ).

cnf(c_0_12,plain,
    difference(X1,intersection(X1,X2)) = difference(X1,X2),
    inference(split_conjunct,[status(thm)],[c_0_7]) ).

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

cnf(c_0_14,plain,
    intersection(X1,X2) = intersection(X2,X1),
    inference(split_conjunct,[status(thm)],[c_0_9]) ).

fof(c_0_15,negated_conjecture,
    symmetric_difference(esk3_0,esk4_0) != difference(union(esk3_0,esk4_0),intersection(esk3_0,esk4_0)),
    inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_10])])]) ).

fof(c_0_16,plain,
    ! [X37,X38] : symmetric_difference(X37,X38) = union(difference(X37,X38),difference(X38,X37)),
    inference(variable_rename,[status(thm)],[symmetric_difference_defn]) ).

cnf(c_0_17,plain,
    union(difference(X1,X2),difference(X3,intersection(X1,X2))) = difference(union(X3,X1),intersection(X1,X2)),
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_12]),c_0_13]) ).

cnf(c_0_18,plain,
    difference(X1,intersection(X2,X1)) = difference(X1,X2),
    inference(spm,[status(thm)],[c_0_12,c_0_14]) ).

cnf(c_0_19,negated_conjecture,
    symmetric_difference(esk3_0,esk4_0) != difference(union(esk3_0,esk4_0),intersection(esk3_0,esk4_0)),
    inference(split_conjunct,[status(thm)],[c_0_15]) ).

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

cnf(c_0_21,plain,
    difference(union(X1,X2),intersection(X2,X1)) = union(difference(X2,X1),difference(X1,X2)),
    inference(spm,[status(thm)],[c_0_17,c_0_18]) ).

cnf(c_0_22,negated_conjecture,
    union(difference(esk3_0,esk4_0),difference(esk4_0,esk3_0)) != difference(union(esk3_0,esk4_0),intersection(esk3_0,esk4_0)),
    inference(rw,[status(thm)],[c_0_19,c_0_20]) ).

cnf(c_0_23,plain,
    difference(union(X1,X2),intersection(X1,X2)) = union(difference(X2,X1),difference(X1,X2)),
    inference(spm,[status(thm)],[c_0_21,c_0_14]) ).

cnf(c_0_24,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_22,c_0_23]),c_0_13])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13  % Problem    : SET620+3 : TPTP v9.2.1. Released v2.2.0.
% 0.00/0.13  % Command    : /export/starexec/sandbox2/solver/bin/lemma_parallel_prover %s --lemma-prover /export/starexec/sandbox2/solver/bin/cse --final-prover /export/starexec/sandbox2/solver/bin/eprover --proof-time %d --global-time-limit %d
% 0.15/0.34  % Computer : n015.cluster.edu
% 0.15/0.34  % Model    : x86_64 x86_64
% 0.15/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.34  % Memory   : 8042.1875MB
% 0.15/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.15/0.34  % CPULimit   : 300
% 0.15/0.34  % WCLimit    : 300
% 0.15/0.34  % DateTime   : Tue May  5 02:30:32 EDT 2026
% 0.15/0.34  % CPUTime    : 
% 0.15/0.35  % start to proof: theBenchmark
% 1.28/1.73  % Version  : CSE_E---1.7
% 1.28/1.73  % Problem  : theBenchmark.p
% 1.28/1.73  % SZS status Theorem for theBenchmark.p
% 1.28/1.73  % SZS output start CNFRefutation
% See solution above
% 1.28/1.73  % Total time : 1.374s
%------------------------------------------------------------------------------