TSTP Solution File: COM125+1 by ET---2.0

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : ET---2.0
% Problem  : COM125+1 : TPTP v8.1.0. Released v6.4.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_ET %s %d

% Computer : n012.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  : 600s
% DateTime : Fri Jul 15 01:14:28 EDT 2022

% Result   : Theorem 0.23s 1.42s
% Output   : CNFRefutation 0.23s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    6
%            Number of leaves      :    4
% Syntax   : Number of formulae    :   22 (   8 unt;   0 def)
%            Number of atoms       :   70 (  23 equ)
%            Maximal formula atoms :   13 (   3 avg)
%            Number of connectives :   85 (  37   ~;  27   |;  14   &)
%                                         (   0 <=>;   7  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   13 (   6 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    4 (   2 usr;   1 prp; 0-3 aty)
%            Number of functors    :    9 (   9 usr;   7 con; 0-3 aty)
%            Number of variables   :   78 (   9 sgn  48   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof('T-Weak-FreeVar-abs',conjecture,
    ! [X9,X10,X20,X21,X35,X15] :
      ( ( ~ visFreeVar(X9,vabs(X21,X35,veabs))
        & vtcheck(X20,vabs(X21,X35,veabs),X15) )
     => vtcheck(vbind(X9,X10,X20),vabs(X21,X35,veabs),X15) ),
    file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in','T-Weak-FreeVar-abs') ).

fof(isFreeVar1,axiom,
    ! [X15,X1,X4,X9,X14,X11] :
      ( ( X1 = X14
        & X4 = vabs(X9,X15,X11) )
     => ( ( ( X9 != X14
            & visFreeVar(X14,X11) )
         => visFreeVar(X1,X4) )
        & ( visFreeVar(X1,X4)
         => ( X9 != X14
            & visFreeVar(X14,X11) ) ) ) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/COM001+0.ax',isFreeVar1) ).

fof('T-Weak-FreeVar-abs-1',axiom,
    ! [X9,X10,X20,X21,X35,X15] :
      ( ( X9 != X21
        & ~ visFreeVar(X9,vabs(X21,X35,veabs))
        & vtcheck(X20,vabs(X21,X35,veabs),X15) )
     => vtcheck(vbind(X9,X10,X20),vabs(X21,X35,veabs),X15) ),
    file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in','T-Weak-FreeVar-abs-1') ).

fof('T-Weak-FreeVar-abs-2',axiom,
    ! [X9,X10,X20,X21,X35,X15] :
      ( ( X9 = X21
        & ~ visFreeVar(X9,vabs(X21,X35,veabs))
        & vtcheck(X20,vabs(X21,X35,veabs),X15) )
     => vtcheck(vbind(X9,X10,X20),vabs(X21,X35,veabs),X15) ),
    file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in','T-Weak-FreeVar-abs-2') ).

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

fof(c_0_5,plain,
    ! [X16,X17,X18,X19,X20,X21] :
      ( ( X19 = X20
        | ~ visFreeVar(X20,X21)
        | visFreeVar(X17,X18)
        | X17 != X20
        | X18 != vabs(X19,X16,X21) )
      & ( X19 != X20
        | ~ visFreeVar(X17,X18)
        | X17 != X20
        | X18 != vabs(X19,X16,X21) )
      & ( visFreeVar(X20,X21)
        | ~ visFreeVar(X17,X18)
        | X17 != X20
        | X18 != vabs(X19,X16,X21) ) ),
    inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[isFreeVar1])])]) ).

fof(c_0_6,negated_conjecture,
    ( ~ visFreeVar(esk1_0,vabs(esk4_0,esk5_0,veabs))
    & 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(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_simplification,[status(thm)],[c_0_4])])])]) ).

fof(c_0_7,plain,
    ! [X36,X37,X38,X39,X40,X41] :
      ( X36 = X39
      | visFreeVar(X36,vabs(X39,X40,veabs))
      | ~ vtcheck(X38,vabs(X39,X40,veabs),X41)
      | vtcheck(vbind(X36,X37,X38),vabs(X39,X40,veabs),X41) ),
    inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_simplification,[status(thm)],['T-Weak-FreeVar-abs-1'])])]) ).

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

cnf(c_0_9,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_6]) ).

cnf(c_0_10,plain,
    ( vtcheck(vbind(X1,X2,X3),vabs(X4,X5,veabs),X6)
    | visFreeVar(X1,vabs(X4,X5,veabs))
    | X1 = X4
    | ~ vtcheck(X3,vabs(X4,X5,veabs),X6) ),
    inference(split_conjunct,[status(thm)],[c_0_7]) ).

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

cnf(c_0_12,negated_conjecture,
    ~ visFreeVar(esk1_0,vabs(esk4_0,esk5_0,veabs)),
    inference(split_conjunct,[status(thm)],[c_0_6]) ).

fof(c_0_13,plain,
    ! [X36,X37,X38,X39,X40,X41] :
      ( X36 != X39
      | visFreeVar(X36,vabs(X39,X40,veabs))
      | ~ vtcheck(X38,vabs(X39,X40,veabs),X41)
      | vtcheck(vbind(X36,X37,X38),vabs(X39,X40,veabs),X41) ),
    inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_simplification,[status(thm)],['T-Weak-FreeVar-abs-2'])])]) ).

cnf(c_0_14,plain,
    ( X1 != vabs(X2,X3,X4)
    | ~ visFreeVar(X2,X1) ),
    inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_8])]) ).

cnf(c_0_15,negated_conjecture,
    esk4_0 = esk1_0,
    inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_9,c_0_10]),c_0_11])]),c_0_12]) ).

cnf(c_0_16,plain,
    ( vtcheck(vbind(X1,X2,X3),vabs(X4,X5,veabs),X6)
    | visFreeVar(X1,vabs(X4,X5,veabs))
    | ~ vtcheck(X3,vabs(X4,X5,veabs),X6)
    | X1 != X4 ),
    inference(split_conjunct,[status(thm)],[c_0_13]) ).

cnf(c_0_17,plain,
    ~ visFreeVar(X1,vabs(X1,X2,X3)),
    inference(er,[status(thm)],[c_0_14]) ).

cnf(c_0_18,negated_conjecture,
    ~ vtcheck(vbind(esk1_0,esk2_0,esk3_0),vabs(esk1_0,esk5_0,veabs),esk6_0),
    inference(rw,[status(thm)],[c_0_9,c_0_15]) ).

cnf(c_0_19,plain,
    ( vtcheck(vbind(X1,X2,X3),vabs(X1,X4,veabs),X5)
    | ~ vtcheck(X3,vabs(X1,X4,veabs),X5) ),
    inference(sr,[status(thm)],[inference(er,[status(thm)],[c_0_16]),c_0_17]) ).

cnf(c_0_20,negated_conjecture,
    vtcheck(esk3_0,vabs(esk1_0,esk5_0,veabs),esk6_0),
    inference(rw,[status(thm)],[c_0_11,c_0_15]) ).

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12  % Problem  : COM125+1 : TPTP v8.1.0. Released v6.4.0.
% 0.06/0.13  % Command  : run_ET %s %d
% 0.12/0.34  % Computer : n012.cluster.edu
% 0.12/0.34  % Model    : x86_64 x86_64
% 0.12/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34  % Memory   : 8042.1875MB
% 0.12/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34  % CPULimit : 300
% 0.12/0.34  % WCLimit  : 600
% 0.12/0.34  % DateTime : Thu Jun 16 18:14:54 EDT 2022
% 0.12/0.34  % CPUTime  : 
% 0.23/1.42  # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.23/1.42  # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.23/1.42  # Preprocessing time       : 0.019 s
% 0.23/1.42  
% 0.23/1.42  # Proof found!
% 0.23/1.42  # SZS status Theorem
% 0.23/1.42  # SZS output start CNFRefutation
% See solution above
% 0.23/1.42  # Proof object total steps             : 22
% 0.23/1.42  # Proof object clause steps            : 13
% 0.23/1.42  # Proof object formula steps           : 9
% 0.23/1.42  # Proof object conjectures             : 10
% 0.23/1.42  # Proof object clause conjectures      : 7
% 0.23/1.42  # Proof object formula conjectures     : 3
% 0.23/1.42  # Proof object initial clauses used    : 6
% 0.23/1.42  # Proof object initial formulas used   : 4
% 0.23/1.42  # Proof object generating inferences   : 3
% 0.23/1.42  # Proof object simplifying inferences  : 11
% 0.23/1.42  # Training examples: 0 positive, 0 negative
% 0.23/1.42  # Parsed axioms                        : 60
% 0.23/1.42  # Removed by relevancy pruning/SinE    : 38
% 0.23/1.42  # Initial clauses                      : 38
% 0.23/1.42  # Removed in clause preprocessing      : 4
% 0.23/1.42  # Initial clauses in saturation        : 34
% 0.23/1.42  # Processed clauses                    : 54
% 0.23/1.42  # ...of these trivial                  : 0
% 0.23/1.42  # ...subsumed                          : 3
% 0.23/1.42  # ...remaining for further processing  : 51
% 0.23/1.42  # Other redundant clauses eliminated   : 24
% 0.23/1.42  # Clauses deleted for lack of memory   : 0
% 0.23/1.42  # Backward-subsumed                    : 0
% 0.23/1.42  # Backward-rewritten                   : 3
% 0.23/1.42  # Generated clauses                    : 44
% 0.23/1.42  # ...of the previous two non-trivial   : 33
% 0.23/1.42  # Contextual simplify-reflections      : 0
% 0.23/1.42  # Paramodulations                      : 15
% 0.23/1.42  # Factorizations                       : 0
% 0.23/1.42  # Equation resolutions                 : 38
% 0.23/1.42  # Current number of processed clauses  : 33
% 0.23/1.42  #    Positive orientable unit clauses  : 3
% 0.23/1.42  #    Positive unorientable unit clauses: 0
% 0.23/1.42  #    Negative unit clauses             : 6
% 0.23/1.42  #    Non-unit-clauses                  : 24
% 0.23/1.42  # Current number of unprocessed clauses: 13
% 0.23/1.42  # ...number of literals in the above   : 47
% 0.23/1.42  # Current number of archived formulas  : 0
% 0.23/1.42  # Current number of archived clauses   : 3
% 0.23/1.42  # Clause-clause subsumption calls (NU) : 129
% 0.23/1.42  # Rec. Clause-clause subsumption calls : 76
% 0.23/1.42  # Non-unit clause-clause subsumptions  : 1
% 0.23/1.42  # Unit Clause-clause subsumption calls : 26
% 0.23/1.42  # Rewrite failures with RHS unbound    : 0
% 0.23/1.42  # BW rewrite match attempts            : 1
% 0.23/1.42  # BW rewrite match successes           : 1
% 0.23/1.42  # Condensation attempts                : 0
% 0.23/1.42  # Condensation successes               : 0
% 0.23/1.42  # Termbank termtop insertions          : 4101
% 0.23/1.42  
% 0.23/1.42  # -------------------------------------------------
% 0.23/1.42  # User time                : 0.020 s
% 0.23/1.42  # System time              : 0.002 s
% 0.23/1.42  # Total time               : 0.022 s
% 0.23/1.42  # Maximum resident set size: 3140 pages
%------------------------------------------------------------------------------