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

View Problem - Process Solution

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

% Computer : n020.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 : Thu Jul 21 00:11:44 EDT 2022

% Result   : Theorem 0.25s 1.43s
% Output   : CNFRefutation 0.25s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    7
%            Number of leaves      :    6
% Syntax   : Number of formulae    :   24 (   9 unt;   0 def)
%            Number of atoms       :   44 (   0 equ)
%            Maximal formula atoms :    3 (   1 avg)
%            Number of connectives :   38 (  18   ~;  15   |;   1   &)
%                                         (   0 <=>;   4  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    6 (   3 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    2 (   1 usr;   1 prp; 0-1 aty)
%            Number of functors    :    5 (   5 usr;   1 con; 0-1 aty)
%            Number of variables   :   23 (   8 sgn  12   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(ax64,axiom,
    ! [X26,X27] :
      ( ( pred_attacker(tuple_T_in_3(X26))
        & pred_attacker(tuple_T_in_1(X27)) )
     => pred_attacker(tuple_T_out_4(name_objective)) ),
    file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',ax64) ).

fof(ax49,axiom,
    ! [X15] :
      ( pred_attacker(X15)
     => pred_attacker(tuple_T_in_3(X15)) ),
    file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',ax49) ).

fof(ax51,axiom,
    ! [X17] :
      ( pred_attacker(X17)
     => pred_attacker(tuple_T_in_1(X17)) ),
    file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',ax51) ).

fof(ax62,axiom,
    ! [X24] : pred_attacker(name_new0x2Dname(X24)),
    file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',ax62) ).

fof(co0,conjecture,
    pred_attacker(name_objective),
    file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',co0) ).

fof(ax46,axiom,
    ! [X12] :
      ( pred_attacker(tuple_T_out_4(X12))
     => pred_attacker(X12) ),
    file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',ax46) ).

fof(c_0_6,plain,
    ! [X28,X29] :
      ( ~ pred_attacker(tuple_T_in_3(X28))
      | ~ pred_attacker(tuple_T_in_1(X29))
      | pred_attacker(tuple_T_out_4(name_objective)) ),
    inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax64])])])]) ).

fof(c_0_7,plain,
    ! [X16] :
      ( ~ pred_attacker(X16)
      | pred_attacker(tuple_T_in_3(X16)) ),
    inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax49])]) ).

cnf(c_0_8,plain,
    ( pred_attacker(tuple_T_out_4(name_objective))
    | ~ pred_attacker(tuple_T_in_1(X1))
    | ~ pred_attacker(tuple_T_in_3(X2)) ),
    inference(split_conjunct,[status(thm)],[c_0_6]) ).

cnf(c_0_9,plain,
    ( pred_attacker(tuple_T_in_3(X1))
    | ~ pred_attacker(X1) ),
    inference(split_conjunct,[status(thm)],[c_0_7]) ).

fof(c_0_10,plain,
    ! [X18] :
      ( ~ pred_attacker(X18)
      | pred_attacker(tuple_T_in_1(X18)) ),
    inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax51])]) ).

cnf(c_0_11,plain,
    ( pred_attacker(tuple_T_out_4(name_objective))
    | ~ pred_attacker(tuple_T_in_1(X1))
    | ~ pred_attacker(X2) ),
    inference(spm,[status(thm)],[c_0_8,c_0_9]) ).

cnf(c_0_12,plain,
    ( pred_attacker(tuple_T_in_1(X1))
    | ~ pred_attacker(X1) ),
    inference(split_conjunct,[status(thm)],[c_0_10]) ).

fof(c_0_13,plain,
    ! [X25] : pred_attacker(name_new0x2Dname(X25)),
    inference(variable_rename,[status(thm)],[ax62]) ).

cnf(c_0_14,plain,
    ( pred_attacker(tuple_T_out_4(name_objective))
    | ~ pred_attacker(X1)
    | ~ pred_attacker(X2) ),
    inference(spm,[status(thm)],[c_0_11,c_0_12]) ).

cnf(c_0_15,plain,
    pred_attacker(name_new0x2Dname(X1)),
    inference(split_conjunct,[status(thm)],[c_0_13]) ).

fof(c_0_16,negated_conjecture,
    ~ pred_attacker(name_objective),
    inference(assume_negation,[status(cth)],[co0]) ).

fof(c_0_17,plain,
    ! [X13] :
      ( ~ pred_attacker(tuple_T_out_4(X13))
      | pred_attacker(X13) ),
    inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax46])]) ).

cnf(c_0_18,plain,
    ( pred_attacker(tuple_T_out_4(name_objective))
    | ~ pred_attacker(X1) ),
    inference(spm,[status(thm)],[c_0_14,c_0_15]) ).

fof(c_0_19,negated_conjecture,
    ~ pred_attacker(name_objective),
    inference(fof_simplification,[status(thm)],[c_0_16]) ).

cnf(c_0_20,plain,
    ( pred_attacker(X1)
    | ~ pred_attacker(tuple_T_out_4(X1)) ),
    inference(split_conjunct,[status(thm)],[c_0_17]) ).

cnf(c_0_21,plain,
    pred_attacker(tuple_T_out_4(name_objective)),
    inference(spm,[status(thm)],[c_0_18,c_0_15]) ).

cnf(c_0_22,negated_conjecture,
    ~ pred_attacker(name_objective),
    inference(split_conjunct,[status(thm)],[c_0_19]) ).

cnf(c_0_23,plain,
    $false,
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_21]),c_0_22]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.13  % Problem  : SWW951+1 : TPTP v8.1.0. Released v7.4.0.
% 0.08/0.14  % Command  : run_ET %s %d
% 0.14/0.35  % Computer : n020.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  : 600
% 0.14/0.35  % DateTime : Sun Jun  5 16:13:07 EDT 2022
% 0.14/0.36  % CPUTime  : 
% 0.25/1.43  # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.25/1.43  # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.25/1.43  # Preprocessing time       : 0.015 s
% 0.25/1.43  
% 0.25/1.43  # Failure: Out of unprocessed clauses!
% 0.25/1.43  # OLD status GaveUp
% 0.25/1.43  # Parsed axioms                        : 66
% 0.25/1.43  # Removed by relevancy pruning/SinE    : 22
% 0.25/1.43  # Initial clauses                      : 44
% 0.25/1.43  # Removed in clause preprocessing      : 0
% 0.25/1.43  # Initial clauses in saturation        : 44
% 0.25/1.43  # Processed clauses                    : 44
% 0.25/1.43  # ...of these trivial                  : 0
% 0.25/1.43  # ...subsumed                          : 0
% 0.25/1.43  # ...remaining for further processing  : 44
% 0.25/1.43  # Other redundant clauses eliminated   : 0
% 0.25/1.43  # Clauses deleted for lack of memory   : 0
% 0.25/1.43  # Backward-subsumed                    : 0
% 0.25/1.43  # Backward-rewritten                   : 0
% 0.25/1.43  # Generated clauses                    : 0
% 0.25/1.43  # ...of the previous two non-trivial   : 0
% 0.25/1.43  # Contextual simplify-reflections      : 0
% 0.25/1.43  # Paramodulations                      : 0
% 0.25/1.43  # Factorizations                       : 0
% 0.25/1.43  # Equation resolutions                 : 0
% 0.25/1.43  # Current number of processed clauses  : 44
% 0.25/1.43  #    Positive orientable unit clauses  : 7
% 0.25/1.43  #    Positive unorientable unit clauses: 0
% 0.25/1.43  #    Negative unit clauses             : 37
% 0.25/1.43  #    Non-unit-clauses                  : 0
% 0.25/1.43  # Current number of unprocessed clauses: 0
% 0.25/1.43  # ...number of literals in the above   : 0
% 0.25/1.43  # Current number of archived formulas  : 0
% 0.25/1.43  # Current number of archived clauses   : 0
% 0.25/1.43  # Clause-clause subsumption calls (NU) : 0
% 0.25/1.43  # Rec. Clause-clause subsumption calls : 0
% 0.25/1.43  # Non-unit clause-clause subsumptions  : 0
% 0.25/1.43  # Unit Clause-clause subsumption calls : 1
% 0.25/1.43  # Rewrite failures with RHS unbound    : 0
% 0.25/1.43  # BW rewrite match attempts            : 0
% 0.25/1.43  # BW rewrite match successes           : 0
% 0.25/1.43  # Condensation attempts                : 0
% 0.25/1.43  # Condensation successes               : 0
% 0.25/1.43  # Termbank termtop insertions          : 622
% 0.25/1.43  
% 0.25/1.43  # -------------------------------------------------
% 0.25/1.43  # User time                : 0.011 s
% 0.25/1.43  # System time              : 0.004 s
% 0.25/1.43  # Total time               : 0.015 s
% 0.25/1.43  # Maximum resident set size: 2724 pages
% 0.25/1.43  # Running protocol protocol_eprover_f171197f65f27d1ba69648a20c844832c84a5dd7 for 23 seconds:
% 0.25/1.43  # Preprocessing time       : 0.015 s
% 0.25/1.43  
% 0.25/1.43  # Proof found!
% 0.25/1.43  # SZS status Theorem
% 0.25/1.43  # SZS output start CNFRefutation
% See solution above
% 0.25/1.43  # Proof object total steps             : 24
% 0.25/1.43  # Proof object clause steps            : 11
% 0.25/1.43  # Proof object formula steps           : 13
% 0.25/1.43  # Proof object conjectures             : 4
% 0.25/1.43  # Proof object clause conjectures      : 1
% 0.25/1.43  # Proof object formula conjectures     : 3
% 0.25/1.43  # Proof object initial clauses used    : 6
% 0.25/1.43  # Proof object initial formulas used   : 6
% 0.25/1.43  # Proof object generating inferences   : 5
% 0.25/1.43  # Proof object simplifying inferences  : 1
% 0.25/1.43  # Training examples: 0 positive, 0 negative
% 0.25/1.43  # Parsed axioms                        : 66
% 0.25/1.43  # Removed by relevancy pruning/SinE    : 0
% 0.25/1.43  # Initial clauses                      : 66
% 0.25/1.43  # Removed in clause preprocessing      : 0
% 0.25/1.43  # Initial clauses in saturation        : 66
% 0.25/1.43  # Processed clauses                    : 81
% 0.25/1.43  # ...of these trivial                  : 1
% 0.25/1.43  # ...subsumed                          : 3
% 0.25/1.43  # ...remaining for further processing  : 77
% 0.25/1.43  # Other redundant clauses eliminated   : 0
% 0.25/1.43  # Clauses deleted for lack of memory   : 0
% 0.25/1.43  # Backward-subsumed                    : 3
% 0.25/1.43  # Backward-rewritten                   : 1
% 0.25/1.43  # Generated clauses                    : 92
% 0.25/1.43  # ...of the previous two non-trivial   : 76
% 0.25/1.43  # Contextual simplify-reflections      : 0
% 0.25/1.43  # Paramodulations                      : 92
% 0.25/1.43  # Factorizations                       : 0
% 0.25/1.43  # Equation resolutions                 : 0
% 0.25/1.43  # Current number of processed clauses  : 73
% 0.25/1.43  #    Positive orientable unit clauses  : 16
% 0.25/1.43  #    Positive unorientable unit clauses: 1
% 0.25/1.43  #    Negative unit clauses             : 37
% 0.25/1.43  #    Non-unit-clauses                  : 19
% 0.25/1.43  # Current number of unprocessed clauses: 19
% 0.25/1.43  # ...number of literals in the above   : 33
% 0.25/1.43  # Current number of archived formulas  : 0
% 0.25/1.43  # Current number of archived clauses   : 4
% 0.25/1.43  # Clause-clause subsumption calls (NU) : 277
% 0.25/1.43  # Rec. Clause-clause subsumption calls : 262
% 0.25/1.43  # Non-unit clause-clause subsumptions  : 6
% 0.25/1.43  # Unit Clause-clause subsumption calls : 54
% 0.25/1.43  # Rewrite failures with RHS unbound    : 0
% 0.25/1.43  # BW rewrite match attempts            : 10
% 0.25/1.43  # BW rewrite match successes           : 9
% 0.25/1.43  # Condensation attempts                : 0
% 0.25/1.43  # Condensation successes               : 0
% 0.25/1.43  # Termbank termtop insertions          : 2284
% 0.25/1.43  
% 0.25/1.43  # -------------------------------------------------
% 0.25/1.43  # User time                : 0.014 s
% 0.25/1.43  # System time              : 0.003 s
% 0.25/1.43  # Total time               : 0.017 s
% 0.25/1.43  # Maximum resident set size: 2920 pages
%------------------------------------------------------------------------------