TSTP Solution File: RNG050+1 by E-SAT---3.1.00

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : E-SAT---3.1.00
% Problem  : RNG050+1 : TPTP v8.2.0. Released v4.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_E %s %d THM

% Computer : n028.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 21 02:36:49 EDT 2024

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

% Comments : 
%------------------------------------------------------------------------------
fof(m__,conjecture,
    ( ( aDimensionOf0(xs) != sz00
     => sdtlseqdt0(sz0z00,sdtasasdt0(xs,xs)) )
   => sdtlseqdt0(sz0z00,sdtasasdt0(xs,xs)) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__) ).

fof(mDefSPZ,axiom,
    ! [X1,X2] :
      ( ( aVector0(X1)
        & aVector0(X2) )
     => ( ( aDimensionOf0(X1) = aDimensionOf0(X2)
          & aDimensionOf0(X2) = sz00 )
       => sdtasasdt0(X1,X2) = sz0z00 ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',mDefSPZ) ).

fof(m__1542,hypothesis,
    aVector0(xs),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__1542) ).

fof(mLERef,axiom,
    ! [X1] :
      ( aScalar0(X1)
     => sdtlseqdt0(X1,X1) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',mLERef) ).

fof(mSZeroSc,axiom,
    aScalar0(sz0z00),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',mSZeroSc) ).

fof(c_0_5,negated_conjecture,
    ~ ( ( aDimensionOf0(xs) != sz00
       => sdtlseqdt0(sz0z00,sdtasasdt0(xs,xs)) )
     => sdtlseqdt0(sz0z00,sdtasasdt0(xs,xs)) ),
    inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[m__])]) ).

fof(c_0_6,negated_conjecture,
    ( ( aDimensionOf0(xs) = sz00
      | sdtlseqdt0(sz0z00,sdtasasdt0(xs,xs)) )
    & ~ sdtlseqdt0(sz0z00,sdtasasdt0(xs,xs)) ),
    inference(fof_nnf,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_5])]) ).

fof(c_0_7,plain,
    ! [X33,X34] :
      ( ~ aVector0(X33)
      | ~ aVector0(X34)
      | aDimensionOf0(X33) != aDimensionOf0(X34)
      | aDimensionOf0(X34) != sz00
      | sdtasasdt0(X33,X34) = sz0z00 ),
    inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mDefSPZ])])]) ).

cnf(c_0_8,negated_conjecture,
    ( aDimensionOf0(xs) = sz00
    | sdtlseqdt0(sz0z00,sdtasasdt0(xs,xs)) ),
    inference(split_conjunct,[status(thm)],[c_0_6]) ).

cnf(c_0_9,negated_conjecture,
    ~ sdtlseqdt0(sz0z00,sdtasasdt0(xs,xs)),
    inference(split_conjunct,[status(thm)],[c_0_6]) ).

cnf(c_0_10,plain,
    ( sdtasasdt0(X1,X2) = sz0z00
    | ~ aVector0(X1)
    | ~ aVector0(X2)
    | aDimensionOf0(X1) != aDimensionOf0(X2)
    | aDimensionOf0(X2) != sz00 ),
    inference(split_conjunct,[status(thm)],[c_0_7]) ).

cnf(c_0_11,hypothesis,
    aVector0(xs),
    inference(split_conjunct,[status(thm)],[m__1542]) ).

cnf(c_0_12,negated_conjecture,
    aDimensionOf0(xs) = sz00,
    inference(sr,[status(thm)],[c_0_8,c_0_9]) ).

fof(c_0_13,plain,
    ! [X10] :
      ( ~ aScalar0(X10)
      | sdtlseqdt0(X10,X10) ),
    inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mLERef])])]) ).

cnf(c_0_14,hypothesis,
    ( sdtasasdt0(xs,X1) = sz0z00
    | aDimensionOf0(X1) != sz00
    | ~ aVector0(X1) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_10,c_0_11]),c_0_12])]) ).

cnf(c_0_15,plain,
    ( sdtlseqdt0(X1,X1)
    | ~ aScalar0(X1) ),
    inference(split_conjunct,[status(thm)],[c_0_13]) ).

cnf(c_0_16,plain,
    aScalar0(sz0z00),
    inference(split_conjunct,[status(thm)],[mSZeroSc]) ).

cnf(c_0_17,hypothesis,
    sdtasasdt0(xs,xs) = sz0z00,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_11]),c_0_12])]) ).

cnf(c_0_18,plain,
    sdtlseqdt0(sz0z00,sz0z00),
    inference(spm,[status(thm)],[c_0_15,c_0_16]) ).

cnf(c_0_19,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_9,c_0_17]),c_0_18])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem    : RNG050+1 : TPTP v8.2.0. Released v4.0.0.
% 0.07/0.14  % Command    : run_E %s %d THM
% 0.14/0.35  % Computer : n028.cluster.edu
% 0.14/0.35  % Model    : x86_64 x86_64
% 0.14/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35  % Memory   : 8042.1875MB
% 0.14/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35  % CPULimit   : 300
% 0.14/0.35  % WCLimit    : 300
% 0.14/0.35  % DateTime   : Sat May 18 12:16:22 EDT 2024
% 0.14/0.35  % CPUTime    : 
% 0.21/0.48  Running first-order model finding
% 0.21/0.48  Running: /export/starexec/sandbox/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --satauto-schedule=8 --cpu-limit=300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.21/0.50  # Version: 3.1.0
% 0.21/0.50  # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.21/0.50  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.50  # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.21/0.50  # Starting new_bool_3 with 300s (1) cores
% 0.21/0.50  # Starting new_bool_1 with 300s (1) cores
% 0.21/0.50  # Starting sh5l with 300s (1) cores
% 0.21/0.50  # new_bool_1 with pid 23456 completed with status 0
% 0.21/0.50  # Result found by new_bool_1
% 0.21/0.50  # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.21/0.50  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.50  # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.21/0.50  # Starting new_bool_3 with 300s (1) cores
% 0.21/0.50  # Starting new_bool_1 with 300s (1) cores
% 0.21/0.50  # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.21/0.50  # Search class: FGHSF-FFMS21-MFFFFFNN
% 0.21/0.50  # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.21/0.50  # Starting G-E--_208_C18_F1_AE_CS_SP_PI_S0a with 181s (1) cores
% 0.21/0.50  # G-E--_208_C18_F1_AE_CS_SP_PI_S0a with pid 23459 completed with status 0
% 0.21/0.50  # Result found by G-E--_208_C18_F1_AE_CS_SP_PI_S0a
% 0.21/0.50  # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.21/0.50  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.50  # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.21/0.50  # Starting new_bool_3 with 300s (1) cores
% 0.21/0.50  # Starting new_bool_1 with 300s (1) cores
% 0.21/0.50  # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.21/0.50  # Search class: FGHSF-FFMS21-MFFFFFNN
% 0.21/0.50  # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.21/0.50  # Starting G-E--_208_C18_F1_AE_CS_SP_PI_S0a with 181s (1) cores
% 0.21/0.50  # Preprocessing time       : 0.001 s
% 0.21/0.50  
% 0.21/0.50  # Proof found!
% 0.21/0.50  # SZS status Theorem
% 0.21/0.50  # SZS output start CNFRefutation
% See solution above
% 0.21/0.50  # Parsed axioms                        : 39
% 0.21/0.50  # Removed by relevancy pruning/SinE    : 8
% 0.21/0.50  # Initial clauses                      : 39
% 0.21/0.50  # Removed in clause preprocessing      : 5
% 0.21/0.50  # Initial clauses in saturation        : 34
% 0.21/0.50  # Processed clauses                    : 42
% 0.21/0.50  # ...of these trivial                  : 0
% 0.21/0.50  # ...subsumed                          : 0
% 0.21/0.50  # ...remaining for further processing  : 42
% 0.21/0.50  # Other redundant clauses eliminated   : 0
% 0.21/0.50  # Clauses deleted for lack of memory   : 0
% 0.21/0.50  # Backward-subsumed                    : 0
% 0.21/0.50  # Backward-rewritten                   : 1
% 0.21/0.50  # Generated clauses                    : 71
% 0.21/0.50  # ...of the previous two non-redundant : 66
% 0.21/0.50  # ...aggressively subsumed             : 0
% 0.21/0.50  # Contextual simplify-reflections      : 0
% 0.21/0.50  # Paramodulations                      : 67
% 0.21/0.50  # Factorizations                       : 0
% 0.21/0.50  # NegExts                              : 0
% 0.21/0.50  # Equation resolutions                 : 4
% 0.21/0.50  # Disequality decompositions           : 0
% 0.21/0.50  # Total rewrite steps                  : 30
% 0.21/0.50  # ...of those cached                   : 24
% 0.21/0.50  # Propositional unsat checks           : 0
% 0.21/0.50  #    Propositional check models        : 0
% 0.21/0.50  #    Propositional check unsatisfiable : 0
% 0.21/0.50  #    Propositional clauses             : 0
% 0.21/0.50  #    Propositional clauses after purity: 0
% 0.21/0.50  #    Propositional unsat core size     : 0
% 0.21/0.50  #    Propositional preprocessing time  : 0.000
% 0.21/0.50  #    Propositional encoding time       : 0.000
% 0.21/0.50  #    Propositional solver time         : 0.000
% 0.21/0.50  #    Success case prop preproc time    : 0.000
% 0.21/0.50  #    Success case prop encoding time   : 0.000
% 0.21/0.50  #    Success case prop solver time     : 0.000
% 0.21/0.50  # Current number of processed clauses  : 41
% 0.21/0.50  #    Positive orientable unit clauses  : 10
% 0.21/0.50  #    Positive unorientable unit clauses: 0
% 0.21/0.50  #    Negative unit clauses             : 1
% 0.21/0.50  #    Non-unit-clauses                  : 30
% 0.21/0.50  # Current number of unprocessed clauses: 58
% 0.21/0.50  # ...number of literals in the above   : 185
% 0.21/0.50  # Current number of archived formulas  : 0
% 0.21/0.50  # Current number of archived clauses   : 1
% 0.21/0.50  # Clause-clause subsumption calls (NU) : 231
% 0.21/0.50  # Rec. Clause-clause subsumption calls : 72
% 0.21/0.50  # Non-unit clause-clause subsumptions  : 0
% 0.21/0.50  # Unit Clause-clause subsumption calls : 90
% 0.21/0.50  # Rewrite failures with RHS unbound    : 0
% 0.21/0.50  # BW rewrite match attempts            : 1
% 0.21/0.50  # BW rewrite match successes           : 1
% 0.21/0.50  # Condensation attempts                : 0
% 0.21/0.50  # Condensation successes               : 0
% 0.21/0.50  # Termbank termtop insertions          : 4775
% 0.21/0.50  # Search garbage collected termcells   : 702
% 0.21/0.50  
% 0.21/0.50  # -------------------------------------------------
% 0.21/0.50  # User time                : 0.007 s
% 0.21/0.50  # System time              : 0.002 s
% 0.21/0.50  # Total time               : 0.009 s
% 0.21/0.50  # Maximum resident set size: 1852 pages
% 0.21/0.50  
% 0.21/0.50  # -------------------------------------------------
% 0.21/0.50  # User time                : 0.011 s
% 0.21/0.50  # System time              : 0.003 s
% 0.21/0.50  # Total time               : 0.013 s
% 0.21/0.50  # Maximum resident set size: 1736 pages
% 0.21/0.50  % E---3.1 exiting
%------------------------------------------------------------------------------