↑ Up

CSE_E---1.7.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : CSE_E---1.7
% Problem  : SET015+4 : 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 : n031.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:06:50 PM UTC 2026

% Result   : Theorem 1.34s 1.75s
% Output   : CNFRefutation 1.34s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   12
%            Number of leaves      :    4
% Syntax   : Number of formulae    :   38 (  11 unt;   0 def)
%            Number of atoms       :   85 (   0 equ)
%            Maximal formula atoms :    7 (   2 avg)
%            Number of connectives :   94 (  47   ~;  36   |;   7   &)
%                                         (   3 <=>;   1  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   10 (   3 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    4 (   3 usr;   1 prp; 0-2 aty)
%            Number of functors    :    4 (   4 usr;   2 con; 0-2 aty)
%            Number of variables   :   37 (   2 sgn  22   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(thI07,conjecture,
    ! [X1,X2] : equal_set(union(X1,X2),union(X2,X1)),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',thI07) ).

fof(equal_set,axiom,
    ! [X1,X2] :
      ( equal_set(X1,X2)
    <=> ( subset(X1,X2)
        & subset(X2,X1) ) ),
    file('/export/starexec/sandbox/benchmark/Axioms/SET006+0.ax',equal_set) ).

fof(subset,axiom,
    ! [X1,X2] :
      ( subset(X1,X2)
    <=> ! [X3] :
          ( member(X3,X1)
         => member(X3,X2) ) ),
    file('/export/starexec/sandbox/benchmark/Axioms/SET006+0.ax',subset) ).

fof(union,axiom,
    ! [X3,X1,X2] :
      ( member(X3,union(X1,X2))
    <=> ( member(X3,X1)
        | member(X3,X2) ) ),
    file('/export/starexec/sandbox/benchmark/Axioms/SET006+0.ax',union) ).

fof(c_0_4,negated_conjecture,
    ~ ! [X1,X2] : equal_set(union(X1,X2),union(X2,X1)),
    inference(assume_negation,[status(cth)],[thI07]) ).

fof(c_0_5,negated_conjecture,
    ~ equal_set(union(esk4_0,esk5_0),union(esk5_0,esk4_0)),
    inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_4])])]) ).

fof(c_0_6,plain,
    ! [X42,X43] :
      ( ( subset(X42,X43)
        | ~ equal_set(X42,X43) )
      & ( subset(X43,X42)
        | ~ equal_set(X42,X43) )
      & ( ~ subset(X42,X43)
        | ~ subset(X43,X42)
        | equal_set(X42,X43) ) ),
    inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[equal_set])])]) ).

cnf(c_0_7,negated_conjecture,
    ~ equal_set(union(esk4_0,esk5_0),union(esk5_0,esk4_0)),
    inference(split_conjunct,[status(thm)],[c_0_5]) ).

cnf(c_0_8,plain,
    ( equal_set(X1,X2)
    | ~ subset(X1,X2)
    | ~ subset(X2,X1) ),
    inference(split_conjunct,[status(thm)],[c_0_6]) ).

fof(c_0_9,plain,
    ! [X36,X37,X38,X39,X40] :
      ( ( ~ subset(X36,X37)
        | ~ member(X38,X36)
        | member(X38,X37) )
      & ( member(esk1_2(X39,X40),X39)
        | subset(X39,X40) )
      & ( ~ member(esk1_2(X39,X40),X40)
        | subset(X39,X40) ) ),
    inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[subset])])])])])]) ).

cnf(c_0_10,negated_conjecture,
    ( ~ subset(union(esk5_0,esk4_0),union(esk4_0,esk5_0))
    | ~ subset(union(esk4_0,esk5_0),union(esk5_0,esk4_0)) ),
    inference(spm,[status(thm)],[c_0_7,c_0_8]) ).

cnf(c_0_11,plain,
    ( subset(X1,X2)
    | ~ member(esk1_2(X1,X2),X2) ),
    inference(split_conjunct,[status(thm)],[c_0_9]) ).

cnf(c_0_12,negated_conjecture,
    ( ~ member(esk1_2(union(esk5_0,esk4_0),union(esk4_0,esk5_0)),union(esk4_0,esk5_0))
    | ~ subset(union(esk4_0,esk5_0),union(esk5_0,esk4_0)) ),
    inference(spm,[status(thm)],[c_0_10,c_0_11]) ).

fof(c_0_13,plain,
    ! [X49,X50,X51] :
      ( ( ~ member(X49,union(X50,X51))
        | member(X49,X50)
        | member(X49,X51) )
      & ( ~ member(X49,X50)
        | member(X49,union(X50,X51)) )
      & ( ~ member(X49,X51)
        | member(X49,union(X50,X51)) ) ),
    inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[union])])]) ).

cnf(c_0_14,plain,
    ( member(esk1_2(X1,X2),X1)
    | subset(X1,X2) ),
    inference(split_conjunct,[status(thm)],[c_0_9]) ).

cnf(c_0_15,negated_conjecture,
    ( ~ member(esk1_2(union(esk5_0,esk4_0),union(esk4_0,esk5_0)),union(esk4_0,esk5_0))
    | ~ member(esk1_2(union(esk4_0,esk5_0),union(esk5_0,esk4_0)),union(esk5_0,esk4_0)) ),
    inference(spm,[status(thm)],[c_0_12,c_0_11]) ).

cnf(c_0_16,plain,
    ( member(X1,union(X2,X3))
    | ~ member(X1,X2) ),
    inference(split_conjunct,[status(thm)],[c_0_13]) ).

cnf(c_0_17,plain,
    ( member(X1,union(X3,X2))
    | ~ member(X1,X2) ),
    inference(split_conjunct,[status(thm)],[c_0_13]) ).

cnf(c_0_18,negated_conjecture,
    ( member(esk1_2(union(esk4_0,esk5_0),union(esk5_0,esk4_0)),union(esk4_0,esk5_0))
    | ~ member(esk1_2(union(esk5_0,esk4_0),union(esk4_0,esk5_0)),union(esk4_0,esk5_0)) ),
    inference(spm,[status(thm)],[c_0_12,c_0_14]) ).

cnf(c_0_19,negated_conjecture,
    ( ~ member(esk1_2(union(esk4_0,esk5_0),union(esk5_0,esk4_0)),union(esk5_0,esk4_0))
    | ~ member(esk1_2(union(esk5_0,esk4_0),union(esk4_0,esk5_0)),esk4_0) ),
    inference(spm,[status(thm)],[c_0_15,c_0_16]) ).

cnf(c_0_20,negated_conjecture,
    ( ~ member(esk1_2(union(esk4_0,esk5_0),union(esk5_0,esk4_0)),union(esk5_0,esk4_0))
    | ~ member(esk1_2(union(esk5_0,esk4_0),union(esk4_0,esk5_0)),esk5_0) ),
    inference(spm,[status(thm)],[c_0_15,c_0_17]) ).

cnf(c_0_21,negated_conjecture,
    ( member(esk1_2(union(esk5_0,esk4_0),union(esk4_0,esk5_0)),union(esk5_0,esk4_0))
    | ~ subset(union(esk4_0,esk5_0),union(esk5_0,esk4_0)) ),
    inference(spm,[status(thm)],[c_0_10,c_0_14]) ).

cnf(c_0_22,plain,
    ( member(X1,X2)
    | member(X1,X3)
    | ~ member(X1,union(X2,X3)) ),
    inference(split_conjunct,[status(thm)],[c_0_13]) ).

cnf(c_0_23,negated_conjecture,
    ( member(esk1_2(union(esk4_0,esk5_0),union(esk5_0,esk4_0)),union(esk4_0,esk5_0))
    | ~ member(esk1_2(union(esk5_0,esk4_0),union(esk4_0,esk5_0)),esk4_0) ),
    inference(spm,[status(thm)],[c_0_18,c_0_16]) ).

cnf(c_0_24,negated_conjecture,
    ( ~ member(esk1_2(union(esk5_0,esk4_0),union(esk4_0,esk5_0)),esk4_0)
    | ~ member(esk1_2(union(esk4_0,esk5_0),union(esk5_0,esk4_0)),esk4_0) ),
    inference(spm,[status(thm)],[c_0_19,c_0_17]) ).

cnf(c_0_25,negated_conjecture,
    ( ~ member(esk1_2(union(esk5_0,esk4_0),union(esk4_0,esk5_0)),esk4_0)
    | ~ member(esk1_2(union(esk4_0,esk5_0),union(esk5_0,esk4_0)),esk5_0) ),
    inference(spm,[status(thm)],[c_0_19,c_0_16]) ).

cnf(c_0_26,negated_conjecture,
    ( member(esk1_2(union(esk4_0,esk5_0),union(esk5_0,esk4_0)),union(esk4_0,esk5_0))
    | ~ member(esk1_2(union(esk5_0,esk4_0),union(esk4_0,esk5_0)),esk5_0) ),
    inference(spm,[status(thm)],[c_0_18,c_0_17]) ).

cnf(c_0_27,negated_conjecture,
    ( ~ member(esk1_2(union(esk5_0,esk4_0),union(esk4_0,esk5_0)),esk5_0)
    | ~ member(esk1_2(union(esk4_0,esk5_0),union(esk5_0,esk4_0)),esk4_0) ),
    inference(spm,[status(thm)],[c_0_20,c_0_17]) ).

cnf(c_0_28,negated_conjecture,
    ( ~ member(esk1_2(union(esk5_0,esk4_0),union(esk4_0,esk5_0)),esk5_0)
    | ~ member(esk1_2(union(esk4_0,esk5_0),union(esk5_0,esk4_0)),esk5_0) ),
    inference(spm,[status(thm)],[c_0_20,c_0_16]) ).

cnf(c_0_29,negated_conjecture,
    ( member(esk1_2(union(esk5_0,esk4_0),union(esk4_0,esk5_0)),union(esk5_0,esk4_0))
    | ~ member(esk1_2(union(esk4_0,esk5_0),union(esk5_0,esk4_0)),union(esk5_0,esk4_0)) ),
    inference(spm,[status(thm)],[c_0_21,c_0_11]) ).

cnf(c_0_30,negated_conjecture,
    ~ member(esk1_2(union(esk5_0,esk4_0),union(esk4_0,esk5_0)),esk4_0),
    inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_23]),c_0_24]),c_0_25]) ).

cnf(c_0_31,negated_conjecture,
    ~ member(esk1_2(union(esk5_0,esk4_0),union(esk4_0,esk5_0)),esk5_0),
    inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_26]),c_0_27]),c_0_28]) ).

cnf(c_0_32,negated_conjecture,
    ( member(esk1_2(union(esk4_0,esk5_0),union(esk5_0,esk4_0)),union(esk4_0,esk5_0))
    | member(esk1_2(union(esk5_0,esk4_0),union(esk4_0,esk5_0)),union(esk5_0,esk4_0)) ),
    inference(spm,[status(thm)],[c_0_21,c_0_14]) ).

cnf(c_0_33,negated_conjecture,
    ~ member(esk1_2(union(esk4_0,esk5_0),union(esk5_0,esk4_0)),union(esk5_0,esk4_0)),
    inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_29]),c_0_30]),c_0_31]) ).

cnf(c_0_34,negated_conjecture,
    member(esk1_2(union(esk4_0,esk5_0),union(esk5_0,esk4_0)),union(esk4_0,esk5_0)),
    inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_32]),c_0_30]),c_0_31]) ).

cnf(c_0_35,negated_conjecture,
    ~ member(esk1_2(union(esk4_0,esk5_0),union(esk5_0,esk4_0)),esk5_0),
    inference(spm,[status(thm)],[c_0_33,c_0_16]) ).

cnf(c_0_36,negated_conjecture,
    ~ member(esk1_2(union(esk4_0,esk5_0),union(esk5_0,esk4_0)),esk4_0),
    inference(spm,[status(thm)],[c_0_33,c_0_17]) ).

cnf(c_0_37,negated_conjecture,
    $false,
    inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_34]),c_0_35]),c_0_36]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem    : SET015+4 : TPTP v9.2.1. Released v2.2.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.16/0.33  % Computer : n031.cluster.edu
% 0.16/0.33  % Model    : x86_64 x86_64
% 0.16/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.33  % Memory   : 8042.1875MB
% 0.16/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.16/0.33  % CPULimit   : 300
% 0.16/0.33  % WCLimit    : 300
% 0.16/0.33  % DateTime   : Tue May  5 02:07:53 EDT 2026
% 0.16/0.34  % CPUTime    : 
% 0.16/0.35  % start to proof: theBenchmark
% 1.34/1.75  % Version  : CSE_E---1.7
% 1.34/1.75  % Problem  : theBenchmark.p
% 1.34/1.75  % SZS status Theorem for theBenchmark.p
% 1.34/1.75  % SZS output start CNFRefutation
% See solution above
% 1.34/1.75  % Total time : 1.371s
%------------------------------------------------------------------------------