↑ Up

E---3.5.1.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : E---3.5.1
% Problem  : SET060+1 : TPTP v9.3.1. Bugfixed v5.4.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM

% Computer : n007.cluster.edu
% Model    : x86_64 x86_64
% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory   : 8046.5625MB
% OS       : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit  : 300s
% DateTime : Thu Sep 24 02:13:20 PM UTC 2026

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

% Comments : 
%------------------------------------------------------------------------------
fof(special_classes_lemma,conjecture,
    ! [X1,X2] : ~ member(X2,intersection(complement(X1),X1)),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',special_classes_lemma) ).

fof(complement,axiom,
    ! [X1,X5] :
      ( member(X5,complement(X1))
    <=> ( ~ member(X5,X1)
        & member(X5,universal_class) ) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/SET005+0.ax',complement) ).

fof(intersection,axiom,
    ! [X1,X2,X5] :
      ( member(X5,intersection(X1,X2))
    <=> ( member(X5,X2)
        & member(X5,X1) ) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/SET005+0.ax',intersection) ).

fof(c_0_3,negated_conjecture,
    ~ ! [X1,X2] : ~ member(X2,intersection(complement(X1),X1)),
    inference(assume_negation,[status(cth)],[special_classes_lemma]) ).

fof(c_0_4,negated_conjecture,
    ~ ! [X1,X2] : ~ member(X2,intersection(complement(X1),X1)),
    inference(fof_simplification,[status(thm)],[c_0_3]) ).

fof(c_0_5,plain,
    ! [X1,X5] :
      ( member(X5,complement(X1))
    <=> ( ~ member(X5,X1)
        & member(X5,universal_class) ) ),
    inference(fof_simplification,[status(thm)],[complement]) ).

fof(c_0_6,plain,
    ! [X12,X13,X14] :
      ( ( member(X14,intersection(X12,X13))
        | ~ member(X14,X13)
        | ~ member(X14,X12) )
      & ( ~ member(X14,intersection(X12,X13))
        | member(X14,X13) )
      & ( ~ member(X14,intersection(X12,X13))
        | member(X14,X12) ) ),
    inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[intersection])])])]) ).

fof(c_0_7,negated_conjecture,
    member(esk2_0,intersection(complement(esk1_0),esk1_0)),
    inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_4])])]) ).

fof(c_0_8,plain,
    ! [X18,X19] :
      ( ( member(X19,complement(X18))
        | member(X19,X18)
        | ~ member(X19,universal_class) )
      & ( ~ member(X19,complement(X18))
        | ~ member(X19,X18) )
      & ( ~ member(X19,complement(X18))
        | member(X19,universal_class) ) ),
    inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_5])])])]) ).

cnf(c_0_9,plain,
    ( ~ member(X1,intersection(X2,X3))
    | member(X1,X2) ),
    inference(split_conjunct,[status(thm)],[c_0_6]) ).

cnf(c_0_10,negated_conjecture,
    member(esk2_0,intersection(complement(esk1_0),esk1_0)),
    inference(split_conjunct,[status(thm)],[c_0_7]) ).

cnf(c_0_11,plain,
    ( ~ member(X1,intersection(X3,X2))
    | member(X1,X2) ),
    inference(split_conjunct,[status(thm)],[c_0_6]) ).

cnf(c_0_12,plain,
    ( ~ member(X1,complement(X2))
    | ~ member(X1,X2) ),
    inference(split_conjunct,[status(thm)],[c_0_8]) ).

cnf(c_0_13,negated_conjecture,
    member(esk2_0,complement(esk1_0)),
    inference(spm,[status(thm)],[c_0_9,c_0_10]) ).

cnf(c_0_14,negated_conjecture,
    member(esk2_0,esk1_0),
    inference(spm,[status(thm)],[c_0_11,c_0_10]) ).

cnf(c_0_15,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_13]),c_0_14])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SET060+1 : TPTP v9.3.1. Bugfixed v5.4.0.
% 0.00/0.05  % Command  : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.11/5.38  % Computer : n007.cluster.edu
% 0.11/5.38  % Model    : x86_64 x86_64
% 0.11/5.38  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/5.38  % Memory   : 8046.5625MB
% 0.11/5.38  % OS       : Linux 6.8.0-71-generic
% 0.11/5.38  % CPULimit : 300
% 0.11/5.38  % WCLimit  : 300
% 0.11/5.38  % DateTime : Mon Sep 21 04:46:25 UTC 2026
% 0.11/5.38  % CPUTime  : 
% 0.11/5.38  Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.14/5.42  Running first-order theorem proving
% 0.14/5.42  Running: /export/starexec/sandbox2/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.14/5.44  % Version: 3.5.1
% 0.14/5.44  % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.14/5.44  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/5.44  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.14/5.44  % Starting new_bool_3 with 300s (1) cores
% 0.14/5.44  % Starting new_bool_1 with 300s (1) cores
% 0.14/5.44  % Starting sh5l with 300s (1) cores
% 0.14/5.44  % new_bool_3 with pid 204410 completed with status 0
% 0.14/5.44  % Result found by new_bool_3
% 0.14/5.44  % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.14/5.44  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/5.44  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.14/5.44  % Starting new_bool_3 with 300s (1) cores
% 0.14/5.44  % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.14/5.44  % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.14/5.44  % Search class: FGHSM-FFSF31-MFFFFFNN
% 0.14/5.44  % partial match(1): FGHSM-FFMF31-MFFFFFNN
% 0.14/5.44  % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.14/5.44  % Starting SubtermCWHack with 31s (1) cores
% 0.14/5.44  % SubtermCWHack with pid 204413 completed with status 0
% 0.14/5.44  % Result found by SubtermCWHack
% 0.14/5.44  % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.14/5.44  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/5.44  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.14/5.44  % Starting new_bool_3 with 300s (1) cores
% 0.14/5.44  % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.14/5.44  % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.14/5.44  % Search class: FGHSM-FFSF31-MFFFFFNN
% 0.14/5.44  % partial match(1): FGHSM-FFMF31-MFFFFFNN
% 0.14/5.44  % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.14/5.44  % Starting SubtermCWHack with 31s (1) cores
% 0.14/5.44  % Preprocessing time       : 0.002 s
% 0.14/5.44  
% 0.14/5.44  % Proof found!
% 0.14/5.44  % SZS status Theorem
% 0.14/5.44  % SZS output start CNFRefutation
% See solution above
% 0.14/5.44  % Parsed axioms                        : 44
% 0.14/5.44  % Removed by relevancy pruning/SinE    : 32
% 0.14/5.44  % Initial clauses                      : 20
% 0.14/5.44  % Removed in clause preprocessing      : 0
% 0.14/5.44  % Initial clauses in saturation        : 20
% 0.14/5.44  % Processed clauses                    : 15
% 0.14/5.44  % ...of these trivial                  : 0
% 0.14/5.44  % ...subsumed                          : 0
% 0.14/5.44  % ...remaining for further processing  : 15
% 0.14/5.44  % Other redundant clauses eliminated   : 0
% 0.14/5.44  % Clauses deleted for lack of memory   : 0
% 0.14/5.44  % Backward-subsumed                    : 0
% 0.14/5.44  % Backward-rewritten                   : 0
% 0.14/5.44  % Generated clauses                    : 8
% 0.14/5.44  % ...of the previous two non-redundant : 5
% 0.14/5.44  % ...aggressively subsumed             : 0
% 0.14/5.44  % Contextual simplify-reflections      : 0
% 0.14/5.44  % Paramodulations                      : 8
% 0.14/5.44  % Factorizations                       : 0
% 0.14/5.44  % NegExts                              : 0
% 0.14/5.44  % Equation resolutions                 : 0
% 0.14/5.44  % Disequality decompositions           : 0
% 0.14/5.44  % Total rewrite steps                  : 1
% 0.14/5.44  % ...of those cached                   : 0
% 0.14/5.44  % Propositional unsat checks           : 0
% 0.14/5.44  %    Propositional check models        : 0
% 0.14/5.44  %    Propositional check unsatisfiable : 0
% 0.14/5.44  %    Propositional clauses             : 0
% 0.14/5.44  %    Propositional clauses after purity: 0
% 0.14/5.44  %    Propositional unsat core size     : 0
% 0.14/5.44  %    Propositional preprocessing time  : 0.000
% 0.14/5.44  %    Propositional encoding time       : 0.000
% 0.14/5.44  %    Propositional solver time         : 0.000
% 0.14/5.44  %    Success case prop preproc time    : 0.000
% 0.14/5.44  %    Success case prop encoding time   : 0.000
% 0.14/5.44  %    Success case prop solver time     : 0.000
% 0.14/5.44  % Current number of processed clauses  : 15
% 0.14/5.44  %    Positive orientable unit clauses  : 6
% 0.14/5.44  %    Positive unorientable unit clauses: 0
% 0.14/5.44  %    Negative unit clauses             : 1
% 0.14/5.44  %    Non-unit-clauses                  : 8
% 0.14/5.44  % Current number of unprocessed clauses: 9
% 0.14/5.44  % ...number of literals in the above   : 18
% 0.14/5.44  % Current number of archived formulas  : 0
% 0.14/5.44  % Current number of archived clauses   : 0
% 0.14/5.44  % Clause-clause subsumption calls (NU) : 22
% 0.14/5.44  % Rec. Clause-clause subsumption calls : 22
% 0.14/5.44  % Non-unit clause-clause subsumptions  : 0
% 0.14/5.44  % Unit Clause-clause subsumption calls : 0
% 0.14/5.44  % Rewrite failures with RHS unbound    : 0
% 0.14/5.44  % BW rewrite match attempts            : 0
% 0.14/5.44  % BW rewrite match successes           : 0
% 0.14/5.44  % Condensation attempts                : 0
% 0.14/5.44  % Condensation successes               : 0
% 0.14/5.44  % Termbank termtop insertions          : 1529
% 0.14/5.44  % Search garbage collected termcells   : 408
% 0.14/5.44  
% 0.14/5.44  % -------------------------------------------------
% 0.14/5.44  % User time                : 0.004 s
% 0.14/5.44  % System time              : 0.001 s
% 0.14/5.44  % Total time               : 0.005 s
% 0.14/5.44  % Maximum resident set size: 3896 pages
% 0.14/5.44  
% 0.14/5.44  % -------------------------------------------------
% 0.14/5.44  % User time                : 0.008 s
% 0.14/5.44  % System time              : 0.004 s
% 0.14/5.44  % Total time               : 0.012 s
% 0.14/5.44  % Maximum resident set size: 4864 pages
% 0.14/5.44  % E exiting
%------------------------------------------------------------------------------