↑ Up

E---3.5.1.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : E---3.5.1
% Problem  : SET704+4 : TPTP v9.3.1. Released v2.2.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM

% Computer : n006.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:15:02 PM UTC 2026

% Result   : Theorem 0.31s 0.53s
% Output   : CNFRefutation 0.31s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    5
%            Number of leaves      :    3
% Syntax   : Number of formulae    :   15 (   3 unt;   0 def)
%            Number of atoms       :   41 (   0 equ)
%            Maximal formula atoms :    7 (   2 avg)
%            Number of connectives :   40 (  14   ~;  15   |;   5   &)
%                                         (   2 <=>;   4  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   10 (   4 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    3 (   2 usr;   1 prp; 0-2 aty)
%            Number of functors    :    5 (   5 usr;   2 con; 0-2 aty)
%            Number of variables   :   32 (   0 sgn  20   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(product,axiom,
    ! [X3,X1] :
      ( member(X3,product(X1))
    <=> ! [X5] :
          ( member(X5,X1)
         => member(X3,X5) ) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/SET006+0.ax',product) ).

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

fof(thI42,conjecture,
    ! [X1,X3] :
      ( member(X3,X1)
     => subset(product(X1),X3) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',thI42) ).

fof(c_0_3,plain,
    ! [X14,X15,X16,X17,X18] :
      ( ( member(X17,product(X18))
        | ~ member(X17,esk4_2(X17,X18)) )
      & ( member(X17,product(X18))
        | member(esk4_2(X17,X18),X18) )
      & ( member(X14,X16)
        | ~ member(X16,X15)
        | ~ member(X14,product(X15)) ) ),
    inference(distribute,[status(thm)],[inference(fof_nnf,[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)],[product])])])])])])]) ).

fof(c_0_4,plain,
    ! [X8,X9,X10,X11,X12] :
      ( ( subset(X11,X12)
        | ~ member(esk3_2(X11,X12),X12) )
      & ( subset(X11,X12)
        | member(esk3_2(X11,X12),X11) )
      & ( member(X10,X9)
        | ~ member(X10,X8)
        | ~ subset(X8,X9) ) ),
    inference(distribute,[status(thm)],[inference(fof_nnf,[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])])])])])])]) ).

fof(c_0_5,negated_conjecture,
    ~ ! [X1,X3] :
        ( member(X3,X1)
       => subset(product(X1),X3) ),
    inference(assume_negation,[status(cth)],[thI42]) ).

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

cnf(c_0_7,plain,
    ( subset(X1,X2)
    | member(esk3_2(X1,X2),X1) ),
    inference(split_conjunct,[status(thm)],[c_0_4]) ).

fof(c_0_8,negated_conjecture,
    ( ~ subset(product(esk1_0),esk2_0)
    & member(esk2_0,esk1_0) ),
    inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_5])])])]) ).

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

cnf(c_0_10,plain,
    ( ~ member(X3,X1)
    | subset(product(X1),X2)
    | member(esk3_2(product(X1),X2),X3) ),
    inference(spm,[status(thm)],[c_0_6,c_0_7]) ).

cnf(c_0_11,negated_conjecture,
    ~ subset(product(esk1_0),esk2_0),
    inference(split_conjunct,[status(thm)],[c_0_8]) ).

cnf(c_0_12,plain,
    ( ~ member(X2,X1)
    | subset(product(X1),X2) ),
    inference(spm,[status(thm)],[c_0_9,c_0_10]) ).

cnf(c_0_13,negated_conjecture,
    member(esk2_0,esk1_0),
    inference(split_conjunct,[status(thm)],[c_0_8]) ).

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.04  % Problem  : SET704+4 : TPTP v9.3.1. Released v2.2.0.
% 0.00/0.06  % Command  : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.15/0.39  % Computer : n006.cluster.edu
% 0.15/0.39  % Model    : x86_64 x86_64
% 0.15/0.39  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.39  % Memory   : 8046.5625MB
% 0.15/0.39  % OS       : Linux 6.8.0-71-generic
% 0.15/0.39  % CPULimit : 300
% 0.15/0.39  % WCLimit  : 300
% 0.15/0.39  % DateTime : Mon Sep 21 05:33:12 UTC 2026
% 0.15/0.40  % CPUTime  : 
% 0.15/0.40  Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.18/0.48  Running first-order theorem proving
% 0.18/0.48  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.31/0.53  % Version: 3.5.1
% 0.31/0.53  % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.31/0.53  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.31/0.53  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.31/0.53  % Starting new_bool_3 with 300s (1) cores
% 0.31/0.53  % Starting new_bool_1 with 300s (1) cores
% 0.31/0.53  % Starting sh5l with 300s (1) cores
% 0.31/0.53  % new_bool_3 with pid 2099657 completed with status 0
% 0.31/0.53  % Result found by new_bool_3
% 0.31/0.53  % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.31/0.53  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.31/0.53  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.31/0.53  % Starting new_bool_3 with 300s (1) cores
% 0.31/0.53  % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.31/0.53  % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.31/0.53  % Search class: FGUNF-FFSF21-SFFFFFNN
% 0.31/0.53  % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.31/0.53  % Starting SubtermCWHack with 31s (1) cores
% 0.31/0.53  % SubtermCWHack with pid 2099665 completed with status 0
% 0.31/0.53  % Result found by SubtermCWHack
% 0.31/0.53  % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.31/0.53  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.31/0.53  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.31/0.53  % Starting new_bool_3 with 300s (1) cores
% 0.31/0.53  % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.31/0.53  % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.31/0.53  % Search class: FGUNF-FFSF21-SFFFFFNN
% 0.31/0.53  % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.31/0.53  % Starting SubtermCWHack with 31s (1) cores
% 0.31/0.53  % Preprocessing time       : 0.002 s
% 0.31/0.53  
% 0.31/0.53  % Proof found!
% 0.31/0.53  % SZS status Theorem
% 0.31/0.53  % SZS output start CNFRefutation
% See solution above
% 0.31/0.53  % Parsed axioms                        : 12
% 0.31/0.53  % Removed by relevancy pruning/SinE    : 9
% 0.31/0.53  % Initial clauses                      : 8
% 0.31/0.53  % Removed in clause preprocessing      : 0
% 0.31/0.53  % Initial clauses in saturation        : 8
% 0.31/0.53  % Processed clauses                    : 12
% 0.31/0.53  % ...of these trivial                  : 0
% 0.31/0.53  % ...subsumed                          : 0
% 0.31/0.53  % ...remaining for further processing  : 12
% 0.31/0.53  % Other redundant clauses eliminated   : 0
% 0.31/0.53  % Clauses deleted for lack of memory   : 0
% 0.31/0.53  % Backward-subsumed                    : 0
% 0.31/0.53  % Backward-rewritten                   : 0
% 0.31/0.53  % Generated clauses                    : 11
% 0.31/0.53  % ...of the previous two non-redundant : 9
% 0.31/0.53  % ...aggressively subsumed             : 0
% 0.31/0.53  % Contextual simplify-reflections      : 0
% 0.31/0.53  % Paramodulations                      : 11
% 0.31/0.53  % Factorizations                       : 0
% 0.31/0.53  % NegExts                              : 0
% 0.31/0.53  % Equation resolutions                 : 0
% 0.31/0.53  % Disequality decompositions           : 0
% 0.31/0.53  % Total rewrite steps                  : 1
% 0.31/0.53  % ...of those cached                   : 0
% 0.31/0.53  % Propositional unsat checks           : 0
% 0.31/0.53  %    Propositional check models        : 0
% 0.31/0.53  %    Propositional check unsatisfiable : 0
% 0.31/0.53  %    Propositional clauses             : 0
% 0.31/0.53  %    Propositional clauses after purity: 0
% 0.31/0.53  %    Propositional unsat core size     : 0
% 0.31/0.53  %    Propositional preprocessing time  : 0.000
% 0.31/0.53  %    Propositional encoding time       : 0.000
% 0.31/0.53  %    Propositional solver time         : 0.000
% 0.31/0.53  %    Success case prop preproc time    : 0.000
% 0.31/0.53  %    Success case prop encoding time   : 0.000
% 0.31/0.53  %    Success case prop solver time     : 0.000
% 0.31/0.53  % Current number of processed clauses  : 12
% 0.31/0.53  %    Positive orientable unit clauses  : 2
% 0.31/0.53  %    Positive unorientable unit clauses: 0
% 0.31/0.53  %    Negative unit clauses             : 1
% 0.31/0.53  %    Non-unit-clauses                  : 9
% 0.31/0.53  % Current number of unprocessed clauses: 4
% 0.31/0.53  % ...number of literals in the above   : 14
% 0.31/0.53  % Current number of archived formulas  : 0
% 0.31/0.53  % Current number of archived clauses   : 0
% 0.31/0.53  % Clause-clause subsumption calls (NU) : 12
% 0.31/0.53  % Rec. Clause-clause subsumption calls : 10
% 0.31/0.53  % Non-unit clause-clause subsumptions  : 0
% 0.31/0.53  % Unit Clause-clause subsumption calls : 2
% 0.31/0.53  % Rewrite failures with RHS unbound    : 0
% 0.31/0.53  % BW rewrite match attempts            : 2
% 0.31/0.53  % BW rewrite match successes           : 0
% 0.31/0.53  % Condensation attempts                : 0
% 0.31/0.53  % Condensation successes               : 0
% 0.31/0.53  % Termbank termtop insertions          : 783
% 0.31/0.53  % Search garbage collected termcells   : 248
% 0.31/0.53  
% 0.31/0.53  % -------------------------------------------------
% 0.31/0.53  % User time                : 0.005 s
% 0.31/0.53  % System time              : 0.004 s
% 0.31/0.53  % Total time               : 0.009 s
% 0.31/0.53  % Maximum resident set size: 3648 pages
% 0.31/0.53  
% 0.31/0.53  % -------------------------------------------------
% 0.31/0.53  % User time                : 0.006 s
% 0.31/0.53  % System time              : 0.012 s
% 0.31/0.53  % Total time               : 0.018 s
% 0.31/0.53  % Maximum resident set size: 4864 pages
% 0.31/0.53  % E exiting
%------------------------------------------------------------------------------