↑ Up

E---3.5.1.THM-CRf.s

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

% Computer : n002.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:05:44 PM UTC 2026

% Result   : Theorem 0.32s 0.65s
% Output   : CNFRefutation 0.32s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    7
%            Number of leaves      :    8
% Syntax   : Number of formulae    :   24 (  13 unt;   0 def)
%            Number of atoms       :   56 (   3 equ)
%            Maximal formula atoms :    8 (   2 avg)
%            Number of connectives :   57 (  25   ~;  19   |;  10   &)
%                                         (   0 <=>;   3  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   13 (   3 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    4 (   2 usr;   1 prp; 0-2 aty)
%            Number of functors    :   12 (  12 usr;  10 con; 0-2 aty)
%            Number of variables   :   18 (   0 sgn  12   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(m__,conjecture,
    sdtlseqdt0(sdtasdt0(sdtpldt0(xR,xS),sdtpldt0(xR,xS)),sdtasdt0(sdtpldt0(xP,xP),sdtpldt0(xP,xP))),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__) ).

fof(mLEMonM,axiom,
    ! [X1,X2,X3,X4] :
      ( ( aScalar0(X4)
        & aScalar0(X3)
        & aScalar0(X2)
        & aScalar0(X1) )
     => ( ( sdtlseqdt0(X3,X4)
          & sdtlseqdt0(sz0z00,X3)
          & sdtlseqdt0(X1,X2) )
       => sdtlseqdt0(sdtasdt0(X1,X3),sdtasdt0(X2,X4)) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',mLEMonM) ).

fof(m__2628,hypothesis,
    ( sdtlseqdt0(sz0z00,sdtpldt0(xP,xP))
    & sdtlseqdt0(sz0z00,sdtpldt0(xR,xS)) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__2628) ).

fof(m__2610,hypothesis,
    sdtlseqdt0(sdtpldt0(xR,xS),sdtpldt0(xP,xP)),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__2610) ).

fof(mSumSc,axiom,
    ! [X1,X2] :
      ( ( aScalar0(X2)
        & aScalar0(X1) )
     => aScalar0(sdtpldt0(X1,X2)) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',mSumSc) ).

fof(m__1930,hypothesis,
    ( xS = sdtasdt0(xF,xD)
    & aScalar0(xS) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__1930) ).

fof(m__1892,hypothesis,
    ( xR = sdtasdt0(xC,xG)
    & aScalar0(xR) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__1892) ).

fof(m__1911,hypothesis,
    ( xP = sdtasdt0(xE,xH)
    & aScalar0(xP) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__1911) ).

fof(c_0_8,negated_conjecture,
    ~ sdtlseqdt0(sdtasdt0(sdtpldt0(xR,xS),sdtpldt0(xR,xS)),sdtasdt0(sdtpldt0(xP,xP),sdtpldt0(xP,xP))),
    inference(assume_negation,[status(cth)],[m__]) ).

fof(c_0_9,negated_conjecture,
    ~ sdtlseqdt0(sdtasdt0(sdtpldt0(xR,xS),sdtpldt0(xR,xS)),sdtasdt0(sdtpldt0(xP,xP),sdtpldt0(xP,xP))),
    inference(fof_simplification,[status(thm)],[c_0_8]) ).

fof(c_0_10,negated_conjecture,
    ~ sdtlseqdt0(sdtasdt0(sdtpldt0(xR,xS),sdtpldt0(xR,xS)),sdtasdt0(sdtpldt0(xP,xP),sdtpldt0(xP,xP))),
    inference(fof_nnf,[status(thm)],[c_0_9]) ).

fof(c_0_11,plain,
    ! [X47,X48,X49,X50] :
      ( sdtlseqdt0(sdtasdt0(X47,X49),sdtasdt0(X48,X50))
      | ~ sdtlseqdt0(X49,X50)
      | ~ sdtlseqdt0(sz0z00,X49)
      | ~ sdtlseqdt0(X47,X48)
      | ~ aScalar0(X50)
      | ~ aScalar0(X49)
      | ~ aScalar0(X48)
      | ~ aScalar0(X47) ),
    inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mLEMonM])])]) ).

cnf(c_0_12,negated_conjecture,
    ~ sdtlseqdt0(sdtasdt0(sdtpldt0(xR,xS),sdtpldt0(xR,xS)),sdtasdt0(sdtpldt0(xP,xP),sdtpldt0(xP,xP))),
    inference(split_conjunct,[status(thm)],[c_0_10]) ).

cnf(c_0_13,plain,
    ( ~ sdtlseqdt0(X3,X4)
    | ~ sdtlseqdt0(sz0z00,X3)
    | ~ sdtlseqdt0(X1,X2)
    | ~ aScalar0(X4)
    | ~ aScalar0(X3)
    | ~ aScalar0(X2)
    | ~ aScalar0(X1)
    | sdtlseqdt0(sdtasdt0(X1,X3),sdtasdt0(X2,X4)) ),
    inference(split_conjunct,[status(thm)],[c_0_11]) ).

cnf(c_0_14,hypothesis,
    sdtlseqdt0(sz0z00,sdtpldt0(xR,xS)),
    inference(split_conjunct,[status(thm)],[m__2628]) ).

cnf(c_0_15,hypothesis,
    sdtlseqdt0(sdtpldt0(xR,xS),sdtpldt0(xP,xP)),
    inference(split_conjunct,[status(thm)],[m__2610]) ).

fof(c_0_16,plain,
    ! [X15,X16] :
      ( aScalar0(sdtpldt0(X15,X16))
      | ~ aScalar0(X16)
      | ~ aScalar0(X15) ),
    inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mSumSc])])]) ).

cnf(c_0_17,negated_conjecture,
    ( ~ aScalar0(sdtpldt0(xR,xS))
    | ~ aScalar0(sdtpldt0(xP,xP)) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_13]),c_0_14]),c_0_15])]) ).

cnf(c_0_18,plain,
    ( ~ aScalar0(X2)
    | ~ aScalar0(X1)
    | aScalar0(sdtpldt0(X1,X2)) ),
    inference(split_conjunct,[status(thm)],[c_0_16]) ).

cnf(c_0_19,hypothesis,
    aScalar0(xS),
    inference(split_conjunct,[status(thm)],[m__1930]) ).

cnf(c_0_20,hypothesis,
    aScalar0(xR),
    inference(split_conjunct,[status(thm)],[m__1892]) ).

cnf(c_0_21,negated_conjecture,
    ~ aScalar0(sdtpldt0(xP,xP)),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_18]),c_0_19]),c_0_20])]) ).

cnf(c_0_22,hypothesis,
    aScalar0(xP),
    inference(split_conjunct,[status(thm)],[m__1911]) ).

cnf(c_0_23,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_18]),c_0_22])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05  % Problem  : RNG072+2 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.08  % Command  : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.18/0.46  % Computer : n002.cluster.edu
% 0.18/0.46  % Model    : x86_64 x86_64
% 0.18/0.46  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.18/0.46  % Memory   : 8046.5625MB
% 0.18/0.46  % OS       : Linux 6.8.0-71-generic
% 0.18/0.46  % CPULimit : 300
% 0.18/0.46  % WCLimit  : 300
% 0.18/0.46  % DateTime : Mon Sep 21 04:20:03 UTC 2026
% 0.18/0.47  % CPUTime  : 
% 0.18/0.47  Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.23/0.55  Running first-order theorem proving
% 0.23/0.55  Running: /export/starexec/sandbox/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/sandbox/benchmark/theBenchmark.p
% 0.32/0.65  % Version: 3.5.1
% 0.32/0.65  % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.32/0.65  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.32/0.65  % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.32/0.65  % Starting new_bool_3 with 300s (1) cores
% 0.32/0.65  % Starting new_bool_1 with 300s (1) cores
% 0.32/0.65  % Starting sh5l with 300s (1) cores
% 0.32/0.65  % C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 2411704 completed with status 0
% 0.32/0.65  % Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 0.32/0.65  % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.32/0.65  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.32/0.65  % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.32/0.65  % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.32/0.65  % No SInE strategy applied
% 0.32/0.65  % Search class: FGHSF-FFMM21-MFFFFFNN
% 0.32/0.65  % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.32/0.65  % Starting SubtermCWHack with 136s (1) cores
% 0.32/0.65  % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 0.32/0.65  % Starting SAT001_MinMin_p005000_rr_RG with 136s (1) cores
% 0.32/0.65  % Starting G-E--_208_C18_F1_SE_CS_SP_PI_PS_S5PRR_S032N with 136s (1) cores
% 0.32/0.65  % Starting new_bool_3 with 136s (1) cores
% 0.32/0.65  % SAT001_MinMin_p005000_rr_RG with pid 2411713 completed with status 0
% 0.32/0.65  % Result found by SAT001_MinMin_p005000_rr_RG
% 0.32/0.65  % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.32/0.65  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.32/0.65  % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.32/0.65  % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.32/0.65  % No SInE strategy applied
% 0.32/0.65  % Search class: FGHSF-FFMM21-MFFFFFNN
% 0.32/0.65  % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.32/0.65  % Starting SubtermCWHack with 136s (1) cores
% 0.32/0.65  % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 0.32/0.65  % Starting SAT001_MinMin_p005000_rr_RG with 136s (1) cores
% 0.32/0.65  % Preprocessing time       : 0.004 s
% 0.32/0.65  % Presaturation interreduction done
% 0.32/0.65  
% 0.32/0.65  % Proof found!
% 0.32/0.65  % SZS status Theorem
% 0.32/0.65  % SZS output start CNFRefutation
% See solution above
% 0.32/0.65  % Parsed axioms                        : 63
% 0.32/0.65  % Removed by relevancy pruning/SinE    : 0
% 0.32/0.65  % Initial clauses                      : 102
% 0.32/0.65  % Removed in clause preprocessing      : 5
% 0.32/0.65  % Initial clauses in saturation        : 97
% 0.32/0.65  % Processed clauses                    : 230
% 0.32/0.65  % ...of these trivial                  : 1
% 0.32/0.65  % ...subsumed                          : 5
% 0.32/0.65  % ...remaining for further processing  : 224
% 0.32/0.65  % Other redundant clauses eliminated   : 5
% 0.32/0.65  % Clauses deleted for lack of memory   : 0
% 0.32/0.65  % Backward-subsumed                    : 2
% 0.32/0.65  % Backward-rewritten                   : 1
% 0.32/0.65  % Generated clauses                    : 432
% 0.32/0.65  % ...of the previous two non-redundant : 377
% 0.32/0.65  % ...aggressively subsumed             : 0
% 0.32/0.65  % Contextual simplify-reflections      : 0
% 0.32/0.65  % Paramodulations                      : 426
% 0.32/0.65  % Factorizations                       : 0
% 0.32/0.65  % NegExts                              : 0
% 0.32/0.65  % Equation resolutions                 : 6
% 0.32/0.65  % Disequality decompositions           : 0
% 0.32/0.65  % Total rewrite steps                  : 377
% 0.32/0.65  % ...of those cached                   : 346
% 0.32/0.65  % Propositional unsat checks           : 0
% 0.32/0.65  %    Propositional check models        : 0
% 0.32/0.65  %    Propositional check unsatisfiable : 0
% 0.32/0.65  %    Propositional clauses             : 0
% 0.32/0.65  %    Propositional clauses after purity: 0
% 0.32/0.65  %    Propositional unsat core size     : 0
% 0.32/0.65  %    Propositional preprocessing time  : 0.000
% 0.32/0.65  %    Propositional encoding time       : 0.000
% 0.32/0.65  %    Propositional solver time         : 0.000
% 0.32/0.65  %    Success case prop preproc time    : 0.000
% 0.32/0.65  %    Success case prop encoding time   : 0.000
% 0.32/0.65  %    Success case prop solver time     : 0.000
% 0.32/0.65  % Current number of processed clauses  : 121
% 0.32/0.65  %    Positive orientable unit clauses  : 57
% 0.32/0.65  %    Positive unorientable unit clauses: 0
% 0.32/0.65  %    Negative unit clauses             : 4
% 0.32/0.65  %    Non-unit-clauses                  : 60
% 0.32/0.65  % Current number of unprocessed clauses: 328
% 0.32/0.65  % ...number of literals in the above   : 1351
% 0.32/0.65  % Current number of archived formulas  : 0
% 0.32/0.65  % Current number of archived clauses   : 100
% 0.32/0.65  % Clause-clause subsumption calls (NU) : 2238
% 0.32/0.65  % Rec. Clause-clause subsumption calls : 817
% 0.32/0.65  % Non-unit clause-clause subsumptions  : 2
% 0.32/0.65  % Unit Clause-clause subsumption calls : 22
% 0.32/0.65  % Rewrite failures with RHS unbound    : 0
% 0.32/0.65  % BW rewrite match attempts            : 3
% 0.32/0.65  % BW rewrite match successes           : 1
% 0.32/0.65  % Condensation attempts                : 0
% 0.32/0.65  % Condensation successes               : 0
% 0.32/0.65  % Termbank termtop insertions          : 13687
% 0.32/0.65  % Search garbage collected termcells   : 888
% 0.32/0.65  
% 0.32/0.65  % -------------------------------------------------
% 0.32/0.65  % User time                : 0.034 s
% 0.32/0.65  % System time              : 0.010 s
% 0.32/0.65  % Total time               : 0.044 s
% 0.32/0.65  % Maximum resident set size: 3708 pages
% 0.32/0.65  
% 0.32/0.65  % -------------------------------------------------
% 0.32/0.65  % User time                : 0.115 s
% 0.32/0.65  % System time              : 0.034 s
% 0.32/0.65  % Total time               : 0.150 s
% 0.32/0.65  % Maximum resident set size: 4608 pages
% 0.32/0.65  % E exiting
%------------------------------------------------------------------------------