TSTP Solution File: COM141+1 by E---3.2.0

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : E---3.2.0
% Problem  : COM141+1 : TPTP v8.2.0. Released v6.4.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_E %s %d THM

% Computer : n027.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 : Mon Jun 24 04:54:05 EDT 2024

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

% Comments : 
%------------------------------------------------------------------------------
fof('T-Weak-abs-1',axiom,
    ! [X9,X10,X20,X21,X35,X15] :
      ( ( X9 != X21
        & vlookup(X9,X20) = vnoType
        & vtcheck(X20,vabs(X21,X35,veabs),X15) )
     => vtcheck(vbind(X9,X10,X20),vabs(X21,X35,veabs),X15) ),
    file('/export/starexec/sandbox2/tmp/tmp.idl9tmEf9t/E---3.1_20233.p','T-Weak-abs-1') ).

fof('T-Weak-abs',conjecture,
    ! [X9,X10,X20,X21,X35,X15] :
      ( ( vlookup(X9,X20) = vnoType
        & vtcheck(X20,vabs(X21,X35,veabs),X15) )
     => vtcheck(vbind(X9,X10,X20),vabs(X21,X35,veabs),X15) ),
    file('/export/starexec/sandbox2/tmp/tmp.idl9tmEf9t/E---3.1_20233.p','T-Weak-abs') ).

fof('T-Weak-abs-2',axiom,
    ! [X9,X10,X20,X21,X35,X15] :
      ( ( X9 = X21
        & vlookup(X9,X20) = vnoType
        & vtcheck(X20,vabs(X21,X35,veabs),X15) )
     => vtcheck(vbind(X9,X10,X20),vabs(X21,X35,veabs),X15) ),
    file('/export/starexec/sandbox2/tmp/tmp.idl9tmEf9t/E---3.1_20233.p','T-Weak-abs-2') ).

fof(c_0_3,plain,
    ! [X9,X10,X20,X21,X35,X15] :
      ( ( X9 != X21
        & vlookup(X9,X20) = vnoType
        & vtcheck(X20,vabs(X21,X35,veabs),X15) )
     => vtcheck(vbind(X9,X10,X20),vabs(X21,X35,veabs),X15) ),
    inference(fof_simplification,[status(thm)],['T-Weak-abs-1']) ).

fof(c_0_4,negated_conjecture,
    ~ ! [X9,X10,X20,X21,X35,X15] :
        ( ( vlookup(X9,X20) = vnoType
          & vtcheck(X20,vabs(X21,X35,veabs),X15) )
       => vtcheck(vbind(X9,X10,X20),vabs(X21,X35,veabs),X15) ),
    inference(assume_negation,[status(cth)],['T-Weak-abs']) ).

fof(c_0_5,plain,
    ! [X80,X81,X82,X83,X84,X85] :
      ( X80 != X83
      | vlookup(X80,X82) != vnoType
      | ~ vtcheck(X82,vabs(X83,X84,veabs),X85)
      | vtcheck(vbind(X80,X81,X82),vabs(X83,X84,veabs),X85) ),
    inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],['T-Weak-abs-2'])])]) ).

fof(c_0_6,plain,
    ! [X74,X75,X76,X77,X78,X79] :
      ( X74 = X77
      | vlookup(X74,X76) != vnoType
      | ~ vtcheck(X76,vabs(X77,X78,veabs),X79)
      | vtcheck(vbind(X74,X75,X76),vabs(X77,X78,veabs),X79) ),
    inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_3])])]) ).

fof(c_0_7,negated_conjecture,
    ( vlookup(esk1_0,esk3_0) = vnoType
    & vtcheck(esk3_0,vabs(esk4_0,esk5_0,veabs),esk6_0)
    & ~ vtcheck(vbind(esk1_0,esk2_0,esk3_0),vabs(esk4_0,esk5_0,veabs),esk6_0) ),
    inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_4])])])]) ).

cnf(c_0_8,plain,
    ( vtcheck(vbind(X1,X6,X3),vabs(X2,X4,veabs),X5)
    | X1 != X2
    | vlookup(X1,X3) != vnoType
    | ~ vtcheck(X3,vabs(X2,X4,veabs),X5) ),
    inference(split_conjunct,[status(thm)],[c_0_5]) ).

cnf(c_0_9,plain,
    ( X1 = X2
    | vtcheck(vbind(X1,X6,X3),vabs(X2,X4,veabs),X5)
    | vlookup(X1,X3) != vnoType
    | ~ vtcheck(X3,vabs(X2,X4,veabs),X5) ),
    inference(split_conjunct,[status(thm)],[c_0_6]) ).

cnf(c_0_10,negated_conjecture,
    ~ vtcheck(vbind(esk1_0,esk2_0,esk3_0),vabs(esk4_0,esk5_0,veabs),esk6_0),
    inference(split_conjunct,[status(thm)],[c_0_7]) ).

cnf(c_0_11,plain,
    ( vtcheck(vbind(X1,X2,X3),vabs(X4,X5,veabs),X6)
    | vlookup(X1,X3) != vnoType
    | ~ vtcheck(X3,vabs(X4,X5,veabs),X6) ),
    inference(csr,[status(thm)],[c_0_8,c_0_9]) ).

cnf(c_0_12,negated_conjecture,
    vlookup(esk1_0,esk3_0) = vnoType,
    inference(split_conjunct,[status(thm)],[c_0_7]) ).

cnf(c_0_13,negated_conjecture,
    vtcheck(esk3_0,vabs(esk4_0,esk5_0,veabs),esk6_0),
    inference(split_conjunct,[status(thm)],[c_0_7]) ).

cnf(c_0_14,negated_conjecture,
    $false,
    inference(cn,[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])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12  % Problem    : COM141+1 : TPTP v8.2.0. Released v6.4.0.
% 0.10/0.12  % Command    : run_E %s %d THM
% 0.13/0.33  % Computer : n027.cluster.edu
% 0.13/0.33  % Model    : x86_64 x86_64
% 0.13/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33  % Memory   : 8042.1875MB
% 0.13/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33  % CPULimit   : 300
% 0.13/0.33  % WCLimit    : 300
% 0.13/0.33  % DateTime   : Thu Jun 20 23:24:09 EDT 2024
% 0.13/0.33  % CPUTime    : 
% 0.21/0.48  Running first-order theorem proving
% 0.21/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/tmp/tmp.idl9tmEf9t/E---3.1_20233.p
% 0.21/0.50  # Version: 3.2.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_3 with pid 20314 completed with status 0
% 0.21/0.50  # Result found by new_bool_3
% 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  # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.21/0.50  # Search class: FGUSF-FFMF31-SFFFFFNN
% 0.21/0.50  # partial match(1): FGHSF-FFMF31-SFFFFFNN
% 0.21/0.50  # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.21/0.50  # Starting G-E--_107_C41_F1_PI_AE_Q4_CS_SP_PS_S2U with 168s (1) cores
% 0.21/0.50  # G-E--_107_C41_F1_PI_AE_Q4_CS_SP_PS_S2U with pid 20317 completed with status 0
% 0.21/0.50  # Result found by G-E--_107_C41_F1_PI_AE_Q4_CS_SP_PS_S2U
% 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  # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.21/0.50  # Search class: FGUSF-FFMF31-SFFFFFNN
% 0.21/0.50  # partial match(1): FGHSF-FFMF31-SFFFFFNN
% 0.21/0.50  # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.21/0.50  # Starting G-E--_107_C41_F1_PI_AE_Q4_CS_SP_PS_S2U with 168s (1) cores
% 0.21/0.50  # Preprocessing time       : 0.002 s
% 0.21/0.50  # Presaturation interreduction done
% 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                        : 58
% 0.21/0.50  # Removed by relevancy pruning/SinE    : 33
% 0.21/0.50  # Initial clauses                      : 38
% 0.21/0.50  # Removed in clause preprocessing      : 7
% 0.21/0.50  # Initial clauses in saturation        : 31
% 0.21/0.50  # Processed clauses                    : 63
% 0.21/0.50  # ...of these trivial                  : 0
% 0.21/0.50  # ...subsumed                          : 0
% 0.21/0.50  # ...remaining for further processing  : 63
% 0.21/0.50  # Other redundant clauses eliminated   : 16
% 0.21/0.50  # Clauses deleted for lack of memory   : 0
% 0.21/0.50  # Backward-subsumed                    : 1
% 0.21/0.50  # Backward-rewritten                   : 0
% 0.21/0.50  # Generated clauses                    : 26
% 0.21/0.50  # ...of the previous two non-redundant : 15
% 0.21/0.50  # ...aggressively subsumed             : 0
% 0.21/0.50  # Contextual simplify-reflections      : 1
% 0.21/0.50  # Paramodulations                      : 5
% 0.21/0.50  # Factorizations                       : 0
% 0.21/0.50  # NegExts                              : 0
% 0.21/0.50  # Equation resolutions                 : 29
% 0.21/0.50  # Disequality decompositions           : 0
% 0.21/0.50  # Total rewrite steps                  : 2
% 0.21/0.50  # ...of those cached                   : 0
% 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  : 24
% 0.21/0.50  #    Positive orientable unit clauses  : 2
% 0.21/0.50  #    Positive unorientable unit clauses: 0
% 0.21/0.50  #    Negative unit clauses             : 5
% 0.21/0.50  #    Non-unit-clauses                  : 17
% 0.21/0.50  # Current number of unprocessed clauses: 12
% 0.21/0.50  # ...number of literals in the above   : 39
% 0.21/0.50  # Current number of archived formulas  : 0
% 0.21/0.50  # Current number of archived clauses   : 31
% 0.21/0.50  # Clause-clause subsumption calls (NU) : 96
% 0.21/0.50  # Rec. Clause-clause subsumption calls : 66
% 0.21/0.50  # Non-unit clause-clause subsumptions  : 2
% 0.21/0.50  # Unit Clause-clause subsumption calls : 1
% 0.21/0.50  # Rewrite failures with RHS unbound    : 0
% 0.21/0.50  # BW rewrite match attempts            : 0
% 0.21/0.50  # BW rewrite match successes           : 0
% 0.21/0.50  # Condensation attempts                : 0
% 0.21/0.50  # Condensation successes               : 0
% 0.21/0.50  # Termbank termtop insertions          : 4358
% 0.21/0.50  # Search garbage collected termcells   : 1214
% 0.21/0.50  
% 0.21/0.50  # -------------------------------------------------
% 0.21/0.50  # User time                : 0.008 s
% 0.21/0.50  # System time              : 0.002 s
% 0.21/0.50  # Total time               : 0.011 s
% 0.21/0.50  # Maximum resident set size: 2076 pages
% 0.21/0.50  
% 0.21/0.50  # -------------------------------------------------
% 0.21/0.50  # User time                : 0.012 s
% 0.21/0.50  # System time              : 0.004 s
% 0.21/0.50  # Total time               : 0.016 s
% 0.21/0.50  # Maximum resident set size: 1808 pages
% 0.21/0.50  % E---3.1 exiting
% 0.21/0.50  % E exiting
%------------------------------------------------------------------------------