↑ Up

E---3.5.1.THM-CRf.s

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

% Computer : n020.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 12:11:27 PM UTC 2026

% Result   : Theorem 0.11s 0.44s
% Output   : CNFRefutation 0.11s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    9
%            Number of leaves      :    4
% Syntax   : Number of formulae    :   25 (   9 unt;   0 def)
%            Number of atoms       :   99 (  12 equ)
%            Maximal formula atoms :   16 (   3 avg)
%            Number of connectives :  121 (  47   ~;  53   |;  15   &)
%                                         (   1 <=>;   5  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   12 (   4 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of predicates  :    6 (   4 usr;   1 prp; 0-3 aty)
%            Number of functors    :    4 (   4 usr;   4 con; 0-0 aty)
%            Number of variables   :   31 (   0 sgn  14   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(mTCTrans,axiom,
    ! [X1,X2,X3,X4] :
      ( ( aElement0(X4)
        & aElement0(X3)
        & aRewritingSystem0(X2)
        & aElement0(X1) )
     => ( ( sdtmndtplgtdt0(X3,X2,X4)
          & sdtmndtplgtdt0(X1,X2,X3) )
       => sdtmndtplgtdt0(X1,X2,X4) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mTCTrans) ).

fof(mTCRDef,axiom,
    ! [X1,X2,X3] :
      ( ( aElement0(X3)
        & aRewritingSystem0(X2)
        & aElement0(X1) )
     => ( sdtmndtasgtdt0(X1,X2,X3)
      <=> ( sdtmndtplgtdt0(X1,X2,X3)
          | X1 = X3 ) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mTCRDef) ).

fof(m__,conjecture,
    ( ( sdtmndtasgtdt0(xy,xR,xz)
      & sdtmndtasgtdt0(xx,xR,xy) )
   => sdtmndtasgtdt0(xx,xR,xz) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__) ).

fof(m__349,hypothesis,
    ( aElement0(xz)
    & aElement0(xy)
    & aRewritingSystem0(xR)
    & aElement0(xx) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__349) ).

fof(c_0_4,plain,
    ! [X13,X14,X15,X16] :
      ( sdtmndtplgtdt0(X13,X14,X16)
      | ~ sdtmndtplgtdt0(X15,X14,X16)
      | ~ sdtmndtplgtdt0(X13,X14,X15)
      | ~ aElement0(X16)
      | ~ aElement0(X15)
      | ~ aRewritingSystem0(X14)
      | ~ aElement0(X13) ),
    inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mTCTrans])])]) ).

fof(c_0_5,plain,
    ! [X7,X8,X9] :
      ( ( ~ aElement0(X9)
        | ~ aRewritingSystem0(X8)
        | ~ aElement0(X7)
        | sdtmndtasgtdt0(X7,X8,X9)
        | ~ sdtmndtplgtdt0(X7,X8,X9) )
      & ( ~ aElement0(X9)
        | ~ aRewritingSystem0(X8)
        | ~ aElement0(X7)
        | sdtmndtasgtdt0(X7,X8,X9)
        | X7 != X9 )
      & ( ~ aElement0(X9)
        | ~ aRewritingSystem0(X8)
        | ~ aElement0(X7)
        | sdtmndtplgtdt0(X7,X8,X9)
        | X7 = X9
        | ~ sdtmndtasgtdt0(X7,X8,X9) ) ),
    inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mTCRDef])])])]) ).

fof(c_0_6,negated_conjecture,
    ~ ( ( sdtmndtasgtdt0(xy,xR,xz)
        & sdtmndtasgtdt0(xx,xR,xy) )
     => sdtmndtasgtdt0(xx,xR,xz) ),
    inference(assume_negation,[status(cth)],[m__]) ).

cnf(c_0_7,plain,
    ( ~ sdtmndtplgtdt0(X3,X2,X4)
    | ~ sdtmndtplgtdt0(X1,X2,X3)
    | ~ aElement0(X4)
    | ~ aElement0(X3)
    | ~ aRewritingSystem0(X2)
    | ~ aElement0(X1)
    | sdtmndtplgtdt0(X1,X2,X4) ),
    inference(split_conjunct,[status(thm)],[c_0_4]) ).

cnf(c_0_8,plain,
    ( ~ aElement0(X3)
    | ~ aRewritingSystem0(X2)
    | ~ aElement0(X1)
    | ~ sdtmndtasgtdt0(X1,X2,X3)
    | sdtmndtplgtdt0(X1,X2,X3)
    | X1 = X3 ),
    inference(split_conjunct,[status(thm)],[c_0_5]) ).

fof(c_0_9,negated_conjecture,
    ( ~ sdtmndtasgtdt0(xx,xR,xz)
    & sdtmndtasgtdt0(xy,xR,xz)
    & sdtmndtasgtdt0(xx,xR,xy) ),
    inference(fof_nnf,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_6])]) ).

cnf(c_0_10,plain,
    ( ~ aElement0(X3)
    | ~ aElement0(X1)
    | ~ aElement0(X2)
    | ~ aRewritingSystem0(X4)
    | ~ sdtmndtplgtdt0(X3,X4,X1)
    | ~ sdtmndtasgtdt0(X1,X4,X2)
    | sdtmndtplgtdt0(X3,X4,X2)
    | X1 = X2 ),
    inference(spm,[status(thm)],[c_0_7,c_0_8]) ).

cnf(c_0_11,negated_conjecture,
    sdtmndtasgtdt0(xy,xR,xz),
    inference(split_conjunct,[status(thm)],[c_0_9]) ).

cnf(c_0_12,hypothesis,
    aRewritingSystem0(xR),
    inference(split_conjunct,[status(thm)],[m__349]) ).

cnf(c_0_13,hypothesis,
    aElement0(xz),
    inference(split_conjunct,[status(thm)],[m__349]) ).

cnf(c_0_14,hypothesis,
    aElement0(xy),
    inference(split_conjunct,[status(thm)],[m__349]) ).

cnf(c_0_15,plain,
    ( ~ aElement0(X3)
    | ~ aRewritingSystem0(X2)
    | ~ aElement0(X1)
    | ~ sdtmndtplgtdt0(X1,X2,X3)
    | sdtmndtasgtdt0(X1,X2,X3) ),
    inference(split_conjunct,[status(thm)],[c_0_5]) ).

cnf(c_0_16,negated_conjecture,
    ( ~ aElement0(X1)
    | ~ sdtmndtplgtdt0(X1,xR,xy)
    | sdtmndtplgtdt0(X1,xR,xz)
    | xz = xy ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_10,c_0_11]),c_0_12]),c_0_13]),c_0_14])]) ).

cnf(c_0_17,negated_conjecture,
    ( ~ aElement0(X1)
    | ~ sdtmndtplgtdt0(X1,xR,xy)
    | sdtmndtasgtdt0(X1,xR,xz)
    | xz = xy ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_16]),c_0_12]),c_0_13])]) ).

cnf(c_0_18,negated_conjecture,
    ~ sdtmndtasgtdt0(xx,xR,xz),
    inference(split_conjunct,[status(thm)],[c_0_9]) ).

cnf(c_0_19,negated_conjecture,
    ( ~ aElement0(X1)
    | ~ sdtmndtasgtdt0(X1,xR,xy)
    | sdtmndtasgtdt0(X1,xR,xz)
    | X1 = xy
    | xz = xy ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_8]),c_0_12]),c_0_14])]) ).

cnf(c_0_20,negated_conjecture,
    sdtmndtasgtdt0(xx,xR,xy),
    inference(split_conjunct,[status(thm)],[c_0_9]) ).

cnf(c_0_21,hypothesis,
    aElement0(xx),
    inference(split_conjunct,[status(thm)],[m__349]) ).

cnf(c_0_22,negated_conjecture,
    ( xz = xy
    | xx = xy ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_19]),c_0_20]),c_0_21])]) ).

cnf(c_0_23,negated_conjecture,
    xz = xy,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_22]),c_0_11])]) ).

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

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